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.
38 Commits
2 Branches
0 Tags
594 KiB
 
Tree: 670e33269a
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '670e33269a'
${ noResults }
Ivan Ukhov 670e33269a
Do not require sudo 		9 years ago
benches Rename the package to dft 9 years ago
src Make use of is_power_of_two 9 years ago
tests Rename the package to dft 9 years ago
.gitignore Initialize the project 9 years ago
.travis.yml Do not require sudo 9 years ago
Cargo.toml Bump the version number 9 years ago
LICENSE.txt Initialize the project 9 years ago
README.md Fix a broken link 9 years ago

README.md

DFT Version Status

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

Documentation

Contributing

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