https://git.ruby-lang.org/ruby.git/commit/?id=e89ebdcb87

From e89ebdcb87f23a71ad97581541bb2eaeee5e83e9 Mon Sep 17 00:00:00 2001
From: "K.Takata" <kentkt@c...>
Date: Wed, 11 Mar 2020 16:43:12 +0900
Subject: Fix typos (#2958)

* Fix a typo

* Fix typos in st.[ch]

diff --git a/include/ruby/st.h b/include/ruby/st.h
index ea1637b..1e4bb80 100644
--- a/include/ruby/st.h
+++ b/include/ruby/st.h
@@ -1,7 +1,7 @@ https://github.com/ruby/ruby/blob/trunk/include/ruby/st.h#L1
 /* This is a public domain general purpose hash table package
    originally written by Peter Moore @ UCB.
 
-   The hash table data strutures were redesigned and the package was
+   The hash table data structures were redesigned and the package was
    rewritten by Vladimir Makarov <vmakarov@r...>.  */
 
 #ifndef RUBY_ST_H
diff --git a/internal/bits.h b/internal/bits.h
index 52da712..410c2b9 100644
--- a/internal/bits.h
+++ b/internal/bits.h
@@ -230,7 +230,7 @@ static inline unsigned int https://github.com/ruby/ruby/blob/trunk/internal/bits.h#L230
 nlz_int32(uint32_t x)
 {
 #if defined(_MSC_VER) && defined(__AVX2__)
-    /* Note: It seems there is no such tihng like __LZCNT__ predefined in MSVC.
+    /* Note: It seems there is no such thing like __LZCNT__ predefined in MSVC.
      * AMD  CPUs have  had this  instruction for  decades (since  K10) but  for
      * Intel, Haswell is  the oldest one.  We need to  use __AVX2__ for maximum
      * safety. */
diff --git a/st.c b/st.c
index f0ef65d..8c10993 100644
--- a/st.c
+++ b/st.c
@@ -1073,7 +1073,7 @@ rebuild_table_if_necessary (st_table *tab) https://github.com/ruby/ruby/blob/trunk/st.c#L1073
 }
 
 /* Insert (KEY, VALUE) into table TAB and return zero.  If there is
-   already entry with KEY in the table, return nonzero and and update
+   already entry with KEY in the table, return nonzero and update
    the value of the found entry.  */
 int
 st_insert(st_table *tab, st_data_t key, st_data_t value)
@@ -1155,7 +1155,7 @@ st_add_direct(st_table *tab, st_data_t key, st_data_t value) https://github.com/ruby/ruby/blob/trunk/st.c#L1155
 
 /* Insert (FUNC(KEY), VALUE) into table TAB and return zero.  If
    there is already entry with KEY in the table, return nonzero and
-   and update the value of the found entry.  */
+   update the value of the found entry.  */
 int
 st_insert2(st_table *tab, st_data_t key, st_data_t value,
            st_data_t (*func)(st_data_t))
@@ -1464,7 +1464,7 @@ st_general_foreach(st_table *tab, st_foreach_check_callback_func *func, st_updat https://github.com/ruby/ruby/blob/trunk/st.c#L1464
 
     entries = tab->entries;
     /* The bound can change inside the loop even without rebuilding
-       the table, e.g. by an entry inesrtion.  */
+       the table, e.g. by an entry insertion.  */
     for (i = tab->entries_start; i < tab->entries_bound; i++) {
         curr_entry_ptr = &entries[i];
 	if (EXPECT(DELETED_ENTRY_P(curr_entry_ptr), 0))
-- 
cgit v0.10.2


--
ML: ruby-changes@q...
Info: http://www.atdot.net/~ko1/quickml/