feats

src/util/FootballPrice.js

-/* eslint-disable */
-import { descartes, combination } from './math'
-
 // 模拟比赛得分
 const matches = [
   [1, 0], [2, 0], [2, 1], [3, 0], [3, 1], [3, 2], [4, 0], [4, 1], [4, 2], [5, 0], [5, 1], [5, 2], [99, 0],
   [0, 0], [1, 1], [2, 2], [3, 3], [99, 99],
-  [0, 1], [0, 2], [1, 2], [0, 3], [1, 3], [2, 3], [0, 4], [1, 4], [2, 4], [0, 5], [1, 5], [2, 5], [0, 99],
+  [0, 1], [0, 2], [1, 2], [0, 3], [1, 3], [2, 3], [0, 4], [1, 4], [2, 4], [0, 5], [1, 5], [2, 5], [0, 99]
 ]
 
 const playWayFunc = {
   'ft-wdls': computeWDLS,
   'ft-score': computeScore,
   'ft-points': computePoints,
-  'ft-double': computeDouble,
-}
-
-/**
- * 依据投注列表，生成所有可能的排列组合
- * @param {*} noteList 投注列表
- * @param {*} passDict 过关字典
- */
-function GetAllParts (noteList, passDict) {
-  // 转换过关字典
-  const passArr = [
-    passDict.level1,
-    passDict.level2,
-    passDict.level3,
-    passDict.level4,
-    passDict.level5,
-    passDict.level6,
-    passDict.level7,
-    passDict.level8,
-  ]
-
-  // 整理数据
-  // [a, b, c, d] => [[a], [b1, b2], [c1, c2], [d]] == [A, B, C, D]
-  const noteArr = noteList.map(x => x.detailList.map(y => ({ ...x, detail: y })))
-
-  // 从投注场次中, 选择过关场次组合
-  // 比如投注4场比赛, 过关方式为3串4
-  // [A, B, C, D] =>
-  // [[A, B, C],
-  //  [A, B, D],
-  //  [A, C, D],
-  //  [B, C, D]]
-  const composeNote = combination(noteArr, passDict.unitNum)
-
-  // 拆分场次组合
-  const disposeNote = composeNote.reduce((acc, note) => {
-    // [A, B, C] =>
-    //  [a, b1, c1],
-    //  [a, b1, c2],
-    //  [a, b2, c1],
-    //  [a, b2, c2]
-    const unpack = descartes(...note)
-    return [
-      ...acc,
-      ...unpack
-    ]
-  }, [])
-
-  // 组合过关场景
-  const allParts = disposeNote.map(noteGrp => {
-    // 比如 3串4 = 3个2串1 + 1个3串1
-    // [a, b, c] =>
-    // [[a, b],
-    //  [a, c],
-    //  [b, c],
-    //  [a, b, c]]
-    return passArr.map((passNum, inx) => {
-      // 当前关卡不需要场次
-      if (!passNum) return undefined
-      
-      const requreNum = inx + 1
-      return combination(noteGrp, requreNum)
-    }).filter(Boolean).reduce((acc, grp) => ([...acc, ...grp]), [])
-  })
-
-  const sum = allParts.reduce((s, x) => s + x.length, 0)
-  return { sum, allParts }
+  'ft-double': computeDouble
 }
 
 // 遍历模拟比赛获取最大, 最小奖金
 // rq 让球数
-function GetPrice (allParts, rq) {
-  let minPrice = undefined
-  let maxPrice = undefined
+export function GetPrice (allParts, rq) {
+  let minPrice
+  let maxPrice
 
   // 遍历模拟比赛的各种可能
   matches.forEach(match => {
         const fn = playWayFunc[wayCode]
         return fn(grp, match, rq)
       }).filter(Boolean).reduce((acc, x) => acc * x, 1)
-
     }).reduce((acc, x) => acc + x, 0)
 
     if (minPrice === 0 || minPrice > price) {
     case 'ft-win':
       return x > y ? odds : 0
     case 'ft-dead':
-      return x == y ? odds : 0
+      return x === y ? odds : 0
     default:
       return x < y ? odds : 0
   }
     case 'ft-sp-win':
       return x + rq > y ? odds : 0
     case 'ft-sp-dead':
