aappleby

18 ms·

301.
Wideboard: Render _all_ of Linux's source code in a browser tab via WebGL(github.com)
136 points by aappleby 4y ago|39 comments
302.
by aappleby 4y ago
Howdy HN audience, wanted to share a revamped proof-of-concept that I originally wrote in 2013 for GPU accelerated text rendering in WebGL. This isn't intended to be a real text editor prototype, just a demonstration of how much text y
303.
by aappleby 4y ago
Complex systems decay over long periods of time.
304.
by aappleby 4y ago
https://github.com/aappleby/Metron
305.
by aappleby 4y ago
Clean your office. Seriously. All the little distractions and annoyances around us eat a serious amount of brainpower that _is_ shared with the brain chunks needed to do deep coding work. Every time I find myself unable to focus beyond a sh
306.
by aappleby 4y ago
I reverse-engineered the first Pi camera and you can make it record at all sorts of combinations of frame rate and resolution if you bypass the libraries provided. The limiting factor is how long it takes to shift a row of pixels out of the
307.
by aappleby 4y ago
I still do this on occasion, with these rules - 1. You can only have one loan at a time. 2. The money has to be used to complete a goal. Moving across country is a goal, paying rent is not. 3. There is no repayment date, but you do have to
308.
by aappleby 4y ago
Cable modem, Synology wifi router, Synology NAS, Synology wifi mesh node out in the shop. Simple, fast, stable.
309.
by aappleby 4y ago
(Or WebGPU, I keep forgetting that one exists...)
310.
by aappleby 4y ago
Old graphics dev here who has mentored new hires in basic rendering tech. Learn JavaScript+WebGL to the point where you can render simple models with textures, shaders, and a basic camera controller. Then, if you enjoy it and want to go fur
311.
by aappleby 4y ago
Real Names Considered Harmful
312.
by aappleby 4y ago
You didn't lose your passion, you lost your virtue signaling.
313.
by aappleby 4y ago
Ibex is open source and has taped out - https://github.com/lowRISC/ibex
314.
by aappleby 4y ago
Have you met any trans children?
315.
by aappleby 4y ago
Author here. Temporal programming overlaps with a lot of things, FRP included. I like to thing of FRP as being stream-at-a-time evaluation, whereas TP is whole-state-at-a-time evaluation. That probably doesn't make a whole lot of sense
316.
by aappleby 4y ago
Author here. Thanks for the reference, I'll add the IEC 61131 standard to my list.
317.
by aappleby 4y ago
Author here. One goal for MetroC is to have a codebase that can run equally well on a CPU or a FPGA. To do that efficiently, I need pretty detailed information about how exactly my program gets translated into x64 instructions or FPGA gates
318.
by aappleby 4y ago
Author here. I've commented on SSA and simulations (in the context of gamedev) elsewhere in this thread. Regarding phi nodes, they represent a "merge" of two possible execution branches. In C++ you evaluate one side of the if
319.
by aappleby 4y ago
Author here. My 'native' language is C++, though I'm productive in a half-dozen others. You can express the same snippet in just about anything, void or no.
320.
by aappleby 4y ago
Author here. Yes, it's another way to express graph computation, but without needing a graph-computation-specific language.
321.
by aappleby 4y ago
Author here. Thanks, that is a core goal of the whole project - take a bunch of existing concepts and represent them as implementation details of a simpler, more general framework.
322.
by aappleby 4y ago
Author here. "Now what have we bought ourselves? Not much." Well of course I disagree with that statement. My work on Metron suggests that we've bought ourselves a way to write programs that can execute on both CPUs and FPGAs
323.
by aappleby 4y ago
Author here. State is not immutable, it is mutate-in-place via atomic swap. That makes it somewhat different than both functional programming and imperative programming, but it's not an excessively difficult programming style to use in
324.
by aappleby 4y ago
Author here. Looks like FRP for the backend. I'll skim over it later.
325.
by aappleby 4y ago
Thanks, I'm always looking for feedback on how to make this concept more understandable.
326.
by aappleby 4y ago
Author here - If the transition takes place "before the last form of the body is evalulated", how does this work in the context of potentially deeply-nested function calls or assignments to sub-fields of some complex data structur
327.
by aappleby 4y ago
Author here. It's not "pure" functional progamming in that state exists and is mutable-in-place, but only via atomic swap - you can interpret the sequence of states as a sequence of monads, but the evaluation semantics are di
328.
by aappleby 4y ago
Author here. In Backus's paper, the next-state function accepts a (state, input) tuple and returns a (state, output) tuple.
329.
by aappleby 4y ago
Author here, you are correct. Implementing non-blocking assignment semantics in C++ is hard and can't really be done cleanly from within the language. Metron (the C++ to Verilog translator) relies on static analysis to prove that C-sty
330.
by aappleby 4y ago
Yep, I am a grumpy old ex-game-programmer (PS1 and N64 era) and wrote many, many little systems using double-buffered state.

More ›