Fcssq.cs 48 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535
  1. using System;
  2. using System.Collections.Generic;
  3. using CP.Cache;
  4. using CP.Common;
  5. using CP.Model;
  6. using System.Linq;
  7. namespace CP.Business
  8. {
  9. /// <summary>
  10. /// 福彩双色球逻辑操作类
  11. /// sam
  12. /// </summary>
  13. public class Fcssq
  14. {
  15. /// <summary>
  16. /// 缓存
  17. /// </summary>
  18. static WMCache cache = WMCache.GetCacheService();
  19. #region 尾数分布
  20. /// <summary>
  21. /// 上一期尾数的数据
  22. /// </summary>
  23. /// <param name="val"></param>
  24. /// <param name="rank"></param>
  25. /// <returns></returns>
  26. public static FcssqInfo GetWsFcssqInfo(ref List<FcssqInfo> list, int val, int rank)
  27. {
  28. FcssqInfo info = new FcssqInfo();
  29. if (list != null && list.Count > 0)
  30. {
  31. for (int i = rank - 2; i >= 0; i--)
  32. {
  33. int[] ws = { list[i].n1 % 10, list[i].n2 % 10, list[i].n3 % 10, list[i].n4 % 10, list[i].n5 % 10, list[i].n6 % 10 };
  34. if (ws.Contains(val))
  35. {
  36. info = list[i];
  37. return info;
  38. }
  39. }
  40. }
  41. return info;
  42. }
  43. /// <summary>
  44. /// 上一期尾数的数据
  45. /// </summary>
  46. /// <param name="val"></param>
  47. /// <param name="rank"></param>
  48. /// <returns></returns>
  49. public static FcssqInfo GetWsfbFcssqInfo(ref List<FcssqInfo> list, int val, int rank)
  50. {
  51. FcssqInfo info = new FcssqInfo();
  52. if (list != null && list.Count > 0)
  53. {
  54. for (int i = rank - 2; i >= 0; i--)
  55. {
  56. List<int> kjh = new List<int> { list[i].n1, list[i].n2, list[i].n3, list[i].n4, list[i].n5, list[i].n6 };
  57. if (kjh.Contains(val))
  58. {
  59. info = list[i];
  60. return info;
  61. }
  62. }
  63. }
  64. return info;
  65. }
  66. #endregion
  67. #region 最近n期形态=x的数据列表
  68. /// <summary>
  69. /// 所有范围在shz和ehz之间的数据列表
  70. /// </summary>
  71. /// <param name="shz"></param>
  72. /// <param name="ehz"></param>
  73. /// <returns></returns>
  74. public static List<FcssqInfo> GetFcssqListByHz(ref List<FcssqInfo> list,int shz, int ehz)
  75. {
  76. List<FcssqInfo> rlist = new List<FcssqInfo>();
  77. if (list != null && list.Count > 0)
  78. {
  79. int size = list.Count;
  80. for (int i = 0; i < size; i++)
  81. {
  82. if (list[i].hz >= shz && list[i].hz <= ehz)
  83. rlist.Add(list[i]);
  84. }
  85. }
  86. return rlist;
  87. }
  88. /// <summary>
  89. /// 所有蓝号=blue的数据
  90. /// </summary>
  91. /// <param name="blue"></param>
  92. /// <returns></returns>
  93. public static List<FcssqInfo> GetFcssqListByBlue(ref List<FcssqInfo> list, int blue)
  94. {
  95. List<FcssqInfo> rlist = new List<FcssqInfo>();
  96. if (list != null && list.Count > 0)
  97. {
  98. int size = list.Count;
  99. for (int i = 0; i < size; i++)
  100. {
  101. if (list[i].n7 == blue)
  102. rlist.Add(list[i]);
  103. }
  104. }
  105. return rlist;
  106. }
  107. /// <summary>
  108. /// 所有红球中包括 red的数据
  109. /// </summary>
  110. /// <param name="red"></param>
  111. /// <returns></returns>
  112. public static List<FcssqInfo> GetFcssqListByRed(ref List<FcssqInfo> list,int red)
  113. {
  114. List<FcssqInfo> rlist = new List<FcssqInfo>();
  115. if (list != null && list.Count > 0)
  116. {
  117. int size = list.Count;
  118. for (int i = 0; i < size; i++)
  119. {
  120. List<int> kjh = new List<int>() { list[i].n1, list[i].n2, list[i].n3, list[i].n4, list[i].n5, list[i].n6 };
  121. if (kjh.Contains(red))
  122. rlist.Add(list[i]);
  123. }
  124. }
  125. return rlist;
  126. }
  127. #endregion
  128. #region 取出某个info的某个区间的个数
  129. /// <summary>
  130. /// 取出某个info的某个区间的个数
  131. /// </summary>
  132. /// <param name="info"></param>
  133. /// <param name="qj"></param>
  134. /// <returns></returns>
  135. public static int GetSsqRedQjCount(FcssqInfo info, int qj)
  136. {
  137. List<int> kjh = new List<int> { info.n1, info.n2, info.n3, info.n4, info.n5, info.n6 };
  138. int[] sqb = { 0, 0, 0 };
  139. for (int j = 1; j < 12; j++)
  140. {
  141. if (kjh.Contains(j))
  142. sqb[0]++;
  143. }
  144. for (int j = 12; j < 23; j++)
  145. {
  146. if (kjh.Contains(j))
  147. sqb[1]++;
  148. }
  149. for (int j = 23; j < 34; j++)
  150. {
  151. if (kjh.Contains(j))
  152. sqb[2]++;
  153. }
  154. if (qj == 1)
  155. return sqb[0];
  156. if (qj == 2)
  157. return sqb[1];
  158. if (qj == 3)
  159. return sqb[2];
  160. return 0;
  161. }
  162. #endregion
  163. #region 某个值/状态上一期的情况
  164. /// <summary>
  165. /// 红球某个区间上一次个数为count的数据
  166. /// </summary>
  167. /// <param name="qj"></param>
  168. /// <param name="count"></param>
  169. /// <param name="rank"></param>
  170. /// <returns></returns>
  171. public static FcssqInfo GetLastQjCountFcssqInfo(ref List<FcssqInfo> list,int qj, int count, int rank)
  172. {
  173. FcssqInfo info = new FcssqInfo();
  174. if (list != null && list.Count > 0)
  175. {
  176. int size = list.Count;
  177. for (int i = rank - 2; i >= 0; i--)
  178. {
  179. int[] sqb = { 0, 0, 0 };
  180. List<int> kjh = new List<int> { list[i].n1, list[i].n2, list[i].n3, list[i].n4, list[i].n5, list[i].n6 };
  181. for (int j = 1; j < 12; j++)
  182. {
  183. if (kjh.Contains(j))
  184. sqb[0]++;
  185. }
  186. for (int j = 12; j < 23; j++)
  187. {
  188. if (kjh.Contains(j))
  189. sqb[1]++;
  190. }
  191. for (int j = 23; j < 34; j++)
  192. {
  193. if (kjh.Contains(j))
  194. sqb[2]++;
  195. }
  196. if (qj == 1 && sqb[0] == count)
  197. {
  198. return list[i];
  199. }
  200. if (qj == 2 && sqb[1] == count)
  201. {
  202. return list[i];
  203. }
  204. if (qj == 3 && sqb[2] == count)
  205. {
  206. return list[i];
  207. }
  208. }
  209. }
  210. return info;
  211. }
  212. /// <summary>
  213. /// 某个红球(红1 2 3 4 5 6)五行状态的上一次数据
  214. /// </summary>
  215. /// <param name="redsite"></param>
  216. /// <param name="rank"></param>
  217. /// <returns></returns>
  218. public static FcssqInfo GetLastWxFcssqInfo(ref List<FcssqInfo> list,int redsite, int val, int rank)
  219. {
  220. FcssqInfo info = new FcssqInfo();
  221. if (list != null && list.Count > 0)
  222. {
  223. //五行分布
  224. List<int> xj = new List<int> { 9, 10, 21, 22, 33 };
  225. List<int> xm = new List<int> { 3, 4, 15, 16, 27, 28 };
  226. List<int> xs = new List<int> { 1, 12, 13, 24, 25 };
  227. List<int> xh = new List<int> { 6, 7, 18, 19, 30, 31 };
  228. List<int> xt = new List<int> { 2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32 };
  229. for (int i = rank - 2; i >= 0; i--)
  230. {
  231. List<int> red = new List<int> { list[i].n1, list[i].n2, list[i].n3, list[i].n4, list[i].n5, list[i].n6 };
  232. for (int j = 0; j < 6; j++)
  233. {
  234. if (xj.Contains(red[redsite]) && val == 0)
  235. return list[i];
  236. if (xm.Contains(red[redsite]) && val == 1)
  237. return list[i];
  238. if (xs.Contains(red[redsite]) && val == 2)
  239. return list[i];
  240. if (xh.Contains(red[redsite]) && val == 3)
  241. return list[i];
  242. if (xt.Contains(red[redsite]) && val == 4)
  243. return list[i];
  244. }
  245. }
  246. }
  247. return info;
  248. }
  249. #region 和尾相关
  250. /// <summary>
  251. /// 上一其和尾val的数据
  252. /// </summary>
  253. /// <param name="val"></param>
  254. /// <param name="rank"></param>
  255. /// <returns></returns>
  256. public static FcssqInfo GetLastHwFcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  257. {
  258. FcssqInfo info = new FcssqInfo();
  259. if (list != null && list.Count > 0)
  260. {
  261. for (int i = rank - 2; i >= 0; i--)
  262. {
  263. if (list[i].hw == val)
  264. {
  265. info = list[i];
  266. return info;
  267. }
  268. }
  269. }
  270. return info;
  271. }
  272. /// <summary>
  273. /// 上一次和尾奇偶形态的数据
  274. /// </summary>
  275. /// <param name="xt"></param>
  276. /// <param name="rank"></param>
  277. /// <returns></returns>
  278. public static FcssqInfo GetLastHwJoFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  279. {
  280. FcssqInfo info = new FcssqInfo();
  281. if (list != null && list.Count > 0)
  282. {
  283. for (int i = rank - 2; i >= 0; i--)
  284. {
  285. if (xt == 0)
  286. {
  287. if (list[i].hw % 2 != 0)
  288. {
  289. info = list[i];
  290. return info;
  291. }
  292. }
  293. if (xt == 1)
  294. {
  295. if (list[i].hw % 2 == 0)
  296. {
  297. info = list[i];
  298. return info;
  299. }
  300. }
  301. }
  302. }
  303. return info;
  304. }
  305. /// <summary>
  306. /// 上一次和尾为大/小形态的数据
  307. /// </summary>
  308. /// <param name="xt">0=小;1=大</param>
  309. /// <param name="rank"></param>
  310. /// <returns></returns>
  311. public static FcssqInfo GetLastHwDxFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  312. {
  313. FcssqInfo info = new FcssqInfo();
  314. int size = list.Count;
  315. for (int i = rank - 2; i >= 0; i--)
  316. {
  317. if (xt == 0)
  318. {
  319. if (list[i].hw < 5)
  320. {
  321. info = list[i];
  322. return info;
  323. }
  324. }
  325. if (xt == 1)
  326. {
  327. if (list[i].hw > 4)
  328. {
  329. info = list[i];
  330. return info;
  331. }
  332. }
  333. }
  334. return info;
  335. }
  336. /// <summary>
  337. /// 和尾求质合形态的上一次情况
  338. /// </summary>
  339. /// <param name="xt">0为合 1为质</param>
  340. /// <param name="rank"></param>
  341. /// <returns></returns>
  342. public static FcssqInfo GetLastHwZhFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  343. {
  344. FcssqInfo info = new FcssqInfo();
  345. int size = list.Count;
  346. List<int> z = new List<int> { 1, 2, 3, 5, 7 };
  347. List<int> h = new List<int> { 0, 4, 6, 8, 9 };
  348. for (int i = rank - 2; i >= 0; i--)
  349. {
  350. if (xt == 0)
  351. {
  352. if (h.Contains(list[i].hw))
  353. {
  354. info = list[i];
  355. return info;
  356. }
  357. }
  358. if (xt == 1)
  359. {
  360. if (z.Contains(list[i].hw))
  361. {
  362. info = list[i];
  363. return info;
  364. }
  365. }
  366. }
  367. return info;
  368. }
  369. /// <summary>
  370. /// 上一次和尾为012路形态的数据
  371. /// </summary>
  372. /// <param name="xt">0=0路;1=1路;2=2路</param>
  373. /// <param name="rank"></param>
  374. /// <returns></returns>
  375. public static FcssqInfo GetLastHw012FcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  376. {
  377. FcssqInfo info = new FcssqInfo();
  378. int size = list.Count;
  379. for (int i = rank - 2; i >= 0; i--)
  380. {
  381. if (xt == 0)
  382. {
  383. if (list[i].hw % 3 == 0)
  384. {
  385. info = list[i];
  386. return info;
  387. }
  388. }
  389. if (xt == 1)
  390. {
  391. if (list[i].hw % 3 == 1)
  392. {
  393. info = list[i];
  394. return info;
  395. }
  396. }
  397. if (xt == 2)
  398. {
  399. if (list[i].hw % 3 == 2)
  400. {
  401. info = list[i];
  402. return info;
  403. }
  404. }
  405. }
  406. return info;
  407. }
  408. /// <summary>
  409. /// 和尾振幅的上一次数据
  410. /// </summary>
  411. /// <param name="zf"></param>
  412. /// <param name="rank"></param>
  413. /// <returns></returns>
  414. public static FcssqInfo GetLastHwZfInfo(ref List<FcssqInfo> list,int zf, int rank)
  415. {
  416. FcssqInfo info = new FcssqInfo();
  417. int size = list.Count;
  418. for (int i = rank - 2; i >= 0; i--)
  419. {
  420. if (i > 0)
  421. {
  422. if (Math.Abs(list[i].hw - list[i - 1].hw) == zf)
  423. {
  424. info = list[i];
  425. return info;
  426. }
  427. }
  428. }
  429. return info;
  430. }
  431. #endregion
  432. #region 跨度相关
  433. /// <summary>
  434. /// 双色球上一次跨度val的数据
  435. /// </summary>
  436. /// <param name="val"></param>
  437. /// <param name="rank"></param>
  438. /// <returns></returns>
  439. public static FcssqInfo GetLastQkdFcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  440. {
  441. FcssqInfo info = new FcssqInfo();
  442. if (list != null && list.Count > 0)
  443. {
  444. for (int i = rank - 2; i >= 0; i--)
  445. {
  446. if (list[i].kd == val)
  447. {
  448. info = list[i];
  449. return info;
  450. }
  451. }
  452. }
  453. return info;
  454. }
  455. /// <summary>
  456. /// 双色球跨度奇偶 上一次
  457. /// </summary>
  458. /// <param name="xt"></param>
  459. /// <param name="rank"></param>
  460. /// <returns></returns>
  461. public static FcssqInfo GetLastQkdJoFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  462. {
  463. FcssqInfo info = new FcssqInfo();
  464. if (list != null && list.Count > 0)
  465. {
  466. for (int i = rank - 2; i >= 0; i--)
  467. {
  468. if (xt == 0)
  469. {
  470. if (list[i].kd % 2 != 0)
  471. {
  472. info = list[i];
  473. return info;
  474. }
  475. }
  476. if (xt == 1)
  477. {
  478. if (list[i].kd % 2 == 0)
  479. {
  480. info = list[i];
  481. return info;
  482. }
  483. }
  484. }
  485. }
  486. return info;
  487. }
  488. /// <summary>
  489. /// 双色球跨度大小 前一次情况
  490. /// </summary>
  491. /// <param name="xt"></param>
  492. /// <param name="rank"></param>
  493. /// <returns></returns>
  494. public static FcssqInfo GetLastQkdDxFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  495. {
  496. FcssqInfo info = new FcssqInfo();
  497. if (list != null && list.Count > 0)
  498. {
  499. for (int i = rank - 2; i >= 0; i--)
  500. {
  501. if (xt == 0)
  502. {
  503. if (list[i].kd > 18)
  504. {
  505. info = list[i];
  506. return info;
  507. }
  508. }
  509. if (xt == 1)
  510. {
  511. if (list[i].kd < 19)
  512. {
  513. info = list[i];
  514. return info;
  515. }
  516. }
  517. }
  518. }
  519. return info;
  520. }
  521. /// <summary>
  522. /// 双色球跨度质合 前一次情况
  523. /// </summary>
  524. /// <param name="xt"></param>
  525. /// <param name="rank"></param>
  526. /// <returns></returns>
  527. public static FcssqInfo GetLastQkdZhFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  528. {
  529. FcssqInfo info = new FcssqInfo();
  530. if (list != null && list.Count > 0)
  531. {
  532. for (int i = rank - 2; i >= 0; i--)
  533. {
  534. if (xt == 0)
  535. {
  536. if (ZstUtils.GetZh(list[i].kd) == 0)
  537. {
  538. info = list[i];
  539. return info;
  540. }
  541. }
  542. if (xt == 1)
  543. {
  544. if (ZstUtils.GetZh(list[i].kd) == 1)
  545. {
  546. info = list[i];
  547. return info;
  548. }
  549. }
  550. }
  551. }
  552. return info;
  553. }
  554. #endregion
  555. /// <summary>
  556. /// 上一次和值奇偶形态的数据
  557. /// </summary>
  558. /// <param name="xt"></param>
  559. /// <param name="rank"></param>
  560. /// <returns></returns>
  561. public static FcssqInfo GetLastHzJoFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  562. {
  563. FcssqInfo info = new FcssqInfo();
  564. if (list != null && list.Count > 0)
  565. {
  566. for (int i = rank - 2; i >= 0; i--)
  567. {
  568. if (xt == 0)
  569. {
  570. if (list[i].hz % 2 != 0)
  571. {
  572. info = list[i];
  573. return info;
  574. }
  575. }
  576. if (xt == 1)
  577. {
  578. if (list[i].hz % 2 == 0)
  579. {
  580. info = list[i];
  581. return info;
  582. }
  583. }
  584. }
  585. }
  586. return info;
  587. }
  588. /// <summary>
  589. /// 上一次和值val的数据
  590. /// </summary>
  591. /// <param name="val"></param>
  592. /// <param name="rank"></param>
  593. /// <returns></returns>
  594. public static FcssqInfo GetLastHzFcssqInfo(ref List<FcssqInfo> list,int shz, int ehz, int rank)
  595. {
  596. FcssqInfo info = new FcssqInfo();
  597. if (list != null && list.Count > 0)
  598. {
  599. for (int i = rank - 2; i >= 0; i--)
  600. {
  601. if (list[i].hz >= shz && list[i].hz <= ehz)
  602. {
  603. info = list[i];
  604. return info;
  605. }
  606. }
  607. }
  608. return info;
  609. }
  610. /// <summary>
  611. /// 取出个排名的上一次数据
  612. /// </summary>
  613. /// <param name="rank"></param>
  614. /// <returns></returns>
  615. public static FcssqInfo GetLastFcssqInfo(ref List<FcssqInfo> list,int rank)
  616. {
  617. FcssqInfo info = new FcssqInfo();
  618. if (list != null && list.Count > 0)
  619. {
  620. for (int i = rank - 2; i >= 0; i--)
  621. {
  622. if (list[i].rank == rank - 1)
  623. {
  624. info = list[i];
  625. return info;
  626. }
  627. }
  628. }
  629. return info;
  630. }
  631. /// <summary>
  632. /// 取出个排名的下一次数据, 用于开奖信息
  633. /// </summary>
  634. /// <param name="rank"></param>
  635. /// <returns></returns>
  636. public static FcssqInfo GetNextFcssqInfo(ref List<FcssqInfo> list,int rank)
  637. {
  638. FcssqInfo info = new FcssqInfo();
  639. if (list != null && list.Count > 0)
  640. {
  641. for (int i = rank - 1; i < list.Count; i++)
  642. {
  643. if (list[i].rank == rank + 1)
  644. {
  645. info = list[i];
  646. return info;
  647. }
  648. }
  649. }
  650. return info;
  651. }
  652. /// <summary>
  653. /// 上一次AC值012路的情况
  654. /// </summary>
  655. /// <param name="val"></param>
  656. /// <param name="rank"></param>
  657. /// <returns></returns>
  658. public static FcssqInfo GetLastAc012FcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  659. {
  660. FcssqInfo info = new FcssqInfo();
  661. if (list != null && list.Count > 0)
  662. {
  663. int size = list.Count;
  664. for (int i = rank - 2; i >= 0; i--)
  665. {
  666. if (list[i].ac % 3 == val)
  667. {
  668. info = list[i];
  669. return info;
  670. }
  671. }
  672. }
  673. return info;
  674. }
  675. /// <summary>
  676. /// 上一期AC值的质合情况
  677. /// </summary>
  678. /// <param name="xt"></param>
  679. /// <param name="rank"></param>
  680. /// <returns></returns>
  681. public static FcssqInfo GetLastAcZhFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  682. {
  683. FcssqInfo info = new FcssqInfo();
  684. if (list != null && list.Count > 0)
  685. {
  686. List<int> zh = new List<int> { 4, 6, 8, 9, 10 };
  687. int size = list.Count;
  688. for (int i = rank - 2; i >= 0; i--)
  689. {
  690. if (xt == 0)
  691. {
  692. if (!zh.Contains(list[i].ac))
  693. {
  694. info = list[i];
  695. return info;
  696. }
  697. }
  698. if (xt == 1)
  699. {
  700. if (zh.Contains(list[i].ac))
  701. {
  702. info = list[i];
  703. return info;
  704. }
  705. }
  706. }
  707. }
  708. return info;
  709. }
  710. /// <summary>
  711. /// 上一期AC值的大小情况
  712. /// </summary>
  713. /// <param name="xt"></param>
  714. /// <param name="rank"></param>
  715. /// <returns></returns>
  716. public static FcssqInfo GetLastAcDxFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  717. {
  718. FcssqInfo info = new FcssqInfo();
  719. if (list != null && list.Count > 0)
  720. {
  721. int size = list.Count;
  722. for (int i = rank - 2; i >= 0; i--)
  723. {
  724. if (xt == 0)
  725. {
  726. if (list[i].ac > 5)
  727. {
  728. info = list[i];
  729. return info;
  730. }
  731. }
  732. if (xt == 1)
  733. {
  734. if (list[i].ac < 6)
  735. {
  736. info = list[i];
  737. return info;
  738. }
  739. }
  740. }
  741. }
  742. return info;
  743. }
  744. /// <summary>
  745. /// 上一期某个AC值大小的数据
  746. /// </summary>
  747. /// <param name="xt"></param>
  748. /// <param name="rank"></param>
  749. /// <returns></returns>
  750. public static FcssqInfo GetLastAcJoFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  751. {
  752. FcssqInfo info = new FcssqInfo();
  753. if (list != null && list.Count > 0)
  754. {
  755. int size = list.Count;
  756. for (int i = rank - 2; i >= 0; i--)
  757. {
  758. if (xt == 0)
  759. {
  760. if (list[i].ac % 2 != 0)
  761. {
  762. info = list[i];
  763. return info;
  764. }
  765. }
  766. if (xt == 1)
  767. {
  768. if (list[i].ac % 2 == 0)
  769. {
  770. info = list[i];
  771. return info;
  772. }
  773. }
  774. }
  775. }
  776. return info;
  777. }
  778. /// <summary>
  779. /// 上一期某个AC值的数据
  780. /// </summary>
  781. /// <param name="val"></param>
  782. /// <param name="rank"></param>
  783. /// <returns></returns>
  784. public static FcssqInfo GetLastAcFcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  785. {
  786. FcssqInfo info = new FcssqInfo();
  787. if (list != null && list.Count > 0)
  788. {
  789. int size = list.Count;
  790. for (int i = rank - 2; i >= 0; i--)
  791. {
  792. if (list[i].ac == val)
  793. {
  794. info = list[i];
  795. return info;
  796. }
  797. }
  798. }
  799. return info;
  800. }
  801. /// <summary>
  802. /// 上一期某个蓝球的冷热情况.
  803. /// </summary>
  804. /// <param name="xt"></param>
  805. /// <param name="rank"></param>
  806. /// <returns></returns>
  807. public static FcssqInfo GetLastBlueHotFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  808. {
  809. FcssqInfo info = new FcssqInfo();
  810. if (list != null && list.Count > 0)
  811. {
  812. int size = list.Count;
  813. for (int i = rank - 2; i >= 0; i--)
  814. {
  815. List<int> hot = Fcssq.GetFcssqBlueHotList(ref list,list[i].rank, 16);
  816. if (xt == 0)
  817. {
  818. if (!hot.Contains(list[i].n7))
  819. {
  820. info = list[i];
  821. return info;
  822. }
  823. }
  824. if (xt == 1)
  825. {
  826. if (hot.Contains(list[i].n7))
  827. {
  828. info = list[i];
  829. return info;
  830. }
  831. }
  832. }
  833. }
  834. return info;
  835. }
  836. /// <summary>
  837. /// 上一期某个蓝球尾数的情况
  838. /// </summary>
  839. /// <param name="val">值</param>
  840. /// <param name="rank">排名</param>
  841. /// <returns></returns>
  842. public static FcssqInfo GetLastBlueWsFcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  843. {
  844. FcssqInfo info = new FcssqInfo();
  845. if (list != null && list.Count > 0)
  846. {
  847. int size = list.Count;
  848. for (int i = rank - 2; i >= 0; i--)
  849. {
  850. if (ZstUtils.GetHw(list[i].n7) == val)
  851. {
  852. info = list[i];
  853. return info;
  854. }
  855. }
  856. }
  857. return info;
  858. }
  859. /// <summary>
  860. /// 根据当前出号和排名,查询出上一次出此号时的数据
  861. /// 主要用在遗漏上
  862. /// </summary>
  863. /// <param name="val"></param>
  864. /// <param name="rank"></param>
  865. /// <returns></returns>
  866. public static FcssqInfo GetLastBlueFcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  867. {
  868. FcssqInfo info = new FcssqInfo();
  869. if (list != null && list.Count > 0)
  870. {
  871. for (int i = rank - 2; i >= 0; i--)
  872. {
  873. if (list[i].n7 == val)
  874. {
  875. info = list[i];
  876. return info;
  877. }
  878. }
  879. }
  880. return info;
  881. }
  882. /// <summary>
  883. /// 上一期蓝球的区间情况..
  884. /// </summary>
  885. /// <param name="qj"></param>
  886. /// <param name="rank"></param>
  887. /// <returns></returns>
  888. public static FcssqInfo GetLastBlueQjFcssqInfo(ref List<FcssqInfo> list,int qj, int rank)
  889. {
  890. List<int> b1 = new List<int> { 1, 2, 3, 4 };
  891. List<int> b2 = new List<int> { 5, 6, 7, 8 };
  892. List<int> b3 = new List<int> { 9, 10, 11, 12 };
  893. List<int> b4 = new List<int> { 13, 14, 15, 16 };
  894. FcssqInfo info = new FcssqInfo();
  895. if (list != null && list.Count > 0)
  896. {
  897. int size = list.Count;
  898. for (int i = rank - 2; i >= 0; i--)
  899. {
  900. if (qj == 1)
  901. {
  902. if (b1.Contains(list[i].n7))
  903. return list[i];
  904. }
  905. if (qj == 2)
  906. {
  907. if (b2.Contains(list[i].n7))
  908. return list[i];
  909. }
  910. if (qj == 3)
  911. {
  912. if (b3.Contains(list[i].n7))
  913. return list[i];
  914. }
  915. if (qj == 4)
  916. {
  917. if (b4.Contains(list[i].n7))
  918. return list[i];
  919. }
  920. }
  921. }
  922. return info;
  923. }
  924. /// <summary>
  925. /// 上一期的蓝球质合形态...
  926. /// </summary>
  927. /// <param name="xt">0=合 1=质</param>
  928. /// <param name="rank">排名</param>
  929. /// <returns></returns>
  930. public static FcssqInfo GetLastBlueZhFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  931. {
  932. FcssqInfo info = new FcssqInfo();
  933. int size = list.Count;
  934. for (int i = rank - 2; i >= 0; i--)
  935. {
  936. int n = list[i].n7;
  937. if (xt == 0)
  938. {
  939. if (ZstUtils.GetZh(n) == 0)
  940. {
  941. info = list[i];
  942. return info;
  943. }
  944. }
  945. if (xt == 1)
  946. {
  947. if (ZstUtils.GetZh(n) != 0)
  948. {
  949. info = list[i];
  950. return info;
  951. }
  952. }
  953. }
  954. return info;
  955. }
  956. /// <summary>
  957. /// 上一期的蓝球奇偶形态...
  958. /// </summary>
  959. /// <param name="xt">0=偶 1=奇</param>
  960. /// <param name="rank">排名</param>
  961. /// <returns></returns>
  962. public static FcssqInfo GetLastBlueJoFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  963. {
  964. FcssqInfo info = new FcssqInfo();
  965. int size = list.Count;
  966. for (int i = rank - 2; i >= 0; i--)
  967. {
  968. int n = list[i].n7;
  969. if (xt == 0)
  970. {
  971. if (n % 2 == 0)
  972. {
  973. info = list[i];
  974. return info;
  975. }
  976. }
  977. if (xt == 1)
  978. {
  979. if (n % 2 != 0)
  980. {
  981. info = list[i];
  982. return info;
  983. }
  984. }
  985. }
  986. return info;
  987. }
  988. /// <summary>
  989. /// 双色球蓝球012路的上一次数据
  990. /// </summary>
  991. /// <param name="xt"></param>
  992. /// <param name="rank"></param>
  993. /// <returns></returns>
  994. public static FcssqInfo GetLastBlue012FcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  995. {
  996. FcssqInfo info = new FcssqInfo();
  997. int size = list.Count;
  998. for (int i = rank - 2; i >= 0; i--)
  999. {
  1000. if (ZstUtils.Get012(list[i].n7) == xt)
  1001. {
  1002. info = list[i];
  1003. return info;
  1004. }
  1005. }
  1006. return info;
  1007. }
  1008. /// <summary>
  1009. /// 上一期的蓝球大小形态...
  1010. /// </summary>
  1011. /// <param name="xt">0=小 1=大</param>
  1012. /// <param name="rank">排名</param>
  1013. /// <returns></returns>
  1014. public static FcssqInfo GetLastBlueDxFcssqInfo(ref List<FcssqInfo> list,int xt, int rank)
  1015. {
  1016. FcssqInfo info = new FcssqInfo();
  1017. int size = list.Count;
  1018. for (int i = rank - 2; i >= 0; i--)
  1019. {
  1020. int n = list[i].n7;
  1021. if (xt == 0)
  1022. {
  1023. if (n < 9)
  1024. {
  1025. info = list[i];
  1026. return info;
  1027. }
  1028. }
  1029. if (xt == 1)
  1030. {
  1031. if (n > 8)
  1032. {
  1033. info = list[i];
  1034. return info;
  1035. }
  1036. }
  1037. }
  1038. return info;
  1039. }
  1040. /// <summary>
  1041. /// 红球
  1042. /// 根据当前出号和排名,查询出上一次出此号时的数据
  1043. /// 主要用在遗漏上
  1044. /// </summary>
  1045. /// <param name="val"></param>
  1046. /// <param name="rank"></param>
  1047. /// <returns></returns>
  1048. public static FcssqInfo GetLastRedFcssqInfo(ref List<FcssqInfo> list,int val, int rank)
  1049. {
  1050. FcssqInfo info = new FcssqInfo();
  1051. if (list != null && list.Count > 0)
  1052. {
  1053. for (int i = rank - 2; i >= 0; i--)
  1054. {
  1055. List<int> kjh = new List<int> { list[i].n1, list[i].n2, list[i].n3, list[i].n4, list[i].n5, list[i].n6 };
  1056. if (kjh.Contains(val))
  1057. {
  1058. info = list[i];
  1059. return info;
  1060. }
  1061. }
  1062. }
  1063. return info;
  1064. }
  1065. #endregion
  1066. #region 最近N期的红球热号...
  1067. /// <summary>
  1068. /// 最近N期的红球热号...
  1069. /// </summary>
  1070. /// <param name="pagesize"></param>
  1071. /// <returns></returns>
  1072. public static List<int> GetFcssqRedHotList(ref List<FcssqInfo> list,int pagesize)
  1073. {
  1074. List<int> rlist = new List<int>();
  1075. if (list != null && list.Count > 0)
  1076. {
  1077. int size = list.Count;
  1078. for (int i = size - 1; i >= (size - pagesize - 1) && i >= 0; i--)
  1079. {
  1080. rlist.Add(list[i].n1);
  1081. rlist.Add(list[i].n2);
  1082. rlist.Add(list[i].n3);
  1083. rlist.Add(list[i].n4);
  1084. rlist.Add(list[i].n5);
  1085. rlist.Add(list[i].n6);
  1086. }
  1087. }
  1088. return rlist;
  1089. }
  1090. #endregion
  1091. #region 某期双色球前N期的数据
  1092. /// <summary>
  1093. /// 某期双色球前N期的数据
  1094. /// 用于计算双色球红球冷热号
  1095. /// </summary>
  1096. /// <param name="rank">当前期的排名</param>
  1097. /// <param name="pagesize">前n期</param>
  1098. /// <returns></returns>
  1099. public static List<int> GetFcssqRedHotList(ref List<FcssqInfo> list,int rank, int pagesize)
  1100. {
  1101. List<int> rlist = new List<int>();
  1102. if (list != null && list.Count > 0)
  1103. {
  1104. int size = list.Count;
  1105. for (int i = rank - 2; i >= (rank - pagesize - 1) && i >= 0; i--)
  1106. {
  1107. rlist.Add(list[i].n1);
  1108. rlist.Add(list[i].n2);
  1109. rlist.Add(list[i].n3);
  1110. rlist.Add(list[i].n4);
  1111. rlist.Add(list[i].n5);
  1112. rlist.Add(list[i].n6);
  1113. }
  1114. }
  1115. return rlist;
  1116. }
  1117. #endregion
  1118. #region 最近N期的蓝球热号..
  1119. /// <summary>
  1120. /// 最近N期的蓝球热号..
  1121. /// </summary>
  1122. /// <param name="pagesize"></param>
  1123. /// <returns></returns>
  1124. public static List<int> GetFcssqBlueHotList(ref List<FcssqInfo> list,int pagesize)
  1125. {
  1126. List<int> rlist = new List<int>();
  1127. if (list != null && list.Count > 0)
  1128. {
  1129. int size = list.Count;
  1130. for (int i = size - 1; i >= (size - pagesize - 1) && i >= 0; i--)
  1131. {
  1132. rlist.Add(list[i].n7);
  1133. }
  1134. }
  1135. return rlist;
  1136. }
  1137. #endregion
  1138. #region 某期双色球前n期的数据
  1139. /// <summary>
  1140. /// 某期双色球前n期的数据
  1141. /// 用于计算双色球蓝球冷热号
  1142. /// </summary>
  1143. /// <param name="rank">当前期的排名</param>
  1144. /// <param name="pagesize">前n期</param>
  1145. /// <returns></returns>
  1146. public static List<int> GetFcssqBlueHotList(ref List<FcssqInfo> list,int rank, int pagesize)
  1147. {
  1148. List<int> rlist = new List<int>();
  1149. if (list != null && list.Count > 0)
  1150. {
  1151. int size = list.Count;
  1152. for (int i = rank - 2; i >= (rank - pagesize - 1) && i >= 0; i--)
  1153. {
  1154. rlist.Add(list[i].n7);
  1155. }
  1156. }
  1157. return rlist;
  1158. }
  1159. #endregion
  1160. #region 取某一期的数据
  1161. /// <summary>
  1162. /// 取某一期的数据
  1163. /// 根据期数值
  1164. /// </summary>
  1165. /// <param name="qi"></param>
  1166. /// <returns></returns>
  1167. public static FcssqInfo GetFcssqInfo(ref List<FcssqInfo> list,int qi)
  1168. {
  1169. FcssqInfo info = new FcssqInfo();
  1170. int size = list.Count;
  1171. for (int i = 0; i < size; i++)
  1172. {
  1173. if (list[i].qi == qi)
  1174. {
  1175. info = list[i];
  1176. break;
  1177. }
  1178. }
  1179. return info;
  1180. }
  1181. #endregion
  1182. #region 双色球星期x的所有数据列表
  1183. /// <summary>
  1184. /// 双色球星期x的所有数据列表
  1185. /// </summary>
  1186. /// <param name="week"></param>
  1187. /// <returns></returns>
  1188. public static List<FcssqInfo> GetFcssqWeekList(ref List<FcssqInfo> list,int week)
  1189. {
  1190. List<FcssqInfo> rlist = new List<FcssqInfo>();
  1191. if (list != null && list.Count > 0)
  1192. {
  1193. int size = list.Count;
  1194. for (int i = 0; i < size; i++)
  1195. {
  1196. if (list[i].week == week)
  1197. rlist.Add(list[i]);
  1198. }
  1199. }
  1200. return rlist;
  1201. }
  1202. #endregion
  1203. #region 走势图上的最近xx期数据.
  1204. /// <summary>
  1205. /// 走势图上的最近xx期数据.
  1206. /// </summary>
  1207. /// <param name="pagesize">最近n条</param>
  1208. /// <param name="year">按年份</param>
  1209. /// <param name="sqi">开始期</param>
  1210. /// <param name="eqi">结束期</param>
  1211. /// <param name="week">星期x</param>
  1212. /// <param name="day">另外一个星期x</param>
  1213. /// <returns></returns>
  1214. public static List<FcssqInfo> GetFcssqList(ref List<FcssqInfo> datalist, int pagesize, int year, int sqi, int eqi, int week = 0, int day = 0)
  1215. {
  1216. ///星期x的条件时
  1217. ///数据来源不一样.
  1218. List<FcssqInfo> list = new List<FcssqInfo>();
  1219. if (week > 0)
  1220. list = GetFcssqWeekList(ref datalist, week);
  1221. else
  1222. list = datalist;
  1223. List<FcssqInfo> rlist = new List<FcssqInfo>();
  1224. if (list != null && list.Count > 0)
  1225. {
  1226. int size = list.Count;
  1227. if (pagesize > 0)
  1228. {
  1229. rlist.Clear();
  1230. for (int i = (size - pagesize); i < size; i++)
  1231. {
  1232. rlist.Add(list[i]);
  1233. }
  1234. return rlist;
  1235. }
  1236. if (year > 0)
  1237. {
  1238. rlist.Clear();
  1239. for (int i = 0; i < size; i++)
  1240. {
  1241. if (TypeConverter.StrToInt(list[i].qi.ToString().Substring(0, 4), 0) == year)
  1242. rlist.Add(list[i]);
  1243. }
  1244. return rlist;
  1245. }
  1246. if (sqi > 0 && eqi > 0)
  1247. {
  1248. rlist.Clear();
  1249. int srank = GetFcssqInfo(ref list,sqi).rank;
  1250. int erank = GetFcssqInfo(ref list,eqi).rank;
  1251. if (erank != 0 && srank != 0 && erank > srank)
  1252. {
  1253. rlist.AddRange(list.Where(m => m.rank >= srank && m.rank <= erank));
  1254. //for (int i = srank - 1; i < erank && i < size; i++)
  1255. //{
  1256. // rlist.Add(list[i]);
  1257. //}
  1258. }
  1259. return rlist;
  1260. }
  1261. if (day > 0)
  1262. {
  1263. rlist.Clear();
  1264. List<FcssqInfo> temp = new List<FcssqInfo>();
  1265. for (int i = 0; i < size; i++)
  1266. {
  1267. if (list[i].week == day)
  1268. temp.Add(list[i]);
  1269. }
  1270. for (int i = (temp.Count - 120); i < temp.Count; i++)
  1271. {
  1272. rlist.Add(temp[i]);
  1273. }
  1274. return rlist;
  1275. }
  1276. if (pagesize == 0 && year == 0 && eqi == 0 && sqi == 0 && day == 0)
  1277. return list;
  1278. }
  1279. return rlist;
  1280. }
  1281. #endregion
  1282. #region 双色球遗漏表上用到数据
  1283. /// <summary>
  1284. /// 双色球遗漏表上用到数据
  1285. /// </summary>
  1286. /// <param name="eqi"></param>
  1287. /// <returns></returns>
  1288. public static List<FcssqInfo> GetMissFcssqList(ref List<FcssqInfo> list,int eqi)
  1289. {
  1290. List<FcssqInfo> rlist = new List<FcssqInfo>();
  1291. if (eqi > 0)
  1292. {
  1293. int size = list.Count;
  1294. int erank = GetFcssqInfo(ref list,eqi).rank;
  1295. if (erank > 0)
  1296. {
  1297. for (int i = 0; i < erank && i < size; i++)
  1298. {
  1299. rlist.Add(list[i]);
  1300. }
  1301. }
  1302. else
  1303. {
  1304. for (int i = 0; i < size; i++)
  1305. {
  1306. rlist.Add(list[i]);
  1307. }
  1308. }
  1309. }
  1310. else
  1311. {
  1312. rlist = list;
  1313. }
  1314. return rlist;
  1315. }
  1316. #endregion
  1317. #region 所有双色球数据
  1318. /// <summary>
  1319. /// 所有双色球数据
  1320. /// </summary>
  1321. /// <returns></returns>
  1322. public static List<FcssqInfo> GetFcssqList()
  1323. {
  1324. string key = string.Format(CacheKeys.FCSSQ_DATALIST);
  1325. List<FcssqInfo> list = cache.GetObject<List<FcssqInfo>>(key);
  1326. if (list == null)
  1327. {
  1328. list = FcssqData.GetFcssqList();
  1329. cache.AddObject(key, list, (int)CacheTime.Data);
  1330. }
  1331. return list;
  1332. }
  1333. #endregion
  1334. #region 根据短期数,查询双色球历史同期号
  1335. /// <summary>
  1336. /// 根据短期数,查询双色球历史同期号
  1337. /// </summary>
  1338. /// <param name="shortqi">短期数</param>
  1339. /// <returns></returns>
  1340. public static List<FcssqInfo> GetHistoryFcssqList(ref List<FcssqInfo> list,string shortqi)
  1341. {
  1342. List<FcssqInfo> rlist = new List<FcssqInfo>();
  1343. if (list != null && list.Count > 0)
  1344. {
  1345. int size = list.Count;
  1346. for (int i = 0; i < size; i++)
  1347. {
  1348. if (list[i].qi.ToString().Substring(4) == shortqi)
  1349. {
  1350. rlist.Add(list[i]);
  1351. }
  1352. }
  1353. }
  1354. return rlist;
  1355. }
  1356. #endregion
  1357. #region 开奖公告相关方法
  1358. /// <summary>
  1359. /// 双色球最近30期开奖数据,完整开奖信息,有缓存
  1360. /// </summary>
  1361. /// <returns></returns>
  1362. public static List<FcssqlongInfo> GetFcssqListTop30(int pagesize=30)
  1363. {
  1364. string key = string.Format(CacheKeys.FCSSQ_KJH_DATA+"-{0}",pagesize);
  1365. List<FcssqlongInfo> list = cache.GetObject<List<FcssqlongInfo>>(key);
  1366. if (list == null)
  1367. {
  1368. list = FcssqData.GetFcssqTop30(pagesize);
  1369. cache.AddObject(key, list, (int)CacheTime.Kjh);
  1370. }
  1371. return list;
  1372. }
  1373. /// <summary>
  1374. /// 包括开机号的双色球列表
  1375. /// </summary>
  1376. /// <param name="pagesize"></param>
  1377. /// <returns></returns>
  1378. public static List<FcssqlongInfo> GetFcssqKjihList(int pagesize = 30)
  1379. {
  1380. string key = string.Format(CacheKeys.FCSSQ_KJH_DATA + "-{0}-kjih", pagesize);
  1381. List<FcssqlongInfo> list = cache.GetObject<List<FcssqlongInfo>>(key);
  1382. if (list == null)
  1383. {
  1384. list = FcssqData.GetFcssqKjihList(pagesize);
  1385. cache.AddObject(key, list, (int)CacheTime.Kjh);
  1386. }
  1387. return list;
  1388. }
  1389. /// <summary>
  1390. /// 获取最新一期开奖信息,完整开奖信息,有缓存
  1391. /// </summary>
  1392. /// <returns></returns>
  1393. public static FcssqlongInfo GetFcssqInfoTop1(ref List<FcssqlongInfo> list)
  1394. {
  1395. FcssqlongInfo info = new FcssqlongInfo();
  1396. if (list.Count > 0)
  1397. {
  1398. info = list[0];
  1399. }
  1400. return info;
  1401. }
  1402. /// <summary>
  1403. /// 根据期数返回某期完整开奖信息,无缓存
  1404. /// </summary>
  1405. /// <param name="qi"></param>
  1406. /// <returns></returns>
  1407. public static FcssqlongInfo GetFcssqInfoByqi(int qi)
  1408. {
  1409. return FcssqData.GetFcssqInfoByQi(qi);
  1410. }
  1411. /// <summary>
  1412. /// 返回某年对应的期数列表,有缓存
  1413. /// </summary>
  1414. /// <param name="year"></param>
  1415. /// <returns></returns>
  1416. public static List<int> GetFcssqQiListByYear(int year)
  1417. {
  1418. string key = string.Format(CacheKeys.FCSSQ_KJH_DATA + "/qilistbyyear/{0}", year);
  1419. List<int> list = cache.GetObject<List<int>>(key);
  1420. if (list == null)
  1421. {
  1422. list = FcssqData.GetFcssqQiListByYear(year);
  1423. cache.AddObject(key, list, (int)CacheTime.System);
  1424. }
  1425. return list;
  1426. }
  1427. #endregion
  1428. }
  1429. }