订单优化
This commit is contained in:
parent
a59a667a46
commit
32e37f5bd4
@ -78,7 +78,7 @@ func (o *OrderMod) InitData() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
for k, v := range o.OrderList {
|
for k, v := range o.OrderList {
|
||||||
if GoUtil.InArray(0, v.MergeId) {
|
if GoUtil.InArray(0, v.MergeId) || len(v.MergeId) == 0 {
|
||||||
delete(o.OrderList, k)
|
delete(o.OrderList, k)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -116,7 +116,7 @@ func (o *OrderMod) CreateOrderSeed(Order *Order) error {
|
|||||||
break
|
break
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
o.addOrder(Order.MergeId, Order.Diff, Common_type)
|
o.addOrder(Order.MergeId, DIFF_LOW, Common_type)
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@ -22,12 +22,6 @@ func getChessNumRand(OrderN int) map[int]int {
|
|||||||
func getOrderDiffRand(Diff, OrderN int) map[int]int {
|
func getOrderDiffRand(Diff, OrderN int) map[int]int {
|
||||||
var d map[int]int
|
var d map[int]int
|
||||||
switch Diff {
|
switch Diff {
|
||||||
case DIFF_LOW:
|
|
||||||
d = map[int]int{
|
|
||||||
DIFF_LOW: int(10 - OrderN),
|
|
||||||
DIFF_MID: int(30),
|
|
||||||
DIFF_HIGH: int(60 + OrderN),
|
|
||||||
}
|
|
||||||
case DIFF_MID:
|
case DIFF_MID:
|
||||||
d = map[int]int{
|
d = map[int]int{
|
||||||
DIFF_LOW: int(21 - 3*OrderN),
|
DIFF_LOW: int(21 - 3*OrderN),
|
||||||
@ -40,6 +34,12 @@ func getOrderDiffRand(Diff, OrderN int) map[int]int {
|
|||||||
DIFF_MID: int(30 + 3*float64(OrderN)),
|
DIFF_MID: int(30 + 3*float64(OrderN)),
|
||||||
DIFF_HIGH: int(10 + 2*float64(OrderN)),
|
DIFF_HIGH: int(10 + 2*float64(OrderN)),
|
||||||
}
|
}
|
||||||
|
default:
|
||||||
|
d = map[int]int{
|
||||||
|
DIFF_LOW: int(10 - OrderN),
|
||||||
|
DIFF_MID: int(30),
|
||||||
|
DIFF_HIGH: int(60 + OrderN),
|
||||||
|
}
|
||||||
}
|
}
|
||||||
return d
|
return d
|
||||||
}
|
}
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user