Checkpoint
This commit is contained in:
160 files changed
+76293
-387
No files matched your search
@@ -0,0 +1,46 @@
|
||||
package fourier
|
||||
|
||||
// RevBitsTypes is a type constraint interface to scope the allowed types to
|
||||
// call the ReverseBits function.
|
||||
type RevBitsTypes interface {
|
||||
uint | uint16 | uint32 | uint64 | int | int16 | int32 | int64
|
||||
}
|
||||
|
||||
// ReverseFirstBits returns the first `size` bits of `value` in reverse order
|
||||
// from: http://graphics.stanford.edu/~seander/bithacks.html#BitReverseObvious
|
||||
func ReverseFirstBits[T RevBitsTypes](value, size T) (reverse T) {
|
||||
for ; value > 0; value, size = value>>1, size-1 {
|
||||
reverse <<= 1 // left shift
|
||||
reverse |= value & 1 // add next bit
|
||||
}
|
||||
|
||||
return reverse << size
|
||||
}
|
||||
|
||||
// ReverseBits returns the bits of `value` in reverse order
|
||||
// from: http://graphics.stanford.edu/~seander/bithacks.html#BitReverseObvious
|
||||
func ReverseBits[T RevBitsTypes](value T) (reverse T) {
|
||||
for ; value > 0; value >>= 1 {
|
||||
reverse <<= 1 // left shift
|
||||
reverse |= value & 1 // add next bit
|
||||
}
|
||||
|
||||
return reverse
|
||||
}
|
||||
|
||||
// ReorderData shuffles the input complex128 values to re-order it,
|
||||
// setting the first half of the slice in even indexes and the last half
|
||||
// of the slice in odd indexes.
|
||||
func ReorderData(value []complex128) []complex128 {
|
||||
var (
|
||||
ln = len(value)
|
||||
reorder = make([]complex128, ln)
|
||||
sizeLog = Log2(ln)
|
||||
)
|
||||
|
||||
for i := range value {
|
||||
reorder[ReverseFirstBits(i, sizeLog)] = value[i]
|
||||
}
|
||||
|
||||
return reorder
|
||||
}
|
||||
Reference in new issue
Block a user