提交 5b2f988e 编写于 作者: V Vincent Rabaud

- use the new result set

上级 c8a5ee61
......@@ -192,7 +192,7 @@ void Index<Distance>::knnSearch(const Matrix<ElementType>& queries, Matrix<int>&
assert(int(indices.cols) >= knn);
assert(int(dists.cols) >= knn);
#if 1
#if 0
KNNResultSet<DistanceType> resultSet(knn);
for (size_t i = 0; i < queries.rows; i++) {
resultSet.init(indices[i], dists[i]);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册