Serializable
, Cloneable
, Map<Object,HashTree>
public class SortedHashTree extends HashTree implements Serializable
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.Constructor | Description |
---|---|
SortedHashTree() |
|
SortedHashTree(Object key) |
|
SortedHashTree(Object[] keys) |
|
SortedHashTree(Object[] keys,
Comparator<? super Object> comper) |
|
SortedHashTree(Object key,
Comparator<? super Object> comper) |
|
SortedHashTree(Collection<?> keys) |
|
SortedHashTree(Collection<?> keys,
Comparator<? super Object> comper) |
|
SortedHashTree(Comparator<? super Object> comper) |
Modifier and Type | Method | Description |
---|---|---|
protected HashTree |
createNewTree() |
Creates a new tree.
|
protected HashTree |
createNewTree(Object key) |
Creates a new tree.
|
protected HashTree |
createNewTree(Collection<?> values) |
Creates a new tree.
|
add, add, add, add, add, add, add, add, add, add, add, add, add, add, addTreePath, clear, clone, cloneTree, containsKey, containsValue, entrySet, equals, get, getArray, getArray, getArray, getArray, getTree, getTree, getTree, getTreePath, hashCode, isEmpty, keySet, list, list, list, list, put, putAll, remove, replaceKey, search, set, set, set, set, set, set, set, set, set, size, toString, traverse, values
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll
public SortedHashTree()
public SortedHashTree(Comparator<? super Object> comper)
public SortedHashTree(Object key)
public SortedHashTree(Object key, Comparator<? super Object> comper)
public SortedHashTree(Collection<?> keys)
public SortedHashTree(Collection<?> keys, Comparator<? super Object> comper)
public SortedHashTree(Object[] keys)
public SortedHashTree(Object[] keys, Comparator<? super Object> comper)
protected HashTree createNewTree()
createNewTree
in class HashTree
protected HashTree createNewTree(Object key)
createNewTree
in class HashTree
key
- object to use as the key for the top levelHashTree
protected HashTree createNewTree(Collection<?> values)
createNewTree
in class HashTree
values
- objects to be added to the new HashTree
HashTree
Copyright © 1998-2018 Apache Software Foundation. All Rights Reserved.