quorum := len(restClnts) - tolerance
	if !isReadLock {
		// In situations for write locks, as a special case
		// to avoid split brains we make sure to acquire
		// quorum + 1 when tolerance is exactly half of the
		// total locker clients.
		if quorum == tolerance {
			quorum++
		}
	}

        }

        private
        inline fun <reified T> inAnyOrder(items: List<T>): Matcher<Iterable<T>> = inAnyOrder(items.toTypedArray())

        /**
         * Matcher checking each item is present exactly once in a given iterable, but an any position,
         * and that there are no unexpected items.
         */
        private

        File file = cos.getFile();
        assertTrue(file.exists());
        cos.close();
    }

    @Test
    public void testExactThreshold() throws IOException {
        // Writing exactly threshold bytes should stay in memory
        ContentOutputStream cos = new ContentOutputStream(5, Curl.tmpDir);
        cos.write(new byte[] { 0, 1, 2, 3, 4 });
        assertTrue(cos.isInMemory());

   * Guava to fix them until Guava is ready to <i>require</i> Java 8 for all users.
   */
  ConcurrentMap<K, V> asMap();

  /**
   * Performs any pending maintenance operations needed by the cache. Exactly which activities are
   * performed -- if any -- is implementation-dependent.
   */
  void cleanUp();

    }

    @Test
    @DisplayName("readPacketType with special stream returning -1 should return -1")
    void testReadPacketTypeSpecialStream() throws IOException {
        // Create a mock stream that returns exactly -1 on first read (special case)
        when(mockInputStream.read(any(byte[].class), anyInt(), anyInt())).thenReturn(-1); // Immediate EOF

        byte[] buffer = new byte[10];

    }

    /**
     * Test: Retry logic correctly enforces maxRetryCount
     * Verifies that with maxRetryCount=5, the operation is tried exactly 6 times (initial + 5 retries)
     */
    @Test
    public void testRetryLogicMaxRetryCount() throws Exception {
        fesenClient.setMaxRetryCount(5);

      this.key = key;
      this.hash = hash;
      this.next = next;
    }

    @Override
    public K getKey() {
      return this.key;
    }

    // The code below is exactly the same for each entry type.

    final int hash;
    final @Nullable ReferenceEntry<K, V> next;
    volatile ValueReference<K, V> valueReference = unset();

    @Override

### Translations not showing

- Clear browser cache
- Force language with `?browser_lang=[locale]` parameter
- Check property file encoding (should be UTF-8 or use Unicode escapes `\uXXXX`)
- Verify property keys match exactly with base English files

### Build errors after regeneration

- Check property file syntax (no unescaped special characters)
- Ensure all property values are properly escaped
- Run `mvn clean` before rebuilding

    manualExecutorTask[0].run();

    for (Future<?> result : results) {
      if (!result.isCancelled()) {
        result.get(10, SECONDS);
      }
      // TODO(cpovirk): Verify that the cancelled futures are exactly ones that we expect.
    }

    assertThat(logHandler.getStoredLogRecords()).isEmpty();
  }

  public void testAvoidsStackOverflow_manySubmitted() throws Exception {

    val groupLength = i - groupOffset
    if (groupLength == 0) return false // No digits.

    // We've successfully read a byte.
    address[b++] = value.toByte()
  }

  // Check for too few groups. We wanted exactly four.
  return b == addressOffset + 4
}

/** Encodes an IPv6 address in canonical form according to RFC 5952. */
internal fun inet6AddressToAscii(address: ByteArray): String {