jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

bugfix: internal error in evalFieldAccess; parseutils.interpolatedFragments optimized; tstringinterp.nim now works

Browse source
This commit is contained in:
Araq 2011-09-26 00:24:06 +02:00
commit 14968fba46
10 changed files with 119 additions and 126 deletions
Download patch file Download diff file Expand all files Collapse all files

12
lib/pure/strutils.nim
View file

@ -640,8 +640,7 @@ proc join*(a: openArray[string], sep: string): string {.
if len(a) > 0:
var L = sep.len * (a.len-1)
for i in 0..high(a): inc(L, a[i].len)
result = newString(L)
setLen(result, 0)
result = newStringOfCap(L)
add(result, a[0])
for i in 1..high(a):
add(result, sep)
@ -655,8 +654,7 @@ proc join*(a: openArray[string]): string {.
if len(a) > 0:
var L = 0
for i in 0..high(a): inc(L, a[i].len)
result = newString(L)
setLen(result, 0)
result = newStringOfCap(L)
for i in 0..high(a): add(result, a[i])
else:
result = ""
@ -867,9 +865,9 @@ proc validIdentifier*(s: string): bool {.noSideEffect,
proc editDistance*(a, b: string): int {.noSideEffect,
rtl, extern: "nsuEditDistance".} =
## returns the edit distance between `a` and `b`. This uses the Levenshtein
## distance algorithm with only a linear memory overhead. This implementation
## is highly optimized!
## returns the edit distance between `a` and `b`. This uses the
## `Levenshtein`:idx: distance algorithm with only a linear memory overhead.
## This implementation is highly optimized!
var len1 = a.len
var len2 = b.len
if len1 > len2: