nodes[i] = httptest.NewServer(router)
	}
}

const WriteLock = -1

type lockServer struct {
	mutex sync.Mutex
	// Map of locks, with negative value indicating (exclusive) write lock
	// and positive values indicating number of read locks
	lockMap map[string]int64

	// Refresh returns lock not found if set to true
	lockNotFound bool

	// Set to true if you want peers servers to do not respond

      extends ImmutableList<Range<C>> {

    private final ImmutableList<Range<C>> ranges;

    // True if the "positive" range set is empty or bounded below.
    private final boolean positiveBoundedBelow;

    // True if the "positive" range set is empty or bounded above.
    private final boolean positiveBoundedAbove;

    private final int size;

                if (coreMultiplier <= 0.0f) {
                    throw new IllegalArgumentException("Invalid threads core multiplier value: '" + threadConfiguration
                            + "'. Value must be positive.");
                }

                int procs = Runtime.getRuntime().availableProcessors();
                int threads = (int) (coreMultiplier * procs);
                return threads == 0 ? 1 : threads;

 * atomic unless otherwise noted.
 *
 * <p>Instances of this class are serializable if the keys are serializable.
 *
 * <p><b>Note:</b> If your values are always positive and less than 2^31, you may wish to use a
 * {@link com.google.common.collect.Multiset} such as {@link
 * com.google.common.collect.ConcurrentHashMultiset} instead.
 *

		//	-a-1 == ^a
		//
		// If the number is negative, we use an inversion mask to invert the
		// data bytes and treat the value as an unsigned number.
		var inv byte // 0x00 if positive or zero, 0xff if negative
		if b[0]&0x40 != 0 {
			inv = 0xff
		}

		var x uint64
		for i, c := range b {
			c ^= inv // Inverts c only if inv is 0xff, otherwise does nothing
			if i == 0 {

         * Longer patterns (higher priority length) come first.
         * @param other the other pattern to compare with
         * @return negative if this has higher priority, positive if other has higher priority
         */
        @Override
        public int compareTo(final PathPattern other) {
            // Higher priority length comes first (descending order)

            // When: Getting max transmission values
            int maxRecv = handle.getMaxRecv();
            int maxXmit = handle.getMaxXmit();

            // Then: Should return positive values
            assertTrue(maxRecv > 0);
            assertTrue(maxXmit > 0);
        }
    }

        ndrBuffer.reset();
        ndrBuffer.enc_ndr_referent(obj1, 2);
        assertEquals(4, ndrBuffer.getIndex());
        int referent1 = Encdec.dec_uint32le(buffer, 0);
        assertTrue(referent1 > 0); // Should be a positive referent ID

        ndrBuffer.reset();
        ndrBuffer.enc_ndr_referent(obj1, 2); // Same object, should get same referent
        assertEquals(4, ndrBuffer.getIndex());

                        allocations.incrementAndGet();

                        assertNotNull(buffer, "Buffer should not be null");
                        assertTrue(buffer.length > 0, "Buffer should have positive length");

                        // Test release performance
                        long releaseStart = System.nanoTime();
                        BufferCache.releaseBuffer(buffer);

    CacheTesting.checkValidState(cache);
  }

  /**
   * With an unlimited-size cache with maxWeight of 0, entries weighing 0 should still be cached.
   * Entries with positive weight should not be cached (nor dump existing cache).
   */
  public void testEviction_maxWeight_zero() {
    CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener();