Bitmapped vector tries vs. arrays

[Andrei Alexandrescu]

On 12/20/11 4:44 AM, Dejan Lekic wrote:
> On Sun, 18 Dec 2011 15:23:10 +0100, deadalnix wrote:
>
>>
>> Some argument are not convincing. OK, log32(n) is close to O(1) in many
>> cases but it isn't O(1). Matter of fact.
>>
>
> Well, he talks about it, and we must admit that for the memory you *can*
> address, log32(n) is really, really fast. Matter of fact. :)

I agree. Well, anywhere between 1 and 7. I only have a bit of a problem 
with making a number between 1 and 7 equal to 1.

Andrei