final Queue<IndexedIterator<T>> queue;

    MergingIterator(
        Iterable<? extends Iterator<? extends T>> iterators, Comparator<? super T> itemComparator) {
      // A comparator that's used by the heap, allowing the heap
      // to be sorted based on the top of each iterator, with insertion order as tiebreaker
      Comparator<IndexedIterator<T>> heapComparator =
          (o1, o2) ->
              ComparisonChain.start()

}

TEST_F(CApiAttributesTest, StringTensor) {
  // Create the string-Tensor "attribute" value.
  const char test_string[] =
      "borkborkborkborkborkborkborkbork";  // >24bytes to force heap alloc
  TF_TString tstr[1];
  TF_TString_Init(&tstr[0]);
  TF_TString_Copy(&tstr[0], test_string, sizeof(test_string) - 1);

  auto deallocator = [](void* data, size_t len, void* arg) {};