1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3 *
4 * This code is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License version 2 only, as
6 * published by the Free Software Foundation. Oracle designates this
7 * particular file as subject to the "Classpath" exception as provided
8 * by Oracle in the LICENSE file that accompanied this code.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 */
24
25 /*
26 * This file is available under and governed by the GNU General Public
27 * License version 2 only, as published by the Free Software Foundation.
28 * However, the following notice accompanied the original version of this
29 * file:
30 *
31 * Written by Doug Lea and Josh Bloch with assistance from members of JCP
32 * JSR-166 Expert Group and released to the public domain, as explained at
33 * http://creativecommons.org/publicdomain/zero/1.0/
34 */
35
36
37 package java.util;
38
39 @SuppressWarnings({"unchecked", "deprecation", "all"})
40 public interface NavigableMap<K, V> extends java.util.SortedMap<K,V> {
41
lowerEntry(K key)42 public java.util.Map.Entry<K,V> lowerEntry(K key);
43
lowerKey(K key)44 public K lowerKey(K key);
45
floorEntry(K key)46 public java.util.Map.Entry<K,V> floorEntry(K key);
47
floorKey(K key)48 public K floorKey(K key);
49
ceilingEntry(K key)50 public java.util.Map.Entry<K,V> ceilingEntry(K key);
51
ceilingKey(K key)52 public K ceilingKey(K key);
53
higherEntry(K key)54 public java.util.Map.Entry<K,V> higherEntry(K key);
55
higherKey(K key)56 public K higherKey(K key);
57
firstEntry()58 public java.util.Map.Entry<K,V> firstEntry();
59
lastEntry()60 public java.util.Map.Entry<K,V> lastEntry();
61
pollFirstEntry()62 public java.util.Map.Entry<K,V> pollFirstEntry();
63
pollLastEntry()64 public java.util.Map.Entry<K,V> pollLastEntry();
65
descendingMap()66 public java.util.NavigableMap<K,V> descendingMap();
67
navigableKeySet()68 public java.util.NavigableSet<K> navigableKeySet();
69
descendingKeySet()70 public java.util.NavigableSet<K> descendingKeySet();
71
subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)72 public java.util.NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive);
73
headMap(K toKey, boolean inclusive)74 public java.util.NavigableMap<K,V> headMap(K toKey, boolean inclusive);
75
tailMap(K fromKey, boolean inclusive)76 public java.util.NavigableMap<K,V> tailMap(K fromKey, boolean inclusive);
77
subMap(K fromKey, K toKey)78 public java.util.SortedMap<K,V> subMap(K fromKey, K toKey);
79
headMap(K toKey)80 public java.util.SortedMap<K,V> headMap(K toKey);
81
tailMap(K fromKey)82 public java.util.SortedMap<K,V> tailMap(K fromKey);
83
84
reversed()85 public default java.util.NavigableMap<K,V> reversed() { throw new RuntimeException("Stub!"); }
86 }
87
88