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.
5 Commits
2 Branches
0 Tags
594 KiB
 
Tree: 0d30077cbc
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '0d30077cbc'
${ noResults }
Ivan Ukhov 0d30077cbc
Describe properly the functions 		11 years ago
src Describe properly the functions 11 years ago
tests Split transform into forward and inverse 11 years ago
.gitignore Initialize the project 11 years ago
Cargo.toml Add a couple of failing tests 11 years ago
LICENSE.txt Initialize the project 11 years ago
README.md Add a couple of failing tests 11 years ago

README.md

FFT

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

Contributing

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