}

    @Test
    @DisplayName("Test run method")
    void testRunMethod() throws Exception {
        AtomicInteger counter = new AtomicInteger(0);

        circuitBreaker.run(() -> counter.incrementAndGet());
        assertEquals(1, counter.get());

        SimpleCircuitBreaker.Statistics stats = circuitBreaker.getStatistics();
        assertEquals(1, stats.totalCalls);

      @SuppressWarnings("GoodTime") // reading system time without TimeSource
      String baseName = System.currentTimeMillis() + "-";

      for (int counter = 0; counter < TEMP_DIR_ATTEMPTS; counter++) {
        File tempDir = new File(baseDir, baseName + counter);
        if (tempDir.mkdir()) {
          return tempDir;
        }
      }
      throw new IllegalStateException(

		t.Helper()
		if err != nil {
			t.Fatal(err)
		}
	}

	// Add a version with tiered content, one with local content
	xl := xlMetaV2{}
	counter := 1
	report := func() {
		t.Helper()
		// t.Logf("versions (%d): len = %d", counter, len(xl.versions))
		counter++
	}
	fi := FileInfo{
		Volume:           "volume",
		Name:             "object-name",
		VersionID:        "00000000-0000-0000-0000-000000000001",

        StringBuilder buffer = new StringBuilder(256);

        buffer.append("Missing:").append(LS);
        buffer.append("----------").append(LS);

        int counter = 0;

        for (Artifact artifact : artifacts) {
            String message = (++counter) + ") " + artifact.getId();

            buffer.append(constructMissingArtifactMessage(
                    message,
                    "  ",

    }

    /**
     * Increment requests sent counter
     */
    public void incrementRequestsSent() {
        requestsSent.incrementAndGet();
    }

    /**
     * Increment requests received counter
     */
    public void incrementRequestsReceived() {
        requestsReceived.incrementAndGet();
    }

    /**
     * Increment error counter
     */
    public void incrementErrors() {

package bpool

import (
	"github.com/klauspost/reedsolomon"
)

// BytePoolCap implements a leaky pool of []byte in the form of a bounded channel.
type BytePoolCap struct {
	c    chan []byte
	w    int
	wcap int
}

// NewBytePoolCap creates a new BytePool bounded to the given maxSize, with new
// byte arrays sized based on width.
func NewBytePoolCap(maxSize uint64, width int, capwidth int) (bp *BytePoolCap) {

									href="/search?q=${f:u(q)}&ex_q=label%3a${f:u(countEntry.key)}&sdh=${f:u(fe:sdh(sdh))}${fe:pagingQuery(null)}${fe:facetQuery()}${fe:geoQuery()}">
										${f:h(fe:label(countEntry.key))}
										<span class="badge rounded-pill text-bg-secondary float-end">${f:h(countEntry.value)}</span>
								</la:link></li>
						</c:if>
					</c:forEach>
				</ul>
			</c:if>
		</c:forEach>

e-none{pointer-events:none!important}.pe-auto{pointer-events:auto!important}.rounded{border-radius:var(--bs-border-radius)!important}.rounded-0{border-radius:0!important}.rounded-1{border-radius:var(--bs-border-radius-sm)!important}.rounded-2{border-radius:var(--bs-border-radius)!important}.rounded-3{border-radius:var(--bs-border-radius-lg)!important}.rounded-4{border-radius:var(--bs-border-radius-xl)!important}.rounded-5{border-radius:var(--bs-border-radius-xxl)!important}.rounded-circle{border...

      int x = 1 << exponent;
      intValues.add(x, x + 1, x - 1);
    }
    intValues.add(9999).add(10000).add(10001).add(1000000); // near powers of 10
    intValues.add(5792).add(5793); // sqrt(2^25) rounded up and down
    POSITIVE_INTEGER_CANDIDATES = intValues.build();
    NEGATIVE_INTEGER_CANDIDATES =
        ImmutableList.copyOf(
            Iterables.concat(

        }
        long size = spliterator.getExactSizeIfKnown();
        long[] counter = {0};
        spliterator.forEachRemaining(
            e -> {
              consumer.accept(e);
              counter[0]++;
            });
        if (size >= 0) {
          assertEquals(size, counter[0]);
        }
      }
    },
    ALTERNATE_ADVANCE_AND_SPLIT {
      @Override