triple_tree/speed_tests_tree3.cpp at master · Shennor/triple_tree · 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
#include "speed_tests_tree3.h"
#include <iostream>
#include <ctime>
#include <vector>
#include "tree3.h"

namespace speed_tests_tree3
{
	double test_add(size_t num)
	{
		tree3::Tree3<int> t{};
		int start = clock();
		int end;
		double res = 0;
		for (size_t i = 0; i < num; ++i)
		{
			t.Add(std::rand());
			end = clock();
			if (double(end - start) / CLOCKS_PER_SEC > 0.001) {
				res += double(end - start) / CLOCKS_PER_SEC;
				start = clock();
			}
		}
		return res;
	}

	double test_search(size_t num)
	{
		tree3::Tree3<int> t{};
		std::vector<int> v{};
		for (size_t i = 0; i < num; ++i)
		{
			int a = std::rand();
			t.Add(a);
			v.push_back(a);
		}
		int start = clock();
		int end;
		double res = 0;
		for (size_t i = 0; i < num; ++i)
		{
			t.Search(v[rand() % v.size()]);
			end = clock();
			if (double(end - start) / CLOCKS_PER_SEC > 0.001) {
				res += double(end - start) / CLOCKS_PER_SEC;
				start = clock();
			}
		}
		return res;
	}

	/*
	int test_delete(size_t num)
	{
		tree3::Tree3<int> t{};
		std::vector<tree3::Node3<int>*> v{};
		for (size_t i = 0; i < num; ++i)
		{
			int a = std::rand();
			t.Add(a);
			v.push_back(t.Search(a));
		}
		const int start = clock();
		for (size_t i = 0; i < num; ++i)
		{
			t.Delete(v[rand() % v.size()]);
		}
		const int end = clock();
		return end - start;
	}
	*/
	void test_all()
	{
		std::cout << "speed test for add started\n";
		double add_sec_4 = 0;
		for (int i = 0; i < 1; ++i)
		{
			add_sec_4 += test_add(50000);
		}
		double add_sec_7 = 0;
		for (int i = 0; i < 1; ++i)
		{
			add_sec_7 += test_add(10000000);
		}
		std::cout << "speed test for add ended\n";
		std::cout << "speed test for search started\n";
		double search_sec_4 = 0;
		for (int i = 0; i < 1; ++i)
		{
			search_sec_4 += test_search(50000);
		}
		double search_sec_7 = 0;
		for (int i = 0; i < 1; ++i)
		{
			search_sec_7 += test_search(10000000);
		}
		std::cout << "speed test for search ended\n";
		/*
		std::cout << "speed test for delete started\n";
		float delete_sec_4 = 0;
		for (int i = 0; i < 1; ++i)
		{
			delete_sec_4 += float(test_delete(50000)) / CLOCKS_PER_SEC;
		}
		float delete_sec_7 = 0;
		for (int i = 0; i < 1; ++i)
		{
			delete_sec_7 += float(test_delete(10000000)) / CLOCKS_PER_SEC;
		}
		std::cout << "speed test for delete ended\n\n";
		*/
		std::cout << "Speed test for Tree3:\n";
		std::cout << "Add:\n";
		std::cout << "5*10^4 elements - " << add_sec_4 << " seconds. \n";
		std::cout << "10^7 elements - " << add_sec_7 << " seconds. \n";
		std::cout << "Search:\n";
		std::cout << "5*10^4 elements - " << search_sec_4 << " seconds. \n";
		std::cout << "10^7 elements - " << search_sec_7 << " seconds. \n";
		//std::cout << "Delete:\n";
		//std::cout << "5*10^4 elements - " << delete_sec_4 << "seconds. \n";
		//std::cout << "10^7 elements - " << delete_sec_7 << "seconds. \n";
	}

}