public class DestinationMapNode extends java.lang.Object implements DestinationNode
DestinationMap| Modifier and Type | Field and Description |
|---|---|
protected static java.lang.String |
ANY_CHILD |
protected static java.lang.String |
ANY_DESCENDENT |
| Constructor and Description |
|---|
DestinationMapNode(DestinationMapNode parent) |
| Modifier and Type | Method and Description |
|---|---|
void |
add(java.lang.String[] paths,
int idx,
java.lang.Object value) |
void |
appendDescendantValues(java.util.Set answer) |
void |
appendMatchingValues(java.util.Set<DestinationNode> answer,
java.lang.String[] paths,
int startIndex) |
void |
appendMatchingWildcards(java.util.Set answer,
java.lang.String[] paths,
int idx)
Matches any entries in the map containing wildcards
|
protected DestinationMapNode |
createChildNode()
Factory method to create a child node
|
DestinationNode |
getChild(java.lang.String path)
Returns the child node for the given named path or null if it does not
exist
|
int |
getChildCount() |
DestinationMapNode |
getChildOrCreate(java.lang.String path)
Returns the child node for the given named path, lazily creating one if
it does not yet exist
|
java.util.Collection<DestinationNode> |
getChildren()
Returns the child nodes
|
java.util.Set |
getDesendentValues()
Returns a list of all the values from this node down the tree
|
java.lang.String |
getPath() |
java.util.List |
getValues()
Returns a mutable List of the values available at this node in the tree
|
protected void |
pruneIfEmpty() |
void |
remove(java.lang.String[] paths,
int idx,
java.lang.Object value) |
void |
removeAll(java.util.Set<DestinationNode> answer,
java.lang.String[] paths,
int startIndex) |
protected void |
removeChild(DestinationMapNode node) |
java.util.Set |
removeDesendentValues() |
protected void |
removeDesendentValues(java.util.Set answer) |
java.util.List |
removeValues()
Returns a mutable List of the values available at this node in the tree
|
protected static final java.lang.String ANY_CHILD
protected static final java.lang.String ANY_DESCENDENT
public DestinationMapNode(DestinationMapNode parent)
public DestinationNode getChild(java.lang.String path)
getChild in interface DestinationNodepublic java.util.Collection<DestinationNode> getChildren()
getChildren in interface DestinationNodepublic int getChildCount()
public DestinationMapNode getChildOrCreate(java.lang.String path)
public java.util.List getValues()
getValues in interface DestinationNodepublic java.util.List removeValues()
removeValues in interface DestinationNodepublic java.util.Set removeDesendentValues()
removeDesendentValues in interface DestinationNodeprotected void removeDesendentValues(java.util.Set answer)
public java.util.Set getDesendentValues()
getDesendentValues in interface DestinationNodepublic void add(java.lang.String[] paths, int idx, java.lang.Object value)
public void remove(java.lang.String[] paths, int idx, java.lang.Object value)
public void removeAll(java.util.Set<DestinationNode> answer, java.lang.String[] paths, int startIndex)
public void appendDescendantValues(java.util.Set answer)
appendDescendantValues in interface DestinationNodeprotected DestinationMapNode createChildNode()
public void appendMatchingWildcards(java.util.Set answer, java.lang.String[] paths, int idx)
appendMatchingWildcards in interface DestinationNodepublic void appendMatchingValues(java.util.Set<DestinationNode> answer, java.lang.String[] paths, int startIndex)
appendMatchingValues in interface DestinationNodepublic java.lang.String getPath()
protected void pruneIfEmpty()
protected void removeChild(DestinationMapNode node)
Copyright © 2005-2012. All Rights Reserved.