summaryrefslogtreecommitdiff
path: root/hash.c
diff options
context:
space:
mode:
authorNobuyoshi Nakada <nobu@ruby-lang.org>2019-07-03 02:09:01 +0900
committerNobuyoshi Nakada <nobu@ruby-lang.org>2019-07-03 02:09:01 +0900
commitbdddaa9f56702e1d3a58a14607e9881052424b53 (patch)
treeccbb221801b714a90148cf8454ff69b7e4f27d0d /hash.c
parent0f283054e7f568f09fbfc952d57ea6daf4abbd88 (diff)
Use rb_ident_hash_new instead of rb_hash_new_compare_by_id
The latter is same as the former, removed the duplicate function.
Diffstat (limited to 'hash.c')
-rw-r--r--hash.c8
1 files changed, 0 insertions, 8 deletions
diff --git a/hash.c b/hash.c
index be4fc216d4..df77e898a1 100644
--- a/hash.c
+++ b/hash.c
@@ -1364,14 +1364,6 @@ rb_hash_new(void)
return hash_alloc(rb_cHash);
}
-VALUE
-rb_hash_new_compare_by_id(void)
-{
- VALUE hash = rb_hash_new();
- RHASH_ST_TABLE_SET(hash, rb_init_identtable());
- return hash;
-}
-
MJIT_FUNC_EXPORTED VALUE
rb_hash_new_with_size(st_index_t size)
{