Class SortedIterationObjectObjectHashMap<KType,VType>
- All Implemented Interfaces:
ObjectObjectAssociativeContainer<KType,,VType> ObjectObjectMap<KType,,VType> Iterable<ObjectObjectCursor<KType,VType>>
ObjectObjectHashMap.
In its constructor, this view creates its own iteration order array and sorts it, which is in O(n.log(n)) of the size of the delegate map. Afterward, calls to any method have the same performance as the delegate map.
This view is read-only. In addition, the delegate map must not be modified while the view is used, otherwise the iteration is undefined.
Since this view provides a fixed iteration order, it must not be used to add entries to
another ObjectObjectHashMap as this may result in a runtime deadlock. See HPPC-103 and HPPC-186 for more information.
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionSortedIterationObjectObjectHashMap(ObjectObjectHashMap<KType, VType> delegate, ObjectObjectComparator<KType, VType> comparator) Creates a read-only view with sorted iteration order on the given delegate map.SortedIterationObjectObjectHashMap(ObjectObjectHashMap<KType, VType> delegate, Comparator<KType> comparator) Creates a read-only view with sorted iteration order on the given delegate map. -
Method Summary
Modifier and TypeMethodDescriptionvoidclear()Clear all keys and values in the container.booleancontainsKey(KType key) Returnstrueif this container has an association to a value for the given key.<T extends ObjectObjectProcedure<? super KType,? super VType>>
TforEach(T procedure) Applies a given procedure to all keys-value pairs in this container.getOrDefault(KType key, VType defaultValue) booleanindexExists(int index) indexGet(int index) Returns the value associated with an existing key.voidindexInsert(int index, KType key, VType value) Inserts a key-value pair for a key that is not present in the map.intReturns a logical "index" of a given key that can be used to speed up follow-up value setters or getters in certain scenarios (conditional logic).indexRemove(int index) Removes a key-value pair at an index previously acquired fromObjectObjectMap.indexOf(KType).indexReplace(int index, VType newValue) Replaces the value associated with an existing key and returns any previous value stored for that key.booleanisEmpty()iterator()Returns a cursor over the entries (key-value pairs) in this map.keys()Returns a collection of keys of this container.Place a given key and value in the container.intputAll(ObjectObjectAssociativeContainer<? extends KType, ? extends VType> container) Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.intputAll(Iterable<? extends ObjectObjectCursor<? extends KType, ? extends VType>> iterable) Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.voidrelease()Removes all elements from the collection and additionally releases any internal buffers.Remove all values at the given key.intremoveAll(ObjectContainer<? super KType> container) Removes all keys (and associated values) present in a given container.intremoveAll(ObjectObjectPredicate<? super KType, ? super VType> predicate) Removes all keys (and associated values) for which the predicate returnstrue.intremoveAll(ObjectPredicate<? super KType> predicate) Removes all keys (and associated values) for which the predicate returnstrue.intsize()protected int[]sortIterationOrder(int[] entryIndexes, ObjectObjectComparator<KType, VType> comparator) Sort the iteration order array based on the provided comparator on keys and values.protected int[]sortIterationOrder(int[] entryIndexes, Comparator<KType> comparator) Sort the iteration order array based on the provided comparator on the keys.values()Returns a container view of all values present in this container.visualizeKeyDistribution(int characters) Visually depict the distribution of keys.Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface java.lang.Iterable
forEach, spliteratorMethods inherited from interface com.carrotsearch.hppc.ObjectObjectMap
equals, hashCode, putIfAbsent
-
Field Details
-
delegate
-
iterationOrder
public final int[] iterationOrder
-
-
Constructor Details
-
SortedIterationObjectObjectHashMap
public SortedIterationObjectObjectHashMap(ObjectObjectHashMap<KType, VType> delegate, Comparator<KType> comparator) Creates a read-only view with sorted iteration order on the given delegate map. The ordering is based on the provided comparator on the keys. -
SortedIterationObjectObjectHashMap
public SortedIterationObjectObjectHashMap(ObjectObjectHashMap<KType, VType> delegate, ObjectObjectComparator<KType, VType> comparator) Creates a read-only view with sorted iteration order on the given delegate map. The ordering is based on the provided comparator on keys and values.
-
-
Method Details
-
sortIterationOrder
Sort the iteration order array based on the provided comparator on the keys. -
sortIterationOrder
protected int[] sortIterationOrder(int[] entryIndexes, ObjectObjectComparator<KType, VType> comparator) Sort the iteration order array based on the provided comparator on keys and values. -
iterator
Description copied from interface:ObjectObjectAssociativeContainerReturns a cursor over the entries (key-value pairs) in this map. The iterator is implemented as a cursor and it returns the same cursor instance on every call toIterator.next(). To read the current key and value use the cursor's public fields. An example is shown below.for (IntShortCursor c : intShortMap) { System.out.println("index=" + c.index + " key=" + c.key + " value=" + c.value); }The
indexfield inside the cursor gives the internal index inside the container's implementation. The interpretation of this index depends on to the container. -
containsKey
Description copied from interface:ObjectObjectAssociativeContainerReturnstrueif this container has an association to a value for the given key.- Specified by:
containsKeyin interfaceObjectObjectAssociativeContainer<KType,VType>
-
size
public int size()- Specified by:
sizein interfaceObjectObjectAssociativeContainer<KType,VType> - Returns:
- Returns the current size (number of assigned keys) in the container.
-
isEmpty
public boolean isEmpty()- Specified by:
isEmptyin interfaceObjectObjectAssociativeContainer<KType,VType> - Returns:
- Return
trueif this hash map contains no assigned keys.
-
removeAll
Description copied from interface:ObjectObjectAssociativeContainerRemoves all keys (and associated values) present in a given container. An alias to:keys().removeAll(container)
but with no additional overhead.- Specified by:
removeAllin interfaceObjectObjectAssociativeContainer<KType,VType> - Returns:
- Returns the number of elements actually removed as a result of this call.
-
removeAll
Description copied from interface:ObjectObjectAssociativeContainerRemoves all keys (and associated values) for which the predicate returnstrue.- Specified by:
removeAllin interfaceObjectObjectAssociativeContainer<KType,VType> - Returns:
- Returns the number of elements actually removed as a result of this call.
-
removeAll
Description copied from interface:ObjectObjectAssociativeContainerRemoves all keys (and associated values) for which the predicate returnstrue.- Specified by:
removeAllin interfaceObjectObjectAssociativeContainer<KType,VType> - Returns:
- Returns the number of elements actually removed as a result of this call.
-
forEach
Description copied from interface:ObjectObjectAssociativeContainerApplies a given procedure to all keys-value pairs in this container. Returns the argument (any subclass ofObjectObjectProcedure. This lets the caller call methods of the argument by chaining the call (even if the argument is an anonymous type) to retrieve computed values.- Specified by:
forEachin interfaceObjectObjectAssociativeContainer<KType,VType>
-
forEach
Description copied from interface:ObjectObjectAssociativeContainerApplies a given predicate to all keys-value pairs in this container. Returns the argument (any subclass ofObjectObjectPredicate. This lets the caller call methods of the argument by chaining the call (even if the argument is an anonymous type) to retrieve computed values.The iteration is continued as long as the predicate returns
true.- Specified by:
forEachin interfaceObjectObjectAssociativeContainer<KType,VType>
-
keys
Description copied from interface:ObjectObjectAssociativeContainerReturns a collection of keys of this container. The returned collection is a view over the key set and any modifications (if allowed) introduced to the collection will propagate to the associative container immediately.- Specified by:
keysin interfaceObjectObjectAssociativeContainer<KType,VType>
-
values
Description copied from interface:ObjectObjectAssociativeContainerReturns a container view of all values present in this container. The returned collection is a view over the key set and any modifications (if allowed) introduced to the collection will propagate to the associative container immediately.- Specified by:
valuesin interfaceObjectObjectAssociativeContainer<KType,VType>
-
get
- Specified by:
getin interfaceObjectObjectMap<KType,VType> - Returns:
- Returns the value associated with the given key or the default value for the value
type, if the key is not associated with any value. For numeric value types, this default
value is 0, for object types it is
null.
-
getOrDefault
- Specified by:
getOrDefaultin interfaceObjectObjectMap<KType,VType> - Returns:
- Returns the value associated with the given key or the provided default value if the key is not associated with any value.
-
put
Description copied from interface:ObjectObjectMapPlace a given key and value in the container.- Specified by:
putin interfaceObjectObjectMap<KType,VType> - Returns:
- The value previously stored under the given key in the map is returned.
-
putAll
Description copied from interface:ObjectObjectMapPuts all keys from another container to this map, replacing the values of existing keys, if such keys are present.- Specified by:
putAllin interfaceObjectObjectMap<KType,VType> - Returns:
- Returns the number of keys added to the map as a result of this call (not previously present in the map). Values of existing keys are overwritten.
-
putAll
Description copied from interface:ObjectObjectMapPuts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.- Specified by:
putAllin interfaceObjectObjectMap<KType,VType> - Returns:
- Returns the number of keys added to the map as a result of this call (not previously present in the map). Values of existing keys are overwritten.
-
remove
Description copied from interface:ObjectObjectMapRemove all values at the given key. The default value for the key type is returned if the value does not exist in the map.- Specified by:
removein interfaceObjectObjectMap<KType,VType>
-
indexOf
Description copied from interface:ObjectObjectMapReturns a logical "index" of a given key that can be used to speed up follow-up value setters or getters in certain scenarios (conditional logic).The semantics of "indexes" are not strictly defined. Indexes may (and typically won't be) contiguous.
The index is valid only between map modifications (it will not be affected by read-only operations like iteration or value retrievals).
- Specified by:
indexOfin interfaceObjectObjectMap<KType,VType> - Parameters:
key- The key to locate in the map.- Returns:
- A non-negative value of the logical "index" of the key in the map or a negative value if the key did not exist.
- See Also:
-
indexExists
public boolean indexExists(int index) - Specified by:
indexExistsin interfaceObjectObjectMap<KType,VType> - Parameters:
index- The index of a given key, as returned fromObjectObjectMap.indexOf(KType).- Returns:
- Returns
trueif the index corresponds to an existing key or false otherwise. This is equivalent to checking whether the index is a positive value (existing keys) or a negative value (non-existing keys). - See Also:
-
indexGet
Description copied from interface:ObjectObjectMapReturns the value associated with an existing key.- Specified by:
indexGetin interfaceObjectObjectMap<KType,VType> - Parameters:
index- The index of an existing key.- Returns:
- Returns the value currently associated with the key.
- See Also:
-
indexReplace
Description copied from interface:ObjectObjectMapReplaces the value associated with an existing key and returns any previous value stored for that key.- Specified by:
indexReplacein interfaceObjectObjectMap<KType,VType> - Parameters:
index- The index of an existing key.- Returns:
- Returns the previous value associated with the key.
- See Also:
-
indexInsert
Description copied from interface:ObjectObjectMapInserts a key-value pair for a key that is not present in the map. This method may help in avoiding double recalculation of the key's hash.- Specified by:
indexInsertin interfaceObjectObjectMap<KType,VType> - Parameters:
index- The index of a previously non-existing key, as returned fromObjectObjectMap.indexOf(KType).- See Also:
-
indexRemove
Description copied from interface:ObjectObjectMapRemoves a key-value pair at an index previously acquired fromObjectObjectMap.indexOf(KType).- Specified by:
indexRemovein interfaceObjectObjectMap<KType,VType> - Parameters:
index- The index of the key to remove, as returned fromObjectObjectMap.indexOf(KType).- Returns:
- Returns the previous value associated with the key.
- See Also:
-
clear
public void clear()Description copied from interface:ObjectObjectMapClear all keys and values in the container.- Specified by:
clearin interfaceObjectObjectMap<KType,VType> - See Also:
-
release
public void release()Description copied from interface:ObjectObjectMapRemoves all elements from the collection and additionally releases any internal buffers. Typically, if the object is to be reused, a simpleObjectObjectMap.clear()should be a better alternative since it'll avoid reallocation.- Specified by:
releasein interfaceObjectObjectMap<KType,VType> - See Also:
-
visualizeKeyDistribution
Description copied from interface:ObjectObjectMapVisually depict the distribution of keys.- Specified by:
visualizeKeyDistributionin interfaceObjectObjectMap<KType,VType> - Parameters:
characters- The number of characters to "squeeze" the entire buffer into.- Returns:
- Returns a sequence of characters where '.' depicts an empty fragment of the internal buffer and 'X' depicts full or nearly full capacity within the buffer's range and anything between 1 and 9 is between.
-