Home » jakarta-jmeter-2.3.4_src » org.apache.jorphan.collections » [javadoc | source]
public class: ListedHashTree [javadoc | source]

All Implemented Interfaces:
    Cloneable, Serializable, Map

ListedHashTree is a different implementation of the HashTree collection class. In the ListedHashTree, the order in which values are added is preserved (not to be confused with SortedHashTree , which sorts the order of the values using the compare() function). Any listing of nodes or iteration through the list of nodes of a ListedHashTree will be given in the order in which the nodes were added to the tree.
Fields inherited from org.apache.jorphan.collections.HashTree:
 public ListedHashTree() 
 public ListedHashTree(Object key) 
 public ListedHashTree(Collection keys) 
 public ListedHashTree(Object[] keys) 
Method from org.apache.jorphan.collections.ListedHashTree Summary:
add,   clear,   clone,   createNewTree,   createNewTree,   createNewTree,   equals,   getArray,   hashCode,   keySet,   list,   remove,   replace,   set,   set,   set,   set,   size
Methods from org.apache.jorphan.collections.HashTree:
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
Methods from java.lang.Object:
clone,   equals,   finalize,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from org.apache.jorphan.collections.ListedHashTree Detail:
 public HashTree add(Object key) 
 public  void clear() 
 public Object clone() 
 public HashTree createNewTree() 
 public HashTree createNewTree(Object key) 
 public HashTree createNewTree(Collection values) 
 public boolean equals(Object o) 
 public Object[] getArray() 
 public int hashCode() 
 public Set keySet() 
 public Collection list() 
 public Object remove(Object key) 
 public  void replace(Object currentKey,
    Object newKey) 
 public  void set(Object key,
    Object value) 
 public  void set(Object key,
    HashTree t) 
 public  void set(Object key,
    Object[] values) 
 public  void set(Object key,
    Collection values) 
 public int size()