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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
// path.h
/**
* 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 <boost/scoped_ptr.hpp>
#include "mongo/base/status.h"
#include "mongo/base/string_data.h"
#include "mongo/bson/bsonobj.h"
#include "mongo/bson/bsonobjiterator.h"
#include "mongo/db/field_ref.h"
namespace mongo {
class ElementPath {
public:
Status init( const StringData& path );
void setTraverseLeafArray( bool b ) { _shouldTraverseLeafArray = b; }
const FieldRef& fieldRef() const { return _fieldRef; }
bool shouldTraverseLeafArray() const { return _shouldTraverseLeafArray; }
private:
FieldRef _fieldRef;
bool _shouldTraverseLeafArray;
};
class ElementIterator {
public:
class Context {
public:
void reset();
void reset( BSONElement element, BSONElement arrayOffset, bool outerArray );
void setArrayOffset( BSONElement e ) { _arrayOffset = e; }
BSONElement element() const { return _element; }
BSONElement arrayOffset() const { return _arrayOffset; }
bool outerArray() const { return _outerArray; }
private:
BSONElement _element;
BSONElement _arrayOffset;
bool _outerArray;
};
virtual ~ElementIterator();
virtual bool more() = 0;
virtual Context next() = 0;
};
// ---------------------------------------------------------------
class SingleElementElementIterator : public ElementIterator {
public:
explicit SingleElementElementIterator( BSONElement e )
: _seen( false ) {
_element.reset( e, BSONElement(), false );
}
virtual ~SingleElementElementIterator(){}
virtual bool more() { return !_seen; }
virtual Context next() { _seen = true; return _element; }
private:
bool _seen;
ElementIterator::Context _element;
};
class SimpleArrayElementIterator : public ElementIterator {
public:
SimpleArrayElementIterator( const BSONElement& theArray, bool returnArrayLast );
virtual bool more();
virtual Context next();
private:
BSONElement _theArray;
bool _returnArrayLast;
BSONObjIterator _iterator;
};
class BSONElementIterator : public ElementIterator {
public:
BSONElementIterator( const ElementPath& path, const BSONObj& context );
virtual ~BSONElementIterator();
bool more();
Context next();
private:
const ElementPath& _path;
BSONObj _context;
enum State { BEGIN, IN_ARRAY, DONE } _state;
Context _next;
struct ArrayIterationState {
void reset( const FieldRef& ref, int start );
void startIterator( BSONElement theArray );
bool more();
BSONElement next();
bool isArrayOffsetMatch( const StringData& fieldName ) const;
bool nextEntireRest() const { return nextPieceOfPath.size() == restOfPath.size(); }
string restOfPath;
bool hasMore;
StringData nextPieceOfPath;
bool nextPieceOfPathIsNumber;
BSONElement _theArray;
BSONElement _current;
boost::scoped_ptr<BSONObjIterator> _iterator;
};
ArrayIterationState _arrayIterationState;
boost::scoped_ptr<ElementIterator> _subCursor;
boost::scoped_ptr<ElementPath> _subCursorPath;
};
}
|
