|
10 | 10 | #include "gtest/gtest.h" |
11 | 11 | #include "VecSim/vec_sim.h" |
12 | 12 | #include "unit_test_utils.h" |
| 13 | +#include <array> |
13 | 14 | #include <cmath> |
| 15 | +#include <vector> |
14 | 16 |
|
15 | 17 | #if HAVE_SVS |
16 | 18 | #include "VecSim/algorithms/svs/svs.h" |
@@ -187,9 +189,9 @@ TYPED_TEST(SVSTest, svs_bulk_vectors_add_delete_test) { |
187 | 189 |
|
188 | 190 | auto svs_index = this->CastToSVS(index); // CAST_TO_SVS(index, svs::distance::DistanceL2); |
189 | 191 |
|
190 | | - std::vector<TEST_DATA_T[dim]> v(n); |
| 192 | + std::vector<std::array<TEST_DATA_T, dim>> v(n); |
191 | 193 | for (size_t i = 0; i < n; i++) { |
192 | | - GenerateVector<TEST_DATA_T>(v[i], dim, i); |
| 194 | + GenerateVector<TEST_DATA_T>(v[i].data(), dim, i); |
193 | 195 | } |
194 | 196 |
|
195 | 197 | std::vector<size_t> ids(n); |
@@ -1408,7 +1410,7 @@ TYPED_TEST(SVSTest, svs_vector_search_test_cosine) { |
1408 | 1410 | ASSERT_INDEX(index); |
1409 | 1411 |
|
1410 | 1412 | // To meet accurary in LVQ case we have to add bulk of vectors at once. |
1411 | | - std::vector<TEST_DATA_T[dim]> v(n); |
| 1413 | + std::vector<std::array<TEST_DATA_T, dim>> v(n); |
1412 | 1414 | for (size_t i = 1; i <= n; i++) { |
1413 | 1415 | auto &f = v[i - 1]; |
1414 | 1416 | f[0] = (TEST_DATA_T)i / n; |
@@ -1775,7 +1777,7 @@ TYPED_TEST(SVSTest, rangeQueryCosine) { |
1775 | 1777 | ASSERT_INDEX(index); |
1776 | 1778 |
|
1777 | 1779 | // To meet accurary in LVQ case we have to add bulk of vectors at once. |
1778 | | - std::vector<TEST_DATA_T[dim]> v(n); |
| 1780 | + std::vector<std::array<TEST_DATA_T, dim>> v(n); |
1779 | 1781 | std::vector<size_t> ids(n); |
1780 | 1782 |
|
1781 | 1783 | for (size_t i = 0; i < n; i++) { |
|
0 commit comments