Fix typos spotted by @zarvox.

c++/src/kj/table.c++

@@ -172,7 +172,7 @@ size_t BTreeImpl::verifyNode(size_t size, FunctionParam<bool(uint, uint)>& f,
   }
 }
 
-void BTreeImpl::logInconsitency() const {
+void BTreeImpl::logInconsistency() const {
   KJ_LOG(ERROR,
       "BTreeIndex detected tree state inconsistency. This can happen if you create a kj::Table "
       "with a b-tree index and you modify the rows in the table post-indexing in a way that would "
@@ -437,7 +437,7 @@ void BTreeImpl::erase(uint row, const SearchKey& searchKey) {
         *fixup = leaf.rows[r - 1];
       }
     } else {
-      logInconsitency();
+      logInconsistency();
     }
   }
 }
@@ -535,7 +535,7 @@ void BTreeImpl::renumber(uint oldRow, uint newRow, const SearchKey& searchKey) {
     if (leaf.rows[r] == oldRow) {
       leaf.rows[r] = newRow;
     } else {
-      logInconsitency();
+      logInconsistency();
     }
   }
 }

c++/src/kj/table.h

@@ -277,7 +277,7 @@ class TreeIndex;
 //   class Callbacks {
 //   public:
 //     bool isBefore(const Row&, const Row&) const;
-//     // Returns true if the row on te left comes before the row on the right.
+//     // Returns true if the row on the left comes before the row on the right.
 //
 //     bool matches(const Row&, const Row&) const;
 //     // Returns true if the rows "match".
@@ -932,7 +932,7 @@ public:
   BTreeImpl();
   ~BTreeImpl() noexcept(false);
 
-  void logInconsitency() const;
+  void logInconsistency() const;
 
   void reserve(size_t size);
 
@@ -1470,7 +1470,7 @@ private:
   uint capacity;
   Link* links;
   // links[0] is special: links[0].next points to the first link, links[0].prev points to the last.
-  // links[n+1] corresponds no row n.
+  // links[n+1] corresponds to row n.
 
   kj::Maybe<size_t> insertImpl(size_t pos);
   void eraseImpl(size_t pos);