Associative Arrays max length? 32bit/64bit

bearophile via Digitalmars-d digitalmars-d at puremagic.com
Sat May 17 15:05:02 PDT 2014


monarch_dodra:

> for a sorted linked list (or forward iterators in general), you 
> can find the result with O(N) *walk* iterations, but still only 
> O(log(N)) *comparison* iterations.

I think I have never implement such algorithm, but you are right, 
and it's nice. Is Phobos using this idea somewhere? Are D AAs 
using it?

Bye,
bearophile


More information about the Digitalmars-d mailing list