Cleanup

src/fptree.cpp

@@ -59,9 +59,9 @@ FPTree::FPTree(const std::vector<Transaction>& transactions, uint64_t minimum_su
                 // insert item in the tree
 
                 // check if curr_fpnode has a child curr_fpnode_child such that curr_fpnode_child.item = item
-                const auto it = std::find_if( curr_fpnode->children.cbegin(),
-                curr_fpnode->children.cend(), [item](const std::shared_ptr<FPNode>& fpnode) {
-                    return fpnode->item == item;
+                const auto it = std::find_if(
+                    curr_fpnode->children.cbegin(), curr_fpnode->children.cend(),  [item](const std::shared_ptr<FPNode>& fpnode) {
+                        return fpnode->item == item;
                 } );
                 if ( it == curr_fpnode->children.cend() ) {
                     // the child doesn't exist, create a new node

src/main.cpp

@@ -27,9 +27,9 @@ void test_1()
         { b, c, e }
     };
 
-    const auto minimum_support_treshold = 2;
+    const auto minimum_support_threshold = 2;
 
-    const FPTree fptree{ transactions, minimum_support_treshold };
+    const FPTree fptree{ transactions, minimum_support_threshold };
 
     const std::set<Pattern> patterns = fptree_growth( fptree );
 
@@ -72,9 +72,9 @@ void test_2()
         { b, c, d },
     };
 
-    const auto minimum_support_treshold = 3;
+    const auto minimum_support_threshold = 3;
 
-    const FPTree fptree{ transactions, minimum_support_treshold };
+    const FPTree fptree{ transactions, minimum_support_threshold };
 
     const std::set<Pattern> patterns = fptree_growth( fptree );
 
@@ -128,9 +128,9 @@ void test_3()
         { a, f, c, e, l, p, m, n }
     };
 
-    const auto minimum_support_treshold = 3;
+    const auto minimum_support_threshold = 3;
 
-    const FPTree fptree{ transactions, minimum_support_treshold };
+    const FPTree fptree{ transactions, minimum_support_threshold };
 
     const std::set<Pattern> patterns = fptree_growth( fptree );