data_buf_lable.hpp 3.7 KB

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