高级订单优化
This commit is contained in:
parent
9f968554cb
commit
fd0939df7f
@ -559,6 +559,7 @@ func ReqGetChessFromBuff(player *Player, buf []byte) error {
|
|||||||
if Update {
|
if Update {
|
||||||
player.PushClientRes(OrderMod.BackData())
|
player.PushClientRes(OrderMod.BackData())
|
||||||
}
|
}
|
||||||
|
triggerComposeChess(player, ChessId, player.PlayMod.getBaseMod().EnergyMul, player.PlayMod.getChessMod().GetEmitList())
|
||||||
EmitRetireTrigger1(player)
|
EmitRetireTrigger1(player)
|
||||||
player.PlayMod.save()
|
player.PlayMod.save()
|
||||||
player.PushClientRes(ChessMod.BackData())
|
player.PushClientRes(ChessMod.BackData())
|
||||||
|
|||||||
@ -447,23 +447,23 @@ func (o *OrderMod) CreateExtraOrder(AddChess, AddNewEmit, ChessList []int, Energ
|
|||||||
o.addOrder([]int{ChessId}, DIFF_LOW, Preheat_type)
|
o.addOrder([]int{ChessId}, DIFF_LOW, Preheat_type)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
//额外订单补充2;当玩家的棋盘中出现三个相同的满级产物时,立刻生成一个对应的收购订单;
|
// //额外订单补充2;当玩家的棋盘中出现三个相同的满级产物时,立刻生成一个对应的收购订单;
|
||||||
for k := range MaxLvChess {
|
// for k := range MaxLvChess {
|
||||||
ChessNum := GoUtil.GetElemNum(ChessList, k)
|
// ChessNum := GoUtil.GetElemNum(ChessList, k)
|
||||||
OrderChess := 0
|
// OrderChess := 0
|
||||||
for _, order := range o.OrderList {
|
// for _, order := range o.OrderList {
|
||||||
for _, v := range order.MergeId {
|
// for _, v := range order.MergeId {
|
||||||
if v == k {
|
// if v == k {
|
||||||
OrderChess++
|
// OrderChess++
|
||||||
}
|
// }
|
||||||
}
|
// }
|
||||||
}
|
// }
|
||||||
OrderNum := (ChessNum - OrderChess) / 3
|
// OrderNum := (ChessNum - OrderChess) / 3
|
||||||
for i := 0; i < OrderNum; i++ {
|
// for i := 0; i < OrderNum; i++ {
|
||||||
b1 = true
|
// b1 = true
|
||||||
o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type)
|
// o.addOrder([]int{k, k, k}, DIFF_LOW, Extra_type)
|
||||||
}
|
// }
|
||||||
}
|
// }
|
||||||
return b1
|
return b1
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user