Uses of Class com.epam.healenium.treecomparing.Node (tree-comparing 0.4.10 API)

Uses of Node in com.epam.healenium.treecomparing

Methods in com.epam.healenium.treecomparing that return Node
Modifier and Type	Method	Description
`Node`	NodeBuilder.`build()`
`Node`	PathFinder.`findNearest(Path path, Node newSource)`	Finds the nearest node that most likely is our searched one
`Node`	Path.`getLastNode()`
`Node[]`	Path.`getNodes()`
`Node`	Node.`getParent()`
`Node`	DocumentParser.`parse(InputStream inputStream)`
`Node`	JsoupHTMLParser.`parse(InputStream inputStream)`
`Node`	JsoupXMLParser.`parse(InputStream inputStream)`

Methods in com.epam.healenium.treecomparing that return types with arguments of type Node
Modifier and Type	Method	Description
`List<Scored<Node>>`	PathFinder.`find(Path path, Node newSource, int bestGuessesCount)`	Finds the list of nodes that most likely are our searched one, ordered by likeness descending
`AbstractMap.SimpleImmutableEntry<Integer,Map<Double,List<AbstractMap.SimpleImmutableEntry<Node,Integer>>>>`	PathFinder.`findScoresToNodes(Path path, Node newSource)`	Finds the Map of all nodes that most likely are our searched one, ordered by likeness descending
`List<Node>`	Node.`getChildren()`
`List<Scored<Node>>`	PathFinder.`getSortedNodes(Map<Double,List<AbstractMap.SimpleImmutableEntry<Node,Integer>>> scoresToNodes, int bestGuessesCount, double guessCap)`	Sort the Map of all nodes that most likely are our searched one, ordered by likeness descending

Methods in com.epam.healenium.treecomparing with parameters of type Node
Modifier and Type	Method	Description
`NodeBuilder`	NodeBuilder.`addChild(Node child)`
`static Path`	Utils.`addNode(Path path, Node node)`
`double`	HeuristicNodeDistance.`distance(Node node1, Node node2, int LCSDistance, int curPathHeight)`
`double`	NodeDistance.`distance(Node node1, Node node2, int LCSDistance, int curPathHeight)`
`List<Scored<Node>>`	PathFinder.`find(Path path, Node newSource, int bestGuessesCount)`	Finds the list of nodes that most likely are our searched one, ordered by likeness descending
`Node`	PathFinder.`findNearest(Path path, Node newSource)`	Finds the nearest node that most likely is our searched one
`AbstractMap.SimpleImmutableEntry<Integer,Map<Double,List<AbstractMap.SimpleImmutableEntry<Node,Integer>>>>`	PathFinder.`findScoresToNodes(Path path, Node newSource)`	Finds the Map of all nodes that most likely are our searched one, ordered by likeness descending
`void`	Path.`setNodes(Node[] nodes)`

Method parameters in com.epam.healenium.treecomparing with type arguments of type Node
Modifier and Type	Method	Description
`NodeBuilder`	NodeBuilder.`addChildren(List<Node> children)`
`List<Scored<Node>>`	PathFinder.`getSortedNodes(Map<Double,List<AbstractMap.SimpleImmutableEntry<Node,Integer>>> scoresToNodes, int bestGuessesCount, double guessCap)`	Sort the Map of all nodes that most likely are our searched one, ordered by likeness descending
`NodeBuilder`	NodeBuilder.`setChildren(List<Node> children)`

Constructors in com.epam.healenium.treecomparing with parameters of type Node
Constructor	Description
`Path(Node node)`
`Path(Node[] nodes)`