Uses of Class
edu.wisc.ssec.mcidasv.util.trie.PatriciaTrie.TrieEntry

Packages that use PatriciaTrie.TrieEntry

Package	Description
edu.wisc.ssec.mcidasv.util.trie

Uses of PatriciaTrie.TrieEntry in edu.wisc.ssec.mcidasv.util.trie

Fields in edu.wisc.ssec.mcidasv.util.trie declared as PatriciaTrie.TrieEntry

Modifier and Type	Field and Description
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.NodeIterator.current
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.SingletonIterator.entry
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.TrieEntry.left The left child of this entry.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.NodeIterator.next
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.TrieEntry.parent The parent of this entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.TrieEntry.predecessor The entry who uplinks to this entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.PrefixSubMap.PrefixEntrySetView.prefixStart
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.TrieEntry.right The right child of this entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.root Root element of the Trie.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.PrefixEntryIterator.subtree

Methods in edu.wisc.ssec.mcidasv.util.trie that return PatriciaTrie.TrieEntry

Modifier and Type	Method and Description
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.addEntry(PatriciaTrie.TrieEntry<K,V> toAdd, int keyLength) Adds the given entry into the Trie.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.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.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.NodeIterator.findNext(PatriciaTrie.TrieEntry<K,V> prior)
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.PrefixEntryIterator.findNext(PatriciaTrie.TrieEntry<K,V> prior)
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.firstEntry() Returns the first entry the Trie is storing.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.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.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.followLeft(PatriciaTrie.TrieEntry<K,V> node) Goes left through the tree until it finds a valid node.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.followRight(PatriciaTrie.TrieEntry<K,V> node) Traverses down the right path until it finds an uplink.
(package private) PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.getEntry(Object k) Returns the entry associated with the specified key in the PatriciaTrie.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.getNearestEntryForKey(K key, int keyLength) Returns the nearest entry for a given key.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.higherEntry(K key) Returns an entry strictly higher than the given key, or null if no such entry exists.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.lastEntry() Returns the last entry the Trie is storing.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.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.
(package private) PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.NodeIterator.nextEntry()
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntry(PatriciaTrie.TrieEntry<K,V> node) Returns the entry lexicographically after the given entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryImpl(PatriciaTrie.TrieEntry<K,V> start, PatriciaTrie.TrieEntry<K,V> previous, PatriciaTrie.TrieEntry<K,V> tree) Scans for the next node, starting at the specified point, and using 'previous' as a hint that the last node we returned was 'previous' (so we know not to return it again).
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryInSubtree(PatriciaTrie.TrieEntry<K,V> node, PatriciaTrie.TrieEntry<K,V> parentOfSubtree) Returns the entry lexicographically after the given entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.previousEntry(PatriciaTrie.TrieEntry<K,V> start) Returns the node lexicographically before the given node (or null if none).
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.subtree(K prefix, int offset, int length) Finds the subtree that contains the prefix.

Methods in edu.wisc.ssec.mcidasv.util.trie with parameters of type PatriciaTrie.TrieEntry

