Skip to content
Continuous Integration

Implemented FFT convolution and lazy segment tree — fast and efficient #2552

Sign in to view logs

Implemented FFT convolution and lazy segment tree — fast and efficient

Implemented FFT convolution and lazy segment tree — fast and efficient #2552

Triggered via pull request October 23, 2025 19:29
@jsjgdhjsjgdh
opened #1848
jsjgdh:my-new-branch
Status Failure
Total duration 1m 21s
Artifacts –

Ci.yml

on: pull_request
Code style and tests
1m 12s
Code style and tests
Check for spelling errors
13s
Check for spelling errors
Fit to window
Zoom out
Zoom in

Annotations

7 errors
Check for spelling errors: Maths/FFT.js#L62
tRe ==> tree, the
Check for spelling errors: Maths/FFT.js#L62
uRe ==> sure, ire, are, urea, rue
Check for spelling errors: Maths/FFT.js#L60
tRe ==> tree, the
Check for spelling errors: Maths/FFT.js#L60
uRe ==> sure, ire, are, urea, rue
Check for spelling errors: Maths/FFT.js#L56
tRe ==> tree, the
Check for spelling errors: Maths/FFT.js#L50
uRe ==> sure, ire, are, urea, rue
Code style and tests
Process completed with exit code 1.