huangzj/Go-tool
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

feat(Go-Tool)：新增lomute划分算法效率单测,结果：多次查找，元素多的情况下由末尾开始查找效率更高

Browse Source
This commit is contained in:
Huangzj
2020-11-09 16:24:20 +08:00
parent f13bd3d529
commit 3616c4b5e5
4 changed files with 152 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files
util/bitStore/BitStoreTool.go
+4 -4
View File
@@ -51,7 +51,7 @@ func (bitStore *BitStore) IsGearReceive(gear int) bool {
return false
}
position := bitStore.getGearPosition(gear, length)
return (bitStore.GearPickList[length-1] & (2 << position)) > 0
return (bitStore.GearPickList[length-1] & (1 << position)) > 0
}
//获取对应档位奖励
@@ -59,7 +59,7 @@ func (bitStore *BitStore) ReceiveByGear(gear int) ([]int, map[int]bool) {
bitStore.checkIfReceive(gear) //校验是否被领取了
length := bitStore.dynamicGrowth(gear) //数组进行动态增长
position := bitStore.getGearPosition(gear, length) //获取档位在数组中的位数位置
bitStore.GearPickList[length-1] = bitStore.GearPickList[length-1] + (2 << uint(position))
bitStore.GearPickList[length-1] = bitStore.GearPickList[length-1] + (1 << uint(position))
return bitStore.GearPickList, bitStore.FindAllGearMap()
}
@@ -91,7 +91,7 @@ func (bitStore *BitStore) fullListDeal(listSize int, length int) map[int]bool {
resultMap := make(map[int]bool, 0)
for i := 0; i < length; i++ {
for j := 0; j < bit && bitStore.MaxGear > i*bit+j; j++ {
resultMap[i*bit+j+1] = (bitStore.GearPickList[i] & (2 << uint(j))) > 0
resultMap[i*bit+j+1] = (bitStore.GearPickList[i] & (1 << uint(j))) > 0
}
}
return resultMap
@@ -101,7 +101,7 @@ func (bitStore *BitStore) shortListDeal(listSize, length int) map[int]bool {
resultMap := make(map[int]bool, 0)
for i := 0; i < listSize; i++ {
for j := 0; j < bit; j++ {
resultMap[i*bit+j+1] = (bitStore.GearPickList[i] & (2 << uint(j))) > 0
resultMap[i*bit+j+1] = (bitStore.GearPickList[i] & (1 << uint(j))) > 0
}
}
for i := listSize; i < length; i++ {