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, 40 insertions, 28 deletions

diff --git a/tests/programs/stdmore.zc b/tests/programs/stdmore.zc
index fb225ec..e7975e6 100644
--- a/tests/programs/stdmore.zc
+++ b/tests/programs/stdmore.zc
@@ -1,32 +1,44 @@
-include "src/lib/std.zc";
+namespace;
+include rt, std;
+
+include std;
 fn main() {
 	let buf[32];
-	put_n(Text.len("hello")); put_c(' ');
-	put_n(Text.eq("abc", "abc")); put_c(' ');
-	put_n(Text.eq("abc", "abd")); put_c(' ');
-	put_n(Text.eq("ab", "abc")); put_c(' ');
-	put_n(Text.copy(buf, "copy me")); put_c(' ');
-	put_s(buf); put_c(' ');
-	put_n(Text.find("needle in a haystack", "hay")); put_c(' ');
-	put_n(Text.find("abc", "zz")); put_c(' ');
-	put_n(Text.find("abc", "")); put_c(10);
-	Text.copy(buf, "MiXeD 123");
-	put_n(Text.lower(buf)); put_c(' ');
-	put_s(buf); put_c(' ');
-	put_n(Text.upper(buf)); put_c(' ');
-	put_s(buf); put_c(10);
-	Text.copy(buf, "  \t padded line \r\n");
-	put_n(Text.trim(buf)); put_c(' ');
-	put_c('['); put_s(buf); put_c(']'); put_c(10);
-	put_n(Num.abs(0 - 42)); put_c(' ');
-	put_n(Num.min(3, 9)); put_c(' ');
-	put_n(Num.max(3, 9)); put_c(' ');
-	put_n(Num.clamp(50, 0, 10)); put_c(' ');
-	put_n(Num.gcd(0 - 84, 36)); put_c(' ');
-	put_n(Num.pow(3, 4)); put_c(' ');
-	put_n(Num.isqrt(99)); put_c(' ');
-	put_n(Num.isqrt(100)); put_c(' ');
-	put_n(Num.sign(0 - 5)); put_c(' ');
-	put_n(Num.sign(0)); put_c(10);
+	rt.put_n(std.Text.len("hello")); rt.put_c(' ');
+	rt.put_n(std.Text.eq("abc", "abc")); rt.put_c(' ');
+	rt.put_n(std.Text.eq("abc", "abd")); rt.put_c(' ');
+	rt.put_n(std.Text.eq("ab", "abc")); rt.put_c(' ');
+	rt.put_n(std.Text.copy(buf, "copy me")); rt.put_c(' ');
+	rt.put_s(buf); rt.put_c(' ');
+	rt.put_n(std.Text.find("needle in a haystack", "hay")); rt.put_c(' ');
+	rt.put_n(std.Text.find("abc", "zz")); rt.put_c(' ');
+	rt.put_n(std.Text.find("abc", "")); rt.put_c(' ');
+	rt.put_n(std.Text.ends("needle", "dle")); rt.put_c(' ');
+	rt.put_n(std.Text.ends("a", "abc")); rt.put_c(' ');
+	rt.put_n(std.Text.ends("a", "")); rt.put_c(10);
+	std.Text.copy(buf, "MiXeD 123");
+	rt.put_n(std.Text.lower(buf)); rt.put_c(' ');
+	rt.put_s(buf); rt.put_c(' ');
+	rt.put_n(std.Text.upper(buf)); rt.put_c(' ');
+	rt.put_s(buf); rt.put_c(10);
+	std.Text.copy(buf, "  \t padded line \r\n");
+	rt.put_n(std.Text.trim(buf)); rt.put_c(' ');
+	rt.put_c('['); rt.put_s(buf); rt.put_c(']'); rt.put_c(10);
+	rt.put_n(std.Num.abs(0 - 42)); rt.put_c(' ');
+	rt.put_n(std.Num.min(3, 9)); rt.put_c(' ');
+	rt.put_n(std.Num.max(3, 9)); rt.put_c(' ');
+	rt.put_n(std.Num.clamp(50, 0, 10)); rt.put_c(' ');
+	rt.put_n(std.Num.gcd(0 - 84, 36)); rt.put_c(' ');
+	rt.put_n(std.Num.pow(3, 4)); rt.put_c(' ');
+	rt.put_n(std.Num.isqrt(99)); rt.put_c(' ');
+	rt.put_n(std.Num.isqrt(100)); rt.put_c(' ');
+	rt.put_n(std.Num.sign(0 - 5)); rt.put_c(' ');
+	rt.put_n(std.Num.sign(0)); rt.put_c(10);
+	rt.put_n(std.Bytes.len(b"packed")); rt.put_c(' ');
+	rt.put_n(std.Bytes.eq(b"abc", b"abc")); rt.put_c(' ');
+	rt.put_n(std.Bytes.find(b"needle", b"ed")); rt.put_c(' ');
+	rt.put_n(std.Bytes.find(b"abc", b"z")); rt.put_c(' ');
+	rt.put_n(std.Bytes.ends(b"packed", b"ed")); rt.put_c(' ');
+	rt.put_n(std.Bytes.ends(b"a", b"abc")); rt.put_c(10);
 	return 0;
 }