Interface SortedMap<K, V>

interface SortedMap<K, V> {
    clear(): void;
    compute(key: K, remappingFn: BiFunction<K, V, V>): V;
    computeIfAbsent(key: K, mappingFn: Function<K, V>): V;
    computeIfPresent(key: K, remappingFn: BiFunction<K, V, V>): V;
    containsKey(key: any): boolean;
    containsValue(key: any): boolean;
    entrySet(): Set<Java.Map.Entry<K, V>>;
    firstKey(): K;
    forEach(action: BiConsumer<K, V>): void;
    get(key: any): V;
    getOrDefault(key: any, defaultValue: V): V;
    hashCode(): number;
    isEmpty(): boolean;
    keySet(): Set<K>;
    lastKey(): K;
    merge(key: K, value: V, remappingFn: BiFunction<V, V, V>): V;
    put(key: K, value: V): V;
    putAll(m: Java.Map<K, V>): void;
    putIfAbstent(key: K, value: V): V;
    remove(key: any): V;
    remove(key: any, value: any): boolean;
    replace(key: K, value: V): V;
    replace(key: K, oldValue: V, newValue: V): boolean;
    replaceAll(fnc: BiFunction<K, V, V>): void;
    size(): number;
    values(): Collection<V>;
}