Skip to content

simd for faster calculations #57

New issue

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

Merged
merged 1 commit into from
Apr 13, 2020
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/kmeans.jl
Original file line number Diff line number Diff line change
Expand Up @@ -94,7 +94,7 @@ Allocationless calculation of square eucledean distance between vectors X1[:, i1
function distance(X1, X2, i1, i2)
d = 0.0
# TODO: break of the loop if d is larger than threshold (known minimum disatnce)
@inbounds for i in axes(X1, 1)
@inbounds @simd for i in axes(X1, 1)
d += (X1[i, i1] - X2[i, i2])^2
end

Expand Down