Skip to content

Commit

Permalink
[perf, fix] add FFT; fix warnings;
Browse files Browse the repository at this point in the history
  • Loading branch information
DreamPast committed Dec 28, 2024
1 parent a73bb8a commit 1afb39e
Show file tree
Hide file tree
Showing 4 changed files with 1,557 additions and 32 deletions.
6 changes: 3 additions & 3 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@
- Avoids most UB (Undefined Behavior)
- Strict boundary checks
- Custom memory allocator support
- Most functions are optimized
- Almost all functions reach time complexity of O(n*log(n))
- No external dependencies

## Dependencies
Expand Down Expand Up @@ -56,11 +56,11 @@ Requires the following assumptions for modern platforms:

- [ ] High-precision integers
- [x] Arithmetic
- [ ] Faster multiplicatin
- [x] Faster multiplicatin
- [x] Karatsuba algorithm (Toom-2)
- [x] Toom-3 algorithm
- [x] Toom-4 algorithm
- [ ] FFT
- [x] FFT
- [x] Faster base conversion
- [x] Faster input
- [x] Faster output
Expand Down
6 changes: 3 additions & 3 deletions README_zh_CN.md
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@
- 规避了绝大部分的UB行为
- 严格的边界检查
- 可使用自定义的内存分配器
- 大部分函数进行了一定优化
- 几乎所有函数的时间复杂度达到了O(n*log(n))
- 无外置依赖

## 依赖
Expand Down Expand Up @@ -56,11 +56,11 @@

- [ ] 高精度整数
- [x] 算术
- [ ] 更快的乘法
- [x] 更快的乘法
- [x] Karatsuba算法(Toom-2)
- [x] Toom-3算法
- [x] Toom-4算法
- [ ] FFT
- [x] FFT
- [x] 更快的进制转换
- [x] 更快的输入
- [x] 更快的输出
Expand Down
Loading

0 comments on commit 1afb39e

Please sign in to comment.