his_location.h 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285
  1. #ifndef __INCLUDE_HIS_LOCATION_HPP
  2. #define __INCLUDE_HIS_LOCATION_HPP
  3. #include <complex>
  4. #include <queue>
  5. #include "point.h"
  6. #include "log.h"
  7. #include "db_api/CDBSingletonDefine.h"
  8. //速度
  9. //区域 地图变换
  10. //运动方向
  11. //路径变换
  12. struct location_card
  13. {
  14. location_card(uint32_t id,uint64_t type)
  15. :m_cardid(id)
  16. ,m_type(type)
  17. {
  18. init();
  19. }
  20. uint32_t m_cardid;//卡id
  21. uint16_t m_type;//卡类型
  22. double m_arg;//运动方向角度值
  23. int m_areaid;//区域
  24. int m_mapid;//地图
  25. uint64_t m_timestamp;//入库后的时间
  26. point m_p;//入库后的点
  27. struct mini_data
  28. {
  29. mini_data(const point &p,uint64_t t)
  30. :p(p)
  31. ,time(t)
  32. {}
  33. point p;
  34. uint64_t time;
  35. };
  36. std::queue<mini_data> m_d;
  37. void init()
  38. {
  39. m_areaid=-1;
  40. m_mapid=-1;
  41. m_timestamp=0;
  42. m_p.set(0,0);
  43. init_att();
  44. }
  45. void init_att()
  46. {
  47. m_arg=0x12345678;
  48. std::queue<mini_data> tmp;
  49. m_d.swap(tmp);
  50. }
  51. void set_invalid()
  52. {
  53. m_arg=0x12345678;
  54. }
  55. bool is_valid()
  56. {
  57. return m_arg!=0x12345678;
  58. }
  59. double make_arg(const point &pt,const point &p)
  60. {
  61. log_info("his_location arg[%d],(%.2f,%.2f)--->(%.2f,%.2f)---->(%.2f,%.2f)",m_cardid,m_p.x,m_p.y,p.x,p.y,pt.x,pt.y);
  62. return std::arg(std::complex<double>(pt.x,pt.y)-std::complex<double>(p.x,p.y));
  63. }
  64. void set(const point &pt,uint64_t time)
  65. {
  66. m_timestamp=time;
  67. m_p.set(pt);
  68. }
  69. bool line_changed(const point &pt)
  70. {
  71. if(!is_valid())
  72. return false;
  73. point p=m_d.back().p;
  74. //if(p==pt)return false;
  75. if(point::eq(p.x,pt.x,0.05) && point::eq(p.y,pt.y,0.05)) return false;
  76. double arg = make_arg(pt,p);
  77. log_info("his_location:line_changed:%d,%f,m_arg:%f,%s,%f",m_cardid,arg,m_arg, (arg-m_arg > -1e-10 && arg-m_arg<1e-10)?"same":"not same",m_arg-arg);
  78. return !point::eq(arg,m_arg,1e-10);
  79. }
  80. bool is_speed_changed(const point& pt,uint64_t time)
  81. {
  82. bool flag = false;
  83. double v=0.0;
  84. if(m_d.size()>=4)
  85. {
  86. mini_data d1 = m_d.front();
  87. double dist = d1.p.dist(pt);
  88. double t = time-d1.time;
  89. v = dist/t*1000;
  90. m_d.pop();
  91. }
  92. m_d.emplace(pt,time);
  93. if(v==0.0)
  94. return flag;
  95. double dist = m_p.dist(pt);
  96. double t = time - m_timestamp;
  97. double avge_speed= dist/t*1000;
  98. log_info("his_location cardid:%d:v:%.2f,avge_v:%.2f,(%.2f--%.2f)",m_cardid,v,avge_speed,0.8*avge_speed,1.2*avge_speed);
  99. if(v<(1-0.2)*avge_speed && v>(1+0.2)*avge_speed)
  100. flag=true;
  101. return flag;
  102. }
  103. bool time_out(const point &p,uint64_t time)
  104. {
  105. if(time-m_timestamp>=60*1000 && !(p == m_p))
  106. return true;
  107. return false;
  108. }
  109. bool is_area_changed(int new_areaid)
  110. {
  111. bool flag =false;
  112. if(m_areaid != new_areaid)
  113. {
  114. m_areaid = new_areaid;
  115. flag=true;
  116. }
  117. return flag;
  118. }
  119. bool is_map_changed(int new_mapid)
  120. {
  121. bool flag =false;
  122. if(m_mapid != new_mapid)
  123. {
  124. m_mapid = new_mapid;
  125. flag=true;
  126. }
  127. return flag;
  128. }
  129. void push(uint64_t timestamp,const point & p,int32_t areaid,int32_t mapid)
  130. {
  131. if(m_p.empty() || m_timestamp==0||m_areaid<=0||m_mapid<=0)
  132. {
  133. set(p,timestamp);
  134. m_areaid=areaid;m_mapid=mapid;
  135. m_d.emplace(p,timestamp);
  136. return;
  137. }
  138. if(!is_valid())
  139. {
  140. if(p==m_p)
  141. {
  142. init_att();set(p,timestamp);
  143. m_d.emplace(p,timestamp);
  144. return ;
  145. }
  146. m_arg=make_arg(p,m_p);
  147. log_info("his_location:%d arg:%f",m_cardid,m_arg);
  148. insert();
  149. }
  150. bool flag=false;
  151. bool iflag=false;
  152. flag=handle_message(p,timestamp);
  153. if(time_out(p,timestamp))
  154. if(!flag)iflag=true;
  155. if(is_speed_changed(p,timestamp))
  156. if(!flag)iflag=true;
  157. if(is_area_changed(areaid))
  158. if(!flag)iflag=true;
  159. if(is_map_changed(mapid))
  160. if(!flag)iflag=true;
  161. if(iflag)
  162. {
  163. update(p,timestamp);
  164. //set_invalid();
  165. set(p,timestamp);
  166. insert();
  167. }
  168. }
  169. virtual std::string getTabName()=0;
  170. void insert()
  171. {
  172. std::string tabName=getTabName();
  173. char nsql[512]={0};
  174. const char * sql = "replace into %s (card_id,begin_time,map_id,area_id,begin_pt,direction)values(%03d%010d,'%s',%d,%d,'%.2f,%.2f',%f);";
  175. snprintf(nsql,512,sql,tabName.c_str(),m_type,m_cardid,tool_time::to_str_ex(m_timestamp).c_str(),m_mapid,m_areaid,m_p.x,m_p.y,m_arg);
  176. log_info("his_location[%d]:%s",m_cardid,nsql);
  177. sDBConnPool.PushAsync(nsql);
  178. }
  179. void update(const point &p,uint64_t timestamp)
  180. {
  181. std::string tabName=getTabName();
  182. char nsql[512]={0};
  183. const char * sql = "update %s set last_time='%s',speed=%.2f where card_id=%03d%010d and begin_time='%s';";
  184. double dist = m_p.dist(p);
  185. double t = timestamp - m_timestamp;
  186. double avge_speed= dist/t*1000;
  187. if(std::isnan(avge_speed)|| std::isinf(avge_speed))avge_speed=0;
  188. snprintf(nsql,512,sql,tabName.c_str(),tool_time::to_str_ex(timestamp).c_str(),avge_speed,m_type,m_cardid,tool_time::to_str_ex(m_timestamp).c_str());
  189. log_info("his_location[%d]:%s",m_cardid,nsql);
  190. sDBConnPool.PushAsync(nsql);
  191. }
  192. virtual bool handle_message(const point &p,uint64_t timestamp)=0;
  193. };
  194. struct location_staff:location_card
  195. {
  196. location_staff(uint32_t id,uint16_t type)
  197. :location_card(id,type)
  198. {}
  199. virtual std::string getTabName(){return std::string{"his_location_staff_"};}
  200. //人员如果运行方向发生变化的话,需要求的拐点。如果有拐点,入拐点。时间大与120s则不做处理。没有拐点,则不求
  201. virtual bool handle_message(const point &p,uint64_t timestamp)
  202. {
  203. bool flag = false;
  204. if(line_changed(p))
  205. {
  206. log_info("his_location:line_changed %d",m_cardid);
  207. flag=true;
  208. if(timestamp-m_timestamp>120*1000)
  209. {
  210. log_info("his_location:line_changed_timeout %d",m_cardid);
  211. update(m_d.back().p,m_d.back().time);
  212. set(p,timestamp);
  213. }
  214. else
  215. {
  216. log_info("his_location:line_changed_find_path %d,(%.2f,%.2f)-->(%.2f,%.2f)-->(%.2f,%.2f)",m_cardid,m_p.x,m_p.y,m_d.back().p.x,m_d.back().p.y,p.x,p.y);
  217. std::vector<point> rc=card_path::inst().find_path(point(m_d.back().p.x,-m_d.back().p.y),point(p.x,-p.y));
  218. if(rc.empty())
  219. {
  220. log_info("his_location:line_changed rc.empty() %d",m_cardid);
  221. update(m_d.back().p,m_d.back().time);
  222. set(m_d.back().p,m_d.back().time);
  223. }
  224. else
  225. {
  226. for(uint32_t i=0;i<rc.size();i++)
  227. log_info("his_location:find_path..x=%.3lf,y=%.3lf\n",rc[i].x,rc[i].y);
  228. if(rc.size()==1)
  229. {
  230. log_info("his_location:line_changed %d circle point(%.2f,%.2f)",m_cardid,rc[0].x,rc[0].y);
  231. point tmp(rc[0].x,-rc[0].y);
  232. update(tmp,m_d.back().time);
  233. set(tmp,m_d.back().time);
  234. }
  235. else if(rc.size()==2)
  236. {
  237. point tmp(rc[0].x,-rc[0].y);
  238. update(tmp,m_d.back().time);
  239. set(tmp,m_d.back().time);
  240. //
  241. tmp.set(rc[1].x,-rc[1].y);
  242. m_arg=make_arg(tmp,m_p);
  243. insert();
  244. //
  245. update(tmp,timestamp);
  246. set(tmp,timestamp);
  247. }
  248. else//更多的拐点
  249. {
  250. point tmp(rc[0].x,-rc[0].y);
  251. update(tmp,m_d.back().time);
  252. tmp.set(rc.back().x,-rc.back().y);
  253. set(tmp,timestamp);
  254. }
  255. }
  256. }
  257. init_att();
  258. }
  259. return flag;
  260. }
  261. };
  262. struct location_vehicle:location_card
  263. {
  264. location_vehicle(uint32_t id,uint16_t type)
  265. :location_card(id,type)
  266. {}
  267. virtual std::string getTabName(){return std::string{"his_location_vehicle_"};}
  268. //车辆是有推送拐点的,所以不需要求拐点。如果运行方向发生变化的话,直接更新数据库即可,使用上一个点的时间。同时生成这一次的历史。
  269. virtual bool handle_message(const point &p,uint64_t timestamp)
  270. {
  271. bool flag =false;
  272. if(line_changed(p))
  273. {
  274. log_info("his_location:line_changed %d ",m_cardid);
  275. flag=true;
  276. update(m_d.back().p,m_d.back().time);
  277. set(m_d.back().p,m_d.back().time);init_att();
  278. }
  279. return flag;
  280. }
  281. };
  282. #endif