From: ts <decoux@...>
Date: 2001-02-28T23:44:39+09:00
Subject: [ruby-talk:11776] Re: Comparison Caching

>>>>> "B" == Ben Tilly <ben_tilly@hotmail.com> writes:

B> If the original data structures being compared do
B> not share data (the common case), you will get the
B> same number of entries either way, won't you?

 3 C lines

>> pigeon% grep rb_ensure tangle.c
>> return rb_ensure(inspect_call, (VALUE)&iarg, protect_reset, 0);
>> pigeon%
>> 
B> And this takes time, doesn't it?

 less than rb_ary_includes() or rb_hash_aref() which are called many
 times. 


Guy Decoux