org.mapdb

Class HTreeMap<K,V>

org.mapdb.HTreeMap<K,V>

All Implemented Interfaces:

ConcurrencyAware, MapExtra<K,V>, Verifiable

public class HTreeMap<K,V>
implements ConcurrencyAware, MapExtra<K,V>, Verifiable

Concurrent HashMap which uses IndexTree for hash table

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	HTreeMap.Companion
static class	HTreeMap.KeySet<K>

Nested classes/interfaces inherited from interface org.mapdb.ConcurrencyAware

ConcurrencyAware.DefaultImpls

Field Summary

Fields

Modifier and Type	Field and Description
static HTreeMap.Companion	Companion

Constructor Summary

Constructors

Constructor and Description

HTreeMap(Serializer<K> keySerializer, Serializer<V> valueSerializer, boolean valueInline, int concShift, int dirShift, int levels, Store[] stores, NonExistentClass[] indexTrees, int hashSeed, long[] counterRecids, long expireCreateTTL, long expireUpdateTTL, long expireGetTTL, long expireMaxSize, long expireStoreSize, QueueLong[] expireCreateQueues, QueueLong[] expireUpdateQueues, QueueLong[] expireGetQueues, java.util.concurrent.ScheduledExecutorService expireExecutor, long expireExecutorPeriod, java.lang.Double expireCompactThreshold, boolean isThreadSafe, Function1<? super K,? extends V> valueLoader, MapModificationListener<K,V>[] modificationListeners, java.io.Closeable closeable, boolean hasValues) Concurrent HashMap which uses IndexTree for hash table

Method Summary

Modifier and Type	Method and Description
NonExistentClass	calculateCollisionSize() calculates number of collisions and total size of this set.
void	checkThreadSafe() checks all subcomponents, if this component is really thread safe, and throws an exception if not thread safe
void	clear()
void	clear(int notifyListeners)
void	clear2(boolean notifyListeners) Deprecated.
void	clearWithExpire() Removes all entries from this Map, and notifies listeners as if content has expired. This will cause expired content to overflow to secondary collections etc
void	clearWithoutNotification() Removes all entries from this Map, but does not notify modification listeners
void	close()
boolean	containsKey(java.lang.Object key)
boolean	containsValue(java.lang.Object value)
java.util.Set	entrySet()
boolean	equals(java.lang.Object other)
void	expireEvict() releases old stuff from queue
void	expireEvictEntry(int segment, long leafRecid, long nodeRecid)
void	expireEvictSegment(int segment)
long	expireId(long nodeRecid, long queue)
long	expireNodeRecidFor(long expireId)
QueueLong	expireQueueFor(int segment, long expireId)
void	forEach(java.util.function.BiConsumer<? super K,? super V> action)
void	forEachKey(Function1<? super K,Unit> action)
void	forEachValue(Function1<? super V,Unit> action)
V	get(java.lang.Object key)
int	getConcShift()
long[]	getCounterRecids()
int	getDirShift()
java.util.Set<java.util.Map.Entry>	getEntries()
java.lang.Double	getExpireCompactThreshold()
QueueLong[]	getExpireCreateQueues()
long	getExpireCreateTTL()
java.util.concurrent.ScheduledExecutorService	getExpireExecutor()
long	getExpireExecutorPeriod()
QueueLong[]	getExpireGetQueues()
long	getExpireGetTTL()
long	getExpireMaxSize()
long	getExpireStoreSize()
QueueLong[]	getExpireUpdateQueues()
long	getExpireUpdateTTL()
boolean	getHasValues()
NonExistentClass[]	getIndexTrees()
Serializer<K>	getKeySerializer()
HTreeMap.KeySet<K>	getKeys()
Serializer<kotlin.Array[]>	getLeafSerializer()
int	getLevels()
java.util.concurrent.locks.ReadWriteLock[]	getLocks()
int	getSize()
Store[]	getStores()
boolean	getValueInline()
Function1<K,V>	getValueLoader()
Serializer<V>	getValueSerializer()
java.util.Collection<V>	getValues()
V	getprotected(int hash, K key, boolean updateQueue)
int	hash(K key)
int	hashCode()
long	hashToIndex(int hash)
int	hashToSegment(int hash)
java.util.Map.Entry<K,V>	htreeEntry(K key, V valueOrig)
<E> java.util.Iterator<E>	htreeIterator(int segment, Function2<java.lang.Object,java.lang.Object,? extends E> loadNext)
boolean	isClosed()
boolean	isEmpty()
boolean	isForegroundEviction() true if Eviction is executed inside user thread, as part of get/put etc operations
boolean	isThreadSafe() returns true if this is configured to be thread safe
java.util.Set	keySet()
java.lang.Object[]	leafGet(Store store, long leafRecid)
void	listenerNotify(K key, V oldValue, V newValue, boolean triggered)
V	put(K key, V value)
void	putAll(java.util.Map<? extends K,? extends V> from)
V	putIfAbsent(K key, V value)
boolean	putIfAbsentBoolean(K key, V value) Atomically associates the specified key with the given value if it is not already associated with a value.
V	putprotected(int hash, K key, V value, boolean triggered)
V	remove(java.lang.Object key)
boolean	remove(java.lang.Object key, java.lang.Object value)
V	removeprotected(int hash, K key, boolean evicted)
boolean	replace(K key, V oldValue, V newValue)
V	replace(K key, V value)
int	size()
long	sizeLong() map size as long number
V	valueUnwrap(int segment, java.lang.Object wrappedValue)
java.lang.Object	valueWrap(int segment, V value)
java.util.Collection	values()
void	verify()

Methods inherited from interface org.mapdb.ConcurrencyAware

checkThreadSafe, isThreadSafe

Methods inherited from interface org.mapdb.MapExtra

forEach, forEachKey, forEachValue, getKeySerializer, getValueSerializer, isClosed, putIfAbsentBoolean, sizeLong

Methods inherited from interface org.mapdb.Verifiable

verify

Field Detail

Companion

public static HTreeMap.Companion Companion

Constructor Detail

HTreeMap

public HTreeMap(Serializer<K> keySerializer,
                Serializer<V> valueSerializer,
                boolean valueInline,
                int concShift,
                int dirShift,
                int levels,
                Store[] stores,
                NonExistentClass[] indexTrees,
                int hashSeed,
                long[] counterRecids,
                long expireCreateTTL,
                long expireUpdateTTL,
                long expireGetTTL,
                long expireMaxSize,
                long expireStoreSize,
                QueueLong[] expireCreateQueues,
                QueueLong[] expireUpdateQueues,
                QueueLong[] expireGetQueues,
                java.util.concurrent.ScheduledExecutorService expireExecutor,
                long expireExecutorPeriod,
                java.lang.Double expireCompactThreshold,
                boolean isThreadSafe,
                Function1<? super K,? extends V> valueLoader,
                MapModificationListener<K,V>[] modificationListeners,
                java.io.Closeable closeable,
                boolean hasValues)

Concurrent HashMap which uses IndexTree for hash table

Parameters:

isThreadSafe - returns true if this is configured to be thread safe

Method Detail

getLocks

public java.util.concurrent.locks.ReadWriteLock[] getLocks()

isForegroundEviction

public boolean isForegroundEviction()

true if Eviction is executed inside user thread, as part of get/put etc operations

getLeafSerializer

public Serializer<kotlin.Array[]> getLeafSerializer()

hash

public int hash(K key)

hashToIndex

public long hashToIndex(int hash)

hashToSegment

public int hashToSegment(int hash)

put

public V put(K key,
             V value)

putprotected

public V putprotected(int hash,
                      K key,
                      V value,
                      boolean triggered)

putAll

public void putAll(java.util.Map<? extends K,? extends V> from)

remove

public V remove(java.lang.Object key)

removeprotected

public V removeprotected(int hash,
                         K key,
                         boolean evicted)

clear

public void clear()

clear2

public void clear2(boolean notifyListeners)

Deprecated.

clearWithoutNotification

public void clearWithoutNotification()

Removes all entries from this Map, but does not notify modification listeners

clearWithExpire

public void clearWithExpire()

Removes all entries from this Map, and notifies listeners as if content has expired. This will cause expired content to overflow to secondary collections etc

clear

public void clear(int notifyListeners)

containsKey

public boolean containsKey(java.lang.Object key)

containsValue

public boolean containsValue(java.lang.Object value)

get

public V get(java.lang.Object key)

getprotected

