clang format

arangodb · hkernbach · Jan 23, 2025 · Apr 28, 2025 · May 6, 2025 · May 6, 2025
commit 6f21c2fdfa06ed01a503d7e4b9c86db74af205c7
diff --git a/arangod/Aql/ExecutionNode/EnumeratePathsNode.cpp b/arangod/Aql/ExecutionNode/EnumeratePathsNode.cpp
@@ -483,8 +483,7 @@ std::unique_ptr<ExecutionBlock> EnumeratePathsNode::createBlock(
         opts->tmpVar(), std::move(reversedUsedIndexes),
         opts->getExpressionCtx(), {}, opts->collectionToShard(),
         opts->getVertexProjections(), opts->getEdgeProjections(),
-        opts->produceVertices(), opts->useCache(),
-        opts->query());
+        opts->produceVertices(), opts->useCache(), opts->query());
 
     using Provider = SingleServerProvider<SingleServerProviderStep>;
     if (opts->query().queryOptions().getTraversalProfileLevel() ==
@@ -680,13 +679,11 @@ std::unique_ptr<ExecutionBlock> EnumeratePathsNode::createBlock(
   } else {  // Cluster case (on coordinator)
     auto cache = std::make_shared<RefactoredClusterTraverserCache>(
         opts->query().resourceMonitor());
-    ClusterBaseProviderOptions forwardProviderOptions(cache, engines(), false,
-                                                      opts->produceVertices(),
-                                                      opts->query());
+    ClusterBaseProviderOptions forwardProviderOptions(
+        cache, engines(), false, opts->produceVertices(), opts->query());
     forwardProviderOptions.setClearEdgeCacheOnClear(false);
-    ClusterBaseProviderOptions backwardProviderOptions(cache, engines(), true,
-                                                       opts->produceVertices(),
-                                                       opts->query());
+    ClusterBaseProviderOptions backwardProviderOptions(
+        cache, engines(), true, opts->produceVertices(), opts->query());
     backwardProviderOptions.setClearEdgeCacheOnClear(false);
     // A comment is in order here: For all cases covered here
     // (k-shortest-paths, all shortest paths, k-paths) we do not need to

diff --git a/arangod/Aql/ExecutionNode/ShortestPathNode.cpp b/arangod/Aql/ExecutionNode/ShortestPathNode.cpp
@@ -511,12 +511,10 @@ std::unique_ptr<ExecutionBlock> ShortestPathNode::createBlock(
     using ClusterProvider = ClusterProvider<ClusterProviderStep>;
     auto cache = std::make_shared<RefactoredClusterTraverserCache>(
         opts->query().resourceMonitor());
-    ClusterBaseProviderOptions forwardProviderOptions(cache, engines(), false,
-                                                      opts->produceVertices(),
-                                                      opts->query());
-    ClusterBaseProviderOptions backwardProviderOptions(cache, engines(), true,
-                                                       opts->produceVertices(),
-                                                       opts->query());
+    ClusterBaseProviderOptions forwardProviderOptions(
+        cache, engines(), false, opts->produceVertices(), opts->query());
+    ClusterBaseProviderOptions backwardProviderOptions(
+        cache, engines(), true, opts->produceVertices(), opts->query());
 
     auto usesWeight =
         checkWeight(forwardProviderOptions, backwardProviderOptions);

diff --git a/arangod/Aql/ExecutionNode/TraversalNode.cpp b/arangod/Aql/ExecutionNode/TraversalNode.cpp
@@ -817,9 +817,8 @@ std::unique_ptr<ExecutionBlock> TraversalNode::createBlock(
     bool isSmart) const {
   TraverserOptions* opts = this->options();
 
-  arangodb::graph::OneSidedEnumeratorOptions options{opts->minDepth,
-                                                     opts->maxDepth,
-                                                     opts->query()};
+  arangodb::graph::OneSidedEnumeratorOptions options{
+      opts->minDepth, opts->maxDepth, opts->query()};
   /*
    * PathValidator Disjoint Helper (TODO [GraphRefactor]: Copy from createBlock)
    * Clean this up as soon we clean up the whole TraversalNode as well.

diff --git a/arangod/Graph/Enumerators/OneSidedEnumerator.cpp b/arangod/Graph/Enumerators/OneSidedEnumerator.cpp
@@ -109,7 +109,8 @@ void OneSidedEnumerator<Configuration>::clearProvider() {
 template<class Configuration>
 void OneSidedEnumerator<Configuration>::computeNeighbourhoodOfNextVertex() {
   if (_options.isKilled()) {
-    // Clear false may sounds misleading, but this means we do not want to keep the path store
+    // Clear false may sounds misleading, but this means we do not want to keep
+    // the path store
     clear(false);
     THROW_ARANGO_EXCEPTION(TRI_ERROR_QUERY_KILLED);
   }

diff --git a/arangod/Graph/Options/OneSidedEnumeratorOptions.cpp b/arangod/Graph/Options/OneSidedEnumeratorOptions.cpp
@@ -27,7 +27,9 @@
 using namespace arangodb;
 using namespace arangodb::graph;
 
-OneSidedEnumeratorOptions::OneSidedEnumeratorOptions(size_t minDepth, size_t maxDepth, aql::QueryContext& query)
+OneSidedEnumeratorOptions::OneSidedEnumeratorOptions(size_t minDepth,
+                                                     size_t maxDepth,
+                                                     aql::QueryContext& query)
     : _minDepth(minDepth), _maxDepth(maxDepth), _observer(query) {}
 
 OneSidedEnumeratorOptions::~OneSidedEnumeratorOptions() = default;

diff --git a/arangod/Graph/Options/OneSidedEnumeratorOptions.h b/arangod/Graph/Options/OneSidedEnumeratorOptions.h
@@ -33,7 +33,8 @@ namespace arangodb::graph {
 
 struct OneSidedEnumeratorOptions {
  public:
-  OneSidedEnumeratorOptions(size_t minDepth, size_t maxDepth, aql::QueryContext& query);
+  OneSidedEnumeratorOptions(size_t minDepth, size_t maxDepth,
+                            aql::QueryContext& query);
   ~OneSidedEnumeratorOptions();
 
   [[nodiscard]] size_t getMinDepth() const noexcept;

diff --git a/arangod/Graph/Options/QueryContextObserver.h b/arangod/Graph/Options/QueryContextObserver.h
@@ -26,14 +26,14 @@
 
 #include "Aql/QueryContext.h"
 
-// This class serves as a wrapper around QueryContext to explicitly track where query killing
-// is being used in the graph traversal code. It provides a single point of access to check
-// if a query has been killed, making it easier to maintain and modify the query killing
-// behavior if needed.
+// This class serves as a wrapper around QueryContext to explicitly track where
+// query killing is being used in the graph traversal code. It provides a single
+// point of access to check if a query has been killed, making it easier to
+// maintain and modify the query killing behavior if needed.
 //
-// While this adds a small layer of indirection, it helps with code clarity and maintainability.
-// If profiling shows this wrapper causes significant overhead, we can remove it and use
-// QueryContext directly.
+// While this adds a small layer of indirection, it helps with code clarity and
+// maintainability. If profiling shows this wrapper causes significant overhead,
+// we can remove it and use QueryContext directly.
 //
 // We can change this or discuss if this approach is not liked.
 
@@ -42,11 +42,11 @@ namespace arangodb::graph {
 class QueryContextObserver {
  public:
   explicit QueryContextObserver(aql::QueryContext& query) : _query(query) {}
-  
+
   [[nodiscard]] bool isKilled() const { return _query.killed(); }
 
  private:
   aql::QueryContext& _query;
 };
 
-}  // namespace arangodb::graph 
+}  // namespace arangodb::graph
diff --git a/arangod/Graph/Options/TwoSidedEnumeratorOptions.cpp b/arangod/Graph/Options/TwoSidedEnumeratorOptions.cpp
@@ -31,7 +31,10 @@ TwoSidedEnumeratorOptions::TwoSidedEnumeratorOptions(size_t minDepth,
                                                      size_t maxDepth,
                                                      PathType::Type pathType,
                                                      aql::QueryContext& query)
-    : _minDepth(minDepth), _maxDepth(maxDepth), _pathType(pathType), _observer(query) {
+    : _minDepth(minDepth),
+      _maxDepth(maxDepth),
+      _pathType(pathType),
+      _observer(query) {
   if (getPathType() == PathType::Type::AllShortestPaths) {
     setStopAtFirstDepth(true);
   } else if (getPathType() == PathType::Type::ShortestPath) {

diff --git a/arangod/Graph/Providers/BaseProviderOptions.cpp b/arangod/Graph/Providers/BaseProviderOptions.cpp
@@ -86,8 +86,7 @@ SingleServerBaseProviderOptions::SingleServerBaseProviderOptions(
     MonitoredCollectionToShardMap const& collectionToShardMap,
     aql::Projections const& vertexProjections,
     aql::Projections const& edgeProjections, bool produceVertices,
-    bool useCache,
-    aql::QueryContext& query)
+    bool useCache, aql::QueryContext& query)
     : _temporaryVariable(tmpVar),
       _indexInformation(std::move(indexInfo)),
       _expressionContext(expressionContext),
@@ -171,8 +170,7 @@ void SingleServerBaseProviderOptions::unPrepareContext() {
 ClusterBaseProviderOptions::ClusterBaseProviderOptions(
     std::shared_ptr<RefactoredClusterTraverserCache> cache,
     std::unordered_map<ServerID, aql::EngineId> const* engines, bool backward,
-    bool produceVertices,
-    aql::QueryContext& query)
+    bool produceVertices, aql::QueryContext& query)
     : _cache(std::move(cache)),
       _engines(engines),
       _backward(backward),

diff --git a/arangod/Graph/Providers/BaseProviderOptions.h b/arangod/Graph/Providers/BaseProviderOptions.h
@@ -100,10 +100,10 @@ struct SingleServerBaseProviderOptions {
       MonitoredCollectionToShardMap const& collectionToShardMap,
       aql::Projections const& vertexProjections,
       aql::Projections const& edgeProjections, bool produceVertices,
-      bool useCache,
-      aql::QueryContext& query);
+      bool useCache, aql::QueryContext& query);
 
-  SingleServerBaseProviderOptions(SingleServerBaseProviderOptions const&) = delete;
+  SingleServerBaseProviderOptions(SingleServerBaseProviderOptions const&) =
+      delete;
   SingleServerBaseProviderOptions(SingleServerBaseProviderOptions&&) = default;
 
   aql::Variable const* tmpVar() const;
@@ -133,9 +133,7 @@ struct SingleServerBaseProviderOptions {
 
   aql::Projections const& getEdgeProjections() const;
 
-  bool isKilled() const noexcept {
-    return _queryObserver.isKilled();
-  }
+  bool isKilled() const noexcept { return _queryObserver.isKilled(); }
 
  private:
   // The temporary Variable used in the Indexes
@@ -188,8 +186,7 @@ struct ClusterBaseProviderOptions {
   ClusterBaseProviderOptions(
       std::shared_ptr<RefactoredClusterTraverserCache> cache,
       std::unordered_map<ServerID, aql::EngineId> const* engines, bool backward,
-      bool produceVertices,
-      aql::QueryContext& query);
+      bool produceVertices, aql::QueryContext& query);
 
   ClusterBaseProviderOptions(
       std::shared_ptr<RefactoredClusterTraverserCache> cache,
@@ -236,9 +233,7 @@ struct ClusterBaseProviderOptions {
     _clearEdgeCacheOnClear = flag;
   }
 
-  bool isKilled() const noexcept {
-    return _queryObserver.isKilled();
-  }
+  bool isKilled() const noexcept { return _queryObserver.isKilled(); }
 
  private:
   std::shared_ptr<RefactoredClusterTraverserCache> _cache;