MultiHashMap

class MultiHashMap<K, V> : LinkedHashMap<K, ArrayList<V>>

Functions

add

fun add(key: K, value: V)

afterNodeAccess

open override fun afterNodeAccess(p0: HashMap.Node<K, ArrayList<V>>)

afterNodeInsertion

open override fun afterNodeInsertion(p0: Boolean)

afterNodeRemoval

open override fun afterNodeRemoval(p0: HashMap.Node<K, ArrayList<V>>)

capacity

fun capacity(): Int

clear

open override fun clear()

clone

open override fun clone(): Any

compute

open override fun compute(p0: K, p1: BiFunction<in K, in ArrayList<V>?, out ArrayList<V>?>): ArrayList<V>?

computeIfAbsent

open override fun computeIfAbsent(p0: K, p1: Function<in K, out ArrayList<V>>): ArrayList<V>

computeIfPresent

open override fun computeIfPresent(p0: K, p1: BiFunction<in K, in ArrayList<V>, out ArrayList<V>?>): ArrayList<V>?

containsKey

open override fun containsKey(key: K): Boolean

containsValue

open override fun containsValue(value: ArrayList<V>): Boolean

equals

open operator override fun equals(other: Any?): Boolean

forEach

open override fun forEach(p0: BiConsumer<in K, in ArrayList<V>>)

get

open operator override fun get(key: K): ArrayList<V>?

getNode

fun getNode(p0: Int, p1: Any): HashMap.Node<K, ArrayList<V>>

getOrDefault

open override fun getOrDefault(key: K, defaultValue: ArrayList<V>): ArrayList<V>

hashCode

open override fun hashCode(): Int

internalWriteEntries

open override fun internalWriteEntries(p0: ObjectOutputStream)

isEmpty

open override fun isEmpty(): Boolean

linkNodeLast

private open fun linkNodeLast(p0: LinkedHashMap.Entry<K, ArrayList<V>>)

loadFactor

fun loadFactor(): Float

merge

open override fun merge(p0: K, p1: ArrayList<V>, p2: BiFunction<in ArrayList<V>, in ArrayList<V>, out ArrayList<V>?>): ArrayList<V>?

newNode

open override fun newNode(p0: Int, p1: K, p2: ArrayList<V>, p3: HashMap.Node<K, ArrayList<V>>): HashMap.Node<K, ArrayList<V>>

newTreeNode

open override fun newTreeNode(p0: Int, p1: K, p2: ArrayList<V>, p3: HashMap.Node<K, ArrayList<V>>): HashMap.TreeNode<K, ArrayList<V>>

put

open override fun put(key: K, value: ArrayList<V>): ArrayList<V>?

putAll

open override fun putAll(from: Map<out K, ArrayList<V>>)

putIfAbsent

open override fun putIfAbsent(p0: K, p1: ArrayList<V>): ArrayList<V>?

putMapEntries

fun putMapEntries(p0: MutableMap<out K, out ArrayList<V>>, p1: Boolean)

putVal

fun putVal(p0: Int, p1: K, p2: ArrayList<V>, p3: Boolean, p4: Boolean): ArrayList<V>

readObject

private open fun readObject(p0: ObjectInputStream)

reinitialize

open override fun reinitialize()

remove

open override fun remove(key: K): ArrayList<V>?

open override fun remove(key: K, value: ArrayList<V>): Boolean

removeEldestEntry

open fun removeEldestEntry(p0: MutableMap.MutableEntry<K, ArrayList<V>>): Boolean

removeNode

fun removeNode(p0: Int, p1: Any, p2: Any, p3: Boolean, p4: Boolean): HashMap.Node<K, ArrayList<V>>

replace

open override fun replace(p0: K, p1: ArrayList<V>): ArrayList<V>?

open override fun replace(p0: K, p1: ArrayList<V>, p2: ArrayList<V>): Boolean

replaceAll

open override fun replaceAll(p0: BiFunction<in K, in ArrayList<V>, out ArrayList<V>>)

replacementNode

open override fun replacementNode(p0: HashMap.Node<K, ArrayList<V>>, p1: HashMap.Node<K, ArrayList<V>>): HashMap.Node<K, ArrayList<V>>

replacementTreeNode

open override fun replacementTreeNode(p0: HashMap.Node<K, ArrayList<V>>, p1: HashMap.Node<K, ArrayList<V>>): HashMap.TreeNode<K, ArrayList<V>>

resize

fun resize(): Array<HashMap.Node<K, ArrayList<V>>>

toString

open override fun toString(): String

transferLinks

private open fun transferLinks(p0: LinkedHashMap.Entry<K, ArrayList<V>>, p1: LinkedHashMap.Entry<K, ArrayList<V>>)

treeifyBin

fun treeifyBin(p0: Array<HashMap.Node<K, ArrayList<V>>>, p1: Int)

writeObject

private open fun writeObject(p0: ObjectOutputStream)

Properties

accessOrder

val accessOrder: Boolean

entries

open override val entries: MutableSet<MutableMap.MutableEntry<K, ArrayList<V>>>

entrySet

val entrySet: MutableSet<MutableMap.MutableEntry<K, ArrayList<V>>>

head

val head: LinkedHashMap.Entry<K, ArrayList<V>>

keys

open override val keys: MutableSet<K>

keySet

val keySet: MutableSet<K>

loadFactor

val loadFactor: Float

modCount

val modCount: Int

size

open override val size: Int

size

val size: Int

table

val table: Array<HashMap.Node<K, ArrayList<V>>>

tail

val tail: LinkedHashMap.Entry<K, ArrayList<V>>

threshold

val threshold: Int

values

open override val values: MutableCollection<ArrayList<V>>

values

val values: MutableCollection<ArrayList<V>>

Sources

jvm source