Target Class and its Dependencies

Class: LinkedBinaryTree

Dependencies:

PET Arguments

a) Choose the method to generate test-cases for:

string(82) "javap -classpath ../../../../examples/net/datastructures -s LinkedBinaryTree 2>&1 " string(120) "Warning: File ../../../../examples/net/datastructures/LinkedBinaryTree.class does not contain class LinkedBinaryTree
" string(41) "Compiled from "LinkedBinaryTree.java"
" string(95) "public class net.datastructures.LinkedBinaryTree implements net.datastructures.BinaryTree {
" array(4) { [0]=> string(86) "c class net.datastructures.LinkedBinaryTree implements net.datastructures.BinaryTree {" [1]=> string(2) "c " ["name"]=> string(76) "net.datastructures.LinkedBinaryTree implements net.datastructures.BinaryTree" [2]=> string(76) "net.datastructures.LinkedBinaryTree implements net.datastructures.BinaryTree" }

 <init>()V
 size()I
 isEmpty()Z
 isInternal(Lnet/datastructures/Position;)Z
 isExternal(Lnet/datastructures/Position;)Z
 isRoot(Lnet/datastructures/Position;)Z
 hasLeft(Lnet/datastructures/Position;)Z
 hasRight(Lnet/datastructures/Position;)Z
 root()Lnet/datastructures/Position;
 left(Lnet/datastructures/Position;)Lnet/datastructures/Position;
 right(Lnet/datastructures/Position;)Lnet/datastructures/Position;
 parent(Lnet/datastructures/Position;)Lnet/datastructures/Position;
 children(Lnet/datastructures/Position;)Ljava/util/Iterator;
 positions()Ljava/util/Iterator;
 elements()Ljava/util/Iterator;
 replace(Lnet/datastructures/Position;Ljava/lang/Object;)Ljava/lang/Object;
 sibling(Lnet/datastructures/Position;)Lnet/datastructures/Position;
 insertLeft(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position;
 insertRight(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position;
 remove(Lnet/datastructures/Position;)Ljava/lang/Object;
 addRoot(Ljava/lang/Object;)Lnet/datastructures/Position;
 attach(Lnet/datastructures/Position;Lnet/datastructures/BinaryTree;Lnet/datastructures/BinaryTree;)V
 swapElements(Lnet/datastructures/Position;Lnet/datastructures/Position;)V
 expandExternal(Lnet/datastructures/Position;Ljava/lang/Object;Ljava/lang/Object;)V
 removeAboveExternal(Lnet/datastructures/Position;)V
 checkPosition(Lnet/datastructures/Position;)Lnet/datastructures/BTPosition;
 createNode(Ljava/lang/Object;Lnet/datastructures/BTPosition;Lnet/datastructures/BTPosition;Lnet/datastructures/BTPosition;)Lnet/datastructures/BTPosition;
 inorderPositions(Lnet/datastructures/Position;Lnet/datastructures/List;)V

b) Coverage criterion: Block-k: Depth-k:

c) Get numeric test-cases or path-constraints: Path-constraints Numeric (In this case a range must be especified in step d)

d) Specify the range of integers to take data from: None Range: ..

e) Labeling strategy (see the SWI-Prolog CLPFD library) : ff leftmost min max

f) References aliasing: Don't alias Might alias CLP Heap Solver

g) Verbosity level: 1 2 3

h) Generate JUnit test: Type: no minimum complete Use reflection: no yes

i) Tracing: no statements blocks

j) Check code coverage: no yes

l) Compositional TDG: no yes