James Schloss
James Schloss
We used to have a "soft rule" of 80 columns a while back, which was enforced by several linters, but these had to be run locally. Now that we have...
How might the tag system be implemented, exactly?
There has been some discussion about adding in additional search capabilities. For example, it would be nice to be able to find a class of algorithms and then further sort...
Yeah, I actually had a partial fix implemented last week
@Gustorn recently brought up that we could do something like this: https://doc.rust-lang.org/book/second-edition/ch01-02-hello-world.html, where each codeblock can be run in the background. I don't know how well this will play with...
Right, I see the problem. I should probably rephrase the chapter so that it's clear we are solving for t the whole time.
Here is a list of all the partially complete language implementations: Convolutions: - [x] Haskell Cooley-Tukey: - [x] Haskell - [ ] Scratch Gaussian Elimination - [x] Rust Tree Traversal...
These issues are still present, even after hacktoberfest, so I will leave this open as a general issue. As a note, I might continually update this issue as more inconsistencies...
@jiegillet We are specifically missing some scratch code here. I don't remember who did rust, but I do remember who did LabVIEW and matlab and I'm pretty sure those will...
I just updated the previous list to include information about the FFT chapter (undergoing revision). Basically, all of the implementations besides julia do not have an appropriate test against an...