// -*- C++ -*- // automatically generated by autodoc // ========== HEADER FILE src/walsh/and-convolution.h: ========== inline void slow_and_convolution(const Type *f, const Type *g, ulong ldn, Type *h); // Compute the AND-convolution h[] of f[] and g[]: // h[k] = sum(i & j == k, f[i]*g[j]) // Result written to h[]. inline void and_convolution(Type * restrict f, Type * restrict g, ulong ldn); // Compute the AND-convolution h[] of f[] and g[]: // h[k] = sum(i & j == k, f[i]*g[j]) // f[] and g[] must not overlap. // Result written to g[]. inline void and_auto_convolution(Type *f, ulong ldn); // Compute the self- AND-convolution h[] of f[]: // h[k] = sum(i & j == k, f[i]*f[j]) // Result written to f[]. // ========== HEADER FILE src/walsh/arithtransform.h: ========== void arith_transform_plus(Type *f, ulong ldn); // Arithmetic transform (positive sign). // Radix-2 decimation In Frequency (DIF) algorithm. // Inverse of arith_transform_minus(). void arith_transform_minus(Type *f, ulong ldn); // Arithmetic transform (negative sign). // Radix-2 decimation In Frequency (DIF) algorithm. // Inverse of arith_transform_plus(). void rev_arith_transform_plus(Type *f, ulong ldn); // Reversed arithmetic transform (positive sign). // Radix-2 decimation In Frequency (DIF) algorithm. // Inverse of rev_arith_transform_minus(). // Same as: // { n=1UL<