mirrors
/
StringDistances.jl
mirror of https://github.com/matthieugomez/StringDistances.jl.git
1
0
Fork 0
Code Issues Releases Wiki Activity

Update find.jl

compathelper/new_version/2020-05-20-12-03-08-092-188304956
matthieugomez 2020-04-20 14:09:52 -04:00
parent c04cb32bdf
commit 388055a622
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/find.jl
View File

@ -24,6 +24,7 @@ function Base.findmax(s, itr, dist::StringDistance = Levenshtein(); min_score =
min_score_atomic = Threads.Atomic{typeof(min_score)}(min_score)
scores = [0.0 for _ in 1:Threads.nthreads()]
is = [0 for _ in 1:Threads.nthreads()]
# need collect since @threads requires a length method
Threads.@threads for i in collect(eachindex(itr))
score = compare(s, itr[i], dist; min_score = min_score_atomic[])
score_old = Threads.atomic_max!(min_score_atomic, score)
@ -60,6 +61,7 @@ julia> findall(s, iter, Levenshtein(); min_score = 0.9)
"""
function Base.findall(s, itr, dist::StringDistance = Levenshtein; min_score = 0.8)
out = [Int[] for _ in 1:Threads.nthreads()]
# need collect since @threads requires a length method
Threads.@threads for i in collect(eachindex(itr))
score = compare(s, itr[i], dist; min_score = min_score)
if score >= min_score