aboutsummaryrefslogtreecommitdiff
path: root/src/index/suffixarray
diff options
context:
space:
mode:
authorDan Kortschak <dan@kortschak.io>2022-03-05 19:21:15 +1030
committerDaniel Martí <mvdan@mvdan.cc>2022-03-06 20:47:39 +0000
commitda2773fe3e2f6106634673a38dc3a6eb875fe7d8 (patch)
tree6de067c7651945133608c53635e371a88e698d60 /src/index/suffixarray
parent45f45444b307cea7c8330b100b30382e642e010f (diff)
downloadgo-da2773fe3e2f6106634673a38dc3a6eb875fe7d8.tar.xz
all: fix some typos
Change-Id: I7dfae0fc91c2d70873ec7ec920be7c0a4888153a Reviewed-on: https://go-review.googlesource.com/c/go/+/390175 Reviewed-by: Ian Lance Taylor <iant@golang.org> Reviewed-by: Daniel Martí <mvdan@mvdan.cc> Trust: Daniel Martí <mvdan@mvdan.cc>
Diffstat (limited to 'src/index/suffixarray')
-rw-r--r--src/index/suffixarray/sais.go2
-rw-r--r--src/index/suffixarray/sais2.go2
2 files changed, 2 insertions, 2 deletions
diff --git a/src/index/suffixarray/sais.go b/src/index/suffixarray/sais.go
index b4496d2988..74c5235617 100644
--- a/src/index/suffixarray/sais.go
+++ b/src/index/suffixarray/sais.go
@@ -656,7 +656,7 @@ func recurse_32(sa, oldTmp []int32, numLMS, maxID int) {
dst, saTmp, text := sa[:numLMS], sa[numLMS:len(sa)-numLMS], sa[len(sa)-numLMS:]
// Set up temporary space for recursive call.
- // We must pass sais_32 a tmp buffer wiith at least maxID entries.
+ // We must pass sais_32 a tmp buffer with at least maxID entries.
//
// The subproblem is guaranteed to have length at most len(sa)/2,
// so that sa can hold both the subproblem and its suffix array.
diff --git a/src/index/suffixarray/sais2.go b/src/index/suffixarray/sais2.go
index f1247028c6..32b8972801 100644
--- a/src/index/suffixarray/sais2.go
+++ b/src/index/suffixarray/sais2.go
@@ -1194,7 +1194,7 @@ func recurse_64(sa, oldTmp []int64, numLMS, maxID int) {
dst, saTmp, text := sa[:numLMS], sa[numLMS:len(sa)-numLMS], sa[len(sa)-numLMS:]
// Set up temporary space for recursive call.
- // We must pass sais_64 a tmp buffer wiith at least maxID entries.
+ // We must pass sais_64 a tmp buffer with at least maxID entries.
//
// The subproblem is guaranteed to have length at most len(sa)/2,
// so that sa can hold both the subproblem and its suffix array.