all: remove or clarify repeated words in comments
MODIFY
graph/formats/rdf/iso_canonical.go
graph/formats/rdf/iso_canonical.go
@@ -57,7 +57,7 @@ func lexicalHashes(dst [][]byte, hashes map[string][]byte) {
}
// IsoCanonicalHashes returns a mapping between the nodes of the RDF graph
-// dataset described by the given statements using the the provided hash
+// dataset described by the given statements using the provided hash
// function. If decomp is true, the graphs are decomposed before hashing.
// If dist is and the input graph is decomposed into identical splits, the
// entire graph will be hashed to distinguish nodes. If decomp is false,

MODIFY
graph/topo/topo.go
graph/topo/topo.go
@@ -40,8 +40,8 @@ func IsPathIn(g graph.Graph, path []graph.Node) bool {
}
}
-// PathExistsIn returns whether there is a path in g starting at from extending
-// to to.
+// PathExistsIn returns whether there is a path in g starting at 'from' extending
+// to 'to'.
//
// PathExistsIn exists as a helper function. If many tests for path existence
// are being performed, other approaches will be more efficient.

MODIFY
lapack/gonum/dlasq2.go
lapack/gonum/dlasq2.go
@@ -287,8 +287,8 @@ outer:
// Now i0:n0 is unreduced.
// PP = 0 for ping, PP = 1 for pong.
// PP = 2 indicates that flipping was applied to the Z array and
- // and that the tests for deflation upon entry in Dlasq3
- // should not be performed.
+ // that the tests for deflation upon entry in Dlasq3 should
+ // not be performed.
nbig := 100 * (n0 - i0 + 1)
for iwhilb := 0; iwhilb < nbig; iwhilb++ {
if i0 > n0 {

MODIFY
mat/diagonal.go
mat/diagonal.go
@@ -318,7 +318,7 @@ func (d *DiagDense) IsEmpty() bool {
// Trace returns the trace of the matrix.
//
-// Trace will panic with with ErrZeroLength if the matrix has zero size.
+// Trace will panic with ErrZeroLength if the matrix has zero size.
func (d *DiagDense) Trace() float64 {
if d.IsEmpty() {
panic(ErrZeroLength)

MODIFY
mat/symmetric.go
mat/symmetric.go
@@ -660,7 +660,7 @@ func (s *SymDense) GrowSym(n int) Symmetric {
// PowPSD computes a^pow where a is a positive symmetric definite matrix.
//
-// PowPSD returns an error if the matrix is not not positive symmetric definite
+// PowPSD returns an error if the matrix is not positive symmetric definite
// or the Eigen decomposition is not successful.
func (s *SymDense) PowPSD(a Symmetric, pow float64) error {
dim := a.Symmetric()

MODIFY
stat/combin/combin.go
stat/combin/combin.go
@@ -553,7 +553,7 @@ func PermutationIndex(perm []int, n, k int) int {
// The permutation index is found by finding the combination index and the
// equalPermutation index. The combination index is found by just sorting
- // the elements, and the the permutation index is the ordering of the size
+ // the elements, and the permutation index is the ordering of the size
// of the elements.
tmp := make([]int, len(perm))
copy(tmp, perm)

all: remove or clarify repeated words in comments