warricksothr
/
dft
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
26 Commits
2 Branches
0 Tags
594 KiB
 
Tree: fd89df9eab
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'fd89df9eab'
${ noResults }
Ivan Ukhov fd89df9eab
Split inverse into backward and inverse 		11 years ago
benches Add benchmarks for the real part 11 years ago
src Split inverse into backward and inverse 11 years ago
tests Split inverse into backward and inverse 11 years ago
.gitignore Initialize the project 11 years ago
.travis.yml Set up Travis CI 11 years ago
Cargo.toml Bump the version number 11 years ago
LICENSE.txt Initialize the project 11 years ago
README.md Fix the link to the documentation 11 years ago

README.md

FFT Version Status

The package provides an algorithm to compute the discrete Fourier transform and its inverse.

Documentation

Contributing

  1. Fork the project.
  2. Implement your idea.
  3. Open a pull request.