accord-core/src/main/java/accord/primitives/AbstractRanges.java [377:398]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        ObjectBuffers<Range> cachedRanges = cachedRanges();

        Range[] buffer = cachedRanges.get(covering.ranges.length + input.ranges.length);
        int bufferCount = 0;
        try
        {
            int li = 0, ri = 0;
            while (true)
            {
                long lri = covering.findNextIntersection(li, input, ri);
                if (lri < 0)
                    break;

                if (bufferCount == buffer.length)
                    buffer = cachedRanges.resize(buffer, bufferCount, bufferCount + 1 + (bufferCount/2));

                li = (int) (lri);
                ri = (int) (lri >>> 32);

                Range l = covering.ranges[li], r = input.ranges[ri];
                RoutingKey ls = l.start(), rs = r.start(), le = l.end(), re = r.end();
                int cs = rs.compareTo(ls), ce = re.compareTo(le);
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



accord-core/src/main/java/accord/primitives/AbstractRanges.java [424:445]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        ObjectBuffers<Range> cachedRanges = cachedRanges();

        Range[] buffer = cachedRanges.get(covering.ranges.length + input.ranges.length);
        int bufferCount = 0;
        try
        {
            int li = 0, ri = 0;
            while (true)
            {
                long lri = covering.findNextIntersection(li, input, ri);
                if (lri < 0)
                    break;

                if (bufferCount == buffer.length)
                    buffer = cachedRanges.resize(buffer, bufferCount, bufferCount + 1 + (bufferCount/2));

                li = (int) (lri);
                ri = (int) (lri >>> 32);

                Range l = covering.ranges[li], r = input.ranges[ri]; // l(eft), r(right)
                RoutingKey ls = l.start(), rs = r.start(), le = l.end(), re = r.end(); // l(eft),r(ight) s(tart),e(nd)
                int cs = rs.compareTo(ls), ce = re.compareTo(le); // c(ompare) s(tart),e(nd)
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -