/**
* 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 .
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the GNU Affero General Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#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 sorter;
shared_ptr 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