Fcln35x7.cs 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511
  1. using CP.Cache;
  2. using CP.Common;
  3. using CP.Model;
  4. using System;
  5. using System.Collections.Generic;
  6. using System.Linq;
  7. using System.Text;
  8. using System.Threading.Tasks;
  9. namespace CP.Business
  10. {
  11. public class Fcln35x7
  12. { /// <summary>
  13. /// 缓存
  14. /// </summary>
  15. static WMCache cache = WMCache.GetCacheService();
  16. /// <summary>
  17. /// cache中的深圳35x7所有数据
  18. /// </summary>
  19. /// <returns></returns>
  20. public static List<Fcln35x7Info> GetFcln35x7List()
  21. {
  22. string key = CacheKeys.FCLN35X7_DATALIST;
  23. List<Fcln35x7Info> list = cache.GetObject<List<Fcln35x7Info>>(key) as List<Fcln35x7Info>;
  24. if (list == null)
  25. {
  26. list = Fcln35x7Data.GetFcln35x7List();
  27. cache.AddObject(key, list, (int)CacheTime.Data);
  28. }
  29. return list;
  30. }
  31. /// <summary>
  32. /// 按条件筛选的35x7数据
  33. /// </summary>
  34. /// <param name="pagesize"></param>
  35. /// <param name="year"></param>
  36. /// <param name="sqi"></param>
  37. /// <param name="eqi"></param>
  38. /// <param name="week"></param>
  39. /// <returns></returns>
  40. public static List<Fcln35x7Info> GetFcln35x7List(ref List<Fcln35x7Info> datalist, int pagesize, int year, int sqi, int eqi, int week = 0)
  41. {
  42. List<Fcln35x7Info> list = new List<Fcln35x7Info>();
  43. ///星期x的条件时
  44. ///数据来源不一样.
  45. if (week > 0)
  46. list = GetFcln35x7WeekList(ref datalist, week);
  47. else
  48. {
  49. list = datalist;
  50. }
  51. List<Fcln35x7Info> rlist = new List<Fcln35x7Info>();
  52. if (list != null && list.Count > 0)
  53. {
  54. int size = list.Count;
  55. if (pagesize > 0)
  56. {
  57. for (int i = (size - pagesize); i < size; i++)
  58. {
  59. rlist.Add(list[i]);
  60. }
  61. return rlist;
  62. }
  63. if (year > 0)
  64. {
  65. rlist.Clear();
  66. for (int i = 0; i < size; i++)
  67. {
  68. if (TypeConverter.StrToInt(list[i].qi.ToString().Substring(0, 4), 0) == year)
  69. rlist.Add(list[i]);
  70. }
  71. return rlist;
  72. }
  73. if (sqi > 0 && eqi > 0)
  74. {
  75. rlist.Clear();
  76. int srank = GetFcln35x7Info(ref list, sqi).rank;
  77. int erank = GetFcln35x7Info(ref list, eqi).rank;
  78. if (erank != 0 && srank != 0 && erank > srank)
  79. {
  80. for (int i = srank - 1; i < erank && i < size; i++)
  81. {
  82. rlist.Add(list[i]);
  83. }
  84. }
  85. return rlist;
  86. }
  87. if (pagesize == 0 && year == 0 && eqi == 0 && sqi == 0 && week == 0)
  88. return list;
  89. }
  90. return rlist;
  91. }
  92. /// <summary>
  93. /// 35x7星期x的所有数据列表
  94. /// </summary>
  95. /// <param name="week"></param>
  96. /// <returns></returns>
  97. public static List<Fcln35x7Info> GetFcln35x7WeekList(ref List<Fcln35x7Info> list, int week)
  98. {
  99. List<Fcln35x7Info> rlist = new List<Fcln35x7Info>();
  100. if (list != null && list.Count > 0)
  101. {
  102. int size = list.Count;
  103. for (int i = 0; i < size; i++)
  104. {
  105. if (list[i].week == week)
  106. rlist.Add(list[i]);
  107. }
  108. }
  109. return rlist;
  110. }
  111. /// <summary>
  112. /// 取某一期的数据
  113. /// 根据期数值
  114. /// </summary>
  115. /// <param name="qi"></param>
  116. /// <returns></returns>
  117. public static Fcln35x7Info GetFcln35x7Info(ref List<Fcln35x7Info> list, int qi)
  118. {
  119. Fcln35x7Info info = new Fcln35x7Info();
  120. int size = list.Count;
  121. for (int i = 0; i < size; i++)
  122. {
  123. if (list[i].qi == qi)
  124. {
  125. info = list[i];
  126. break;
  127. }
  128. }
  129. return info;
  130. }
  131. /// <summary>
  132. /// 取出个排名的上一次数据
  133. /// </summary>
  134. /// <param name="rank"></param>
  135. /// <returns></returns>
  136. public static Fcln35x7Info GetLastFcln35x7Info(ref List<Fcln35x7Info> list, int rank)
  137. {
  138. Fcln35x7Info info = new Fcln35x7Info();
  139. if (list != null && list.Count > 0)
  140. {
  141. for (int i = rank - 2; i >= 0; i--)
  142. {
  143. if (list[i].rank == rank - 1)
  144. {
  145. info = list[i];
  146. return info;
  147. }
  148. }
  149. }
  150. return info;
  151. }
  152. /// <summary>
  153. /// 取出个排名的下一次数据, 用于开奖公告
  154. /// </summary>
  155. /// <param name="rank"></param>
  156. /// <returns></returns>
  157. public static Fcln35x7Info GetNextFcln35x7Info(ref List<Fcln35x7Info> list, int rank)
  158. {
  159. Fcln35x7Info info = new Fcln35x7Info();
  160. if (list != null && list.Count > 0)
  161. {
  162. for (int i = rank - 1; i < list.Count; i++)
  163. {
  164. if (list[i].rank == rank + 1)
  165. {
  166. info = list[i];
  167. return info;
  168. }
  169. }
  170. }
  171. return info;
  172. }
  173. #region 上一次出现时的情况
  174. /// <summary>
  175. /// 上次某个号码出现时的情况
  176. /// </summary>
  177. /// <param name="val"></param>
  178. /// <param name="rank"></param>
  179. /// <returns></returns>
  180. public static Fcln35x7Info GetLastFcln35x7Info(ref List<Fcln35x7Info> list, int val, int rank)
  181. {
  182. Fcln35x7Info info = new Fcln35x7Info();
  183. if (list != null && list.Count > 0)
  184. {
  185. int size = list.Count;
  186. for (int i = rank - 2; i >= 0; i--)
  187. {
  188. List<int> kjh = new List<int> { list[i].n1, list[i].n2, list[i].n3, list[i].n4, list[i].n5, list[i].n6, list[i].n7 };
  189. if (kjh.Contains(val))
  190. {
  191. info = list[i];
  192. return info;
  193. }
  194. }
  195. }
  196. return info;
  197. }
  198. /// <summary>
  199. /// 上一次和值val的数据
  200. /// </summary>
  201. /// <param name="val"></param>
  202. /// <param name="rank"></param>
  203. /// <returns></returns>
  204. public static Fcln35x7Info GetLastHzFcln35x7Info(ref List<Fcln35x7Info> list, int shz, int ehz, int rank)
  205. {
  206. Fcln35x7Info info = new Fcln35x7Info();
  207. if (list != null && list.Count > 0)
  208. {
  209. for (int i = rank - 2; i >= 0; i--)
  210. {
  211. if (list[i].hz >= shz && list[i].hz <= ehz)
  212. {
  213. info = list[i];
  214. return info;
  215. }
  216. }
  217. }
  218. return info;
  219. }
  220. /// <summary>
  221. /// 上一次和值奇偶形态的数据
  222. /// </summary>
  223. /// <param name="xt"></param>
  224. /// <param name="rank"></param>
  225. /// <returns></returns>
  226. public static Fcln35x7Info GetLastHzJoFcln35x7Info(ref List<Fcln35x7Info> list, int xt, int rank)
  227. {
  228. Fcln35x7Info info = new Fcln35x7Info();
  229. if (list != null && list.Count > 0)
  230. {
  231. for (int i = rank - 2; i >= 0; i--)
  232. {
  233. if (xt == 0)
  234. {
  235. if (list[i].hz % 2 != 0)
  236. {
  237. info = list[i];
  238. return info;
  239. }
  240. }
  241. if (xt == 1)
  242. {
  243. if (list[i].hz % 2 == 0)
  244. {
  245. info = list[i];
  246. return info;
  247. }
  248. }
  249. }
  250. }
  251. return info;
  252. }
  253. /// <summary>
  254. /// 上一其和尾val的数据
  255. /// </summary>
  256. /// <param name="val"></param>
  257. /// <param name="rank"></param>
  258. /// <returns></returns>
  259. public static Fcln35x7Info GetLastHwFcln35x7Info(ref List<Fcln35x7Info> list, int val, int rank)
  260. {
  261. Fcln35x7Info info = new Fcln35x7Info();
  262. if (list != null && list.Count > 0)
  263. {
  264. for (int i = rank - 2; i >= 0; i--)
  265. {
  266. if (ZstUtils.GetHw(list[i].hz) == val)
  267. {
  268. info = list[i];
  269. return info;
  270. }
  271. }
  272. }
  273. return info;
  274. }
  275. /// <summary>
  276. /// 上一次跨度val的数据
  277. /// </summary>
  278. /// <param name="val"></param>
  279. /// <param name="rank"></param>
  280. /// <returns></returns>
  281. public static Fcln35x7Info GetLastkdFcln35x7Info(ref List<Fcln35x7Info> list, int val, int rank)
  282. {
  283. Fcln35x7Info info = new Fcln35x7Info();
  284. if (list != null && list.Count > 0)
  285. {
  286. for (int i = rank - 2; i >= 0; i--)
  287. {
  288. if (list[i].kd == val)
  289. {
  290. info = list[i];
  291. return info;
  292. }
  293. }
  294. }
  295. return info;
  296. }
  297. /// <summary>
  298. /// 上一次跨度奇偶的情况
  299. /// </summary>
  300. /// <param name="xt"></param>
  301. /// <param name="rank"></param>
  302. /// <returns></returns>
  303. public static Fcln35x7Info GetLastKdJoFcln35x7Info(ref List<Fcln35x7Info> list, int xt, int rank)
  304. {
  305. Fcln35x7Info info = new Fcln35x7Info();
  306. if (list != null && list.Count > 0)
  307. {
  308. for (int i = rank - 2; i >= 0; i--)
  309. {
  310. if (xt == 0)
  311. {
  312. if (list[i].kd % 2 != 0)
  313. {
  314. info = list[i];
  315. return info;
  316. }
  317. }
  318. if (xt == 1)
  319. {
  320. if (list[i].kd % 2 == 0)
  321. {
  322. info = list[i];
  323. return info;
  324. }
  325. }
  326. }
  327. }
  328. return info;
  329. }
  330. /// <summary>
  331. /// 35x7上次跨度大小的情况
  332. /// </summary>
  333. /// <param name="xt"></param>
  334. /// <param name="rank"></param>
  335. /// <returns></returns>
  336. public static Fcln35x7Info GetLastKdDxFcln35x7Info(ref List<Fcln35x7Info> list, int xt, int rank)
  337. {
  338. Fcln35x7Info info = new Fcln35x7Info();
  339. if (list != null && list.Count > 0)
  340. {
  341. for (int i = rank - 2; i >= 0; i--)
  342. {
  343. if (xt == 0)
  344. {
  345. if (list[i].kd > 0)
  346. {
  347. info = list[i];
  348. return info;
  349. }
  350. }
  351. if (xt == 1)
  352. {
  353. if (list[i].kd < 21)
  354. {
  355. info = list[i];
  356. return info;
  357. }
  358. }
  359. }
  360. }
  361. return info;
  362. }
  363. /// <summary>
  364. /// 上次跨度质合的情况
  365. /// </summary>
  366. /// <param name="xt"></param>
  367. /// <param name="rank"></param>
  368. /// <returns></returns>
  369. public static Fcln35x7Info GetLastKdZhFcln35x7Info(ref List<Fcln35x7Info> list, int xt, int rank)
  370. {
  371. Fcln35x7Info info = new Fcln35x7Info();
  372. List<int> zh = new List<int> { 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36 };
  373. if (list != null && list.Count > 0)
  374. {
  375. for (int i = rank - 2; i >= 0; i--)
  376. {
  377. if (xt == 0)
  378. {
  379. if (!zh.Contains(list[i].kd))
  380. {
  381. info = list[i];
  382. return info;
  383. }
  384. }
  385. if (xt == 1)
  386. {
  387. if (zh.Contains(list[i].kd))
  388. {
  389. info = list[i];
  390. return info;
  391. }
  392. }
  393. }
  394. }
  395. return info;
  396. }
  397. #endregion
  398. /// <summary>
  399. /// 某期南粤35x7前N期的数据
  400. /// 用于计算南粤35x7基本号冷热情况
  401. /// </summary>
  402. /// <param name="rank">当前期的排名</param>
  403. /// <param name="pagesize">前n期</param>
  404. /// <returns></returns>
  405. public static List<int> GetFcln35x7HotList(ref List<Fcln35x7Info> list, int rank, int pagesize)
  406. {
  407. List<int> rlist = new List<int>();
  408. if (list != null && list.Count > 0)
  409. {
  410. int size = list.Count;
  411. for (int i = rank - 2; i >= (rank - pagesize - 1) && i >= 0; i--)
  412. {
  413. rlist.Add(list[i].n1);
  414. rlist.Add(list[i].n2);
  415. rlist.Add(list[i].n3);
  416. rlist.Add(list[i].n4);
  417. rlist.Add(list[i].n5);
  418. rlist.Add(list[i].n6);
  419. rlist.Add(list[i].n7);
  420. }
  421. }
  422. return rlist;
  423. }
  424. #region 开奖公告相关方法
  425. /// <summary>
  426. /// 南粤36选7最近30期开奖数据,完整开奖信息,有缓存
  427. /// </summary>
  428. /// <returns></returns>
  429. public static List<Fcln35x7LongInfo> GetFcln35x7ListTop30()
  430. {
  431. string key = string.Format(CacheKeys.FCSZFC35X7_KJH_DATA);
  432. List<Fcln35x7LongInfo> list = cache.GetObject<List<Fcln35x7LongInfo>>(key) as List<Fcln35x7LongInfo>;
  433. if (list == null)
  434. {
  435. list = Fcln35x7Data.GetFcln35x7Top30();
  436. cache.AddObject(key, list, (int)CacheTime.Kjh);
  437. }
  438. return list;
  439. }
  440. /// <summary>
  441. /// 获取最新一期开奖信息,完整开奖信息,有缓存
  442. /// </summary>
  443. /// <returns></returns>
  444. public static Fcln35x7LongInfo GetFcln35x7InfoTop1(ref List<Fcln35x7LongInfo> list)
  445. {
  446. Fcln35x7LongInfo info = new Fcln35x7LongInfo();
  447. if (list.Count > 0)
  448. {
  449. info = list[0];
  450. }
  451. return info;
  452. }
  453. /// <summary>
  454. /// 根据期数返回某期完整开奖信息,无缓存
  455. /// </summary>
  456. /// <param name="qi"></param>
  457. /// <returns></returns>
  458. public static Fcln35x7LongInfo GetFcln35x7InfoByqi(int qi)
  459. {
  460. return Fcln35x7Data.GetFcln35x7InfoByQi(qi);
  461. }
  462. /// <summary>
  463. /// 返回某年对应的期数列表,有缓存
  464. /// </summary>
  465. /// <param name="year"></param>
  466. /// <returns></returns>
  467. public static List<int> GetFcln35x7QiListByYear(int year)
  468. {
  469. string key = string.Format(CacheKeys.FCLN35X7_KJH_DATA + "/qilistbyyear/{0}", year);
  470. List<int> list = cache.GetObject<List<int>>(key) as List<int>;
  471. if (list == null)
  472. {
  473. list = Fcln35x7Data.GetFcln35x7QiListByYear(year);
  474. cache.AddObject(key, list, (int)CacheTime.System);
  475. }
  476. return list;
  477. }
  478. #endregion
  479. ///end
  480. }
  481. }