I - input symbol typepublic class DTree<I> extends AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>
SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>oracle, root| Constructor and Description |
|---|
DTree(MembershipOracle<I,Boolean> oracle) |
| Modifier and Type | Method and Description |
|---|---|
protected DefaultQuery<I,Boolean> |
buildQuery(DTNode<I> node,
Word<I> prefix) |
DTNode<I> |
sift(DTNode<I> start,
Word<I> prefix) |
DTNode<I> |
sift(DTNode<I> start,
Word<I> as,
boolean hard) |
List<DTNode<I>> |
sift(List<DTNode<I>> starts,
List<Word<I>> prefixes) |
List<DTNode<I>> |
sift(List<DTNode<I>> starts,
List<Word<I>> prefixes,
boolean hard) |
getNodes, getOutgoingEdges, getRoot, getTarget, getVisualizationHelper, lcaInfo, leastCommonAncestor, setOracle, sift, sift, siftclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitasNormalGraphadjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStreamiterator, nodeIDs, nodesStream, sizeadjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnectedforEach, spliteratorpublic DTree(MembershipOracle<I,Boolean> oracle)
public DTNode<I> sift(DTNode<I> start, Word<I> prefix)
sift in class AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>public List<DTNode<I>> sift(List<DTNode<I>> starts, List<Word<I>> prefixes)
sift in class AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>protected DefaultQuery<I,Boolean> buildQuery(DTNode<I> node, Word<I> prefix)
buildQuery in class AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>Copyright © 2020. All rights reserved.