tursom/memgraph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Implement edge iteration with known destination

Browse Source 
Reviewers: teon.banek

Reviewed By: teon.banek

Subscribers: pullbot

Differential Revision: https://phabricator.memgraph.io/D2553
This commit is contained in:
Matej Ferencevic 2019-11-18 17:30:11 +01:00
parent 019b6cddaa
commit 29590f1112
1 changed files with 20 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
src/query/db_accessor.hpp
View File

@ -137,7 +137,16 @@ class VertexAccessor final {
const VertexAccessor &dest) const
-> storage::Result<decltype(
iter::imap(MakeEdgeAccessor, *impl_.InEdges(edge_types, view)))> {
throw utils::NotYetImplemented("InEdges with set destination");
auto maybe_edges = impl_.InEdges(edge_types, view);
if (maybe_edges.HasError()) return maybe_edges.GetError();
std::vector<storage::EdgeAccessor> reduced_edges;
reduced_edges.reserve(maybe_edges->size());
for (auto &edge : *maybe_edges) {
if (edge.FromVertex() == dest.impl_) {
reduced_edges.push_back(edge);
}
}
return iter::imap(MakeEdgeAccessor, std::move(reduced_edges));
}
auto OutEdges(storage::View view,
@ -156,7 +165,16 @@ class VertexAccessor final {
const VertexAccessor &dest) const
-> storage::Result<decltype(
iter::imap(MakeEdgeAccessor, *impl_.OutEdges(edge_types, view)))> {
throw utils::NotYetImplemented("OutEdges with set destination");
auto maybe_edges = impl_.OutEdges(edge_types, view);
if (maybe_edges.HasError()) return maybe_edges.GetError();
std::vector<storage::EdgeAccessor> reduced_edges;
reduced_edges.reserve(maybe_edges->size());
for (auto &edge : *maybe_edges) {
if (edge.ToVertex() == dest.impl_) {
reduced_edges.push_back(edge);
}
}
return iter::imap(MakeEdgeAccessor, std::move(reduced_edges));
}
storage::Result<size_t> InDegree(storage::View view) const {