| canContainEqDeletesForFile(DataFile, DeleteFileIndex.EqualityDeleteFile) |  | 0% | | 0% | 18 | 18 | 31 | 31 | 1 | 1 |
| referencedDeleteFiles() | | 0% | | 0% | 9 | 9 | 18 | 18 | 1 | 1 |
| forDataFile(long, DataFile) |  | 5% | | 10% | 5 | 6 | 10 | 12 | 0 | 1 |
| findDV(long, DataFile) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| allNull(Map, Map, Types.NestedField) | | 0% | | 0% | 6 | 6 | 9 | 9 | 1 | 1 |
| rangesOverlap(Types.NestedField, ByteBuffer, ByteBuffer, Object, Object) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| allNonNull(Map, Types.NestedField) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| containsNull(Map, Types.NestedField) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| findStartIndex(long[], long) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| findEqPartitionDeletes(long, DataFile) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| findPosPartitionDeletes(long, DataFile) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| findPathDeletes(long, DataFile) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| findGlobalDeletes(long, DataFile) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| forDataFile(DataFile) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| DeleteFileIndex(DeleteFileIndex.EqualityDeletes, PartitionMap, PartitionMap, Map, Map) | | 89% | | 50% | 7 | 8 | 0 | 10 | 0 | 1 |
| builderFor(Iterable) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| concat(DeleteFile[][]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isEmpty() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| hasPositionDeletes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| forEntry(ManifestEntry) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| builderFor(FileIO, Iterable) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| hasEqualityDeletes() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |