long bHi = b >>> 32; // < 2^31
        long aLo = a & 0xFFFFFFFFL; // < 2^32
        long bLo = b & 0xFFFFFFFFL; // < 2^32

        /*
         * a * b == aHi * bHi * 2^64 + (aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo.
         *       == (aHi * bHi * 2^32 + aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo
         *

        long bHi = b >>> 32; // < 2^31
        long aLo = a & 0xFFFFFFFFL; // < 2^32
        long bLo = b & 0xFFFFFFFFL; // < 2^32

        /*
         * a * b == aHi * bHi * 2^64 + (aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo.
         *       == (aHi * bHi * 2^32 + aHi * bLo + aLo * bHi) * 2^32 + aLo * bLo
         *

1.23.2...

    testRotate(new byte[] {1, 2, 3}, -3, new byte[] {1, 2, 3});
    testRotate(new byte[] {1, 2, 3}, -2, new byte[] {3, 1, 2});
    testRotate(new byte[] {1, 2, 3}, -1, new byte[] {2, 3, 1});
    testRotate(new byte[] {1, 2, 3}, 0, new byte[] {1, 2, 3});
    testRotate(new byte[] {1, 2, 3}, 1, new byte[] {3, 1, 2});
    testRotate(new byte[] {1, 2, 3}, 2, new byte[] {2, 3, 1});
    testRotate(new byte[] {1, 2, 3}, 3, new byte[] {1, 2, 3});

    testRotate(new byte[] {1, 2, 3}, -3, new byte[] {1, 2, 3});
    testRotate(new byte[] {1, 2, 3}, -2, new byte[] {3, 1, 2});
    testRotate(new byte[] {1, 2, 3}, -1, new byte[] {2, 3, 1});
    testRotate(new byte[] {1, 2, 3}, 0, new byte[] {1, 2, 3});
    testRotate(new byte[] {1, 2, 3}, 1, new byte[] {3, 1, 2});
    testRotate(new byte[] {1, 2, 3}, 2, new byte[] {2, 3, 1});
    testRotate(new byte[] {1, 2, 3}, 3, new byte[] {1, 2, 3});

    testRotate(new char[] {'1', '2', '3'}, -2, new char[] {'3', '1', '2'});
    testRotate(new char[] {'1', '2', '3'}, -1, new char[] {'2', '3', '1'});
    testRotate(new char[] {'1', '2', '3'}, 0, new char[] {'1', '2', '3'});
    testRotate(new char[] {'1', '2', '3'}, 1, new char[] {'3', '1', '2'});
    testRotate(new char[] {'1', '2', '3'}, 2, new char[] {'2', '3', '1'});

    testRotate(new double[] {1, 2, 3}, -2, new double[] {3, 1, 2});
    testRotate(new double[] {1, 2, 3}, -1, new double[] {2, 3, 1});
    testRotate(new double[] {1, 2, 3}, 0, new double[] {1, 2, 3});
    testRotate(new double[] {1, 2, 3}, 1, new double[] {3, 1, 2});
    testRotate(new double[] {1, 2, 3}, 2, new double[] {2, 3, 1});
    testRotate(new double[] {1, 2, 3}, 3, new double[] {1, 2, 3});

    rangeMap.putCoalescing(Range.closedOpen(0, 1), 1);
    rangeMap.putCoalescing(Range.closedOpen(1, 2), 1);
    rangeMap.putCoalescing(Range.closedOpen(2, 3), 2);
    assertEquals(
        ImmutableMap.of(Range.closedOpen(0, 2), 1, Range.closedOpen(2, 3), 2),
        rangeMap.asMapOfRanges());
  }

  public void testPutCoalescingEmpty() {
    RangeMap<Integer, Integer> rangeMap = TreeRangeMap.create();

[versions]
biz-aQute-bnd = "6.4.0"
checkStyle = "10.19.0"
com-squareup-moshi = "1.15.1"
com-squareup-okio = "3.9.1"
de-mannodermaus-junit5 = "1.5.0"
graalvm = "22.3.2"
kotlinx-serialization = "1.6.3"
ksp = "1.9.24-1.0.20"
mockserverClient = "5.15.0"
org-bouncycastle = "1.76"
org-conscrypt = "2.5.2"
org-jetbrains-coroutines = "1.8.1"
org-jetbrains-kotlin = "1.9.25"
org-junit-jupiter = "5.11.0"
retrofit = "2.11.0"

import java.util.Comparator;

/**
 * Static utility methods pertaining to {@code int} primitives that interpret values as
 * <i>unsigned</i> (that is, any negative value {@code x} is treated as the positive value {@code
 * 2^32 + x}). The methods for which signedness is not an issue are in {@link Ints}, as well as
 * signed versions of methods for which signedness is an issue.
 *