benchmark on binary trees
visitor via Digitalmars-d-learn
digitalmars-d-learn at puremagic.com
Fri Dec 11 12:30:05 PST 2015
ok, i have a working version (memory is nice, twice the speed as
non parallel) ;
i've got similar performances, without Allocators, using directly
malloc and free
i had to recursively deallocate ...
though, still far from competing with the fastest, any advice ?
i guess FreeList allocator is not the better tool here ?
More information about the Digitalmars-d-learn