| 16 | namespace mdf::test { |
| 17 | |
| 18 | TEST(TestQueueSpeed, TestList) { |
| 19 | SampleRecord test_record; |
| 20 | test_record.timestamp = MdfHelper::NowNs(); |
| 21 | test_record.record_id = 1; |
| 22 | test_record.record_buffer.resize(1000, 0); |
| 23 | |
| 24 | std::cout << std::endl; |
| 25 | { |
| 26 | const uint64_t start_time = MdfHelper::NowNs(); |
| 27 | std::list<SampleRecord> list; |
| 28 | for (size_t sample = 0; sample < 1'000'000; ++sample) { |
| 29 | list.push_back(test_record); |
| 30 | } |
| 31 | while (!list.empty()) { |
| 32 | list.pop_front(); |
| 33 | } |
| 34 | const uint64_t run_time = MdfHelper::NowNs() - start_time; |
| 35 | std::cout << "List Run Time (ms): " |
| 36 | << static_cast<double>(run_time) / 1'000'000 << std::endl; |
| 37 | } |
| 38 | |
| 39 | { |
| 40 | const uint64_t start_time = MdfHelper::NowNs(); |
| 41 | std::deque<SampleRecord> list; |
| 42 | for (size_t sample = 0; sample < 1'000'000; ++sample) { |
| 43 | list.push_back(test_record); |
| 44 | } |
| 45 | while (!list.empty()) { |
| 46 | list.pop_front(); |
| 47 | } |
| 48 | const uint64_t run_time = MdfHelper::NowNs() - start_time; |
| 49 | std::cout << "Deque Run Time (ms): " |
| 50 | << static_cast<double>(run_time) / 1'000'000 << std::endl; |
| 51 | } |
| 52 | |
| 53 | { |
| 54 | const uint64_t start_time = MdfHelper::NowNs(); |
| 55 | std::queue<SampleRecord> list; |
| 56 | for (size_t sample = 0; sample < 1'000'000; ++sample) { |
| 57 | list.push(test_record); |
| 58 | } |
| 59 | while (!list.empty()) { |
| 60 | list.pop(); |
| 61 | } |
| 62 | const uint64_t run_time = MdfHelper::NowNs() - start_time; |
| 63 | std::cout << "Queue Run Time (ms): " |
| 64 | << static_cast<double>(run_time) / 1'000'000 << std::endl; |
| 65 | } |
| 66 | std::cout << std::endl; |
| 67 | } |
| 68 | |
| 69 | TEST(TestQueueSpeed, ClearVector) { |
| 70 | constexpr size_t max_buffer = 10'000'000; |