aboutsummaryrefslogtreecommitdiffstats
path: root/hash.c
diff options
context:
space:
mode:
authorNobuyoshi Nakada <nobu@ruby-lang.org>2023-09-06 17:46:36 +0900
committerNobuyoshi Nakada <nobu@ruby-lang.org>2023-09-06 17:46:36 +0900
commit779cab66552af44fcd709af633e1a8d68ccd7740 (patch)
tree858d830efc5cc59211fba627833c7523525f71ba /hash.c
parentabd0b9b28a8179687ff424fabcaf48bb3843e802 (diff)
downloadruby-779cab66552af44fcd709af633e1a8d68ccd7740.tar.gz
`RHASH_AR_TABLE` never returns NULL now [ci skip]
Diffstat (limited to 'hash.c')
-rw-r--r--hash.c6
1 files changed, 1 insertions, 5 deletions
diff --git a/hash.c b/hash.c
index 8c595e4595..58d3badd85 100644
--- a/hash.c
+++ b/hash.c
@@ -484,7 +484,7 @@ rb_hash_dump(VALUE hash)
rb_obj_info_dump(hash);
if (RHASH_AR_TABLE_P(hash)) {
- unsigned i, n = 0, bound = RHASH_AR_TABLE_BOUND(hash);
+ unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
fprintf(stderr, " size:%u bound:%u\n",
RHASH_AR_TABLE_SIZE(hash), bound);
@@ -501,7 +501,6 @@ rb_hash_dump(VALUE hash)
rb_raw_obj_info(b1, 0x100, k),
rb_raw_obj_info(b2, 0x100, v),
ar_hint(hash, i));
- n++;
}
else {
fprintf(stderr, " %d empty\n", i);
@@ -995,8 +994,6 @@ ar_insert(VALUE hash, st_data_t key, st_data_t value)
return -1;
}
- HASH_ASSERT(RHASH_AR_TABLE(hash));
-
bin = ar_find_entry(hash, hash_value, key);
if (bin == RHASH_AR_TABLE_MAX_BOUND) {
if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
@@ -1004,7 +1001,6 @@ ar_insert(VALUE hash, st_data_t key, st_data_t value)
}
else if (bin >= RHASH_AR_TABLE_MAX_BOUND) {
bin = ar_compact_table(hash);
- HASH_ASSERT(RHASH_AR_TABLE(hash));
}
HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);