protected abstract HashCode makeHash();

  // Process pent-up data in chunks
  private void munchIfFull() {
    if (buffer.remaining() < 8) {
      // buffer is full; not enough room for a primitive. We have at least one full chunk.
      munch();
    }
  }

  private void munch() {
    Java8Compatibility.flip(buffer);
    while (buffer.remaining() >= chunkSize) {

        assertNotNull(authorizations, "The authorizations list should not be null.");
        assertEquals(1, authorizations.size(), "The authorizations list should contain one element.");
        assertEquals(mockAuthData, authorizations.get(0), "The authorization element should be the mocked object.");
    }

    /**
     * Test constructor with a malformed ASN.1 token.
     */
    @Test

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *

        byte[] buffer1 = BufferCache.getBuffer();
        buffer1[0] = (byte) 0xAB;
        buffer1[1] = (byte) 0xCD;
        BufferCache.releaseBuffer(buffer1);

        // When - Get another buffer (might be the same one from cache)
        byte[] buffer2 = BufferCache.getBuffer();

        // Then - Buffer should be valid
        assertNotNull(buffer2, "Reused buffer should not be null");

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *

            String readContent = new String(in.readAllBytes(), "UTF-8");
            assertEquals(content, readContent, "Content should be preserved after rename");
        }

        // Best effort to verify source is gone
        SmbFile checkSource = new SmbFile(baseUrl + "shared/" + sourceFileName, checkContext);
        if (checkSource.exists()) {
            log.warn("Source file still exists after rename, attempting cleanup");

    assertEquals("B", peekingIterator.next());
    peekingIterator.remove();
    assertEquals("Should have removed an element", 2, list.size());
    assertFalse("Second element should be gone", list.contains("B"));
  }

  static class ThrowsAtEndException extends RuntimeException {
    /* nothing */
  }

  /**

      }
    },
    // It really seems like this should be faster than TO_BYTE_ARRAY_NEW_STRING.  But it just isn't
    // my best guess is that the jdk authors have spent more time optimizing that callpath than this
    // one. (StringCoding$StringDecoder vs. StreamDecoder).  StringCoding has a ton of special cases
    // theoretically we could duplicate all that logic here to try to beat 'new String' or at least
    // come close.

   * whether our solution scales to use with multiple exception types and to whether it is affected
   * by other {@code ClassValue} users. Some of the benchmarked implementations don't use one or
   * both of these mechanisms, so they will be unaffected.
   */
  @Param({"0", "1", "12"})
  int otherEntriesInDataStructure;

  final List<ClassValue<?>> retainedReferencesToOtherClassValues = new ArrayList<>();

    TestSuite suite = new TestSuite();
    for (ListTestSuiteBuilder<Short> builder : builders) {
      suite.addTest(
          builder
              .withFeatures(
                  CollectionSize.ONE,
                  CollectionSize.SEVERAL,
                  CollectionFeature.RESTRICTS_ELEMENTS,
                  ListFeature.SUPPORTS_SET)
              .createTestSuite());
    }
    return suite;
  }