his_location.h 7.7 KB

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