VoiceInstructionMap

open class VoiceInstructionMap : HashMap<Boolean, VoiceInstructionUpdate>

Constructors

VoiceInstructionMap

open fun VoiceInstructionMap()

Functions

afterNodeAccess

open fun afterNodeAccess(p: HashMap.Node<K, V>)

afterNodeInsertion

open fun afterNodeInsertion(p: Boolean)

afterNodeRemoval

open fun afterNodeRemoval(p: HashMap.Node<K, V>)

capacity

fun capacity(): Int

clear

open fun clear()

clone

open fun clone(): Any

comparableClassFor

open fun comparableClassFor(p: Any): Class<out Any>

compareComparables

open fun compareComparables(p: Class<out Any>, p1: Any, p2: Any): Int

compute

open fun compute(p: K, p1: BiFunction<out Any, out Any, out V>): V

computeIfAbsent

open fun computeIfAbsent(p: K, p1: (out Any) -> out V): V

computeIfPresent

open fun computeIfPresent(p: K, p1: BiFunction<out Any, out Any, out V>): V

containsKey

open fun containsKey(p: Any): Boolean

containsValue

open fun containsValue(p: Any): Boolean

entrySet

open fun entrySet(): Set<Map.Entry<K, V>>

open fun eq(p: Any, p1: Any): Boolean

equals

open fun equals(p: Any): Boolean

forEach

open fun forEach(p: BiConsumer<out Any, out Any>)

get

open fun get(p: Any): V

getNode

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

getOrDefault

open fun getOrDefault(p: Any, p1: V): V

hash

fun hash(p: Any): Int

hashCode

open fun hashCode(): Int

internalWriteEntries

open fun internalWriteEntries(p: ObjectOutputStream)

isEmpty

open fun isEmpty(): Boolean

keySet

open fun keySet(): Set<K>

loadFactor

fun loadFactor(): Float

merge

open fun merge(p: K, p1: V, p2: BiFunction<out Any, out Any, out V>): V

newNode

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

newTreeNode

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

put

open fun put(p: K, p1: V): V

putAll

open fun putAll(p: Map<out K, out V>)

putIfAbsent

open fun putIfAbsent(p: K, p1: V): V

putMapEntries

fun putMapEntries(p: Map<out K, out V>, p1: Boolean)

putVal

fun putVal(p: Int, p1: K, p2: V, p3: Boolean, p4: Boolean): V

readObject

open fun readObject(p: ObjectInputStream)

reinitialize

open fun reinitialize()

remove

open fun remove(p: Any): V

open fun remove(p: Any, p1: Any): Boolean

removeNode

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

replace

open fun replace(p: K, p1: V): V

open fun replace(p: K, p1: V, p2: V): Boolean

replaceAll

open fun replaceAll(p: BiFunction<out Any, out Any, out V>)

replacementNode

open fun replacementNode(p: HashMap.Node<K, V>, p1: HashMap.Node<K, V>): HashMap.Node<K, V>

replacementTreeNode

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

resize

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

size

open fun size(): Int

tableSizeFor

fun tableSizeFor(p: Int): Int

toString

open fun toString(): String

treeifyBin

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

values

open fun values(): Collection<V>

writeObject

open fun writeObject(p: ObjectOutputStream)