assertEquals(List.of(3, 2, 1, 0), retriesSeen);
    }

    @Test
    public void test_tryStartOperation_retryChain_exhausted() {
        // Simulate retry chain: cleanup always succeeds but create always fails
        final AtomicInteger cleanupCallCount = new AtomicInteger(0);
        final CoordinatorHelper helper = new CoordinatorHelper() {
            @Override

        final String result = chatClient.testBuildAssistantHistoryContent(msg, "smart_summary", 500, 500);
        // Result should not exceed summaryMaxChars by much (suffix may push slightly, but the body is budgeted)
        assertTrue(result.length() <= 500 + 50, "result length " + result.length() + " exceeds reasonable bound");
    }

    @Test
    public void test_smartSummary_longSourceTitlesExceedBudget() {

        assertEquals(10, qrList.getPageSize());
        assertEquals(0, qrList.getOffset());

        // Page info should be calculated (allRecordCount=100, pageSize=10 => 10 pages)
        // But since size() < pageSize, collapsing logic applies and allPageCount becomes currentPageNumber
        assertEquals(1, qrList.getAllPageCount()); // Collapsed to current page due to size() = 1 < pageSize = 10

        .isEqualTo(0xFFEEDDCC);
  }

  public void testByteArrayRoundTrips() {
    Random r = new Random(5);
    byte[] b = new byte[Ints.BYTES];

    // total overkill, but, it takes 0.1 sec so why not...
    for (int i = 0; i < 10000; i++) {
      int num = r.nextInt();
      assertThat(Ints.fromByteArray(Ints.toByteArray(num))).isEqualTo(num);

      r.nextBytes(b);

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

value being in // the correct range and to match the specification. It's unfortunate // that we need to do a shift instead of a mask, but see the comment on // rightShift. // // These are the most dangerous lines in the package and maybe in the // library: a single bit of bias in the selection of nonces would likely // lead to key recovery, but no tests would fail. Look but DO NOT TOUCH. if excess := len(b)*8 - c.N.BitLen(); excess > 0 { // Just to be safe, assert that this only happens for the one curve...

### Promoted CSI Ephemeral Volume to Stable

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

		atomic.AddInt64(&called, 1)
	})

	DB.Preload("Level2s").First(&Level1{}, "id = ?", lvl.ID)

	if called != 3 {
		t.Errorf("Wanted callback to be called 3 times but got %d", called)
	}

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//