Target Class and its Dependencies

Class: SortedListPriorityQueue

Dependencies:

PET Arguments

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

string(89) "javap -classpath ../../../../examples/net/datastructures -s SortedListPriorityQueue 2>&1 " string(134) "Warning: File ../../../../examples/net/datastructures/SortedListPriorityQueue.class does not contain class SortedListPriorityQueue
" string(48) "Compiled from "SortedListPriorityQueue.java"
" string(105) "public class net.datastructures.SortedListPriorityQueue implements net.datastructures.PriorityQueue {
" array(4) { [0]=> string(96) "c class net.datastructures.SortedListPriorityQueue implements net.datastructures.PriorityQueue {" [1]=> string(2) "c " ["name"]=> string(86) "net.datastructures.SortedListPriorityQueue implements net.datastructures.PriorityQueue" [2]=> string(86) "net.datastructures.SortedListPriorityQueue implements net.datastructures.PriorityQueue" }

 <init>()V
 <init>(Ljava/util/Comparator;)V
 <init>(Lnet/datastructures/List;Ljava/util/Comparator;)V
 setComparator(Ljava/util/Comparator;)V
 size()I
 isEmpty()Z
 min()Lnet/datastructures/Entry;
 insert(Ljava/lang/Object;Ljava/lang/Object;)Lnet/datastructures/Entry;
 insertEntry(Lnet/datastructures/Entry;)V
 insertEntry_bug()V
 removeMin()Lnet/datastructures/Entry;
 key(Lnet/datastructures/Position;)Ljava/lang/Object;
 checkKey(Ljava/lang/Object;)Z
 toString()Ljava/lang/String;

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