字典:解析export
This commit is contained in:
@@ -148,7 +148,7 @@ export class PvpHandler {
|
|||||||
|
|
||||||
// 刷新次数及消耗
|
// 刷新次数及消耗
|
||||||
let { refOppCnt, refOppTime, consume } = getRefOppCnt(pvpDefense.refOppCnt, pvpDefense.refOppTime);
|
let { refOppCnt, refOppTime, consume } = getRefOppCnt(pvpDefense.refOppCnt, pvpDefense.refOppTime);
|
||||||
if (refOppCnt >= gameData.maxPvpRefreshCnt) {
|
if (refOppCnt >= gameData.maxPvpRefreshCnt.max) {
|
||||||
return resResult(STATUS.PVP_REFRESH_CNT_REACH_MAX);
|
return resResult(STATUS.PVP_REFRESH_CNT_REACH_MAX);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -512,7 +512,8 @@ export class HeroHandler {
|
|||||||
|
|
||||||
let { favourLv: oldLv, favour: oldExp } = hero;
|
let { favourLv: oldLv, favour: oldExp } = hero;
|
||||||
|
|
||||||
let maxLv = gameData.maxFriendShipLv; // 好感度最大等级
|
let maxLv = gameData.maxFriendShipLv.max; // 好感度最大等级
|
||||||
|
console.log(maxLv)
|
||||||
if (maxLv <= oldLv)
|
if (maxLv <= oldLv)
|
||||||
return resResult(STATUS.HERO_FAVOUR_LEVEL_REACH_MAXT);
|
return resResult(STATUS.HERO_FAVOUR_LEVEL_REACH_MAXT);
|
||||||
|
|
||||||
|
|||||||
@@ -344,7 +344,7 @@ export class RoleHandler {
|
|||||||
update.scrollColorStar = 0;
|
update.scrollColorStar = 0;
|
||||||
|
|
||||||
// 获取一定好感度
|
// 获取一定好感度
|
||||||
let maxLv = gameData.maxFriendShipLv;
|
let maxLv = gameData.maxFriendShipLv.max;
|
||||||
if (maxLv > favourLv) {
|
if (maxLv > favourLv) {
|
||||||
|
|
||||||
update.favour += SCROLL.SCROLL_ACTIVE_FAVOUR;
|
update.favour += SCROLL.SCROLL_ACTIVE_FAVOUR;
|
||||||
|
|||||||
@@ -14,7 +14,7 @@ export async function roleLevelup(roleId: string, kingExp: number, session: Back
|
|||||||
const serverId = session.get('serverId');
|
const serverId = session.get('serverId');
|
||||||
let role = await RoleModel.findByRoleId(roleId);
|
let role = await RoleModel.findByRoleId(roleId);
|
||||||
let { lv = 1, exp = 0 } = role;
|
let { lv = 1, exp = 0 } = role;
|
||||||
let canGetExp = lv < gameData.maxPlayerLv; // 当主公超过最大级后,挑战结算不再获得经验值
|
let canGetExp = lv < gameData.maxPlayerLv.max; // 当主公超过最大级后,挑战结算不再获得经验值
|
||||||
let newExp = canGetExp ? exp + kingExp : exp;
|
let newExp = canGetExp ? exp + kingExp : exp;
|
||||||
let newLv = getLvByExp(newExp);
|
let newLv = getLvByExp(newExp);
|
||||||
// 等级超过最高级之后,经验依然可以稍微溢出一些,以备下一次提升等级
|
// 等级超过最高级之后,经验依然可以稍微溢出一些,以备下一次提升等级
|
||||||
|
|||||||
@@ -448,7 +448,7 @@ export function getPvpBoxs() {
|
|||||||
}
|
}
|
||||||
|
|
||||||
export function getResultMaxRank() {
|
export function getResultMaxRank() {
|
||||||
return gameData.pvpRankMax;
|
return gameData.pvpRankMax.max;
|
||||||
}
|
}
|
||||||
|
|
||||||
export function getStructureConsume(structureId: number, level: number) {
|
export function getStructureConsume(structureId: number, level: number) {
|
||||||
|
|||||||
@@ -13,7 +13,7 @@ export interface DicFriendShipLevel {
|
|||||||
readonly expSum: number;
|
readonly expSum: number;
|
||||||
}
|
}
|
||||||
|
|
||||||
export let maxFriendShipLv = 0;
|
export const maxFriendShipLv = { max: 0 };
|
||||||
export const dicFriendShipLevelMap = new Map<number, DicFriendShipLevel>();
|
export const dicFriendShipLevelMap = new Map<number, DicFriendShipLevel>();
|
||||||
export function loadFriendShipLevel() {
|
export function loadFriendShipLevel() {
|
||||||
|
|
||||||
@@ -23,7 +23,7 @@ export function loadFriendShipLevel() {
|
|||||||
expSum += o.exp;
|
expSum += o.exp;
|
||||||
o.expSum = expSum;
|
o.expSum = expSum;
|
||||||
dicFriendShipLevelMap.set(o.level, o);
|
dicFriendShipLevelMap.set(o.level, o);
|
||||||
if(o.level > maxFriendShipLv) maxFriendShipLv = o.level;
|
if(o.level > maxFriendShipLv.max) maxFriendShipLv.max = o.level;
|
||||||
});
|
});
|
||||||
arr = undefined;
|
arr = undefined;
|
||||||
}
|
}
|
||||||
@@ -10,7 +10,7 @@ export interface DicKingExp {
|
|||||||
}
|
}
|
||||||
|
|
||||||
export const dicKingExp = new Map<number, {sum: number, cur: number}>();
|
export const dicKingExp = new Map<number, {sum: number, cur: number}>();
|
||||||
export let maxPlayerLv = 0;
|
export const maxPlayerLv = { max: 0 };
|
||||||
|
|
||||||
export function loadKingExp() {
|
export function loadKingExp() {
|
||||||
|
|
||||||
@@ -18,7 +18,7 @@ export function loadKingExp() {
|
|||||||
let exp = 0;
|
let exp = 0;
|
||||||
arr.forEach(o => {
|
arr.forEach(o => {
|
||||||
exp += o.exp;
|
exp += o.exp;
|
||||||
if(o.level > maxPlayerLv) maxPlayerLv = o.level;
|
if(o.level > maxPlayerLv.max) maxPlayerLv.max = o.level;
|
||||||
dicKingExp.set(o.level, { sum: exp, cur: o.exp });
|
dicKingExp.set(o.level, { sum: exp, cur: o.exp });
|
||||||
});
|
});
|
||||||
arr = null;
|
arr = null;
|
||||||
|
|||||||
@@ -12,14 +12,14 @@ export interface DicRankRewads {
|
|||||||
|
|
||||||
|
|
||||||
export const dicRankRewads = new Array<DicRankRewads>();
|
export const dicRankRewads = new Array<DicRankRewads>();
|
||||||
export let dicRankMax: DicRankRewads;
|
export const dicRankMax: { max: DicRankRewads } = { max: undefined };
|
||||||
export function loadPvpRankReward() {
|
export function loadPvpRankReward() {
|
||||||
let arr = readFileAndParse(FILENAME.DIC_PVP_RANK_REWARD);
|
let arr = readFileAndParse(FILENAME.DIC_PVP_RANK_REWARD);
|
||||||
|
|
||||||
arr.forEach(o => {
|
arr.forEach(o => {
|
||||||
o.reward = parseGoodStr(o.reward);
|
o.reward = parseGoodStr(o.reward);
|
||||||
if (!dicRankMax||o.min > dicRankMax.min) {
|
if (!dicRankMax.max||o.min > dicRankMax.max.min) {
|
||||||
dicRankMax = o;
|
dicRankMax.max = o;
|
||||||
}
|
}
|
||||||
dicRankRewads.push(o);
|
dicRankRewads.push(o);
|
||||||
});
|
});
|
||||||
|
|||||||
@@ -13,14 +13,14 @@ export interface DicPvpRefreshConsume {
|
|||||||
}
|
}
|
||||||
|
|
||||||
export const dicPvpRefreshConsume = new Map<number, RewardInter[]>();
|
export const dicPvpRefreshConsume = new Map<number, RewardInter[]>();
|
||||||
export let maxPvpRefreshCnt = 0;
|
export const maxPvpRefreshCnt = { max: 0 };
|
||||||
export function loadPvpRefreshConsume() {
|
export function loadPvpRefreshConsume() {
|
||||||
|
|
||||||
let arr = readFileAndParse(FILENAME.DIC_PVP_REFRESH_CONSUME);
|
let arr = readFileAndParse(FILENAME.DIC_PVP_REFRESH_CONSUME);
|
||||||
|
|
||||||
arr.forEach(o => {
|
arr.forEach(o => {
|
||||||
o.consume = parseGoodStr(o.consume);
|
o.consume = parseGoodStr(o.consume);
|
||||||
if(o.count > maxPvpRefreshCnt) maxPvpRefreshCnt = o.count;
|
if(o.count > maxPvpRefreshCnt.max) maxPvpRefreshCnt.max = o.count;
|
||||||
dicPvpRefreshConsume.set(o.count, o.consume);
|
dicPvpRefreshConsume.set(o.count, o.consume);
|
||||||
});
|
});
|
||||||
|
|
||||||
|
|||||||
@@ -156,7 +156,7 @@ export const dicTrainBase = new Map<number, DicTrainBase>(); // 练兵场
|
|||||||
export const dicDonateBase = new Map<number, DicDonateBase>(); // 捐献所
|
export const dicDonateBase = new Map<number, DicDonateBase>(); // 捐献所
|
||||||
export const dicWishPoolBase = new Map<number, DicWishPoolBase>(); // 许愿池
|
export const dicWishPoolBase = new Map<number, DicWishPoolBase>(); // 许愿池
|
||||||
export const dicStoreBase = new Map<number, DicWishPoolBase>(); // 许愿池
|
export const dicStoreBase = new Map<number, DicWishPoolBase>(); // 许愿池
|
||||||
export let maxMemberCnt = 0; // 满配最大人数
|
export const maxMemberCnt = { max: 0 }; // 满配最大人数
|
||||||
|
|
||||||
export function loadStructure() {
|
export function loadStructure() {
|
||||||
|
|
||||||
@@ -169,7 +169,7 @@ export function loadStructure() {
|
|||||||
let arrCenter = readFileAndParse(FILENAME.DIC_GUILD_STRUCTURE_CENTER);
|
let arrCenter = readFileAndParse(FILENAME.DIC_GUILD_STRUCTURE_CENTER);
|
||||||
arrCenter.forEach(o => {
|
arrCenter.forEach(o => {
|
||||||
setStructureConsume(o);
|
setStructureConsume(o);
|
||||||
if(o.peopleNum > maxMemberCnt) maxMemberCnt = o.peopleNum;
|
if(o.peopleNum > maxMemberCnt.max) maxMemberCnt.max = o.peopleNum;
|
||||||
dicCenterBase.set(o.level, _.pick(o, Object.keys(DicCenterKeys)));
|
dicCenterBase.set(o.level, _.pick(o, Object.keys(DicCenterKeys)));
|
||||||
});
|
});
|
||||||
arrCenter = undefined;
|
arrCenter = undefined;
|
||||||
|
|||||||
Reference in New Issue
Block a user