_BST/tests.cpp at master · Prodigysy/_BST · 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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
#include <iostream>
#include <chrono>
#include <vector>
#include "BinarySearchTree.h"

size_t lcg() {
    static size_t x = 0;
    x = (1021 * x + 24631) % 116640;
    return x;
}

double fillContainer(BinarySearchTree& tree, int size) {
    auto start = std::chrono::high_resolution_clock::now();

    for (int i = 0; i < size; ++i) {
        tree.insert(lcg());
    }

    auto end = std::chrono::high_resolution_clock::now();
    std::chrono::duration<double, std::milli> duration = end - start;

    return duration.count();
}

double containsInContainer(BinarySearchTree& tree, int size) {
    double total_time = 0;

    for (int i = 0; i < size; ++i) {
        size_t key = lcg();

        auto start = std::chrono::high_resolution_clock::now();
        tree.contains(key);
        auto end = std::chrono::high_resolution_clock::now();

        std::chrono::duration<double, std::milli> duration = end - start;
        total_time += duration.count();
    }

    return total_time / size;
}

double insertAndEraseInContainer(BinarySearchTree& tree, int size) {
    double total_time = 0;

    for (int i = 0; i < size; ++i) {
        size_t key = lcg();

        auto start = std::chrono::high_resolution_clock::now();

        tree.insert(key);
        tree.erase(key);

        auto end = std::chrono::high_resolution_clock::now();

        std::chrono::duration<double, std::milli> duration = end - start;
        total_time += duration.count();
    }

    return total_time / size;
}

double fillVector(std::vector<int>& vec, int size) {
    auto start = std::chrono::high_resolution_clock::now();

    for (int i = 0; i < size; ++i) {
        vec.push_back(lcg());
    }

    auto end = std::chrono::high_resolution_clock::now();
    std::chrono::duration<double, std::milli> duration = end - start;

    return duration.count();
}

double searchInVector(const std::vector<int>& vec, int size) {
    double total_time = 0;

    for (int i = 0; i < size; ++i) {
        size_t key = lcg();

        auto start = std::chrono::high_resolution_clock::now();

        std::find(vec.begin(), vec.end(), key);

        auto end = std::chrono::high_resolution_clock::now();

        std::chrono::duration<double, std::milli> duration = end - start;
        total_time += duration.count();
    }

    return total_time / size;
}

double insertAndEraseInVector(std::vector<int>& vec, int size) {
    double total_time = 0;

    for (int i = 0; i < size; ++i) {
        size_t key = lcg();

        auto start = std::chrono::high_resolution_clock::now();

        vec.push_back(key);
        vec.erase(std::remove(vec.begin(), vec.end(), key), vec.end());

        auto end = std::chrono::high_resolution_clock::now();

        std::chrono::duration<double, std::milli> duration = end - start;
        total_time += duration.count();
    }

    return total_time / size;
}

//int main() {
//    int sizes[] = { 1000, 10000, 100000 };
//    int attempts = 1000;
//
//    for (int size : sizes) {
//        double bst_total_fill_time = 0;
//        double bst_total_search_time = 0;
//        double bst_total_insert_erase_time = 0;
//
//        double vector_total_fill_time = 0;
//        double vector_total_search_time = 0;
//        double vector_total_insert_erase_time = 0;
//
//        for (int i = 0; i < attempts; ++i) {
//            BinarySearchTree tree;
//            std::vector<int> vec;
//            bst_total_fill_time += fillContainer(tree, size);
//            bst_total_search_time += containsInContainer(tree, size);
//            bst_total_insert_erase_time += insertAndEraseInContainer(tree, size);
//            vector_total_fill_time += fillVector(vec, size);
//            vector_total_search_time += searchInVector(vec, size);
//            vector_total_insert_erase_time += insertAndEraseInVector(vec, size);
//        }
//
//        double bst_average_fill_time = bst_total_fill_time / attempts;
//        double bst_average_search_time = bst_total_search_time / attempts;
//        double bst_average_insert_erase_time = bst_total_insert_erase_time / attempts;
//
//        double vector_average_fill_time = vector_total_fill_time / attempts;
//        double vector_average_search_time = vector_total_search_time / attempts;
//        double vector_average_insert_erase_time = vector_total_insert_erase_time / attempts;
//
//        std::cout << "BST average search time for " << size << " elements: " << bst_average_search_time << " milliseconds" << std::endl;
//        std::cout << "BST average fill time for " << size << " elements: " << bst_average_fill_time << " milliseconds" << std::endl;
//        std::cout << "BST average insert and erase time for " << size << " elements: " << bst_average_insert_erase_time << " milliseconds" << std::endl;
//
//        std::cout << "Vector average fill time for " << size << " elements: " << vector_average_fill_time << " milliseconds" << std::endl;
//        std::cout << "Vector average search time for " << size << " elements: " << vector_average_search_time << " milliseconds" << std::endl;
//        std::cout << "Vector average insert and erase time for " << size << " elements: " << vector_average_insert_erase_time << " milliseconds" << std::endl;
//    }
//
//    return 0;
//}