Class AbstractPatriciaTrie<K,V>
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- org.apache.commons.collections4.trie.AbstractBitwiseTrie<K,V>
-
- org.apache.commons.collections4.trie.AbstractPatriciaTrie<K,V>
-
- All Implemented Interfaces:
java.io.Serializable
,java.util.Map<K,V>
,java.util.SortedMap<K,V>
,Get<K,V>
,IterableGet<K,V>
,IterableMap<K,V>
,IterableSortedMap<K,V>
,OrderedMap<K,V>
,Put<K,V>
,Trie<K,V>
- Direct Known Subclasses:
PatriciaTrie
abstract class AbstractPatriciaTrie<K,V> extends AbstractBitwiseTrie<K,V>
This class implements the base PATRICIA algorithm and everything that is related to theMap
interface.- Since:
- 4.0
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description private class
AbstractPatriciaTrie.EntrySet
This is a entry set view of theTrie
as returned byMap.entrySet()
.private class
AbstractPatriciaTrie.KeySet
This is a key set view of theTrie
as returned byMap.keySet()
.private class
AbstractPatriciaTrie.PrefixRangeEntrySet
A prefixAbstractPatriciaTrie.RangeEntrySet
view of theTrie
.private class
AbstractPatriciaTrie.PrefixRangeMap
A submap used for prefix views over theTrie
.private class
AbstractPatriciaTrie.RangeEntryMap
AAbstractPatriciaTrie.RangeMap
that deals withMap.Entry
s.private class
AbstractPatriciaTrie.RangeEntrySet
ASet
view of aAbstractPatriciaTrie.RangeMap
.private class
AbstractPatriciaTrie.RangeMap
A range view of theTrie
.private static class
AbstractPatriciaTrie.Reference<E>
AAbstractPatriciaTrie.Reference
allows us to return something through a Method's argument list.protected static class
AbstractPatriciaTrie.TrieEntry<K,V>
ATrie
is a set ofAbstractPatriciaTrie.TrieEntry
nodes.(package private) class
AbstractPatriciaTrie.TrieIterator<E>
An iterator for the entries.private class
AbstractPatriciaTrie.TrieMapIterator
AnOrderedMapIterator
for aTrie
.private class
AbstractPatriciaTrie.Values
This is a value view of theTrie
as returned byMap.values()
.-
Nested classes/interfaces inherited from class org.apache.commons.collections4.trie.AbstractBitwiseTrie
AbstractBitwiseTrie.BasicEntry<K,V>
-
-
Field Summary
Fields Modifier and Type Field Description private java.util.Set<java.util.Map.Entry<K,V>>
entrySet
private java.util.Set<K>
keySet
Each of these fields are initialized to contain an instance of the appropriate view the first time this view is requested.protected int
modCount
The number of times thisTrie
has been modified.private AbstractPatriciaTrie.TrieEntry<K,V>
root
The root node of theTrie
.private static long
serialVersionUID
private int
size
The current size of theTrie
.private java.util.Collection<V>
values
-
Constructor Summary
Constructors Modifier Constructor Description protected
AbstractPatriciaTrie(KeyAnalyzer<? super K> keyAnalyzer)
protected
AbstractPatriciaTrie(KeyAnalyzer<? super K> keyAnalyzer, java.util.Map<? extends K,? extends V> map)
Constructs a neworg.apache.commons.collections4.Trie Trie
using the givenKeyAnalyzer
and initializes theTrie
with the values from the providedMap
.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description (package private) AbstractPatriciaTrie.TrieEntry<K,V>
addEntry(AbstractPatriciaTrie.TrieEntry<K,V> entry, int lengthInBits)
Adds the givenAbstractPatriciaTrie.TrieEntry
to theTrie
.(package private) AbstractPatriciaTrie.TrieEntry<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.void
clear()
java.util.Comparator<? super K>
comparator()
boolean
containsKey(java.lang.Object k)
(package private) void
decrementSize()
A helper method to decrement theTrie
size and increment the modification counter.java.util.Set<java.util.Map.Entry<K,V>>
entrySet()
(package private) AbstractPatriciaTrie.TrieEntry<K,V>
firstEntry()
Returns the first entry theTrie
is storing.K
firstKey()
Gets the first key currently in this map.(package private) AbstractPatriciaTrie.TrieEntry<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.(package private) AbstractPatriciaTrie.TrieEntry<K,V>
followLeft(AbstractPatriciaTrie.TrieEntry<K,V> node)
Goes left through the tree until it finds a valid node.(package private) AbstractPatriciaTrie.TrieEntry<K,V>
followRight(AbstractPatriciaTrie.TrieEntry<K,V> node)
Traverses down the right path until it finds an uplink.V
get(java.lang.Object k)
(package private) AbstractPatriciaTrie.TrieEntry<K,V>
getEntry(java.lang.Object k)
Returns the entry associated with the specified key in the PatriciaTrieBase.(package private) AbstractPatriciaTrie.TrieEntry<K,V>
getNearestEntryForKey(K key, int lengthInBits)
Returns the nearest entry for a given key.private java.util.SortedMap<K,V>
getPrefixMapByBits(K key, int offsetInBits, int lengthInBits)
Returns a view of thisTrie
of all elements that are prefixed by the number of bits in the given Key.java.util.SortedMap<K,V>
headMap(K toKey)
(package private) AbstractPatriciaTrie.TrieEntry<K,V>
higherEntry(K key)
Returns an entry strictly higher than the given key, or null if no such entry exists.private void
incrementModCount()
A helper method to increment the modification counter.(package private) void
incrementSize()
A helper method to increment theTrie
size and the modification counter.(package private) static boolean
isValidUplink(AbstractPatriciaTrie.TrieEntry<?,?> next, AbstractPatriciaTrie.TrieEntry<?,?> from)
Returns true if 'next' is a valid uplink coming from 'from'.java.util.Set<K>
keySet()
(package private) AbstractPatriciaTrie.TrieEntry<K,V>
lastEntry()
Returns the last entry theTrie
is storing.K
lastKey()
Gets the last key currently in this map.(package private) AbstractPatriciaTrie.TrieEntry<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.OrderedMapIterator<K,V>
mapIterator()
Obtains anOrderedMapIterator
over the map.(package private) AbstractPatriciaTrie.TrieEntry<K,V>
nextEntry(AbstractPatriciaTrie.TrieEntry<K,V> node)
Returns the entry lexicographically after the given entry.(package private) AbstractPatriciaTrie.TrieEntry<K,V>
nextEntryImpl(AbstractPatriciaTrie.TrieEntry<K,V> start, AbstractPatriciaTrie.TrieEntry<K,V> previous, AbstractPatriciaTrie.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).(package private) AbstractPatriciaTrie.TrieEntry<K,V>
nextEntryInSubtree(AbstractPatriciaTrie.TrieEntry<K,V> node, AbstractPatriciaTrie.TrieEntry<K,V> parentOfSubtree)
Returns the entry lexicographically after the given entry.K
nextKey(K key)
Gets the next key after the one specified.java.util.SortedMap<K,V>
prefixMap(K key)
Returns a view of thisTrie
of all elements that are prefixed by the given key.(package private) AbstractPatriciaTrie.TrieEntry<K,V>
previousEntry(AbstractPatriciaTrie.TrieEntry<K,V> start)
Returns the node lexicographically before the given node (or null if none).K
previousKey(K key)
Gets the previous key before the one specified.V
put(K key, V value)
Note that the return type is Object, rather than V as in the Map interface.private void
readObject(java.io.ObjectInputStream stream)
Reads the content of the stream.V
remove(java.lang.Object k)
(package private) V
removeEntry(AbstractPatriciaTrie.TrieEntry<K,V> h)
Removes a single entry from theTrie
.private void
removeExternalEntry(AbstractPatriciaTrie.TrieEntry<K,V> h)
Removes an external entry from theTrie
.private void
removeInternalEntry(AbstractPatriciaTrie.TrieEntry<K,V> h)
Removes an internal entry from theTrie
.java.util.Map.Entry<K,V>
select(K key)
Returns theMap.Entry
whose key is closest in a bitwise XOR metric to the given key.K
selectKey(K key)
Returns the key that is closest in a bitwise XOR metric to the provided key.private boolean
selectR(AbstractPatriciaTrie.TrieEntry<K,V> h, int bitIndex, K key, int lengthInBits, AbstractPatriciaTrie.Reference<java.util.Map.Entry<K,V>> reference)
This is equivalent to the other#selectR(TrieEntry, int, Object, int, Cursor, Reference)
method but without its overhead because we're selecting only one best matching Entry from theTrie
.V
selectValue(K key)
Returns the value whose key is closest in a bitwise XOR metric to the provided key.int
size()
java.util.SortedMap<K,V>
subMap(K fromKey, K toKey)
(package private) AbstractPatriciaTrie.TrieEntry<K,V>
subtree(K prefix, int offsetInBits, int lengthInBits)
Finds the subtree that contains the prefix.java.util.SortedMap<K,V>
tailMap(K fromKey)
java.util.Collection<V>
values()
private void
writeObject(java.io.ObjectOutputStream stream)
Writes the content to the stream for serialization.-
Methods inherited from class org.apache.commons.collections4.trie.AbstractBitwiseTrie
bitIndex, bitsPerElement, castKey, compare, compareKeys, getKeyAnalyzer, isBitSet, lengthInBits, toString
-
Methods inherited from class java.util.AbstractMap
clone, containsValue, equals, hashCode, isEmpty, putAll
-
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.apache.commons.collections4.Get
containsValue, isEmpty
-
-
-
-
Field Detail
-
serialVersionUID
private static final long serialVersionUID
- See Also:
- Constant Field Values
-
root
private transient AbstractPatriciaTrie.TrieEntry<K,V> root
The root node of theTrie
.
-
keySet
private transient volatile java.util.Set<K> keySet
Each of these fields are initialized to contain an instance of the appropriate view the first time this view is requested. The views are stateless, so there's no reason to create more than one of each.
-
values
private transient volatile java.util.Collection<V> values
-
size
private transient int size
The current size of theTrie
.
-
modCount
protected transient int modCount
The number of times thisTrie
has been modified. It's used to detect concurrent modifications and fail-fast theIterator
s.
-
-
Constructor Detail
-
AbstractPatriciaTrie
protected AbstractPatriciaTrie(KeyAnalyzer<? super K> keyAnalyzer)
-
AbstractPatriciaTrie
protected AbstractPatriciaTrie(KeyAnalyzer<? super K> keyAnalyzer, java.util.Map<? extends K,? extends V> map)
Constructs a neworg.apache.commons.collections4.Trie Trie
using the givenKeyAnalyzer
and initializes theTrie
with the values from the providedMap
.
-
-
Method Detail
-
clear
public void clear()
-
size
public int size()
-
incrementSize
void incrementSize()
A helper method to increment theTrie
size and the modification counter.
-
decrementSize
void decrementSize()
A helper method to decrement theTrie
size and increment the modification counter.
-
incrementModCount
private void incrementModCount()
A helper method to increment the modification counter.
-
put
public V put(K key, V value)
Description copied from interface:Put
Note that the return type is Object, rather than V as in the Map interface. See the class Javadoc for further info.- Specified by:
put
in interfacejava.util.Map<K,V>
- Specified by:
put
in interfacePut<K,V>
- Overrides:
put
in classjava.util.AbstractMap<K,V>
- Parameters:
key
- key with which the specified value is to be associatedvalue
- value to be associated with the specified key- Returns:
- the previous value associated with
key
, ornull
if there was no mapping forkey
. (Anull
return can also indicate that the map previously associatednull
withkey
, if the implementation supportsnull
values.) - See Also:
Map.put(Object, Object)
-
addEntry
AbstractPatriciaTrie.TrieEntry<K,V> addEntry(AbstractPatriciaTrie.TrieEntry<K,V> entry, int lengthInBits)
Adds the givenAbstractPatriciaTrie.TrieEntry
to theTrie
.
-
get
public V get(java.lang.Object k)
- Specified by:
get
in interfaceGet<K,V>
- Specified by:
get
in interfacejava.util.Map<K,V>
- Overrides:
get
in classjava.util.AbstractMap<K,V>
- Parameters:
k
- the key whose associated value is to be returned- Returns:
- the value to which the specified key is mapped, or
null
if this map contains no mapping for the key - See Also:
Map.get(Object)
-
getEntry
AbstractPatriciaTrie.TrieEntry<K,V> getEntry(java.lang.Object k)
Returns the entry associated with the specified key in the PatriciaTrieBase. Returns null if the map contains no mapping for this key.This may throw ClassCastException if the object is not of type K.
-
select
public java.util.Map.Entry<K,V> select(K key)
Returns theMap.Entry
whose key is closest in a bitwise XOR metric to the given key. This is NOT lexicographic closeness. For example, given the keys:- D = 1000100
- H = 1001000
- L = 1001100
Trie
contained 'H' and 'L', a lookup of 'D' would return 'L', because the XOR distance between D & L is smaller than the XOR distance between D & H.- Parameters:
key
- the key to use in the search- Returns:
- the
Map.Entry
whose key is closest in a bitwise XOR metric to the provided key
-
selectKey
public K selectKey(K key)
Returns the key that is closest in a bitwise XOR metric to the provided key. This is NOT lexicographic closeness! For example, given the keys:- D = 1000100
- H = 1001000
- L = 1001100
Trie
contained 'H' and 'L', a lookup of 'D' would return 'L', because the XOR distance between D & L is smaller than the XOR distance between D & H.- Parameters:
key
- the key to use in the search- Returns:
- the key that is closest in a bitwise XOR metric to the provided key
-
selectValue
public V selectValue(K key)
Returns the value whose key is closest in a bitwise XOR metric to the provided key. This is NOT lexicographic closeness! For example, given the keys:- D = 1000100
- H = 1001000
- L = 1001100
Trie
contained 'H' and 'L', a lookup of 'D' would return 'L', because the XOR distance between D & L is smaller than the XOR distance between D & H.- Parameters:
key
- the key to use in the search- Returns:
- the value whose key is closest in a bitwise XOR metric to the provided key
-
selectR
private boolean selectR(AbstractPatriciaTrie.TrieEntry<K,V> h, int bitIndex, K key, int lengthInBits, AbstractPatriciaTrie.Reference<java.util.Map.Entry<K,V>> reference)
This is equivalent to the other#selectR(TrieEntry, int, Object, int, Cursor, Reference)
method but without its overhead because we're selecting only one best matching Entry from theTrie
.
-
containsKey
public boolean containsKey(java.lang.Object k)
- Specified by:
containsKey
in interfaceGet<K,V>
- Specified by:
containsKey
in interfacejava.util.Map<K,V>
- Overrides:
containsKey
in classjava.util.AbstractMap<K,V>
- Parameters:
k
- key whose presence in this map is to be tested- Returns:
true
if this map contains a mapping for the specified key- See Also:
Map.containsKey(Object)
-
entrySet
public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
- Specified by:
entrySet
in interfaceGet<K,V>
- Specified by:
entrySet
in interfacejava.util.Map<K,V>
- Specified by:
entrySet
in interfacejava.util.SortedMap<K,V>
- Specified by:
entrySet
in classjava.util.AbstractMap<K,V>
- Returns:
- a set view of the mappings contained in this map
- See Also:
Map.entrySet()
-
keySet
public java.util.Set<K> keySet()
-
values
public java.util.Collection<V> values()
-
remove
public V remove(java.lang.Object k)
- Specified by:
remove
in interfaceGet<K,V>
- Specified by:
remove
in interfacejava.util.Map<K,V>
- Overrides:
remove
in classjava.util.AbstractMap<K,V>
- Parameters:
k
- key whose mapping is to be removed from the map- Returns:
- the previous value associated with
key
, ornull
if there was no mapping forkey
. - Throws:
java.lang.ClassCastException
- if provided key is of an incompatible type- See Also:
Map.remove(Object)
-
getNearestEntryForKey
AbstractPatriciaTrie.TrieEntry<K,V> getNearestEntryForKey(K key, int lengthInBits)
Returns the nearest entry for a given key. This is useful for finding knowing if a given key exists (and finding the value for it), or for inserting the key. The actual get implementation. This is very similar to selectR but with the exception that it might return the root Entry even if it's empty.
-
removeEntry
V removeEntry(AbstractPatriciaTrie.TrieEntry<K,V> h)
Removes a single entry from theTrie
. If we found a Key (Entry h) then figure out if it's an internal (hard to remove) or external Entry (easy to remove)
-
removeExternalEntry
private void removeExternalEntry(AbstractPatriciaTrie.TrieEntry<K,V> h)
Removes an external entry from theTrie
. If it's an external Entry then just remove it. This is very easy and straight forward.
-
removeInternalEntry
private void removeInternalEntry(AbstractPatriciaTrie.TrieEntry<K,V> h)
Removes an internal entry from theTrie
. If it's an internal Entry then "good luck" with understanding this code. The Idea is essentially that Entry p takes Entry h's place in the trie which requires some re-wiring.
-
nextEntry
AbstractPatriciaTrie.TrieEntry<K,V> nextEntry(AbstractPatriciaTrie.TrieEntry<K,V> node)
Returns the entry lexicographically after the given entry. If the given entry is null, returns the first node.
-
nextEntryImpl
AbstractPatriciaTrie.TrieEntry<K,V> nextEntryImpl(AbstractPatriciaTrie.TrieEntry<K,V> start, AbstractPatriciaTrie.TrieEntry<K,V> previous, AbstractPatriciaTrie.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). If 'tree' is non-null, this will limit the search to the given tree. The basic premise is that each iteration can follow the following steps: 1) Scan all the way to the left. a) If we already started from this node last time, proceed to Step 2. b) If a valid uplink is found, use it. c) If the result is an empty node (root not set), break the scan. d) If we already returned the left node, break the scan. 2) Check the right. a) If we already returned the right node, proceed to Step 3. b) If it is a valid uplink, use it. c) Do Step 1 from the right node. 3) Back up through the parents until we encounter find a parent that we're not the right child of. 4) If there's no right child of that parent, the iteration is finished. Otherwise continue to Step 5. 5) Check to see if the right child is a valid uplink. a) If we already returned that child, proceed to Step 6. Otherwise, use it. 6) If the right child of the parent is the parent itself, we've already found & returned the end of the Trie, so exit. 7) Do Step 1 on the parent's right child.
-
firstEntry
AbstractPatriciaTrie.TrieEntry<K,V> firstEntry()
Returns the first entry theTrie
is storing.This is implemented by going always to the left until we encounter a valid uplink. That uplink is the first key.
-
followLeft
AbstractPatriciaTrie.TrieEntry<K,V> followLeft(AbstractPatriciaTrie.TrieEntry<K,V> node)
Goes left through the tree until it finds a valid node.
-
comparator
public java.util.Comparator<? super K> comparator()
-
firstKey
public K firstKey()
Description copied from interface:OrderedMap
Gets the first key currently in this map.- Returns:
- the first key currently in this map
-
lastKey
public K lastKey()
Description copied from interface:OrderedMap
Gets the last key currently in this map.- Returns:
- the last key currently in this map
-
nextKey
public K nextKey(K key)
Description copied from interface:OrderedMap
Gets the next key after the one specified.- Parameters:
key
- the key to search for next from- Returns:
- the next key, null if no match or at end
-
previousKey
public K previousKey(K key)
Description copied from interface:OrderedMap
Gets the previous key before the one specified.- Parameters:
key
- the key to search for previous from- Returns:
- the previous key, null if no match or at start
-
mapIterator
public OrderedMapIterator<K,V> mapIterator()
Description copied from interface:OrderedMap
Obtains anOrderedMapIterator
over the map.A ordered map iterator is an efficient way of iterating over maps in both directions.
- Returns:
- a map iterator
-
prefixMap
public java.util.SortedMap<K,V> prefixMap(K key)
Description copied from interface:Trie
Returns a view of thisTrie
of all elements that are prefixed by the given key.In a
Trie
with fixed size keys, this is essentially aMap.get(Object)
operation.For example, if the
Trie
contains 'Anna', 'Anael', 'Analu', 'Andreas', 'Andrea', 'Andres', and 'Anatole', then a lookup of 'And' would return 'Andreas', 'Andrea', and 'Andres'.- Parameters:
key
- the key used in the search- Returns:
- a
SortedMap
view of thisTrie
with all elements whose key is prefixed by the search key
-
getPrefixMapByBits
private java.util.SortedMap<K,V> getPrefixMapByBits(K key, int offsetInBits, int lengthInBits)
Returns a view of thisTrie
of all elements that are prefixed by the number of bits in the given Key.The view that this returns is optimized to have a very efficient
Iterator
. TheSortedMap.firstKey()
,SortedMap.lastKey()
&Map.size()
methods must iterate over all possible values in order to determine the results. This information is cached until the PATRICIATrie
changes. All other methods (exceptIterator
) must compare the given key to the prefix to ensure that it is within the range of the view. TheIterator
's remove method must also relocate the subtree that contains the prefixes if the entry holding the subtree is removed or changes. Changing the subtree takes O(K) time.- Parameters:
key
- the key to use in the searchoffsetInBits
- the prefix offsetlengthInBits
- the number of significant prefix bits- Returns:
- a
SortedMap
view of thisTrie
with all elements whose key is prefixed by the search key
-
higherEntry
AbstractPatriciaTrie.TrieEntry<K,V> higherEntry(K key)
Returns an entry strictly higher than the given key, or null if no such entry exists.
-
ceilingEntry
AbstractPatriciaTrie.TrieEntry<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.
-
lowerEntry
AbstractPatriciaTrie.TrieEntry<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.
-
floorEntry
AbstractPatriciaTrie.TrieEntry<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.
-
subtree
AbstractPatriciaTrie.TrieEntry<K,V> subtree(K prefix, int offsetInBits, int lengthInBits)
Finds the subtree that contains the prefix. This is very similar to getR but with the difference that we stop the lookup if h.bitIndex > lengthInBits.
-
lastEntry
AbstractPatriciaTrie.TrieEntry<K,V> lastEntry()
Returns the last entry theTrie
is storing.This is implemented by going always to the right until we encounter a valid uplink. That uplink is the last key.
-
followRight
AbstractPatriciaTrie.TrieEntry<K,V> followRight(AbstractPatriciaTrie.TrieEntry<K,V> node)
Traverses down the right path until it finds an uplink.
-
previousEntry
AbstractPatriciaTrie.TrieEntry<K,V> previousEntry(AbstractPatriciaTrie.TrieEntry<K,V> start)
Returns the node lexicographically before the given node (or null if none). This follows four simple branches: - If the uplink that returned us was a right uplink: - If predecessor's left is a valid uplink from predecessor, return it. - Else, follow the right path from the predecessor's left. - If the uplink that returned us was a left uplink: - Loop back through parents until we encounter a node where node != node.parent.left. - If node.parent.left is uplink from node.parent: - If node.parent.left is not root, return it. - If it is root & root isEmpty, return null. - If it is root & root !isEmpty, return root. - If node.parent.left is not uplink from node.parent: - Follow right path for first right child from node.parent.left- Parameters:
start
- the start entry
-
nextEntryInSubtree
AbstractPatriciaTrie.TrieEntry<K,V> nextEntryInSubtree(AbstractPatriciaTrie.TrieEntry<K,V> node, AbstractPatriciaTrie.TrieEntry<K,V> parentOfSubtree)
Returns the entry lexicographically after the given entry. If the given entry is null, returns the first node. This will traverse only within the subtree. If the given node is not within the subtree, this will have undefined results.
-
isValidUplink
static boolean isValidUplink(AbstractPatriciaTrie.TrieEntry<?,?> next, AbstractPatriciaTrie.TrieEntry<?,?> from)
Returns true if 'next' is a valid uplink coming from 'from'.
-
readObject
private void readObject(java.io.ObjectInputStream stream) throws java.io.IOException, java.lang.ClassNotFoundException
Reads the content of the stream.- Throws:
java.io.IOException
java.lang.ClassNotFoundException
-
writeObject
private void writeObject(java.io.ObjectOutputStream stream) throws java.io.IOException
Writes the content to the stream for serialization.- Throws:
java.io.IOException
-
-