public class SpaceSavingImpl<T> extends AbstractDataStructure<T,SpaceSavingParameterDefinition> implements CounterBasedDataStructure<T>
DataStructure.TypeFINITE_ITERABLE_DATA_STRUCTURES, FINITE_ITERABLE_POINTER_DATA_STRUCTURES, FINITE_POINTER_DATA_STRUCTURES, INFIITE_DATA_STRUCTURES, ITERABLE_DATA_STRUCTURES, POINTER_DATA_STRUCTURES| Constructor and Description |
|---|
SpaceSavingImpl(java.util.Map<SpaceSavingParameterDefinition,DSParameter<?>> params) |
| Modifier and Type | Method and Description |
|---|---|
java.util.Collection<T> |
add(T t)
add elements to a stream based data structure may lead to removal of
other elements in the data structure If possible, the implementing
algorithm will return a collection of elements.
|
protected java.util.Collection<T> |
clean(T t) |
void |
clear() |
boolean |
contains(java.lang.Object o) |
int |
getCapacity() |
long |
getFrequencyOf(T e) |
java.util.Map<T,java.lang.Integer> |
getMap() |
long |
getSize() |
DataStructure.Type |
getType() |
boolean |
isEmpty() |
java.util.Iterator<T> |
iterator() |
getParameters, getUsedMemoryInBytesclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetParameters, getUsedMemoryInBytespublic SpaceSavingImpl(java.util.Map<SpaceSavingParameterDefinition,DSParameter<?>> params)
public java.util.Collection<T> add(T t)
DataStructureadd in interface DataStructure<T>public void clear()
clear in interface DataStructure<T>public boolean contains(java.lang.Object o)
contains in interface DataStructure<T>public int getCapacity()
getCapacity in interface DataStructure<T>public long getFrequencyOf(T e)
getFrequencyOf in interface DataStructure<T>public java.util.Map<T,java.lang.Integer> getMap()
public long getSize()
getSize in interface DataStructure<T>public DataStructure.Type getType()
getType in interface DataStructure<T>public boolean isEmpty()
isEmpty in interface DataStructure<T>