本文整理了Java中java.util.TreeMap.immutableCopy()
方法的一些代码示例,展示了TreeMap.immutableCopy()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TreeMap.immutableCopy()
方法的具体详情如下:
包路径:java.util.TreeMap
类名称:TreeMap
方法名:immutableCopy
[英]Returns an immutable version of entry. Need this because we allow entry to be null, in which case we return a null SimpleImmutableEntry.
[中]返回条目的不可变版本。需要这样做是因为我们允许条目为null,在这种情况下,我们返回一个null的simpleimutableentry。
代码示例来源:origin: robovm/robovm
public Entry<K, V> lastEntry() {
return immutableCopy(root == null ? null : root.last());
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> pollFirstEntry() {
return immutableCopy(internalPollFirstEntry());
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> higherEntry(K key) {
return immutableCopy(find(key, HIGHER));
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> floorEntry(K key) {
return immutableCopy(find(key, FLOOR));
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> ceilingEntry(K key) {
return immutableCopy(find(key, CEILING));
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> pollLastEntry() {
return immutableCopy(internalPollLastEntry());
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> lowerEntry(K key) {
return immutableCopy(find(key, LOWER));
}
代码示例来源:origin: robovm/robovm
public Entry<K, V> firstEntry() {
return immutableCopy(root == null ? null : root.first());
}
代码示例来源:origin: MobiVM/robovm
public Entry<K, V> firstEntry() {
return immutableCopy(root == null ? null : root.first());
}
代码示例来源:origin: MobiVM/robovm
public Entry<K, V> lastEntry() {
return immutableCopy(root == null ? null : root.last());
}
代码示例来源:origin: MobiVM/robovm
public Entry<K, V> higherEntry(K key) {
return immutableCopy(find(key, HIGHER));
}
代码示例来源:origin: MobiVM/robovm
public Entry<K, V> pollLastEntry() {
return immutableCopy(internalPollLastEntry());
}
代码示例来源:origin: ibinti/bugvm
public Entry<K, V> firstEntry() {
return immutableCopy(root == null ? null : root.first());
}
代码示例来源:origin: ibinti/bugvm
public Entry<K, V> lastEntry() {
return immutableCopy(root == null ? null : root.last());
}
代码示例来源:origin: ibinti/bugvm
public Entry<K, V> higherEntry(K key) {
return immutableCopy(find(key, HIGHER));
}
代码示例来源:origin: com.mobidevelop.robovm/robovm-rt
public Entry<K, V> ceilingEntry(K key) {
return immutableCopy(find(key, CEILING));
}
代码示例来源:origin: com.bugvm/bugvm-rt
public Entry<K, V> firstEntry() {
return immutableCopy(root == null ? null : root.first());
}
代码示例来源:origin: com.bugvm/bugvm-rt
public Entry<K, V> pollFirstEntry() {
return immutableCopy(internalPollFirstEntry());
}
代码示例来源:origin: com.bugvm/bugvm-rt
public Entry<K, V> ceilingEntry(K key) {
return immutableCopy(find(key, CEILING));
}
代码示例来源:origin: com.gluonhq/robovm-rt
public Entry<K, V> lowerEntry(K key) {
return immutableCopy(find(key, LOWER));
}
内容来源于网络,如有侵权,请联系作者删除!