Java集合源码学习(21)_Map接口子接口SortedMap和NavigableMap
来源:互联网 发布:怎样在淘宝输入网址 编辑:程序博客网 时间:2024/06/02 13:29
1:SortedMap继承自Map接口,增加了按顺序操作的几个方法;
2:排序是按照key的自然顺序(必须实现Comparable)或者指定的Comparator
Comparator<? superK>
comparator()
Returns the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys.
Set<Map.Entry<K,V>>
entrySet()
Returns a
Set
view of the mappings contained in this map. K
firstKey()
Returns the first (lowest) key currently in this map.
SortedMap<K,V>
headMap(K toKey)
Returns a view of the portion of this map whose keys are strictly less than toKey.
Set<K>
keySet()
Returns a
Set
view of the keys contained in this map. K
lastKey()
Returns the last (highest) key currently in this map.
SortedMap<K,V>
subMap(K fromKey, K toKey)
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMap<K,V>
tailMap(K fromKey)
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
Collection<V>
values()
Returns a
Collection
view of the values contained in this map.1:NavigableMap继承了SortedMap
Comparator<? superK>
comparator()
Returns the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys.
Set<Map.Entry<K,V>>
entrySet()
Returns a
Set
view of the mappings contained in this map. K
firstKey()
Returns the first (lowest) key currently in this map.
SortedMap<K,V>
headMap(K toKey)
Returns a view of the portion of this map whose keys are strictly less than toKey.
Set<K>
keySet()
Returns a
Set
view of the keys contained in this map. K
lastKey()
Returns the last (highest) key currently in this map.
SortedMap<K,V>
subMap(K fromKey, K toKey)
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMap<K,V>
tailMap(K fromKey)
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
Collection<V>
values()
Returns a
Collection
view of the values contained in this map. Map.Entry<K,V>
ceilingEntry(K key)
Returns a key-value mapping associated with the least key greater than or equal to the given key, or
null
if there is no such key. K
ceilingKey(K key)
Returns the least key greater than or equal to the given key, or
null
if there is no such key. NavigableSet<K>
descendingKeySet()
Returns a reverse order
NavigableSet
view of the keys contained in this map. NavigableMap<K,V>
descendingMap()
Returns a reverse order view of the mappings contained in this map.
Map.Entry<K,V>
firstEntry()
Returns a key-value mapping associated with the least key in this map, or
null
if the map is empty. Map.Entry<K,V>
floorEntry(K key)
Returns a key-value mapping associated with the greatest key less than or equal to the given key, or
null
if there is no such key. K
floorKey(K key)
Returns the greatest key less than or equal to the given key, or
null
if there is no such key. SortedMap<K,V>
headMap(K toKey)
Returns a view of the portion of this map whose keys are strictly less than toKey.
NavigableMap<K,V>
headMap(K toKey, boolean inclusive)
Returns a view of the portion of this map whose keys are less than (or equal to, if
inclusive
is true)toKey
. Map.Entry<K,V>
higherEntry(K key)
Returns a key-value mapping associated with the least key strictly greater than the given key, or
null
if there is no such key. K
higherKey(K key)
Returns the least key strictly greater than the given key, or
null
if there is no such key. Map.Entry<K,V>
lastEntry()
Returns a key-value mapping associated with the greatest key in this map, or
null
if the map is empty. Map.Entry<K,V>
lowerEntry(K key)
Returns a key-value mapping associated with the greatest key strictly less than the given key, or
null
if there is no such key. K
lowerKey(K key)
Returns the greatest key strictly less than the given key, or
null
if there is no such key. NavigableSet<K>
navigableKeySet()
Returns a
NavigableSet
view of the keys contained in this map. Map.Entry<K,V>
pollFirstEntry()
Removes and returns a key-value mapping associated with the least key in this map, or
null
if the map is empty. Map.Entry<K,V>
pollLastEntry()
Removes and returns a key-value mapping associated with the greatest key in this map, or
null
if the map is empty. NavigableMap<K,V>
subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
Returns a view of the portion of this map whose keys range from
fromKey
to toKey
. SortedMap<K,V>
subMap(K fromKey, K toKey)
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMap<K,V>
tailMap(K fromKey)
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
NavigableMap<K,V>
tailMap(K fromKey, boolean inclusive)
Returns a view of the portion of this map whose keys are greater than (or equal to, if
inclusive
is true)fromKey
. Comparator<? superK>
comparator()
Returns the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys.
Set<Map.Entry<K,V>>
entrySet()
Returns a
Set
view of the mappings contained in this map. K
firstKey()
Returns the first (lowest) key currently in this map.
SortedMap<K,V>
headMap(K toKey)
Returns a view of the portion of this map whose keys are strictly less than toKey.
Set<K>
keySet()
Returns a
Set
view of the keys contained in this map. K
lastKey()
Returns the last (highest) key currently in this map.
SortedMap<K,V>
subMap(K fromKey, K toKey)
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMap<K,V>
tailMap(K fromKey)
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
Collection<V>
values()
Returns a
Collection
view of the values contained in this map. Map.Entry<K,V>
ceilingEntry(K key)
Returns a key-value mapping associated with the least key greater than or equal to the given key, or
null
if there is no such key. K
ceilingKey(K key)
Returns the least key greater than or equal to the given key, or
null
if there is no such key. NavigableSet<K>
descendingKeySet()
Returns a reverse order
NavigableSet
view of the keys contained in this map. NavigableMap<K,V>
descendingMap()
Returns a reverse order view of the mappings contained in this map.
Map.Entry<K,V>
firstEntry()
Returns a key-value mapping associated with the least key in this map, or
null
if the map is empty. Map.Entry<K,V>
floorEntry(K key)
Returns a key-value mapping associated with the greatest key less than or equal to the given key, or
null
if there is no such key. K
floorKey(K key)
Returns the greatest key less than or equal to the given key, or
null
if there is no such key. SortedMap<K,V>
headMap(K toKey)
Returns a view of the portion of this map whose keys are strictly less than toKey.
NavigableMap<K,V>
headMap(K toKey, boolean inclusive)
Returns a view of the portion of this map whose keys are less than (or equal to, if
inclusive
is true)toKey
. Map.Entry<K,V>
higherEntry(K key)
Returns a key-value mapping associated with the least key strictly greater than the given key, or
null
if there is no such key. K
higherKey(K key)
Returns the least key strictly greater than the given key, or
null
if there is no such key. Map.Entry<K,V>
lastEntry()
Returns a key-value mapping associated with the greatest key in this map, or
null
if the map is empty. Map.Entry<K,V>
lowerEntry(K key)
Returns a key-value mapping associated with the greatest key strictly less than the given key, or
null
if there is no such key. K
lowerKey(K key)
Returns the greatest key strictly less than the given key, or
null
if there is no such key. NavigableSet<K>
navigableKeySet()
Returns a
NavigableSet
view of the keys contained in this map. Map.Entry<K,V>
pollFirstEntry()
Removes and returns a key-value mapping associated with the least key in this map, or
null
if the map is empty. Map.Entry<K,V>
pollLastEntry()
Removes and returns a key-value mapping associated with the greatest key in this map, or
null
if the map is empty. NavigableMap<K,V>
subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
Returns a view of the portion of this map whose keys range from
fromKey
to toKey
. SortedMap<K,V>
subMap(K fromKey, K toKey)
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMap<K,V>
tailMap(K fromKey)
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
NavigableMap<K,V>
tailMap(K fromKey, boolean inclusive)
Returns a view of the portion of this map whose keys are greater than (or equal to, if
inclusive
is true)fromKey
. 0 0
- Java集合源码学习(21)_Map接口的子接口SortedMap和NavigableMap
- Java集合源码学习(21)_Map接口子接口SortedMap和NavigableMap
- Java集合源码学习(23)_Map的子接口ConcurrentMap
- Java集合源码学习(18)_Map接口
- Java集合源码学习(20)_Map接口的实现HashMap
- Java集合之SortedMap、NavigableMap
- Core Java (二十四) SortedMap,NavigableMap,SortedSet,NavigableSet接口
- java源码分析之集合框架SortedMap 、 NavigableMap 、Dictionary 09
- Java集合之NavigableMap与NavigableSet接口
- NavigableMap接口源码解析
- Java集合源码学习(19)_Map接口的抽象实现AbstractMap
- SortedMap接口源码解析
- Java-Collection源码分析(十二)——SortedMap和NavigableMap
- Java集合源码学习(12)_SortedSet接口和NavigableSet接口
- Java类集 _Map接口
- Java类集 _Map接口
- Java集合框架官方教程(3):SortedSet/SortedMap接口
- SortedMap接口
- Android UI之ProgressBar
- CE6 实现 USB 转 串口
- POJ 2239 Selecting Courses(二分图最大匹配)
- Java中的JDBC数据库操作
- EasyUI Dialog弹出框+JS执行字符串
- Java集合源码学习(21)_Map接口子接口SortedMap和NavigableMap
- [leetcode] Flatten Binary Tree to Linked List
- 常见的jsp端口占用问题
- 操作系统精髓与设计原理之线程
- 101个硬币100真、1假,真假区别在于重量。用无砝码天平称两次给出真币重还是假币重的结论
- nginx
- ubuntu 下火狐浏览器打不开百度主页
- struts拦截器的详解
- lua与C++相互调用