close.writeParameterWordsWireFormat(buffer, 0);
        // first two bytes encode fid 42
        assertEquals((byte) 42, buffer[0]);
        assertEquals((byte) 0, buffer[1]);
        // remaining 4 bytes should all be 0xFF according to writeUTime
        for (int i = 2; i < 6; i++) {
            assertEquals((byte) 0xFF, buffer[i], "byte %d should be 0xFF".formatted(i));
        }
    }

    /**

   *     {@code len < 0}
   */
  @CanIgnoreReturnValue
  PrimitiveSink putBytes(byte[] bytes, int off, int len);

  /**
   * Puts the remaining bytes of a byte buffer into this sink. {@code bytes.position()} is the first
   * byte written, {@code bytes.limit() - 1} is the last. The position of the buffer will be equal
   * to the limit when this method returns.
   *

    }

    @Test
    public void test_addHistoryWithBudget_multipleTurns_budgetTight() {
        // 3 turns: turn0(Q1+A1=10), turn1(Q2+A2=10), turn2(Q3+A3=10)
        // Budget=25: turn2(10) fits (remaining=15), turn1(10) fits (remaining=5), turn0(10) doesn't
        final List<LlmMessage> history = new ArrayList<>();
        history.add(LlmMessage.user("QQQQQ")); // 5
        history.add(LlmMessage.assistant("AAAAA")); // 5

      readBuffer.order(order);
    }
  }

  @CanIgnoreReturnValue
  private Hasher putBytesInternal(ByteBuffer readBuffer) {
    // If we have room for all of it, this is easy
    if (readBuffer.remaining() <= buffer.remaining()) {
      buffer.put(readBuffer);
      munchIfFull();
      return this;
    }

    // First add just enough to fill buffer size, and munch that

     * Gets the number of bytes actually read
     *
     * @return the dataLength
     */
    public int getDataLength() {
        return this.dataLength;
    }

    /**
     * Gets the number of bytes remaining to be read
     *
     * @return the dataRemaining
     */
    public int getDataRemaining() {
        return this.dataRemaining;
    }

    /**
     * {@inheritDoc}
     *

   * this is translated to throttling time is discussed later). Immediately after, assume that an
   * acquire(10) request arriving. We serve the request partly from storedPermits, using all the
   * remaining 7.0 permits, and the remaining 3.0, we serve them by fresh permits produced by the
   * rate limiter.
   *
   * We already know how much time it takes to serve 3 fresh permits: if the rate is

  // Test for common pitfall regarding sign extension.
  // For example: (long) data[i++] | (long) data[i++] << 8 | ...
  // If data[i] == (byte) 0x80, the first cast will sign-extend it to 0xffffffffffffff80,
  // masking the remaining seven bytes.
  // To test this, we give an input where bit 7 is not cleared. For example:
  // (1) 00 01 02 03 04 05 06 07 80
  // (2) 00 01 02 03 04 05 06 07 81
  // (3) 00 01 02 03 04 05 06 07 ff (or anything in between)

  // Test for common pitfall regarding sign extension.
  // For example: (long) data[i++] | (long) data[i++] << 8 | ...
  // If data[i] == (byte) 0x80, the first cast will sign-extend it to 0xffffffffffffff80,
  // masking the remaining seven bytes.
  // To test this, we give an input where bit 7 is not cleared. For example:
  // (1) 00 01 02 03 04 05 06 07 80
  // (2) 00 01 02 03 04 05 06 07 81
  // (3) 00 01 02 03 04 05 06 07 ff (or anything in between)

		// Skip until offset.
		block = block[offset:]

		// Reset the offset for next iteration to read everything
		// from subsequent blocks.
		offset = 0

		// We have written all the blocks, write the last remaining block.
		if write < int64(len(block)) {
			n, err := dst.Write(block[:write])
			if err != nil {
				return 0, err
			}
			totalWritten += int64(n)
			break
		}

		// Copy the block.

  public static <E extends Comparable<? super E>> ImmutableSortedMultiset<E> of(
      E e1, E e2, E e3, E e4, E e5, E e6, E... remaining) {
    int size = remaining.length + 6;
    List<E> all = Lists.newArrayListWithCapacity(size);
    Collections.addAll(all, e1, e2, e3, e4, e5, e6);
    Collections.addAll(all, remaining);
    return copyOf(Ordering.natural(), all);
  }

  /**