名将擂台：刷新对手

shared/pubUtils/data.ts

@@ -107,6 +107,9 @@ import { dicTowerPvpSubAttr, loadTowerPvpSubAttr } from './dictionary/DicTowerPv
 import { dicSystemOpenTime, loadSystemOpenTime } from "./dictionary/DicSystemOpenTime";
 import { dicRandomEffectPoolPlan, loadRandomEffectPoolPlan } from './dictionary/DicRandomEffectPoolPlan';
 import { dicMainWarRewardByChapter, loadMainWarReward } from './dictionary/DicMainWarReward';
+import { dicLadderMatch, loadLadderMatch } from "./dictionary/DicLadderMatch";
+import { dicLadderDifficultRatio, loadLadderDifficultRatio } from "./dictionary/DicLadderDifficultRatio";
+import { dicLadderRankReward, loadLadderRankReward } from "./dictionary/DicLadderRankReward";
 
 export const gameData = {
     daily: dicDaily,
@@ -270,6 +273,9 @@ export const gameData = {
     sysOpenTime: dicSystemOpenTime,
     randomEffectPoolPlan: dicRandomEffectPoolPlan,
     ladderConsume: new Array<{id: number, count: number, times: number}>(),
+    ladderMatch: dicLadderMatch,
+    ladderDifficultRatio: dicLadderDifficultRatio,
+    ladderRankReward: dicLadderRankReward
 };
 
 // 在此提供一些原先在gamedata中提供的方法，以便更方便获取gameData数据
@@ -981,6 +987,16 @@ export function decodeLadderBuyCost() {
     }
 }
 
