accord-core/src/main/java/accord/utils/SortedArrays.java [605:621]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
                    System.arraycopy(left, 0, result, 0, resultSize);
                    break;
                }
            }

            if (result == null)
                return hasMatch ? leftBuffers.completeWithExisting(left, leftIdx) : leftBuffers.complete(leftBuffers.get(0), 0);
        }
        else
        {
            Invariants.requireArgument(rightBuffers != null);
            boolean hasMatch = false;
            while (leftIdx < leftLength && rightIdx < rightLength)
            {
                T1 leftKey = left[leftIdx];
                T2 rightKey = right[rightIdx];
                int cmp = leftKey == rightKey ? 0 : comparator.compare(leftKey, rightKey);
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



accord-core/src/main/java/accord/utils/SortedArrays.java [710:726]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
                    System.arraycopy(left, 0, result, 0, resultSize);
                    break;
                }
            }

            if (result == null)
                return hasMatch ? leftBuffers.completeWithExisting(left, leftIdx) : leftBuffers.complete(leftBuffers.get(0), 0);
        }
        else
        {
            Invariants.requireArgument(rightBuffers != null);
            boolean hasMatch = false;
            while (leftIdx < leftLength && rightIdx < rightLength)
            {
                T1 leftKey = left[leftIdx];
                T2 rightKey = right[rightIdx];
                int cmp = leftKey == rightKey ? 0 : comparator.compare(leftKey, rightKey);
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -