org.openl.rules.diff.tree

Interface DiffTreeNode

All Known Implementing Classes:

DiffTreeNodeImpl

public interface DiffTreeNode

Node of Diff Tree.

Diff Tree can be described as union of comparing data. The tree has node if corresponding element exists at least in one data.

Each node of Diff Tree has exactly the same number of elements. The number of elements equals number of comparing data. It can be 2..N.

Each element represents an artifact in comparing data under corresponding index.

Author:

Aleh Bykhavets

Method Summary

Modifier and Type	Method and Description
List<DiffTreeNode>	getChildren() Direct children or direct sub-nodes of this DiffTreeNode.
DiffElement	getElement(int index)
DiffElement[]	getElements() Comparing elements at some location.

Method Detail

getChildren

List<DiffTreeNode> getChildren()

Direct children or direct sub-nodes of this DiffTreeNode.

If there is no direct children empty (zero length) array is returned.

Returns:

direct children of the node or empty array

getElements

DiffElement[] getElements()

Comparing elements at some location.

All nodes in Diff Tree have exactly the same number of elements. It is guaranteed that return will have at least 2 elements.

Returns:

comparing elements

getElement

DiffElement getElement(int index)