}

    @Test
    public void test_addHistoryWithBudget_turnBasedPacking_contiguousRecency() {
        // 3 turns: turn0(Q1+A1=4), turn1(big=200), turn2(Q3+A3=4)
        // Budget=20: turn2 fits (4, remaining=16), turn1 doesn't fit (200>16), stop
        // Even though turn0 (4 chars) would fit individually, contiguity is maintained
        final List<LlmMessage> history = new ArrayList<>();

            }
        }

        if (firstIncludedTurn < turns.size()) {
            for (int t = firstIncludedTurn; t < turns.size(); t++) {
                final int[] turn = turns.get(t);
                for (int i = turn[0]; i < turn[1]; i++) {
                    request.addMessage(history.get(i));
                }
            }