checkResult(zeroForNull, iterableNullNull, "0-0");
    checkResult(zeroForNull, iterableNull1, "0-1");
    checkResult(zeroForNull, iterable1Null, "1-0");
    checkResult(zeroForNull, iterable1Null2, "1-0-2");
    checkResult(zeroForNull, iterableFourNulls, "0-0-0-0");
  }

  @SuppressWarnings("AppendIterableIterator") // We intentionally test the Iterator overload.

        assertEquals(1, result3.size());
        assertEquals(3, result3.getAllRecordCount());

        // Out of range offset
        PagingList<CharMappingItem> result4 = charMappingFile.selectList(10, 2);
        assertEquals(0, result4.size());
        assertEquals(3, result4.getAllRecordCount());

        // Negative offset
        PagingList<CharMappingItem> result5 = charMappingFile.selectList(-1, 2);

    }

    @Test
    public void test_selectList_offsetOutOfBounds() {
        loadTestData();

        DictionaryFile.PagingList<StopwordsItem> result = stopwordsFile.selectList(10, 2);
        // When offset is out of bounds, all items may still be returned
        assertTrue(result.size() <= 5);
        assertEquals(6, result.getCurrentPageNumber()); // offset 10 with size 2 = page 6

pkg debug/elf, const R_PPC_DTPREL16_LO = 75
pkg debug/elf, const R_PPC_DTPREL32 = 78
pkg debug/elf, const R_PPC_EMB_BIT_FLD = 115
pkg debug/elf, const R_PPC_EMB_MRKREF = 110
pkg debug/elf, const R_PPC_EMB_NADDR16 = 102
pkg debug/elf, const R_PPC_EMB_NADDR16_HA = 105
pkg debug/elf, const R_PPC_EMB_NADDR16_HI = 104
pkg debug/elf, const R_PPC_EMB_NADDR16_LO = 103
pkg debug/elf, const R_PPC_EMB_NADDR32 = 101

    } catch (TimeoutException e) {
        // Force lease release if break handling times out
        releaseLease(key);
        log.warn("Lease break timeout for key: {}", key);
    }
}
```

### 10.2 Fallback to Oplocks
```java
if (!context.getConfig().isUseLeases() || !session.supports(SMB3_0)) {
    // Fall back to traditional oplock mechanism
    useOplockInstead();
}
```

			t.Errorf("ContainsFunc(%q, func(%q)) = %v, want %v",
				ct.b, ct.r, !ct.expected, ct.expected)
		}
	}
}

var makeFieldsInput = func() []byte {
	x := make([]byte, 1<<20)
	// Input is ~10% space, ~10% 2-byte UTF-8, rest ASCII non-space.
	r := rand.New(rand.NewSource(99))
	for i := range x {
		switch r.Intn(10) {
		case 0:
			x[i] = ' '
		case 1:
			if i > 0 && x[i-1] == 'x' {
				copy(x[i-1:], "χ")

   * tests are divided into three sections:
   * 1. Tests on a hardcoded dataset for chains starting with median(), quartiles(), and scale(10);
   * 2. Tests on hardcoded datasets include non-finite values for chains starting with scale(10);
   * 3. Tests on a mechanically generated dataset for chains starting with percentiles();
   * 4. Tests of illegal usages of the API.

   * tests are divided into three sections:
   * 1. Tests on a hardcoded dataset for chains starting with median(), quartiles(), and scale(10);
   * 2. Tests on hardcoded datasets include non-finite values for chains starting with scale(10);
   * 3. Tests on a mechanically generated dataset for chains starting with percentiles();
   * 4. Tests of illegal usages of the API.

            .put("b", 1)
            .build();
    multimap = SerializableTester.reserialize(multimap);
    assertThat(multimap.keySet()).containsExactly("b", "a").inOrder();
    assertThat(multimap.get("a")).containsExactly(10, 2).inOrder();
    assertEquals(
        Ordering.usingToString(), ((ImmutableSortedSet<Integer>) multimap.get("a")).comparator());
    assertEquals(

                        return true;
                    }
                }
                return false;
            }
        };
    }
}
```

### 10.2 Batch Handle Operations
```java
public class BatchHandleOperations {
    public void reconnectMultipleHandles(List<HandleInfo> handles) {
        List<CompletableFuture<Void>> futures = new ArrayList<>();