| floorEntry(Object) |  | 0% | | 0% | 16 | 16 | 30 | 30 | 1 | 1 |
| higherEntry(Object) |  | 24% | | 16% | 14 | 16 | 24 | 32 | 0 | 1 |
| lowerEntry(Object) | | 18% | | 7% | 13 | 14 | 21 | 26 | 0 | 1 |
| selectR(AbstractPatriciaTrie.TrieEntry, int, Object, int, AbstractPatriciaTrie.Reference) | | 0% | | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| put(Object, Object) | | 55% | | 40% | 8 | 11 | 11 | 29 | 0 | 1 |
| ceilingEntry(Object) | | 66% | | 61% | 7 | 14 | 10 | 28 | 0 | 1 |
| select(Object) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| getPrefixMapByBits(Object, int, int) | | 52% | | 75% | 1 | 3 | 1 | 6 | 0 | 1 |
| removeInternalEntry(AbstractPatriciaTrie.TrieEntry) | | 87% | | 91% | 2 | 13 | 2 | 30 | 0 | 1 |
| removeExternalEntry(AbstractPatriciaTrie.TrieEntry) | | 72% | | 80% | 2 | 6 | 2 | 13 | 0 | 1 |
| AbstractPatriciaTrie(KeyAnalyzer, Map) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| subtree(Object, int, int) | | 87% | | 70% | 5 | 11 | 3 | 22 | 0 | 1 |
| writeObject(ObjectOutputStream) | | 51% | | 50% | 1 | 2 | 3 | 7 | 0 | 1 |
| selectKey(Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| selectValue(Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| previousEntry(AbstractPatriciaTrie.TrieEntry) | | 89% | | 77% | 4 | 10 | 3 | 18 | 0 | 1 |
| nextEntryImpl(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 93% | | 78% | 7 | 17 | 4 | 30 | 0 | 1 |
| nextEntryInSubtree(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 75% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| remove(Object) | | 96% | | 90% | 1 | 6 | 1 | 14 | 0 | 1 |
| containsKey(Object) | | 93% | | 83% | 1 | 4 | 1 | 6 | 0 | 1 |
| getEntry(Object) | | 93% | | 83% | 1 | 4 | 1 | 6 | 0 | 1 |
| addEntry(AbstractPatriciaTrie.TrieEntry, int) | | 100% | | 100% | 0 | 9 | 0 | 22 | 0 | 1 |
| clear() | | 100% | | n/a | 0 | 1 | 0 | 10 | 0 | 1 |
| readObject(ObjectInputStream) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
| getNearestEntryForKey(Object, int) | | 100% | | 100% | 0 | 3 | 0 | 8 | 0 | 1 |
| nextKey(Object) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| previousKey(Object) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| removeEntry(AbstractPatriciaTrie.TrieEntry) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| followLeft(AbstractPatriciaTrie.TrieEntry) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| followRight(AbstractPatriciaTrie.TrieEntry) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isValidUplink(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 100% | | 83% | 1 | 4 | 0 | 1 | 0 | 1 |
| entrySet() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| keySet() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| values() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| AbstractPatriciaTrie(KeyAnalyzer) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| lastKey() | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| nextEntry(AbstractPatriciaTrie.TrieEntry) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| firstKey() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| get(Object) | | 100% | | 100% | 0 | 2 | 0 | 2 | 0 | 1 |
| firstEntry() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| decrementSize() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| incrementSize() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| prefixMap(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| headMap(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| incrementModCount() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| subMap(Object, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| tailMap(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lastEntry() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| mapIterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| comparator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |