edu.duke.cs.osprey/edu.duke.cs.osprey.gui.tools/ArrayMap

ArrayMap

class ArrayMap<T : Any> : MutableMap<Int, T>

An array list that implements a map keyed by integers. Very efficient map implementation for get/put when using consecutive keys in [0,N).

Constructors

ArrayMap

fun ArrayMap()

Functions

clear

open override fun clear()

compute

open fun compute(p0: Int, p1: BiFunction<in Int, in T?, out T?>): T?

computeIfAbsent

open fun computeIfAbsent(p0: Int, p1: Function<in Int, out T>): T

computeIfPresent

open fun computeIfPresent(p0: Int, p1: BiFunction<in Int, in T, out T?>): T?

containsKey

open override fun containsKey(key: Int): Boolean

containsValue

open override fun containsValue(value: T): Boolean

forEach

open fun forEach(p0: BiConsumer<in Int, in T>)

get

open operator override fun get(key: Int): T?

getOrDefault

open fun getOrDefault(key: Int, defaultValue: T): T

isEmpty

open override fun isEmpty(): Boolean

merge

open fun merge(p0: Int, p1: T, p2: BiFunction<in T, in T, out T?>): T?

put

open override fun put(key: Int, value: T): T?

putAll

open override fun putAll(from: Map<out Int, T>)

putIfAbsent

open fun putIfAbsent(p0: Int, p1: T): T?

remove

open override fun remove(key: Int): T?

open fun remove(key: Int, value: T): Boolean

replace

open fun replace(p0: Int, p1: T): T?

open fun replace(p0: Int, p1: T, p2: T): Boolean

replaceAll

open fun replaceAll(p0: BiFunction<in Int, in T, out T>)

Properties

entries

open override val entries: MutableSet<MutableMap.MutableEntry<Int, T>>

keys

open override val keys: MutableSet<Int>

size

open override var size: Int = 0

values

open override val values: MutableCollection<T>