code: CompletableFuture<List<ResultT>> findAllExisting(long bucketOffset, TimeoutTimer timer) {
          val result = new HashMap<HashedArray, ResultT>();
  
          // This handler ensures that items are only added once (per key) and only if they are not deleted. Since the items
          // are processed in descending version order, the first time we encounter its key is its latest value.
          BiConsumer<ResultT, Long> handler = (item, offset) -> {
              TableKey key = getKey(item);
              HashedArray indexedKey = new HashedArray(key.getKey());
              if (!result.containsKey(indexedKey)) {
                  result.put(indexedKey, key.getVersion() == TableKey.NOT_EXISTS ? null : item);
              }
          };
          return findAll(bucketOffset, handler, timer)
                  .thenApply(v -> result.values().stream().filter(Objects::nonNull).collect(Collectors.toList()));
      }
docs: Locates all {@link ResultT} instances in a TableBucket.
  
  @param bucketOffset The current segment offset of the Table Bucket we are looking into.
  @param timer        A {@link TimeoutTimer} for the operation.
  @return A CompletableFuture that, when completed, will contain a List with the desired result items. This list
  will exclude all {@link ResultT} items that are marked as deleted.