D - more or less power than C++?

Kevin Bealer Kevin_member at pathlink.com
Sat Mar 4 14:14:30 PST 2006


In article <dud1s8$idk$1 at digitaldaemon.com>, Walter Bright says...
>
>
>"Kevin Bealer" <Kevin_member at pathlink.com> wrote in message 
>news:ducrhk$6j3$1 at digitaldaemon.com...
>> foreach(char[] k, foo v; x) {
>> // print all elements in order
>> }
>
>The wc example shows how to print the elements of an associative array in 
>order. 

Sometimes its good to be able to get the least element, greatest element, and so
on, quicker than O(N).  PQs can do one or the other, but it's hard to do lookups
by value.  This is a low priority for most people I suspect.

Kevin





More information about the Digitalmars-d mailing list