import org.codelibs.fess.util.ComponentUtil;

/**
 * Helper class for web and file system crawling and indexing operations.
 * Manages the crawling process for both web configurations and file configurations,
 * coordinating multiple crawler threads and handling indexing operations.
 */
public class WebFsIndexHelper {

    /**
     * Default constructor.
     */
    public WebFsIndexHelper() {
        // Default constructor
    }

 * {@link #at}, {@link #set}, {@link #toArray}, {@link #rowKeyList}, and {@link #columnKeyList}
 * methods for more details.
 *
 * <p>Note that this implementation is not synchronized. If multiple threads access the same cell of
 * an {@code ArrayTable} concurrently and one of the threads modifies its value, there is no
 * guarantee that the new value will be fully visible to the other threads. To guarantee that

  /**
   * Clears fields that are no longer needed after this future has completed -- or at least all its
   * inputs have completed (more precisely, after {@link #handleAllCompleted()} has been called).
   * Often called multiple times (that is, both when the inputs complete and when the output
   * completes).
   *
   * <p>This is similar to our proposed {@code afterCommit} method but not quite the same. See the
   * description of CL 265462958.

      iterator.remove();
      assertEquals(initialSize - 1, map.size());
      // (We can't assert that the values collection no longer contains the
      // removed value, because the underlying map can have multiple mappings
      // to the same value.)
      assertInvariants(map);
      assertThrows(IllegalStateException.class, iterator::remove);
    } else {
      iterator.next();

    }

    /**
     * Gets multiple documents asynchronously.
     *
     * @param request the multi-get request
     * @return a future for the multi-get response
     */
    @Override
    public ActionFuture<MultiGetResponse> multiGet(final MultiGetRequest request) {
        return client.multiGet(request);
    }

    /**
     * Gets multiple documents asynchronously with a callback.
     *

      // 4 characters. We have bitsPerChar == 6, charsPerChunk == 4, and bytesPerChunk == 3.
      // We're looking for the smallest charsPerChunk such that bitsPerChar * charsPerChunk is a
      // multiple of 8. A multiple of 8 has 3 low zero bits, so we just need to figure out how many
      // extra zero bits we need to add to the end of bitsPerChar to get 3 in total.

   *     use {@code new File(context.getCacheDir(), "directoryname").mkdir()}, or, if you need an
   *     arbitrary number of temporary directories, you might have to generate multiple directory
   *     names in a loop until {@code mkdir()} returns {@code true}.) For JRE users, prefer {@link
   *     java.nio.file.Files#createTempDirectory}, transforming it to a {@link File} using {@link

## 1. Overview

SMB3 leases provide a client caching mechanism that replaces the traditional oplock mechanism. Leases enable better performance through client-side caching while maintaining cache coherency across multiple clients.

## 2. Protocol Specification Reference

- **MS-SMB2 Section 2.2.13**: SMB2 CREATE Request with Lease Context
- **MS-SMB2 Section 2.2.14**: SMB2 CREATE Response with Lease State

            assertEquals(1024, SMBUtil.readInt4(buffer, 82)); // Minimum count
            assertEquals(4096, SMBUtil.readInt4(buffer, 90)); // Remaining bytes
        }

        @Test
        @DisplayName("Should handle multiple parameter updates")
        void testMultipleParameterUpdates() {
            // Initial setup
            request.setReadLength(1000);
            request.setOffset(500L);
            request.setMinimumCount(100);

   * test. This must return an Iterator that returns the expected elements passed to the constructor
   * in the given order. Warning: it is not enough to simply pull multiple iterators from the same
   * source Iterable, unless that Iterator is unmodifiable.
   */
  protected abstract I newTargetIterator();

  /**
   * Override this to verify anything after running a list of Stimuli.