Skip to content

Commit 94c2ae2

Browse files
committed
clang-format nannying
1 parent bf41c6a commit 94c2ae2

File tree

5 files changed

+25
-38
lines changed

5 files changed

+25
-38
lines changed

arangod/Graph/Enumerators/TwoSidedEnumerator.h

Lines changed: 9 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -154,20 +154,17 @@ class TwoSidedEnumerator {
154154

155155
auto provider() -> ProviderType&;
156156

157-
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden) -> void
158-
requires HasForbidden<PathValidatorType>
159-
{
157+
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden)
158+
-> void requires HasForbidden<PathValidatorType> {
160159
_validator.setForbiddenVertices(std::move(forbidden));
161160
};
162161

163-
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden) -> void
164-
requires HasForbidden<PathValidatorType>
165-
{
162+
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden)
163+
-> void requires HasForbidden<PathValidatorType> {
166164
_validator.setForbiddenEdges(std::move(forbidden));
167165
};
168166

169-
private:
170-
auto clearProvider() -> void;
167+
private : auto clearProvider() -> void;
171168
// Fast path, to test if we find a connecting vertex between left and right.
172169
Shell _shell{};
173170

@@ -265,16 +262,14 @@ class TwoSidedEnumerator {
265262
*/
266263
auto stealStats() -> aql::TraversalStats;
267264

268-
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden) -> void
269-
requires HasForbidden<PathValidatorType>
270-
{
265+
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden)
266+
-> void requires HasForbidden<PathValidatorType> {
271267
_left.setForbiddenVertices(forbidden);
272268
_right.setForbiddenVertices(std::move(forbidden));
273269
};
274270

275-
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden) -> void
276-
requires HasForbidden<PathValidatorType>
277-
{
271+
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden)
272+
-> void requires HasForbidden<PathValidatorType> {
278273
_left.setForbiddenEdges(forbidden);
279274
_right.setForbiddenEdges(std::move(forbidden));
280275
};

arangod/Graph/Enumerators/WeightedTwoSidedEnumerator.h

Lines changed: 9 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -257,15 +257,13 @@ class WeightedTwoSidedEnumerator {
257257
return _haveSeenOtherSide;
258258
}
259259

260-
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden) -> void
261-
requires HasForbidden<PathValidatorType>
262-
{
260+
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden)
261+
-> void requires HasForbidden<PathValidatorType> {
263262
_validator.setForbiddenVertices(std::move(forbidden));
264263
};
265264

266-
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden) -> void
267-
requires HasForbidden<PathValidatorType>
268-
{
265+
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden)
266+
-> void requires HasForbidden<PathValidatorType> {
269267
_validator.setForbiddenEdges(std::move(forbidden));
270268
};
271269

@@ -397,22 +395,19 @@ class WeightedTwoSidedEnumerator {
397395
*/
398396
auto stealStats() -> aql::TraversalStats;
399397

400-
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden) -> void
401-
requires HasForbidden<PathValidatorType>
402-
{
398+
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden)
399+
-> void requires HasForbidden<PathValidatorType> {
403400
_left.setForbiddenVertices(forbidden);
404401
_right.setForbiddenVertices(std::move(forbidden));
405402
};
406403

407-
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden) -> void
408-
requires HasForbidden<PathValidatorType>
409-
{
404+
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden)
405+
-> void requires HasForbidden<PathValidatorType> {
410406
_left.setForbiddenEdges(forbidden);
411407
_right.setForbiddenEdges(std::move(forbidden));
412408
};
413409

414-
private:
415-
[[nodiscard]] auto searchDone() const -> bool;
410+
private : [[nodiscard]] auto searchDone() const -> bool;
416411
// Ensure that we have fetched all vertices in the _results list. Otherwise,
417412
// we will not be able to generate the resulting path
418413
auto fetchResults() -> void;

arangod/Graph/PathManagement/PathValidatorTracer.h

Lines changed: 5 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -86,20 +86,17 @@ class PathValidatorTracer {
8686
void unpreparePruneContext();
8787
void unpreparePostFilterContext();
8888

89-
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden) -> void
90-
requires HasForbidden<PathValidatorImplementation>
91-
{
89+
auto setForbiddenVertices(std::shared_ptr<VertexSet> forbidden)
90+
-> void requires HasForbidden<PathValidatorImplementation> {
9291
_impl.setForbiddenVertices(std::move(forbidden));
9392
};
9493

95-
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden) -> void
96-
requires HasForbidden<PathValidatorImplementation>
97-
{
94+
auto setForbiddenEdges(std::shared_ptr<EdgeSet> forbidden)
95+
-> void requires HasForbidden<PathValidatorImplementation> {
9896
_impl.setForbiddenEdges(std::move(forbidden));
9997
};
10098

101-
private:
102-
PathValidatorImplementation _impl;
99+
private : PathValidatorImplementation _impl;
103100
// Mapping MethodName => Statistics
104101
// We make this mutable to not violate the captured API
105102
mutable containers::FlatHashMap<std::string, TraceEntry> _stats;

arangod/Graph/Types/ForbiddenVertices.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ template<typename T>
3535
concept HasForbidden = requires(T t) {
3636
{
3737
t.setForbiddenVertices(std::make_shared<VertexSet>())
38-
} -> std::same_as<void>;
38+
} -> std::same_as<void>;
3939
};
4040

4141
} // namespace graph

tests/Mocks/MockGraphProvider.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -273,7 +273,7 @@ class MockGraphProvider {
273273
MockGraphProvider& operator=(MockGraphProvider const&) = delete;
274274
MockGraphProvider& operator=(MockGraphProvider&&) = default;
275275

276-
void destroyEngines() {};
276+
void destroyEngines(){};
277277
auto startVertex(arangodb::graph::VertexRef vertex, size_t depth = 0,
278278
double weight = 0.0) -> Step;
279279
auto fetchVertices(std::vector<Step*> const& looseEnds)

0 commit comments

Comments
 (0)