1
0

cardMgr.cpp 2.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  1. #include "cardMgr.h"
  2. #include "bindmorecard.h"
  3. #include "common.h"
  4. #include"common_tool.h"
  5. cardMgr::cardMgr()
  6. :m_queue(2048)
  7. ,m_bstop(false)
  8. {
  9. m_pThread.reset(new std::thread(std::bind(&cardMgr::run,this)));
  10. m_cf[0] = std::make_shared<CloserCardFactory>(this);
  11. m_cf[1] = std::make_shared<RemoteCardFactory>(this);
  12. }
  13. void cardMgr::run()
  14. {
  15. while(!m_bstop)
  16. {
  17. Msg m;
  18. m_queue.get(m);
  19. onMessage(m);
  20. }
  21. }
  22. void cardMgr::onMessage(const Msg &m)
  23. {
  24. switch(m.cmd)
  25. {
  26. case CMD_CLEAR:
  27. clear(m.cardid);
  28. break;
  29. case CMD_HANDLE:
  30. handleMessage(m);
  31. break;
  32. default:
  33. break;
  34. }
  35. }
  36. void cardMgr::clear(uint64_t cardid)
  37. {
  38. auto v = m_cgraph.getcard(cardid);
  39. for(const auto & cid:v)
  40. {
  41. uint64_t id = MyHash{}(cardid,cid);
  42. erase(id);
  43. m_cgraph.remove_edge(cardid,cid);
  44. }
  45. }
  46. void cardMgr::handleMessage(const Msg &m)
  47. {
  48. m_glist.update(m.x,m.y,m.cardid);
  49. if(tool_other::is_vehicle( m.type) ) return;
  50. std::vector<uint64_t> rc=m_glist.find_near(m.cardid,1);
  51. log_info("LemonHash+..%d,size:%d,(%d,%d)",m.cardid,rc.size(),m.x,m.y);
  52. std::map<uint64_t,std::string> map1;
  53. std::map<uint64_t,std::string> map2;
  54. for(int i = m_cf.size()-1;i>=0;i--)
  55. {
  56. map1.clear();map2.clear();
  57. map1=m_cf[i]->selectcard(rc,m.cardid);
  58. map2=m_cf[i]->setCT(m.cardid);
  59. std::copy(map1.begin(),map1.end(),std::inserter(map2,map2.end()));
  60. if (i == 1 && !map2.empty())
  61. erase(map2);
  62. if (!map2.empty())
  63. {
  64. for(const auto x:map2)
  65. log_info("---LemonHash----[%s]%s",i?"Remote":"Closer",x.second.c_str());
  66. //m_owner->uwb_alarm(map2,i,c);
  67. }
  68. if (!rc.empty())
  69. {
  70. std::string s ;
  71. s = m_cf[i]->InfoMessage();
  72. log_info("---LemonHash----[%s]%s",i?"Remote":"Closer",s.c_str());
  73. }
  74. }
  75. }
  76. void cardMgr::erase(const std::map<uint64_t,std::string> &m)
  77. {
  78. for(auto &p:m)
  79. erase(p.first);
  80. }
  81. void cardMgr::erase(uint64_t id)
  82. {
  83. for(const auto & t:m_cf)
  84. t->erase(id);
  85. }
  86. cardMgr::~cardMgr()
  87. {
  88. m_bstop = true;
  89. m_pThread->join();
  90. }
  91. cardMgr* cardMgr::instance()
  92. {
  93. static cardMgr cd;
  94. return &cd;
  95. }