1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 | /* * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ /* * This file is available under and governed by the GNU General Public * License version 2 only, as published by the Free Software Foundation. * However, the following notice accompanied the original version of this * file: * * Written by Doug Lea and Josh Bloch with assistance from members of JCP * JSR-166 Expert Group and released to the public domain, as explained at * http://creativecommons.org/publicdomain/zero/1.0/ */ package Torello.Java.ReadOnly; import java.util.Map; import java.util.NavigableMap; import java.util.Set; import java.util.Comparator; /** * Immutable variant of Java Collectionds Framework interface * <CODE>java.util.NavigableMap<K, V></CODE>. * * <EMBED CLASS='external-html' DATA-JDK=ReadOnlyNavigableMap DATA-FILE-ID=INTERFACES> * * @param <K> the type of keys maintained by this map * @param <V> the type of mapped values */ @Torello.JavaDoc.JDHeaderBackgroundImg(EmbedTagFileID="JDHBI_INTERFACE") public interface ReadOnlyNavigableMap<K, V> extends ReadOnlySortedMap<K,V> { // ******************************************************************************************** // ******************************************************************************************** // Original JDK Interface Methods // ******************************************************************************************** // ******************************************************************************************** /** * Returns a key-value mapping associated with the greatest key strictly less than the given * key, or {@code null} if there is no such key. * * @param key the key * * @return an entry with the greatest key less than {@code key}, or {@code null} if there is no * such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ ReadOnlyMap.Entry<K,V> lowerEntry(K key); /** * Returns the greatest key strictly less than the given key, or {@code null} if there is no * such key. * * @param key the key * @return the greatest key less than {@code key}, or {@code null} if there is no such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ K lowerKey(K key); /** * Returns a key-value mapping associated with the greatest key less than or equal to the given * key, or {@code null} if there is no such key. * * @param key the key * * @return an entry with the greatest key less than or equal to {@code key}, or {@code null} if * there is no such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ ReadOnlyMap.Entry<K,V> floorEntry(K key); /** * Returns the greatest key less than or equal to the given key, or {@code null} if there is no * such key. * * @param key the key * * @return the greatest key less than or equal to {@code key}, or {@code null} if there is no * such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ K floorKey(K key); /** * Returns a key-value mapping associated with the least key greater than or equal to the given * key, or {@code null} if there is no such key. * * @param key the key * * @return an entry with the least key greater than or equal to {@code key}, or {@code null} if * there is no such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently in * the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ ReadOnlyMap.Entry<K,V> ceilingEntry(K key); /** * Returns the least key greater than or equal to the given key, or {@code null} if there is no * such key. * * @param key the key * * @return the least key greater than or equal to {@code key}, or {@code null} if there is no * such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ K ceilingKey(K key); /** * Returns a key-value mapping associated with the least key strictly greater than the given * key, or {@code null} if there is no such key. * * @param key the key * * @return an entry with the least key greater than {@code key}, or {@code null} if there is no * such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ ReadOnlyMap.Entry<K,V> higherEntry(K key); /** * Returns the least key strictly greater than the given key, or {@code null} if there is no * such key. * * @param key the key * * @return the least key greater than {@code key}, or {@code null} if there is no such key * * @throws ClassCastException if the specified key cannot be compared with the keys currently * in the map * * @throws NullPointerException if the specified key is null and this map does not permit null * keys */ K higherKey(K key); /** * Returns a key-value mapping associated with the least key in this map, or {@code null} if * the map is empty. * * @return an entry with the least key, or {@code null} if this map is empty */ ReadOnlyMap.Entry<K,V> firstEntry(); /** * Returns a key-value mapping associated with the greatest key in this map, or {@code null} if * the map is empty. * * @return an entry with the greatest key, or {@code null} if this map is empty */ ReadOnlyMap.Entry<K,V> lastEntry(); /** * Returns a reverse order view of the mappings contained in this map. * @return a reverse order view of this map */ ReadOnlyNavigableMap<K,V> descendingMap(); /** * Returns a {@link ReadOnlyNavigableSet} view of the keys contained in this map. The set's * iterator returns the keys in ascending order. * * @return a navigable set view of the keys in this map */ ReadOnlyNavigableSet<K> navigableKeySet(); /** * Returns a reverse order {@link ReadOnlyNavigableSet} view of the keys contained in this map. * The set's iterator returns the keys in descending order. * * @return a reverse order navigable set view of the keys in this map */ ReadOnlyNavigableSet<K> descendingKeySet(); /** * Returns a view of the portion of this map whose keys range from {@code fromKey} to * {@code toKey}. If {@code fromKey} and {@code toKey} are equal, the returned map is empty * unless {@code fromInclusive} and {@code toInclusive} are both true. * * <BR /><BR />The returned map supports all optional map operations that this map supports. * * @param fromKey low endpoint of the keys in the returned map * @param fromInclusive {@code TRUE} if the low endpoint is to be included in the returned view * @param toKey high endpoint of the keys in the returned map * @param toInclusive {@code TRUE} if the high endpoint is to be included in the returned view * * @return a view of the portion of this map whose keys range from {@code fromKey} to * {@code toKey} * * @throws ClassCastException if {@code fromKey} and {@code toKey} cannot be compared to one * another using this map's comparator (or, if the map has no comparator, using natural * ordering). Implementations may, but are not required to, throw this exception if * {@code fromKey} or {@code toKey} cannot be compared to keys currently in the map. * * @throws NullPointerException if {@code fromKey} or {@code toKey} is null and this map does * not permit null keys * * @throws IllegalArgumentException if {@code fromKey} is greater than {@code toKey}; or if * this map itself has a restricted range, and {@code fromKey} or {@code toKey} lies outside * the bounds of the range */ ReadOnlyNavigableMap<K,V> subMap( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive ); /** * Returns a view of the portion of this map whose keys are less than (or * equal to, if {@code inclusive} is true) {@code toKey}. * * The returned map supports all optional map operations that this map supports. * * @param toKey high endpoint of the keys in the returned map * @param inclusive {@code TRUE} if the high endpoint is to be included in the returned view * * @return a view of the portion of this map whose keys are less than (or equal to, if * {@code inclusive} is true) {@code toKey} * * @throws ClassCastException if {@code toKey} is not compatible with this map's comparator * (or, if the map has no comparator, if {@code toKey} does not implement {@link Comparable}). * Implementations may, but are not required to, throw this exception if {@code toKey} cannot * be compared to keys currently in the map. * * @throws NullPointerException if {@code toKey} is null and this map does not permit null keys * * @throws IllegalArgumentException if this map itself has a restricted range, and * {@code toKey} lies outside the bounds of the range */ ReadOnlyNavigableMap<K,V> headMap(K toKey, boolean inclusive); /** * Returns a view of the portion of this map whose keys are greater than (or equal to, if * {@code inclusive} is true) {@code fromKey}. * * The returned map supports all optional map operations that this map supports. * * @param fromKey low endpoint of the keys in the returned map * @param inclusive {@code TRUE} if the low endpoint is to be included in the returned view * * @return a view of the portion of this map whose keys are greater than (or equal to, if * {@code inclusive} is true) {@code fromKey} * * @throws ClassCastException if {@code fromKey} is not compatible with this map's comparator * (or, if the map has no comparator, if {@code fromKey} does not implement * {@link Comparable}). Implementations may, but are not required to, throw this exception if * {@code fromKey} cannot be compared to keys currently in the map. * * @throws NullPointerException if {@code fromKey} is null and this map does not permit null * keys * * @throws IllegalArgumentException if this map itself has a restricted range, and * {@code fromKey} lies outside the bounds of the range */ ReadOnlyNavigableMap<K,V> tailMap(K fromKey, boolean inclusive); /** * {@inheritDoc} * * <BR /><BR />Equivalent to {@code subMap(fromKey, true, toKey, false)}. * * @throws ClassCastException {@inheritDoc} * @throws NullPointerException {@inheritDoc} * @throws IllegalArgumentException {@inheritDoc} */ ReadOnlySortedMap<K,V> subMap(K fromKey, K toKey); /** * {@inheritDoc} * * <BR /><BR />Equivalent to {@code headMap(toKey, false)}. * * @throws ClassCastException {@inheritDoc} * @throws NullPointerException {@inheritDoc} * @throws IllegalArgumentException {@inheritDoc} */ ReadOnlySortedMap<K,V> headMap(K toKey); /** * {@inheritDoc} * * <BR /><BR />Equivalent to {@code tailMap(fromKey, true)}. * * @throws ClassCastException {@inheritDoc} * @throws NullPointerException {@inheritDoc} * @throws IllegalArgumentException {@inheritDoc} */ ReadOnlySortedMap<K,V> tailMap(K fromKey); /** * {@inheritDoc} * <BR /><BR /> * This method is equivalent to {@link #descendingMap descendingMap}. * * @implSpec * The implementation in this interface returns the result of calling the * {@code descendingMap} method. * * @return a reverse-ordered view of this map, as a {@code NavigableMap} */ default ReadOnlyNavigableMap<K, V> reversed() { return this.descendingMap(); } } |