if err != nil {
		t.Fatalf("create zip reader: %v", err)

	}
	var count int
	var errRepeat = errors.New("repeated call to path")
	err = fs.WalkDir(zr, ".", func(p string, d fs.DirEntry, err error) error {
		count++
		if count > 2 { // once for directory read, once for the error
			return errRepeat
		}
		return err
	})
	if err == nil {

				success := true
				if err := r.ReplicateFromSource(ctx, api, core, oi, retry); err != nil {
					// object must be deleted concurrently, allow these failures but do not count them
					if isErrVersionNotFound(err) || isErrObjectNotFound(err) {
						return
					}
					stopFn(oi, err)
					batchLogIf(ctx, err)
					success = false
				} else {
					stopFn(oi, nil)
				}

   *
   * <p>This is useful when a varargs method needs to use a signature such as {@code (Foo firstFoo,
   * Foo... moreFoos)}, in order to avoid overload ambiguity or to enforce a minimum argument count.
   *
   * <p>The returned list is serializable and implements {@link RandomAccess}.
   *
   * @param first the first element
   * @param rest an array of additional elements, possibly empty

        throw new RuntimeException("Unexpected interrupt while waiting for latch", ie);
      }
    } while (System.nanoTime() - deadline < 0);
    throw formatRuntimeException(
        "Latch failed to count down within %d second timeout", timeoutSeconds);
  }

  /**
   * Creates a garbage object that counts down the latch in its finalizer. Sequestered into a

                .filter(each -> missingClasses.contains(each) == false)
                .filter(each -> violationsClasses.contains(each) == false)
                .count();
            if (bogousExcludesCount != 0 && bogousExcludesCount == missingClassExcludes.size() + violationsExcludes.size()) {
                logForbiddenAPIsOutput(forbiddenApisOutput);

            int result = emptyNameRequest.encode(testBuffer, 0);
            assertTrue(result >= 8); // At least header size
        }

        @Test
        @DisplayName("Should count method calls correctly")
        void testMethodCallCounting() {
            assertEquals(0, testRequest.getSizeCallCount());
            assertEquals(0, testRequest.getEncodeCallCount());

            testRequest.size();

	} else {
		tags["invalid"] = "1"
		tags["d:p"] = fmt.Sprintf("%d:%d", er.setDriveCount-er.defaultParityCount, er.defaultParityCount)
	}

	// count the number of offline disks
	offline := 0
	for i := range len(errs) {
		var found bool
		switch {
		case errors.Is(errs[i], errDiskNotFound):
			found = true
		default:
			for p := range dataErrsByPart {

}

// Cache structure and compaction:
//
// A cache structure will be kept with a tree of usages.
// The cache is a tree structure where each keeps track of its children.
//
// An uncompacted branch contains a count of the files only directly at the
// branch level, and contains link to children branches or leaves.
//
// The leaves are "compacted" based on a number of properties.

        // Check no duplicate queries added to FacetInfo
        List<String> addedQueries = testFacetInfo.getAddedQueries();
        long pdfCount = addedQueries.stream().filter(q -> q.equals("filetype:pdf")).count();
        assertEquals(1, pdfCount);
    }

    // Test init() with empty file types
    @Test
    public void test_init_withEmptyFileTypes() {
        testFileTypeHelper.setTypes(new String[] {});

    return (totalLoadCount == 0) ? 0.0 : (double) totalLoadTime / totalLoadCount;
  }

  /**
   * Returns the number of times an entry has been evicted. This count does not include manual
   * {@linkplain Cache#invalidate invalidations}.
   */
  public long evictionCount() {
    return evictionCount;
  }

  /**