Target Class and its Dependencies

Class: Sort

Dependencies:

PET Arguments

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

string(70) "javap -classpath ../../../../examples/net/datastructures -s Sort 2>&1 " string(96) "Warning: File ../../../../examples/net/datastructures/Sort.class does not contain class Sort
" string(29) "Compiled from "Sort.java"
" string(42) "public class net.datastructures.Sort {
" array(4) { [0]=> string(33) "c class net.datastructures.Sort {" [1]=> string(2) "c " ["name"]=> string(23) "net.datastructures.Sort" [2]=> string(23) "net.datastructures.Sort" }

 <init>()V
 mergeSort(Lnet/datastructures/List;Ljava/util/Comparator;)V
 merge(Lnet/datastructures/List;Lnet/datastructures/List;Ljava/util/Comparator;Lnet/datastructures/List;)V
 mergeSort([Ljava/lang/Object;Ljava/util/Comparator;)V
 merge([Ljava/lang/Object;[Ljava/lang/Object;Ljava/util/Comparator;II)V
 quickSort(Lnet/datastructures/List;Ljava/util/Comparator;)V
 quickSort([Ljava/lang/Object;Ljava/util/Comparator;)V
 main([Ljava/lang/String;)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