-      return x + rq == y ? odds : 0
+      return x + rq === y ? odds : 0
     default:
       return x + rq < y ? odds : 0
   }
 
   switch (ruleCode) {
     case 'ft-w10':
-      return x == 1 && y == 0 ? odds : 0
+      return x === 1 && y === 0 ? odds : 0
     case 'ft-w20':
-      return x == 2 && y == 0 ? odds : 0
+      return x === 2 && y === 0 ? odds : 0
     case 'ft-w21':
-      return x == 2 && y == 1 ? odds : 0
+      return x === 2 && y === 1 ? odds : 0
     case 'ft-w30':
-      return x == 3 && y == 0 ? odds : 0
+      return x === 3 && y === 0 ? odds : 0
     case 'ft-w31':
-      return x == 3 && y == 1 ? odds : 0
+      return x === 3 && y === 1 ? odds : 0
     case 'ft-w32':
-      return x == 3 && y == 2 ? odds : 0
+      return x === 3 && y === 2 ? odds : 0
     case 'ft-w40':
-      return x == 4 && y == 0 ? odds : 0
+      return x === 4 && y === 0 ? odds : 0
     case 'ft-w41':
-      return x == 4 && y == 1 ? odds : 0
+      return x === 4 && y === 1 ? odds : 0
     case 'ft-w42':
-      return x == 4 && y == 2 ? odds : 0
+      return x === 4 && y === 2 ? odds : 0
     case 'ft-w50':
-      return x == 5 && y == 0 ? odds : 0
+      return x === 5 && y === 0 ? odds : 0
     case 'ft-w51':
-      return x == 5 && y == 1 ? odds : 0
+      return x === 5 && y === 1 ? odds : 0
     case 'ft-w52':
-      return x == 5 && y == 2 ? odds : 0
+      return x === 5 && y === 2 ? odds : 0
     case 'ft-w99':
       return x > 5 && x > y ? odds : 0
     case 'ft-d00':
-      return x == 0 && x == y ? odds : 0
+      return x === 0 && x === y ? odds : 0
     case 'ft-d11':
-      return x == 1 && x == y ? odds : 0
+      return x === 1 && x === y ? odds : 0
     case 'ft-d22':
-      return x == 2 && x == y ? odds : 0
+      return x === 2 && x === y ? odds : 0
     case 'ft-d33':
-      return x == 3 && x == y ? odds : 0
+      return x === 3 && x === y ? odds : 0
     case 'ft-d99':
-      return x > 5 && x == y ? odds : 0
+      return x > 5 && x === y ? odds : 0
     case 'ft-l01':
-      return x == 0 && y == 1 ? odds : 0
+      return x === 0 && y === 1 ? odds : 0
     case 'ft-l02':
-      return x == 0 && y == 2 ? odds : 0
+      return x === 0 && y === 2 ? odds : 0
     case 'ft-l12':
-      return x == 1 && y == 2 ? odds : 0
+      return x === 1 && y === 2 ? odds : 0
     case 'ft-l03':
-      return x == 0 && y == 3 ? odds : 0
+      return x === 0 && y === 3 ? odds : 0
     case 'ft-l13':
-      return x == 1 && y == 3 ? odds : 0
+      return x === 1 && y === 3 ? odds : 0
     case 'ft-l23':
-      return x == 2 && y == 3 ? odds : 0
+      return x === 2 && y === 3 ? odds : 0
     case 'ft-l04':
-      return x == 0 && y == 4 ? odds : 0
+      return x === 0 && y === 4 ? odds : 0
     case 'ft-l14':
-      return x == 1 && y == 4 ? odds : 0
+      return x === 1 && y === 4 ? odds : 0
     case 'ft-l24':
-      return x == 2 && y == 4 ? odds : 0
+      return x === 2 && y === 4 ? odds : 0
     case 'ft-l05':
-      return x == 0 && y == 5 ? odds : 0
+      return x === 0 && y === 5 ? odds : 0
     case 'ft-l15':
-      return x == 1 && y == 5 ? odds : 0
+      return x === 1 && y === 5 ? odds : 0
     case 'ft-l25':
-      return x == 2 && y == 5 ? odds : 0
+      return x === 2 && y === 5 ? odds : 0
     default:
       return x < y && y > 5 ? odds : 0
   }
 
   switch (ruleCode) {
     case 'ft-p0':
-      return x == 0 && y == 0 ? odds : 0
+      return x === 0 && y === 0 ? odds : 0
     case 'ft-p1':
-      return x + y == 1 ? odds : 0
+      return x + y === 1 ? odds : 0
     case 'ft-p2':
-      return x + y == 2 ? odds : 0
+      return x + y === 2 ? odds : 0
     case 'ft-p3':
-      return x + y == 3 ? odds : 0
+      return x + y === 3 ? odds : 0
     case 'ft-p4':
-      return x + y == 4 ? odds : 0
+      return x + y === 4 ? odds : 0
     case 'ft-p5':
-      return x + y == 5 ? odds : 0
+      return x + y === 5 ? odds : 0
     case 'ft-p6':
-      return x + y == 6 ? odds : 0
+      return x + y === 6 ? odds : 0
     default:
       return x + y > 6 ? odds : 0
   }
     case 'ft-wd':
     case 'ft-dd':
     case 'ft-ld':
