A round of leftover manual fixes and ignores

src/engine/QueryPlanner.cpp

@@ -1161,8 +1161,8 @@ void QueryPlanner::applyTextLimitsIfPossible(
       if (((plan._idsOfIncludedNodes &
             textLimit.idsOfMustBeFinishedOperations_) ^
            textLimit.idsOfMustBeFinishedOperations_) != 0) {
-        // Ther is still an operation that needs to be finished before this text
-        // limit can be applied
+        // There is still an operation that needs to be finished before this
+        // text limit can be applied
         i++;
         continue;
       }

src/index/PrefixHeuristic.cpp

@@ -118,7 +118,7 @@ std::pair<size_t, TreeNode*> TreeNode::getMaximum(size_t codelength) {
 
   _score = _sharedCount * relevantLength;
 
-  // Check if our own score is greater than any of the childrens
+  // Check if our own score is greater than any of the children
   // we choose >= so we get a valid pointer when there is only the root with
   // score 0 left.
   if (_score >= maxScore) {

src/util/PriorityQueue.h

@@ -153,7 +153,7 @@ class TreeBasedPQ {
   /**
    * Update the key of a value in the HeapBasedPQ
    * @param newKey
-   * @param handle inout parameter, will be changed to be a valid handle after
+   * @param handle in/out parameter, will be changed to be a valid handle after
    * the operation has finished.
    * @throws NotInPQException if the handle does not point into the PQ (because
    * of pop or erase operations)
@@ -370,7 +370,7 @@ class HeapBasedPQ {
    * associated with the handle
    *
    * @param newKey
-   * @param handle Inout parameter: Updated s.t. it stays valid.
+   * @param handle in/out parameter: Updated s.t. it stays valid.
    * @throws NotInPQException if the handle does not point into the PQ (because
    * of pop or erase operations)
    */

test/AlgorithmTest.cpp

@@ -31,7 +31,8 @@ TEST(Algorithm, Contains) {
       std::vector<std::string> substrings{"h", "a", "l", "ha", "al", "hal"};
       ASSERT_TRUE(std::ranges::all_of(
           substrings, [&s](const auto& el) { return contains(s, el); }));
-      std::vector<std::string> noSubstrings{"x", "hl", "hel"};
+      std::vector<std::string> noSubstrings{"x", "hl",
+                                            "hel"};  // codespell-ignore
       ASSERT_TRUE(std::ranges::none_of(
           noSubstrings, [&s](const auto& el) { return contains(s, el); }));
     }
@@ -40,7 +41,8 @@ TEST(Algorithm, Contains) {
                                                "ha", "al", "hal"};
       ASSERT_TRUE(std::ranges::all_of(
           substrings, [&s](const auto& el) { return contains(s, el); }));
-      std::vector<std::string_view> noSubstrings{"x", "hl", "hel"};
+      std::vector<std::string_view> noSubstrings{"x", "hl",
+                                                 "hel"};  // codespell-ignore
       ASSERT_TRUE(std::ranges::none_of(
           noSubstrings, [&s](const auto& el) { return contains(s, el); }));
     }

test/PriorityQueueTest.cpp

@@ -96,11 +96,11 @@ TEST(PqTest, TreeUpdateReinsert) {
     ASSERT_EQ(pq.size(), 0ul);
     ASSERT_THROW(pq.updateKey(15, &h), ad_utility::NotInPQException);
     ASSERT_EQ(pq.size(), 0ul);
-    auto h2 = pq.insert(500, "alot"s);
+    auto h2 = pq.insert(500, "alot"s);  // codespell-ignore
     ASSERT_EQ(pq.size(), 1ul);
     h = pq.pop();
     ASSERT_EQ(h.score(), 500);
-    ASSERT_EQ(h.value(), "alot"s);
+    ASSERT_EQ(h.value(), "alot"s);  // codespell-ignore
   };
   TreeBasedPQ<int, string> pq;
   test(pq);

test/StringUtilsTest.cpp

@@ -318,6 +318,6 @@ TEST(StringUtilsTest, findLiteralEnd) {
   using namespace ad_utility;
   EXPECT_EQ(findLiteralEnd("nothing", "\""), std::string_view::npos);
   EXPECT_EQ(findLiteralEnd("no\"thing", "\""), 2u);
-  EXPECT_EQ(findLiteralEnd("no\\\"thi\"ng", "\""), 7u);
+  EXPECT_EQ(findLiteralEnd("no\\\"thi\"ng", "\""), 7u);  // codespell-ignore
   EXPECT_EQ(findLiteralEnd("no\\\\\"thing", "\""), 4u);
 }