Target Class and its Dependencies

Class: RedBlackTree

Dependencies:

PET Arguments

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

string(67) "javap -classpath ../../../../examples/related -s RedBlackTree 2>&1 " string(101) "Warning: File ../../../../examples/related/RedBlackTree.class does not contain class RedBlackTree
" string(37) "Compiled from "RedBlackTree.java"
" string(39) "public class related.RedBlackTree {
" array(4) { [0]=> string(30) "c class related.RedBlackTree {" [1]=> string(2) "c " ["name"]=> string(20) "related.RedBlackTree" [2]=> string(20) "related.RedBlackTree" }

 <init>()V
 parentOf(Lrelated/EntryRBT;)Lrelated/EntryRBT;
 colorOf(Lrelated/EntryRBT;)I
 leftOf(Lrelated/EntryRBT;)Lrelated/EntryRBT;
 rightOf(Lrelated/EntryRBT;)Lrelated/EntryRBT;
 setColor(Lrelated/EntryRBT;I)V
 deleteEntry(Lrelated/EntryRBT;)V
 successor(Lrelated/EntryRBT;)Lrelated/EntryRBT;
 fixAfterDeletion(Lrelated/EntryRBT;)V
 fixAfterInsertion(Lrelated/EntryRBT;)V
 rotateLeft(Lrelated/EntryRBT;)V
 rotateRight(Lrelated/EntryRBT;)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