return result;
    }
    int remaining = totalLen - result.length;
    result = Arrays.copyOf(result, totalLen);
    while (remaining > 0) {
      byte[] buf = bufs.remove();
      int bytesToCopy = min(remaining, buf.length);
      int resultOffset = totalLen - remaining;
      System.arraycopy(buf, 0, result, resultOffset, bytesToCopy);
      remaining -= bytesToCopy;
    }
    return result;
  }

        return self

    def __exit__(self, exc_type, exc_val, exc_tb) -> None:
        pass

    def update_request_info(self, cost: int, remaining: int, reset_at: str) -> None:
        self.last_query_cost = cost
        self.remaining_points = remaining
        self.reset_at = datetime.fromisoformat(reset_at.replace("Z", "+00:00"))


rate_limiter = RateLimiter()


discussions_query = """

            assertEquals("Hello", new String(buffer, 0, bytesRead, "UTF-8"));

            // Read remaining bytes
            byte[] remaining = new byte[20];
            int remainingBytes = stream.read(remaining);
            assertEquals(8, remainingBytes); // ", World!"
            assertEquals(", World!", new String(remaining, 0, remainingBytes, "UTF-8"));
        }
    }

    // --- isInMemory() tests ---

    @Nullable Node<K, V> next;
    @Nullable Node<K, V> toRemove;
    int expectedModCount;
    int remaining;

    BiIterator(HashBiMap<K, V> biMap) {
      this.biMap = biMap;
      next = biMap.firstInKeyInsertionOrder;
      expectedModCount = biMap.modCount;
      remaining = biMap.size();
    }

    @Override
    public final boolean hasNext() {

            }

            if (totalChars + docEntry.length() > maxChars) {
                final int remaining = maxChars - totalChars - CONTEXT_TRUNCATION_BUFFER;
                if (remaining > 0 && docEntry.length() > remaining) {
                    docEntry.setLength(remaining);
                    docEntry.append("...\n\n");
                    documentContent.append(docEntry);
                }

      int remaining = queue.size();
      while (queueIterator.hasNext()) {
        Integer element = queueIterator.next();
        remaining--;
        assertThat(elements).contains(element);
        if (random.nextBoolean()) {
          elements.remove(element);
          queueIterator.remove();
        }
      }
      assertThat(remaining).isEqualTo(0);
      assertIntact(queue);

      int remaining = queue.size();
      while (queueIterator.hasNext()) {
        Integer element = queueIterator.next();
        remaining--;
        assertThat(elements).contains(element);
        if (random.nextBoolean()) {
          elements.remove(element);
          queueIterator.remove();
        }
      }
      assertThat(remaining).isEqualTo(0);
      assertIntact(queue);

    }

    @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

  // 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)