search

jliszka / probability-monad

Apache License 2.0
263 stars 38 forks source link

use aggregate to fold results in parallel #9

Closed totekp closed 9 years ago

totekp commented 9 years ago

Discovered this function I never used before with sequential collections to compute sum in parallel and lazily. I looked at foldLeft at first, but it was sequential in ParSeq. It passes my local tests and has same performance.

jliszka commented 9 years ago

Good find! I hadn't used that before either :)