feat: grow memory limits, add icon/actor libraries, overhaul LSP diagnostics

Compiler and VM
- make every memory map limit dynamic and adjustable at both build time and
  runtime, including compiler tables, stacks, and every execution region
- reserve and grow tables, operand and return stacks, frame segments, and
  image-building output without relocating live code or globals
- rename i/o and string helpers consistently (puts -> put_s, putn -> put_n,
  scat -> cat_s) across compiler, runtime, examples, tests, and docs
- recast and consume values assigned to globals from inside functions
- allow fixed and const together, add typed closure returns (fn:t(...)),
  multi-include syntax (include rt, run, core;), and recurse type inference
- never infer string literals as word, anywhere, as argument, variable, or
  return type
- draft docs/BORROW.md: a borrow checker less intrusive than Rust's but more
  intelligent

LSP and editor integration
- require explicit includes and give every toolchain area its own namespace
  (rt, lsp, run, core)
- hover for built-in types, inferred types, values known at hover time, array
  and pointer lifetime/size, library names in include statements, and inferred
  lifetimes with explanations
- honor /* */ comments as documentation for variables and arguments, and stop
  misattributing section headers or trailing comments as variable hints
- stream diagnostics and cancel stale requests on change
- jump to definition and references, including cross-file
- quick fixes with automatic library import, and namespace completion

Hints and diagnostics
- render hints as blue squigglies by default, with hints on/small/off per file
- suppress magic-number hints via a preceding /* */ comment, and say so
- warn on unused arguments; allow multiple _ discards in parameters, pattern
  matching, and tagged enums, warning if a _ is actually used
- rewrite hint and comment prose in professional compiler-doc register

Libraries
- add icon.zc: run-time self-modification, find/replace syntax, type and block
  edits, and step-through inspection of locals and globals
- add actor.zc: async actors with Actor<I,O>, implicit this, spawn/recv/send,
  injected into the compiler machinery at include time rather than built in

Tooling and docs
- reorganize sources, tests, and designs into subdirectories
- unify windows entry points in tinyvm.bat and add a matching tinyvm.sh
- add --help across the toolchain
- polish the learning guide, stdlib docs, and design notes

Tests
- add accept, reject, and regression coverage across the compiler, LSP,
- runtime, icon, actors, threads, formatting, and the toolchain contracts,
  plus fuzzers and property tests

1 files changed, 10 insertions, 2 deletions

diff --git a/editors/vscode/client/diagcache.js b/editors/vscode/client/diagcache.js
index 6e77207..2e1758a 100644
--- a/editors/vscode/client/diagcache.js
+++ b/editors/vscode/client/diagcache.js
@@ -42,6 +42,7 @@ function includeNames(text) {
     while ((m = tokens.exec(text)) !== null) {
         const token = m[0];
         if (token.startsWith('//') || token.startsWith('/*')) continue;
+        // include std; names the library that is part of the compiler: there is no file to read
         if (include && token.startsWith('"')) {
             names.push(token.slice(1, -1).replace(/\\([\\"nrt0])/g, (_, c) => ({ n: '\n', r: '\r', t: '\t', 0: '\0' })[c] || c));
         }
@@ -80,13 +81,20 @@ function sourceTree(text, docPath, workspace) {
 // the key for a document and the files it reads. key is null when the tree is
 // too large to cover, and then nothing is cached. deps lists every file the
 // tree names (existing or not), so a change to any of them can be noticed.
+// texts maps each file that exists to its text, which a server with no files
+// of its own is sent before it checks the document.
 function diagKey(stamp, text, docPath, workspace) {
     const tree = sourceTree(text, docPath, workspace);
     const deps = [...tree.files.keys()].sort();
-    if (!tree.complete) return { key: null, deps };
+    const texts = new Map();
+    for (const [p, hash] of tree.files) {
+        if (hash === 'missing') continue;
+        try { texts.set(p, fs.readFileSync(p, 'utf8')); } catch (e) { /* gone since it was hashed */ }
+    }
+    if (!tree.complete) return { key: null, deps, texts };
     const parts = [stamp, docPath, sha256(text)];
     for (const p of deps) parts.push(p + '=' + tree.files.get(p));
-    return { key: sha256(parts.join('\n')), deps };
+    return { key: sha256(parts.join('\n')), deps, texts };
 }
 
 // the cache itself: key -> diagnostics, least recently used first. saved is