| Methods Summary |
|---|
| public int | testArgsRefEachOther(test.wsdl.multiref.holders.NodeHolder root1, test.wsdl.multiref.holders.NodeHolder root2)Tests for two node arguments that reference each other.
Node t1 = root1.value; // Root1 of tree
Node t2 = root2.value; // Root2 of tree
if (t1 != null && t2 != null &&
t1 != t2 &&
t1.getLeft() == t2 &&
t1.getRight() == t2 &&
t2.getLeft() == t1 &&
t2.getRight() == t1)
return 0; // Great
return 1; // Bad
|
| public int | testArgsRefSameNode(test.wsdl.multiref.holders.NodeHolder root1, test.wsdl.multiref.holders.NodeHolder root2)Tests for the following arrangement of nodes:
0 1
\ /
2 where 0 and 1 are the argument nodes.
Node t1 = root1.value; // Root1 of tree
Node t2 = root2.value; // Root2 of tree
if (t1 != null && t2 != null &&
t1 != t2 &&
t1.getLeft() == null &&
t2.getRight() == null &&
t1.getRight() != null &&
t1.getRight() == t2.getLeft() &&
t1.getRight().getRight() == null &&
t1.getRight().getLeft() == null)
return 0; // Great
return 1; // Bad
|
| public int | testDiamond(test.wsdl.multiref.holders.NodeHolder root)Tests for the following arrangement of nodes:
0
/ \
1 2
\ /
3
Node t = root.value; // Root of tree
Node l = t.getLeft(); // Left side
Node r = t.getRight(); // Right side
if (t != null && l != null && r != null &&
r != l &&
l.getLeft() == null &&
r.getRight()== null &&
l.getRight()!= null &&
l.getRight()== r.getLeft())
return 0; // Great
return 1; // Bad
|
| public int | testLoop(test.wsdl.multiref.holders.NodeHolder root)Tests for the following arrangement of nodes:
0
/ \
1 2 and the children of 1 & 2 are backward references to 0
Node t = root.value; // Root of tree
Node l = t.getLeft(); // Left side
Node r = t.getRight(); // Right side
if (t != null && l != null && r != null &&
r != l &&
l.getLeft() == t &&
l.getRight()== t &&
r.getLeft() == t &&
r.getRight()== t)
return 0; // Great
return 1; // Bad
|
| public int | testSameArgs(test.wsdl.multiref.holders.NodeHolder root1, test.wsdl.multiref.holders.NodeHolder root2)Tests that both arguments are the same node & the nodes don't have children
Node t1 = root1.value; // Root1 of tree
Node t2 = root2.value; // Root2 of tree
if (t1 != null && t2 != null &&
t1 == t2 &&
t1.getRight() == null &&
t1.getLeft() == null)
return 0; // Great
return 1; // Bad
|
| public int | testSelfRef(test.wsdl.multiref.holders.NodeHolder root)Tests for the following arrangement of nodes:
0
and the children of 0 are backward references to 0
Node t = root.value; // Root of tree
Node l = t.getLeft(); // Left side
Node r = t.getRight(); // Right side
if (t != null && l != null && r != null &&
t == l && t == r)
return 0; // Great
return 1; // Bad
|
| public int | testSimpleTree(test.wsdl.multiref.holders.NodeHolder root)Tests for the following arrangement of nodes:
0
/ \
1 2
Node t = root.value; // Root of tree
Node l = t.getLeft(); // Left side
Node r = t.getRight(); // Right side
if (t != null && l != null && r != null &&
r != l &&
l.getLeft() == null &&
l.getRight()== null &&
r.getLeft() == null &&
r.getRight()== null)
return 0; // Great
return 1; // Bad
|
