| removeInternalEntry(AbstractPatriciaTrie.TrieEntry) |  | 0% | | 0% | 13 | 13 | 30 | 30 | 1 | 1 |
| put(Object, Object) | | 0% | | 0% | 11 | 11 | 29 | 29 | 1 | 1 |
| higherEntry(Object) | | 0% | | 0% | 10 | 10 | 28 | 28 | 1 | 1 |
| nextEntryImpl(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 17 | 17 | 30 | 30 | 1 | 1 |
| subtree(Object, int, int) | | 0% | | 0% | 11 | 11 | 22 | 22 | 1 | 1 |
| addEntry(AbstractPatriciaTrie.TrieEntry, int) | | 0% | | 0% | 9 | 9 | 22 | 22 | 1 | 1 |
| ceilingEntry(Object) | | 0% | | 0% | 8 | 8 | 24 | 24 | 1 | 1 |
| floorEntry(Object) | | 0% | | 0% | 8 | 8 | 24 | 24 | 1 | 1 |
| lowerEntry(Object) | | 0% | | 0% | 6 | 6 | 20 | 20 | 1 | 1 |
| previousEntry(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 10 | 10 | 18 | 18 | 1 | 1 |
| selectR(AbstractPatriciaTrie.TrieEntry, int, Object, int, AbstractPatriciaTrie.Reference) | | 0% | | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| removeExternalEntry(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 6 | 6 | 13 | 13 | 1 | 1 |
| remove(Object) | | 0% | | 0% | 6 | 6 | 14 | 14 | 1 | 1 |
| getPrefixMapByBits(Object, int, int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| clear() | | 0% | | n/a | 1 | 1 | 10 | 10 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| getNearestEntryForKey(Object, int) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| getEntry(Object) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| containsKey(Object) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| select(Object) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| nextKey(Object) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| previousKey(Object) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| removeEntry(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| followLeft(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| followRight(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| AbstractPatriciaTrie(KeyAnalyzer, Map) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| isValidUplink(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| entrySet() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| keySet() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| AbstractPatriciaTrie(KeyAnalyzer) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| nextEntry(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| nextEntryInSubtree(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| get(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| selectKey(Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| selectValue(Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| firstKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| firstEntry() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| incrementSize() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| decrementSize() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| prefixMap(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| incrementModCount() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| headMap(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| subMap(Object, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| tailMap(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| mapIterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lastEntry() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| comparator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |