Skip navigation links
C E F G I K L M N P R S V 

C

clear() - Method in class net.openhft.smoothie.SmoothieMap
Removes all of the mappings from this map.
clone() - Method in class net.openhft.smoothie.SmoothieMap
Returns a shallow copy of this SmoothieMap instance: the keys and values themselves are not cloned.
compute(K, BiFunction<? super K, ? super V, ? extends V>) - Method in class net.openhft.smoothie.SmoothieMap
Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping).
computeIfAbsent(K, Function<? super K, ? extends V>) - Method in class net.openhft.smoothie.SmoothieMap
If the specified key is not already associated with a value (or is mapped to null), attempts to compute its value using the given mapping function and enters it into this map unless null.
computeIfPresent(K, BiFunction<? super K, ? super V, ? extends V>) - Method in class net.openhft.smoothie.SmoothieMap
If the value for the specified key is present and non-null, attempts to compute a new mapping given the key and its current mapped value.
containsEntry(Object, Object) - Method in class net.openhft.smoothie.SmoothieMap
Returns true if this map contains a mapping of the given key and value.
containsKey(Object) - Method in class net.openhft.smoothie.SmoothieMap
Returns true if this map contains a mapping for the specified key.
containsValue(Object) - Method in class net.openhft.smoothie.SmoothieMap
Returns true if this map maps one or more keys to the specified value.

E

entrySet() - Method in class net.openhft.smoothie.SmoothieMap
Returns a Set view of the mappings contained in this map.

F

forEach(BiConsumer<? super K, ? super V>) - Method in class net.openhft.smoothie.SmoothieMap
Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.
forEachWhile(BiPredicate<? super K, ? super V>) - Method in class net.openhft.smoothie.SmoothieMap
Checks the given predicate on each entry in this map until all entries have been processed or the predicate returns false for some entry, or throws an Exception.

G

get(Object) - Method in class net.openhft.smoothie.SmoothieMap
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
getOrDefault(Object, V) - Method in class net.openhft.smoothie.SmoothieMap
Returns the value to which the specified key is mapped, or defaultValue if this map contains no mapping for the key.

I

isEmpty() - Method in class net.openhft.smoothie.SmoothieMap
Returns true if this map contains no key-value mappings.

K

keyHashCode(Object) - Method in class net.openhft.smoothie.SmoothieMap
Returns hash code for the given key.
keysEqual(Object, K) - Method in class net.openhft.smoothie.SmoothieMap
Returns true if the two given key objects should be considered equal for this SmoothieMap.
keySet() - Method in class net.openhft.smoothie.SmoothieMap
Returns a Set view of the keys contained in this map.

L

LONG_PHI_MAGIC - Static variable in class net.openhft.smoothie.SmoothieMap
The value for spreading low bits of hash code to high.

M

merge(K, V, BiFunction<? super V, ? super V, ? extends V>) - Method in class net.openhft.smoothie.SmoothieMap
If the specified key is not already associated with a value or is associated with null, associates it with the given non-null value.

N

net.openhft.smoothie - package net.openhft.smoothie
 

P

put(K, V) - Method in class net.openhft.smoothie.SmoothieMap
Associates the specified value with the specified key in this map.
putAll(Map<? extends K, ? extends V>) - Method in class net.openhft.smoothie.SmoothieMap
Copies all of the mappings from the specified map to this map.
putIfAbsent(K, V) - Method in class net.openhft.smoothie.SmoothieMap
If the specified key is not already associated with a value (or is mapped to null) associates it with the given value and returns null, else returns the current value.

R

remove(Object) - Method in class net.openhft.smoothie.SmoothieMap
Removes the mapping for a key from this map if it is present.
remove(Object, Object) - Method in class net.openhft.smoothie.SmoothieMap
Removes the entry for the specified key only if it is currently mapped to the specified value.
removeIf(BiPredicate<? super K, ? super V>) - Method in class net.openhft.smoothie.SmoothieMap
Removes all of the entries of this map that satisfy the given predicate.
replace(K, V) - Method in class net.openhft.smoothie.SmoothieMap
Replaces the entry for the specified key only if it is currently mapped to some value.
replace(K, V, V) - Method in class net.openhft.smoothie.SmoothieMap
Replaces the entry for the specified key only if currently mapped to the specified value.
replaceAll(BiFunction<? super K, ? super V, ? extends V>) - Method in class net.openhft.smoothie.SmoothieMap
Replaces each entry's value with the result of invoking the given function on that entry until all entries have been processed or the function throws an exception.

S

size() - Method in class net.openhft.smoothie.SmoothieMap
Returns the number of key-value mappings in this map.
sizeAsLong() - Method in class net.openhft.smoothie.SmoothieMap
Returns the number of entries in the map, as a long value (not truncated to Integer.MAX_VALUE, if the map size exceeds it, as returned by size() method).
SmoothieMap<K,V> - Class in net.openhft.smoothie
Unordered Map with worst put latencies more than 100 times smaller than in ordinary hash table implementations like HashMap.
SmoothieMap() - Constructor for class net.openhft.smoothie.SmoothieMap
Creates a new, empty SmoothieMap.
SmoothieMap(long) - Constructor for class net.openhft.smoothie.SmoothieMap
Creates a new, empty SmoothieMap accommodating the specified number of elements without the need to dynamically resize.
SmoothieMap(Map<? extends K, ? extends V>) - Constructor for class net.openhft.smoothie.SmoothieMap
Creates a new SmoothieMap with the same mappings as the given map.

V

values() - Method in class net.openhft.smoothie.SmoothieMap
Returns a Collection view of the values contained in this map.
valuesEqual(Object, V) - Method in class net.openhft.smoothie.SmoothieMap
Returns true if the two given value objects should be considered equal for this map.
C E F G I K L M N P R S V 
Skip navigation links

Copyright © 2015–2016. All rights reserved.