CAV2018Examples (Attestor Benchmark Collection 0.3.8 API)

java.lang.Object
- de.rwth.i2.attestorExamples.CAV2018Examples

```
public class CAV2018Examples
extends Object
```
Collection of benchmarks to be executed. Every method tagged with @Benchmark requires a settings file with the same name in configuration/settings/. For instance, method foo() executes the benchmark specified by configuration/settings/foo.json. Every benchmark may be additionally tagged with expected results, e.g. the expected total number of states, model-checking results, etc. If executing a benchmark leads to different results, an error is raised.

Constructor Summary

Constructors
Constructor and Description

CAV2018Examples()

Constructors
Constructor and Description
`CAV2018Examples()`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`binarySearchAVLTree_M()`
`void`	`binarySearchAVLTree_S()`
`void`	`buildAndBubbleSortSLL_M()`
`void`	`buildAndDeleteElementSLL_M()`
`void`	`buildAndInsertDLL_M()`
`void`	`buildAndInsertsortDLL1_M()`
`void`	`buildAndInsertsortDLL2_M()`
`void`	`buildAndInsertsortSLL_M()`
`void`	`buildAndReverseDLL_M()`
`void`	`buildAndReverseSLL_M()`
`void`	`buildAndReverseSLL_R()`
`void`	`buildAndReverseSLL_S()`
`void`	`buildAndTraverseListOfCyclicLists_M()`
`void`	`buildCyclicDLL_M()`
`void`	`buildSLLWithHeadPtr_M()`
`void`	`constructTree_M()`
`void`	`DSWTree_M()`
`void`	`faultyReverseDLL_CX()`
`void`	`findLastDLL_CY()`
`void`	`findMiddleSLL_M()`
`void`	`findMiddleSLL_N()`
`void`	`findMiddleSLL_R()`
`void`	`findMiddleSLL_RX()`
`void`	`findMiddleSLL_S()`
`void`	`findMiddleSLL_V()`
`void`	`findMiddleSLL_VX()`
`void`	`insertAVLTree_M()`
`void`	`insertAVLTree_S()`
`void`	`leftMostInsertAVLTree_M()`
`void`	`leftMostInsertAVLTree_S()`
`void`	`lindstromTreeTraversal_C()`
`void`	`lindstromTreeTraversal_M()`
`void`	`lindstromTreeTraversal_N()`
`void`	`lindstromTreeTraversal_S()`
`void`	`lindstromTreeTraversal_V()`
`void`	`recursiveBuildAndTraverseTree_M()`
`void`	`recursiveBuildAndTraverseTree_S()`
`void`	`recursiveReverseSLL_M()`
`void`	`recursiveReverseSLL_NX()`
`void`	`recursiveReverseSLL_S()`
`void`	`recursiveReverseSLL_VX()`
`void`	`recursiveTraverseTree_M()`
`void`	`recursiveTraverseTree_N()`
`void`	`recursiveTraverseTree_S()`
`void`	`reverseDLL_CX()`
`void`	`reverseDLL_M()`
`void`	`reverseDLL_NX()`
`void`	`reverseDLL_R()`
`void`	`reverseDLL_S()`
`void`	`reverseDLL_SX()`
`void`	`reverseDLL_V()`
`void`	`reverseSLL_M()`
`void`	`reverseSLL_NX()`
`void`	`reverseSLL_R()`
`void`	`reverseSLL_S()`
`void`	`reverseSLL_V()`
`void`	`searchAndBackAVLTree_C()`
`void`	`searchAndBackAVLTree_M()`
`void`	`searchAndBackAVLTree_S()`
`void`	`searchAndSwapAVLTree_C()`
`void`	`searchAndSwapAVLTree_M()`
`void`	`searchAndSwapAVLTree_S()`
`void`	`skipList_buildList_M()`
`void`	`skipList_insert_M()`
`void`	`sllToAVLTree_C()`
`void`	`sllToAVLTree_M()`
`void`	`sllToAVLTree_S()`
`void`	`traverseDLL_S()`
`void`	`traverseSLL_M()`
`void`	`traverseSLL_N()`
`void`	`traverseSLL_R()`
`void`	`traverseSLL_S()`
`void`	`traverseSLL_V()`
`void`	`traverseSLL_X()`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- CAV2018Examples
```
public CAV2018Examples()
```

