Fix spelling (#7405)

This commit is contained in:
John Bampton 2023-03-01 04:05:30 +10:00 committed by GitHub
parent 966adfb799
commit c43fbe4ebd
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
Notes: git 2023-02-28 18:05:50 +00:00
Merged-By: k0kubun <takashikkbn@gmail.com>
5 changed files with 5 additions and 5 deletions

View File

@ -447,7 +447,7 @@ end
# as an inverse. The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away # as an inverse. The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away
# (an odd number). Checking even vs odd then produces a higher probability of finding more pieces earlier # (an odd number). Checking even vs odd then produces a higher probability of finding more pieces earlier
# in the cycle. We still need to keep checking all the permutations, but our probability of finding one will # in the cycle. We still need to keep checking all the permutations, but our probability of finding one will
# diminsh over time. Since we are TOLD how many to search for this lets us exit before checking all pieces # diminish over time. Since we are TOLD how many to search for this lets us exit before checking all pieces
# this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the # this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the
# maximum number # maximum number
def find_top( rotation_skip) def find_top( rotation_skip)

View File

@ -70,7 +70,7 @@
#define rb_darray_foreach(ary, idx_name, elem_ptr_var) \ #define rb_darray_foreach(ary, idx_name, elem_ptr_var) \
for (size_t idx_name = 0; idx_name < rb_darray_size(ary) && ((elem_ptr_var) = rb_darray_ref(ary, idx_name)); ++idx_name) for (size_t idx_name = 0; idx_name < rb_darray_size(ary) && ((elem_ptr_var) = rb_darray_ref(ary, idx_name)); ++idx_name)
// Iterate over valid indicies in the array in a for loop // Iterate over valid indices in the array in a for loop
// //
#define rb_darray_for(ary, idx_name) \ #define rb_darray_for(ary, idx_name) \
for (size_t idx_name = 0; idx_name < rb_darray_size(ary); ++idx_name) for (size_t idx_name = 0; idx_name < rb_darray_size(ary); ++idx_name)

2
io.c
View File

@ -1838,7 +1838,7 @@ io_allocate_write_buffer(rb_io_t *fptr, int sync)
static inline int static inline int
io_binwrite_requires_flush_write(rb_io_t *fptr, long len, int nosync) io_binwrite_requires_flush_write(rb_io_t *fptr, long len, int nosync)
{ {
// If the requested operation was synchronous and the output mode is synchronus or a TTY: // If the requested operation was synchronous and the output mode is synchronous or a TTY:
if (!nosync && (fptr->mode & (FMODE_SYNC|FMODE_TTY))) if (!nosync && (fptr->mode & (FMODE_SYNC|FMODE_TTY)))
return 1; return 1;

View File

@ -1751,7 +1751,7 @@ rb_data_s_def(int argc, VALUE *argv, VALUE klass)
* Measure.new(amount: 1, unit: 'km') * Measure.new(amount: 1, unit: 'km')
* #=> #<data Measure amount=1, unit="km"> * #=> #<data Measure amount=1, unit="km">
* *
* # Alternative shorter intialization with [] * # Alternative shorter initialization with []
* Measure[1, 'km'] * Measure[1, 'km']
* #=> #<data Measure amount=1, unit="km"> * #=> #<data Measure amount=1, unit="km">
* Measure[amount: 1, unit: 'km'] * Measure[amount: 1, unit: 'km']

View File

@ -2721,7 +2721,7 @@ rb_autoload_load(VALUE module, ID name)
rb_raise(rb_eRactorUnsafeError, "require by autoload on non-main Ractor is not supported (%s)", rb_id2name(name)); rb_raise(rb_eRactorUnsafeError, "require by autoload on non-main Ractor is not supported (%s)", rb_id2name(name));
} }
// This state is stored on thes stack and is used during the autoload process. // This state is stored on the stack and is used during the autoload process.
struct autoload_load_arguments arguments = {.module = module, .name = name, .mutex = Qnil}; struct autoload_load_arguments arguments = {.module = module, .name = name, .mutex = Qnil};
// Figure out whether we can autoload the named constant: // Figure out whether we can autoload the named constant: