HeapPriorityQueue
<init>()V <init>(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; removeMin()Lnet/datastructures/Entry; entry(Lnet/datastructures/Position;)Lnet/datastructures/Entry; key(Lnet/datastructures/Position;)Ljava/lang/Object; checkKey(Ljava/lang/Object;)V upHeap(Lnet/datastructures/Position;)V downHeap(Lnet/datastructures/Position;)V swapElements(Lnet/datastructures/Position;Lnet/datastructures/Position;)V 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