Kirill Rakhman
142 lines
3.6 KiB
Kotlin
Vendored
142 lines
3.6 KiB
Kotlin
Vendored
// WITH_STDLIB
|
|
// SKIP_KLIB_TEST
|
|
// IGNORE_BACKEND: JS_IR
|
|
// IGNORE_BACKEND: JS_IR_ES6
|
|
|
|
sealed class ArrayMap<T : Any> : Iterable<T> {
|
|
abstract val size: Int
|
|
|
|
abstract operator fun set(index: Int, value: T)
|
|
abstract operator fun get(index: Int): T?
|
|
|
|
abstract fun copy(): ArrayMap<T>
|
|
}
|
|
|
|
fun ArrayMap<*>.isEmpty(): Boolean = size == 0
|
|
fun ArrayMap<*>.isNotEmpty(): Boolean = size != 0
|
|
|
|
internal object EmptyArrayMap : ArrayMap<Nothing>() {
|
|
override val size: Int
|
|
get() = 0
|
|
|
|
override fun set(index: Int, value: Nothing) {
|
|
throw IllegalStateException()
|
|
}
|
|
|
|
override fun get(index: Int): Nothing? {
|
|
return null
|
|
}
|
|
|
|
override fun copy(): ArrayMap<Nothing> = this
|
|
|
|
override fun iterator(): Iterator<Nothing> {
|
|
return object : Iterator<Nothing> {
|
|
override fun hasNext(): Boolean = false
|
|
|
|
override fun next(): Nothing = throw NoSuchElementException()
|
|
}
|
|
}
|
|
}
|
|
|
|
internal class OneElementArrayMap<T : Any>(val value: T, val index: Int) : ArrayMap<T>() {
|
|
override val size: Int
|
|
get() = 1
|
|
|
|
override fun set(index: Int, value: T) {
|
|
throw IllegalStateException()
|
|
}
|
|
|
|
override fun get(index: Int): T? {
|
|
return if (index == this.index) value else null
|
|
}
|
|
|
|
override fun copy(): ArrayMap<T> = OneElementArrayMap(value, index)
|
|
|
|
override fun iterator(): Iterator<T> {
|
|
return object : Iterator<T> {
|
|
private var notVisited = true
|
|
|
|
override fun hasNext(): Boolean {
|
|
return notVisited
|
|
}
|
|
|
|
override fun next(): T {
|
|
if (notVisited) {
|
|
notVisited = false
|
|
return value
|
|
} else {
|
|
throw NoSuchElementException()
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
internal class ArrayMapImpl<T : Any> private constructor(
|
|
private var data: Array<Any?>
|
|
) : ArrayMap<T>() {
|
|
companion object {
|
|
private const val DEFAULT_SIZE = 20
|
|
private const val INCREASE_K = 2
|
|
}
|
|
|
|
constructor() : this(arrayOfNulls<Any>(DEFAULT_SIZE))
|
|
|
|
override var size: Int = 0
|
|
private set
|
|
|
|
|
|
private fun ensureCapacity(index: Int) {
|
|
if (data.size <= index) {
|
|
data = data.copyOf(data.size * INCREASE_K)
|
|
}
|
|
}
|
|
|
|
override operator fun set(index: Int, value: T) {
|
|
ensureCapacity(index)
|
|
if (data[index] == null) {
|
|
size++
|
|
}
|
|
data[index] = value
|
|
}
|
|
|
|
override operator fun get(index: Int): T? {
|
|
@Suppress("UNCHECKED_CAST")
|
|
return data.getOrNull(index) as T?
|
|
}
|
|
|
|
override fun copy(): ArrayMap<T> = ArrayMapImpl(data.copyOf())
|
|
|
|
override fun iterator(): Iterator<T> {
|
|
return object : AbstractIterator<T>() {
|
|
private var index = -1
|
|
|
|
override fun computeNext() {
|
|
do {
|
|
index++
|
|
} while (index < data.size && data[index] == null)
|
|
if (index >= data.size) {
|
|
done()
|
|
} else {
|
|
@Suppress("UNCHECKED_CAST")
|
|
setNext(data[index] as T)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
fun remove(index: Int) {
|
|
if (data[index] != null) {
|
|
size--
|
|
}
|
|
data[index] = null
|
|
}
|
|
|
|
fun entries(): List<Entry<T>> {
|
|
@Suppress("UNCHECKED_CAST")
|
|
return data.mapIndexedNotNull { index, value -> if (value != null) Entry(index, value as T) else null }
|
|
}
|
|
|
|
data class Entry<T>(override val key: Int, override val value: T) : Map.Entry<Int, T>
|
|
}
|