BunyipsLib/au.edu.sa.mbhs.studentrobotics.bunyipslib.external/LookupTable

LookupTable

open class LookupTable<T : Number?, R> : TreeMap<K, V>

A lookup table.

Utility from FTCLib Source

Since

1.0.0-pre

Parameters

<T>

the input type

<R>

the output type

Constructors

LookupTable

constructor()

Functions

add

open fun add(key: T, out: R)

Adds a key-value pair to the lookup table.

get

open fun get(key: T): R

Returns the closest possible value for the given key.

Inherited functions

ceilingEntry

open fun ceilingEntry(key: K): Map.Entry<K, V>

ceilingKey

open fun ceilingKey(key: K): K

clear

open fun clear()

clone

open fun clone(): Any

comparator

open fun comparator(): Comparator<in K>

compute

open fun compute(key: K, remappingFunction: BiFunction<in K, in V, out V>): V

computeIfAbsent

open fun computeIfAbsent(key: K, mappingFunction: (in K) -> out V): V

computeIfPresent

open fun computeIfPresent(key: K, remappingFunction: BiFunction<in K, in V, out V>): V

containsKey

open fun containsKey(key: Any): Boolean

containsValue

open fun containsValue(value: Any): Boolean

copyOf

open fun <K, V> copyOf(map: Map<out K, out V>): Map<K, V>

descendingKeySet

open fun descendingKeySet(): NavigableSet<K>

descendingMap

open fun descendingMap(): NavigableMap<K, V>

entry

open fun <K, V> entry(k: K, v: V): Map.Entry<K, V>

entrySet

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

equals

open fun equals(o: Any): Boolean

firstEntry

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

firstKey

open fun firstKey(): K

floorEntry

open fun floorEntry(key: K): Map.Entry<K, V>

floorKey

open fun floorKey(key: K): K

forEach

open fun forEach(action: BiConsumer<in K, in V>)

get

open fun get(key: Any): V

getOrDefault

open fun getOrDefault(key: Any, defaultValue: V): V

hashCode

open fun hashCode(): Int

headMap

open fun headMap(toKey: K): SortedMap<K, V>

open fun headMap(toKey: K, inclusive: Boolean): NavigableMap<K, V>

higherEntry

open fun higherEntry(key: K): Map.Entry<K, V>

higherKey

open fun higherKey(key: K): K

isEmpty

open fun isEmpty(): Boolean

keySet

open fun keySet(): Set<K>

lastEntry

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

lastKey

open fun lastKey(): K

lowerEntry

open fun lowerEntry(key: K): Map.Entry<K, V>

lowerKey

open fun lowerKey(key: K): K

merge

open fun merge(key: K, value: V, remappingFunction: BiFunction<in V, in V, out V>): V

navigableKeySet

open fun navigableKeySet(): NavigableSet<K>

open fun <K, V> of(): Map<K, V>

ofEntries

open fun <K, V> ofEntries(entries: Array<Map.Entry<out K, out V>>): Map<K, V>

pollFirstEntry

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

pollLastEntry

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

put

open fun put(key: K, value: V): V

putAll

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

putIfAbsent

open fun putIfAbsent(key: K, value: V): V

remove

open fun remove(key: Any, value: Any): Boolean

open fun remove(key: Any): V

replace

open fun replace(key: K, value: V): V

open fun replace(key: K, oldValue: V, newValue: V): Boolean

replaceAll

open fun replaceAll(function: BiFunction<in K, in V, out V>)

size

open fun size(): Int

subMap

open fun subMap(fromKey: K, toKey: K): SortedMap<K, V>

open fun subMap(fromKey: K, fromInclusive: Boolean, toKey: K, toInclusive: Boolean): NavigableMap<K, V>

tailMap

open fun tailMap(fromKey: K): SortedMap<K, V>

open fun tailMap(fromKey: K, inclusive: Boolean): NavigableMap<K, V>

toString

open fun toString(): String

values

open fun values(): Collection<V>