playground/unittest.cpp at master · vasyaa/playground · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include "incubator/least_frequently_used.h"
#include "incubator/any.h"
#include "algorithms/avl_tree.h"
//#include "mt/work_scheduling.h"
#include "solvers/activity_selection_solver.h"
#include "solvers/graph.h"
#include "solvers/knapsack_solver.h"
#include "solvers/longest_common_subseq_solver.h"
#include "solvers/merge_overlapping_intervals_solver.h"

//#include "algorithms/disjoint_set.h"
#include "algorithms/disjoint_set_simple.h"
#include "algorithms/disjoint_set_simple_map.h"
#include "solvers/jobs_scheduling_solver.h"
#include "solvers/weighted_jobs_scheduling_solver.h"

//#include "todo/big_int.h"
//#include "todo/shared_ptr.h"

using namespace std;

int main(void) {
    least_frequently_used::test::test();
    return 0;

    any::test::test();
    solvers::graph::test();
    solvers::weighted_jobs_scheduling::test();

    //    solvers::scheduling_jobs_solver::test();
    //
    solvers::knapsack_solver::test();
    //    solvers::longest_common_subseq_solver::test();
    //
    //    solvers::merge_overlapping_intervals_solver::test();
    //    solvers::activity_selection_solver::test();
    //    algorithms::avl_tree::test();
    //    algorithms::disjoint_set_simple::test();
    //    algorithms::disjoint_set_simple_map::test();
    //
    ////    algorithms::shared_ptr::test();
    ////    algorithms::big_num::test();
    ////    algorithms::disjoint_set::test();
    return 0;
}