java.util.TreeMap Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of jtransc-rt
There is a newer version: 0.6.8
/*
 * Copyright 2016 Carlos Ballesteros Velasco
 *
 * 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
 *
 *      http://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 java.util;

public class TreeMap extends AbstractMap implements NavigableMap, Cloneable, java.io.Serializable {
    public TreeMap() {

    }

    public TreeMap(Comparator comparator) {

    }

    public TreeMap(Map m) {
        putAll(m);
    }

    public TreeMap(SortedMap m) {
    }

    native public int size();

    native public boolean containsKey(Object key);

    native public boolean containsValue(Object value);

    native public V get(Object key);

    native public Comparator comparator();

    native public K firstKey();

    native public K lastKey();

    native public void putAll(Map map);

    native public V put(K key, V value);

    native public V remove(Object key);

    native public void clear();

    native public Object clone();

    native public Entry firstEntry();

    native public Entry lastEntry();

    native public Entry pollFirstEntry();

    native public Entry pollLastEntry();

    native public Entry lowerEntry(K key);

    native public K lowerKey(K key);

    native public Entry floorEntry(K key);

    native public K floorKey(K key);

    native public Entry ceilingEntry(K key);

    native public K ceilingKey(K key);

    native public Entry higherEntry(K key);

    native public K higherKey(K key);

    native public Set keySet();

    native public NavigableSet navigableKeySet();

    native public NavigableSet descendingKeySet();

    native public Collection values();

    native public Set> entrySet();

    native public NavigableMap descendingMap();

    native public NavigableMap subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive);

    native public NavigableMap headMap(K toKey, boolean inclusive);

    native public NavigableMap tailMap(K fromKey, boolean inclusive);

    native public SortedMap subMap(K fromKey, K toKey);

    native public SortedMap headMap(K toKey);

    native public SortedMap tailMap(K fromKey);

    native public boolean replace(K key, V oldValue, V newValue);

    native public V replace(K key, V value);
}