bindmorecard.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403
  1. #ifndef BIND_MORE_CARD_HPP__
  2. #define BIND_MORE_CARD_HPP__
  3. #include <time.h>
  4. #include <thread>
  5. #include <chrono>
  6. #include <functional>
  7. #include <unordered_map>
  8. #include <mutex>
  9. #include <sstream>
  10. #include <map>
  11. #include <functional>
  12. #include "card.h"
  13. #include "zlist.h"
  14. #include "cardMgr.h"
  15. #include "log.h"
  16. #define TIME_WIN_MILLISEC (15*60*1000)
  17. #define TIME_LIM_SEC (3*1000)
  18. struct MyHash
  19. {
  20. typedef uint64_t result_type;
  21. result_type operator ()(uint64_t c1,uint64_t c2) const
  22. {
  23. std::string s;
  24. if(c1<c2)
  25. s = std::to_string(c1) + std::to_string(c2);
  26. else
  27. s = std::to_string(c2) + std::to_string(c1);
  28. result_type st1 = std::hash<std::string>{}(s);
  29. return st1;
  30. }
  31. };
  32. struct Data
  33. {
  34. Data(uint64_t ct)
  35. {
  36. reset();
  37. m_timestamp = ct;
  38. }
  39. void reset()
  40. {
  41. m_index = 0;
  42. m_ct.fill(0);
  43. m_totaldistance = 0;
  44. m_flag = false;
  45. }
  46. void increase(const int index)
  47. {
  48. m_ct[index]++;
  49. }
  50. uint32_t m_index;
  51. std::array<uint16_t,2> m_ct;
  52. double m_totaldistance;
  53. uint64_t m_timestamp;
  54. bool m_flag;
  55. };
  56. struct TcardInterface
  57. {
  58. // TcardInterface()=default;
  59. TcardInterface(std::pair<uint64_t,uint64_t> sp,uint64_t ct,uint64_t owner,int size)
  60. :m_cardid(sp)
  61. ,m_timestamp(ct)
  62. ,m_owner(owner)
  63. ,SIZE(size)
  64. {}
  65. std::tuple<bool,std::string> setindex(uint64_t tsp,const uint64_t cid,const double d=0,bool ctflag =false)
  66. {
  67. bool flag = false;
  68. assert(m_timestamp != 0||tsp != 0);
  69. std::tuple<bool,std::string> stp(flag,"");
  70. if (empty())
  71. grow(tsp);
  72. uint64_t tmp_tsp_min = back(0).m_timestamp;
  73. uint64_t tmp_tsp_max = back(0).m_timestamp + TIME_WIN_MILLISEC;
  74. //assert(tsp >= tmp_tsp_min);
  75. do
  76. {
  77. if(tsp>=tmp_tsp_min && tsp < tmp_tsp_max)
  78. {
  79. if(!ctflag)
  80. {
  81. back(0).m_index++;
  82. back(0).m_totaldistance+=d;
  83. }
  84. else
  85. {
  86. int arrindex = getstrindex(cid);
  87. if(arrindex == -1)
  88. {
  89. log_error("bindmorecard error.not match the cardid");
  90. return stp;
  91. }
  92. back(0).increase(arrindex);
  93. }
  94. break;
  95. }
  96. else
  97. {
  98. if(timeout())
  99. {
  100. auto tp = get();
  101. stp = check(std::get<0>(tp),std::get<1>(tp));
  102. skip(1);
  103. }
  104. grow(tsp);
  105. tmp_tsp_min = back(0).m_timestamp;
  106. tmp_tsp_max = back(0).m_timestamp + TIME_WIN_MILLISEC;
  107. }
  108. }while(1);
  109. return stp;
  110. }
  111. std::tuple<bool,std::string> checkLast()
  112. {
  113. // std::tuple<bool,std::string> stp(false,std::string(""));
  114. // if (!timeout() && size()>=ConfStruct::getCs().remote_slot)
  115. // {
  116. // auto tp = get();
  117. // stp = check(std::get<0>(tp),std::get<1>(tp));
  118. // }
  119. // return stp;
  120. return std::make_tuple(false,"");
  121. }
  122. void skip(int count)
  123. {
  124. for(int i =0;i<count&&i<size();i++)
  125. m_arr.pop_front();
  126. }
  127. bool empty()
  128. {
  129. return m_arr.empty();
  130. }
  131. int size()
  132. {
  133. return m_arr.size();
  134. }
  135. void grow(uint64_t ct)
  136. {
  137. Data d(ct);
  138. d.reset();
  139. m_arr.push_back(d);
  140. }
  141. Data &back(int index)
  142. {
  143. assert(index<(int)size() && index >= 0);
  144. return m_arr.at(size()-index-1);
  145. }
  146. std::tuple<int,int,double> get()
  147. {
  148. int total_ix=0,total_ct=0;
  149. double dis = 0;
  150. std::for_each(m_arr.begin(),m_arr.end(),[&total_ix,&total_ct,&dis](const Data &d){total_ix += d.m_index;total_ct+=(d.m_ct[0]+d.m_ct[1]);dis+=d.m_totaldistance;});
  151. return std::make_tuple(total_ix,total_ct,dis);
  152. }
  153. bool timeout()
  154. {
  155. return size() == SIZE-1;
  156. }
  157. std::string getInfo_1()
  158. {
  159. std::stringstream ss;
  160. ss<<m_cardid.first<<"&"<<m_cardid.second<<","<<m_arr[0].m_timestamp/1000<<","<<(back(0).m_timestamp+TIME_WIN_MILLISEC)/1000 <<",";
  161. std::for_each(m_arr.begin(),m_arr.end(),[&ss](Data& d){
  162. if (!d.m_flag)
  163. {
  164. ss<<d.m_timestamp/1000<<"&"<<d.m_totaldistance<<"&"<<d.m_index<<",";
  165. d.m_flag = true;
  166. }
  167. });
  168. return ss.str();
  169. }
  170. std::string getInfo()
  171. {
  172. auto tp = get();
  173. std::stringstream ss;
  174. ss<<"{T:"<<std::get<0>(tp)<<","<<std::get<1>(tp)<<","<<std::get<2>(tp)<<"}";
  175. //ss<<"{Total index:"<<std::get<0>(tp)<<","<<std::get<1>(tp)<<"},";
  176. //m_arr.for_each([&ss](const Data&x){
  177. // ss<<"["<<x.m_index<<","<<x.m_ct[0]+x.m_ct[1]<<"]";
  178. //});
  179. return std::move(ss.str());
  180. }
  181. inline std::tuple<bool,std::string> check(int index,int ct)
  182. {
  183. if(index*1.0/ct>=0.72)
  184. {
  185. std::string s = getInfo_1();
  186. return std::make_tuple(true,s);
  187. }
  188. return std::make_tuple(false,std::string(""));
  189. }
  190. inline int getstrindex(const uint64_t cardid)
  191. {
  192. if(m_cardid.first == cardid)
  193. return 0;
  194. else
  195. return 1;
  196. return -1;
  197. }
  198. public:
  199. std::pair<uint64_t,uint64_t> m_cardid;
  200. uint64_t m_timestamp;
  201. uint64_t m_owner;
  202. std::deque<Data> m_arr;
  203. int SIZE;
  204. virtual ~TcardInterface(){}
  205. };
  206. struct CardFactory
  207. {
  208. CardFactory(cardMgr*owner)
  209. :m_owner(owner)
  210. {}
  211. std::map<uint64_t,std::string> setCT(uint64_t cid)
  212. {
  213. std::map<uint64_t,std::string> tmpvec;
  214. auto opcard=card_list::instance()->get(cid);
  215. uint64_t cttime = opcard->time_();
  216. auto vec = m_owner->getcard(cid);
  217. for(const auto cardid:vec)
  218. {
  219. uint64_t id = MyHash{}(cardid,cid);
  220. auto iter = m_map.find(id);
  221. if(iter != m_map.end())
  222. {
  223. std::shared_ptr<TcardInterface> ptr = iter->second;
  224. auto sp = ptr->setindex(cttime,cid,0,true);
  225. if (std::get<0>(sp))
  226. {
  227. tmpvec.insert(std::make_pair(id,std::get<1>(sp)));
  228. }
  229. }
  230. }
  231. return std::move(tmpvec);
  232. }
  233. std::map<uint64_t,std::string> handlecard(const std::vector<uint64_t>& vec,uint64_t cid)
  234. {
  235. std::map<uint64_t,std::string> tempvec;
  236. auto opcard = card_list::instance()->get(cid);
  237. uint64_t cttime = opcard->time_();
  238. std::shared_ptr<TcardInterface> ptr = nullptr;
  239. for(const auto cardid:vec)
  240. {
  241. uint64_t id = MyHash{}(cardid,cid);
  242. auto iter = m_map.find(id);
  243. if(iter != m_map.end())
  244. ptr = iter->second;
  245. else
  246. {
  247. log_info("handlecard..%lld,%lld,%lld",id,cardid,cid);
  248. ptr = make_shared_(cardid,cid,cttime,id);
  249. m_map.insert({id,ptr});
  250. backup(cid,cardid);
  251. }
  252. auto npcard=card_list::instance()->get(cardid);
  253. double dis = opcard->dist(*npcard);
  254. auto sp=ptr->setindex(cttime,cid,dis);
  255. if (std::get<0>(sp))
  256. {
  257. tempvec.insert(std::make_pair(id,std::get<1>(sp)));
  258. }
  259. }
  260. return std::move(tempvec);
  261. }
  262. void erase(uint64_t id)
  263. {
  264. auto it = m_map.find(id);
  265. if(it != m_map.end())
  266. {
  267. std::pair<uint64_t,uint64_t> p = it->second->m_cardid;
  268. m_owner->remove_edge(p.first,p.second);
  269. reset(id);
  270. m_map.erase(it);
  271. }
  272. }
  273. inline std::string InfoMessage()
  274. {
  275. std::stringstream ss;
  276. ss<<"S: "<<m_map.size();
  277. for(auto it : m_map)
  278. {
  279. //ss<< " hash info["<<it.first <<"]first cardid:["<<it.second->m_cardid.first<<"]second cardid:["<<it.second->m_cardid.second<<"]Info:{total_size:"<<it.second->size()<<","<<it.second->getInfo()<<"}";
  280. ss<< "["<<(uint32_t)(it.second->m_cardid.first)<<"]["<<(uint32_t)(it.second->m_cardid.second)<<"]{s:"<<it.second->size()<<","<<it.second->getInfo()<<"}";
  281. }
  282. return std::move(ss.str());
  283. }
  284. virtual std::map<uint64_t,std::string> selectcard(std::vector<uint64_t> &v,uint64_t cid) = 0;
  285. virtual std::shared_ptr<TcardInterface> make_shared_(const uint64_t cid1,const uint64_t cid2,const uint64_t ctime,uint64_t key) = 0;
  286. virtual void backup (uint64_t cid1,uint64_t cid2){}
  287. virtual void reset (uint64_t cid){}
  288. virtual std::tuple<bool,std::string> checkLast(std::shared_ptr<TcardInterface> &ti)=0;
  289. virtual ~CardFactory(){}
  290. public:
  291. std::unordered_map<uint64_t,std::shared_ptr<TcardInterface>> m_map;
  292. cardMgr * m_owner;
  293. };
  294. struct CloserCardFactory : CardFactory
  295. {
  296. CloserCardFactory(cardMgr*);
  297. int m_closer_slot=0;
  298. std::map<uint64_t,int> m_count;
  299. bool getAccess(uint64_t cid1,uint64_t cid2)
  300. {
  301. uint64_t cid = MyHash{}(cid1,cid2);
  302. if(m_count[cid] < 600)
  303. {
  304. m_count[cid]++;
  305. return false;
  306. }
  307. else
  308. return true;
  309. }
  310. void reset(uint64_t id)
  311. {
  312. auto it = m_count.find(id);
  313. if(it != m_count.end())
  314. m_count.erase(it);
  315. }
  316. virtual std::map<uint64_t,std::string> selectcard(std::vector<uint64_t> &v,uint64_t cid)
  317. {
  318. std::map<uint64_t,std::string> vec;
  319. if(v.empty()) return vec;
  320. std::vector<uint64_t> rc(v.begin(),v.end());
  321. auto opcard=card_list::instance()->get(cid);
  322. rc.erase(std::remove_if(rc.begin(),rc.end(),[&](uint64_t cardid){
  323. if(!getAccess(cid,cardid))
  324. return true;
  325. if(cardid == cid)
  326. return true;
  327. auto npcard = card_list::instance()->get(cardid);
  328. if(npcard->type_()!=opcard->type_())
  329. return true;
  330. uint64_t ct1 = npcard->time_();
  331. uint64_t ct2 = opcard->time_();
  332. uint64_t ct3 = ct1>ct2?ct1-ct2:ct2-ct1;
  333. return ct3 > TIME_LIM_SEC;
  334. }),rc.end());
  335. vec = handlecard(rc,cid);
  336. return std::move(vec);
  337. }
  338. virtual void backup (uint64_t cid1,uint64_t cid2)
  339. {
  340. m_owner->addVertex(cid1,cid2);
  341. }
  342. virtual std::shared_ptr<TcardInterface> make_shared_(const uint64_t cid1,const uint64_t cid2,const uint64_t ctime,uint64_t key)
  343. {
  344. return std::make_shared<TcardInterface>(std::make_pair(cid1,cid2),ctime,key,m_closer_slot);
  345. }
  346. std::tuple<bool,std::string> checkLast(std::shared_ptr<TcardInterface> &ti)
  347. {
  348. return ti->checkLast();
  349. }
  350. };
  351. struct RemoteCardFactory : CardFactory
  352. {
  353. RemoteCardFactory(cardMgr*);
  354. int m_remote_slot=0;
  355. virtual std::map<uint64_t,std::string> selectcard(std::vector<uint64_t> &ov,uint64_t cid)
  356. {
  357. auto vcard=m_owner->getcard(cid);
  358. log_info("%d....remote%d",vcard.size(),(vcard.empty()?0:vcard[0]));
  359. std::sort(vcard.begin(),vcard.end());
  360. std::sort(ov.begin(),ov.end());
  361. std::vector<uint64_t> v(ov.size()+vcard.size());
  362. auto it = std::set_difference(vcard.begin(),vcard.end(),ov.begin(),ov.end(),v.begin());
  363. v.resize(it-v.begin());
  364. auto opcard = card_list::instance()->get(cid);
  365. v.erase(std::remove_if(v.begin(),v.end(),[&](uint64_t cardid){
  366. auto npcard = card_list::instance()->get(cardid);
  367. uint64_t ct1 = opcard->time_();
  368. uint64_t ct2 = npcard->time_();
  369. uint64_t ct3 = ct1>ct2?ct1-ct2:ct2-ct1;
  370. return ct3 > TIME_LIM_SEC;
  371. }),v.end());
  372. auto vec = handlecard(v,cid);
  373. return std::move(vec);
  374. }
  375. virtual std::shared_ptr<TcardInterface> make_shared_(const uint64_t cid1,const uint64_t cid2,const uint64_t ctime,uint64_t key)
  376. {
  377. return std::make_shared<TcardInterface>(std::make_pair(cid1,cid2),ctime,key,m_remote_slot);
  378. }
  379. std::tuple<bool,std::string> checkLast(std::shared_ptr<TcardInterface> &ti)
  380. {
  381. return std::make_tuple(false,std::string(""));
  382. }
  383. };
  384. #endif