Formerly u/CanadaPlus101 on Reddit.

  • 1 Post
  • 72 Comments
Joined 1 year ago
cake
Cake day: June 12th, 2023

help-circle


  • Yeah, you definitely run fixed tests on the whole thing. But when it returns indecipherable garbage, you’ve got to dive in in more detail, and at that point you’re just doing breakpoints and watchpoints and looking at walls of floating point values.

    I suppose Strassen’s is recursive, so you could tackle it that way, but for other numerical-type things there is no such option.


  • If I actually did have that kind of job, the tests-first philosophy would sound very appealing. Actually, build the stack so you don’t have a choice - the real code should just be an instantiation of plumbing on generic variables with certain expected statistical properties. You can do that when correctly processing unpredictable but repetitive stuff is the name of the game, and I expect someone does.


  • At a certain level of detail, tests just become a debugger, right?

    I’m thinking of something like an implementation of Strassen’s algorithm. It’s all arithmetic; you can’t really check for macro correctness without doing a similar kind of arithmetic yourself, which is basically just writing the same code again. It resembles nothing other than itself.




  • These days, a shallow folder system. I have an electronica folder, and a Blanck Mass folder that definitely would go in there but that is full enough to stand on it’s own. Actual taxonomic organisation would take way too many clicks, but flat organisation can result in trouble finding things, and just looks like you’re a slob. (Although I’m guilty of having unsorted hoarder folders for things I only needed once, too)

    There’s probably a rule of thumb for optimal fanout on each GUI folder, related to our visual processing. Hmm. I wonder if there’s a way to make the tree self-balancing as well.