358 karma · joined October 1, 2013
it grew out of annoyance of dependencies on js runtimes, probably similar to you. mine additionally works on solaris and esp32.
could be interesting to collaborate!
found an assertion just by clicking up/down. doesn't seem too stable.
you can see some of this in the work of the progenitors of Go.
quoth pike style, from rob pike:
Rule 4. Fancy algorithms are buggier than simple ones, and they're much harder to implement. Use simple algorithms as well as simple data structures.
The following data structures are a complete list for almost all practical programs:
array
linked list
hash table
binary treeOf course, you must also be prepared to collect these into compound data structures. For instance, a symbol table might be implemented as a hash table containing linked lists of arrays of characters.
https://www.freedesktop.org/software/systemd/man/systemd.pat...
it is a protocol for a specific purpose, and because it has that specific purpose, it was used for that, and desired for that. http can do it, but without the constraints, of course nobody will use it for reinventing finger.
some people at cat-v.org were interested in this and there happened to be a copy at stanford library where a roommate of mine was working at the time. he borrowed it on my behalf and i used the book scanner at noisebridge in san francisco (constructed from wood and two canon cameras and a python script) to image it, and uploaded it to archive.org.