}

  @Override
  public void clear() {
    if (needsAllocArrays()) {
      return;
    }
    this.firstEntry = ENDPOINT;
    this.lastEntry = ENDPOINT;
    if (links != null) {
      Arrays.fill(links, 0, size(), 0);
    }
    super.clear();
  }

  /*
   * For discussion of the safety of the following methods, see the comments near the end of
   * CompactHashMap.
   */

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

      FakeTicker ticker,
      String keyPrefix,
      long ttl) {
    loader.setKeyPrefix(keyPrefix);

    int shift1 = 10 + VALUE_PREFIX;
    loader.setValuePrefix(shift1);
    // fill with initial data
    for (int i = 0; i < 10; i++) {
      assertThat(cache.getUnchecked(keyPrefix + i)).isEqualTo(i + shift1);
    }
    assertThat(CacheTesting.expirationQueueSize(cache)).isEqualTo(10);

  buf->Unref();
  return tensorflow::wrap(tensorflow::TensorHandle::CreateLocalHandle(
      std::move(t), device, device, context));
}

// This function will block till the operation that produces `h` has
// completed. This is only valid on local TFE_TensorHandles. Returns the size in
// bytes of the memory pointed to by the device pointer returned above.

    void testReadBytesWireFormatPreservesBuffer() throws SMBProtocolDecodingException {
        byte[] buffer = new byte[1024];
        int bufferIndex = 0;

        // Fill buffer with test data
        for (int i = 0; i < buffer.length; i++) {
            buffer[i] = (byte) (i % 256);
        }

        // Set structure size to 2
        SMBUtil.writeInt2(2, buffer, bufferIndex);

   * Truncates the given character sequence to the given maximum length. If the length of the
   * sequence is greater than {@code maxLength}, the returned string will be exactly {@code
   * maxLength} chars in length and will end with the given {@code truncationIndicator}. Otherwise,
   * the sequence will be returned as a string with no changes to the content.
   *
   * <p>Examples:
   *
   * {@snippet :

        assertTrue(length >= 0);
    }

    @Test
    @DisplayName("Test decode operation")
    void testDecode() {
        byte[] buffer = new byte[1024];
        // Fill with basic SMB header structure
        System.arraycopy(new byte[] { (byte) 0xFF, 'S', 'M', 'B' }, 0, buffer, 0, 4);
        buffer[4] = 1; // wordCount
        buffer[7] = 0; // byteCount low

   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *
   * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
   * permutation, instead of two. This is why the elements have to implement {@link Comparable}.
   *

        assertArrayEquals(zeroGuid, extractedGuid);
    }

    @Test
    @DisplayName("Test encode with all 0xFF GUID")
    void testEncodeWithMaxGuid() {
        byte[] maxGuid = new byte[16];
        Arrays.fill(maxGuid, (byte) 0xFF);

        ValidateNegotiateInfoRequest request =
                new ValidateNegotiateInfoRequest(DEFAULT_CAPABILITIES, maxGuid, DEFAULT_SECURITY_MODE, defaultDialects);

   * multiset itself).
   *
   * <p>Despite the method name, this method attempts to avoid actually copying the data when it is
   * safe to do so. The exact circumstances under which a copy will or will not be performed are
   * undocumented and subject to change.
   *
   * <p>This method is not type-safe, as it may be called on elements that are not mutually
   * comparable.
   *