}

    @Test
    @DisplayName("Iterator with rejecting filter - finds next acceptable")
    void iteratorWithRejectingFilter() throws Exception {
        // Setup: first entry rejected, second accepted
        FileEntry entry1 = mock(FileEntry.class);
        FileEntry entry2 = mock(FileEntry.class);

        when(delegate.hasNext()).thenReturn(true, true, false);

        assertEquals(sidT1, lsarSidArrayX.sids[0].sid, "First SID should be unwrapped correctly");
        assertEquals(sidT2, lsarSidArrayX.sids[1].sid, "Second SID should be unwrapped correctly");
    }

    @Test
    void testConstructorWithJcifsSIDArrayDirectAssignment() {
        // Create mock SID objects
        SID mockSid1 = mock(SID.class);

    }

    @Test
    @DisplayName("Test nextElement() changes command on second call")
    void testNextElementSecondCall() {
        // First call - primary
        transaction.nextElement();
        byte initialCommand = transaction.command;

        // Second call - secondary
        transaction.nextElement();

        // Verify command changed to secondary

@GwtCompatible
@NullMarked
public class AbstractIteratorTest extends TestCase {

  public void testDefaultBehaviorOfNextAndHasNext() {

    // This sample AbstractIterator returns 0 on the first call, 1 on the
    // second, then signals that it's reached the end of the data
    Iterator<Integer> iter =
        new AbstractIterator<Integer>() {
          private int rep;

          @Override
          public @Nullable Integer computeNext() {

      long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
      // we allow one second worth of work to go in a burst (i.e. take less than a second)
      assertTrue(burst <= 1000);
      long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
      // but work beyond that must take at least one second
      assertTrue(afterBurst >= 1000);
    }
  }

  /**

      long burst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
      // we allow one second worth of work to go in a burst (i.e. take less than a second)
      assertTrue(burst <= 1000);
      long afterBurst = measureTotalTimeMillis(limiter, oneSecWorthOfWork, new Random());
      // but work beyond that must take at least one second
      assertTrue(afterBurst >= 1000);
    }
  }

  /**

 *   protected void visitWildcardType(WildcardType t) {
 *     throw new IllegalArgumentException("Cannot contain wildcard type.");
 *   }
 * }.visit(type);
 * }
 *
 * <p>One {@code Type} is visited at most once. The second time the same type is visited, it's
 * ignored by {@link #visit}. This avoids infinite recursion caused by recursive type bounds.
 *
 * <p>This class is not thread safe.
 *
 * @author Ben Yu
 */

        assertEquals("foo/", r1.getName(), "First child name should match with trailing slash");

        assertTrue(it.hasNext(), "Expected second element available");
        SmbResource r2 = it.next();
        assertNotNull(r2);
        assertEquals("bar/", r2.getName(), "Second child name should match with trailing slash");

        // End of iteration behavior
        assertFalse(it.hasNext(), "No more elements expected");

            TestServerMessageBlock2 second = new TestServerMessageBlock2(mockConfig);
            TestServerMessageBlock2 third = new TestServerMessageBlock2(mockConfig);

            assertTrue(testMessage.chain(second));
            assertTrue(testMessage.chain(third));

            assertEquals(second, testMessage.getNext());
            assertEquals(third, second.getNext());
        }

        @Test

        int result = smbComRename.writeBytesWireFormat(dst, dstIndex);

        // Then
        assertTrue(result > 0);
        assertEquals((byte) 0x04, dst[0]); // First buffer format byte

        // Find the second buffer format byte
        int secondBufferFormatIndex = oldFileName.length() + 2; // 1 for first 0x04, 1 for null terminator
        assertEquals((byte) 0x04, dst[secondBufferFormatIndex]);
    }

    /**