com.stevewedig.blog.digraph.id_graph

Class IdTreeClass<Id>

java.lang.Object

com.stevewedig.blog.value_objects.ObjectMixin

com.stevewedig.blog.value_objects.ValueMixin

com.stevewedig.blog.digraph.id_graph.IdGraphClass<Id>

com.stevewedig.blog.digraph.id_graph.IdDagClass<Id>

com.stevewedig.blog.digraph.id_graph.IdTreeClass<Id>

All Implemented Interfaces:

IdDag<Id>, IdGraph<Id>, IdTree<Id>, HasObjectHelper

public class IdTreeClass<Id>
extends IdDagClass<Id>
implements IdTree<Id>

An implementation of IdTree.

Constructor Summary

Constructors

Constructor and Description
IdTreeClass(com.google.common.collect.ImmutableSet<Id> idSet, com.google.common.collect.ImmutableSetMultimap<Id,Id> id__parentIds)

Method Summary

Methods

Modifier and Type	Method and Description
IdTree<Id>	ancestorIdGraph(Id id, boolean inclusive) Getting an id's ancestor id graph (its, parents' parents, and so on).
IdTree<Id>	ancestorIdGraph(Set<Id> ids, boolean inclusive) Getting an id set's ancestor id graph (their parents, parents' parents, and so on).
com.google.common.collect.ImmutableList<Id>	ancestorIdList(Id id, boolean inclusive) Getting an id's ancestor id list, with the root id first and the id's parent id last.
int	depth(Id id) Getting the size of an id's ancestor list.
IdTree<Id>	descendantIdTree(Id id)
Id	leastDeep(Set<Id> ids) Select the least deep id from a set, non-deterministic if there are ties.
int	maxDepth() The maximum depth in the tree.
Id	mostDeep(Set<Id> ids) Select the most deep id from a set, non-deterministic if there are ties.
com.google.common.base.Optional<Id>	parentId(Id id) Getting an id's parent id, will be absent if the id is the root.
Id	rootId() The tree's root id.

Methods inherited from class com.stevewedig.blog.digraph.id_graph.IdDagClass

breadthIdIterable, breadthIdList, depthIdIterable, depthIdList, descendantIdGraph, descendantIdGraph, filterIdGraph, topsortIdList

Methods inherited from class com.stevewedig.blog.digraph.id_graph.IdGraphClass

ancestorIdIterable, ancestorIdIterable, ancestorIdSet, ancestorIdSet, assertIdsEqual, assertIdsEqual, childIdListLambda, childIdSet, containsCycle, descendantIdIterable, descendantIdIterable, descendantIdSet, descendantIdSet, fields, filterParentMap, id__childIds, id__parentIds, idSet, idSize, isAncestorOf, isChildOf, isDescendantOf, isLeaf, isParentOf, isRoot, leafIdSet, optionalTopsortIdList, parentIdListLambda, parentIdSet, rootIdSet, traverseIdIterable, traverseIdIterable, traverseIdList, traverseIdList

Methods inherited from class com.stevewedig.blog.value_objects.ValueMixin

equals, hashCode, isEntity

Methods inherited from class com.stevewedig.blog.value_objects.ObjectMixin

array, objectHelper, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.stevewedig.blog.digraph.id_graph.IdDag

breadthIdIterable, breadthIdList, depthIdIterable, depthIdList, descendantIdGraph, descendantIdGraph, filterIdGraph, topsortIdList

Methods inherited from interface com.stevewedig.blog.digraph.id_graph.IdGraph

ancestorIdIterable, ancestorIdIterable, ancestorIdSet, ancestorIdSet, assertIdsEqual, assertIdsEqual, childIdSet, containsCycle, descendantIdIterable, descendantIdIterable, descendantIdSet, descendantIdSet, id__childIds, id__parentIds, idSet, idSize, isAncestorOf, isChildOf, isDescendantOf, isLeaf, isParentOf, isRoot, leafIdSet, optionalTopsortIdList, parentIdSet, rootIdSet, traverseIdIterable, traverseIdIterable, traverseIdList, traverseIdList

Constructor Detail

IdTreeClass

public IdTreeClass(com.google.common.collect.ImmutableSet<Id> idSet,
           com.google.common.collect.ImmutableSetMultimap<Id,Id> id__parentIds)

Method Detail

parentId

public com.google.common.base.Optional<Id> parentId(Id id)

Description copied from interface: IdTree

Getting an id's parent id, will be absent if the id is the root.

Specified by:

parentId in interface IdTree<Id>

ancestorIdGraph

public IdTree<Id> ancestorIdGraph(Id id,
                         boolean inclusive)

Description copied from interface: IdGraph

Getting an id's ancestor id graph (its, parents' parents, and so on).

Specified by:

ancestorIdGraph in interface IdDag<Id>

Specified by:

ancestorIdGraph in interface IdGraph<Id>

Specified by:

ancestorIdGraph in interface IdTree<Id>

Overrides:

ancestorIdGraph in class IdDagClass<Id>

ancestorIdGraph

public IdTree<Id> ancestorIdGraph(Set<Id> ids,
                         boolean inclusive)

Description copied from interface: IdGraph

Getting an id set's ancestor id graph (their parents, parents' parents, and so on).

Specified by:

ancestorIdGraph in interface IdDag<Id>

Specified by:

ancestorIdGraph in interface IdGraph<Id>

Specified by:

ancestorIdGraph in interface IdTree<Id>

Overrides:

ancestorIdGraph in class IdDagClass<Id>

ancestorIdList

public com.google.common.collect.ImmutableList<Id> ancestorIdList(Id id,
                                                         boolean inclusive)

Description copied from interface: IdTree

Getting an id's ancestor id list, with the root id first and the id's parent id last.

Specified by:

ancestorIdList in interface IdTree<Id>

descendantIdTree

public IdTree<Id> descendantIdTree(Id id)

Specified by:

descendantIdTree in interface IdTree<Id>

rootId

public Id rootId()

Description copied from interface: IdTree

The tree's root id.

Specified by:

rootId in interface IdTree<Id>

depth

public int depth(Id id)

Description copied from interface: IdTree

Getting the size of an id's ancestor list.

Specified by:

depth in interface IdTree<Id>

maxDepth

public int maxDepth()

Description copied from interface: IdTree

The maximum depth in the tree.

Specified by:

maxDepth in interface IdTree<Id>

mostDeep

public Id mostDeep(Set<Id> ids)

Description copied from interface: IdTree

Select the most deep id from a set, non-deterministic if there are ties.

Specified by:

mostDeep in interface IdTree<Id>

leastDeep

public Id leastDeep(Set<Id> ids)

Description copied from interface: IdTree

Select the least deep id from a set, non-deterministic if there are ties.

Specified by:

leastDeep in interface IdTree<Id>