while (lower <= upper) {
      int middle = (lower + upper) >>> 1;
      int c = comparator.compare(key, list.get(middle));
      if (c < 0) {
        upper = middle - 1;
      } else if (c > 0) {
        lower = middle + 1;
      } else {
        return lower
            + presentBehavior.resultIndex(
                comparator, key, list.subList(lower, upper + 1), middle - lower);
      }
    }

    while (lower <= upper) {
      int middle = (lower + upper) >>> 1;
      int c = comparator.compare(key, list.get(middle));
      if (c < 0) {
        upper = middle - 1;
      } else if (c > 0) {
        lower = middle + 1;
      } else {
        return lower
            + presentBehavior.resultIndex(
                comparator, key, list.subList(lower, upper + 1), middle - lower);
      }
    }

        ExtendedSmbTree middle = smbTree.unwrap(ExtendedSmbTree.class);
        CustomSmbTree inner = middle.unwrap(CustomSmbTree.class);

        assertNotNull(middle, "Middle tree should not be null");
        assertNotNull(inner, "Inner tree should not be null");
        assertSame(middleTree, middle, "Should return correct middle tree");

        void testToStringWithNestedExceptions() {
            Exception innermost = new IOException("Innermost exception");
            Exception middle = new RuntimeException("Middle exception", innermost);
            Exception rootCause = new IllegalStateException("Outer exception", middle);
            TransportException exception = new TransportException("Transport failed", rootCause);

            String result = exception.toString();

    void testJoinWithEmptyStringElements() {
        String result = StringUtil.join(",", "", "middle", "");
        // First element is empty string (sb becomes "")
        // Second: sb.length() is 0, no delimiter, append "middle" (sb becomes "middle")
        // Third: sb.length() > 0, add delimiter + "" (sb becomes "middle,")
        assertEquals("middle,", result);
    }

    @Test

    assertEquals("Should be able to peek() at middle element", "B", peekingIterator.peek());
    assertEquals(
        "Should be able to peek() middle element multiple times", "B", peekingIterator.peek());
    assertEquals(
        "next() should still return middle element after peeking", "B", peekingIterator.next());

                Arguments.of(makeSeq(8), 0, 8, 0), // full copy at index 0
                Arguments.of(makeSeq(10), 2, 5, 3), // middle slice, non-zero dst index
                Arguments.of(makeSeq(4), 4, 0, 0), // zero-length slice at end
                Arguments.of(makeSeq(16), 7, 3, 0), // small slice from middle
                Arguments.of(makeSeq(16), 0, 0, 5) // zero-length with non-zero dst index
        );
    }

    }

    /**
     * Test getMessageByDcerpcError() with a known error code (middle element).
     */
    @Test
    void testGetMessageByDcerpcError_middleElement() {
        String message = DcerpcException.getMessageByDcerpcError(DcerpcError.DCERPC_FAULT_INVALID_TAG);
        assertEquals("DCERPC_FAULT_INVALID_TAG", message, "Should return correct message for middle element.");
    }

    /**

    for (V element : elements) {
      assertFalse("Should not contain value " + element, getMap().containsValue(element));
    }
  }

  /**
   * @return an array of the proper size with {@code null} as the key of the middle element.
   */
  protected Entry<K, V>[] createArrayWithNullKey() {
    Entry<K, V>[] array = createSamplesArray();
    int nullKeyLocation = getNullLocation();
    Entry<K, V> oldEntry = array[nullKeyLocation];

  private M multimap;

  protected M multimap() {
    return multimap;
  }

  /**
   * @return an array of the proper size with {@code null} as the key of the middle element.
   */
  protected Entry<K, V>[] createArrayWithNullKey() {
    Entry<K, V>[] array = createSamplesArray();
    int nullKeyLocation = getNullLocation();
    Entry<K, V> oldEntry = array[nullKeyLocation];