NewYour coding agent can read the release notes before it upgrades.Set up the MCP server →
crates.io · #3896 most downloaded on crates.io
Compute Discrete Cosine Transforms (DCT) of any size in O(nlogn) time, in pure Rust.
Last release 4 years ago
no release in 18 months
Release timing varies
gaps range from 4 weeks to 1.7 years
Some releases are documented
notes for 6 of 12 stable releases
1 version withdrawn
withdrawn after publishing
9 years old
13 releases · first in 2017
Small style improvements to unsafe blocks
Nothing published for this version
Nothing published for this version
One column per quarter.
Added a blanket impl for the DCTnum trait, making it easier to use arbitrary numeric types.
Upgraded rustfft version from 3 to 4
dyn keywordRenamed Type2and3 to TransformType2And3
Type2and3 to TransformType2And3Type4 to TransformType4All of the above are breaking changes that will be very relevant to you if you're referring to specific algorithms or writing your own, but if you're…
Removed the pub keyword from some methods on the DCTplanner that should not have been public
pub keyword from some methods on the DCTplanner that should not have been public[Breaking Change] The process method of all DCT traits take &self instead of &mut self
DCT#ViaFFT algorithms now allocate a Vec for internal scratch space, rather than using a member variable, allowing them to be immutable.process method of all DCT traits take &self instead of &mut selfArc pointers instead of Box pointersArc pointers to DCT instances instead of Box, and has a cache of algorithm instances for each DCT typeDCT4ViaFFT algorithm. For odd sizes, use DCT4ViaFFTOdd instead. For even sizes, use DCT4ViaDCT3. Both are considerably faster and use considerably less memory in all scenarios.Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Your coding agent can read these notes before it upgrades. Set up the MCP server →