public V getprotected(int hash,
                      K key,
                      boolean updateQueue)

isEmpty

public boolean isEmpty()

getSize

public int getSize()

size

public int size()

sizeLong

public long sizeLong()

map size as long number

putIfAbsent

public V putIfAbsent(K key,
                     V value)

putIfAbsentBoolean

public boolean putIfAbsentBoolean(K key,
                                  V value)

Atomically associates the specified key with the given value if it is not already associated with a value.

This is equivalent to: if(cache.containsKey(key)){}cache.put(key,value);return true;}else{return false;} * except that the action is performed atomically.

Throws:

remove

public boolean remove(java.lang.Object key,
                      java.lang.Object value)

replace

public boolean replace(K key,
                       V oldValue,
                       V newValue)

replace

public V replace(K key,
                 V value)

expireNodeRecidFor

public long expireNodeRecidFor(long expireId)

expireQueueFor

public QueueLong expireQueueFor(int segment,
                                long expireId)

expireId

public long expireId(long nodeRecid,
                     long queue)

expireEvict

public void expireEvict()

releases old stuff from queue

expireEvictSegment

public void expireEvictSegment(int segment)

expireEvictEntry

public void expireEvictEntry(int segment,
                             long leafRecid,
                             long nodeRecid)

getEntries

public java.util.Set<java.util.Map.Entry> getEntries()

entrySet

public java.util.Set entrySet()

getKeys

public HTreeMap.KeySet<K> getKeys()

keySet

public java.util.Set keySet()

getValues

public java.util.Collection<V> getValues()

values

public java.util.Collection values()

htreeIterator

public <E> java.util.Iterator<E> htreeIterator(int segment,
                                               Function2<java.lang.Object,java.lang.Object,? extends E> loadNext)

htreeEntry

public java.util.Map.Entry<K,V> htreeEntry(K key,
                                           V valueOrig)

hashCode

public int hashCode()

equals

public boolean equals(java.lang.Object other)

isClosed

public boolean isClosed()

listenerNotify

public void listenerNotify(K key,
                           V oldValue,
                           V newValue,
                           boolean triggered)

valueUnwrap

public V valueUnwrap(int segment,
                     java.lang.Object wrappedValue)

valueWrap

public java.lang.Object valueWrap(int segment,
                                  V value)

forEach

public void forEach(java.util.function.BiConsumer<? super K,? super V> action)

forEachKey

public void forEachKey(Function1<? super K,Unit> action)

forEachValue

public void forEachValue(Function1<? super V,Unit> action)

verify

public void verify()

close

public void close()

checkThreadSafe

public void checkThreadSafe()

checks all subcomponents, if this component is really thread safe, and throws an exception if not thread safe

calculateCollisionSize

public NonExistentClass calculateCollisionSize()

calculates number of collisions and total size of this set.

leafGet

public java.lang.Object[] leafGet(Store store,
                                  long leafRecid)

getKeySerializer

public Serializer<K> getKeySerializer()

getValueSerializer

public Serializer<V> getValueSerializer()

getValueInline

public boolean getValueInline()

getConcShift

public int getConcShift()

getDirShift

public int getDirShift()

getLevels

public int getLevels()

getStores

public Store[] getStores()

getIndexTrees

public NonExistentClass[] getIndexTrees()

getCounterRecids

public long[] getCounterRecids()

getExpireCreateTTL

public long getExpireCreateTTL()

getExpireUpdateTTL

public long getExpireUpdateTTL()

getExpireGetTTL

public long getExpireGetTTL()

getExpireMaxSize

public long getExpireMaxSize()

getExpireStoreSize

public long getExpireStoreSize()

getExpireCreateQueues

public QueueLong[] getExpireCreateQueues()

getExpireUpdateQueues

public QueueLong[] getExpireUpdateQueues()

getExpireGetQueues

public QueueLong[] getExpireGetQueues()

getExpireExecutor

public java.util.concurrent.ScheduledExecutorService getExpireExecutor()

getExpireExecutorPeriod

public long getExpireExecutorPeriod()

getExpireCompactThreshold

public java.lang.Double getExpireCompactThreshold()

isThreadSafe

public boolean isThreadSafe()

returns true if this is configured to be thread safe

getValueLoader

public Function1<K,V> getValueLoader()

getHasValues

public boolean getHasValues()