From 3c8074e9070d551a629f53fe33d1e933e6ccf34f Mon Sep 17 00:00:00 2001
From: Tobias Ribizel <mail@ribizel.de>
Date: Sun, 19 Jan 2025 22:46:45 +0100
Subject: [PATCH] fix typos

---
 core/components/range_minimum_query.cpp |  8 ++++----
 core/components/range_minimum_query.hpp | 12 ++++++------
 2 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/core/components/range_minimum_query.cpp b/core/components/range_minimum_query.cpp
index 8cccf353ed2..703d38befde 100644
--- a/core/components/range_minimum_query.cpp
+++ b/core/components/range_minimum_query.cpp
@@ -28,8 +28,8 @@ device_range_minimum_query<IndexType>::device_range_minimum_query(
     : num_blocks_{static_cast<index_type>(
           ceildiv(static_cast<index_type>(data.get_size()), block_size))},
       lut_{data.get_executor()},
-      block_tree_indexs_{data.get_executor(),
-                         static_cast<size_type>(num_blocks_)},
+      block_tree_indices_{data.get_executor(),
+                          static_cast<size_type>(num_blocks_)},
       block_argmin_storage_{
           data.get_executor(),
           static_cast<size_type>(block_argmin_view_type::storage_size(
@@ -45,7 +45,7 @@ device_range_minimum_query<IndexType>::device_range_minimum_query(
         block_argmin_storage_.get_data(), block_argmin_num_bits, num_blocks_};
     exec->run(make_compute_lookup_small(
         values_.get_const_data(), static_cast<index_type>(values_.get_size()),
-        block_argmin, block_min_.get_data(), block_tree_indexs_.get_data()));
+        block_argmin, block_min_.get_data(), block_tree_indices_.get_data()));
     auto superblocks =
         superblock_view_type{block_min_.get_const_data(),
                              superblock_storage_.get_data(), num_blocks_};
@@ -61,7 +61,7 @@ device_range_minimum_query<IndexType>::get() const
     return range_minimum_query{values_.get_const_data(),
                                block_min_.get_const_data(),
                                block_argmin_storage_.get_const_data(),
-                               block_tree_indexs_.get_const_data(),
+                               block_tree_indices_.get_const_data(),
                                superblock_storage_.get_const_data(),
                                lut_.get(),
                                static_cast<index_type>(values_.get_size())};
diff --git a/core/components/range_minimum_query.hpp b/core/components/range_minimum_query.hpp
index 596d9d64eb6..e1c1402ab10 100644
--- a/core/components/range_minimum_query.hpp
+++ b/core/components/range_minimum_query.hpp
@@ -139,7 +139,7 @@ struct cartesian_tree {
             // The root node of a Cartesian tree is its minimum, so we can
             // enumerate all possible Cartesian trees by choosing all possible
             // minimum positions, and the left and right subtrees/left and right
-            // halves around the minimum can be choosen independently.
+            // halves around the minimum can be chosen independently.
             // This enumeration does not list representatives in order of their
             // tree index, so we need to use compute_tree_index internally.
             for (int min_pos = 0; min_pos < cur_num_nodes; min_pos++) {
@@ -558,7 +558,7 @@ class range_minimum_query {
         const block_lookup_type* block_lut, index_type size)
         : num_blocks_{static_cast<index_type>(ceildiv(size, block_size))},
           values_{values},
-          block_tree_indexs_{block_tree_index},
+          block_tree_indices_{block_tree_index},
           block_argmin_{block_argmin, ceil_log2_constexpr(block_size),
                         num_blocks_},
           superblocks_{block_min, superblock_storage, num_blocks_},
@@ -588,8 +588,8 @@ class range_minimum_query {
         const auto first_local = first - first_block_base;
         const auto last_block_base = last_block * block_size;
         const auto last_local = last - last_block_base;
-        const auto first_block_tree_index = block_tree_indexs_[first_block];
-        const auto last_block_tree_index = block_tree_indexs_[last_block];
+        const auto first_block_tree_index = block_tree_indices_[first_block];
+        const auto last_block_tree_index = block_tree_indices_[last_block];
         // both values in the same block
         if (first_block == last_block) {
             const auto argmin =
@@ -647,7 +647,7 @@ class range_minimum_query {
 private:
     index_type num_blocks_;
     const index_type* values_;
-    const uint16* block_tree_indexs_;
+    const uint16* block_tree_indices_;
     bit_packed_span<int, index_type, const uint32> block_argmin_;
     superblock_lookup_type superblocks_;
     const block_lookup_type* block_lut_;
@@ -695,7 +695,7 @@ class device_range_minimum_query {
 private:
     index_type num_blocks_;
     block_lut_type lut_;
-    array<uint16> block_tree_indexs_;
+    array<uint16> block_tree_indices_;
     array<block_argmin_storage_type> block_argmin_storage_;
     array<index_type> block_min_;
     array<superblock_storage_type> superblock_storage_;