diff options
author | Federico Ceratto <federico.ceratto@gmail.com> | 2019-09-27 06:02:54 +0100 |
---|---|---|
committer | Andreas Rumpf <rumpf_a@web.de> | 2019-09-27 07:02:54 +0200 |
commit | 39290cf88c5047e86dc4894e3190c63d5985f56f (patch) | |
tree | f37c9e0a5491fb9b11266ce08bddc297b57f37fc /lib/experimental | |
parent | 9dd297f613768bb170e05dcaf361015d9448c582 (diff) | |
download | Nim-39290cf88c5047e86dc4894e3190c63d5985f56f.tar.gz |
Fix spellings (#12277) [backport]
Diffstat (limited to 'lib/experimental')
-rw-r--r-- | lib/experimental/diff.nim | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/experimental/diff.nim b/lib/experimental/diff.nim index 9046d7316..d98999912 100644 --- a/lib/experimental/diff.nim +++ b/lib/experimental/diff.nim @@ -275,9 +275,9 @@ proc createDiffs(dataA, dataB: DiffData): seq[Item] = proc diffInt*(arrayA, arrayB: openArray[int]): seq[Item] = ## Find the difference in 2 arrays of integers. ## - ## ``arrayA`` A-version of the numbers (usualy the old one) + ## ``arrayA`` A-version of the numbers (usually the old one) ## - ## ``arrayB`` B-version of the numbers (usualy the new one) + ## ``arrayB`` B-version of the numbers (usually the new one) ## ## Returns a sequence of Items that describe the differences. @@ -301,7 +301,7 @@ proc diffText*(textA, textB: string): seq[Item] = ## ## The algorithm itself is comparing 2 arrays of numbers so when comparing 2 text documents ## each line is converted into a (hash) number. This hash-value is computed by storing all - ## textlines into a common hashtable so i can find dublicates in there, and generating a + ## textlines into a common hashtable so i can find duplicates in there, and generating a ## new number each time a new textline is inserted. ## ## ``textA`` A-version of the text (usually the old one) |