1 Star 0 Fork 0

蒙蒙的男孩 / polaris-go

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
search.go 1.74 KB
一键复制 编辑 原始数据 按行查看 历史
蒙蒙的男孩 提交于 2023-10-22 16:32 . 1.5.4
/**
* Tencent is pleased to support the open source community by making polaris-go available.
*
* Copyright (C) 2019 THL A29 Limited, a Tencent company. All rights reserved.
*
* Licensed under the BSD 3-Clause License (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://opensource.org/licenses/BSD-3-Clause
*
* Unless required by applicable law or agreed to in writing, software distributed
* under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
* CONDITIONS OF ANY KIND, either express or implied. See the License for the
* specific language governing permissions and limitations under the License.
*/
// Package search .
package search
// SearchableSlice 可搜索的数组
type SearchableSlice interface {
// GetValue 获取某个下标下面的值
GetValue(idx int) uint64
// Count 获取数组长度
Count() int
}
// selectLoop 通过循环方式进行二分查找
func selectLoop(weightedIndexes SearchableSlice, selector uint64) int {
var count = weightedIndexes.Count()
var lowp = 0
var highp = count
for {
var midp = (lowp + highp) / 2
if midp == count {
return 0
}
var midval = weightedIndexes.GetValue(midp)
var midval1 uint64
if midp != 0 {
midval1 = weightedIndexes.GetValue(midp - 1)
}
if selector <= midval && selector > midval1 {
return midp
}
if midval < selector {
lowp = midp + 1
} else {
highp = midp - 1
}
if lowp > highp {
return 0
}
}
}
// BinarySearch 二分查找
func BinarySearch(weightedIndexes SearchableSlice, selector uint64) int {
// return selectRecursive(weightedIndexes, 0, weightedIndexes.Count(), selector)
return selectLoop(weightedIndexes, selector)
}
1
https://gitee.com/meng_mengs_boys/polaris-go.git
git@gitee.com:meng_mengs_boys/polaris-go.git
meng_mengs_boys
polaris-go
polaris-go
v1.5.4

搜索帮助