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.
27 Commits
2 Branches
0 Tags
594 KiB
 
Tree: 0a39db1326
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '0a39db1326'
${ noResults }
Ivan Ukhov 0a39db1326
Rename perform to transform 		9 years ago
benches Add benchmarks for the real part 9 years ago
src Rename perform to transform 9 years ago
tests Split inverse into backward and inverse 9 years ago
.gitignore Initialize the project 9 years ago
.travis.yml Set up Travis CI 9 years ago
Cargo.toml Bump the version number 9 years ago
LICENSE.txt Initialize the project 9 years ago
README.md Fix the link to the documentation 9 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.