cache.put(0, 10);
    cache.put(2, 30);

    fakeTicker.advance(999, MILLISECONDS);
    assertThat(cache.getIfPresent(2)).isEqualTo(30);
    fakeTicker.advance(1, MILLISECONDS);
    assertThat(cache.getIfPresent(2)).isEqualTo(30);
    fakeTicker.advance(1000, MILLISECONDS);
    assertThat(cache.getIfPresent(0)).isNull();
  }

  @Test

            final int _identifier_authoritys = 6;
            final int _identifier_authorityi = _dst.index;
            _dst.advance(1 * _identifier_authoritys);
            final int _sub_authorityi = _dst.index;
            _dst.advance(4 * _sub_authoritys);

            _dst = _dst.derive(_identifier_authorityi);
            for (int _i = 0; _i < _identifier_authoritys; _i++) {

      ticker.advance(1, MILLISECONDS);
    }

    assertThat(cache.getUnchecked(0)).isEqualTo(0);
    assertThat(cache.getUnchecked(1)).isEqualTo(1);
    assertThat(cache.getUnchecked(2)).isEqualTo(2);
    assertThat(loader.getLoadCount()).isEqualTo(expectedLoads);
    assertThat(loader.getReloadCount()).isEqualTo(expectedReloads);

    // refresh 0
    ticker.advance(1, MILLISECONDS);

type SplitFunc func(data []byte, atEOF bool) (advance int, token []byte, err error)

// Errors returned by Scanner.
var (
	ErrTooLong         = errors.New("bufio.Scanner: token too long")
	ErrNegativeAdvance = errors.New("bufio.Scanner: SplitFunc returns negative advance count")
	ErrAdvanceTooFar   = errors.New("bufio.Scanner: SplitFunc returns advance count beyond input")

        this.deferred.length = length;
    }

    /**
     * Advances the buffer index by the specified number of bytes.
     *
     * @param n the number of bytes to advance
     */
    public void advance(final int n) {
        this.index += n;
        if (this.index - this.start > this.deferred.length) {
            this.deferred.length = this.index - this.start;
        }
    }

    /**

                _dst = _dst.deferred;
                final int _arrays = count;
                _dst.enc_ndr_long(_arrays);
                final int _arrayi = _dst.index;
                _dst.advance(4 * _arrays);

                _dst = _dst.derive(_arrayi);
                for (int _i = 0; _i < _arrays; _i++) {
                    array[_i].encode(_dst);
                }
            }
        }

  @CanIgnoreReturnValue
  public FakeTicker advance(long time, TimeUnit timeUnit) {
    return advance(timeUnit.toNanos(time));
  }

  /** Advances the ticker value by {@code nanoseconds}. */
  @SuppressWarnings("GoodTime") // should accept a java.time.Duration
  @CanIgnoreReturnValue
  public FakeTicker advance(long nanoseconds) {
    nanos.addAndGet(nanoseconds);
    return this;
  }

  private @Nullable Reader current;

  MultiReader(Iterator<? extends CharSource> readers) throws IOException {
    this.it = readers;
    advance();
  }

  /** Closes the current reader and opens the next one, if any. */
  private void advance() throws IOException {
    close();
    if (it.hasNext()) {
      current = it.next().openStream();
    }
  }

  @Override

    }

    @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() {