1
0

construct_example.cpp 2.1 KB

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