data_buf_lable.hpp 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. #pragma once
  2. #include <iostream>
  3. #include <map>
  4. #include <chrono>
  5. #include <thread>
  6. #include <mutex>
  7. #include <opencv2/opencv.hpp>
  8. #include "proto/def.grpc.pb.h"
  9. template <class Type>
  10. class lockFunc {
  11. public:
  12. template<class Func, class ... Args>
  13. int lock_exe(Func func, Args&&... args) {
  14. lock.lock();
  15. bool ret = ((Type* )this->*func)(args...);
  16. lock.unlock();
  17. return ret;
  18. }
  19. template<class Func, class ... Args>
  20. int lock_exe(Func func, Type* p, Args&&... args) {
  21. lock.lock();
  22. bool ret = (p->*func)(args...);
  23. lock.unlock();
  24. return ret;
  25. }
  26. private:
  27. std::mutex lock;
  28. };
  29. class MatDataBuffer : public lockFunc<MatDataBuffer>{
  30. public:
  31. static MatDataBuffer *iter() {
  32. static MatDataBuffer *instance = nullptr;
  33. if (instance == nullptr) {
  34. instance = new MatDataBuffer();
  35. }
  36. return instance;
  37. }
  38. bool set(int azimuth, int lable, cv::Mat &mat) {
  39. if (azimuth >= DeviceAzimuth::DEVICE_AZIMUTH_MAX) {
  40. return false;
  41. }
  42. if (data[azimuth].size() > 100) {
  43. data[azimuth].erase(data[azimuth].begin());
  44. }
  45. data[azimuth].emplace_back(lable, mat);
  46. return true;
  47. }
  48. bool get(int azimuth, int lable, cv::Mat &mat, double timeout = 10) {
  49. if (azimuth >= DeviceAzimuth::DEVICE_AZIMUTH_MAX) {
  50. LOG(INFO) << "azimuth: " << azimuth << " < " << DeviceAzimuth::DEVICE_AZIMUTH_MAX;
  51. return false;
  52. }
  53. for (auto & iter : data[azimuth]) {
  54. if (iter.lable != lable) {
  55. LOG(INFO) << lable << " != " << iter.lable;
  56. continue;
  57. } else {
  58. std::chrono::duration<double> cost = std::chrono::steady_clock::now() - iter.t;
  59. if (cost.count() > timeout) {
  60. LOG(INFO) << "data is too old : " << cost.count() << "s";
  61. return false;
  62. } else {
  63. mat = iter.pointsMat.clone();
  64. return true;
  65. }
  66. }
  67. }
  68. LOG(INFO) << "Not found data: " << lable << " in device " << azimuth;
  69. return false;
  70. }
  71. private:
  72. struct DataBufferInfo {
  73. std::chrono::steady_clock::time_point t;
  74. int lable;
  75. cv::Mat pointsMat;
  76. DataBufferInfo(int lable_, cv::Mat &mat_) : lable(lable_), pointsMat(mat_.clone()) {
  77. t = std::chrono::steady_clock::now();
  78. }
  79. };
  80. private:
  81. std::vector<DataBufferInfo> data[DeviceAzimuth::DEVICE_AZIMUTH_MAX];
  82. };
  83. class LabelYoloDataBuffer : public lockFunc<LabelYoloDataBuffer> {
  84. public:
  85. static LabelYoloDataBuffer *iter() {
  86. static LabelYoloDataBuffer *instance = nullptr;
  87. if (instance == nullptr) {
  88. instance = new LabelYoloDataBuffer();
  89. }
  90. return instance;
  91. }
  92. bool set(JetStream::LabelYolo &yolo) {
  93. if (data.size() > 10) {
  94. data.pop();
  95. }
  96. data.push(yolo);
  97. return true;
  98. }
  99. bool get(JetStream::LabelYolo &yolo, double timeout = 10) {
  100. if (data.empty()) {
  101. return false;
  102. }
  103. yolo = data.front();
  104. data.pop();
  105. return true;
  106. }
  107. private:
  108. std::queue<JetStream::LabelYolo> data;
  109. };