K - Key type.V - Value type.@Deprecated public class TreeEntrySet<K extends Comparable,V> extends AbstractSet<Map.Entry<K,V>> implements SortedSet<Map.Entry<K,V>>
| Modifier | Constructor and Description |
|---|---|
|
TreeEntrySet()
Deprecated.
|
protected |
TreeEntrySet(TreeEntrySet<K,V> pParent,
Map.Entry<? extends K,? extends V> pLowerBound,
Map.Entry<? extends K,? extends V> pUpperBound)
Deprecated.
Create an entry set which reveals only a subset of its data.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(Map.Entry<K,V> pEntry)
Deprecated.
|
Map.Entry<K,V> |
ceiling(Map.Entry<K,V> pEntry)
Deprecated.
|
Comparator<? super Map.Entry<? extends K,?>> |
comparator()
Deprecated.
|
Iterator<Map.Entry<K,V>> |
descendingIterator()
Deprecated.
|
Map.Entry<K,V> |
first()
Deprecated.
|
Map.Entry<K,V> |
floor(Map.Entry<K,V> pEntry)
Deprecated.
|
Map.Entry<K,V> |
get(int pIdx)
Deprecated.
Retrieve item at specified index.
|
protected Comparator<? super K> |
getKeyComparator()
Deprecated.
|
TreeEntrySet<K,V> |
headSet(Map.Entry<K,V> pToElement)
Deprecated.
|
Map.Entry<K,V> |
higher(Map.Entry<K,V> pEntry)
Deprecated.
|
Iterator<Map.Entry<K,V>> |
iterator()
Deprecated.
|
Map.Entry<K,V> |
last()
Deprecated.
|
Map.Entry<K,V> |
lower(Map.Entry<K,V> pEntry)
Deprecated.
|
TreeEntrySet<K,V> |
navigableHeadSet(Map.Entry<K,V> pToElement)
Deprecated.
|
TreeEntrySet<K,V> |
navigableSubSet(Map.Entry<K,V> pFromElement,
Map.Entry<K,V> pToElement)
Deprecated.
|
TreeEntrySet<K,V> |
navigableTailSet(Map.Entry<K,V> pFromElement)
Deprecated.
|
Map.Entry<K,V> |
pollFirst()
Deprecated.
|
Map.Entry<K,V> |
pollLast()
Deprecated.
|
int |
size()
Deprecated.
|
TreeEntrySet<K,V> |
subSet(Map.Entry<K,V> pFromElement,
Map.Entry<K,V> pToElement)
Deprecated.
|
TreeEntrySet<K,V> |
tailSet(Map.Entry<K,V> pFromElement)
Deprecated.
|
equals, hashCode, removeAlladdAll, clear, contains, containsAll, isEmpty, remove, retainAll, toArray, toArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitspliteratoraddAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, toArray, toArrayparallelStream, removeIf, streampublic TreeEntrySet()
protected TreeEntrySet(TreeEntrySet<K,V> pParent, Map.Entry<? extends K,? extends V> pLowerBound, Map.Entry<? extends K,? extends V> pUpperBound)
pParent - Parent set which backs new instance.pLowerBound - Inclusive minimum entry.pUpperBound - Exclusive maximum entry.public boolean add(Map.Entry<K,V> pEntry)
add in interface Collection<Map.Entry<K extends Comparable,V>>add in interface Set<Map.Entry<K extends Comparable,V>>add in class AbstractCollection<Map.Entry<K extends Comparable,V>>public int size()
size in interface Collection<Map.Entry<K extends Comparable,V>>size in interface Set<Map.Entry<K extends Comparable,V>>size in class AbstractCollection<Map.Entry<K extends Comparable,V>>public Iterator<Map.Entry<K,V>> iterator()
iterator in interface Iterable<Map.Entry<K extends Comparable,V>>iterator in interface Collection<Map.Entry<K extends Comparable,V>>iterator in interface Set<Map.Entry<K extends Comparable,V>>iterator in class AbstractCollection<Map.Entry<K extends Comparable,V>>protected Comparator<? super K> getKeyComparator()
public Comparator<? super Map.Entry<? extends K,?>> comparator()
comparator in interface SortedSet<Map.Entry<K extends Comparable,V>>public Map.Entry<K,V> get(int pIdx)
IndexOutOfBoundsException - If item does not exist.public TreeEntrySet<K,V> subSet(Map.Entry<K,V> pFromElement, Map.Entry<K,V> pToElement)
public TreeEntrySet<K,V> navigableSubSet(Map.Entry<K,V> pFromElement, Map.Entry<K,V> pToElement)
Copyright © 2023. All rights reserved.