From 7042542548aadd538436c40d8203dac38ed40643 Mon Sep 17 00:00:00 2001 From: Michael Hackstein Date: Wed, 9 Dec 2015 09:52:01 +0100 Subject: [PATCH 1/2] Fixed memleak for cluster Traverser edge data --- arangod/Cluster/ClusterTraverser.h | 3 +++ 1 file changed, 3 insertions(+) diff --git a/arangod/Cluster/ClusterTraverser.h b/arangod/Cluster/ClusterTraverser.h index 2d394bf32b..f59a318634 100644 --- a/arangod/Cluster/ClusterTraverser.h +++ b/arangod/Cluster/ClusterTraverser.h @@ -66,6 +66,9 @@ namespace triagens { for (auto& it : _vertices) { TRI_FreeJson(TRI_UNKNOWN_MEM_ZONE, it.second); } + for (auto& it : _edges) { + TRI_FreeJson(TRI_UNKNOWN_MEM_ZONE, it.second); + } } void setStartVertex (VertexId const& v) override; From aca6c2421b5e58a3e5e98ec765656c4cbb40df81 Mon Sep 17 00:00:00 2001 From: Wilfried Goesgens Date: Wed, 9 Dec 2015 10:17:08 +0100 Subject: [PATCH 2/2] Add crosslink to CombiningGraphTraversals.mdpp --- Documentation/Books/Users/Aql/GraphTraversals.mdpp | 2 ++ 1 file changed, 2 insertions(+) diff --git a/Documentation/Books/Users/Aql/GraphTraversals.mdpp b/Documentation/Books/Users/Aql/GraphTraversals.mdpp index 27409866fe..7916bbf880 100644 --- a/Documentation/Books/Users/Aql/GraphTraversals.mdpp +++ b/Documentation/Books/Users/Aql/GraphTraversals.mdpp @@ -273,3 +273,5 @@ And finally clean it up again: If this traversal is not powerful enough for your needs, so you cannot describe your conditions as AQL filter statements you might want to look at [manually crafted traverser](../Traversals/README.md). + +[See here for more traversal examples](../AqlExamples/CombiningGraphTraversals.md).