right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));
right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));
right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));
right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));
right = requested.rightBoundary(); right = minRight(right, sstable.last, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); left = requested.leftBoundary(); left = maxLeft(left, sstable.first, true); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right)); if (!isEmpty(left, right)) boundsList.add(AbstractBounds.bounds(left, right));