blob: 8916ea8c353d94ca7bc955f974869828238e228a (
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/**
* Copyright (C) 2012 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/btree.h"
namespace mongo {
/**
* build btree from the bottom up
*/
template< class V >
class BtreeBuilder {
typedef typename V::KeyOwned KeyOwned;
typedef typename V::Key Key;
bool dupsAllowed;
IndexDetails& idx;
/** Number of keys added to btree. */
unsigned long long n;
/** Last key passed to addKey(). */
auto_ptr< typename V::KeyOwned > keyLast;
BSONObj order;
Ordering ordering;
/** true iff commit() completed successfully. */
bool committed;
DiskLoc cur, first;
BtreeBucket<V> *b;
void newBucket();
void buildNextLevel(DiskLoc loc, bool mayInterrupt);
void mayCommitProgressDurably();
public:
BtreeBuilder(bool _dupsAllowed, IndexDetails& _idx);
/**
* Preconditions: 'key' is > or >= last key passed to this function (depends on _dupsAllowed)
* Postconditions: 'key' is added to intermediate storage.
*/
void addKey(BSONObj& key, DiskLoc loc);
/**
* commit work. if not called, destructor will clean up partially completed work
* (in case exception has happened).
*/
void commit(bool mayInterrupt);
unsigned long long getn() { return n; }
};
}
|
