blob: 19b60694db7ab7d366ee660b39a2f04cdb66b7e9 (
plain)
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
|
/**
* Copyright (C) 2008 10gen 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/>.
*/
#pragma once
#include "mongo/db/extsort.h"
namespace mongo {
/** for bottom up fastbuildindex (where we presort keys) */
struct SortPhaseOne {
SortPhaseOne() {
n = 0;
nkeys = 0;
multi = false;
}
shared_ptr<BSONObjExternalSorter> sorter;
shared_ptr<ExternalSortComparison> sortCmp;
unsigned long long n; // # of records
unsigned long long nkeys;
bool multi; // multikey index
void addKeys(const BSONObjSet& keys, const DiskLoc& loc, bool mayInterrupt) {
multi = multi || (keys.size() > 1);
for (BSONObjSet::iterator it = keys.begin(); it != keys.end(); ++it) {
sorter->add(*it, loc, mayInterrupt);
++nkeys;
}
++n;
}
};
} // namespace mongo
|
