1
0

find_example.cpp 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131
  1. #include <iostream>
  2. #include <string>
  3. #include <vector>
  4. #include <unordered_map>
  5. #include <chrono>
  6. #include <random>
  7. using namespace std;
  8. #include "tire.h"
  9. const int N = 1e5;
  10. const int M = 5e4;
  11. const int M1 = 3;
  12. const int M2 = 5;
  13. struct Test {
  14. int a;
  15. short b;
  16. int c;
  17. };
  18. vector<long long> umap_times;
  19. vector<long long> tire_times;
  20. vector<string> data_table;
  21. void init_data_table() {
  22. for (int i = 0; i < N; ++i) {
  23. string str = to_string(i + 1);
  24. data_table.push_back(str);
  25. }
  26. }
  27. vector<string> target_table;
  28. void init_target_table() {
  29. for (int i = 0; i < M; ++i) {
  30. char str[32] = "";
  31. int size = rand() % 30;
  32. for (int j = 0; j < size; ++j) {
  33. str[j] = (char)(rand() % 10) + '0';
  34. }
  35. str[size] = '\0';
  36. target_table.push_back(str);
  37. }
  38. }
  39. void umap_test(unordered_map<string, Test>& umap) {
  40. auto start = chrono::high_resolution_clock::now();
  41. for (auto& target : target_table) {
  42. umap.find(target);
  43. }
  44. auto end = chrono::high_resolution_clock::now();
  45. auto duration = chrono::duration_cast<chrono::microseconds>(end - start);
  46. umap_times.push_back(duration.count());
  47. }
  48. void tire_test(Tire<Test>& tire) {
  49. auto start = chrono::high_resolution_clock::now();
  50. for (auto& target : target_table) {
  51. tire.find(target);
  52. }
  53. auto end = chrono::high_resolution_clock::now();
  54. auto duration = chrono::duration_cast<chrono::microseconds>(end - start);
  55. tire_times.push_back(duration.count());
  56. }
  57. void analysis(string name, vector<long long>& nums) {
  58. const int n = nums.size();
  59. long long maxn = LLONG_MIN, minn = LLONG_MAX;
  60. long long sum = 0;
  61. for (long long& num : nums) {
  62. maxn = max(maxn, num);
  63. minn = min(minn, num);
  64. sum += num;
  65. }
  66. cout << name << ": " << "maxn: " << maxn << "ms " << "minn: " << minn << "ms " << "avg: " << (1.0 * sum / n) << "ms " << "sum: " << sum << "ms " << endl;
  67. }
  68. int main() {
  69. init_data_table();
  70. init_target_table();
  71. Tire<Test> tire;
  72. unordered_map<string, Test> umap;
  73. const int n = data_table.size();
  74. for (int i = 0; i < n; ++i) {
  75. Test t;
  76. t.a = i;
  77. t.c = n + i;
  78. tire.insert(data_table[i], t);
  79. }
  80. for (int i = 0; i < n; ++i) {
  81. Test t;
  82. t.a = i;
  83. t.c = n + i;
  84. umap.insert({ data_table[i], t });
  85. }
  86. // group 1
  87. for (int i = 0; i < M1; ++i) {
  88. umap_test(umap);
  89. tire_test(tire);
  90. }
  91. // group 2
  92. for (int i = 0; i < M1; ++i) {
  93. tire_test(tire);
  94. umap_test(umap);
  95. }
  96. // group 3
  97. for (int i = 0; i < M2; ++i) {
  98. umap_test(umap);
  99. }
  100. for (int i = 0; i < M2; ++i) {
  101. tire_test(tire);
  102. }
  103. // group 4
  104. for (int i = 0; i < M2; ++i) {
  105. tire_test(tire);
  106. }
  107. for (int i = 0; i < M2; ++i) {
  108. umap_test(umap);
  109. }
  110. // 分析
  111. analysis("umap", umap_times);
  112. analysis("tire", tire_times);
  113. return 0;
  114. }