// Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31).
    intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE);
    // Add values up to 40. This covers cases like "square of a prime" and such.
    for (int i = 1; i <= 40; i++) {
      intValues.add(i);
    }
    // Now add values near 2^N for lots of values of N.
    for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {

            public int size() {
                return 20;
            }
        };
        qrList.allRecordCount = 40;
        qrList.calculatePageInfo();
        assertEquals(20, qrList.getPageSize());
        assertEquals(1, qrList.getCurrentPageNumber());
        assertEquals(40, qrList.getAllRecordCount());
        assertEquals(2, qrList.getAllPageCount());
        assertEquals(false, qrList.isExistPrevPage());

    assertTrue(it.hasNext());
    assertEquals((Integer) 40, it.next());
    assertFalse(it.hasNext());
    assertEquals(6, mmHeap.size());
    assertTrue("Heap is not intact after remove()", mmHeap.isIntact());
    assertFalse(mmHeap.contains(2));

    // This tests that it.remove() above actually changed the order. It
    // indicates that the value 40 was stored in forgetMeNot, so it is

    assertTrue(it.hasNext());
    assertEquals((Integer) 40, it.next());
    assertFalse(it.hasNext());
    assertEquals(6, mmHeap.size());
    assertTrue("Heap is not intact after remove()", mmHeap.isIntact());
    assertFalse(mmHeap.contains(2));

    // This tests that it.remove() above actually changed the order. It
    // indicates that the value 40 was stored in forgetMeNot, so it is

    assertThat(cache.getIfPresent(3)).isEqualTo(30);
    assertThat(cache.getIfPresent(4)).isEqualTo(40);
    assertThat(cache.getIfPresent(5)).isEqualTo(50);

    cache.put(1, 10);
    assertThat(cache.getIfPresent(1)).isEqualTo(10);
    assertThat(cache.getIfPresent(3)).isEqualTo(30);
    assertThat(cache.getIfPresent(4)).isEqualTo(40);
    assertThat(cache.getIfPresent(5)).isEqualTo(50);
    assertThat(cache.getIfPresent(2)).isNull();

This is not particular to FastAPI, it's just Python, but it's a nice trick to know. 😎

### `yield from` { #yield-from }

當你在迭代某個物件（如類檔案物件），並對每個項目使用 `yield` 時，也可以用 `yield from` 直接逐項產出，省略 `for` 迴圈。

這不是 FastAPI 特有的功能，而是 Python 語法；不過這招很實用。 😎

    int initialCount = 20;
    int countToSet = 40;
    AtomicInteger current = new AtomicInteger(initialCount);

    when(backingMap.get(KEY)).thenReturn(current);

    assertEquals(initialCount, multiset.setCount(KEY, countToSet));
    assertEquals(countToSet, current.get());
  }

  public void testSetCount_asRemove() {
    int countToRemove = 40;
    AtomicInteger current = new AtomicInteger(countToRemove);

Yuri Schimke <******@****.***> 1769413131 +0000

    assertThat(cache.getIfPresent(3)).isEqualTo(30);
    assertThat(cache.getIfPresent(4)).isEqualTo(40);
    assertThat(cache.getIfPresent(5)).isEqualTo(50);

    cache.put(1, 10);
    assertThat(cache.getIfPresent(1)).isEqualTo(10);
    assertThat(cache.getIfPresent(3)).isEqualTo(30);
    assertThat(cache.getIfPresent(4)).isEqualTo(40);
    assertThat(cache.getIfPresent(5)).isEqualTo(50);
    assertThat(cache.getIfPresent(2)).isNull();