mirror of
https://github.com/gonum/gonum.git
synced 2025-09-27 03:26:04 +08:00

Changes made in dsp/fourier/internal/fftpack break the formatting used there, so these are reverted. There will be complaints in CI. [git-generate] gofmt -w . go generate gonum.org/v1/gonum/blas go generate gonum.org/v1/gonum/blas/gonum go generate gonum.org/v1/gonum/unit go generate gonum.org/v1/gonum/unit/constant go generate gonum.org/v1/gonum/graph/formats/dot go generate gonum.org/v1/gonum/graph/formats/rdf go generate gonum.org/v1/gonum/stat/card git checkout -- dsp/fourier/internal/fftpack
123 lines
2.3 KiB
Go
123 lines
2.3 KiB
Go
// 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.
|
|
|
|
//go:build !amd64 || noasm || gccgo || safe
|
|
// +build !amd64 noasm gccgo safe
|
|
|
|
package c64
|
|
|
|
// AxpyUnitary is
|
|
//
|
|
// for i, v := range x {
|
|
// y[i] += alpha * v
|
|
// }
|
|
func AxpyUnitary(alpha complex64, x, y []complex64) {
|
|
for i, v := range x {
|
|
y[i] += alpha * v
|
|
}
|
|
}
|
|
|
|
// AxpyUnitaryTo is
|
|
//
|
|
// for i, v := range x {
|
|
// dst[i] = alpha*v + y[i]
|
|
// }
|
|
func AxpyUnitaryTo(dst []complex64, alpha complex64, x, y []complex64) {
|
|
for i, v := range x {
|
|
dst[i] = alpha*v + y[i]
|
|
}
|
|
}
|
|
|
|
// AxpyInc is
|
|
//
|
|
// for i := 0; i < int(n); i++ {
|
|
// y[iy] += alpha * x[ix]
|
|
// ix += incX
|
|
// iy += incY
|
|
// }
|
|
func AxpyInc(alpha complex64, x, y []complex64, n, incX, incY, ix, iy uintptr) {
|
|
for i := 0; i < int(n); i++ {
|
|
y[iy] += alpha * x[ix]
|
|
ix += incX
|
|
iy += incY
|
|
}
|
|
}
|
|
|
|
// AxpyIncTo is
|
|
//
|
|
// for i := 0; i < int(n); i++ {
|
|
// dst[idst] = alpha*x[ix] + y[iy]
|
|
// ix += incX
|
|
// iy += incY
|
|
// idst += incDst
|
|
// }
|
|
func AxpyIncTo(dst []complex64, incDst, idst uintptr, alpha complex64, x, y []complex64, n, incX, incY, ix, iy uintptr) {
|
|
for i := 0; i < int(n); i++ {
|
|
dst[idst] = alpha*x[ix] + y[iy]
|
|
ix += incX
|
|
iy += incY
|
|
idst += incDst
|
|
}
|
|
}
|
|
|
|
// DotcUnitary is
|
|
//
|
|
// for i, v := range x {
|
|
// sum += y[i] * conj(v)
|
|
// }
|
|
// return sum
|
|
func DotcUnitary(x, y []complex64) (sum complex64) {
|
|
for i, v := range x {
|
|
sum += y[i] * conj(v)
|
|
}
|
|
return sum
|
|
}
|
|
|
|
// DotcInc is
|
|
//
|
|
// for i := 0; i < int(n); i++ {
|
|
// sum += y[iy] * conj(x[ix])
|
|
// ix += incX
|
|
// iy += incY
|
|
// }
|
|
// return sum
|
|
func DotcInc(x, y []complex64, n, incX, incY, ix, iy uintptr) (sum complex64) {
|
|
for i := 0; i < int(n); i++ {
|
|
sum += y[iy] * conj(x[ix])
|
|
ix += incX
|
|
iy += incY
|
|
}
|
|
return sum
|
|
}
|
|
|
|
// DotuUnitary is
|
|
//
|
|
// for i, v := range x {
|
|
// sum += y[i] * v
|
|
// }
|
|
// return sum
|
|
func DotuUnitary(x, y []complex64) (sum complex64) {
|
|
for i, v := range x {
|
|
sum += y[i] * v
|
|
}
|
|
return sum
|
|
}
|
|
|
|
// DotuInc is
|
|
//
|
|
// for i := 0; i < int(n); i++ {
|
|
// sum += y[iy] * x[ix]
|
|
// ix += incX
|
|
// iy += incY
|
|
// }
|
|
// return sum
|
|
func DotuInc(x, y []complex64, n, incX, incY, ix, iy uintptr) (sum complex64) {
|
|
for i := 0; i < int(n); i++ {
|
|
sum += y[iy] * x[ix]
|
|
ix += incX
|
|
iy += incY
|
|
}
|
|
return sum
|
|
}
|