Skip to content

Commit 9f6d15e

Browse files
authored
Merge branch 'main' into compathelper/new_version/2021-08-01-00-41-02-362-3096932771
2 parents 16f1eae + 75139b5 commit 9f6d15e

File tree

2 files changed

+5
-5
lines changed

2 files changed

+5
-5
lines changed

Project.toml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,10 +6,10 @@ version = "0.1.0"
66
[deps]
77
DocStringExtensions = "ffbed154-4ef7-542d-bbb7-c09d3a79fcae"
88
Primes = "27ebfcd6-29c5-5fa9-bf4b-fb8fc14df3ae"
9-
ReTest = "e0db7c4e-2690-44b9-bad6-7687da720f89"
109

1110
[compat]
1211
DocStringExtensions = "0.8"
12+
Primes = "0.5"
1313
julia = "1"
1414

1515
[extras]

README.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -12,9 +12,9 @@ Path Forward:
1212
- Other performance left on the table....
1313

1414
Interface:
15-
`fft(x::AbstractVector{<:Complex})`-- Forward FFT
16-
`fft(x::AbstractMatrix{<:Complex})`-- Forward FFT
17-
`bfft(x::AbstractVector{<:Complex})`-- Backward FFT (unscaled inverse FFT)
18-
`bfft(x::AbstractMatrix{<:Complex})`-- Backward FFT (unscaled inverse FFT)
15+
- `fft(x::AbstractVector{<:Complex})`-- Forward FFT
16+
- `fft(x::AbstractMatrix{<:Complex})`-- Forward FFT
17+
- `bfft(x::AbstractVector{<:Complex})`-- Backward FFT (unscaled inverse FFT)
18+
- `bfft(x::AbstractMatrix{<:Complex})`-- Backward FFT (unscaled inverse FFT)
1919

2020
NOTE: Currently, my C++ code is actually faster than this, so "Fastest Fourier Transform in my Apartment" is a bit of a misnomer.

0 commit comments

Comments
 (0)