Features

object Features : LinkedHashMap<AttributeKey<*>, Any>

Functions

afterNodeAccess

open override fun afterNodeAccess(p0: HashMap.Node<AttributeKey<*>, Any>)

afterNodeInsertion

open override fun afterNodeInsertion(p0: Boolean)

afterNodeRemoval

open override fun afterNodeRemoval(p0: HashMap.Node<AttributeKey<*>, Any>)

capacity

fun capacity(): Int

clear

open override fun clear()

clone

open override fun clone(): Any

compute

open override fun compute(p0: AttributeKey<*>, p1: BiFunction<in AttributeKey<*>, in Any?, out Any?>): Any?

computeIfAbsent

open override fun computeIfAbsent(p0: AttributeKey<*>, p1: Function<in AttributeKey<*>, out Any>): Any

computeIfPresent

open override fun computeIfPresent(p0: AttributeKey<*>, p1: BiFunction<in AttributeKey<*>, in Any, out Any?>): Any?

containsKey

open override fun containsKey(key: AttributeKey<*>): Boolean

containsValue

open override fun containsValue(value: Any): Boolean

equals

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

forEach

open override fun forEach(p0: BiConsumer<in AttributeKey<*>, in Any>)

get

open operator override fun get(key: AttributeKey<*>): Any?

getNode

fun getNode(p0: Any): HashMap.Node<AttributeKey<*>, Any>

getOrDefault

open override fun getOrDefault(key: AttributeKey<*>, defaultValue: Any): Any

hashCode

open override fun hashCode(): Int

internalWriteEntries

open override fun internalWriteEntries(p0: ObjectOutputStream)

isEmpty

open override fun isEmpty(): Boolean

keysToArray

override fun <T : Any> keysToArray(p0: Array<T>): Array<T>

loadFactor

fun loadFactor(): Float

merge

open override fun merge(p0: AttributeKey<*>, p1: Any, p2: BiFunction<in Any, in Any, out Any?>): Any?

newNode

open override fun newNode(p0: Int, p1: AttributeKey<*>, p2: Any, p3: HashMap.Node<AttributeKey<*>, Any>): HashMap.Node<AttributeKey<*>, Any>

newTreeNode

open override fun newTreeNode(p0: Int, p1: AttributeKey<*>, p2: Any, p3: HashMap.Node<AttributeKey<*>, Any>): HashMap.TreeNode<AttributeKey<*>, Any>

prepareArray

fun <T : Any> prepareArray(p0: Array<T>): Array<T>

put

open override fun put(key: AttributeKey<*>, value: Any): Any?

putAll

open override fun putAll(from: Map<out AttributeKey<*>, Any>)

putIfAbsent

open override fun putIfAbsent(p0: AttributeKey<*>, p1: Any): Any?

putMapEntries

fun putMapEntries(p0: MutableMap<out AttributeKey<*>, out Any>, p1: Boolean)

putVal

fun putVal(p0: Int, p1: AttributeKey<*>, p2: Any, p3: Boolean, p4: Boolean): Any

reinitialize

open override fun reinitialize()

remove

open override fun remove(key: AttributeKey<*>): Any?

open override fun remove(key: AttributeKey<*>, value: Any): Boolean

removeEldestEntry

open fun removeEldestEntry(p0: MutableMap.MutableEntry<AttributeKey<*>, Any>): Boolean

removeNode

fun removeNode(p0: Int, p1: Any, p2: Any, p3: Boolean, p4: Boolean): HashMap.Node<AttributeKey<*>, Any>

replace

open override fun replace(p0: AttributeKey<*>, p1: Any): Any?

open override fun replace(p0: AttributeKey<*>, p1: Any, p2: Any): Boolean

replaceAll

open override fun replaceAll(p0: BiFunction<in AttributeKey<*>, in Any, out Any>)

replacementNode

open override fun replacementNode(p0: HashMap.Node<AttributeKey<*>, Any>, p1: HashMap.Node<AttributeKey<*>, Any>): HashMap.Node<AttributeKey<*>, Any>

replacementTreeNode

open override fun replacementTreeNode(p0: HashMap.Node<AttributeKey<*>, Any>, p1: HashMap.Node<AttributeKey<*>, Any>): HashMap.TreeNode<AttributeKey<*>, Any>

resize

fun resize(): Array<HashMap.Node<AttributeKey<*>, Any>>

toString

open override fun toString(): String

treeifyBin

fun treeifyBin(p0: Array<HashMap.Node<AttributeKey<*>, Any>>, p1: Int)

valuesToArray

override fun <T : Any> valuesToArray(p0: Array<T>): Array<T>

Properties

accessOrder

val accessOrder: Boolean

entries

open override val entries: MutableSet<MutableMap.MutableEntry<AttributeKey<*>, Any>>

entrySet

val entrySet: MutableSet<MutableMap.MutableEntry<AttributeKey<*>, Any>>

head

val head: LinkedHashMap.Entry<AttributeKey<*>, Any>

keys

open override val keys: MutableSet<AttributeKey<*>>

keySet

val keySet: MutableSet<AttributeKey<*>>

loadFactor

val loadFactor: Float

modCount

val modCount: Int

size

open override val size: Int

size

val size: Int

table

val table: Array<HashMap.Node<AttributeKey<*>, Any>>

tail

val tail: LinkedHashMap.Entry<AttributeKey<*>, Any>

threshold

val threshold: Int

values

open override val values: MutableCollection<Any>

values

val values: MutableCollection<Any>

Sources

jvm source