// This tests that it.remove() above actually changed the order. It
    // indicates that the value 40 was stored in forgetMeNot, so it is
    // returned in the last call to it.next(). Without it, 30 should be the last
    // item returned by the iterator.
    Integer lastItem = 0;
    for (Integer tmp : mmHeap) {
      lastItem = tmp;
    }
    assertEquals((Integer) 30, lastItem);
  }

        history.add(LlmMessage.assistant("A4"));
        final LlmChatRequest request = client.testBuildIntentRequest("Q5", history);
        final List<LlmMessage> messages = request.getMessages();
        // system + 6 history (last 6: Q2,A2,Q3,A3,Q4,A4) + user = 8 messages
        assertEquals(8, messages.size());
        // First history message should be Q2 (Q1,A1 trimmed)
        assertEquals("Q2", messages.get(1).getContent());

	// Compute endEncOffset with one additional DARE package (so
	// we read the package containing the last desired byte).
	endEncOffset := encCumulativeSum + (endPkgNum+1)*sseDAREEncPackageBlockSize
	// Check if the DARE package containing the end offset is a
	// full sized package (as the last package in the part may be
	// smaller)
	lastPartSize, _ := sio.EncryptedSize(uint64(sizes[partEnd]))

        session.addUserMessage("User 2");
        session.addAssistantMessage("Assistant 2");

        // maxMessages=1 starts at index 3 (Assistant 2) -> go back to index 2 (User 2)
        // Result should keep the last user/assistant pair
        session.trimHistory(1);

        final List<ChatMessage> messages = session.getMessages();
        assertEquals(2, messages.size());

   * {@link #get} instead.
   *
   * @throws UncheckedExecutionException if an exception was thrown while loading the value. (As
   *     explained in the last paragraph above, this should be an unchecked exception only.)
   * @throws ExecutionError if an error was thrown while loading the value
   */
  @CanIgnoreReturnValue // TODO(b/27479612): consider removing this?

     *
     * Current strategy is based on failure count. In the future, this could be enhanced to consider:
     * - Recent event frequency (successful notifications)
     * - Time since last successful notification
     * - Events per unit time for more adaptive behavior
     *
     * @param handle notification handle
     * @return polling interval in milliseconds
     */

  public void testObjectHashCodeWithSameLowOrderBytes() {
    // These will have the same first 4 bytes (all 0).
    byte[] bytesA = new byte[5];
    byte[] bytesB = new byte[5];

    // Change only the last (5th) byte
    bytesA[4] = (byte) 0xbe;
    bytesB[4] = (byte) 0xef;

    HashCode hashCodeA = HashCode.fromBytes(bytesA);
    HashCode hashCodeB = HashCode.fromBytes(bytesB);

    // They aren't equal...

  private static boolean isTimed(Method method) {
    return isLongTimeUnitBased(method) || isDurationBased(method);
  }

  /** Determines whether the given method takes a time and unit as its last two parameters. */
  private static boolean isLongTimeUnitBased(Method method) {
    Class<?>[] parameterTypes = method.getParameterTypes();
    return parameterTypes.length >= 2

 *   <li>All events for a given listener dispatch on the provided executor.
 *   <li>It is easy for the user to ensure that listeners are never invoked while holding locks.
 * </ul>
 *
 * The last point is subtle. Often the observable object will be managing its own internal state
 * using a lock, however it is dangerous to dispatch listeners while holding a lock because they

  }

  @Override
  public E first() {
    if (isEmpty()) {
      throw new NoSuchElementException();
    }
    return elements.get(0);
  }

  @Override
  public E last() {
    if (isEmpty()) {
      throw new NoSuchElementException();
    }
    return elements.get(size() - 1);
  }

  @Override
  public @Nullable E lower(E element) {