28 using Complex = FFTD::Complex;
34 for (
size_t i = 0; i < values.
size(); ++i)
36 std::cout <<
"[" << std::setprecision(17) << values[i].real()
37 <<
", " << values[i].imag() <<
"]";
38 if (i + 1 != values.
size())
48 for (
size_t i = 0; i < values.
size(); ++i)
50 std::cout << std::setprecision(17) << values[i];
51 if (i + 1 != values.size())
61 std::locale::global(std::locale::classic());
62 std::cout.imbue(std::locale::classic());
69 Complex(-0.75, 0.125),
81 for (
size_t i = 0; i < 17; ++i)
82 prime_signal.append(Complex(0.5 *
static_cast<double>(i) - 2.0,
83 (
static_cast<double>(i % 5) - 2.0) * 0.75));
94 std::cout <<
" \"complex_signal\": ";
96 std::cout <<
",\n \"complex_spectrum\": ";
98 std::cout <<
",\n \"real_signal\": ";
100 std::cout <<
",\n \"real_full_spectrum\": ";
102 std::cout <<
",\n \"real_compact_spectrum\": ";
104 std::cout <<
",\n \"real_reconstructed\": ";
106 std::cout <<
",\n \"prime_signal\": ";
108 std::cout <<
",\n \"prime_spectrum\": ";
110 std::cout <<
"\n}\n";
Simple dynamic array with automatic resizing and functional operations.
constexpr size_t size() const noexcept
Return the number of elements stored in the stack.
void reserve(size_t cap)
Reserves cap cells into the array.
Fast Fourier Transform (FFT) and DSP Toolkit.
Fast Fourier Transform (FFT) and Digital Signal Processing (DSP) toolkit.
Main namespace for Aleph-w library functions.
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Dynamic array container with automatic resizing.