Method Detail

lindstromTreeTraversal_M

public void lindstromTreeTraversal_M()

lindstromTreeTraversal_S

public void lindstromTreeTraversal_S()

lindstromTreeTraversal_V

public void lindstromTreeTraversal_V()

lindstromTreeTraversal_N

public void lindstromTreeTraversal_N()

lindstromTreeTraversal_C

public void lindstromTreeTraversal_C()

binarySearchAVLTree_M
```
public void binarySearchAVLTree_M()
```

binarySearchAVLTree_S
```
public void binarySearchAVLTree_S()
```

leftMostInsertAVLTree_M
```
public void leftMostInsertAVLTree_M()
```

leftMostInsertAVLTree_S
```
public void leftMostInsertAVLTree_S()
```

insertAVLTree_S
```
public void insertAVLTree_S()
```

insertAVLTree_M
```
public void insertAVLTree_M()
```

sllToAVLTree_M
```
public void sllToAVLTree_M()
```

sllToAVLTree_S
```
public void sllToAVLTree_S()
```

sllToAVLTree_C
```
public void sllToAVLTree_C()
```

searchAndBackAVLTree_M
```
public void searchAndBackAVLTree_M()
```

searchAndBackAVLTree_C
```
public void searchAndBackAVLTree_C()
```

searchAndBackAVLTree_S
```
public void searchAndBackAVLTree_S()
```

searchAndSwapAVLTree_M
```
public void searchAndSwapAVLTree_M()
```

searchAndSwapAVLTree_S
```
public void searchAndSwapAVLTree_S()
```

searchAndSwapAVLTree_C
```
public void searchAndSwapAVLTree_C()
```

buildAndReverseSLL_M
```
public void buildAndReverseSLL_M()
```

buildAndReverseSLL_S
```
public void buildAndReverseSLL_S()
```

buildAndReverseSLL_R
```
public void buildAndReverseSLL_R()
```

traverseSLL_M
```
public void traverseSLL_M()
```

traverseSLL_S
```
public void traverseSLL_S()
```

traverseSLL_N
```
public void traverseSLL_N()
```

traverseSLL_R
```
public void traverseSLL_R()
```

traverseSLL_V
```
public void traverseSLL_V()
```

reverseSLL_M
```
public void reverseSLL_M()
```

reverseSLL_S
```
public void reverseSLL_S()
```

reverseSLL_V
```
public void reverseSLL_V()
```

reverseSLL_NX
```
public void reverseSLL_NX()
```

reverseSLL_R
```
public void reverseSLL_R()
```

recursiveReverseSLL_M
```
public void recursiveReverseSLL_M()
```

recursiveReverseSLL_S
```
public void recursiveReverseSLL_S()
```

recursiveReverseSLL_VX
```
public void recursiveReverseSLL_VX()
```

recursiveReverseSLL_NX
```
public void recursiveReverseSLL_NX()
```

findMiddleSLL_M
```
public void findMiddleSLL_M()
```

findMiddleSLL_S
```
public void findMiddleSLL_S()
```

findMiddleSLL_V
```
public void findMiddleSLL_V()
```

findMiddleSLL_N
```
public void findMiddleSLL_N()
```

findMiddleSLL_R
```
public void findMiddleSLL_R()
```

recursiveBuildAndTraverseTree_M

public void recursiveBuildAndTraverseTree_M()

recursiveBuildAndTraverseTree_S

public void recursiveBuildAndTraverseTree_S()

recursiveTraverseTree_M
```
public void recursiveTraverseTree_M()
```

recursiveTraverseTree_S
```
public void recursiveTraverseTree_S()
```

recursiveTraverseTree_N
```
public void recursiveTraverseTree_N()
```

buildAndTraverseListOfCyclicLists_M

public void buildAndTraverseListOfCyclicLists_M()

buildAndReverseDLL_M
```
public void buildAndReverseDLL_M()
```

