diff options
| author | Nobuyoshi Nakada <nobu@ruby-lang.org> | 2022-10-24 00:22:37 +0900 |
|---|---|---|
| committer | Nobuyoshi Nakada <nobu@ruby-lang.org> | 2022-10-24 00:22:37 +0900 |
| commit | c3e37f74aede27503fe1477cbd4bdde7d4df15da (patch) | |
| tree | 8a693cc222a16b351b67a81d6746425845ee328a /hash.c | |
| parent | c4089e65245aa00824c30fa7033a18cfa1c0e4c9 (diff) | |
| download | ruby-c3e37f74aede27503fe1477cbd4bdde7d4df15da.tar.gz | |
Adjust indents [ci skip]
Diffstat (limited to 'hash.c')
| -rw-r--r-- | hash.c | 26 |
1 files changed, 13 insertions, 13 deletions
@@ -963,7 +963,7 @@ ar_foreach(VALUE hash, st_foreach_callback_func *func, st_data_t arg) static int ar_foreach_check(VALUE hash, st_foreach_check_callback_func *func, st_data_t arg, - st_data_t never) + st_data_t never) { if (RHASH_AR_TABLE_SIZE(hash) > 0) { unsigned i, ret = 0, bound = RHASH_AR_TABLE_BOUND(hash); @@ -984,13 +984,13 @@ ar_foreach_check(VALUE hash, st_foreach_check_callback_func *func, st_data_t arg switch (retval) { case ST_CHECK: { - pair = RHASH_AR_TABLE_REF(hash, i); - if (pair->key == never) break; - ret = ar_find_entry_hint(hash, hint, key); - if (ret == RHASH_AR_TABLE_MAX_BOUND) { - retval = (*func)(0, 0, arg, 1); - return 2; - } + pair = RHASH_AR_TABLE_REF(hash, i); + if (pair->key == never) break; + ret = ar_find_entry_hint(hash, hint, key); + if (ret == RHASH_AR_TABLE_MAX_BOUND) { + retval = (*func)(0, 0, arg, 1); + return 2; + } } case ST_CONTINUE: break; @@ -998,11 +998,11 @@ ar_foreach_check(VALUE hash, st_foreach_check_callback_func *func, st_data_t arg case ST_REPLACE: return 0; case ST_DELETE: { - if (!ar_cleared_entry(hash, i)) { - ar_clear_entry(hash, i); - RHASH_AR_TABLE_SIZE_DEC(hash); - } - break; + if (!ar_cleared_entry(hash, i)) { + ar_clear_entry(hash, i); + RHASH_AR_TABLE_SIZE_DEC(hash); + } + break; } } } |