//////////////////////////////////////////////////////////////////////////////// /// @brief Cluster Traverser /// /// @file /// /// DISCLAIMER /// /// Copyright 2014-2015 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 /// @author Copyright 2014-2015, ArangoDB GmbH, Cologne, Germany /// @author Copyright 2012-2013, triAGENS GmbH, Cologne, Germany //////////////////////////////////////////////////////////////////////////////// #include "Cluster/ClusterTraverser.h" #include "Cluster/ClusterMethods.h" using ClusterTraversalPath = triagens::arango::traverser::ClusterTraversalPath; using ClusterTraverser = triagens::arango::traverser::ClusterTraverser; // ----------------------------------------------------------------------------- // --SECTION-- class ClusterTraversalPath // ----------------------------------------------------------------------------- triagens::basics::Json* ClusterTraversalPath::pathToJson (Transaction*, CollectionNameResolver*) const { std::unique_ptr result(new triagens::basics::Json(triagens::basics::Json::Object)); size_t vCount = _path.vertices.size(); triagens::basics::Json vertices(triagens::basics::Json::Array, vCount); for (auto& it : _path.vertices) { vertices.add(*_traverser->vertexToJson(it)); } triagens::basics::Json edges(triagens::basics::Json::Array, _path.edges.size()); for (auto& it : _path.edges) { edges.add(*_traverser->edgeToJson(it)); } result->set("edges", edges); result->set("vertices", vertices); return result.release(); } triagens::basics::Json* ClusterTraversalPath::lastEdgeToJson (Transaction*, CollectionNameResolver*) const { return _traverser->edgeToJson(_path.edges.back()); } triagens::basics::Json* ClusterTraversalPath::lastVertexToJson (Transaction*, CollectionNameResolver*) const { return _traverser->vertexToJson(_path.vertices.back()); } // ----------------------------------------------------------------------------- // --SECTION-- class ClusterTraverser // ----------------------------------------------------------------------------- std::string ClusterTraverser::VertexGetter::operator() (std::string const& edgeId, std::string const& vertexId) { auto it = _edges->find(edgeId); std::string def = ""; if (it != _edges->end()) { std::string from = triagens::basics::JsonHelper::getStringValue(it->second, "_from", def); if (from != vertexId) { return from; } std::string to = triagens::basics::JsonHelper::getStringValue(it->second, "_to", def); return to; } return def; } void ClusterTraverser::EdgeGetter::operator() (std::string const& startVertex, std::vector& result, size_t*& last, size_t& eColIdx, bool& unused) { if (eColIdx >= _traverser->_edgeCols.size()) { // Nothing to do, caller has set a defined state already. return; } if (last == nullptr) { TRI_ASSERT(_traverser->_iteratorCache.size() == result.size()); // We have to request the next level triagens::basics::Json resultEdges(triagens::basics::Json::Object); triagens::rest::HttpResponse::HttpResponseCode responseCode; std::string contentType; std::string collName = _traverser->_edgeCols[eColIdx]; int res = getAllEdgesOnCoordinator(_traverser->_dbname, collName, startVertex, _traverser->_opts.direction, responseCode, contentType, resultEdges); if (res != TRI_ERROR_NO_ERROR) { THROW_ARANGO_EXCEPTION(res); } triagens::basics::Json edgesJson = resultEdges.get("edges"); size_t count = edgesJson.size(); if (count == 0) { _traverser->_iteratorCache.pop(); last = nullptr; eColIdx++; operator()(startVertex, result, last, eColIdx, unused); return; } std::stack stack; std::unordered_set verticesToFetch; for (size_t i = 0; i < edgesJson.size(); ++i) { triagens::basics::Json edge = edgesJson.at(i); std::string edgeId = triagens::basics::JsonHelper::getStringValue(edge.json(), "_id", ""); stack.push(edgeId); std::string fromId = triagens::basics::JsonHelper::getStringValue(edge.json(), "_from", ""); if (_traverser->_vertices.find(fromId) == _traverser->_vertices.end()) { verticesToFetch.emplace(fromId); } std::string toId = triagens::basics::JsonHelper::getStringValue(edge.json(), "_to", ""); if (_traverser->_vertices.find(toId) == _traverser->_vertices.end()) { verticesToFetch.emplace(toId); } _traverser->_edges.emplace(edgeId, edge.copy().steal()); } std::map headers; std::map resultHeaders; for (auto it : verticesToFetch) { std::vector splitId = triagens::basics::StringUtils::split(it, '/'); TRI_ASSERT(splitId.size() == 2); std::string vertexResult; int res = getDocumentOnCoordinator(_traverser->_dbname, splitId[0], splitId[1], 0, headers, true, responseCode, resultHeaders, vertexResult); if (res != TRI_ERROR_NO_ERROR) { THROW_ARANGO_EXCEPTION(res); } _traverser->_vertices.emplace(it, triagens::basics::JsonHelper::fromString(vertexResult)); } std::string next = stack.top(); stack.pop(); last = &_continueConst; result.push_back(next); _traverser->_iteratorCache.emplace(stack); } else { if (_traverser->_iteratorCache.empty()) { last = nullptr; return; } std::stack& tmp = _traverser->_iteratorCache.top(); if (tmp.empty()) { _traverser->_iteratorCache.pop(); last = nullptr; eColIdx++; operator()(startVertex, result, last, eColIdx, unused); return; } else { std::string next = tmp.top(); tmp.pop(); result.push_back(next); } } } void ClusterTraverser::setStartVertex (VertexId& v) { std::string id = v.toString(_resolver); _enumerator.reset(new triagens::basics::PathEnumerator (_edgeGetter, _vertexGetter, id)); _done = false; } const triagens::arango::traverser::TraversalPath* ClusterTraverser::next () { TRI_ASSERT(!_done); if (_pruneNext) { _pruneNext = false; _enumerator->prune(); } TRI_ASSERT(!_pruneNext); const triagens::basics::EnumeratedPath& path = _enumerator->next(); size_t countEdges = path.edges.size(); if (countEdges == 0) { _done = true; // Done traversing return nullptr; } std::unique_ptr p(new ClusterTraversalPath(this, path)); if (_opts.shouldPrunePath(p.get())) { _enumerator->prune(); return next(); } if (countEdges >= _opts.maxDepth) { _pruneNext = true; } if (countEdges < _opts.minDepth) { return next(); } return p.release(); } triagens::basics::Json* ClusterTraverser::edgeToJson (std::string id) const { auto it = _edges.find(id); TRI_ASSERT(it != _edges.end()); return new triagens::basics::Json(TRI_UNKNOWN_MEM_ZONE, TRI_CopyJson(TRI_UNKNOWN_MEM_ZONE, it->second)); } triagens::basics::Json* ClusterTraverser::vertexToJson (std::string id) const { auto it = _vertices.find(id); TRI_ASSERT(it != _vertices.end()); return new triagens::basics::Json(TRI_UNKNOWN_MEM_ZONE, TRI_CopyJson(TRI_UNKNOWN_MEM_ZONE, it->second)); }