algorithm - F# FSharpMap vs Dictionary performance -


I was wondering how F # does the irreversible map against the standard dictionary.

I'm writing

What about memory usage?

Thanks

I was wondering how F # is an irreversible map against the standard dictionary.

See page 241-242 "Optimization: Use unstable data structure" in the same setting of calculation of frequencies on the int, as the function of the number of specific keys, in the dictionary Moves from 5 to 40 × fast maps .

In general, purely functional data structures, such as maps in the case of serials, are not only very slow but they destroy the scalability of the entire parallel programs. . I recently gave it on.

BTW, do not forget that a Seac Seatby function!


Comments

Popular posts from this blog

Eclipse CDT variable colors in editor -

AJAX doesn't send POST query -

wpf - Custom Message Box Advice -