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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
/**
* Copyright (C) 2016 MongoDB Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* 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 GNU Affero General 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/pipeline/aggregation_context_fixture.h"
#include "mongo/db/pipeline/document.h"
#include "mongo/db/pipeline/document_source_mock.h"
#include "mongo/db/pipeline/document_source_skip.h"
#include "mongo/db/pipeline/document_value_test_util.h"
#include "mongo/unittest/unittest.h"
namespace mongo {
namespace {
// This provides access to getExpCtx(), but we'll use a different name for this test suite.
using DocumentSourceSkipTest = AggregationContextFixture;
TEST_F(DocumentSourceSkipTest, ShouldPropagatePauses) {
auto skip = DocumentSourceSkip::create(getExpCtx(), 2);
auto mock = DocumentSourceMock::create({Document(),
DocumentSource::GetNextResult::makePauseExecution(),
Document(),
Document(),
DocumentSource::GetNextResult::makePauseExecution(),
DocumentSource::GetNextResult::makePauseExecution()});
skip->setSource(mock.get());
// Skip the first document.
ASSERT_TRUE(skip->getNext().isPaused());
// Skip one more, then advance.
ASSERT_TRUE(skip->getNext().isAdvanced());
ASSERT_TRUE(skip->getNext().isPaused());
ASSERT_TRUE(skip->getNext().isPaused());
ASSERT_TRUE(skip->getNext().isEOF());
ASSERT_TRUE(skip->getNext().isEOF());
ASSERT_TRUE(skip->getNext().isEOF());
}
TEST_F(DocumentSourceSkipTest, SkipsChainedTogetherShouldNotOverFlowWhenOptimizing) {
// $skip should not optimize if combining the two values of skips would overflow a long long.
auto skipShort = DocumentSourceSkip::create(getExpCtx(), 1);
auto skipLong = DocumentSourceSkip::create(getExpCtx(), std::numeric_limits<long long>::max());
Pipeline::SourceContainer overflowContainer;
overflowContainer.push_back(skipShort);
overflowContainer.push_back(skipLong);
skipShort->doOptimizeAt(overflowContainer.begin(), &overflowContainer);
ASSERT_EQUALS(overflowContainer.size(), 2U);
ASSERT_EQUALS(skipShort->getSkip(), 1U);
ASSERT_EQUALS(skipLong->getSkip(), std::numeric_limits<long long>::max());
// $skip should not optimize if both skips are max values for long long.
auto firstMaxSkip =
DocumentSourceSkip::create(getExpCtx(), std::numeric_limits<long long>::max());
auto secondMaxSkip =
DocumentSourceSkip::create(getExpCtx(), std::numeric_limits<long long>::max());
Pipeline::SourceContainer doubleMaxContainer;
doubleMaxContainer.push_back(firstMaxSkip);
doubleMaxContainer.push_back(secondMaxSkip);
firstMaxSkip->doOptimizeAt(doubleMaxContainer.begin(), &doubleMaxContainer);
ASSERT_EQUALS(doubleMaxContainer.size(), 2U);
ASSERT_EQUALS(firstMaxSkip->getSkip(), std::numeric_limits<long long>::max());
ASSERT_EQUALS(secondMaxSkip->getSkip(), std::numeric_limits<long long>::max());
// $skip should optimize if the two skips will not overflow a long long when combined.
auto skipFirst = DocumentSourceSkip::create(getExpCtx(), 1);
auto skipSecond = DocumentSourceSkip::create(getExpCtx(), 1);
Pipeline::SourceContainer containerOptimized;
containerOptimized.push_back(skipFirst);
containerOptimized.push_back(skipSecond);
skipFirst->doOptimizeAt(containerOptimized.begin(), &containerOptimized);
ASSERT_EQUALS(containerOptimized.size(), 1U);
ASSERT_EQUALS(skipFirst->getSkip(), 2);
}
} // namespace
} // namespace mongo
|
