package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-19 05:24:52 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

all: remove or clarify repeated words in comments

Browse Source
This commit is contained in:
Dan Kortschak
2021-08-08 15:49:07 +09:30
parent 054da3c55f
commit 85ca8969b8
6 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
graph/formats/rdf/iso_canonical.go
View File

@@ -57,7 +57,7 @@ func lexicalHashes(dst [][]byte, hashes map[string][]byte) {
} }
// IsoCanonicalHashes returns a mapping between the nodes of the RDF graph // 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. // function. If decomp is true, the graphs are decomposed before hashing.
// If dist is and the input graph is decomposed into identical splits, the // 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, // entire graph will be hashed to distinguish nodes. If decomp is false,

4
graph/topo/topo.go
View File

@@ -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 // PathExistsIn returns whether there is a path in g starting at 'from' extending
// to to. // to 'to'.
// //
// PathExistsIn exists as a helper function. If many tests for path existence // PathExistsIn exists as a helper function. If many tests for path existence
// are being performed, other approaches will be more efficient. // are being performed, other approaches will be more efficient.

4
lapack/gonum/dlasq2.go
View File

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

2
mat/diagonal.go
View File

@@ -318,7 +318,7 @@ func (d *DiagDense) IsEmpty() bool {
// Trace returns the trace of the matrix. // 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 { func (d *DiagDense) Trace() float64 {
if d.IsEmpty() { if d.IsEmpty() {
panic(ErrZeroLength) panic(ErrZeroLength)

2
mat/symmetric.go
View File

@@ -660,7 +660,7 @@ func (s *SymDense) GrowSym(n int) Symmetric {
// PowPSD computes a^pow where a is a positive symmetric definite matrix. // 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. // or the Eigen decomposition is not successful.
func (s *SymDense) PowPSD(a Symmetric, pow float64) error { func (s *SymDense) PowPSD(a Symmetric, pow float64) error {
dim := a.Symmetric() dim := a.Symmetric()

2
stat/combin/combin.go
View File

@@ -553,7 +553,7 @@ func PermutationIndex(perm []int, n, k int) int {
// The permutation index is found by finding the combination index and the // The permutation index is found by finding the combination index and the
// equalPermutation index. The combination index is found by just sorting // 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. // of the elements.
tmp := make([]int, len(perm)) tmp := make([]int, len(perm))
copy(tmp, perm) copy(tmp, perm)