*     minValue()}
   */
  public abstract @Nullable C previous(C value);

  /**
   * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
   * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
   * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}

   *     minValue()}
   */
  public abstract @Nullable C previous(C value);

  /**
   * Returns a signed value indicating how many nested invocations of {@link #next} (if positive) or
   * {@link #previous} (if negative) are needed to reach {@code end} starting from {@code start}.
   * For example, if {@code end = next(next(next(start)))}, then {@code distance(start, end) == 3}

	}
}

func (in *Input) Next() ScanToken {
	if in.peek {
		in.peek = false
		tok := in.peekToken
		in.text = in.peekText
		return tok
	}
	// If we cannot generate a token after 100 macro invocations, we're in trouble.
	// The usual case is caught by Push, below, but be safe.
	for nesting := 0; nesting < 100; {
		tok := in.Stack.Next()
		switch tok {
		case '#':
			if !in.beginningOfLine {

        assertNotNull(result);
        assertEquals(Integer.MAX_VALUE, result.intValue());
        verify(request, times(1)).getOverrideTimeout();
    }

    @Test
    @DisplayName("Test multiple method invocations")
    void testMultipleMethodInvocations() {
        // Given
        when(request.isResponseAsync()).thenReturn(true);
        when(request.size()).thenReturn(100);

            // Then
            assertEquals(expectedFree, actualFree);
            verify(mockAllocInfo, times(1)).getFree();
        }

        @Test
        @DisplayName("Should handle multiple invocations")
        void shouldHandleMultipleInvocations() {
            // Given
            when(mockAllocInfo.getCapacity()).thenReturn(1000L, 2000L, 3000L);

    assertEquals(1, Queues.newLinkedBlockingQueue(1).remainingCapacity());
    assertEquals(11, Queues.newLinkedBlockingQueue(11).remainingCapacity());
  }

  /** Checks that #drain() invocations behave correctly for a drained (empty) queue. */
  private void assertDrained(BlockingQueue<Object> q) {
    assertNull(q.peek());
    assertInterruptibleDrained(q);
    assertUninterruptibleDrained(q);
  }

            mockReferralData.setCacheMap(new HashMap<>());
            mockReferralData.replaceCache();
            mockReferralData.append(mockReferralData);

            // Verify all invocations
            verify(mockReferralData, atLeastOnce()).getExpiration();
            verify(mockReferralData, atLeastOnce()).getPathConsumed();
            verify(mockReferralData, atLeastOnce()).getDomain();

            assertTrue(e.getMessage().contains("negative [boost] are not allowed"));
        }
    }

    public void test_execute_multipleInvocations() {
        // Test that multiple invocations return consistent results
        QueryContext context = new QueryContext("*:*", false);
        MatchAllDocsQuery query = new MatchAllDocsQuery();
        float boost = 1.0f;

            verify(ace1).getApplyToText();
            verify(ace2).getApplyToText();
        }

        @Test
        @DisplayName("Should support multiple method invocations")
        void shouldSupportMultipleInvocations() {
            ACE ace = mock(ACE.class);
            when(ace.getAccessMask()).thenReturn(ACE.GENERIC_ALL);
            when(ace.isAllow()).thenReturn(true);

  }

  /**
   * Returns a hash code for {@code t}.
   *
   * <p>The {@code hash} has the following properties:
   *
   * <ul>
   *   <li>It is <i>consistent</i>: for any reference {@code x}, multiple invocations of {@code
   *       hash(x}} consistently return the same value provided {@code x} remains unchanged
   *       according to the definition of the equivalence. The hash need not remain consistent from