commonMain.jetbrains.datalore.base.gcommon.collect.TreeMap.kt Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of lets-plot-common Show documentation

Lets-Plot JVM package without rendering part

There is a newer version: 4.5.3-alpha1

/*
 * Copyright (c) 2019 JetBrains s.r.o.
 * Use of this source code is governed by the MIT license that can be found in the LICENSE file.
 *
 * This file has been modified by JetBrains : Java code has been converted to Kotlin code.
 *
 * THE FOLLOWING IS THE COPYRIGHT OF THE ORIGINAL DOCUMENT:
 *
 * Copyright (C) 2007 The Guava Authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
 * in compliance with the License. You may obtain a copy of the License at
 *
 * https://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software distributed under the License
 * is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package jetbrains.datalore.base.gcommon.collect

class TreeMap, V> {
    val values: Collection
        get() = map.values
    private val sortedKeys: MutableList = ArrayList()
    private val map: MutableMap = HashMap()

    operator fun get(key: K): V? = map[key]

    fun put(key: K, value: V): V? {
        val index = sortedKeys.binarySearch(key)
        if (index < 0) {
            sortedKeys.add(index.inv(), key)
        } else {
            sortedKeys[index] = key
        }
        return map.put(key, value)
    }

    fun containsKey(key: K): Boolean = map.containsKey(key)

    fun floorKey(key: K): K? {
        var index = sortedKeys.binarySearch(key)

        if (index < 0) {
            index = index.inv() - 1

            if (index < 0)
                return null
        }
        return sortedKeys[index]
    }

    fun ceilingKey(key: K): K? {
        var index = sortedKeys.binarySearch(key)

        if (index < 0) {
            index = index.inv()

            if (index == sortedKeys.size)
                return null
        }
        return sortedKeys[index]
    }
}