HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
jhallen
joes-sandbox
C2014–2022
jhallen / joes-sandbox

joes-sandbox

Discover this repository through its Hacker News conversations.

25Distinct people
57Mentions
0Explicit recommenders
679GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use was verified in the last source check.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 11:39:46 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year57 dated mentions

Observed mentions: 2014-10-24 03:31:51 UTC to 2022-03-06 00:45:44 UTC.

0510152014-01-01 00:00:00 UTC to 2015-01-01 00:00:00 UTC (exclusive): 6 mentions; 1 submissions, 5 comments20142015-01-01 00:00:00 UTC to 2016-01-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2016-01-01 00:00:00 UTC to 2017-01-01 00:00:00 UTC (exclusive): 6 mentions; 3 submissions, 3 comments2017-01-01 00:00:00 UTC to 2018-01-01 00:00:00 UTC (exclusive): 13 mentions; 2 submissions, 11 comments2018-01-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 10 mentions; 1 submissions, 9 comments20182019-01-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 5 mentions; 0 submissions, 5 comments2020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 7 mentions; 1 submissions, 6 comments2021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 3 mentions; 1 submissions, 2 comments2022-01-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2022

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
20142014-01-01 00:00:00 UTC2015-01-01 00:00:00 UTC615
20152015-01-01 00:00:00 UTC2016-01-01 00:00:00 UTC505
20162016-01-01 00:00:00 UTC2017-01-01 00:00:00 UTC633
20172017-01-01 00:00:00 UTC2018-01-01 00:00:00 UTC13211
20182018-01-01 00:00:00 UTC2019-01-01 00:00:00 UTC1019
20192019-01-01 00:00:00 UTC2020-01-01 00:00:00 UTC505
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC716
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC312
20222022-01-01 00:00:00 UTC2023-01-01 00:00:00 UTC202

From the project README

An excerpt from the repository, fetched Nov 13, 2026.

Read the project’s introduction
Joe Allen's Open Source Projects Projects outside of joes-sandbox libnklabs - A library for quickly making MCU-based products Joe's Own Editor Relaysbc - A single board relay computer Ivy Programming Language Atari Tools CP/M Emulator OrCad Tools Reverse engineer Zon JR XL Acoustic delay line memory (on Hackaday!) ExorSim - A Motorola EXORciser Simulator An I2C bus monitor for an Altera FPGA An item tracking application for an Opticon OPH-1005 or OPH-3001 scanner My YouTube Channel Some projects within joes-sandbox x86 Bootloaders x86 Coff Linker AACC Compiler generator Nicetex Psiman - an early version of markdown Zebra-140 Typesetter Small UNIX utilities Verilog Tools Notif - X Widget Library Farb - arbitrary precision ASCII floating point library SDU - structured data loader JCC - A C language pre-processor / tokenizer A Btree library A version of Malloc Some regular expression code A C library Some compression code Some math code: complex roots / Fourier transform JTERM - an MS-DOS terminal emulator Phantom - A "ghost" clone (partition archiver) Tetris for Zortech-C A drafting program for SCO Xenix
Read the full README on GitHub

What Hacker News says

10 sources
I've implemented something like this in a non-LISP syntax language. See: https://github.com/jhallen/joes-sandbox/tree/master/lang/ivy The idea is that in a function call, the arguments are normally evaluated before the call as usual. But if a formal argument in the function's declaration is prefixed with ampersand then during a function call, that argument is not evaluated, but is instead packaged up as a zero-argument lambda function. The argument can be called later using the normal function call syntax, but also there is semantic sugar: the * operator calls a zero-argument function. Further, when a variable is evaluated, you get both its value and a reference to it. This allows variables to be evaluated before being assigned to in assignments. This sounds weird, but it works with the above. You can make a "set" function which doe
Read the rest
s the same thing as assignment: # Define set function fn set(&left, right) { *left = right } # Set x to 10 set x 10 Here is how you could define switch using primitives (if the last argument is prefixed with ampersand, then any extra arguments are treated the same, but can only be accessed via argv): fn switch(&val) { var rtn, x, v = *val x = 1 while x < len(argv) - 1 { if *argv(x) == v { return *argv(x + 1) } x += 2 } if x < len(argv) { return *argv(x) } return void } Example use (8 arguments passed to switch- each set of braces is an argument): switch 2 1 { print "one" } 2 { print "two" } 3 { print "three" } { print "default" } "two" is printed in this case. Right now the delayed arguments are evaluated in the closure of the function call (so they are lexically scoped). The wrap/unwrap concept from this paper gives me ideas on how to make this more versatile...
In $vau: the ultimate abstraction (2010) [pdf]
For comparison, here is symbolic derivatives in C. I wrote this in 1990 for school project: https://github.com/jhallen/joes-sandbox/tree/master/x/xquiz I need to make slides and a better write up for it, but the program is a math quiz with equation editing and graphing capabilities for X. It includes a simplifier which will take derivatives if they are in the form: D(x^2)/D(x) The simplifier also combines terms, reduces fractions, etc. I was shooting for something like Macsyma. The derivative taking function is here: https://github.com/jhallen/joes-sandbox/blob/master/x/xquiz/... Equations are parsed into LISP-like lists, defined in box.h. There are list nodes, numbers and symbols. They are allocated in aligned pages. To distinguish between them, you look at the page header. Some of the classic LISP implementation used this same t
Read the rest
echnique- I was interested in it at the time, but wouldn't use it today. As you type equations in, they are typeset in standard math notation on the screen. You can edit the tree by selecting any part of the equation with the mouse. Once something is selected, you can type in a replacement, or click simplify, distribute, or factor. I had fun correlating mouse coordinates with tree locations.
In Fun with Symbolic Derivatives in Lisp
So that's why emacs whigs out sometimes when trying to open very large files: because it has a recursive GC that has trouble when it runs out of stack space. Assuming I read the first statement correctly. That doesn't seem right to me. (a) In emacs a file's contents aren't stored in a deeply nested structure, no matter what the size. It's a gap buffer. (b) Structure aside, that buffer isn't a Lisp object, but an object internal to the C level, so not subject to GC. And note that Emacs's large file behavior isn't especially different than other non-minimalist editors[1]. https://github.com/jhallen/joes-sandbox/tree/master/editor-p...
In Let's make the Emacs GC safe and iterative
True, slower than Vim, but: 1) Replacing 10000 words took Sublime 6 seconds instead of Vim 4 seconds. Both very quick compared to the competition. 2) It is nowhere near as bloated as VSCode or Atom. More comparisons here [1]. 3) In the "Rehighlight test" at [1], Vim is slower than Sublime as well. Vim fails with "Time to load 3 GB file, insert character at start and exit" [1] while Sublime loads in 75 seconds. Many editors choked on that. Some refused to try, other tried and failed/died. 4) Performance is going to differ per plugin and dotfile which is often a unique setup for pro users. 5) Arguably these don't compete with each other as Sublime is a GUI application while Vim is CLI. They don't necessarily attempt to cater to the same type of user. You could say the same about IDEs though. Sublime has the reputation of being a closed sour
Read the rest
ce (proprietary), portable (running on all 3 major GUI OSes), GUI text-editor which is very quick [2] and great for development, particularly because it can be extended via plugins, and being JSON under the hood (config files). Its even free to use for non-commercial use, and doesn't nag the user about a software license except for mentioning UNREGISTERED at the bottom right. I prefer open source software, but in closed source software this is about as honest, kind, friendly as it gets. [1] https://github.com/jhallen/joes-sandbox/tree/master/editor-p... [2] Quick as being perceived, as well as proven by these benchmarks.
In Why I Still Use Vim

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.