-      return x == y ? odds : 0
+      return x === y ? odds : 0
     default:
       return x < y ? odds : 0
   }
 }
-
-export default GetAllParts

src/util/Sports.js

+import { descartes, combination } from './math'
+
+/**
+ * 依据投注列表，生成所有可能的排列组合
+ * @param {*} noteList 投注列表
+ * @param {*} passDict 过关字典
+ */
+export function GetAllParts (noteList, passDict) {
+  // 转换过关字典
+  const passArr = [
+    passDict.level1,
+    passDict.level2,
+    passDict.level3,
+    passDict.level4,
+    passDict.level5,
+    passDict.level6,
+    passDict.level7,
+    passDict.level8,
+  ]
+
+  // 整理数据
+  // [a, b, c, d] => [[a], [b1, b2], [c1, c2], [d]] == [A, B, C, D]
+  const noteArr = noteList.map(x => x.detailList.map(y => ({ ...x, detail: y })))
+
+  // 从投注场次中, 选择过关场次组合
+  // 比如投注4场比赛, 过关方式为3串4
+  // [A, B, C, D] =>
+  // [[A, B, C],
+  //  [A, B, D],
+  //  [A, C, D],
+  //  [B, C, D]]
+  const composeNote = combination(noteArr, passDict.unitNum)
+
+  // 拆分场次组合
+  const disposeNote = composeNote.reduce((acc, note) => {
+    // [A, B, C] =>
+    //  [a, b1, c1],
+    //  [a, b1, c2],
+    //  [a, b2, c1],
+    //  [a, b2, c2]
+    const unpack = descartes(...note)
+    return [
+      ...acc,
+      ...unpack
+    ]
+  }, [])
+
+  // 组合过关场景
+  const allParts = disposeNote.map(noteGrp => {
+    // 比如 3串4 = 3个2串1 + 1个3串1
+    // [a, b, c] =>
+    // [[a, b],
+    //  [a, c],
+    //  [b, c],
+    //  [a, b, c]]
+    return passArr.map((passNum, inx) => {
+      // 当前关卡不需要场次
+      if (!passNum) return undefined
+      
+      const requreNum = inx + 1
+      return combination(noteGrp, requreNum)
+    }).filter(Boolean).reduce((acc, grp) => ([...acc, ...grp]), [])
+  })
+
+  const sum = allParts.reduce((s, x) => s + x.length, 0)
+  return { sum, allParts }
+}