We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
We can speed up loading of InferOpt by replacing ThreadsX with built-in threads:
res = ThreadsX.map(f(i) for i in 1:n)
would become
f1 = f(1) res = Vector{typeof(f1)}(undef, n) res[1] = f1 @threads for i in 2:n res[i] = f(i) end
Downsides:
1 + (n-1)/t
n/t
t
Upsides:
The text was updated successfully, but these errors were encountered:
Also beware that @threads sometimes introduces type instabilities due to boxing
@threads
JuliaLang/julia#41731
Sorry, something went wrong.
No branches or pull requests
We can speed up loading of InferOpt by replacing ThreadsX with built-in threads:
would become
Downsides:
1 + (n-1)/t
instead ofn/t
fort
threadsUpsides:
The text was updated successfully, but these errors were encountered: