| Package | Description |
|---|---|
| com.atlassian.clover.util.trie |
| Modifier and Type | Class and Description |
|---|---|
class |
NodeImpl<K,V> |
| Modifier and Type | Field and Description |
|---|---|
protected Node<K,V> |
PrefixTree.rootNode |
| Modifier and Type | Field and Description |
|---|---|
protected Map<K,Node<K,V>> |
NodeImpl.children |
| Modifier and Type | Method and Description |
|---|---|
Node<K,V> |
NodeImpl.addChild(Node<K,V> subNode) |
Node<K,V> |
Node.addChild(Node<K,V> subKey) |
Node<String,PackageInfoExt> |
PackagePrefixTree.compressTree(Node<String,PackageInfoExt> rootNode,
NodeVisitor<String,PackageInfoExt> nodeCompressor) |
<K,V> Node<K,V> |
NodeFactory.createNode(K key,
V value) |
Node<String,V> |
FilePathPrefixTree.find(File filePath) |
Node<K,V> |
PrefixTree.find(KeySequence<K> keySequence)
Search for a key
|
Node<String,V> |
FilePathPrefixTree.findNearest(File filePath) |
Node<K,V> |
PrefixTree.findNearest(KeySequence<K> keySequence)
Search as deep as possible and return the deepest node matching a key sequence.
|
Node<String,V> |
FilePathPrefixTree.findNearestWithValue(File filePath) |
Node<K,V> |
PrefixTree.findNearestWithValue(KeySequence<K> keySequence)
Search as deep as possible and return the deepest node containing a non-null value matching the keySequence.
|
Node<K,V> |
NodeImpl.getChild(K subKey) |
Node<K,V> |
Node.getChild(K subKey) |
Node<K,V> |
PrefixTree.getRootNode() |
protected Node<K,V> |
PrefixTree.rewriteTree(Node<K,V> node,
int depth,
NodeVisitor<K,V> call)
Walk through all the nodes of the prefix tree (including empty intermediate nodes) calling the callback.
|
Node<K,V> |
PrefixTree.rewriteTree(Node<K,V> rootNode,
NodeVisitor<K,V> call)
Walk through all the nodes of the prefix tree (including empty intermediate nodes) calling the callback.
|
Node<K,V> |
NodeVisitor.visit(Node<K,V> node,
int depth)
Visit given node.
|
| Modifier and Type | Method and Description |
|---|---|
Map<K,Node<K,V>> |
NodeImpl.children() |
Map<K,Node<K,V>> |
Node.children() |
<K,V> Map<K,Node<K,V>> |
NodeFactory.cloneChildren(Node<K,V> node)
Make a shallow copy of Node#children()
|
| Modifier and Type | Method and Description |
|---|---|
Node<K,V> |
NodeImpl.addChild(Node<K,V> subNode) |
Node<K,V> |
Node.addChild(Node<K,V> subKey) |
<K,V> Map<K,Node<K,V>> |
NodeFactory.cloneChildren(Node<K,V> node)
Make a shallow copy of Node#children()
|
Node<String,PackageInfoExt> |
PackagePrefixTree.compressTree(Node<String,PackageInfoExt> rootNode,
NodeVisitor<String,PackageInfoExt> nodeCompressor) |
protected Node<K,V> |
PrefixTree.rewriteTree(Node<K,V> node,
int depth,
NodeVisitor<K,V> call)
Walk through all the nodes of the prefix tree (including empty intermediate nodes) calling the callback.
|
Node<K,V> |
PrefixTree.rewriteTree(Node<K,V> rootNode,
NodeVisitor<K,V> call)
Walk through all the nodes of the prefix tree (including empty intermediate nodes) calling the callback.
|
Node<K,V> |
NodeVisitor.visit(Node<K,V> node,
int depth)
Visit given node.
|
protected void |
PrefixTree.walkTree(Node<K,V> node,
int depth,
NodeVisitor<K,V> call)
Walk through all the nodes of the prefix tree (including empty intermediate nodes) calling the callback.
|
void |
PrefixTree.walkTree(Node<K,V> rootNode,
NodeVisitor<K,V> call)
Walk through all the nodes of the prefix tree (including empty intermediate nodes) calling the callback.
|
| Constructor and Description |
|---|
PrefixTree(NodeFactory nodeFactory,
Node<K,V> rootNode) |
| Constructor and Description |
|---|
NodeImpl(K key,
V value,
Map<K,Node<K,V>> children) |
Copyright © 2024 OpenClover.org. All rights reserved.