| subtree(Object) |  | 0% | | 0% | 11 | 11 | 17 | 17 | 1 | 1 |
| higherEntry(Object) | | 0% | | 0% | 10 | 10 | 20 | 20 | 1 | 1 |
| previousEntry(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 10 | 10 | 16 | 16 | 1 | 1 |
| ceilingEntry(Object) | | 0% | | 0% | 8 | 8 | 18 | 18 | 1 | 1 |
| floorEntry(Object) | | 0% | | 0% | 8 | 8 | 16 | 16 | 1 | 1 |
| lowerEntry(Object) | | 0% | | 0% | 6 | 6 | 14 | 14 | 1 | 1 |
| replaceCeil(Object, int) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| replaceLower(Object, int) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| followRight(AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| prefixMap(Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| nextEntryInSubtree(AbstractPatriciaTrie.TrieEntry, AbstractPatriciaTrie.TrieEntry) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 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 |
| lastEntry() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isPrefix(Object, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| PatriciaTrie(KeyAnalyzer, Map) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| PatriciaTrie(KeyAnalyzer) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| firstKey() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| comparator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |