Class | Coverage |
---|---|
BinarySearchTreeNode | 0% |
Context | 8% |
SingleLinkedList | 39% |
BinaryTree | 43% |
DoubleLinkedList | 46% |
BinarySearchTree | 61% |
Stack | 73% |
LinkedList | 74% |
Queue | 76% |
Sortable | 78% |
BinaryTreeNode | 78% |
SingleLinkedListNode | 81% |
Class | CRAP |
---|---|
BinaryTree | 469 |
Context | 241 |
BinarySearchTree | 200 |
Sortable | 112 |
SingleLinkedList | 99 |
DoubleLinkedList | 89 |
LinkedList | 57 |
BinarySearchTreeNode | 30 |
Queue | 13 |
BinaryTreeNode | 9 |
Stack | 9 |
SingleLinkedListNode | 5 |
Method | Coverage |
---|---|
delete | 0% |
set | 0% |
count | 0% |
reverse | 0% |
offsetUnset | 0% |
insertBefore | 0% |
listAll | 0% |
peek | 0% |
add | 0% |
insertAfter | 0% |
findLastElement | 0% |
isSorted | 0% |
addArray | 0% |
addObject | 0% |
containsArray | 0% |
containsObject | 0% |
contains | 0% |
add | 0% |
isUnique | 0% |
quick3Sort | 0% |
heapSort | 0% |
peek | 0% |
prev | 0% |
key | 0% |
postOrder | 0% |
set | 0% |
depthFirsth | 0% |
validate | 0% |
validate | 0% |
delete | 0% |
insertAfter | 0% |
preOrder | 0% |
insertBefore | 0% |
current | 0% |
offsetExists | 0% |
valid | 0% |
offsetUnset | 0% |
push | 55% |
successor | 55% |
search | 68% |
deleteValue | 69% |
count | 72% |
predecessor | 77% |
right | 83% |
left | 83% |
root | 85% |
split | 85% |
add | 85% |
pop | 85% |
merge | 86% |
pop | 88% |
offsetGet | 88% |
Method | CRAP |
---|---|
depthFirsth | 156 |
delete | 132 |
deleteValue | 45 |
postOrder | 30 |
preOrder | 30 |
findLastElement | 30 |
offsetUnset | 30 |
validate | 30 |
isUnique | 20 |
insertBefore | 20 |
count | 20 |
containsArray | 20 |
offsetExists | 12 |
insertBefore | 12 |
insertAfter | 12 |
insertAfter | 12 |
add | 12 |
contains | 12 |
merge | 8 |
add | 7 |
search | 7 |
addObject | 6 |
delete | 6 |
listAll | 6 |
containsObject | 6 |
add | 6 |
addArray | 6 |
successor | 5 |
predecessor | 4 |
split | 4 |
count | 3 |
left | 3 |
right | 3 |
root | 3 |
offsetGet | 3 |
push | 2 |
pop | 2 |
pop | 2 |