On 02/19/2014 04:11 AM, bearophile wrote:
Nicolas Sicard:
Are byKey and byValue guaranteed to iterate the associative array in
the same order?
Nope, or not yet, sorry.
Bye,
bearophile
Is there a bug report about that? I can't imagine how they can iterate
in any other order.
Ali
Nicolas Sicard:
Are byKey and byValue guaranteed to iterate the associative
array in the same order?
Nope, or not yet, sorry.
Bye,
bearophile
On Wednesday, 19 February 2014 at 09:28:27 UTC, bearophile wrote:
Tarman:
We're doing some "super computing" "big data" style stuff with
D. We have a system where we're comparing associative arrays
with billions of entries.
Built-in associative arrays were never tested with so many
pairs, s
@bearophile:
Thanks for your suggestion! Yes we've tried this but
unfortunately the performance doesn't work for us, maybe because
all our CPUs are quite saturated.
@simendsjo:
Thanks also for your suggestion, we are using tasks and yield in
our code but in this case we felt that using it j
On Wednesday, 19 February 2014 at 09:21:48 UTC, Tarman wrote:
Hi,
We're doing some "super computing" "big data" style stuff with
D. We have a system where we're comparing associative arrays
with billions of entries.
However in this system we need to fairly consider possible
solutions for ma
On Wednesday, 19 February 2014 at 09:21:48 UTC, Tarman wrote:
Hi,
We're doing some "super computing" "big data" style stuff with
D. We have a system where we're comparing associative arrays
with billions of entries.
However in this system we need to fairly consider possible
solutions for ma
Tarman:
We're doing some "super computing" "big data" style stuff with
D. We have a system where we're comparing associative arrays
with billions of entries.
Built-in associative arrays were never tested with so many pairs,
so perform exhaustive performance benchmarks first, and report in
B
I guess what might work here is to allow some kind of argument to
"byKey" that will let us resume so maybe something like:
foreach (item;
massiveAssociativeArray.byKey(indexOfKeyToStartFrom)) {
}
If something like this isn't possible, then would one of our
engineers be able to submit a patch
Hi,
We're doing some "super computing" "big data" style stuff with D.
We have a system where we're comparing associative arrays with
billions of entries.
However in this system we need to fairly consider possible
solutions for many "units" at a time within a single thread.
So we'd like to.
