Bitmapped vector tries vs. arrays

Dejan Lekic dejan.lekic at gmail.com
Tue Dec 20 02:44:54 PST 2011


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. :)


More information about the Digitalmars-d mailing list