mirror of
https://github.com/nim-lang/Nim.git
synced 2025-12-28 17:04:41 +00:00
make editdistance work with --styleCheck:error
This commit is contained in:
Araq
@@ -22,158 +22,158 @@ proc editDistance*(a, b: string): int {.noSideEffect.} =
|
||||
return editDistance(b, a)
|
||||
# strip common prefix
|
||||
var
|
||||
i_start = 0 ## The character starting index of the first rune in both strings ``a`` and ``b``
|
||||
i_next_a = 0
|
||||
i_next_b = 0
|
||||
rune_a, rune_b: Rune
|
||||
len_runes_a = 0 ## The number of relevant runes in string ``a``.
|
||||
len_runes_b = 0 ## The number of relevant runes in string ``b``.
|
||||
iStart = 0 ## The character starting index of the first rune in both strings ``a`` and ``b``
|
||||
iNextA = 0
|
||||
iNextB = 0
|
||||
runeA, runeB: Rune
|
||||
lenRunesA = 0 ## The number of relevant runes in string ``a``.
|
||||
lenRunesB = 0 ## The number of relevant runes in string ``b``.
|
||||
block commonPrefix:
|
||||
# ``a`` is the shorter string
|
||||
while i_start < len(a):
|
||||
i_next_a = i_start
|
||||
a.fastRuneAt(i_next_a, rune_a, doInc = true)
|
||||
i_next_b = i_start
|
||||
b.fastRuneAt(i_next_b, rune_b, doInc = true)
|
||||
if rune_a != rune_b:
|
||||
inc(len_runes_a)
|
||||
inc(len_runes_b)
|
||||
while iStart < len(a):
|
||||
iNextA = iStart
|
||||
a.fastRuneAt(iNextA, runeA, doInc = true)
|
||||
iNextB = iStart
|
||||
b.fastRuneAt(iNextB, runeB, doInc = true)
|
||||
if runeA != runeB:
|
||||
inc(lenRunesA)
|
||||
inc(lenRunesB)
|
||||
break
|
||||
i_start = i_next_a
|
||||
iStart = iNextA
|
||||
var
|
||||
# we know that we are either at the start of the strings
|
||||
# or that the current value of rune_a is not equal to rune_b
|
||||
# or that the current value of runeA is not equal to runeB
|
||||
# => start search for common suffix after the current rune (``i_next_*``)
|
||||
i_end_a = i_next_a ## The exclusive upper index bound of string ``a``.
|
||||
i_end_b = i_next_b ## The exclusive upper index bound of string ``b``.
|
||||
i_current_a = i_next_a
|
||||
i_current_b = i_next_b
|
||||
iEndA = iNextA ## The exclusive upper index bound of string ``a``.
|
||||
iEndB = iNextB ## The exclusive upper index bound of string ``b``.
|
||||
iCurrentA = iNextA
|
||||
iCurrentB = iNextB
|
||||
block commonSuffix:
|
||||
var
|
||||
add_runes_a = 0
|
||||
add_runes_b = 0
|
||||
while i_current_a < len(a) and i_current_b < len(b):
|
||||
i_next_a = i_current_a
|
||||
a.fastRuneAt(i_next_a, rune_a)
|
||||
i_next_b = i_current_b
|
||||
b.fastRuneAt(i_next_b, rune_b)
|
||||
inc(add_runes_a)
|
||||
inc(add_runes_b)
|
||||
if rune_a != rune_b:
|
||||
i_end_a = i_next_a
|
||||
i_end_b = i_next_b
|
||||
inc(len_runes_a, add_runes_a)
|
||||
inc(len_runes_b, add_runes_b)
|
||||
add_runes_a = 0
|
||||
add_runes_b = 0
|
||||
i_current_a = i_next_a
|
||||
i_current_b = i_next_b
|
||||
if i_current_a >= len(a): # ``a`` exhausted
|
||||
if i_current_b < len(b): # ``b`` not exhausted
|
||||
i_end_a = i_current_a
|
||||
i_end_b = i_current_b
|
||||
inc(len_runes_a, add_runes_a)
|
||||
inc(len_runes_b, add_runes_b)
|
||||
addRunesA = 0
|
||||
addRunesB = 0
|
||||
while iCurrentA < len(a) and iCurrentB < len(b):
|
||||
iNextA = iCurrentA
|
||||
a.fastRuneAt(iNextA, runeA)
|
||||
iNextB = iCurrentB
|
||||
b.fastRuneAt(iNextB, runeB)
|
||||
inc(addRunesA)
|
||||
inc(addRunesB)
|
||||
if runeA != runeB:
|
||||
iEndA = iNextA
|
||||
iEndB = iNextB
|
||||
inc(lenRunesA, addRunesA)
|
||||
inc(lenRunesB, addRunesB)
|
||||
addRunesA = 0
|
||||
addRunesB = 0
|
||||
iCurrentA = iNextA
|
||||
iCurrentB = iNextB
|
||||
if iCurrentA >= len(a): # ``a`` exhausted
|
||||
if iCurrentB < len(b): # ``b`` not exhausted
|
||||
iEndA = iCurrentA
|
||||
iEndB = iCurrentB
|
||||
inc(lenRunesA, addRunesA)
|
||||
inc(lenRunesB, addRunesB)
|
||||
while true:
|
||||
b.fastRuneAt(i_end_b, rune_b)
|
||||
inc(len_runes_b)
|
||||
if i_end_b >= len(b): break
|
||||
elif i_current_b >= len(b): # ``b`` exhausted and ``a`` not exhausted
|
||||
i_end_a = i_current_a
|
||||
i_end_b = i_current_b
|
||||
inc(len_runes_a, add_runes_a)
|
||||
inc(len_runes_b, add_runes_b)
|
||||
b.fastRuneAt(iEndB, runeB)
|
||||
inc(lenRunesB)
|
||||
if iEndB >= len(b): break
|
||||
elif iCurrentB >= len(b): # ``b`` exhausted and ``a`` not exhausted
|
||||
iEndA = iCurrentA
|
||||
iEndB = iCurrentB
|
||||
inc(lenRunesA, addRunesA)
|
||||
inc(lenRunesB, addRunesB)
|
||||
while true:
|
||||
a.fastRuneAt(i_end_a, rune_a)
|
||||
inc(len_runes_a)
|
||||
if i_end_a >= len(a): break
|
||||
a.fastRuneAt(iEndA, runeA)
|
||||
inc(lenRunesA)
|
||||
if iEndA >= len(a): break
|
||||
block specialCases:
|
||||
# trivial cases:
|
||||
if len_runes_a == 0: return len_runes_b
|
||||
if len_runes_b == 0: return len_runes_a
|
||||
if lenRunesA == 0: return lenRunesB
|
||||
if lenRunesB == 0: return lenRunesA
|
||||
# another special case:
|
||||
if len_runes_a == 1:
|
||||
a.fastRuneAt(i_start, rune_a, doInc = false)
|
||||
var i_current_b = i_start
|
||||
while i_current_b < i_end_b:
|
||||
b.fastRuneAt(i_current_b, rune_b, doInc = true)
|
||||
if rune_a == rune_b: return len_runes_b - 1
|
||||
return len_runes_b
|
||||
if lenRunesA == 1:
|
||||
a.fastRuneAt(iStart, runeA, doInc = false)
|
||||
var iCurrentB = iStart
|
||||
while iCurrentB < iEndB:
|
||||
b.fastRuneAt(iCurrentB, runeB, doInc = true)
|
||||
if runeA == runeB: return lenRunesB - 1
|
||||
return lenRunesB
|
||||
# common case:
|
||||
var
|
||||
len1 = len_runes_a + 1
|
||||
len2 = len_runes_b + 1
|
||||
len1 = lenRunesA + 1
|
||||
len2 = lenRunesB + 1
|
||||
row: seq[int]
|
||||
let half = len_runes_a div 2
|
||||
let half = lenRunesA div 2
|
||||
newSeq(row, len2)
|
||||
var e = i_start + len2 - 1 # end marker
|
||||
var e = iStart + len2 - 1 # end marker
|
||||
# initialize first row:
|
||||
for i in 1 .. (len2 - half - 1): row[i] = i
|
||||
row[0] = len1 - half - 1
|
||||
i_current_a = i_start
|
||||
iCurrentA = iStart
|
||||
var
|
||||
char2p_i = -1
|
||||
char2p_prev: int
|
||||
char2pI = -1
|
||||
char2pPrev: int
|
||||
for i in 1 .. (len1 - 1):
|
||||
i_next_a = i_current_a
|
||||
a.fastRuneAt(i_next_a, rune_a)
|
||||
iNextA = iCurrentA
|
||||
a.fastRuneAt(iNextA, runeA)
|
||||
var
|
||||
char2p: int
|
||||
D, x: int
|
||||
diff, x: int
|
||||
p: int
|
||||
if i >= (len1 - half):
|
||||
# skip the upper triangle:
|
||||
let offset = i + half - len1
|
||||
if char2p_i == i:
|
||||
b.fastRuneAt(char2p_prev, rune_b)
|
||||
char2p = char2p_prev
|
||||
char2p_i = i + 1
|
||||
if char2pI == i:
|
||||
b.fastRuneAt(char2pPrev, runeB)
|
||||
char2p = char2pPrev
|
||||
char2pI = i + 1
|
||||
else:
|
||||
char2p = i_start
|
||||
char2p = iStart
|
||||
for j in 0 ..< offset:
|
||||
rune_b = b.runeAt(char2p)
|
||||
inc(char2p, rune_b.size)
|
||||
char2p_i = i + 1
|
||||
char2p_prev = char2p
|
||||
runeB = b.runeAt(char2p)
|
||||
inc(char2p, runeB.size)
|
||||
char2pI = i + 1
|
||||
char2pPrev = char2p
|
||||
p = offset
|
||||
rune_b = b.runeAt(char2p)
|
||||
var c3 = row[p] + (if rune_a != rune_b: 1 else: 0)
|
||||
inc(char2p, rune_b.size)
|
||||
runeB = b.runeAt(char2p)
|
||||
var c3 = row[p] + (if runeA != runeB: 1 else: 0)
|
||||
inc(char2p, runeB.size)
|
||||
inc(p)
|
||||
x = row[p] + 1
|
||||
D = x
|
||||
diff = x
|
||||
if x > c3: x = c3
|
||||
row[p] = x
|
||||
inc(p)
|
||||
else:
|
||||
p = 1
|
||||
char2p = i_start
|
||||
D = i
|
||||
char2p = iStart
|
||||
diff = i
|
||||
x = i
|
||||
if i <= (half + 1):
|
||||
# skip the lower triangle:
|
||||
e = len2 + i - half - 2
|
||||
# main:
|
||||
while p <= e:
|
||||
dec(D)
|
||||
rune_b = b.runeAt(char2p)
|
||||
var c3 = D + (if rune_a != rune_b: 1 else: 0)
|
||||
inc(char2p, rune_b.size)
|
||||
dec(diff)
|
||||
runeB = b.runeAt(char2p)
|
||||
var c3 = diff + (if runeA != runeB: 1 else: 0)
|
||||
inc(char2p, runeB.size)
|
||||
inc(x)
|
||||
if x > c3: x = c3
|
||||
D = row[p] + 1
|
||||
if x > D: x = D
|
||||
diff = row[p] + 1
|
||||
if x > diff: x = diff
|
||||
row[p] = x
|
||||
inc(p)
|
||||
# lower triangle sentinel:
|
||||
if i <= half:
|
||||
dec(D)
|
||||
rune_b = b.runeAt(char2p)
|
||||
var c3 = D + (if rune_a != rune_b: 1 else: 0)
|
||||
dec(diff)
|
||||
runeB = b.runeAt(char2p)
|
||||
var c3 = diff + (if runeA != runeB: 1 else: 0)
|
||||
inc(x)
|
||||
if x > c3: x = c3
|
||||
row[p] = x
|
||||
i_current_a = i_next_a
|
||||
iCurrentA = iNextA
|
||||
result = row[e]
|
||||
|
||||
proc editDistanceAscii*(a, b: string): int {.noSideEffect.} =
|
||||
@@ -220,7 +220,7 @@ proc editDistanceAscii*(a, b: string): int {.noSideEffect.} =
|
||||
for i in 1 .. len1 - 1:
|
||||
var char1 = a[i + s - 1]
|
||||
var char2p: int
|
||||
var D, x: int
|
||||
var diff, x: int
|
||||
var p: int
|
||||
if i >= len1 - half:
|
||||
# skip the upper triangle:
|
||||
@@ -231,33 +231,33 @@ proc editDistanceAscii*(a, b: string): int {.noSideEffect.} =
|
||||
inc(p)
|
||||
inc(char2p)
|
||||
x = row[p] + 1
|
||||
D = x
|
||||
diff = x
|
||||
if x > c3: x = c3
|
||||
row[p] = x
|
||||
inc(p)
|
||||
else:
|
||||
p = 1
|
||||
char2p = 0
|
||||
D = i
|
||||
diff = i
|
||||
x = i
|
||||
if i <= half + 1:
|
||||
# skip the lower triangle:
|
||||
e = len2 + i - half - 2
|
||||
# main:
|
||||
while p <= e:
|
||||
dec(D)
|
||||
var c3 = D + ord(char1 != b[char2p + s])
|
||||
dec(diff)
|
||||
var c3 = diff + ord(char1 != b[char2p + s])
|
||||
inc(char2p)
|
||||
inc(x)
|
||||
if x > c3: x = c3
|
||||
D = row[p] + 1
|
||||
if x > D: x = D
|
||||
diff = row[p] + 1
|
||||
if x > diff: x = diff
|
||||
row[p] = x
|
||||
inc(p)
|
||||
# lower triangle sentinel:
|
||||
if i <= half:
|
||||
dec(D)
|
||||
var c3 = D + ord(char1 != b[char2p + s])
|
||||
dec(diff)
|
||||
var c3 = diff + ord(char1 != b[char2p + s])
|
||||
inc(x)
|
||||
if x > c3: x = c3
|
||||
row[p] = x
|
||||
|
||||
Reference in New Issue
Block a user