all: run Go tip gofmt -s
MODIFY
floats/floats.go
floats/floats.go
@@ -337,7 +337,6 @@ func EqualLengths(slices ...[]float64) bool {
// all of the found elements will be returned along with an error.
// At the return of the function, the input inds will be in an undetermined state.
func Find(inds []int, f func(float64) bool, s []float64, k int) ([]int, error) {
-
// inds is also returned to allow for calling with nil
// Reslice inds to have zero length

MODIFY
stat/distuv/norm.go
stat/distuv/norm.go
@@ -45,7 +45,6 @@ func (n Normal) CDF(x float64) float64 {
//
// This function panics if len(suffStat) != 2 or len(priorStrength) != 2.
func (n *Normal) ConjugateUpdate(suffStat []float64, nSamples float64, priorStrength []float64) {
-
// TODO: Support prior strength with math.Inf(1) to allow updating with
// a known mean/standard deviation

MODIFY
stat/stat.go
stat/stat.go
@@ -1162,7 +1162,6 @@ func Variance(x, weights []float64) float64 {
// If weights is nil then all of the weights are 1. If weights is not nil, then
// len(x) must equal len(weights).
func MeanVariance(x, weights []float64) (mean, variance float64) {
-
// This uses the corrected two-pass algorithm (1.7), from "Algorithms for computing
// the sample variance: Analysis and recommendations" by Chan, Tony F., Gene H. Golub,
// and Randall J. LeVeque.

all: run Go tip gofmt -s