nomen-lang 0.6.12 → 0.7.0

package/core/System/Task.nm

@@ -11,13 +11,18 @@
 // on the first spawn — not in Task's own methods — so that Task can be
 // generic without duplicating the pool per instantiation.
 //
+// Task is an OWNING STRUCT (STRUCT_PLAN_3 Phase R, tranche 2 — the shape
+// menu): every field is an opaque handle (uint64/bool), so the handle value
+// is movable and its `#destroy` releases the future reference it holds.
+// Moving a Task transfers that reference; there is no aliasing copy.
+//
 // See ASYNC.md for the design.
 
 /**
  * A handle to an asynchronously-running computation, backed by a shared thread pool.
  * Conforms to `Awaitable`: `.wait()` may park the current execution context.
  **/
-pub class Task<T> : Sendable, Awaitable {
+pub mv struct Task<T> : Awaitable {
 	pub var uint64 handle = 0
 	pub var done = false
 	pub var uint64 result_slot = 0
@@ -35,40 +40,27 @@ pub class Task<T> : Sendable, Awaitable {
 	// Block until the task finishes. Idempotent — calling twice is safe, and
 	// a Task captured from a nursery spawn can be waited on here AND joined
 	// by the nursery at block exit (both wait on the same shared future).
-	pub func wait = (ref self) {
+	//
+	// The receiver is a bare VALUE self (matching the Awaitable trait):
+	// waiting never mutates the handle — it parks on the future the handle
+	// names. Struct receivers travel by address regardless (the raw body
+	// reads `self->future`), so the ABI is unchanged; the bare spelling is
+	// what lets the read-only `Awaitable` dispatch form typecheck.
+	// The legacy `pthread_join` fallback is gone — `handle` has been
+	// permanently zero since the pool migration.
+	pub func wait = (self) {
 		```
 		#arch: c
 		if (self->future) {
 			__nomen_future_wait((struct nomen_future *)self->future);
-		} else if (self->handle && !self->done) {
-			void *ret;
-			pthread_join((pthread_t)self->handle, &ret);
-			self->handle = 0;
-			self->done = 1;
 		}
 		```
 		```
 		#arch: aarch64
-		// if (self->future) goto wait_future
+		// if (self->future) __nomen_future_wait(self->future)
 		ldr x0, [x19, #40]
-		cbz x0, .Lwait_handle
-		bl ___nomen_future_wait
-		b .Lwait_done
-		.Lwait_handle:
-		// else if (self->handle && !self->done)
-		ldr x0, [x19, #8]
 		cbz x0, .Lwait_done
-		ldrb w1, [x19, #16]
-		cbnz w1, .Lwait_done
-		// pthread_join((pthread_t)self->handle, &ret)
-		sub sp, sp, #16
-		mov x1, sp
-		bl _pthread_join
-		add sp, sp, #16
-		// self->handle = 0; self->done = 1
-		str xzr, [x19, #8]
-		mov w0, #1
-		strb w0, [x19, #16]
+		bl ___nomen_future_wait
 		.Lwait_done:
 		```
 	}
@@ -78,10 +70,10 @@ pub class Task<T> : Sendable, Awaitable {
 	// the full return value — including the 16-byte fat-string pair — and the
 	// trampoline writes the function's return value there before exiting.
 	// The result is MOVED OUT: the slot is zeroed as the value leaves, and
-	// `move out T` marks the caller as the owner. Call it once; a second call
+	// `mv out T` marks the caller as the owner. Call it once; a second call
 	// returns the zero value. For tasks with no return value (void
 	// functions), returns the zero value.
-	pub func result = (ref self, move out T) {
+	pub func result = (ref self, mv out T) {
 		```
 		#arch: c
 		if (self->future) {
@@ -284,7 +276,7 @@ pub class Task<T> : Sendable, Awaitable {
 	// ---- User-defined async primitive seam (ASYNC.md, "User-defined async
 	// primitives") ----
 	// The construction sugar stores the packed-task machinery in a user
-	// class's plain uint64 fields (task / result_slot / cancel_flag /
+	// spawnable's plain uint64 fields (task / result_slot / cancel_flag /
 	// future); these statics are the library boundary its own launch
 	// methods drive the runtime through — the same calls the generated
 	// Thread/Fiber launch code makes, so a user primitive parks fibers,
@@ -294,7 +286,7 @@ pub class Task<T> : Sendable, Awaitable {
 
 	// Submit a packed task closure (the `task` field's value) to the shared
 	// worker pool. The closure must come from a construction of an
-	// Awaitable-conforming class — it is not callable.
+	// Awaitable-conforming spawnable — it is not callable.
 	pub func pool_submit = (uint64 closure) {
 		```
 		#arch: c

package/core/System/Test.nm

@@ -32,6 +32,12 @@
 //
 // See TESTING.md for the full design.
 
+// Tester is an OWNING STRUCT (STRUCT_PLAN_3 Phase R, tranche 3 — the shape
+// menu): the harness builds exactly one per run, so the single-owner rule
+// costs nothing and the record state moves with the value. The string
+// fields (current/bench_label) are normalized heap-owned by the compiler's
+// struct string machinery, so `#destroy` reclaims them cleanly.
+
 /**
  * Records assertions and benchmarks for one test file.
  *
@@ -47,7 +53,7 @@
  * skipped, so a single root cause reports as a single failure. Check
  * `t.has_failed` to bail out of expensive follow-up work yourself.
  **/
-pub class Tester {
+pub mv struct Tester {
 	// Has the *current* test recorded a failure? Reset by `begin_test`.
 	pub var has_failed = false
 
@@ -94,7 +100,7 @@ pub class Tester {
 		self.has_failed = false
 		self.passed = 0
 		self.failed = 0
-		self.current = name
+		self.current = name.copy()
 		Console.write_line("\\nomen|start|" + name)
 		self.started = Time.now_ns()
 	}
@@ -211,7 +217,7 @@ pub class Tester {
 			return
 		}
 		self.bench_pending = true
-		self.bench_label = label
+		self.bench_label = label.copy()
 		self.bench_samples = 1000
 	}
 
@@ -225,7 +231,7 @@ pub class Tester {
 			return
 		}
 		self.bench_pending = true
-		self.bench_label = label
+		self.bench_label = label.copy()
 		self.bench_samples = samples
 	}
 

package/core/System/Text/CharIndex.nm

@@ -20,7 +20,7 @@ pub struct CharRun {
  * A run-length character-width index (construct with `CharIndex(text)`,
  * then `byte_offset_of` / `char_index_of` / `char_at` in O(log runs))
  **/
-pub struct CharIndex {
+pub mv struct CharIndex {
 	var view string source
 	var runs = List<CharRun>()
 	var char_count = 0
@@ -50,7 +50,7 @@ pub struct CharIndex {
 					pos = pos + w
 					chars = chars + 1
 				}
-				else {
+			} else {
 					if open_at >= 0 {
 						self.runs.push(CharRun(open_at, open_start, open_width, open_count))
 					}
@@ -61,7 +61,6 @@ pub struct CharIndex {
 					pos = pos + w
 					chars = chars + 1
 				}
-			}
 		}
 		if open_at >= 0 {
 			self.runs.push(CharRun(open_at, open_start, open_width, open_count))

package/core/System/Text/Json.nm

@@ -14,9 +14,9 @@
  **/
 pub struct Json {
 	// Serialize a string to a JSON string literal, escaping the special
-	// characters ", \, newline, tab and carriage return. `move out string`:
+	// characters ", \, newline, tab and carriage return. `mv out string`:
 	// returns the StringBuilder's owned heap copy.
-	pub func serialize = (string value, move out string) {
+	pub func serialize = (string value, mv out string) {
 		var sb = StringBuilder()
 		sb.append_char('"')
 		var i = 0
@@ -40,18 +40,17 @@ pub struct Json {
 				case code == 13 {
 					sb.append_string("\x5cr")
 				}
-				else {
+			} else {
 					sb.append_char(c)
 				}
-			}
 		}
 		sb.append_char('"')
 		return sb.to_string()
 	}
 
 	// Deserialize a JSON string literal to the raw, unescaped value.
-	// `move out string`: returns the StringBuilder's owned heap copy.
-	pub func deserialize = (string json, move out string) {
+	// `mv out string`: returns the StringBuilder's owned heap copy.
+	pub func deserialize = (string json, mv out string) {
 		var sb = StringBuilder()
 		var int len = json.length
 		var i = 0
@@ -90,10 +89,9 @@ pub struct Json {
 						case ec == 92 {
 							sb.append_string("\x5c")
 						}
-						else {
+					} else {
 							sb.append_char(e)
 						}
-					}
 				}
 			} else {
 				sb.append_char(c)
@@ -165,10 +163,9 @@ func json_parse_string = (string s, ref Buffer<int> pos, int len, ref JsonTree t
 					case ec == 92 {
 						sb.append_string("\x5c")
 					}
-					else {
+				} else {
 						sb.append_char(e)
 					}
-				}
 			}
 		} else {
 			sb.append_char(c)
@@ -218,11 +215,10 @@ func json_parse_literal = (string s, ref Buffer<int> pos, int len, ref JsonTree
 			tree.set_kind(n, 6)
 			adv = 5
 		}
-		else {
+	} else {
 			tree.set_kind(n, 0)
 			adv = 4
 		}
-	}
 	pos.store_int(0, i + adv)
 	return n
 }

package/core/System/Text/JsonTree.nm

@@ -11,7 +11,7 @@
 // A node in a parsed JSON tree, stored by value in the pool.
 //   kind: 0=null, 1=true, 2=number, 3=string, 4=array, 5=object, 6=false
 //   child/next/val are node indices, -1 = none.
-struct JsonNode {
+mv struct JsonNode {
 	var kind = 0
 	var text = ""
 	var int child = -1
@@ -22,7 +22,7 @@ struct JsonNode {
 /**
  * A flat, buffer-backed pool of JSON tree nodes — the parsed representation `Json.parse` produces
  **/
-pub struct JsonTree {
+pub mv struct JsonTree {
 	var nodes = Buffer<JsonNode>()
 	var count = 0
 
@@ -32,7 +32,7 @@ pub struct JsonTree {
 		self.count = idx + 1
 		var default = JsonNode()
 		self.nodes.store(idx, default)
-		// store_T deep-copies the owning `text` field (strdup of the shared
+		// store_T deep-copies the mv `text` field (strdup of the shared
 		// empty-string literal) into the slot. JsonTree manages node texts
 		// manually (set_text strdup's into the slab; free_text/release frees
 		// them; NULL means "no text"), so the slot must start NULL — free the
@@ -136,7 +136,7 @@ pub struct JsonTree {
 
 	func get_text = (self, int idx, out string) {
 		var JsonNode n = self.nodes.load(idx)
-		return n.text
+		return n.text.copy()
 	}
 
 	func get_child = (self, int idx, out int) {

package/core/System/Text/Regex.nm

@@ -33,9 +33,9 @@ pub struct Regex {
 	}
 
 	// Return the first substring of input matching pattern, or "" if none.
-	// `move out string`: the built match (or the copied empty literal) is
+	// `mv out string`: the built match (or the copied empty literal) is
 	// handed to the caller as an owned value.
-	pub func match = (string pattern, string input, move out string) {
+	pub func match = (string pattern, string input, mv out string) {
 		var match_result = ""
 		var int pat_len = pattern.length
 		var int len = input.length
@@ -89,7 +89,7 @@ pub struct Regex {
 			var int end = match_here(pattern, 0, pat_len, input, i, len, ref caps)
 			if end >= 0 {
 				var string whole = input.substring(i, end)
-				dst.push(whole)
+				dst.push(mv whole)
 				var g = 1
 				while g <= groups; g += 1 {
 					var int at = last_capture_index(caps, g)
@@ -97,7 +97,7 @@ pub struct Regex {
 						var int s = caps.at(at + 1)
 						if s >= 0 {
 							var string cap = input.substring(s, caps.at(at + 2))
-							dst.push(cap)
+							dst.push(mv cap)
 						} else {
 							dst.push("")
 						}
@@ -221,7 +221,7 @@ pub struct Regex {
 	}
 
 	// First match of pattern in input, ignoring ASCII case ("" if none).
-	pub func match_ci = (string pattern, string input, move out string) {
+	pub func match_ci = (string pattern, string input, mv out string) {
 		var string folded = fold_pattern(pattern)
 		return Regex.match(folded, input)
 	}
@@ -250,7 +250,7 @@ pub struct Regex {
 // their case counterparts ([a-z] -> [a-zA-Z]). Structural syntax — groups,
 // alternation, quantifiers, anchors, escaped punctuation — is copied
 // through unchanged.
-func fold_pattern = (string pattern, move out string) {
+func fold_pattern = (string pattern, mv out string) {
 	var int n = pattern.length
 	var sb = StringBuilder()
 	var i = 0
@@ -1925,7 +1925,7 @@ func last_capture_index = (List<int> caps, int group, out int) {
 /**
  * A Regex.find result: whether the pattern matched, where, and what
  **/
-pub struct RegexMatch {
+pub mv struct RegexMatch {
 	var found = false
 	var start = 0
 	var end = 0

package/core/System/Text/Utf8.nm

@@ -103,7 +103,7 @@ pub struct Utf8 {
 
 	// Encode a code point as UTF-8. Out-of-range values and surrogate halves
 	// encode as U+FFFD.
-	pub func encode = (int code_point, move out string) {
+	pub func encode = (int code_point, mv out string) {
 		var int code = code_point
 		if code < 0 || code > 0x10FFFF {
 			code = 0xFFFD
@@ -125,13 +125,12 @@ pub struct Utf8 {
 				sb.append_char(((0x80 | ((code >> 6) & 0x3F)) as char))
 				sb.append_char(((0x80 | (code & 0x3F)) as char))
 			}
-			else {
+		} else {
 				sb.append_char(((0xF0 | (code >> 18)) as char))
 				sb.append_char(((0x80 | ((code >> 12) & 0x3F)) as char))
 				sb.append_char(((0x80 | ((code >> 6) & 0x3F)) as char))
 				sb.append_char(((0x80 | (code & 0x3F)) as char))
 			}
-		}
 		return sb.to_string()
 	}
 

package/core/System/Thread.nm

@@ -30,6 +30,11 @@
 // (and nursery.start) transfer ownership of the packed task out of the
 // value, so a started Thread destroys as a no-op.
 //
+// Thread is an OWNING STRUCT (STRUCT_PLAN_3 Phase R, tranche 2 — the shape
+// menu): every field is an opaque handle (uint64/bool), so the value is
+// movable and its `#destroy` closes what the handles name. Moving a Thread
+// transfers the handles; there is no aliasing copy to misuse.
+//
 // See ASYNC.md for the design.
 
 // The launch surface's return type (ASYNC.md: the dependency is
@@ -39,11 +44,11 @@ import Task
 /**
  * A deferred function call, startable on the shared worker pool
  **/
-pub class Thread<T> : Sendable, Spawnable<T> {
-	// The construction hook (ASYNC.md): declares this class's
+pub mv struct Thread<T> : Spawnable<T> {
+	// The construction hook (ASYNC.md): declares this type's
 	// construction as the deferred-call special form — the single argument
 	// is a call (args packed eagerly, call deferred) or a zero-arg function
-	// value. The compiler matches this member, never the class name; the
+	// value. The compiler matches this member, never the type name; the
 	// construction itself is compiler-generated (pack the args, allocate the
 	// future machinery, build the instance), so the body is a declaration.
 	#spawn = () {
@@ -77,7 +82,7 @@ pub class Thread<T> : Sendable, Spawnable<T> {
 	// fields, so #destroy becomes a no-op afterwards. The future's refs
 	// account for the trampoline, the returned handle, and the nursery (when
 	// captured).
-	pub func start = (ref self, move out Task<T>) {
+	pub func start = (ref self, mv out Task<T>) {
 		```
 		#arch: c
 		struct nomen_future *_f = (struct nomen_future *)self->future;

package/core/System/Tree.nm

@@ -6,14 +6,14 @@
 /**
  * A tree of values connected by parent/child links
  **/
-pub struct Tree<T>: Enumerable {
+pub mv struct Tree<T>: Enumerable {
 	var values = Buffer<T>()
 	var lefts = Buffer<int>()
 	var rights = Buffer<int>()
 	var parents = Buffer<int>()
 	var count = 0
 
-	pub func add = (ref self, move T value) {
+	pub func add = (ref self, mv T value) {
 		const int idx = self.count
 		self.values.grow_int(idx + 1)
 		const int v = value

package/core/System/Viewable.nm

@@ -1,4 +1,4 @@
-// Marker trait for containers that can be borrowed as a non-owning `view T`
+// Marker trait for containers that can be borrowed as a non-mv `view T`
 // slice via a `slice(start, end, out view T)` method. Conforming types
 // implement slice — almost always by delegating to an internal Buffer's slice
 // (`return self.items.slice(start, end)`), so no #arch code is needed in user
@@ -21,7 +21,7 @@
 //   }
 
 /**
- * A trait for containers that can be borrowed as a non-owning `view T` slice
+ * A trait for containers that can be borrowed as a non-mv `view T` slice
  **/
 pub trait Viewable {
 }

package/core/System/WeakHandle.nm

@@ -0,0 +1,56 @@
+// WeakHandle<T> (STRUCT_PLAN_3 N3) — a checked back-pointer / OS-retained
+// handle. The residue of OS/AppKit retention and child→parent edges: a
+// handle to a registry slot, not a reference — no refcounts, no cycles.
+//
+//   var WeakHandle<Window> w = WeakHandle<Window>(window)
+//   ...
+//   var Window? live = w.get()   // nil check at the use site
+//
+// The CREATION is the marker (nothing aliases without one). The race is
+// inherently dynamic — the OS may have torn the object down — so the
+// runtime check in `get` is the only truthful one. The registry is ONE
+// process-wide (pointer, generation) slot table with a free list,
+// internally synchronized (handles are consulted from workers); the
+// tracked type's `#destroy` invalidates every slot holding the pointer
+// (generation bump), and a recycled slot never resets its generation, so a
+// stale handle can never alias a new object. Move-safe by construction: a
+// handle owns nothing.
+//
+// `T` must be a class (enforced at the construction site) — a weak handle
+// to a value-struct local would outlive the stack storage it names.
+//
+// `get` returns the instance pointer, NULL once the instance is gone —
+// bind it to a `T?` and nil-check at the use site.
+
+/**
+ * A checked, generation-validated handle to a possibly-gone object
+ **/
+pub struct WeakHandle<T> {
+	// The construction hook (the library-tier marker, beside #init and
+	// #destroy): `WeakHandle<T>(obj)` registers `obj` in the process-wide
+	// registry. The construction itself is compiler-generated (register the
+	// object, capture the slot's generation), so the body is a declaration.
+	#weak = () {
+	}
+
+	// The registry slot id and the generation captured at creation.
+	var uint64 id = 0
+	var uint64 gen = 0
+
+	// The checked read: the slot's live pointer, NULL when the instance was
+	// destroyed (or the slot was recycled). Bind to `T?` and nil-check.
+	// Offsets skip the leading `_vt` slot the auto-derived `to_string`
+	// (Stringable conformance) puts on every struct: id at +8, gen at +16.
+	pub func get = (self, out T) {
+		```
+		#arch: c
+		return __nomen_weak_get(self->id, self->gen);
+		```
+		```
+		#arch: aarch64
+		ldr x1, [x0, #16]
+		ldr x0, [x0, #8]
+		bl ___nomen_weak_get
+		```
+	}
+}

package/core/System/bool.nm

@@ -12,7 +12,7 @@ pub struct bool: Stringable, Hashable, Equatable {
 	 * @param self: the boolean
 	 * @out string: the boolean as a string value (`"true"` or `"false"`)
 	 **/
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%s", self ? "true" : "false");

package/core/System/char.nm

@@ -6,7 +6,7 @@ pub struct char: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%c", self);

package/core/System/float.nm

@@ -2,7 +2,7 @@
  * A double-precision (64-bit) floating-point number
  **/
 pub struct float: Stringable {
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%f", self);

package/core/System/float32.nm

@@ -2,7 +2,7 @@
  * A signed double-precision (64-bit) floating-point number
  **/
 pub struct float32: Stringable {
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%f", self);

package/core/System/float64.nm

@@ -2,7 +2,7 @@
  * A signed double-precision (64-bit) floating-point number
  **/
 pub struct float64: Stringable {
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%f", self);

package/core/System/int.nm

@@ -6,7 +6,7 @@ pub struct int: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%ld", self);

package/core/System/int16.nm

@@ -6,7 +6,7 @@ pub struct int16: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%d", self);

package/core/System/int32.nm

@@ -6,7 +6,7 @@ pub struct int32: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%d", self);

package/core/System/int64.nm

@@ -6,7 +6,7 @@ pub struct int64: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%lld", self);

package/core/System/int8.nm

@@ -6,7 +6,7 @@ pub struct int8: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%d", self);

package/core/System/ufloat.nm

@@ -2,7 +2,7 @@
  * An unsigned double-precision (64-bit) floating-point number
  **/
 pub struct ufloat: Stringable {
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%f", self);

package/core/System/ufloat32.nm

@@ -2,7 +2,7 @@
  * An unsigned double-precision (64-bit) floating-point number
  **/
 pub struct ufloat32: Stringable {
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%f", self);

package/core/System/ufloat64.nm

@@ -2,7 +2,7 @@
  * An unsigned double-precision (64-bit) floating-point number
  **/
 pub struct ufloat64: Stringable {
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%f", self);

package/core/System/uint.nm

@@ -6,7 +6,7 @@ pub struct uint: Stringable, Hashable, Equatable {
 		return self
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%ld", self);

package/core/System/uint16.nm

@@ -6,7 +6,7 @@ pub struct uint16: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%u", self);

package/core/System/uint32.nm

@@ -6,7 +6,7 @@ pub struct uint32: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%u", self);

package/core/System/uint64.nm

@@ -6,7 +6,7 @@ pub struct uint64: Stringable, Hashable, Equatable {
 		return self as uint
 	}
 
-	pub func to_string = (self, move out string) {
+	pub func to_string = (self, mv out string) {
 		```
 		#arch: c
 		int length = snprintf(NULL, 0, "%llu", self);