for (int i = 0; i < node->ranges.size(); ++i) {
const QPair<int, int> &range = node->ranges.at(i);
- int rangeLength = range.second - range.first + 1;
+ int rangeLength = range.second - range.first;
if (previousNode != 0) {
for (int j = 0; j < previousNode->ranges.size(); ++j) {
const QPair<int, int> &otherRange = previousNode->ranges.at(j);
- if (range.first <= otherRange.second && range.second >= otherRange.first) {
+ if (range.first < otherRange.second && range.second > otherRange.first) {
int start = qMax(range.first, otherRange.first);
int end = qMin(range.second, otherRange.second);
- rangeLength -= end - start + 1;
+ rangeLength -= end - start;
if (rangeLength == 0)
break;
}
for (int j = 0; j < nextNode->ranges.size(); ++j) {
const QPair<int, int> &otherRange = nextNode->ranges.at(j);
- if (range.first <= otherRange.second && range.second >= otherRange.first) {
+ if (range.first < otherRange.second && range.second > otherRange.first) {
int start = qMax(range.first, otherRange.first);
int end = qMin(range.second, otherRange.second);
- rangeLength -= end - start + 1;
+ rangeLength -= end - start;
if (rangeLength == 0)
break;
}