buildAndInsertDLL_M
```
public void buildAndInsertDLL_M()
```

buildAndInsertsortDLL1_M

public void buildAndInsertsortDLL1_M()

buildAndInsertsortDLL2_M

public void buildAndInsertsortDLL2_M()

buildCyclicDLL_M
```
public void buildCyclicDLL_M()
```

buildAndBubbleSortSLL_M
```
public void buildAndBubbleSortSLL_M()
```

buildAndDeleteElementSLL_M

public void buildAndDeleteElementSLL_M()

buildSLLWithHeadPtr_M
```
public void buildSLLWithHeadPtr_M()
```

buildAndInsertsortSLL_M
```
public void buildAndInsertsortSLL_M()
```

DSWTree_M
```
public void DSWTree_M()
```

constructTree_M
```
public void constructTree_M()
```

faultyReverseDLL_CX
```
public void faultyReverseDLL_CX()
```

findLastDLL_CY
```
public void findLastDLL_CY()
```

reverseDLL_M
```
public void reverseDLL_M()
```

reverseDLL_S
```
public void reverseDLL_S()
```

reverseDLL_CX
```
public void reverseDLL_CX()
```

reverseDLL_R
```
public void reverseDLL_R()
```

reverseDLL_V
```
public void reverseDLL_V()
```

reverseDLL_NX
```
public void reverseDLL_NX()
```

traverseDLL_S
```
public void traverseDLL_S()
```

skipList_buildList_M
```
public void skipList_buildList_M()
```

skipList_insert_M
```
public void skipList_insert_M()
```

findMiddleSLL_VX
```
public void findMiddleSLL_VX()
```

findMiddleSLL_RX
```
public void findMiddleSLL_RX()
```

reverseDLL_SX
```
public void reverseDLL_SX()
```

traverseSLL_X
```
public void traverseSLL_X()
```

Class CAV2018Examples

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

CAV2018Examples

Method Detail

lindstromTreeTraversal_M

lindstromTreeTraversal_S

lindstromTreeTraversal_V

lindstromTreeTraversal_N

lindstromTreeTraversal_C

binarySearchAVLTree_M

binarySearchAVLTree_S

leftMostInsertAVLTree_M

leftMostInsertAVLTree_S

insertAVLTree_S

insertAVLTree_M

sllToAVLTree_M

sllToAVLTree_S

sllToAVLTree_C

searchAndBackAVLTree_M

searchAndBackAVLTree_C

searchAndBackAVLTree_S

searchAndSwapAVLTree_M

searchAndSwapAVLTree_S

searchAndSwapAVLTree_C

buildAndReverseSLL_M

buildAndReverseSLL_S

buildAndReverseSLL_R

traverseSLL_M

traverseSLL_S

traverseSLL_N

traverseSLL_R

traverseSLL_V

reverseSLL_M

reverseSLL_S

reverseSLL_V

reverseSLL_NX

reverseSLL_R

recursiveReverseSLL_M

recursiveReverseSLL_S

recursiveReverseSLL_VX

recursiveReverseSLL_NX

findMiddleSLL_M

findMiddleSLL_S

findMiddleSLL_V

findMiddleSLL_N

findMiddleSLL_R

recursiveBuildAndTraverseTree_M

recursiveBuildAndTraverseTree_S

recursiveTraverseTree_M

recursiveTraverseTree_S

recursiveTraverseTree_N

buildAndTraverseListOfCyclicLists_M

buildAndReverseDLL_M

buildAndInsertDLL_M

buildAndInsertsortDLL1_M

buildAndInsertsortDLL2_M

buildCyclicDLL_M

buildAndBubbleSortSLL_M

buildAndDeleteElementSLL_M

buildSLLWithHeadPtr_M

buildAndInsertsortSLL_M

DSWTree_M

constructTree_M

faultyReverseDLL_CX

findLastDLL_CY

reverseDLL_M

reverseDLL_S

reverseDLL_CX

reverseDLL_R

reverseDLL_V

reverseDLL_NX

traverseDLL_S

skipList_buildList_M

skipList_insert_M

findMiddleSLL_VX

findMiddleSLL_RX

reverseDLL_SX