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.
7 Commits
2 Branches
0 Tags
594 KiB
 
Tree: b1c7f9f25c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b1c7f9f25c'
${ noResults }
Ivan Ukhov b1c7f9f25c
Move complex stuff to a separate crate 		9 years ago
src Move complex stuff to a separate crate 9 years ago
tests Switch to a different implementation 9 years ago
.gitignore Initialize the project 9 years ago
Cargo.toml Move complex stuff to a separate crate 9 years ago
LICENSE.txt Initialize the project 9 years ago
README.md Add a couple of failing tests 9 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.