all: fix mispellings
Found by github.com/client9/misspell.
MODIFY
diff/fd/laplacian_test.go
diff/fd/laplacian_test.go
@@ -13,7 +13,7 @@ import (
func TestLaplacian(t *testing.T) {
for cas, test := range hessianTestCases {
- // Modify the test cases where the forumla is set.
+ // Modify the test cases where the formula is set.
settings := test.settings
if settings != nil && !settings.Formula.isZero() {
settings.Formula = Forward2nd

MODIFY
floats/floats_test.go
floats/floats_test.go
@@ -1001,7 +1001,7 @@ func TestNearestIdx(t *testing.T) {
in: []float64{math.NaN(), math.Inf(-1)},
query: 1,
want: 1,
- desc: "Wrong index returned when query is a number and single NaN preceeds -Inf",
+ desc: "Wrong index returned when query is a number and single NaN precedes -Inf",
},
} {
ind := NearestIdx(test.in, test.query)

MODIFY
graph/network/diffusion_test.go
graph/network/diffusion_test.go
@@ -375,7 +375,7 @@ var diffuseToEquilibriumTests = []struct {
// This does not look like Page Rank because we do not
// do the random node hops. An alternative Laplacian
// value that does do that would replicate PageRank. This
- // is left as an excercise for the reader.
+ // is left as an exercise for the reader.
want: map[int64]float64{
A: 0.227273,
B: 0.386364,

MODIFY
stat/distuv/binomial.go
stat/distuv/binomial.go
@@ -15,7 +15,7 @@ import (
// Binomial implements the binomial distribution, a discrete probability distribution
// that expresses the probability of a given number of successful Bernoulli trials
-// out of a total of n, each with successs probability p.
+// out of a total of n, each with success probability p.
// The binomial distribution has the density function:
// f(k) = (n choose k) p^k (1-p)^(n-k)
// For more information, see https://en.wikipedia.org/wiki/Binomial_distribution.

all: fix mispellings

Found by github.com/client9/misspell.