1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
/*
* Copyright (c) Meta Platforms, Inc. and affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <faiss/utils/Heap.h>
#include <gtest/gtest.h>
#include <algorithm>
#include <numeric>
using namespace faiss;
TEST(Heap, addn_with_ids) {
size_t n = 1000;
size_t k = 1;
std::vector<int64_t> heap_labels(n, -1);
std::vector<float> heap_distances(n, 0);
float_minheap_array_t heaps = {
n, k, heap_labels.data(), heap_distances.data()};
heaps.heapify();
std::vector<int64_t> labels(n, 1);
std::vector<float> distances(n, 0.0f);
std::vector<int64_t> subset(n);
std::iota(subset.begin(), subset.end(), 0);
heaps.addn_with_ids(1, distances.data(), labels.data(), 1);
heaps.reorder();
EXPECT_TRUE(
std::all_of(heap_labels.begin(), heap_labels.end(), [](int64_t i) {
return i == 1;
}));
}
TEST(Heap, addn_query_subset_with_ids) {
size_t n = 20000000; // more than 2^24
size_t k = 1;
std::vector<int64_t> heap_labels(n, -1);
std::vector<float> heap_distances(n, 0);
float_minheap_array_t heaps = {
n, k, heap_labels.data(), heap_distances.data()};
heaps.heapify();
std::vector<int64_t> labels(n, 1);
std::vector<float> distances(n, 0.0f);
std::vector<int64_t> subset(n);
std::iota(subset.begin(), subset.end(), 0);
heaps.addn_query_subset_with_ids(
n, subset.data(), 1, distances.data(), labels.data(), 1);
heaps.reorder();
EXPECT_TRUE(
std::all_of(heap_labels.begin(), heap_labels.end(), [](int64_t i) {
return i == 1;
}));
}
|
