input_tensors->emplace_back(node, idx);

    const auto& iter = input_nodes->find(node);
    if (iter == input_nodes->end()) {
      input_nodes->insert({node, {idx}});
    } else {
      auto& indices = iter->second;
      if (std::find(indices.begin(), indices.end(), idx) != indices.end()) {
        return InvalidArgument("TF_Output ", node->name(), ":", idx,
                               " appears more than once in the input list");

    public void test_startProcess_replaceExistingProcess() {
        String sessionId = "test_replace";
        List<String> cmdList1 = Arrays.asList("echo", "first");
        List<String> cmdList2 = Arrays.asList("echo", "second");
        Consumer<ProcessBuilder> pbCall = pb -> {
            pb.redirectErrorStream(true);
        };

        try {
            // Start first process

        // Update first directory cache
        List<SmbFile> files1 = Arrays.asList(mockFile1);
        directoryLeaseManager.updateDirectoryCache(dir1, files1);

        // Update second directory cache
        List<SmbFile> files2 = Arrays.asList(mockFile2);
        directoryLeaseManager.updateDirectoryCache(dir2, files2);

        // Verify both caches are independent

> Notice the requirement of common SLA here original cluster had 1024 drives with 16 drives per erasure set with default parity of '4', second pool is expected to have a minimum of 8 drives per erasure set to match the original cluster SLA (parity count) of '4'. '12' drives stripe per erasure set in the second pool satisfies the original pool's parity count.

                        }
                }
            }
        return pairs
            .groupBy({ it.first }, { it.second })
            .mapValues { entry -> entry.value.groupBy({ it.first }, { it.second }) }
    }

    private fun readPerformanceTestConfigurations(performanceTestsCiJson: File): List<PerformanceTestConfiguration> {

  private fun skipName(source: Buffer) {
    // 0 - 63 bytes
    var length = source.readByte().toInt()

    if (length < 0) {
      // compressed name pointer, first two bits are 1
      // drop second byte of compression offset
      source.skip(1)
    } else {
      while (length > 0) {
        // skip each part of the domain name
        source.skip(length.toLong())
        length = source.readByte().toInt()

        }

        /**
         * Compares two times.
         *
         * @param h1 the first hour
         * @param m1 the first minute
         * @param h2 the second hour
         * @param m2 the second minute
         * @return positive if first time is earlier, 0 if equal, negative if later
         */
        protected int compareTime(final int h1, final int m1, final int h2, final int m2) {

                assertFalse(iterator2.hasNext(), "Second instance should have no elements");
                assertFalse(iterator3.hasNext(), "Third instance should have no elements");

                assertNull(iterator1.next(), "First instance next() should return null");
                assertNull(iterator2.next(), "Second instance next() should return null");

        HotThreadMonitorTarget target2 = new HotThreadMonitorTarget();

        assertNotNull("First instance should not be null", target1);
        assertNotNull("Second instance should not be null", target2);
        assertNotSame("Instances should be different objects", target1, target2);
    }

    public void test_class_has_proper_annotations() {

      }
    }

    @Override
    public HashCode hash() {
      long value = checksum.getValue();
      if (bits == 32) {
        /*
         * The long returned from a 32-bit Checksum will have all 0s for its second word, so the
         * cast won't lose any information and is necessary to return a HashCode of the correct
         * size.
         */
        return HashCode.fromInt((int) value);
      } else {