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

bag

pull/1/head
matthieugomez 2015-10-23 14:19:39 -04:00
parent c0f2cc58f6
commit 5bf5e05a1c
1 changed files with 2 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/qgrams_distances.jl
View File

@ -10,8 +10,8 @@
############################################################################## ##############################################################################
## ##
## A bag is a Set with repeated values ## A bag is a Set but that allows duplicated values
## ## Underlying, dictionary from elements => number of duplicates
############################################################################## ##############################################################################
type Bag{Tv <: Union{Char, AbstractString}, Ti <: Integer} type Bag{Tv <: Union{Char, AbstractString}, Ti <: Integer}
@ -48,7 +48,6 @@ function evaluate(dist::QGram, s1::AbstractString, s2::AbstractString)
length(s1) > length(s2) && return evaluate(dist, s2, s1) length(s1) > length(s2) && return evaluate(dist, s2, s1)
length(s2) == 0 && return 0 length(s2) == 0 && return 0
# set with repeated element : for each key, number of repetitions
bag = Bag(s2, dist.q) bag = Bag(s2, dist.q)
count = 0 count = 0
n1 = length(s1) - dist.q + 1 n1 = length(s1) - dist.q + 1