高级订单优化

This commit is contained in:
hahwu 2025-03-10 17:42:05 +08:00
parent 9f968554cb
commit fd0939df7f
2 changed files with 18 additions and 17 deletions

View File

@ -559,6 +559,7 @@ func ReqGetChessFromBuff(player *Player, buf []byte) error {
if Update {
player.PushClientRes(OrderMod.BackData())
}
triggerComposeChess(player, ChessId, player.PlayMod.getBaseMod().EnergyMul, player.PlayMod.getChessMod().GetEmitList())
EmitRetireTrigger1(player)
player.PlayMod.save()
player.PushClientRes(ChessMod.BackData())

View File

@ -447,23 +447,23 @@ func (o *OrderMod) CreateExtraOrder(AddChess, AddNewEmit, ChessList []int, Energ
o.addOrder([]int{ChessId}, DIFF_LOW, Preheat_type)
}
}
//额外订单补充2当玩家的棋盘中出现三个相同的满级产物时立刻生成一个对应的收购订单
for k := range MaxLvChess {
ChessNum := GoUtil.GetElemNum(ChessList, k)
OrderChess := 0
for _, order := range o.OrderList {
for _, v := range order.MergeId {
if v == k {
OrderChess++
}
}
}
OrderNum := (ChessNum - OrderChess) / 3
for i := 0; i < OrderNum; i++ {
b1 = true
o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type)
}
}
// //额外订单补充2当玩家的棋盘中出现三个相同的满级产物时立刻生成一个对应的收购订单
// for k := range MaxLvChess {
// ChessNum := GoUtil.GetElemNum(ChessList, k)
// OrderChess := 0
// for _, order := range o.OrderList {
// for _, v := range order.MergeId {
// if v == k {
// OrderChess++
// }
// }
// }
// OrderNum := (ChessNum - OrderChess) / 3
// for i := 0; i < OrderNum; i++ {
// b1 = true
// o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type)
// }
// }
return b1
}