*
   * @since 19.0
   */
  Map<Range<K>, V> asDescendingMapOfRanges();

  /**
   * Returns a view of the part of this range map that intersects with {@code range}.
   *
   * <p>For example, if {@code rangeMap} had the entries {@code [1, 5] => "foo", (6, 8) => "bar",
   * (10, ∞) => "baz"} then {@code rangeMap.subRangeMap(Range.open(3, 12))} would return a range map

    this.complement = complement;
  }

  private final transient ImmutableList<Range<C>> ranges;
  private final transient @Nullable ImmutableRangeSet<C> complement;

  @Override
  public boolean intersects(Range<C> otherRange) {
    int ceilingIndex =
        SortedLists.binarySearch(
            ranges,
            Range::lowerBound,
            otherRange.lowerBound,
            Ordering.natural(),

pkg image, method (Rectangle) Empty() bool
pkg image, method (Rectangle) Eq(Rectangle) bool
pkg image, method (Rectangle) In(Rectangle) bool
pkg image, method (Rectangle) Inset(int) Rectangle
pkg image, method (Rectangle) Intersect(Rectangle) Rectangle
pkg image, method (Rectangle) Overlaps(Rectangle) bool
pkg image, method (Rectangle) Size() Point
pkg image, method (Rectangle) String() string
pkg image, method (Rectangle) Sub(Point) Rectangle