| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| | |
|
| |
|
|
| |
I forgot about the null bytes that come from loading sectors.
|
| |
|
|
|
|
|
|
|
| |
This is with KVM on a pretty fast Thinkpad.
If I exclude images, 14MB takes 45s to load.
There's also a bug in parsing at the moment; it aborts after loading all
records.
|
| | |
|
| | |
|
| |
|
|
|
|
|
| |
They're easier to process when loading the data disk.
In the process we lose a few more items because they're comments to
items we were dropping earlier.
|
| | |
|
| |
|
|
| |
Now items just have a field for parent id.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
| |
Vestige from when we were scanning all files in the current directory
rather than channels.json.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
| |
I'm hackily depending on Python (3.something) to prototype the disk
image creator. But no non-std libs.
Once the disk image is created, I've validated that it can be loaded
from disk without too much latency (assuming KVM).
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Immediately this simplifies support for comments in image data.
|
| | |
|
| | |
|
| |
|
|
| |
We support 128px, so let's use the whole 128px.
|
| | |
|
| | |
|
| |
|
|
|
|
| |
Not quite working yet. Only the very first rendering succeeds. After
that any keypress triggers a second render which aborts. Image is
getting corrupted in memory somehow.
|
| |
|
|
|
|
| |
I'm loading them in uncompressed ASCII format, and all streams and gap
buffers all over the place need to get massively scaled up to 256KB
capacity. But the tests don't yet run out of RAM, so I'll keep going.
|
| | |
|
| |
|
|
|
|
|
| |
This was the whole proximal goal in implementing balanced terminals.
Printing these is still unreliable. It always surrounds in [], which may
not work.
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
I've always been dissatisfied with the notion of escaping. It introduces
a special-case meta-notation within the tokenizer, and the conventional
approach leads to exponential "leaning toothpick syndrome" with each
level of escaping.
One potential "correct" solution is to keep string terminals
parameterizable:
[abc] => abc
[=] => =
[=[abc]=] => abc
[=[a]bc]=] => a]bc
[==[a]=]bc]==] => a]=]bc
..and so on. Basically the terminals grow linearly as the number of
escapings grow.
While this is workable, I'd like to wait until I actually need it, and
then gauge whether the need is a sign of the stack growing too complex,
with too many layers of notation/parsing. Mu's goal is just 3 notations,
and it's going to require constant vigilance to keep that from growing.
Therefore, for now, there are two notations for string literals, one
symmetric and one balanced:
"abc" => abc
[abc] => abc
The balancing notation permits nested brackets as long as they balance.
[abc [def]] => abc [def]
If you need unbalanced square brackets, use the symmetric terminals:
"abc [def" => abc [def
If you need double quotes inside strings, use the balanced notation:
[abc "def] => abc "def
If you need _both_ square brackets (whether balanced or unbalanced) and
double quotes, you're currently shit outta luck.
|
| | |
|