* @return the value with the specified row and column
   * @throws IndexOutOfBoundsException if either index is negative, {@code rowIndex} is greater than
   *     or equal to the number of allowed row keys, or {@code columnIndex} is greater than or equal
   *     to the number of allowed column keys
   */
  public @Nullable V at(int rowIndex, int columnIndex) {

      this.bitCount = LongAddables.create();
    }

    // Used by serialization
    LockFreeBitArray(long[] data) {
      checkArgument(data.length > 0, "data length is zero!");
      this.data = new AtomicLongArray(data);
      this.bitCount = LongAddables.create();
      long bitCount = 0;
      for (long value : data) {
        bitCount += Long.bitCount(value);

    return new FunctionToCacheLoader<>(function);
  }

  /**
   * Returns a cache loader based on an <i>existing</i> supplier instance. Note that there's no need
   * to create a <i>new</i> supplier just to pass it in here; just subclass {@code CacheLoader} and
   * implement {@link #load load} instead.
   *
   * <p>The returned object is serializable if {@code supplier} is serializable.
   *

    class ImplementationTests {

        @Test
        @DisplayName("Test concrete implementation of FileNotifyInformation")
        void testConcreteImplementation() {
            // Create a simple implementation for testing
            FileNotifyInformation impl = new FileNotifyInformation() {
                private final int action = FileNotifyInformation.FILE_ACTION_MODIFIED;

        private final Smb2LeaseKey leaseKey;
        private final SmbFile directoryFile;
        private volatile boolean active;
        private CompletableFuture<Void> notificationFuture;

        /**
         * Create a new change notification handle
         *
         * @param path directory path
         * @param key lease key
         * @param dir directory file
         */

public abstract class AbstractListenableFutureTest extends TestCase {

  protected CountDownLatch latch;
  protected ListenableFuture<Boolean> future;

  @Override
  protected void setUp() throws Exception {

    // Create a latch and a future that waits on the latch.
    latch = new CountDownLatch(1);
    future = createListenableFuture(Boolean.TRUE, null, latch);
  }

  @Override
  protected void tearDown() throws Exception {

    }

    @Test
    void testZeroScoreChannels() {
        loadBalancer.setStrategy(LoadBalancingStrategy.WEIGHTED_RANDOM);

        // Create channels with zero scores (failed state)
        channel1.setState(ChannelState.FAILED);
        channel2.setState(ChannelState.FAILED);

import org.mockito.junit.jupiter.MockitoExtension;
import org.mockito.junit.jupiter.MockitoSettings;
import org.mockito.quality.Strictness;

/**
 * Tests for SmbTreeHandle interface.
 * This test class uses Mockito to create a mock implementation of the SmbTreeHandle interface.
 * Each method of the interface is tested to ensure it behaves as expected.
 */
@ExtendWith(MockitoExtension.class)
@MockitoSettings(strictness = Strictness.LENIENT)

     */
    public SynonymItem(final long id, final String[] inputs, final String[] outputs) {
        this.id = id;
        this.inputs = inputs;
        this.outputs = outputs;

        if (id == 0) {
            // create
            newInputs = inputs;
            newOutputs = outputs;
        }
    }

    /**
     * Gets the new input words.
     *
     * @return The new input words.
     */

  @ListFeature.Require(SUPPORTS_SET)
  public void testSet_replacingNull() {
    E[] elements = createSamplesArray();
    int i = aValidIndex();
    elements[i] = null;
    collection = getSubjectGenerator().create(elements);

    doTestSet(e3());
  }

  private void doTestSet(E newValue) {
    int index = aValidIndex();
    E initialValue = getList().get(index);
    assertEquals(