Use clang-format

Author: PodushkaPIR

src/core/algorithms/association_rules/candidate_hash_tree.cpp

@@ -13,10 +13,10 @@ void CandidateHashTree::AppendRow(LeafRow row, HashTreeNode& subtree_root) {
         unsigned const max_level_number = row.candidate_node->items.size();
         subtree_root.candidates.push_back(std::move(row));
 
-        /* If the number of candidates in a leaf node is more than min_threshold, a leaf node becomes
-         * an internal node and the tree expands. But if there is no more levels to expand (maximum
-         * level number equals to the cardinality of a candidates), min_threshold is ignored
-         * and a new candidates are just appended without trying to further grow the tree.*/
+        /* If the number of candidates in a leaf node is more than min_threshold, a leaf node
+         * becomes an internal node and the tree expands. But if there is no more levels to expand
+         * (maximum level number equals to the cardinality of a candidates), min_threshold is
+         * ignored and a new candidates are just appended without trying to further grow the tree.*/
         if (subtree_root.candidates.size() > min_threshold_ &&
             subtree_root.level_number <= max_level_number) {
             AddLevel(subtree_root);

src/core/algorithms/fd/dfd/lattice_traversal/lattice_traversal.cpp

@@ -303,7 +303,7 @@ std::list<Vertical> LatticeTraversal::Minimize(
 }
 
 void LatticeTraversal::SubtractSets(std::unordered_set<Vertical>& set,
-                                     std::unordered_set<Vertical> const& set_to_subtract) {
+                                    std::unordered_set<Vertical> const& set_to_subtract) {
     for (auto const& node_to_delete : set_to_subtract) {
         auto found_element_iter = set.find(node_to_delete);
         if (found_element_iter != set.end()) {

src/core/algorithms/fd/dfd/lattice_traversal/lattice_traversal.h

@@ -36,7 +36,7 @@ class LatticeTraversal {
     std::list<Vertical> Minimize(std::unordered_set<Vertical> const& node_list) const;
     Vertical const& TakeRandom(std::unordered_set<Vertical>& node_set);
     static void SubtractSets(std::unordered_set<Vertical>& set,
-                              std::unordered_set<Vertical> const& set_to_subtract);
+                             std::unordered_set<Vertical> const& set_to_subtract);
 
 public:
     LatticeTraversal(Column const* const rhs, ColumnLayoutRelationData const* const relation,