Package | Description |
---|---|
com.stevewedig.blog.digraph.id_graph | |
com.stevewedig.blog.digraph.node | |
com.stevewedig.blog.digraph.node_graph | |
com.stevewedig.blog.digraph.node_graph_partial |
Modifier and Type | Class and Description |
---|---|
class |
IdTreeClass<Id>
An implementation of IdTree.
|
Modifier and Type | Method and Description |
---|---|
IdTree<Id> |
IdTreeClass.ancestorIdGraph(Id id,
boolean inclusive) |
IdTree<Id> |
IdTree.ancestorIdGraph(Id id,
boolean inclusive) |
IdTree<Id> |
IdTreeClass.ancestorIdGraph(Set<Id> ids,
boolean inclusive) |
IdTree<Id> |
IdTree.ancestorIdGraph(Set<Id> ids,
boolean inclusive) |
IdTree<Id> |
IdTreeClass.descendantIdTree(Id id) |
IdTree<Id> |
IdTree.descendantIdTree(Id id) |
static <Id> IdTree<Id> |
IdTreeLib.fromChildMap(Id... alternatingIdsAndChildIds)
Create an IdTree from a mapping from id to child ids (specified as alternating keys and values), assuming all ids are in that mapping.
|
static <Id> IdTree<Id> |
IdTreeLib.fromChildMap(com.google.common.collect.Multimap<Id,Id> id__childIds)
Create an IdTree from a mapping from id to child ids (specified as a multimap), assuming all ids are in that mapping.
|
static <Id> IdTree<Id> |
IdTreeLib.fromChildMap(Set<Id> idSet,
Id... alternatingIdsAndChildIds)
Create an IdTree from the tree's id set and a mapping from id to child ids (specified as alternating keys and values).
|
static <Id> IdTree<Id> |
IdTreeLib.fromChildMap(Set<Id> idSet,
com.google.common.collect.Multimap<Id,Id> id__childIds)
Create an IdTree from the tree's id set and a mapping from id to child ids (specified as a multimap).
|
static <Id> IdTree<Id> |
IdTreeLib.fromParentMap(Id... alternatingIdsAndParentIds)
Create an IdTree from a mapping from id to parent ids (specified as alternating keys and values), assuming all ids are in that mapping.
|
static <Id> IdTree<Id> |
IdTreeLib.fromParentMap(com.google.common.collect.Multimap<Id,Id> id__parentIds)
Create an IdTree from a mapping from id to parent ids (specified as a multimap), assuming all ids are in that mapping.
|
static <Id> IdTree<Id> |
IdTreeLib.fromParentMap(Set<Id> idSet,
Id... alternatingIdsAndParentIds)
Create an IdTree from the tree's id set and a mapping from id to parent ids (specified as alternating keys and values).
|
static <Id> IdTree<Id> |
IdTreeLib.fromParentMap(Set<Id> idSet,
com.google.common.collect.Multimap<Id,Id> id__parentIds)
Create an IdTree from the tree's id set and a mapping from id to parent ids (specified as a multimap).
|
Modifier and Type | Method and Description |
---|---|
static <Id,Node extends DownNode<Id>> |
DownNodeLib.nodes__idTree(com.google.common.collect.ImmutableSet<Node> nodes)
Create an IdTree from a DownNode iterable.
|
static <Id,Node extends UpNode<Id>> |
UpNodeLib.nodes__idTree(com.google.common.collect.ImmutableSet<Node> nodes)
Create an IdTree from an UpNode iterable.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Tree<Id,Node>
A tree containing nodes.
|
Modifier and Type | Class and Description |
---|---|
class |
TreeClass<Id,Node>
An implementation of Tree.
|
Modifier and Type | Method and Description |
---|---|
IdTree<Id> |
TreeClass.ancestorIdGraph(Id id,
boolean inclusive) |
IdTree<Id> |
TreeClass.ancestorIdGraph(Set<Id> ids,
boolean inclusive) |
IdTree<Id> |
TreeClass.descendantIdTree(Id id) |
IdTree<Id> |
TreeClass.idGraph() |
Modifier and Type | Method and Description |
---|---|
static <Id,Node> Tree<Id,Node> |
TreeLib.tree(IdTree<Id> idTree,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node)
Create a Tree from the nested IdTree (the arc structure) and the mapping between id and node.
|
Constructor and Description |
---|
TreeClass(IdTree<Id> idTree,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node,
boolean allowPartial) |
Modifier and Type | Interface and Description |
---|---|
interface |
PartialTree<Id,Node>
A partial tree containing nodes.
|
Modifier and Type | Method and Description |
---|---|
IdTree<Id> |
PartialTree.idGraph()
The internal id tree.
|
Modifier and Type | Method and Description |
---|---|
static <Id,Node> PartialTree<Id,Node> |
PartialTreeLib.tree(IdTree<Id> idTree,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node)
Create a PartialTree from the nested IdTree (the arc structure) and the mapping between id and node.
|
Copyright © 2014. All rights reserved.