Modifier and Type	Method and Description
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.addEntry(PatriciaTrie.TrieEntry<K,V> toAdd, int keyLength) Adds the given entry into the Trie.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.NodeIterator.findNext(PatriciaTrie.TrieEntry<K,V> prior)
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.PrefixEntryIterator.findNext(PatriciaTrie.TrieEntry<K,V> prior)
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.followLeft(PatriciaTrie.TrieEntry<K,V> node) Goes left through the tree until it finds a valid node.
protected PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.followRight(PatriciaTrie.TrieEntry<K,V> node) Traverses down the right path until it finds an uplink.
private boolean	PatriciaTrie.isValidUplink(PatriciaTrie.TrieEntry<K,V> next, PatriciaTrie.TrieEntry<K,V> from) Returns true if 'next' is a valid uplink coming from 'from'.
private boolean	PatriciaTrie.isValidUplink(PatriciaTrie.TrieEntry<K,V> next, PatriciaTrie.TrieEntry<K,V> from) Returns true if 'next' is a valid uplink coming from 'from'.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntry(PatriciaTrie.TrieEntry<K,V> node) Returns the entry lexicographically after the given entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryImpl(PatriciaTrie.TrieEntry<K,V> start, PatriciaTrie.TrieEntry<K,V> previous, PatriciaTrie.TrieEntry<K,V> tree) Scans for the next node, starting at the specified point, and using 'previous' as a hint that the last node we returned was 'previous' (so we know not to return it again).
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryImpl(PatriciaTrie.TrieEntry<K,V> start, PatriciaTrie.TrieEntry<K,V> previous, PatriciaTrie.TrieEntry<K,V> tree) Scans for the next node, starting at the specified point, and using 'previous' as a hint that the last node we returned was 'previous' (so we know not to return it again).
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryImpl(PatriciaTrie.TrieEntry<K,V> start, PatriciaTrie.TrieEntry<K,V> previous, PatriciaTrie.TrieEntry<K,V> tree) Scans for the next node, starting at the specified point, and using 'previous' as a hint that the last node we returned was 'previous' (so we know not to return it again).
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryInSubtree(PatriciaTrie.TrieEntry<K,V> node, PatriciaTrie.TrieEntry<K,V> parentOfSubtree) Returns the entry lexicographically after the given entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.nextEntryInSubtree(PatriciaTrie.TrieEntry<K,V> node, PatriciaTrie.TrieEntry<K,V> parentOfSubtree) Returns the entry lexicographically after the given entry.
private PatriciaTrie.TrieEntry<K,V>	PatriciaTrie.previousEntry(PatriciaTrie.TrieEntry<K,V> start) Returns the node lexicographically before the given node (or null if none).
private V	PatriciaTrie.removeEntry(PatriciaTrie.TrieEntry<K,V> h) Removes a single entry from the Trie.
private void	PatriciaTrie.removeExternalEntry(PatriciaTrie.TrieEntry<K,V> h) Removes an external entry from the Trie.
private void	PatriciaTrie.removeInternalEntry(PatriciaTrie.TrieEntry<K,V> h) Removes an internal entry from the Trie.
private boolean	PatriciaTrie.selectR(PatriciaTrie.TrieEntry<K,V> h, int bitIndex, K key, int keyLength, PatriciaTrie.TrieEntry[] result) This is equivalent to the other selectR() method but without its overhead because we're selecting only one best matching Entry from the Trie.
private boolean	PatriciaTrie.selectR(PatriciaTrie.TrieEntry<K,V> h, int bitIndex, K key, int keyLength, PatriciaTrie.TrieEntry[] result) This is equivalent to the other selectR() method but without its overhead because we're selecting only one best matching Entry from the Trie.
private boolean	PatriciaTrie.selectR(PatriciaTrie.TrieEntry<K,V> h, int bitIndex, K key, int keyLength, Trie.Cursor<? super K,? super V> cursor, PatriciaTrie.TrieEntry[] result)
private boolean	PatriciaTrie.selectR(PatriciaTrie.TrieEntry<K,V> h, int bitIndex, K key, int keyLength, Trie.Cursor<? super K,? super V> cursor, PatriciaTrie.TrieEntry[] result)

Constructors in edu.wisc.ssec.mcidasv.util.trie with parameters of type PatriciaTrie.TrieEntry

Constructor and Description
NodeIterator(PatriciaTrie.TrieEntry<K,V> firstEntry)
PrefixEntryIterator(PatriciaTrie.TrieEntry<K,V> startScan, K prefix, int offset, int length)
SingletonIterator(PatriciaTrie.TrieEntry<K,V> entry)
SubMapEntryIterator(PatriciaTrie.TrieEntry<K,V> first, PatriciaTrie.TrieEntry<K,V> firstExcluded)
SubMapEntryIterator(PatriciaTrie.TrieEntry<K,V> first, PatriciaTrie.TrieEntry<K,V> firstExcluded)