docs: public boolean intersects(long minimum, long supremum) {
      rangeSanityCheck(minimum, supremum);
      short minKey = Util.highbits(minimum);
      short supKey = Util.highbits(supremum);
      int len = highLowContainer.size;
      short[] keys = highLowContainer.keys;
      // seek to start
      int index = Util.unsignedBinarySearch(keys, 0, len, minKey);
      int pos = index >= 0 ? index : -index - 1;
      short offset = Util.lowbits(minimum);
      while (pos < len && Util.compareUnsigned(supKey, keys[pos]) > 0) {
        Container container = highLowContainer.getContainerAtIndex(pos);
        if (container.intersects(offset, 1 << 16)) {
          return true;
        }
        offset = 0;
        ++pos;
      }
      return pos < len
              && supKey == keys[pos]
              && highLowContainer.getContainerAtIndex(pos)
                                 .intersects(0, (int)((supremum - 1) & 0xFFFF) + 1);
    }