Skip to content

Commit 8262fe6

Browse files
authored
Clean raft/neighbors comments (rapidsai#1651)
Clean up unused/outdated `raft/neighbors` comments Authors: - Anupam (https://github.com/aamijar) Approvers: - Divye Gala (https://github.com/divyegala) URL: rapidsai#1651
1 parent 4eac302 commit 8262fe6

File tree

7 files changed

+6
-8
lines changed

7 files changed

+6
-8
lines changed

cpp/bench/ann/src/cuvs/cuvs_cagra_wrapper.h

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -22,8 +22,6 @@
2222
#include <raft/core/logger.hpp>
2323
#include <raft/core/operators.hpp>
2424
#include <raft/linalg/unary_op.cuh>
25-
// #include <raft/neighbors/dataset.hpp>
26-
// #include <raft/neighbors/detail/cagra/cagra_build.cuh>
2725
#include <raft/util/cudart_utils.hpp>
2826

2927
#include <rmm/device_uvector.hpp>

docs/source/c_api/neighbors_bruteforce_c.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ The bruteforce method is running the KNN algorithm. It performs an extensive sea
77
:language: c
88
:class: highlight
99

10-
``#include <raft/neighbors/bruteforce.h>``
10+
``#include <cuvs/neighbors/bruteforce.h>``
1111

1212
Index
1313
-----

docs/source/c_api/neighbors_cagra_c.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ CAGRA is a graph-based nearest neighbors algorithm that was built from the groun
88
:language: c
99
:class: highlight
1010

11-
``#include <raft/neighbors/cagra.h>``
11+
``#include <cuvs/neighbors/cagra.h>``
1212

1313
Index build parameters
1414
----------------------

docs/source/c_api/neighbors_hnsw_c.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ This is a wrapper for hnswlib, to load a CAGRA index as an immutable HNSW index.
88
:language: c
99
:class: highlight
1010

11-
``#include <raft/neighbors/hnsw.h>``
11+
``#include <cuvs/neighbors/hnsw.h>``
1212

1313
Index search parameters
1414
-----------------------

docs/source/c_api/neighbors_ivf_flat_c.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ The IVF-Flat method is an ANN algorithm. It uses an inverted file index (IVF) wi
77
:language: c
88
:class: highlight
99

10-
``#include <raft/neighbors/ivf_flat.h>``
10+
``#include <cuvs/neighbors/ivf_flat.h>``
1111

1212
Index build parameters
1313
----------------------

docs/source/c_api/neighbors_ivf_pq_c.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ The IVF-PQ method is an ANN algorithm. Like IVF-Flat, IVF-PQ splits the points i
77
:language: c
88
:class: highlight
99

10-
``#include <raft/neighbors/ivf_pq.h>``
10+
``#include <cuvs/neighbors/ivf_pq.h>``
1111

1212
Index build parameters
1313
----------------------

docs/source/c_api/neighbors_vamana_c.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ Vamana is the graph construction algorithm behind the well-known DiskANN vector
88
:language: c
99
:class: highlight
1010

11-
``#include <raft/neighbors/vamana.h>``
11+
``#include <cuvs/neighbors/vamana.h>``
1212

1313
Index build parameters
1414
----------------------

0 commit comments

Comments
 (0)