Uses of Class
org.variantsync.diffdetective.variation.tree.VariationTreeNode
Package
Description
-
Uses of VariationTreeNode in org.variantsync.diffdetective.variation.diff.bad
Modifier and TypeFieldDescriptionprivate final Map<VariationTreeNode<L>,
DiffType> BadVDiff.coloring
The field for thecoloring
record component.private final Map<VariationTreeNode<L>,
DiffLineNumberRange> BadVDiff.lines
The field for thelines
record component.private final Map<VariationTreeNode<L>,
VariationTreeNode<L>> BadVDiff.matching
The field for thematching
record component.private final Map<VariationTreeNode<L>,
VariationTreeNode<L>> BadVDiff.matching
The field for thematching
record component.BadVDiff.FromGoodNodeTranslation.translate
Modifier and TypeMethodDescriptionprivate static <L extends Label>
VariationTreeNode<L>BadVDiff.fromGood
(DiffNode<L> n, BadVDiff.FromGoodNodeTranslation<L> nodeTranslation, Map<VariationTreeNode<L>, DiffType> coloring, Map<VariationTreeNode<L>, DiffLineNumberRange> lines) Performs aplain
conversion of the given DiffNode n to a VariationTreeNode.(package private) VariationTreeNode<L>
Returns the VariationTreeNode that represents the given DiffNode d at the given time t in the produced bad diff.private static <L extends Label>
VariationTreeNode<L>Plain conversion of DiffNodes to VariationTree nodes.Modifier and TypeMethodDescriptionBadVDiff.coloring()
Returns the value of thecoloring
record component.BadVDiff.lines()
Returns the value of thelines
record component.BadVDiff.matching()
Returns the value of thematching
record component.BadVDiff.matching()
Returns the value of thematching
record component.Modifier and TypeMethodDescriptionBadVDiff.mergeToGood
(VariationTreeNode<L> before, VariationTreeNode<L> after) Merges two VariationTreeNodes that represent the same node to a single unchanged DiffNode.private void
BadVDiff.prettyPrint
(String indent, StringBuilder b, VariationTreeNode<L> n) (package private) void
Remember that the given DiffNode d was translated to the given VariationTreeNode v at time t.(package private) void
BadVDiff.FromGoodNodeTranslation.put
(DiffNode<L> d, VariationTreeNode<L> v) Remember that the given DiffNode d was translated to the given VariationTreeNode v at all times d exists.BadVDiff.toGood
(VariationTreeNode<L> n) Modifier and TypeMethodDescriptionprivate static <L extends Label>
VariationTreeNode<L>BadVDiff.fromGood
(DiffNode<L> n, BadVDiff.FromGoodNodeTranslation<L> nodeTranslation, Map<VariationTreeNode<L>, DiffType> coloring, Map<VariationTreeNode<L>, DiffLineNumberRange> lines) Performs aplain
conversion of the given DiffNode n to a VariationTreeNode.ModifierConstructorDescriptionBadVDiff
(VariationTree<L> diff, Map<VariationTreeNode<L>, VariationTreeNode<L>> matching, Map<VariationTreeNode<L>, DiffType> coloring, Map<VariationTreeNode<L>, DiffLineNumberRange> lines) Creates an instance of aBadVDiff
record class.BadVDiff
(VariationTree<L> diff, Map<VariationTreeNode<L>, VariationTreeNode<L>> matching, Map<VariationTreeNode<L>, DiffType> coloring, Map<VariationTreeNode<L>, DiffLineNumberRange> lines) Creates an instance of aBadVDiff
record class. -
Uses of VariationTreeNode in org.variantsync.diffdetective.variation.tree
Modifier and TypeFieldDescriptionprivate VariationTreeNode<L>
VariationTreeNode.parent
The parent of this node.private final VariationTreeNode<L>
VariationTree.root
The field for theroot
record component.Modifier and TypeFieldDescriptionprivate final List<VariationTreeNode<L>>
VariationTreeNode.childOrder
The list for maintaining the order of all children of this node.Modifier and TypeMethodDescriptionstatic <L extends Label>
VariationTreeNode<L>VariationTreeNode.createArtifact
(LineRange lineRange, L label) Convenience constructor for creating an artifact node of aVariationTree
.static <L extends Label>
VariationTreeNode<L>VariationTreeNode.createRoot
(L label) Convenience constructor for creating the root of aVariationTree
.VariationTreeNode.deepCopy()
Creates a deep copy of this node.VariationTreeNode.deepCopy
(Map<VariationTreeNode<L>, VariationTreeNode<L>> oldToNew) Creates a deep copy of this node.static <L extends Label>
VariationTreeNode<L>VariationTreeNode.fromID
(int id, L label) Reconstructs a node from the givenid
and label.VariationTreeNode.getParent()
VariationTree.root()
Returns the value of theroot
record component.VariationNode.toVariationTree()
Returns a copy of this variation tree in aconcrete variation tree implementation
.VariationNode.toVariationTree
(Map<? super T, VariationTreeNode<L>> oldToNew) Returns a copy of this variation tree in aconcrete variation tree implementation
.VariationTreeNode.upCast()
Modifier and TypeMethodDescriptionvoid
VariationTreeNode.addChild
(VariationTreeNode<L> child) boolean
VariationTree.contains
(VariationTreeNode<L> node) Returns true iff this tree contains the given node.void
VariationTreeNode.insertChild
(VariationTreeNode<L> child, int index) void
VariationTreeNode.removeChild
(VariationTreeNode<L> child) private void
VariationTreeNode.setParent
(VariationTreeNode<L> newParent) SetsnewParent
as the new parent of this node.Modifier and TypeMethodDescriptionboolean
VariationTree.anyMatch
(Predicate<VariationTreeNode<L>> condition) Checks whether any node in this tree satisfies the given condition.VariationTree.deepCopy
(Map<VariationTreeNode<L>, VariationTreeNode<L>> oldToNew) Creates a deep copy of this variation tree.VariationTree.deepCopy
(Map<VariationTreeNode<L>, VariationTreeNode<L>> oldToNew) Creates a deep copy of this variation tree.VariationTreeNode.deepCopy
(Map<VariationTreeNode<L>, VariationTreeNode<L>> oldToNew) Creates a deep copy of this node.VariationTreeNode.deepCopy
(Map<VariationTreeNode<L>, VariationTreeNode<L>> oldToNew) Creates a deep copy of this node.VariationTree.forAllPreorder
(Consumer<VariationTreeNode<L>> action) Invokes the given callback for each node in this Variation Tree in depth-first order.VariationTree.toVariationDiff
(Function<VariationTreeNode<L>, DiffNode<L>> nodeConverter) VariationNode.toVariationTree
(Map<? super T, VariationTreeNode<L>> oldToNew) Returns a copy of this variation tree in aconcrete variation tree implementation
.ModifierConstructorDescriptionVariationTree
(VariationTreeNode<L> root) Creates aVariationTree
with the given root and an unknown source.VariationTree
(VariationTreeNode<L> root, VariationTreeSource source) Creates aVariationTree
with the given root and source. -
Uses of VariationTreeNode in org.variantsync.diffdetective.variation.tree.graph
Modifier and TypeFieldDescriptionprivate final VariationTreeNode<L>
FormalTreeGraph.Edge.child
The field for thechild
record component.private final VariationTreeNode<L>
FormalTreeGraph.Edge.parent
The field for theparent
record component.Modifier and TypeFieldDescriptionprivate final Set<VariationTreeNode<L>>
FormalTreeGraph.nodes
The field for thenodes
record component.Modifier and TypeMethodDescriptionFormalTreeGraph.Edge.child()
Returns the value of thechild
record component.FormalTreeGraph.Edge.parent()
Returns the value of theparent
record component.Modifier and TypeMethodDescriptionFormalTreeGraph.nodes()
Returns the value of thenodes
record component.ModifierConstructorDescriptionEdge
(VariationTreeNode<L> child, VariationTreeNode<L> parent) Creates an instance of aEdge
record class.ModifierConstructorDescriptionFormalTreeGraph
(Set<VariationTreeNode<L>> nodes, Set<FormalTreeGraph.Edge<L>> edges) Creates an instance of aFormalTreeGraph
record class.