| serializeSizeInBytes(Node) |  | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| deserialize(DataInput) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| deserialize(ByteBuffer) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| serialize(Node, DataOutput) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| serialize(Node, ByteBuffer) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| getExtremeLeaf(boolean) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| remove(byte[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| serializeArt(DataOutput) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| deserializeArt(DataInput) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| serializeArt(ByteBuffer) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| deserializeArt(ByteBuffer) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| removeSpecifyKey(Node, byte[], int) |  | 95% | | 71% | 9 | 17 | 4 | 35 | 0 | 1 |
| leafNodeIteratorFrom(long, boolean, Containers) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| leafNodeIterator(boolean, Containers) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| serializeSizeInBytes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| first() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| last() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getKeySize() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| leafMatch(LeafNode, byte[], int) | | 88% | | 50% | 1 | 2 | 1 | 6 | 0 | 1 |
| insert(Node, byte[], int, long) | | 100% | | 100% | 0 | 8 | 0 | 42 | 0 | 1 |
| findByKey(Node, byte[], int) | | 100% | | 100% | 0 | 8 | 0 | 23 | 0 | 1 |
| commonPrefixLength(byte[], int, int, byte[], int, int) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| insert(byte[], long) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| findByKey(byte[]) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| Art() | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| isEmpty() | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| iterator(Containers) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getRoot() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |