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.
16 Commits
2 Branches
0 Tags
594 KiB
 
Tree: fbc2e84c7e
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'fbc2e84c7e'
${ noResults }
Ivan Ukhov fbc2e84c7e
Adjust the description 		10 years ago
benches Remove conversion hacks 10 years ago
src Adjust the description 10 years ago
tests Remove conversion hacks 10 years ago
.gitignore Initialize the project 10 years ago
.travis.yml Set up Travis CI 10 years ago
Cargo.toml Bump the version number 10 years ago
LICENSE.txt Initialize the project 10 years ago
README.md Fix the link to the documentation 10 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.