org.mapdb / IndexTreeLongLongMap

IndexTreeLongLongMap

class IndexTreeLongLongMap

Primitive Sorted Map<Long,Long.



Constructors

<init> IndexTreeLongLongMap(store: Store, rootRecid: Long, dirShift: Int, levels: Int, collapseOnRemove: Boolean)

Primitive Sorted Map<Long,Long.

Properties

collapseOnRemove val collapseOnRemove: Boolean
dirShift val dirShift: Int
levels val levels: Int
rootRecid val rootRecid: Long
store val store: Store

Functions

addToValue fun addToValue(key: Long, toBeAdded: Long): Long
allSatisfy fun allSatisfy(predicate: <ERROR CLASS>): Boolean
anySatisfy fun anySatisfy(predicate: <ERROR CLASS>): Boolean
appendString fun appendString(appendable: Appendable, start: String, separator: String, end: String): Unit
asSynchronized fun asSynchronized(): <ERROR CLASS>?
asUnmodifiable fun asUnmodifiable(): <ERROR CLASS>?
clear fun clear(): Unit
collect fun <V> collect(function: <ERROR CLASS><out V>): MutableCollection<V>?
contains fun contains(value: Long): Boolean
containsKey fun containsKey(key: Long): Boolean
containsValue fun containsValue(value: Long): Boolean
count fun count(predicate: <ERROR CLASS>): Int
detectIfNone fun detectIfNone(predicate: <ERROR CLASS>, ifNone: Long): Long
each fun each(procedure: <ERROR CLASS>): Unit
equals fun equals(other: Any?): Boolean
forEach fun forEach(procedure: <ERROR CLASS>): Unit
forEachKey fun forEachKey(procedure: <ERROR CLASS>): Unit
forEachKeyValue fun forEachKeyValue(procedure: <ERROR CLASS>): Unit
forEachValue fun forEachValue(procedure: <ERROR CLASS>): Unit
get fun get(key: Long): Long
getIfAbsent fun getIfAbsent(key: Long, ifAbsent: Long): Long
getIfAbsentPut fun getIfAbsentPut(key: Long, function: <ERROR CLASS>): Long
fun getIfAbsentPut(key: Long, value: Long): Long
getIfAbsentPutWith fun <P> getIfAbsentPutWith(key: Long, function: <ERROR CLASS><in P>, parameter: P): Long
getIfAbsentPutWithKey fun getIfAbsentPutWithKey(key: Long, function: <ERROR CLASS>): Long
getOrThrow fun getOrThrow(key: Long): Long
hashCode fun hashCode(): Int
injectInto fun <T> injectInto(injectedValue: T, function: <ERROR CLASS><in T, out T>?): T
keySet fun keySet(): <ERROR CLASS>
keyValuesView fun keyValuesView(): <ERROR CLASS><<ERROR CLASS>>
keysView fun keysView(): <ERROR CLASS>
longIterator fun longIterator(): <ERROR CLASS>
max fun max(): Long
min fun min(): Long
noneSatisfy fun noneSatisfy(predicate: <ERROR CLASS>): Boolean
put fun put(key: Long, value: Long): Unit
putAll fun putAll(map: <ERROR CLASS>): Unit
reject fun reject(predicate: <ERROR CLASS>): <ERROR CLASS>?
fun reject(predicate: <ERROR CLASS>): <ERROR CLASS>
remove fun remove(key: Long): Unit
removeKey fun removeKey(key: Long): Unit
removeKeyIfAbsent fun removeKeyIfAbsent(key: Long, value: Long): Long
select fun select(predicate: <ERROR CLASS>): <ERROR CLASS>?
fun select(predicate: <ERROR CLASS>): <ERROR CLASS>?
size fun size(): Int
sum fun sum(): Long
toArray fun toArray(): LongArray
toImmutable fun toImmutable(): <ERROR CLASS>
toString fun toString(): String
updateValue fun updateValue(key: Long, initialValueIfAbsent: Long, function: <ERROR CLASS>): Long
values fun values(): <ERROR CLASS>
withKeyValue fun withKeyValue(key: Long, value: Long): <ERROR CLASS>?
withoutAllKeys fun withoutAllKeys(keys: <ERROR CLASS>): <ERROR CLASS>?
withoutKey fun withoutKey(key: Long): <ERROR CLASS>?

Companion Object Functions

make fun make(store: Store = StoreTrivial(), rootRecid: Long = store.put(dirEmpty(), dirSer), dirShift: Int = CC.INDEX_TREE_LONGLONGMAP_DIR_SHIFT, levels: Int = CC.INDEX_TREE_LONGLONGMAP_LEVELS, collapseOnRemove: Boolean = true): IndexTreeLongLongMap

constructor with default values