Integrate BACKBEAT SDK and resolve KACHING license validation
Major integrations and fixes: - Added BACKBEAT SDK integration for P2P operation timing - Implemented beat-aware status tracking for distributed operations - Added Docker secrets support for secure license management - Resolved KACHING license validation via HTTPS/TLS - Updated docker-compose configuration for clean stack deployment - Disabled rollback policies to prevent deployment failures - Added license credential storage (CHORUS-DEV-MULTI-001) Technical improvements: - BACKBEAT P2P operation tracking with phase management - Enhanced configuration system with file-based secrets - Improved error handling for license validation - Clean separation of KACHING and CHORUS deployment stacks 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>
This commit is contained in:
45
vendor/gonum.org/v1/gonum/mathext/digamma.go
generated
vendored
Normal file
45
vendor/gonum.org/v1/gonum/mathext/digamma.go
generated
vendored
Normal file
@@ -0,0 +1,45 @@
|
||||
// Copyright ©2016 The Gonum Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package mathext
|
||||
|
||||
import (
|
||||
"math"
|
||||
)
|
||||
|
||||
// Digamma returns the logorithmic derivative of the gamma function at x.
|
||||
//
|
||||
// ψ(x) = d/dx (Ln (Γ(x)).
|
||||
func Digamma(x float64) float64 {
|
||||
// This is adapted from
|
||||
// http://web.science.mq.edu.au/~mjohnson/code/digamma.c
|
||||
var result float64
|
||||
switch {
|
||||
case math.IsNaN(x), math.IsInf(x, 1):
|
||||
return x
|
||||
case math.IsInf(x, -1):
|
||||
return math.NaN()
|
||||
case x == 0:
|
||||
return math.Copysign(math.Inf(1), -x)
|
||||
case x < 0:
|
||||
if x == math.Floor(x) {
|
||||
return math.NaN()
|
||||
}
|
||||
// Reflection formula, http://dlmf.nist.gov/5.5#E4
|
||||
_, r := math.Modf(x)
|
||||
result = -math.Pi / math.Tan(math.Pi*r)
|
||||
x = 1 - x
|
||||
}
|
||||
for ; x < 7; x++ {
|
||||
// Recurrence relation, http://dlmf.nist.gov/5.5#E2
|
||||
result -= 1 / x
|
||||
}
|
||||
x -= 0.5
|
||||
xx := 1 / x
|
||||
xx2 := xx * xx
|
||||
xx4 := xx2 * xx2
|
||||
// Asymptotic expansion, http://dlmf.nist.gov/5.11#E2
|
||||
result += math.Log(x) + (1.0/24.0)*xx2 - (7.0/960.0)*xx4 + (31.0/8064.0)*xx4*xx2 - (127.0/30720.0)*xx4*xx4
|
||||
return result
|
||||
}
|
||||
Reference in New Issue
Block a user