NodeList
<init>()V checkPosition(Lnet/datastructures/Position;)Lnet/datastructures/DNode; size()I isEmpty()Z first()Lnet/datastructures/Position; last()Lnet/datastructures/Position; prev(Lnet/datastructures/Position;)Lnet/datastructures/Position; next(Lnet/datastructures/Position;)Lnet/datastructures/Position; insertBefore(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position; insertAfter(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position; insertFirst(Ljava/lang/Object;)Lnet/datastructures/Position; insertLast(Ljava/lang/Object;)Lnet/datastructures/Position; remove(Lnet/datastructures/Position;)Ljava/lang/Object; replace(Lnet/datastructures/Position;Ljava/lang/Object;)Ljava/lang/Object; positions()Ljava/util/Iterator; elements()Ljava/util/Iterator; isFirst(Lnet/datastructures/Position;)Z isLast(Lnet/datastructures/Position;)Z 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