Target Class and its Dependencies

Class: NodeSequence

Dependencies:

PET Arguments

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

string(78) "javap -classpath ../../../../examples/net/datastructures -s NodeSequence 2>&1 " string(112) "Warning: File ../../../../examples/net/datastructures/NodeSequence.class does not contain class NodeSequence
" string(37) "Compiled from "NodeSequence.java"
" string(125) "public class net.datastructures.NodeSequence extends net.datastructures.NodeList implements net.datastructures.Sequence {
" array(4) { [0]=> string(116) "c class net.datastructures.NodeSequence extends net.datastructures.NodeList implements net.datastructures.Sequence {" [1]=> string(2) "c " ["name"]=> string(106) "net.datastructures.NodeSequence extends net.datastructures.NodeList implements net.datastructures.Sequence" [2]=> string(106) "net.datastructures.NodeSequence extends net.datastructures.NodeList implements net.datastructures.Sequence" }

 <init>()V
 checkRank(II)V
 atRank(I)Lnet/datastructures/Position;
 rankOf(Lnet/datastructures/Position;)I
 elemAtRank(I)Ljava/lang/Object;
 insertAtRank(ILjava/lang/Object;)V
 removeAtRank(I)Ljava/lang/Object;
 replaceAtRank(ILjava/lang/Object;)Ljava/lang/Object;

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