- All Implemented Interfaces:
CharIntAssociativeContainer,CharIntMap,Iterable<CharIntCursor>
CharIntHashMap.
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 CharIntHashMap as this may result in a runtime deadlock. See HPPC-103 and HPPC-186 for more information.
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionSortedIterationCharIntHashMap(CharIntHashMap delegate, CharComparator comparator) Creates a read-only view with sorted iteration order on the given delegate map.SortedIterationCharIntHashMap(CharIntHashMap delegate, CharIntComparator comparator) Creates a read-only view with sorted iteration order on the given delegate map. -
Method Summary
Modifier and TypeMethodDescriptionintaddTo(char key, int additionValue) An equivalent of callingvoidclear()Clear all keys and values in the container.booleancontainsKey(char key) Returnstrueif this container has an association to a value for the given key.<T extends CharIntProcedure>
TforEach(T procedure) Applies a given procedure to all keys-value pairs in this container.intget(char key) intgetOrDefault(char key, int defaultValue) booleanindexExists(int index) intindexGet(int index) Returns the value associated with an existing key.voidindexInsert(int index, char key, int value) Inserts a key-value pair for a key that is not present in the map.intindexOf(char key) Returns 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).intindexRemove(int index) Removes a key-value pair at an index previously acquired fromCharIntMap.indexOf(char).intindexReplace(int index, int 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.intput(char key, int value) Place a given key and value in the container.intputAll(CharIntAssociativeContainer container) Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.intputAll(Iterable<? extends CharIntCursor> iterable) Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.intputOrAdd(char key, int putValue, int incrementValue) Ifkeyexists,putValueis inserted into the map, otherwise any existing value is incremented byadditionValue.voidrelease()Removes all elements from the collection and additionally releases any internal buffers.intremove(char key) Remove all values at the given key.intremoveAll(CharContainer container) Removes all keys (and associated values) present in a given container.intremoveAll(CharIntPredicate predicate) Removes all keys (and associated values) for which the predicate returnstrue.intremoveAll(CharPredicate predicate) Removes all keys (and associated values) for which the predicate returnstrue.intsize()protected int[]sortIterationOrder(int[] entryIndexes, CharComparator comparator) Sort the iteration order array based on the provided comparator on the keys.protected int[]sortIterationOrder(int[] entryIndexes, CharIntComparator comparator) Sort the iteration order array based on the provided comparator on keys and values.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 com.carrotsearch.hppc.CharIntMap
equals, hashCode, putIfAbsentMethods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
delegate
-
iterationOrder
public final int[] iterationOrder
-
-
Constructor Details
-
SortedIterationCharIntHashMap
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. -
SortedIterationCharIntHashMap
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
Sort the iteration order array based on the provided comparator on keys and values. -
iterator
Description copied from interface:CharIntAssociativeContainerReturns 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.- Specified by:
iteratorin interfaceCharIntAssociativeContainer- Specified by:
iteratorin interfaceIterable<CharIntCursor>
-
containsKey
public boolean containsKey(char key) Description copied from interface:CharIntAssociativeContainerReturnstrueif this container has an association to a value for the given key.- Specified by:
containsKeyin interfaceCharIntAssociativeContainer
-
size
public int size()- Specified by:
sizein interfaceCharIntAssociativeContainer- Returns:
- Returns the current size (number of assigned keys) in the container.
-
isEmpty
public boolean isEmpty()- Specified by:
isEmptyin interfaceCharIntAssociativeContainer- Returns:
- Return
trueif this hash map contains no assigned keys.
-
removeAll
Description copied from interface:CharIntAssociativeContainerRemoves all keys (and associated values) present in a given container. An alias to:keys().removeAll(container)
but with no additional overhead.- Specified by:
removeAllin interfaceCharIntAssociativeContainer- Returns:
- Returns the number of elements actually removed as a result of this call.
-
removeAll
Description copied from interface:CharIntAssociativeContainerRemoves all keys (and associated values) for which the predicate returnstrue.- Specified by:
removeAllin interfaceCharIntAssociativeContainer- Returns:
- Returns the number of elements actually removed as a result of this call.
-
removeAll
Description copied from interface:CharIntAssociativeContainerRemoves all keys (and associated values) for which the predicate returnstrue.- Specified by:
removeAllin interfaceCharIntAssociativeContainer- Returns:
- Returns the number of elements actually removed as a result of this call.
-
forEach
Description copied from interface:CharIntAssociativeContainerApplies a given procedure to all keys-value pairs in this container. Returns the argument (any subclass ofCharIntProcedure. 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 interfaceCharIntAssociativeContainer
-
forEach
Description copied from interface:CharIntAssociativeContainerApplies a given predicate to all keys-value pairs in this container. Returns the argument (any subclass ofCharIntPredicate. 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 interfaceCharIntAssociativeContainer
-
keys
Description copied from interface:CharIntAssociativeContainerReturns 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 interfaceCharIntAssociativeContainer
-
values
Description copied from interface:CharIntAssociativeContainerReturns 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 interfaceCharIntAssociativeContainer
-
get
public int get(char key) - Specified by:
getin interfaceCharIntMap- 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
public int getOrDefault(char key, int defaultValue) - Specified by:
getOrDefaultin interfaceCharIntMap- Returns:
- Returns the value associated with the given key or the provided default value if the key is not associated with any value.
-
put
public int put(char key, int value) Description copied from interface:CharIntMapPlace a given key and value in the container.- Specified by:
putin interfaceCharIntMap- Returns:
- The value previously stored under the given key in the map is returned.
-
putAll
Description copied from interface:CharIntMapPuts all keys from another container to this map, replacing the values of existing keys, if such keys are present.- Specified by:
putAllin interfaceCharIntMap- 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:CharIntMapPuts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.- Specified by:
putAllin interfaceCharIntMap- 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.
-
putOrAdd
public int putOrAdd(char key, int putValue, int incrementValue) Description copied from interface:CharIntMapIfkeyexists,putValueis inserted into the map, otherwise any existing value is incremented byadditionValue.- Specified by:
putOrAddin interfaceCharIntMap- Parameters:
key- The key of the value to adjust.putValue- The value to put ifkeydoes not exist.incrementValue- The value to add to the existing value ifkeyexists.- Returns:
- Returns the current value associated with
key(after changes).
-
addTo
public int addTo(char key, int additionValue) Description copied from interface:CharIntMapAn equivalent of callingputOrAdd(key, additionValue, additionValue);
- Specified by:
addToin interfaceCharIntMap- Parameters:
key- The key of the value to adjust.additionValue- The value to put or add to the existing value ifkeyexists.- Returns:
- Returns the current value associated with
key(after changes).
-
remove
public int remove(char key) Description copied from interface:CharIntMapRemove 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 interfaceCharIntMap
-
indexOf
public int indexOf(char key) Description copied from interface:CharIntMapReturns 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 interfaceCharIntMap- 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 interfaceCharIntMap- Parameters:
index- The index of a given key, as returned fromCharIntMap.indexOf(char).- 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
public int indexGet(int index) Description copied from interface:CharIntMapReturns the value associated with an existing key.- Specified by:
indexGetin interfaceCharIntMap- Parameters:
index- The index of an existing key.- Returns:
- Returns the value currently associated with the key.
- See Also:
-
indexReplace
public int indexReplace(int index, int newValue) Description copied from interface:CharIntMapReplaces the value associated with an existing key and returns any previous value stored for that key.- Specified by:
indexReplacein interfaceCharIntMap- Parameters:
index- The index of an existing key.- Returns:
- Returns the previous value associated with the key.
- See Also:
-
indexInsert
public void indexInsert(int index, char key, int value) Description copied from interface:CharIntMapInserts 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 interfaceCharIntMap- Parameters:
index- The index of a previously non-existing key, as returned fromCharIntMap.indexOf(char).- See Also:
-
indexRemove
public int indexRemove(int index) Description copied from interface:CharIntMapRemoves a key-value pair at an index previously acquired fromCharIntMap.indexOf(char).- Specified by:
indexRemovein interfaceCharIntMap- Parameters:
index- The index of the key to remove, as returned fromCharIntMap.indexOf(char).- Returns:
- Returns the previous value associated with the key.
- See Also:
-
clear
public void clear()Description copied from interface:CharIntMapClear all keys and values in the container.- Specified by:
clearin interfaceCharIntMap- See Also:
-
release
public void release()Description copied from interface:CharIntMapRemoves all elements from the collection and additionally releases any internal buffers. Typically, if the object is to be reused, a simpleCharIntMap.clear()should be a better alternative since it'll avoid reallocation.- Specified by:
releasein interfaceCharIntMap- See Also:
-
visualizeKeyDistribution
Description copied from interface:CharIntMapVisually depict the distribution of keys.- Specified by:
visualizeKeyDistributionin interfaceCharIntMap- 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.
-