Dmitry VerkhoturovandUmputun
80c12a3f10
Bump Go dependencies in both backend/ and backend/_example/memory_store.
Notable updates:
- github.com/go-pkgz/lgr v0.12.1 -> v0.12.3
- github.com/klauspost/compress v1.18.2 -> v1.18.5
- github.com/PuerkitoBio/goquery v1.11.0 -> v1.12.0
- github.com/montanaflynn/stats v0.7.1 -> v0.9.0
- github.com/redis/go-redis/v9 v9.17.2 -> v9.18.0
- github.com/slack-go/slack v0.17.3 -> v0.21.1
- go.mongodb.org/mongo-driver v1.17.6 -> v1.17.9
- golang.org/x/crypto v0.48.0 -> v0.50.0
- golang.org/x/net v0.49.0 -> v0.53.0
- golang.org/x/image v0.36.0 -> v0.39.0
- golang.org/x/sys v0.41.0 -> v0.43.0
- golang.org/x/{oauth2,sync,text} minor bumps
Key markdown/sanitisation libs (bluemonday v1.0.27,
alecthomas/chroma/v2 v2.23.1, russross/blackfriday/v2 v2.1.0,
Depado/bfchroma/v2 v2.0.0) are already at the latest available
versions and were not bumped.
Verified the Chroma span-class allowlist regex in
backend/app/store/comment.go:128-131 is still fully in sync with
chroma/v2 types.go StandardTypes map (86 classes, byte-equal after
sorting). The inline comment references commit c263f6f which is
stale (Chroma is at v2 now), but the class list content is current.
Ran `go mod tidy` + `go mod vendor` + full race test suite on both
modules. All green. Added a reminder in CLAUDE.md that updating
backend/ Go modules also requires `go mod tidy` in
backend/_example/memory_store since the example module uses a
local replace directive and inherits indirect deps from the main
module.
113 lines
2.4 KiB
Go
113 lines
2.4 KiB
Go
package stats
|
|
|
|
import "math"
|
|
|
|
// Series is a container for a series of data
|
|
type Series []Coordinate
|
|
|
|
// Coordinate holds the data in a series
|
|
type Coordinate struct {
|
|
X, Y float64
|
|
}
|
|
|
|
// LinearRegression finds the least squares linear regression on data series
|
|
func LinearRegression(s Series) (regressions Series, err error) {
|
|
|
|
if len(s) == 0 {
|
|
return nil, EmptyInputErr
|
|
}
|
|
|
|
// Placeholder for the math to be done
|
|
var sum [4]float64
|
|
|
|
// Loop over data keeping index in place
|
|
i := 0
|
|
for ; i < len(s); i++ {
|
|
sum[0] += s[i].X
|
|
sum[1] += s[i].Y
|
|
sum[2] += s[i].X * s[i].X
|
|
sum[3] += s[i].X * s[i].Y
|
|
}
|
|
|
|
// Find gradient and intercept
|
|
f := float64(i)
|
|
gradient := (f*sum[3] - sum[0]*sum[1]) / (f*sum[2] - sum[0]*sum[0])
|
|
intercept := (sum[1] / f) - (gradient * sum[0] / f)
|
|
|
|
// Create the new regression series
|
|
for j := 0; j < len(s); j++ {
|
|
regressions = append(regressions, Coordinate{
|
|
X: s[j].X,
|
|
Y: s[j].X*gradient + intercept,
|
|
})
|
|
}
|
|
|
|
return regressions, nil
|
|
}
|
|
|
|
// ExponentialRegression returns an exponential regression on data series
|
|
func ExponentialRegression(s Series) (regressions Series, err error) {
|
|
|
|
if len(s) == 0 {
|
|
return nil, EmptyInputErr
|
|
}
|
|
|
|
var sum [6]float64
|
|
|
|
for i := 0; i < len(s); i++ {
|
|
if s[i].Y < 0 {
|
|
return nil, YCoordErr
|
|
}
|
|
sum[0] += s[i].X
|
|
sum[1] += s[i].Y
|
|
sum[2] += s[i].X * s[i].X * s[i].Y
|
|
sum[3] += s[i].Y * math.Log(s[i].Y)
|
|
sum[4] += s[i].X * s[i].Y * math.Log(s[i].Y)
|
|
sum[5] += s[i].X * s[i].Y
|
|
}
|
|
|
|
denominator := (sum[1]*sum[2] - sum[5]*sum[5])
|
|
a := math.Pow(math.E, (sum[2]*sum[3]-sum[5]*sum[4])/denominator)
|
|
b := (sum[1]*sum[4] - sum[5]*sum[3]) / denominator
|
|
|
|
for j := 0; j < len(s); j++ {
|
|
regressions = append(regressions, Coordinate{
|
|
X: s[j].X,
|
|
Y: a * math.Exp(b*s[j].X),
|
|
})
|
|
}
|
|
|
|
return regressions, nil
|
|
}
|
|
|
|
// LogarithmicRegression returns an logarithmic regression on data series
|
|
func LogarithmicRegression(s Series) (regressions Series, err error) {
|
|
|
|
if len(s) == 0 {
|
|
return nil, EmptyInputErr
|
|
}
|
|
|
|
var sum [4]float64
|
|
|
|
i := 0
|
|
for ; i < len(s); i++ {
|
|
sum[0] += math.Log(s[i].X)
|
|
sum[1] += s[i].Y * math.Log(s[i].X)
|
|
sum[2] += s[i].Y
|
|
sum[3] += math.Pow(math.Log(s[i].X), 2)
|
|
}
|
|
|
|
f := float64(i)
|
|
a := (f*sum[1] - sum[2]*sum[0]) / (f*sum[3] - sum[0]*sum[0])
|
|
b := (sum[2] - a*sum[0]) / f
|
|
|
|
for j := 0; j < len(s); j++ {
|
|
regressions = append(regressions, Coordinate{
|
|
X: s[j].X,
|
|
Y: b + a*math.Log(s[j].X),
|
|
})
|
|
}
|
|
|
|
return regressions, nil
|
|
}
|