mirror of
https://github.com/gonum/gonum.git
synced 2025-10-31 02:26:59 +08:00
111 lines
2.5 KiB
Go
111 lines
2.5 KiB
Go
// Copyright ©2017 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 c64
|
|
|
|
import (
|
|
"math/cmplx"
|
|
"testing"
|
|
)
|
|
|
|
func same(x, y complex64) bool {
|
|
return x == y || (cmplx.IsNaN(complex128(x)) && cmplx.IsNaN(complex128(y)))
|
|
}
|
|
|
|
func guardVector(vec []complex64, gdVal complex64, gdLen int) (guarded []complex64) {
|
|
guarded = make([]complex64, len(vec)+gdLen*2)
|
|
copy(guarded[gdLen:], vec)
|
|
for i := 0; i < gdLen; i++ {
|
|
guarded[i] = gdVal
|
|
guarded[len(guarded)-1-i] = gdVal
|
|
}
|
|
return guarded
|
|
}
|
|
|
|
func isValidGuard(vec []complex64, gdVal complex64, gdLen int) bool {
|
|
for i := 0; i < gdLen; i++ {
|
|
if !same(vec[i], gdVal) || !same(vec[len(vec)-1-i], gdVal) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
func guardIncVector(vec []complex64, gdVal complex64, inc, gdLen int) (guarded []complex64) {
|
|
if inc < 0 {
|
|
inc = -inc
|
|
}
|
|
inrLen := len(vec) * inc
|
|
guarded = make([]complex64, inrLen+gdLen*2)
|
|
for i := range guarded {
|
|
guarded[i] = gdVal
|
|
}
|
|
for i, v := range vec {
|
|
guarded[gdLen+i*inc] = v
|
|
}
|
|
return guarded
|
|
}
|
|
|
|
func checkValidIncGuard(t *testing.T, vec []complex64, gdVal complex64, inc, gdLen int) {
|
|
srcLen := len(vec) - 2*gdLen
|
|
if inc < 0 {
|
|
srcLen = len(vec) * -inc
|
|
}
|
|
|
|
for i := range vec {
|
|
switch {
|
|
case same(vec[i], gdVal):
|
|
// Correct value
|
|
case (i-gdLen)%inc == 0 && (i-gdLen)/inc < len(vec):
|
|
// Ignore input values
|
|
case i < gdLen:
|
|
t.Errorf("Front guard violated at %d %v", i, vec[:gdLen])
|
|
case i > gdLen+srcLen:
|
|
t.Errorf("Back guard violated at %d %v", i-gdLen-srcLen, vec[gdLen+srcLen:])
|
|
default:
|
|
t.Errorf("Internal guard violated at %d %v", i-gdLen, vec[gdLen:gdLen+srcLen])
|
|
}
|
|
}
|
|
}
|
|
|
|
var ( // Offset sets for testing alignment handling in Unitary assembly functions.
|
|
align1 = []int{0, 1}
|
|
align2 = newIncSet(0, 1)
|
|
align3 = newIncToSet(0, 1)
|
|
)
|
|
|
|
type incSet struct {
|
|
x, y int
|
|
}
|
|
|
|
// genInc will generate all (x,y) combinations of the input increment set.
|
|
func newIncSet(inc ...int) []incSet {
|
|
n := len(inc)
|
|
is := make([]incSet, n*n)
|
|
for x := range inc {
|
|
for y := range inc {
|
|
is[x*n+y] = incSet{inc[x], inc[y]}
|
|
}
|
|
}
|
|
return is
|
|
}
|
|
|
|
type incToSet struct {
|
|
dst, x, y int
|
|
}
|
|
|
|
// genIncTo will generate all (dst,x,y) combinations of the input increment set.
|
|
func newIncToSet(inc ...int) []incToSet {
|
|
n := len(inc)
|
|
is := make([]incToSet, n*n*n)
|
|
for i, dst := range inc {
|
|
for x := range inc {
|
|
for y := range inc {
|
|
is[i*n*n+x*n+y] = incToSet{dst, inc[x], inc[y]}
|
|
}
|
|
}
|
|
}
|
|
return is
|
|
}
|