}

        // Perform a partition with the selected median.
        int low = from + 1, high = to; // Indexes for partitioning.
        double partition = array[from + 1]; // Choose partitioning element.
        while (true) {
          // Skip the elements smaller than the partition.
          do {
            low++;
          } while (array[low] < partition);

          // Skip the elements larger than the partition.

        }

        // Perform a partition with the selected median.
        int low = from + 1, high = to; // Indexes for partitioning.
        double partition = array[from + 1]; // Choose partitioning element.
        while (true) {
          // Skip the elements smaller than the partition.
          do {
            low++;
          } while (array[low] < partition);

          // Skip the elements larger than the partition.

    type: str


class CarItem(BaseItem):
    type: str = "car"


class PlaneItem(BaseItem):
    type: str = "plane"
    size: int


items = {
    "item1": {"description": "All my friends drive a low rider", "type": "car"},
    "item2": {
        "description": "Music is my aeroplane, it's my aeroplane",
        "type": "plane",
        "size": 5,
    },
}

    int low = firstChild;
    int high = firstChild + numChildren - 1;

    while (low <= high) {
      int mid = (low + high) >>> 1;
      int labelOffset = trieData.charAt(mid * NODE_SIZE);
      int cmp = compareLabel(label, labelOffset);

      if (cmp < 0) {
        high = mid - 1;
      } else if (cmp > 0) {
        low = mid + 1;
      } else {
        return mid;

3. **Actively collaborate with us.** We commit real time and attention to everything we review. Low-effort submissions—where code is generated, submitted, and abandoned—waste our limited review capacity.

## What contributors can expect from us

    // center will be at either low or high.
    int low = requiredFrom;
    int high = requiredTo;
    while (high > low + 1) {
      int mid = (low + high) >>> 1;
      if (allRequired[mid] > centerFloor) {
        high = mid;
      } else if (allRequired[mid] < centerFloor) {
        low = mid;
      } else {

    // Two differing invalid pairs.
    assertThat(Strings.commonSuffix("abc\uDCAB\uDCABdef", "abc\uDCAC\uDCABdef"))
        .isEqualTo("\uDCABdef");
    // One orphan low surrogate.
    assertThat(Strings.commonSuffix("x\uD8AB\uDCAB", "\uDCAB")).isEqualTo("");
    // Two orphan low surrogates.
    assertThat(Strings.commonSuffix("\uDCAB", "\uDCAB")).isEqualTo("\uDCAB");
  }

  public void testValidSurrogatePairAt() {

    // Two differing invalid pairs.
    assertThat(Strings.commonSuffix("abc\uDCAB\uDCABdef", "abc\uDCAC\uDCABdef"))
        .isEqualTo("\uDCABdef");
    // One orphan low surrogate.
    assertThat(Strings.commonSuffix("x\uD8AB\uDCAB", "\uDCAB")).isEqualTo("");
    // Two orphan low surrogates.
    assertThat(Strings.commonSuffix("\uDCAB", "\uDCAB")).isEqualTo("\uDCAB");
  }

  public void testValidSurrogatePairAt() {

    int k1 = mixK1(input);
    int h1 = mixH1(seed, k1);

    return fmix(h1, Ints.BYTES);
  }

  @Override
  public HashCode hashLong(long input) {
    int low = (int) input;
    int high = (int) (input >>> 32);

    int k1 = mixK1(low);
    int h1 = mixH1(seed, k1);

    k1 = mixK1(high);
    h1 = mixH1(h1, k1);

    return fmix(h1, Longs.BYTES);
  }

  @Override

Prefer either:
  * Provide only non-nullable version and move the `null` check to the call site (if the number of nullable callsites is low).
  * Provide two overloads with a different names (as Java doesn't support overloading on nullability). See