1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/platform/basic.h"
#include "mongo/db/range_arithmetic.h"
namespace mongo {
namespace {
// Represents the start and end of an overlap of a tested range
typedef std::pair<RangeMap::const_iterator, RangeMap::const_iterator> OverlapBounds;
// Internal-only, shared functionality
OverlapBounds rangeMapOverlapBounds(const RangeMap& ranges,
const BSONObj& inclusiveLower,
const BSONObj& exclusiveUpper) {
// Returns the first chunk with a min key that is >= lower bound - the previous chunk
// might overlap.
RangeMap::const_iterator low = ranges.lower_bound(inclusiveLower);
// See if the previous chunk overlaps our range, not clear from just min key
if (low != ranges.begin()) {
RangeMap::const_iterator next = low;
--low;
// If the previous range's max value is lte our min value
if (low->second.woCompare(inclusiveLower) < 1) {
low = next;
}
}
// Returns the first chunk with a max key that is >= upper bound - implies the
// chunk does not overlap upper bound
RangeMap::const_iterator high = ranges.lower_bound(exclusiveUpper);
return OverlapBounds(low, high);
}
} // namespace
bool rangeContains(const BSONObj& inclusiveLower,
const BSONObj& exclusiveUpper,
const BSONObj& point) {
return point.woCompare(inclusiveLower) >= 0 && point.woCompare(exclusiveUpper) < 0;
}
bool rangeOverlaps(const BSONObj& inclusiveLower1,
const BSONObj& exclusiveUpper1,
const BSONObj& inclusiveLower2,
const BSONObj& exclusiveUpper2) {
return (exclusiveUpper1.woCompare(inclusiveLower2) > 0) &&
(exclusiveUpper2.woCompare(inclusiveLower1) > 0);
}
bool rangeMapOverlaps(const RangeMap& ranges,
const BSONObj& inclusiveLower,
const BSONObj& exclusiveUpper) {
OverlapBounds bounds = rangeMapOverlapBounds(ranges, inclusiveLower, exclusiveUpper);
return bounds.first != bounds.second;
}
} // namespace mongo
|
