0
0
mirror of https://github.com/mongodb/mongo.git synced 2024-11-30 09:06:21 +01:00
mongodb/db/dbhelpers.cpp
2009-03-19 16:23:04 -04:00

144 lines
4.4 KiB
C++

// dbhelpers.cpp
/**
* 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/>.
*/
#include "stdafx.h"
#include "db.h"
#include "dbhelpers.h"
#include "query.h"
#include "json.h"
#include "queryoptimizer.h"
namespace mongo {
void Helpers::ensureIndex(const char *ns, BSONObj keyPattern, const char *name) {
NamespaceDetails *d = nsdetails(ns);
if( d == 0 )
return;
for( int i = 0; i < d->nIndexes; i++ ) {
if( d->indexes[i].keyPattern().woCompare(keyPattern) == 0 )
return;
}
if( d->nIndexes >= MaxIndexes ) {
problem() << "Helper::ensureIndex fails, MaxIndexes exceeded " << ns << '\n';
return;
}
string system_indexes = database->name + ".system.indexes";
BSONObjBuilder b;
b.append("name", name);
b.append("ns", ns);
b.append("key", keyPattern);
BSONObj o = b.done();
theDataFileMgr.insert(system_indexes.c_str(), o.objdata(), o.objsize());
}
class FindOne : public QueryOp {
public:
FindOne( bool requireIndex ) : requireIndex_( requireIndex ) {}
virtual void init() {
massert( "Not an index cursor", !requireIndex_ || strcmp( qp().indexKey().firstElement().fieldName(), "$natural" ) != 0 );
c_ = qp().newCursor();
if ( !c_->ok() )
setComplete();
else
matcher_.reset( new KeyValJSMatcher( qp().query(), qp().indexKey() ) );
}
virtual void next() {
if ( !c_->ok() ) {
setComplete();
return;
}
if ( matcher_->matches( c_->currKey(), c_->currLoc() ) ) {
one_ = c_->current();
setComplete();
} else {
c_->advance();
}
}
virtual bool mayRecordPlan() const { return false; }
virtual QueryOp *clone() const { return new FindOne( requireIndex_ ); }
BSONObj one() const { return one_; }
private:
bool requireIndex_;
auto_ptr< Cursor > c_;
auto_ptr< KeyValJSMatcher > matcher_;
BSONObj one_;
};
/* fetch a single object from collection ns that matches query
set your db context first
*/
bool Helpers::findOne(const char *ns, BSONObj query, BSONObj& result, bool requireIndex) {
QueryPlanSet s( ns, query, BSONObj() );
FindOne original( requireIndex );
shared_ptr< FindOne > res = s.runOp( original );
if ( res->one().isEmpty() )
return false;
result = res->one();
return true;
}
int test2_dbh() {
dblock lk;
DBContext c("dwight.foo");
BSONObj q = fromjson("{\"x\":9}");
BSONObj result;
{
BSONObj kp = fromjson("{\"x\":1}");
Helpers::ensureIndex("dwight.foo", kp, "x_1");
}
cout << Helpers::findOne("dwight.foo", q, result, true) << endl;
cout << result.toString() << endl;
return 0;
}
/* Get the first object from a collection. Generally only useful if the collection
only ever has a single object -- which is a "singleton collection.
Returns: true if object exists.
*/
bool Helpers::getSingleton(const char *ns, BSONObj& result) {
DBContext context(ns);
auto_ptr<Cursor> c = DataFileMgr::findAll(ns);
if ( !c->ok() )
return false;
result = c->current();
return true;
}
void Helpers::putSingleton(const char *ns, BSONObj obj) {
DBContext context(ns);
stringstream ss;
updateObjects(ns, obj, /*pattern=*/BSONObj(), /*upsert=*/true, ss);
}
void Helpers::emptyCollection(const char *ns) {
DBContext context(ns);
deleteObjects(ns, BSONObj(), false);
}
} // namespace mongo