名将擂台:排行榜&每日排行奖励

This commit is contained in:
luying
2022-07-16 17:21:29 +08:00
parent 0fbc8bd7d8
commit 2cf7c4c3e4
10 changed files with 121 additions and 40 deletions

View File

@@ -56,6 +56,7 @@ export enum MAIL_TYPE {
PVP_BOX = 27, // pvp巅峰之路宝箱
DAILY_COIN = 28, // 招财进宝宝箱
GUILD_DISSMISS = 29, // 军团解散
LADDER = 30, // 名将擂台
};
export const SEND_NAME = '系统';

View File

@@ -997,6 +997,16 @@ export function getDicLadderMatchByMyRank(myRank: number) {
return null
}
export function getLadderRankReward(myRank: number) {
for(let dic of gameData.ladderRankReward) {
let { rankMin, rankMax } = dic;
if(rankMin < myRank && (rankMax >= myRank || rankMax == -1) ) {
return dic;
}
}
return null
}
// 初始加载
function initDatas() {
parseDicParam();

View File

@@ -18,7 +18,7 @@ export const dicLadderRankReward: DicLadderRankReward[] = [];
export function loadLadderRankReward() {
dicLadderRankReward.splice(0, dicLadderRankReward.length);
let arr = readFileAndParse(FILENAME.DIC_LADDER_DIFFICULTRATIO);
let arr = readFileAndParse(FILENAME.DIC_LADDER_RANKREWARD);
arr.forEach(o => {
o.reward = parseGoodStr(o.reward)
dicLadderRankReward.push(o);

View File

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

View File

@@ -208,5 +208,12 @@
"sendName": "&",
"content": "很抱歉,您的军团已被解散,振作起来寻找新的军团加入吧",
"time": 720
},
{
"id": 30,
"title": "&",
"sendName": "&",
"content": "您在昨日的名将擂台中获得了第%d名排名奖励已发送至您的邮箱请查收",
"time": 720
}
]

View File

@@ -3,54 +3,60 @@
"id": 1,
"rankMin": 0,
"rankMax": 1,
"reward": "31002&1000"
"reward": "31002&900|31001&5000"
},
{
"id": 2,
"rankMin": 1,
"rankMax": 10,
"reward": "31002&1000"
"reward": "31002&800|31001&4000"
},
{
"id": 3,
"rankMin": 10,
"rankMax": 50,
"reward": "31002&1000"
"reward": "31002&700|31001&3000"
},
{
"id": 4,
"rankMin": 50,
"rankMax": 100,
"reward": "31002&1000"
"reward": "31002&600|31001&2000"
},
{
"id": 5,
"rankMin": 100,
"rankMax": 200,
"reward": "31002&1000"
"reward": "31002&500|31001&2000"
},
{
"id": 6,
"rankMin": 200,
"rankMax": 500,
"reward": "31002&1000"
"reward": "31002&400|31001&2000"
},
{
"id": 7,
"rankMin": 500,
"rankMax": 1000,
"reward": "31002&1000"
"reward": "31002&300|31001&2000"
},
{
"id": 8,
"rankMin": 1000,
"rankMax": 2000,
"reward": "31002&1000"
"reward": "31002&200|31001&2000"
},
{
"id": 9,
"rankMin": 2000,
"rankMax": 3000,
"reward": "31002&100|31001&1000"
},
{
"id": 10,
"rankMin": 3000,
"rankMax": -1,
"reward": "31002&1000"
"reward": "31002&100|31001&500"
}
]