verify(mockNdrBuffer).enc_ndr_small((byte) 2); // sub_authority_count
            verify(mockNdrBuffer).advance(6); // identifier_authority advance
            verify(mockNdrBuffer).advance(8); // sub_authority advance (4 * 2)
            verify(mockNdrBuffer, times(2)).derive(anyInt());

            // Verify identifier_authority bytes (5 zeros + 1 five)

    }

    @Test
    void testAdvance() {
        ndrBuffer.advance(10);
        assertEquals(10, ndrBuffer.getIndex());
        assertEquals(10, ndrBuffer.getLength());

        ndrBuffer.advance(5);
        assertEquals(15, ndrBuffer.getIndex());
        assertEquals(15, ndrBuffer.getLength());

        // Advance past current length
        ndrBuffer.setLength(10);
        ndrBuffer.setIndex(10);

  public void testAdvance() {
    FakeTicker ticker = new FakeTicker();
    assertEquals(0, ticker.read());
    assertThat(ticker.advance(10)).isSameInstanceAs(ticker);
    assertEquals(10, ticker.read());
    ticker.advance(1, MILLISECONDS);
    assertEquals(1000010L, ticker.read());
    ticker.advance(Duration.ofMillis(1));
    assertEquals(2000010L, ticker.read());
  }

  public void testAutoIncrementStep_returnsSameInstance() {

        verify(mockDeferredBuffer, times(4)).enc_ndr_string(anyString());

        // Verify security descriptor encoding
        verify(mockDeferredBuffer).enc_ndr_long(2);
        verify(mockDeferredBuffer).advance(2);
        verify(mockDeferredBuffer).enc_ndr_small((byte) 1);
        verify(mockDeferredBuffer).enc_ndr_small((byte) 2);
    }

    @Test
    void testShareInfoCtr0EncodeWithArray() throws NdrException {

                _dst.enc_ndr_long(_name_buffers);
                _dst.enc_ndr_long(0);
                _dst.enc_ndr_long(_name_bufferl);
                final int _name_bufferi = _dst.index;
                _dst.advance(2 * _name_bufferl);

                _dst = _dst.derive(_name_bufferi);
                for (int _i = 0; _i < _name_bufferl; _i++) {
                    _dst.enc_ndr_short(name.buffer[_i]);
                }

                double variance = (maxTime - minTime) / avgTime;
                // JVM timing in concurrent scenarios is inherently variable
                // We verify implementation correctness rather than precise timing
                assertTrue(variance < 50.0,
                        String.format(

  public void testAdvance() {
    FakeTicker ticker = new FakeTicker();
    assertEquals(0, ticker.read());
    assertThat(ticker.advance(10)).isSameInstanceAs(ticker);
    assertEquals(10, ticker.read());
    ticker.advance(1, MILLISECONDS);
    assertEquals(1000010L, ticker.read());
    ticker.advance(Duration.ofMillis(1));
    assertEquals(2000010L, ticker.read());
  }

  public void testAutoIncrementStep_returnsSameInstance() {

        this.parent = parent;
        this.delegate = delegate;
        this.filter = filter;
        this.next = advance();
    }

    /**
     * @return next element
     */
    private SmbResource advance() {
        while (this.delegate.hasNext()) {
            final FileEntry n = this.delegate.next();
            if (this.filter == null) {
                try {

            if (s != null) {
                _dst = _dst.deferred;
                final int _ss = count;
                _dst.enc_ndr_long(_ss);
                final int _si = _dst.index;
                _dst.advance(4 * _ss);

                _dst = _dst.derive(_si);
                for (int _i = 0; _i < _ss; _i++) {
                    s[_i].encode(_dst);
                }
            }
        }

   * either the {@code x} or {@code y} data must have a non-zero population variance (i.e. {@code
   * xStats().populationVariance() > 0.0 || yStats().populationVariance() > 0.0}). The result is
   * guaranteed to be horizontal if there is variance in the {@code x} data but not the {@code y}
   * data, and vertical if there is variance in the {@code y} data but not the {@code x} data.
   *