diff --git a/README.md b/README.md index bf564e4c..4171d2e7 100644 --- a/README.md +++ b/README.md @@ -4,7 +4,7 @@ [![](https://img.shields.io/crates/v/rustfft.svg)](https://crates.io/crates/rustfft) [![](https://img.shields.io/crates/l/rustfft.svg)](https://crates.io/crates/rustfft) [![](https://docs.rs/rustfft/badge.svg)](https://docs.rs/rustfft/) -![minimum rustc 1.48](https://img.shields.io/badge/rustc-1.48+-red.svg) +![minimum rustc 1.37](https://img.shields.io/badge/rustc-1.37+-red.svg) RustFFT is a high-performance FFT library written in pure Rust. It can compute FFTs of any size, including prime-number sizes, in O(nlogn) time. @@ -28,7 +28,7 @@ fft.process(&mut buffer); ## Supported Rust Version -RustFFT requires rustc 1.48 or newer. Minor releases of RustFFT may upgrade the MSRV(minimum supported Rust version) to a newer version of rustc. +RustFFT requires rustc 1.37 or newer. Minor releases of RustFFT may upgrade the MSRV(minimum supported Rust version) to a newer version of rustc. However, if we need to increase the MSRV, the new Rust version must have been released at least six months ago. ## Stability/Future Breaking Changes diff --git a/src/plan.rs b/src/plan.rs index bc22f0e9..53eb3e4f 100644 --- a/src/plan.rs +++ b/src/plan.rs @@ -99,7 +99,7 @@ const MIN_BLUESTEIN_MIXED_RADIX_LEN: usize = 90; // only use mixed radix for the /// A Recipe is a structure that describes the design of a FFT, without actually creating it. /// It is used as a middle step in the planning process. -#[derive(Debug, std::cmp::PartialEq, Clone)] +#[derive(Debug, PartialEq, Clone)] pub enum Recipe { Dft(usize), MixedRadix { @@ -359,9 +359,6 @@ impl FftPlannerScalar { if len.is_power_of_two() { Rc::new(Recipe::Radix4(len)) } else { - dbg!(len); - dbg!(len.trailing_zeros()); - dbg!(&factors); let non_power_of_two = factors .remove_factors(PrimeFactor { value: 2,