1
0

iterator_example.cpp 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  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. char str[32] = "";
  24. int size = rand() % 30;
  25. for (int j = 0; j < size; ++j) {
  26. str[j] = (char)(rand() % 256);
  27. }
  28. str[size] = '\0';
  29. data_table.push_back(str);
  30. }
  31. }
  32. void umap_test(unordered_map<string, Test>& umap) {
  33. auto start = chrono::high_resolution_clock::now();
  34. for (auto& item : umap) {
  35. }
  36. auto end = chrono::high_resolution_clock::now();
  37. auto duration = chrono::duration_cast<chrono::microseconds>(end - start);
  38. umap_times.push_back(duration.count());
  39. }
  40. void tire_test(Tire<Test>& tire) {
  41. auto start = chrono::high_resolution_clock::now();
  42. for (auto& item : tire) {
  43. }
  44. auto end = chrono::high_resolution_clock::now();
  45. auto duration = chrono::duration_cast<chrono::microseconds>(end - start);
  46. tire_times.push_back(duration.count());
  47. }
  48. void analysis(string name, vector<long long>& nums) {
  49. const int n = nums.size();
  50. long long maxn = LLONG_MIN, minn = LLONG_MAX;
  51. long long sum = 0;
  52. for (long long& num : nums) {
  53. maxn = max(maxn, num);
  54. minn = min(minn, num);
  55. sum += num;
  56. }
  57. cout << name << ": " << "maxn: " << maxn << "ms " << "minn: " << minn << "ms " << "avg: " << (1.0 * sum / n) << "ms " << "sum: " << sum << "ms " << endl;
  58. }
  59. int main() {
  60. init_data_table();
  61. Tire<Test> tire;
  62. unordered_map<string, Test> umap;
  63. const int n = data_table.size();
  64. for (int i = 0; i < n; ++i) {
  65. Test t;
  66. t.a = i;
  67. t.c = n + i;
  68. tire.insert(data_table[i], t);
  69. }
  70. for (int i = 0; i < n; ++i) {
  71. Test t;
  72. t.a = i;
  73. t.c = n + i;
  74. umap.insert({ data_table[i], t });
  75. }
  76. // group 1
  77. for (int i = 0; i < M1; ++i) {
  78. umap_test(umap);
  79. tire_test(tire);
  80. }
  81. // group 2
  82. for (int i = 0; i < M1; ++i) {
  83. tire_test(tire);
  84. umap_test(umap);
  85. }
  86. // group 3
  87. for (int i = 0; i < M2; ++i) {
  88. umap_test(umap);
  89. }
  90. for (int i = 0; i < M2; ++i) {
  91. tire_test(tire);
  92. }
  93. // group 4
  94. for (int i = 0; i < M2; ++i) {
  95. tire_test(tire);
  96. }
  97. for (int i = 0; i < M2; ++i) {
  98. umap_test(umap);
  99. }
  100. // 分析
  101. analysis("umap", umap_times);
  102. analysis("tire", tire_times);
  103. return 0;
  104. }