mirror of
https://gitee.com/milvus-io/milvus.git
synced 2026-01-01 08:28:10 +08:00
replace int with size_t (#2140)
Signed-off-by: Gracieeea <sly_freesoul@icloud.com>
This commit is contained in:
parent
e1c49cc48b
commit
509b87f103
@ -46,7 +46,7 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
|
||||
|
||||
void addPoint(const void *datapoint, labeltype label) {
|
||||
|
||||
int idx;
|
||||
size_t idx;
|
||||
{
|
||||
std::unique_lock<std::mutex> lock(index_lock);
|
||||
|
||||
@ -90,13 +90,13 @@ class BruteforceSearch : public AlgorithmInterface<dist_t> {
|
||||
searchKnn(const void *query_data, size_t k) const {
|
||||
std::priority_queue<std::pair<dist_t, labeltype >> topResults;
|
||||
if (cur_element_count == 0) return topResults;
|
||||
for (int i = 0; i < k; i++) {
|
||||
for (size_t i = 0; i < k; i++) {
|
||||
dist_t dist = fstdistfunc_(query_data, data_ + size_per_element_ * i, dist_func_param_);
|
||||
topResults.push(std::pair<dist_t, labeltype>(dist, *((labeltype *) (data_ + size_per_element_ * i +
|
||||
data_size_))));
|
||||
}
|
||||
dist_t lastdist = topResults.top().first;
|
||||
for (int i = k; i < cur_element_count; i++) {
|
||||
for (size_t i = k; i < cur_element_count; i++) {
|
||||
dist_t dist = fstdistfunc_(query_data, data_ + size_per_element_ * i, dist_func_param_);
|
||||
if (dist <= lastdist) {
|
||||
topResults.push(std::pair<dist_t, labeltype>(dist, *((labeltype *) (data_ + size_per_element_ * i +
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user