Skip to content

Commit ca8b93f

Browse files
committed
Apply clang-tidy to headers
1 parent d347418 commit ca8b93f

File tree

10 files changed

+51
-24
lines changed

10 files changed

+51
-24
lines changed

.clang-tidy

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -19,8 +19,8 @@ HeaderFilterRegex: ''
1919
FormatStyle: none
2020
CheckOptions:
2121
- key: readability-identifier-length.IgnoredVariableNames
22-
value: 'x|y|z'
22+
value: 'x|y|z|rf'
2323
- key: readability-identifier-length.IgnoredParameterNames
24-
value: 'x|y|z'
24+
value: 'x|y|z|rf'
2525
- key: bugprone-easily-swappable-parameters.MinimumLength
26-
value: '3'
26+
value: '4'

include/cascade_builder.h

Lines changed: 10 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,24 +1,30 @@
11
#ifndef CASCADE_BUILDER_H_
22
#define CASCADE_BUILDER_H_
33

4+
#include <array>
45
#include <bitset>
6+
#include <utility>
7+
#include <vector>
8+
#include <memory>
9+
#include <cstddef>
510

11+
#include "config.h"
612
#include "json_facade.h"
713
#include "node.h"
814
#include "raw_filter.h"
915

1016
class CascadeBuilder {
1117
public:
12-
CascadeBuilder(const PredicateDisjunction& disjunction, const RawFilterData& raw_filter_data)
13-
: disjunction_(disjunction), rf_data_(raw_filter_data) {}
18+
CascadeBuilder(PredicateDisjunction disjunction, const RawFilterData& raw_filter_data)
19+
: disjunction_(std::move(disjunction)), rf_data_(raw_filter_data) {}
1420

1521
[[nodiscard]] std::vector<std::shared_ptr<Node>> GenerateValidCascades();
1622

1723
private:
1824
std::shared_ptr<Node> fail_node = std::make_shared<Node>(0, 0, 0, nullptr, nullptr, NodeType::FAIL);
1925
std::shared_ptr<Node> parse_node = std::make_shared<Node>(0, 0, 0, nullptr, nullptr, NodeType::PARSE);
20-
const PredicateDisjunction& disjunction_;
21-
const RawFilterData& rf_data_;
26+
PredicateDisjunction disjunction_;
27+
RawFilterData rf_data_;
2228
std::bitset<kMaxConj> used_conjunctions_;
2329
std::array<std::array<std::bitset<kMaxRfsInPred>, kMaxPred>, kMaxConj> used_rfs_;
2430

include/cascade_evaluator.h

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -9,8 +9,8 @@
99
#include "node.h"
1010

1111
struct EstimationResult {
12-
double average_parse_time;
13-
double average_rf_time;
12+
double average_parse_time{};
13+
double average_rf_time{};
1414
std::array<std::bitset<kSampleSize>, kTotalMaxRfs> bitsets;
1515
};
1616

@@ -21,7 +21,7 @@ class CascadeEvaluator {
2121
[[nodiscard]] double EvaluateCascade(const std::shared_ptr<Node>& cascade);
2222

2323
private:
24-
const EstimationResult& estimation_result_;
24+
EstimationResult estimation_result_;
2525

2626
[[nodiscard]] double EvaluateSubtreeCost(const std::shared_ptr<Node>& subtree,
2727
const std::bitset<kSampleSize>& active_mask);

include/common.h

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,9 +7,12 @@ using bench_timer_t = std::chrono::time_point<std::chrono::steady_clock>;
77

88
[[nodiscard]] inline bench_timer_t benchmark_start() { return std::chrono::steady_clock::now(); }
99

10+
constexpr double MICROSECONDS_IN_SECOND = 1'000'000.0;
11+
1012
[[nodiscard]] inline double benchmark_stop(bench_timer_t start) {
1113
auto end = std::chrono::steady_clock::now();
12-
return std::chrono::duration_cast<std::chrono::microseconds>(end - start).count() / 1'000'000.0;
14+
return static_cast<double>(std::chrono::duration_cast<std::chrono::microseconds>(end - start).count()) /
15+
MICROSECONDS_IN_SECOND;
1316
}
1417

1518
#endif // COMMON_H_

include/input_reader.h

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,7 @@
22
#define INPUT_READER_H_
33

44
#include <string>
5+
#include <string_view>
56
#include <vector>
67

78
class InputReader {

include/json_facade.h

Lines changed: 12 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,10 @@
22
#define JSON_FACADE_H_
33

44
#include <memory>
5+
#include <ostream>
56
#include <string>
67
#include <string_view>
8+
#include <utility>
79
#include <vector>
810

911
struct Predicate {
@@ -24,28 +26,33 @@ class JsonQuery {
2426
PredicateDisjunction disjunction_;
2527

2628
public:
27-
explicit JsonQuery(const PredicateDisjunction& disjunction) : disjunction_(disjunction) {}
29+
explicit JsonQuery(PredicateDisjunction disjunction) : disjunction_(std::move(disjunction)) {}
2830

29-
[[nodiscard]] const inline PredicateDisjunction& GetDisjunction() const { return disjunction_; }
31+
[[nodiscard]] const PredicateDisjunction& GetDisjunction() const { return disjunction_; }
3032
[[nodiscard]] std::string ToString() const;
3133

32-
friend std::ostream& operator<<(std::ostream& os, const JsonQuery& query);
34+
friend std::ostream& operator<<(std::ostream& outStream, const JsonQuery& query);
3335
};
3436

3537
class JsonFacade {
3638
public:
39+
JsonFacade() = default;
40+
JsonFacade(const JsonFacade&) = delete;
41+
JsonFacade& operator=(const JsonFacade&) = delete;
42+
JsonFacade(JsonFacade&&) = delete;
43+
JsonFacade& operator=(JsonFacade&&) = delete;
3744
virtual ~JsonFacade() = default;
3845
[[nodiscard]] virtual bool EvaluateQuery(std::string_view jsonStr, const JsonQuery& query) = 0;
3946
};
4047

4148
class RapidJsonFacade : public JsonFacade {
4249
public:
43-
[[nodiscard]] virtual bool EvaluateQuery(std::string_view jsonStr, const JsonQuery& query) override;
50+
[[nodiscard]] bool EvaluateQuery(std::string_view jsonStr, const JsonQuery& query) override;
4451
};
4552

4653
class SimdJsonFacade : public JsonFacade {
4754
public:
48-
[[nodiscard]] virtual bool EvaluateQuery(std::string_view jsonStr, const JsonQuery& query) override;
55+
[[nodiscard]] bool EvaluateQuery(std::string_view jsonStr, const JsonQuery& query) override;
4956
};
5057

5158
class JsonQueryDriver {

include/node.h

Lines changed: 6 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -4,9 +4,11 @@
44
#include <cstdint>
55
#include <iostream>
66
#include <memory>
7+
#include <string>
8+
#include <utility>
79

810
#include "raw_filter.h"
9-
enum class NodeType { INTER, FAIL, PARSE };
11+
enum class NodeType : std::uint8_t { INTER, FAIL, PARSE };
1012

1113
struct Node {
1214
uint32_t conjunction_idx;
@@ -21,12 +23,12 @@ struct Node {
2123
: conjunction_idx(conj_idx),
2224
predicate_idx(pred_idx),
2325
raw_filter_idx(rf_idx),
24-
left(left_subtree),
25-
right(right_subtree),
26+
left(std::move(left_subtree)),
27+
right(std::move(right_subtree)),
2628
type(node_type) {}
2729
};
2830

2931
void PrettyPrint(const std::shared_ptr<Node>& node, const RawFilterData& rf_data, const std::string& prefix = "",
30-
bool isLeft = true, std::ostream& os = std::cout);
32+
bool isLeft = true, std::ostream& outStream = std::cout);
3133

3234
#endif // NODE_H_

include/raw_filter.h

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,9 @@
22
#define RAW_FILTER_H_
33

44
#include <array>
5+
#include <cstddef>
56
#include <string_view>
7+
#include <vector>
68

79
#include "config.h"
810
#include "json_facade.h"
@@ -21,7 +23,7 @@ class RawFilterQueryGenerator {
2123
};
2224

2325
[[nodiscard]] inline size_t GetFlatIdx(size_t conj_idx, size_t pred_idx, size_t rf_idx) {
24-
return conj_idx * kMaxPred * kMaxRfsInPred + pred_idx * kMaxRfsInPred + rf_idx;
26+
return (conj_idx * kMaxPred * kMaxRfsInPred) + (pred_idx * kMaxRfsInPred) + rf_idx;
2527
}
2628

2729
#endif // RAW_FILTER_H_

include/sparser.h

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,9 @@
33

44
#include <cstddef>
55
#include <memory>
6+
#include <string>
67
#include <string_view>
8+
#include <utility>
79
#include <vector>
810

911
#include "cascade_evaluator.h"

src/main.cpp

Lines changed: 7 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,9 @@
1+
#include <exception>
2+
#include <iostream>
13
#include <memory>
24
#include <span>
5+
#include <string>
6+
#include <utility>
37

48
#include "json_facade.h"
59
#include "sparser.h"
@@ -15,10 +19,10 @@ int main(int argc, char* argv[]) {
1519

1620
const std::string filename = args[1];
1721

18-
Predicate pred1{.key = "text", .value = "Lord of the Rings"};
22+
const Predicate pred1{.key = "text", .value = "Lord of the Rings"};
1923

20-
PredicateConjunction conj1{{pred1}};
21-
PredicateDisjunction disj{{conj1}};
24+
const PredicateConjunction conj1{{pred1}};
25+
const PredicateDisjunction disj{{conj1}};
2226

2327
auto facade = std::make_unique<RapidJsonFacade>();
2428
auto json_query_driver = std::make_unique<JsonQueryDriver>(std::move(facade));

0 commit comments

Comments
 (0)