+export function getDicLadderMatchByMyRank(myRank: number) {
+    for(let dic of gameData.ladderMatch) {
+        let { rankMin, rankMax } = dic;
+        if(rankMin < myRank && (rankMax >= myRank || rankMax == -1) ) {
+            return dic;
+        }
+    }
+    return null
+}
+
 // 初始加载
 function initDatas() {
     parseDicParam();
@@ -1154,6 +1170,9 @@ function loadDatas() {
     loadSystemOpenTime();
     loadRandomEffectPoolPlan();
     loadMainWarReward();
+    loadLadderMatch();
+    loadLadderDifficultRatio();
+    loadLadderRankReward();
 }
 
 // 重载dicParam

shared/pubUtils/dictionary/DicLadderDifficultRatio.ts

@@ -0,0 +1,59 @@
+// 邮件内容
+import {decodeArrayListStr, parseGoodStr, readFileAndParse} from '../util'
+import { FILENAME } from '../../consts'
+import { RewardInter } from '../interface';
+
+export interface DicLadderDifficultRatio {
+    // id
+    readonly id: number;
+    // 排名
+    readonly rank: number;
+    // 强度倍率
+    readonly value: number;
+    // 次级属性
+    readonly secondAttrLevel: number;
+    // 等级
+    readonly level: number;
+    // 关卡id
+    readonly gkId: number;
+    // 头像
+    readonly head: number;
+    // 形象
+    readonly spine: number;
+    // 胜利奖励
+    readonly randomWinReward: { id: number, count: number, weight: number }[];
+    // 失败奖励
+    readonly randomFailReward: { id: number, count: number, weight: number }[];
+    // 突破奖励
+    readonly onceReward: RewardInter[];
+    // 战力
+    readonly ce: number;
+}
+
+export const dicLadderDifficultRatio = new Map<number, DicLadderDifficultRatio>();
+export function loadLadderDifficultRatio() {
+    dicLadderDifficultRatio.clear();
+    
+    let arr = readFileAndParse(FILENAME.DIC_LADDER_DIFFICULTRATIO);
+    arr.forEach(o => {
+        o.gkId = parseInt(o.gkId);
+        o.randomWinReward = parseRewardWithWeight(o.randomWinReward);
+        o.randomFailReward = parseRewardWithWeight(o.randomFailReward);
+        o.onceReward = parseGoodStr(o.onceReward)
+        dicLadderDifficultRatio.set(o.id, o);
+    });
+    arr = undefined;
+}
+
+function parseRewardWithWeight(str: string) {
+    let result = new Array<{ id: number, count: number, weight: number }>();
+    if (!str) return result;
+    let decodeArr = decodeArrayListStr(str);
+    for (let [id, count, weight] of decodeArr) {
+        if (isNaN(parseInt(id)) || isNaN(parseInt(count)) || isNaN(parseInt(weight))) {
+            throw new Error('data table format wrong');
+        }
+        result.push({ id: parseInt(id), count: parseInt(count), weight: parseInt(weight) });
+    }
+    return result
+}

shared/pubUtils/dictionary/DicLadderMatch.ts

@@ -0,0 +1,41 @@
+// 名将擂台匹配范围
+import { parseNumberList, readFileAndParse} from '../util'
+import { FILENAME } from '../../consts'
+
+export interface DicLadderMatch {
+    // id
+    readonly id: number;
+    // 最低排名
+    readonly rankMin: number;
+    // 最高排名
+    readonly rankMax: number;
+    // 玩家随机范围往前数最多多少人
+    readonly rangeBeforeMax: number;
+    // 玩家随机范围往后数最多多少人
+    readonly rangeAfterMax: number;
+    // 玩家随机范围往前随多少人
+    readonly rangeBeforeNum: number;
+    // 玩家随机范围往后随多少人
+    readonly rangeAfterNum: number;
+    // 玩家随机间隔
+    readonly gap: { min: number, max: number };
+    // 是否可以挑战前十
+    readonly topChallenge: number;
+}
+
+export const dicLadderMatch: DicLadderMatch[] = [];
+export function loadLadderMatch() {
+    dicLadderMatch.splice(0, dicLadderMatch.length);
+    
+    let arr = readFileAndParse(FILENAME.DIC_LADDER_MATCH);
+    arr.forEach(o => {
+        o.gap = parseGap(o.interval);
+        dicLadderMatch.push(o);
+    });
+    arr = undefined;
+}
+
+function parseGap(str: string) {
+    let arr = parseNumberList(str);
+    return { min: arr[0], max: arr[1] }
+}

shared/pubUtils/dictionary/DicLadderRankReward.ts

@@ -0,0 +1,27 @@
+// 名将擂台每天22点排名奖励
+import {parseGoodStr, readFileAndParse} from '../util'
+import { FILENAME } from '../../consts'
+import { RewardInter } from '../interface';
+
+export interface DicLadderRankReward {
+    // id
+    readonly id: number;
+    // 最低排名
+    readonly rankMin: number;
+    // 最高排名
+    readonly rankMax: number;
+    // 突破奖励
+    readonly reward: RewardInter[];
+}
+
+export const dicLadderRankReward: DicLadderRankReward[] = [];
+export function loadLadderRankReward() {
+    dicLadderRankReward.splice(0, dicLadderRankReward.length);
+    
+    let arr = readFileAndParse(FILENAME.DIC_LADDER_DIFFICULTRATIO);
+    arr.forEach(o => {
+        o.reward = parseGoodStr(o.reward)
+        dicLadderRankReward.push(o);
+    });
+    arr = undefined;
+}

shared/pubUtils/redis.ts

@@ -48,6 +48,8 @@ declare module 'redis' {
         zaddAsync(key: string, score: number, member: string): Promise<number>;
         // 返回有序集中指定分数区间内的成员，分数从高到低排序
         zrevrangebyscoreAsync(key: string, max: (string|number), min: (string|number), withscores?: string, limit?:string, offset?: number, count?:number): Promise<string[]>;
+        // 返回有序集中指定分数区间内的成员，分数从高到低排序
+        zrangebyscoreAsync(key: string, max: (string|number), min: (string|number), withscores?: string, limit?:string, offset?: number, count?:number): Promise<string[]>;
         // 获取有序集合的成员数
         zcardAsync(key: string): Promise<number>;
         // 移除有序集合中给定的排名区间的所有成员