Uses of Class
info.bioinfweb.treegraph.document.undo.edit.AddSupportValuesEdit.LeafList

Packages that use AddSupportValuesEdit.LeafList

info.bioinfweb.treegraph.document.undo.edit

Uses of AddSupportValuesEdit.LeafList in info.bioinfweb.treegraph.document.undo.edit

Methods in info.bioinfweb.treegraph.document.undo.edit that return AddSupportValuesEdit.LeafList

private AddSupportValuesEdit.LeafList

AddSupportValuesEdit.getLeafList(Node node) Returns the leaf list of node that is stored in its attribute map.

Methods in info.bioinfweb.treegraph.document.undo.edit with parameters of type AddSupportValuesEdit.LeafList

void	AddSupportValuesEdit.LeafList.add(AddSupportValuesEdit.LeafList other)
java.lang.String	AddSupportValuesEdit.LeafList.compareLists(NodeDataAdapter listAdapter, AddSupportValuesEdit.LeafList other, NodeDataAdapter otherAdapter) Checks if the elements in the given lists have the same names as the elements of this list.
boolean	AddSupportValuesEdit.LeafList.containsAllNames(NodeDataAdapter listAdapter, AddSupportValuesEdit.LeafList other, NodeDataAdapter otherAdapter) Tests if the given list contains elements with the same text values as this list.
boolean	AddSupportValuesEdit.LeafList.containsAnyNameAndOther(NodeDataAdapter listAdapter, AddSupportValuesEdit.LeafList other, NodeDataAdapter otherAdapter) Tests if the given list contains at least one element that has the same text value as one element in this list and additionally contains at least one element with a text value that is not contained in this list.
private Node	AddSupportValuesEdit.findDeepestNodeWithLeafs(AddSupportValuesEdit.LeafList leafs) Finds the deepest node in the source document which has a subtree that contains all the specified leafs.
private double	AddSupportValuesEdit.findHighestConflict(Node root, AddSupportValuesEdit.LeafList leafs) Finds the highest conflicting support value in the subtree under root.
private double	AddSupportValuesEdit.findHighestConflictRek(Node root, double highest, AddSupportValuesEdit.LeafList leafs) This method is the recursive part called by findHighestConflict.
private Node	AddSupportValuesEdit.findSubnodeWithLeafs(AddSupportValuesEdit.LeafList leafs, Node parent) Finds the direct subnode under root that contains all the specified leafs.