Rating | Name | Duplication | Size | Complexity | CRAP | Changes | Bugs | Features |
---|---|---|---|---|---|---|---|---|
B | Tree\FibonacciHeap::consolidate() | 0 | 28 | 8 | 8 | 0 | 0 | 0 |
B | Heap\Tree\PairingHeap::combine() | 0 | 31 | 6 | 6 | 0 | 0 | 0 |
B | Tree\FibonacciHeap::decreaseKey() | 0 | 12 | 7 | 7 | 0 | 0 | 0 |
B | Heap\Tree\PairingHeap::decreaseKey() | 0 | 17 | 7 | 7 | 1 | 1 | 0 |
B | Heap\Tree\FibonacciHeap::meld() | 0 | 23 | 6 | 6.02 | 0 | 0 | 0 |
A | Heap\Tree\FibonacciHeap::deleteMin() | 0 | 31 | 5 | 5 | 0 | 0 | 0 |
A | Heap\Tree\PairingHeap::delete() | 0 | 19 | 5 | 5 | 0 | 0 | 0 |
A | AbstractAddressableHeapTest::testDeleteNodes() | 0 | 34 | 2 | ? | 0 | 0 | 0 |
A | AbstractMergeableAddressableHeapTest::testMeldGeneric() | 0 | 16 | 5 | ? | 1 | 0 | 1 |
A | AbstractMergeableAddressableHeapTest::testMeld2() | 0 | 27 | 1 | ? | 1 | 0 | 1 |
A | AbstractAddressableHeapTest::testEmptyAfterDeleteAll() | 0 | 25 | 1 | ? | 0 | 0 | 0 |
A | Heap\Tree\PairingHeap::link() | 0 | 13 | 5 | 5 | 0 | 0 | 0 |
A | AbstractAddressableHeapTest::testDeleteTwice() | 0 | 22 | 2 | ? | 0 | 0 | 0 |
A | AbstractMergeableAddressableHeapTest::testMultipleMelds() | 0 | 18 | 1 | ? | 1 | 0 | 1 |
A | AbstractAddressableHeapTest::testDecreaseKey() | 0 | 17 | 2 | ? | 0 | 0 | 0 |