From: Roger Pack <rogerdpack2@...>
Date: 2010-01-23T02:56:00+09:00
Subject: [ruby-core:27705] Re: [Feature #2594] 1.8.7 Patch: Reduce time spent 	in gc.c is_pointer_to_heap().

> I heard from the REE guys that 1.9 heaps do not grow exponentially, but remain fixed. �In that case a linear O(1) probe function could help find either the min or max index, before doing a binary search.

They do, though it allocates exponentially more of them as it needs to :)

i.e. first time it allocates 16K, second time 16K*2, third time 16K*4, etc.

The hope is that smaller heap chunks can be freed more readily, so it
has a fixed size.

How would a probe function work with tons of 16K chunks, though?
-r