| 
 | org.openide.nodes 7.0 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.openide.nodes.Children
public abstract class Children
Container for array of nodes.
 Can be associated with a node and then
 all children in the array have that node set as a parent, and this list
 will be returned as the node's children.
 
Probably you want to subclass Children.Keys.
 Subclassing Children directly is not recommended.
| Nested Class Summary | |
|---|---|
| static class | Children.ArrayImplements the storage of node children by an array. | 
| static class | Children.Keys<T>Implements an array of child nodes associated nonuniquely with keys and sorted by these keys. | 
| static class | Children.Map<T>Implements the storage of node children by a map. | 
| static class | Children.SortedArrayMaintains a list of children sorted by the provided comparator in an array. | 
| static class | Children.SortedMap<T>Maintains a list of children sorted by the provided comparator in a map. | 
| Field Summary | |
|---|---|
| static Children | LEAFThe object representing an empty set of children. | 
| static Mutex | MUTEXLock for access to hierarchy of all node lists. | 
| Constructor Summary | |
|---|---|
| Children()Constructor. | |
| Method Summary | |
|---|---|
| abstract  boolean | add(Node[] nodes)Add nodes to this container but do not call this method. | 
| protected  void | addNotify()Called when children are first asked for nodes. | 
| protected  Object | clone()Handles cloning in the right way, that can be later extended by subclasses. | 
|  Node | findChild(String name)Find a child node by name. | 
| protected  Node | getNode()Get the parent node of these children. | 
|  Node[] | getNodes()Get a (sorted) array of nodes in this list. | 
|  Node[] | getNodes(boolean optimalResult)Get a (sorted) array of nodes in this list. | 
|  int | getNodesCount()Get the number of nodes in the list. | 
| protected  boolean | isInitialized()Method that can be used to test whether the children content has ever been used or it is still not initalized. | 
|  Enumeration<Node> | nodes()Get the nodes as an enumeration. | 
| abstract  boolean | remove(Node[] nodes)Remove nodes from the list. | 
| protected  void | removeNotify()Called when the list of nodes for this children object is no longer needed. | 
| Methods inherited from class java.lang.Object | 
|---|
| equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait | 
| Field Detail | 
|---|
public static final Mutex MUTEX
 All operations on the hierarchy of nodes (add, remove, etc.) are
 done in the Mutex.writeAccess(org.openide.util.Mutex.Action method of this lock, so if someone
 needs for a certain amount of time to forbid modification,
 he can execute his code in Mutex.readAccess(org.openide.util.Mutex.Action.
public static final Children LEAF
| Constructor Detail | 
|---|
public Children()
| Method Detail | 
|---|
protected final Node getNode()
null if there is none yetprotected Object clone() throws CloneNotSupportedException
Cloneable interface, otherwise this method throws
 CloneNotSupportedException.
Cloneable interface is not implemented
CloneNotSupportedExceptionpublic abstract boolean add(Node[] nodes)
Children.Keys.setKeys(java.util.Collection extends T>) instead.
 The parent node of these nodes
 is changed to the parent node of this list. Each node can be added
 only once. If there is some reason a node cannot be added, for example
 if the node expects only a special type of subnodes, the method should
 do nothing and return false to signal that the addition has not been successful.
 This method should be implemented by subclasses to filter some nodes, etc.
nodes - set of nodes to add to the list
true if successfully addedpublic abstract boolean remove(Node[] nodes)
nodes - nodes to be removed
true if the nodes could be removedpublic final Enumeration<Node> nodes()
public Node findChild(String name)
Normally the list of nodes should have been computed by the time this returns,
 but see getNodes() for an important caveat as to why this may not
 be doing what you want and what to do instead.
name - (code) name of child node to find or null if any arbitrary child may
    be returned
null if it could not be foundprotected final boolean isInitialized()
addNotify()public final Node[] getNodes()
addNotify()) before
 the nodes are returned.
 Warning: not all children
 implementations do a complete calculation at
 this point, see getNodes(boolean)
public Node[] getNodes(boolean optimalResult)
DataFolder.getChildren()
 is a much more appropriate way to get what you want for the case of folder children.
 If you're extending children, you should make sure this method
 will return a complete list of nodes. The default implementation will do
 this correctly so long as your subclass implement findChild(null)
 to initialize all subnodes.
 Note:You should not call this method from inside
 Children.MUTEX.readAccess()Node will be unable to update its state
 before you leave the readAccess().
optimalResult - whether to try to get a fully initialized array
 or to simply delegate to getNodes()
public final int getNodesCount()
protected void addNotify()
Children.Keys etc.).
isInitialized()protected void removeNotify()
Children.Keys etc.).
| 
 | org.openide.nodes 7.0 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||