|
 |
On 14/03/2012 17:49, clipka wrote:
> Am 14.03.2012 18:09, schrieb Warp:
>> clipka<ano### [at] anonymous org> wrote:
>>> If a GC implementation doesn't track free blocks, how is it ever going
>>> to re-allocate them to anything?
>>
>> A naive implementation of that would be:
>> [...]
>
>
> Well, I wasn't actually considering approaches that would be
> prohibitively inefficient :-P
That's actually how Haskell's GC works. :-P
(Or rather, it is if you select 1-space. The default is 2-space. In
other words, it allocates twice as much RAM as it actually needs. When
one half fills, it copies everything to the other half. More RAM, but
less processor time...)
Post a reply to this message
|
|
