org.squashtest.tm.domain.library.structures
| Modifier and Type | Class and Description |
|---|---|
class |
LibraryGraph.GraphNodePair |
| Constructor and Description |
|---|
LibraryGraph() |
| Modifier and Type | Method and Description |
|---|---|
void |
addNodes(T parentData,
T childData)
will create either the parent or the child if they didn't exist already
|
<X> List<X> |
collect(org.apache.commons.collections.Transformer transformer) |
List<T> |
filter(org.apache.commons.collections.Predicate predicate) |
<X> List<X> |
filterAndcollect(org.apache.commons.collections.Predicate predicate,
org.apache.commons.collections.Transformer transformer)
first we'll filter, then we'll collect.
|
List<T> |
getChildless() |
T |
getNode(Long key) |
List<T> |
getNodes() |
List<T> |
getOrphans() |
LibraryGraph.GraphNodePair |
newPair() |
LibraryGraph.GraphNodePair |
newPair(T parent,
T child) |
void |
setNodes(List<T> nodes) |
public void addNodes(T parentData, T childData)
parentData - childData - public <X> List<X> collect(org.apache.commons.collections.Transformer transformer)
public <X> List<X> filterAndcollect(org.apache.commons.collections.Predicate predicate, org.apache.commons.collections.Transformer transformer)
public LibraryGraph.GraphNodePair newPair()
public LibraryGraph.GraphNodePair newPair(T parent, T child)
Copyright © 2010-2014 Henix, henix.fr. All Rights Reserved.