SMBUtil.writeInt8(expectedTimestamp, rawBytes, 0);
        AvTimestamp avTimestamp = new AvTimestamp(rawBytes);

        assertEquals(expectedTimestamp, avTimestamp.getTimestamp());
    }

    /**
     * Test round-trip conversion: long -> bytes -> long.
     */
    @Test
    public void testRoundTripConversion() {
        long originalTimestamp = 543210987654321L;
        AvTimestamp avTimestamp = new AvTimestamp(originalTimestamp);

 *
 * This class provides constants and utility methods for managing directory lease states
 * in SMB2/SMB3 protocol implementations. Directory leases enable clients to cache
 * directory metadata and reduce network round-trips for directory operations.
 */
public class DirectoryLeaseState {

    /**
     * Private constructor to prevent instantiation of this utility class
     */
    private DirectoryLeaseState() {

        assertNotSame(first, second, "Should create new connection when session limit reached");
    }

    @Test
    @DisplayName("Should access fail counts map correctly")
    void testFailCountsAccess() throws Exception {
        // Given: Access to fail counts via reflection
        Field failCountsField = SmbTransportPoolImpl.class.getDeclaredField("failCounts");
        failCountsField.setAccessible(true);

/**
 * Fess-specific crawler configuration that extends OpenSearchCrawlerConfig.
 * This class provides configuration settings for the Fess crawler including
 * index names, shard counts, and replica counts for queue, data, and filter indices.
 */
public class FessCrawlerConfig extends OpenSearchCrawlerConfig {

    /**
     * Default constructor.
     */
    public FessCrawlerConfig() {
        super();

  }

  private static final int MAX_TABLE_SIZE = Ints.MAX_POWER_OF_TWO;

  static int closedTableSize(int expectedEntries, double loadFactor) {
    // Get the recommended table size.
    // Round down to the nearest power of 2.
    expectedEntries = max(expectedEntries, 2);
    int tableSize = Integer.highestOneBit(expectedEntries);
    // Check to make sure that we will not exceed the maximum load factor.

  }

  private static final int MAX_TABLE_SIZE = Ints.MAX_POWER_OF_TWO;

  static int closedTableSize(int expectedEntries, double loadFactor) {
    // Get the recommended table size.
    // Round down to the nearest power of 2.
    expectedEntries = max(expectedEntries, 2);
    int tableSize = Integer.highestOneBit(expectedEntries);
    // Check to make sure that we will not exceed the maximum load factor.

     */
    private boolean isBroadcastAddress(final InetAddress svr) {
        return svr.equals(this.baddr) || svr.getAddress()[3] == (byte) 0xFF;
    }

    /**
     * Switches to the next available WINS server in round-robin fashion.
     *
     * @return the next WINS server address, or null if no WINS servers are configured
     */
    protected InetAddress switchWINS() {

     * This method applies search conditions from the pager and updates the pager with
     * pagination information including page numbers and result counts.
     *
     * @param fileConfigPager the pager containing search criteria and pagination settings
     * @return a list of file configurations matching the criteria
     */

   * this range map are guaranteed to read through to the returned {@code Map}.
   *
   * <p>The returned {@code Map} iterates over entries in ascending order of the bounds of the
   * {@code Range} entries.
   *
   * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}.
   */
  Map<Range<K>, V> asMapOfRanges();

  /**

   * close or flush the reader.
   *
   * <p>This is identical to {@link #copy(Readable, Appendable)} but optimized for these specific
   * types. CharBuffer has poor performance when being written into or read out of so round tripping
   * all the bytes through the buffer takes a long time. With these specialized types we can just
   * use a char array.
   *
   * @param from the object to read from
   * @param to the object to write to