accord-core/src/main/java/accord/utils/BTreeReducingIntervalMap.java [287:297]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        WithBoundsIterator<K, V> left = historyLeft.withBoundsIterator();
        WithBoundsIterator<K, V> right = historyRight.withBoundsIterator();

        left.advance();
        right.advance();

        K start;
        {
            // first loop over any range only covered by one of the two
            WithBoundsIterator<K, V> first = left.start().compareTo(right.start()) <= 0 ? left : right;
            WithBoundsIterator<K, V> second = first == left ? right : left;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



accord-core/src/main/java/accord/utils/BTreeReducingIntervalMap.java [365:375]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        WithBoundsIterator<K, V> left = historyLeft.withBoundsIterator();
        WithBoundsIterator<K, V> right = historyRight.withBoundsIterator();

        left.advance();
        right.advance();

        K start;
        {
            // first loop over any range only covered by one of the two
            WithBoundsIterator<K, V> first = left.start().compareTo(right.start()) <= 0 ? left : right;
            WithBoundsIterator<K, V> second = first == left ? right : left;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



