org.apache.jorphan.collections
Class SortedHashTree
- Cloneable, Map, Serializable
public class SortedHashTree
implements Serializable
SortedHashTree is a different implementation of the
HashTree
collection class. In the SortedHashTree, the ordering of values in the tree
is made explicit via the compare() function of objects added to the tree.
This works in exactly the same fashion as it does for a SortedSet.
SortedHashTree() - Creates an empty new HashTree.
|
SortedHashTree(Collection keys) - Creates a new HashTree and adds all the objects in the given collection
as top-level nodes in the tree.
|
SortedHashTree(Collection keys, Comparator comper)
|
SortedHashTree(Comparator comper)
|
SortedHashTree(Object key) - Creates a new HashTree and adds the given object as a top-level node.
|
SortedHashTree(Object key, Comparator comper)
|
SortedHashTree(Object[] keys) - Creates a new HashTree and adds all the objects in the given array as
top-level nodes in the tree.
|
SortedHashTree(Object[] keys, Comparator comper)
|
add , add , add , add , add , add , add , add , add , add , add , add , add , add , addTreePath , clear , clone , cloneTree , containsKey , containsValue , createNewTree , createNewTree , createNewTree , entrySet , equals , get , getArray , getArray , getArray , getArray , getTree , getTree , getTree , getTreePath , hashCode , isEmpty , keySet , list , list , list , list , put , putAll , remove , replace , search , set , set , set , set , set , set , set , set , set , size , toString , traverse , values |
SortedHashTree
public SortedHashTree()
Creates an empty new HashTree.
SortedHashTree
public SortedHashTree(Collection keys)
Creates a new HashTree and adds all the objects in the given collection
as top-level nodes in the tree.
keys
- a collection of objects to be added to the created HashTree.
SortedHashTree
public SortedHashTree(Collection keys,
Comparator comper)
SortedHashTree
public SortedHashTree(Comparator comper)
SortedHashTree
public SortedHashTree(Object key)
Creates a new HashTree and adds the given object as a top-level node.
SortedHashTree
public SortedHashTree(Object key,
Comparator comper)
SortedHashTree
public SortedHashTree(Object[] keys)
Creates a new HashTree and adds all the objects in the given array as
top-level nodes in the tree.
SortedHashTree
public SortedHashTree(Object[] keys,
Comparator comper)
createNewTree
protected HashTree createNewTree()
Creates a new tree. This method exists to allow inheriting classes to
generate the appropriate types of nodes. For instance, when a node is
added, it's value is a HashTree. Rather than directly calling the
HashTree() constructor, the createNewTree() method is called. Inheriting
classes should override these methods and create the appropriate subclass
of HashTree.
- createNewTree in interface HashTree
createNewTree
protected HashTree createNewTree(Collection values)
Creates a new tree. This method exists to allow inheriting classes to
generate the appropriate types of nodes. For instance, when a node is
added, it's value is a HashTree. Rather than directly calling the
HashTree() constructor, the createNewTree() method is called. Inheriting
classes should override these methods and create the appropriate subclass
of HashTree.
- createNewTree in interface HashTree
createNewTree
protected HashTree createNewTree(Object key)
Creates a new tree. This method exists to allow inheriting classes to
generate the appropriate types of nodes. For instance, when a node is
added, it's value is a HashTree. Rather than directly calling the
HashTree() constructor, the createNewTree() method is called. Inheriting
classes should override these methods and create the appropriate subclass
of HashTree.
- createNewTree in interface HashTree
Copyright © 1998-2010 Apache Software Foundation. All Rights Reserved.