Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Conversation

@lorenzhs
Copy link
Member

@lorenzhs lorenzhs commented May 8, 2017

That's much faster for small p because it doesn't need to look at elements one-by-one.

Ideally, OnPreOpFile would skip over entire blocks if the skip value is large enough. This is up to @bingmann to implement if he wants it :P

@lorenzhs lorenzhs force-pushed the faster-bernoulli-sampler branch from b4c4b8d to 6bf0f25 Compare May 8, 2017 15:15
It still doesn't produce a random sample.
@lorenzhs lorenzhs force-pushed the faster-bernoulli-sampler branch from 6bf0f25 to 7369ee2 Compare May 8, 2017 16:54
@lorenzhs
Copy link
Member Author

lorenzhs commented May 8, 2017

The k-means test doesn't converge quickly enough and failed: https://travis-ci.org/thrill/thrill/jobs/230035099

@lorenzhs
Copy link
Member Author

Would be nicer if a LOp could implement OnPreOpFile. There's no real reason for this to be a DOp.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant