Source file "org/mapdb/BTreeMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 3,329 of 3,329 | 0% | 434 of 434 | 0% | 291 | 291 | 578 | 578 | 74 | 74 |
| put2(Object, Object, boolean) | | 0% | | 0% | 44 | 44 | 120 | 120 | 1 | 1 |
| remove2(Object, Object) | | 0% | | 0% | 15 | 15 | 44 | 44 | 1 | 1 |
| replace(Object, Object, Object) | | 0% | | 0% | 13 | 13 | 38 | 38 | 1 | 1 |
| BTreeMap(Engine, long, int, boolean, long, BTreeKeySerializer, Serializer, Comparator, int, boolean) | | 0% | | 0% | 14 | 14 | 44 | 44 | 1 | 1 |
| replace(Object, Object) | | 0% | | 0% | 12 | 12 | 36 | 36 | 1 | 1 |
| get(Object, boolean) | | 0% | | 0% | 8 | 8 | 18 | 18 | 1 | 1 |
| findLarger(Object, boolean) | | 0% | | 0% | 8 | 8 | 14 | 14 | 1 | 1 |
| findSmallerRecur(BTreeMap.BNode, Object, boolean) | | 0% | | 0% | 11 | 11 | 16 | 16 | 1 | 1 |
| lastEntryRecur(BTreeMap.BNode) | | 0% | | 0% | 11 | 11 | 20 | 20 | 1 | 1 |
| findLargerNode(Object, boolean) | | 0% | | 0% | 8 | 8 | 14 | 14 | 1 | 1 |
| preinitCatalog(DB) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| firstEntry() | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| printRecur(BTreeMap, long, String) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| findChildren(Object, Object[]) | | 0% | | 0% | 6 | 6 | 10 | 10 | 1 | 1 |
| notify(Object, Object, Object) | | 0% | | 0% | 7 | 7 | 7 | 7 | 1 | 1 |
| findSmaller(Object, boolean) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| createRootRef(Engine, BTreeKeySerializer, Serializer, Comparator, int) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| snapshot() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| assertNoLocks(LongConcurrentHashMap) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| lastEntry() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| lock(LongConcurrentHashMap, long) | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| modificationListenerAdd(Bind.MapListener) | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| modificationListenerRemove(Bind.MapListener) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| arrayLongPut(long[], int, long) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| arrayPut(Object[], int, Object) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| sizeLong() | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| containsValue(Object) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| toList(Collection) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| remove(Object, Object) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| valExpand(Object) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| nextDir(BTreeMap.DirNode, Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| ceilingKey(Object) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| higherKey(Object) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| subMap(Object, boolean, Object, boolean) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| unlock(LongConcurrentHashMap, long) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| unlockAll(LongConcurrentHashMap) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| makeEntry(Object, Object) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| pollFirstEntry() | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| pollLastEntry() | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| containsKey(Object) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| headMap(Object, boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| tailMap(Object, boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| put(Object, Object) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| putIfAbsent(Object, Object) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| printTreeStructure() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| clear() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| size() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| firstKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lowerEntry(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lowerKey(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| floorEntry(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| floorKey(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| ceilingEntry(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| higherEntry(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| subMap(Object, Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| get(Object) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| remove(Object) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| headMap(Object) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| tailMap(Object) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| keyIterator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| valueIterator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| entryIterator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| descendingKeySet() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| close() | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| comparator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| keySet() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| navigableKeySet() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| values() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| entrySet() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| descendingMap() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| getEngine() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |