Update codespell Version in pre-commit-config (#1920)

Authors:
  - Tarang Jain (https://github.com/tarang-jain)

Approvers:
  - Gil Forsyth (https://github.com/gforsyth)
  - Bradley Dice (https://github.com/bdice)
  - Ben Frederickson (https://github.com/benfred)

URL: #1920

Author: tarang-jain

.pre-commit-config.yaml

@@ -92,7 +92,7 @@ repos:
                 files: rust/.*
                 language: rust
       - repo: https://github.com/codespell-project/codespell
-        rev: v2.2.2
+        rev: v2.4.1
         hooks:
               - id: codespell
                 additional_dependencies: [tomli]

cpp/CMakeLists.txt

@@ -111,7 +111,7 @@ message(VERBOSE "cuVS: Build CPU only components: ${BUILD_CPU_ONLY}")
 message(VERBOSE "cuVS: Build ANN benchmarks: ${BUILD_CUVS_BENCH}")
 message(VERBOSE "cuVS: Build only the shared library: ${CUVS_COMPILE_DYNAMIC_ONLY}")
 message(VERBOSE "cuVS: Enable detection of conda environment for dependencies: ${DETECT_CONDA_ENV}")
-message(VERBOSE "cuVS: Disable depreaction warnings " ${DISABLE_DEPRECATION_WARNINGS})
+message(VERBOSE "cuVS: Disable deprecation warnings " ${DISABLE_DEPRECATION_WARNINGS})
 message(VERBOSE "cuVS: Disable OpenMP: ${DISABLE_OPENMP}")
 message(VERBOSE "cuVS: Enable kernel resource usage info: ${CUDA_ENABLE_KERNELINFO}")
 message(VERBOSE "cuVS: Enable lineinfo in nvcc: ${CUDA_ENABLE_LINEINFO}")

cpp/include/cuvs/cluster/agglomerative.hpp

@@ -1,5 +1,5 @@
 /*
- * SPDX-FileCopyrightText: Copyright (c) 2021-2025, NVIDIA CORPORATION.
+ * SPDX-FileCopyrightText: Copyright (c) 2021-2026, NVIDIA CORPORATION.
  * SPDX-License-Identifier: Apache-2.0
  */
 
@@ -91,7 +91,7 @@ class single_linkage_output {
  * @param[in] X dense input matrix in row-major layout
  * @param[out] dendrogram output dendrogram (size [n_rows - 1] * 2)
  * @param[out] labels output labels vector (size n_rows)
- * @param[in] metric distance metrix to use when constructing connectivities graph
+ * @param[in] metric distance metric to use when constructing connectivities graph
  * @param[in] n_clusters number of clusters to assign data samples
  * @param[in] linkage strategy for constructing the linkage. PAIRWISE uses more memory but can be
  faster for

cpp/include/cuvs/neighbors/all_neighbors.hpp

@@ -111,7 +111,7 @@ struct all_neighbors_params {
  *  all_neighbors::build(res, params, dataset, indices.view(), distances.view());
  * @endcode
  *
- * @param[in] handle raft::resources is an object mangaging resources
+ * @param[in] handle raft::resources is an object managing resources
  * @param[in] params an instance of all_neighbors::all_neighbors_params that are parameters
  *               to build all-neighbors knn graph
  * @param[in] dataset raft::host_matrix_view input dataset expected to be located
@@ -147,7 +147,7 @@ void build(
  *  all_neighbors::build(res, params, dataset, indices.view(), distances.view());
  * @endcode
  *
- * @param[in] handle raft::resources is an object mangaging resources
+ * @param[in] handle raft::resources is an object managing resources
  * @param[in] params an instance of all_neighbors::all_neighbors_params that are parameters
  *               to build all-neighbors knn graph
  * @param[in] dataset raft::device_matrix_view input dataset expected to be located

cpp/include/cuvs/neighbors/common.hpp

@@ -224,7 +224,7 @@ template <typename DatasetT>
 inline constexpr bool is_strided_dataset_v = is_strided_dataset<DatasetT>::value;
 
 /**
- * @brief Contstruct a strided matrix from any mdarray or mdspan.
+ * @brief Construct a strided matrix from any mdarray or mdspan.
  *
  * This function constructs a non-owning view if the input satisfied two conditions:
  *
@@ -299,7 +299,7 @@ auto make_strided_dataset(const raft::resources& res, const SrcT& src, uint32_t
 }
 
 /**
- * @brief Contstruct a strided matrix from any mdarray.
+ * @brief Construct a strided matrix from any mdarray.
  *
  * This function constructs an owning device matrix and copies the data.
  * When the data is copied, padding elements are filled with zeroes.
@@ -370,7 +370,7 @@ auto make_strided_dataset(
 }
 
 /**
- * @brief Contstruct a strided matrix from any mdarray or mdspan.
+ * @brief Construct a strided matrix from any mdarray or mdspan.
  *
  * A variant `make_strided_dataset` that allows specifying the byte alignment instead of the
  * explicit stride length.
@@ -915,7 +915,7 @@ enum distribution_mode {
 /** Search mode when using a replicated index */
 /// \ingroup mg_cpp_search_params
 enum replicated_search_mode {
-  /** Search queries are splited to maintain equal load on GPUs */
+  /** Search queries are split to maintain equal load on GPUs */
   LOAD_BALANCER,
   /** Each search query is processed by a single GPU in a round-robin fashion */
   ROUND_ROBIN

cpp/include/cuvs/neighbors/ivf_flat.hpp

@@ -242,7 +242,7 @@ struct index : cuvs::neighbors::index {
   raft::device_vector_view<IdxT* const, uint32_t> inds_ptrs() const noexcept;
 
   /**
-   * Whether to use convervative memory allocation when extending the list (cluster) data
+   * Whether to use conservative memory allocation when extending the list (cluster) data
    * (see index_params.conservative_memory_allocation).
    */
   bool conservative_memory_allocation() const noexcept;

cpp/include/cuvs/neighbors/ivf_pq.hpp

@@ -567,7 +567,7 @@ class index : public index_iface<IdxT>, cuvs::neighbors::index {
   uint32_t n_lists() const noexcept;
 
   /**
-   * Whether to use convervative memory allocation when extending the list (cluster) data
+   * Whether to use conservative memory allocation when extending the list (cluster) data
    * (see index_params.conservative_memory_allocation).
    */
   bool conservative_memory_allocation() const noexcept override;

cpp/include/cuvs/neighbors/nn_descent.hpp

@@ -101,7 +101,7 @@ struct index : cuvs::neighbors::index {
    * The type of the knn-graph is a dense raft::host_matrix and dimensions are
    * (n_rows, n_cols).
    *
-   * @param res raft::resources is an object mangaging resources
+   * @param res raft::resources is an object managing resources
    * @param n_rows number of rows in knn-graph
    * @param n_cols number of cols in knn-graph
    * @param return_distances whether to return distances
@@ -132,7 +132,7 @@ struct index : cuvs::neighbors::index {
    * The type of the knn-graph is a dense raft::host_matrix and dimensions are
    * (n_rows, n_cols).
    *
-   * @param res raft::resources is an object mangaging resources
+   * @param res raft::resources is an object managing resources
    * @param graph_view raft::host_matrix_view<IdxT, int64_t, raft::row_major> for storing knn-graph
    * @param distances_view optional raft::device_matrix_view<float, int64_t, row_major> for storing
    * distances
@@ -232,7 +232,7 @@ struct index : cuvs::neighbors::index {
  *   // dataset
  * @endcode
  *
- * @param[in] res raft::resources is an object mangaging resources
+ * @param[in] res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::device_matrix_view input dataset expected to be located
@@ -271,7 +271,7 @@ auto build(raft::resources const& res,
  *
  * @tparam T data-type of the input dataset
  * @tparam IdxT data-type for the output index
- * @param res raft::resources is an object mangaging resources
+ * @param res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::host_matrix_view input dataset expected to be located
@@ -308,7 +308,7 @@ auto build(raft::resources const& res,
  *   // dataset
  * @endcode
  *
- * @param[in] res raft::resources is an object mangaging resources
+ * @param[in] res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::device_matrix_view input dataset expected to be located
@@ -347,7 +347,7 @@ auto build(raft::resources const& res,
  *
  * @tparam T data-type of the input dataset
  * @tparam IdxT data-type for the output index
- * @param res raft::resources is an object mangaging resources
+ * @param res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::host_matrix_view input dataset expected to be located
@@ -385,7 +385,7 @@ auto build(raft::resources const& res,
  *   // dataset
  * @endcode
  *
- * @param[in] res raft::resources is an object mangaging resources
+ * @param[in] res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::device_matrix_view input dataset expected to be located
@@ -425,7 +425,7 @@ auto build(raft::resources const& res,
  *
  * @tparam T data-type of the input dataset
  * @tparam IdxT data-type for the output index
- * @param res raft::resources is an object mangaging resources
+ * @param res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::host_matrix_view input dataset expected to be located
@@ -463,7 +463,7 @@ auto build(raft::resources const& res,
  *   // dataset
  * @endcode
  *
- * @param[in] res raft::resources is an object mangaging resources
+ * @param[in] res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::device_matrix_view input dataset expected to be located
@@ -503,7 +503,7 @@ auto build(raft::resources const& res,
  *
  * @tparam T data-type of the input dataset
  * @tparam IdxT data-type for the output index
- * @param res raft::resources is an object mangaging resources
+ * @param res raft::resources is an object managing resources
  * @param[in] params an instance of nn_descent::index_params that are parameters
  *               to run the nn-descent algorithm
  * @param[in] dataset raft::host_matrix_view input dataset expected to be located

cpp/include/cuvs/neighbors/scann.hpp

@@ -1,5 +1,5 @@
 /*
- * SPDX-FileCopyrightText: Copyright (c) 2024-2025, NVIDIA CORPORATION.
+ * SPDX-FileCopyrightText: Copyright (c) 2024-2026, NVIDIA CORPORATION.
  * SPDX-License-Identifier: Apache-2.0
  */
 
@@ -266,7 +266,7 @@ struct index : cuvs::neighbors::index {
    * The bits of __nv_bfloat16 are stored here reinterpreted as int16_t
    *
    * int16_t is used for two reaosns:
-   * * OSS ScaNN expects int16_t, so the serialzed bf16_dataset_ can be consumed
+   * * OSS ScaNN expects int16_t, so the serialized bf16_dataset_ can be consumed
    *   without any additional post-processing
    * * For AVQ, we need to find the next bfloat16 number that is larger/smaller than a
    *   given float. This is equivalent to incrementing/decrementing the mantissa

cpp/include/cuvs/neighbors/vamana.hpp

@@ -1,5 +1,5 @@
 /*
- * SPDX-FileCopyrightText: Copyright (c) 2024-2025, NVIDIA CORPORATION.
+ * SPDX-FileCopyrightText: Copyright (c) 2024-2026, NVIDIA CORPORATION.
  * SPDX-License-Identifier: Apache-2.0
  */
 
@@ -42,7 +42,7 @@ struct codebook_params {
 /**
  * @brief Parameters used to build DiskANN index
  *
- * `graph_degree`: Maximum degree of graph; correspods to the R parameter of
+ * `graph_degree`: Maximum degree of graph; corresponds to the R parameter of
  * Vamana algorithm in the literature.
  * `visited_size`: Maximum number of visited nodes per search during Vamana algorithm.
  * Loosely corresponds to the L parameter in the literature.