From 0edd654d469beae73d8e79ade424f701ce6c15a8 Mon Sep 17 00:00:00 2001 From: Kai Schmidt Date: Sat, 5 Oct 2024 19:53:33 -0700 Subject: [PATCH] fix typo in fft docs --- src/primitive/defs.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/primitive/defs.rs b/src/primitive/defs.rs index 2cd00fba1..ca063f0c1 100644 --- a/src/primitive/defs.rs +++ b/src/primitive/defs.rs @@ -3177,7 +3177,7 @@ primitive!( (0(0)[1], Struct, Misc, "struct"), /// Run the Fast Fourier Transform on an array /// - /// The Fast Fourier Transform (FFT) is an optmized algorithm for computing the Discrete Fourier Transform (DFT). The DFT is a transformation that converts a signal from the time domain to the frequency domain. + /// The Fast Fourier Transform (FFT) is an optimized algorithm for computing the Discrete Fourier Transform (DFT). The DFT is a transformation that converts a signal from the time domain to the frequency domain. /// /// The input array must be either real or complex. /// The result will always be complex.