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
|
/**
* Copyright (C) 2013 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 <vector>
#include "mongo/db/diskloc.h"
#include "mongo/db/jsobj.h"
#include "mongo/db/index/btree_interface.h"
#include "mongo/db/index/index_access_method.h"
#include "mongo/db/index/index_cursor.h"
#include "mongo/db/index/index_descriptor.h"
namespace mongo {
/**
* Any access method that is Btree based subclasses from this.
*
* Subclassers must:
* 1. Call the constructor for this class from their constructors,
* 2. override newCursor, and
* 3. override getKeys.
*/
class BtreeBasedAccessMethod : public IndexAccessMethod {
public:
BtreeBasedAccessMethod(IndexDescriptor *descriptor);
virtual ~BtreeBasedAccessMethod() { }
virtual Status insert(const BSONObj& obj,
const DiskLoc& loc,
const InsertDeleteOptions& options,
int64_t* numInserted);
virtual Status remove(const BSONObj& obj,
const DiskLoc& loc,
const InsertDeleteOptions& options,
int64_t* numDeleted);
virtual Status validateUpdate(const BSONObj& from,
const BSONObj& to,
const DiskLoc& loc,
const InsertDeleteOptions& options,
UpdateTicket* ticket);
virtual Status update(const UpdateTicket& ticket, int64_t* numUpdated);
virtual Status newCursor(IndexCursor **out) = 0;
virtual Status touch(const BSONObj& obj);
virtual Status validate(int64_t* numKeys);
protected:
// Friends who need getKeys.
friend class BtreeBasedBuilder;
// See below for body.
class BtreeBasedPrivateUpdateData;
virtual void getKeys(const BSONObj &obj, BSONObjSet *keys) = 0;
IndexDescriptor* _descriptor;
Ordering _ordering;
// There are 2 types of Btree disk formats. We put them both behind one interface.
BtreeInterface* _interface;
private:
bool removeOneKey(const BSONObj& key, const DiskLoc& loc);
};
/**
* What data do we need to perform an update?
*/
class BtreeBasedAccessMethod::BtreeBasedPrivateUpdateData
: public UpdateTicket::PrivateUpdateData {
public:
virtual ~BtreeBasedPrivateUpdateData() { }
BSONObjSet oldKeys, newKeys;
// These point into the sets oldKeys and newKeys.
vector<BSONObj*> removed, added;
DiskLoc loc;
bool dupsAllowed;
};
} // namespace mongo
|
