mirror of https://gitee.com/bigwinds/arangodb
253 lines
9.2 KiB
C++
253 lines
9.2 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
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#ifndef ARANGOD_SINGLE_SERVER_TRAVERSER_H
|
|
#define ARANGOD_SINGLE_SERVER_TRAVERSER_H 1
|
|
|
|
#include "VocBase/Traverser.h"
|
|
|
|
namespace arangodb {
|
|
|
|
class EdgeIndex;
|
|
|
|
namespace traverser {
|
|
|
|
class SingleServerTraverser : public Traverser {
|
|
|
|
friend class SingleServerTraversalPath;
|
|
|
|
private:
|
|
|
|
class VertexGetter : public arangodb::basics::VertexGetter<std::string, std::string> {
|
|
public:
|
|
explicit VertexGetter(SingleServerTraverser* traverser)
|
|
: _traverser(traverser) {}
|
|
|
|
virtual ~VertexGetter() = default;
|
|
|
|
virtual bool getVertex(std::string const&, std::string const&, size_t,
|
|
std::string&) override;
|
|
virtual void reset(std::string const&);
|
|
|
|
protected:
|
|
SingleServerTraverser* _traverser;
|
|
};
|
|
|
|
class UniqueVertexGetter : public VertexGetter {
|
|
public:
|
|
explicit UniqueVertexGetter(SingleServerTraverser* traverser)
|
|
: VertexGetter(traverser) {}
|
|
|
|
~UniqueVertexGetter() = default;
|
|
|
|
bool getVertex(std::string const&, std::string const&, size_t,
|
|
std::string&) override;
|
|
|
|
void reset(std::string const&) override;
|
|
|
|
private:
|
|
std::unordered_set<std::string> _returnedVertices;
|
|
};
|
|
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief callable class to load edges based on opts.
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
class EdgeGetter
|
|
: public arangodb::basics::EdgeGetter<std::string, std::string,
|
|
arangodb::velocypack::ValueLength> {
|
|
public:
|
|
EdgeGetter(SingleServerTraverser* traverser,
|
|
TraverserOptions const& opts,
|
|
Transaction* trx)
|
|
: _traverser(traverser), _opts(opts), _trx(trx) {}
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Function to fill the list of edges properly.
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
void getEdge(std::string const&, std::vector<std::string>&,
|
|
arangodb::velocypack::ValueLength*&, size_t&) override;
|
|
|
|
void getAllEdges(std::string const&, std::vector<std::string>&, size_t) override;
|
|
|
|
|
|
private:
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Get the next valid cursor
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
bool nextCursor(std::string const&, size_t&,
|
|
arangodb::velocypack::ValueLength*&);
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Get the next edge
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
void nextEdge(std::string const&, size_t&,
|
|
arangodb::velocypack::ValueLength*&,
|
|
std::vector<std::string>&);
|
|
|
|
SingleServerTraverser* _traverser;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Cache for indexes. Maps collectionName to Index
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::unordered_map<std::string, std::pair<TRI_voc_cid_t, EdgeIndex*>>
|
|
_indexCache;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Traverser options
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
TraverserOptions _opts;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Pointer to active transaction
|
|
/// All Edge Collections have to be properly locked before traversing!
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
Transaction* _trx;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Stack of all active cursors
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::stack<std::shared_ptr<OperationCursor>> _cursors;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Stack of all active cursor batches
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::stack<std::shared_ptr<OperationResult>> _results;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Stack of positions in the cursors
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::stack<arangodb::velocypack::ValueLength> _posInCursor;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief velocyPack builder to create temporary search values
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
arangodb::velocypack::Builder _builder;
|
|
|
|
};
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief internal cursor to enumerate the paths of a graph
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::unique_ptr<arangodb::basics::PathEnumerator<
|
|
std::string, std::string, arangodb::velocypack::ValueLength>> _enumerator;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief internal getter to extract an edge
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::unique_ptr<EdgeGetter> _edgeGetter;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief internal getter to extract an edge
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::unique_ptr<VertexGetter> _vertexGetter;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief a vector containing all required edge collection structures
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
public:
|
|
SingleServerTraverser(
|
|
TraverserOptions&, Transaction*,
|
|
std::unordered_map<size_t, std::vector<TraverserExpression*>> const*);
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Reset the traverser to use another start vertex
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
void setStartVertex(std::string const& v) override;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Get the next possible path in the graph.
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
TraversalPath* next() override;
|
|
|
|
private:
|
|
bool edgeMatchesConditions(arangodb::velocypack::Slice, size_t);
|
|
|
|
bool vertexMatchesConditions(std::string const&, size_t);
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Fetch the vertex data from the transaction
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::shared_ptr<arangodb::velocypack::Buffer<uint8_t>> fetchVertexData(
|
|
std::string const&);
|
|
|
|
|
|
std::vector<TRI_document_collection_t*> _edgeCols;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Outer top level transaction
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
Transaction* _trx;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Cache for vertex documents
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::unordered_map<std::string,
|
|
std::shared_ptr<arangodb::velocypack::Buffer<uint8_t>>>
|
|
_vertices;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Cache for edge documents
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
std::unordered_map<std::string,
|
|
std::shared_ptr<arangodb::velocypack::Buffer<uint8_t>>>
|
|
_edges;
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
/// @brief Shared builder to create temporary objects like search values
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
arangodb::velocypack::Builder _builder;
|
|
|
|
|
|
|
|
};
|
|
} // namespace traverser
|
|
} // namespace arangodb
|
|
|
|
|
|
#endif
|