mirror of https://gitee.com/bigwinds/arangodb
64 lines
2.3 KiB
C++
64 lines
2.3 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
/// DISCLAIMER
|
|
///
|
|
/// Copyright 2014-2016 ArangoDB GmbH, Cologne, Germany
|
|
/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany
|
|
///
|
|
/// Licensed under the Apache License, Version 2.0 (the "License");
|
|
/// you may not use this file except in compliance with the License.
|
|
/// You may obtain a copy of the License at
|
|
///
|
|
/// http://www.apache.org/licenses/LICENSE-2.0
|
|
///
|
|
/// Unless required by applicable law or agreed to in writing, software
|
|
/// distributed under the License is distributed on an "AS IS" BASIS,
|
|
/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
/// See the License for the specific language governing permissions and
|
|
/// limitations under the License.
|
|
///
|
|
/// Copyright holder is ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// @author Michael Hackstein
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "ClusterEdgeCursor.h"
|
|
|
|
#include "Cluster/ClusterMethods.h"
|
|
#include "Cluster/ClusterTraverser.h"
|
|
|
|
#include <velocypack/Slice.h>
|
|
#include <velocypack/velocypack-aliases.h>
|
|
|
|
using ClusterEdgeCursor = arangodb::traverser::ClusterEdgeCursor;
|
|
|
|
ClusterEdgeCursor::ClusterEdgeCursor(VPackSlice v, size_t depth,
|
|
ClusterTraverser* traverser)
|
|
: _position(0) {
|
|
TransactionBuilderLeaser leased(traverser->_trx);
|
|
fetchEdgesFromEngines(traverser->_dbname, traverser->_engines, v, depth,
|
|
traverser->_edges, _edgeList, traverser->_datalake,
|
|
*(leased.get()), traverser->_filteredPaths,
|
|
traverser->_readDocuments);
|
|
}
|
|
|
|
|
|
bool ClusterEdgeCursor::next(std::vector<VPackSlice>& result, size_t& cursorId) {
|
|
if (_position < _edgeList.size()) {
|
|
result.emplace_back(_edgeList[_position]);
|
|
++_position;
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool ClusterEdgeCursor::readAll(std::unordered_set<VPackSlice>& result, size_t& cursorId) {
|
|
if (_position == 0) {
|
|
// We have not yet returned anything. So we simply return everything at once.
|
|
std::copy(_edgeList.begin(), _edgeList.end(), std::inserter(result, result.end()));
|
|
_position++;
|
|
return true;
|
|
}
|
|
// We have already returned everything last time.
|
|
return false;
|
|
}
|