nomen-lang 0.5.0 → 0.6.0

package/core/System/Stream/Tcp.nm

@@ -26,11 +26,11 @@
 /**
  * A non-blocking TCP socket whose waits park the calling fiber
  **/
-pub class Tcp : Sendable {
+pub class Tcp: Sendable {
 	// The underlying file descriptor, -1 when closed/failed.
 	pub var int fd = -1
 	// 0 = ok; 1 = DNS, 2 = socket, 3 = connect, 4 = listen, 5 = closed.
-	pub var int error = 0
+	pub var error = 0
 
 	pub func #init = (self, int handle) {
 		self.fd = handle
@@ -66,7 +66,7 @@ pub class Tcp : Sendable {
 	// Create a listening socket bound to `port` on all interfaces.
 	pub func listen = (int port, int backlog, move out Tcp) {
 		var int handle = Tcp.listen_fd(port, backlog)
-		var Tcp t = Tcp(handle)
+		var t = Tcp(handle)
 		if handle < 0 {
 			t.error = 4
 		}
@@ -78,7 +78,7 @@ pub class Tcp : Sendable {
 	// failed.
 	pub func accept = (ref self, move out Tcp) {
 		var int handle = Tcp.accept_fd(self.fd)
-		var Tcp t = Tcp(handle)
+		var t = Tcp(handle)
 		if handle < 0 {
 			t.error = 5
 		}
@@ -91,14 +91,14 @@ pub class Tcp : Sendable {
 	pub func connect = (string host, int port, move out Tcp) {
 		var int handle = Tcp.socket_fd()
 		if handle < 0 {
-			var Tcp bad = Tcp(-1)
+			var bad = Tcp(-1)
 			bad.error = 2
 			return bad
 		}
 		var int err = Tcp.connect_to(handle, host, port)
 		if err != 0 {
 			Tcp.close_fd(handle)
-			var Tcp bad = Tcp(-1)
+			var bad = Tcp(-1)
 			bad.error = err
 			return bad
 		}

package/core/System/String.nm

@@ -248,7 +248,7 @@ pub struct string: Stringable, Hashable, Equatable {
 	// are only ever read.
 	pub func replace_first = (self, view string needle, view string replacement, out string) {
 		var sb = StringBuilder()
-		var int i = 0
+		var i = 0
 		var int n = self.length
 		var int nlen = needle.length
 		var bool replaced = nlen == 0
@@ -269,7 +269,7 @@ pub struct string: Stringable, Hashable, Equatable {
 	// left to right. Same edge behavior as replace_first.
 	pub func replace_all = (self, view string needle, view string replacement, out string) {
 		var sb = StringBuilder()
-		var int i = 0
+		var i = 0
 		var int n = self.length
 		var int nlen = needle.length
 		while i < n {
@@ -391,7 +391,7 @@ pub struct string: Stringable, Hashable, Equatable {
 	// Owned copy of self with leading and trailing ASCII whitespace
 	// (tab, LF, VT, FF, CR, space) removed. All-whitespace yields "".
 	pub func trim = (self, out string) {
-		var int start = 0
+		var start = 0
 		while start < self.length; start += 1 {
 			if !self.at(start).is_ascii_space() {
 				break
@@ -421,7 +421,7 @@ pub struct string: Stringable, Hashable, Equatable {
 
 	// Owned copy of self with leading ASCII whitespace removed.
 	pub func trim_start = (self, out string) {
-		var int start = 0
+		var start = 0
 		while start < self.length; start += 1 {
 			if !self.at(start).is_ascii_space() {
 				break
@@ -435,7 +435,7 @@ pub struct string: Stringable, Hashable, Equatable {
 	// bytes — including UTF-8 sequences — pass through unchanged).
 	pub func to_lowercase = (self, out string) {
 		var sb = StringBuilder()
-		var int i = 0
+		var i = 0
 		while i < self.length; i += 1 {
 			var int code = self.at(i) as int
 			if code > 64 && code < 91 {
@@ -450,7 +450,7 @@ pub struct string: Stringable, Hashable, Equatable {
 	// bytes — including UTF-8 sequences — pass through unchanged).
 	pub func to_uppercase = (self, out string) {
 		var sb = StringBuilder()
-		var int i = 0
+		var i = 0
 		while i < self.length; i += 1 {
 			var int code = self.at(i) as int
 			if code > 96 && code < 123 {
@@ -465,7 +465,7 @@ pub struct string: Stringable, Hashable, Equatable {
 // needle matches text at byte offset pos (caller guarantees pos + len fits;
 // the trailing guard makes the bound explicit so `.at` verifies).
 func match_at = (view string text, view string needle, int pos, out bool) {
-	var int i = 0
+	var i = 0
 	var int nlen = needle.length
 	var int n = text.length
 	while i < nlen && pos + i < n {

package/core/System/StringBuilder.nm

@@ -24,7 +24,7 @@ pub struct StringBuilder {
 		if new_cap == 0 {
 			new_cap = 16
 		}
-		while new_cap < needed; new_cap *= 2 {}
+		while new_cap < needed; new_cap *= 2 { }
 		self.data = realloc(self.data, new_cap)
 		self.cap = new_cap
 	}

package/core/System/Task.nm

@@ -24,6 +24,14 @@ pub class Task<T> : Sendable, Awaitable {
 	pub var uint64 cancel_flag = 0
 	pub var uint64 future = 0
 
+	// INTERNAL (library-only): constructs a zeroed handle. `Thread.start` /
+	// `Fiber.start` build the Task they return through this — a user can
+	// wait/result/cancel a handle, but never constructs a bare one (it would
+	// reference no task at all). The auto-free pass reclaims the returned
+	// handle via #destroy, exactly like a spawn-yielded Task.
+	internal #init = () {
+	}
+
 	// 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).
@@ -160,6 +168,24 @@ pub class Task<T> : Sendable, Awaitable {
 		```
 	}
 
+	// Has the task finished? A poll — never blocks. True once the task's
+	// future has completed; false while it may still be running (and for a
+	// handle whose machinery was already consumed). The missing peek
+	// between wait (blocking) and cancel (cooperative): event loops use it
+	// to notice a finished task without parking the UI thread.
+	pub func is_done = (ref self, out bool) {
+		```
+		#arch: c
+		return __nomen_future_is_done((struct nomen_future *)self->future);
+		```
+		```
+		#arch: aarch64
+		// x0 = self->future; result in x0.
+		ldr x0, [x19, #40]
+		bl ___nomen_future_is_done
+		```
+	}
+
 	// Request that the task stop. Cooperative — the task observes this via
 	// `Task.current_cancelled()` at its own checkpoints. No preemption.
 	pub func cancel = (ref self) {
@@ -354,14 +380,18 @@ pub class Task<T> : Sendable, Awaitable {
 		```
 		#arch: c
 		if (self->future) {
-		#if T_NEEDS_STRDUP
-			// T is the fat nomen_string here (the guard is 0 for every other
-			// T, and the preprocessor removes this region before parsing).
-			if (self->result_slot) {
-				T _s = *(T *)self->result_slot;
-				if (_s.ptr) free(_s.ptr);
-			}
-		#endif
+	#if T_NEEDS_STRDUP
+		// T is the fat nomen_string here (the guard is 0 for every other
+		// T, and the preprocessor removes this region before parsing).
+		if (self->result_slot) {
+			T _s = *(T *)self->result_slot;
+			if (_s.ptr) free(_s.ptr);
+			// Zero the cell: the future's last release also frees an
+			// unconsumed fat result, keyed on a non-NULL ptr (see
+			// __nomen_future_release) — this free must be the only one.
+			memset((void *)self->result_slot, 0, sizeof(T));
+		}
+	#endif
 			__nomen_future_release((struct nomen_future *)self->future);
 			self->future = 0;
 			self->result_slot = 0;
@@ -383,6 +413,10 @@ pub class Task<T> : Sendable, Awaitable {
 		cbz x8, .Ldestroy_nofree
 		ldr x0, [x8]
 		cbz x0, .Ldestroy_nofree
+		// Mark consumed BEFORE the free (x8 is caller-saved and dead after
+		// the call): the future's last release also frees an unconsumed
+		// fat result, keyed on a non-NULL cell (see __nomen_future_release).
+		stp xzr, xzr, [x8]
 		bl _free
 		.Ldestroy_nofree:
 		ldr x0, [x19, #40]

package/core/System/Test.nm

@@ -48,17 +48,17 @@
  **/
 pub class Tester {
 	// Has the *current* test recorded a failure? Reset by `begin_test`.
-	pub var bool has_failed = false
+	pub var has_failed = false
 
 	// Assertion tallies for the current test.
-	var int passed = 0
-	var int failed = 0
+	var passed = 0
+	var failed = 0
 
 	// Tallies for the whole file, so `done` records stay per-test while the
 	// process still knows whether anything failed overall.
-	var int total_failed = 0
+	var total_failed = 0
 
-	var string current = ""
+	var current = ""
 	var uint64 started = 0
 
 	// Benchmark capture state. `bench`/`bench_n` record the label and sample
@@ -66,9 +66,9 @@ pub class Tester {
 	// function and drives the actual timing loop (Nomen can't store or call a
 	// function pointer, so the harness measures `bench_fn` itself). `bench_fn`
 	// is reconstructed by the harness from the call site, not stored here.
-	var bool bench_pending = false
-	var string bench_label = ""
-	var int bench_samples = 1000
+	var bench_pending = false
+	var bench_label = ""
+	var bench_samples = 1000
 
 	// (harness) Start timing `name` and clear the per-test state. Called by
 	// the `main` that `nomen test` generates — not by test code.
@@ -188,7 +188,7 @@ pub class Tester {
 	 * (default 1000, override with `bench_n`) and computes min / median /
 	 * mean / max / stddev over the per-iteration durations.
 	 **/
-	pub func bench = (ref self, string label, func () body) {
+	pub func bench = (ref self, string label, func() body) {
 		if self.has_failed {
 			return
 		}
@@ -202,7 +202,7 @@ pub class Tester {
 	 * for slow functions (where the default 1000 would dominate the suite) or
 	 * for reproducible sample counts.
 	 **/
-	pub func bench_n = (ref self, string label, func () body, int samples) {
+	pub func bench_n = (ref self, string label, func() body, int samples) {
 		if self.has_failed {
 			return
 		}
@@ -219,7 +219,16 @@ pub class Tester {
 	 * If a test has already recorded a failure, benchmarks are skipped and
 	 * this is a no-op.
 	 **/
-	pub func record_bench = (ref self, string label, int n, int min, int median, int max, float mean, float stddev) {
+	pub func record_bench = (
+		ref self,
+		string label,
+		int n,
+		int min,
+		int median,
+		int max,
+		float mean,
+		float stddev
+	) {
 		if self.has_failed {
 			return
 		}

package/core/System/Text/CharIndex.nm

@@ -22,18 +22,18 @@ pub struct CharRun {
  **/
 pub struct CharIndex {
 	var view string source
-	var List<CharRun> runs = List<CharRun>()
-	var int char_count = 0
+	var runs = List<CharRun>()
+	var char_count = 0
 
 	pub func #init = (self, view string source) {
 		self.source = source
-		var int pos = 0
+		var pos = 0
 		var int len = source.length
-		var int chars = 0
+		var chars = 0
 		var int open_at = -1
-		var int open_width = 0
-		var int open_start = 0
-		var int open_count = 0
+		var open_width = 0
+		var open_start = 0
+		var open_count = 0
 		while pos < len {
 			var int w = Utf8.width_at(source, pos)
 			switch {
@@ -122,7 +122,7 @@ pub struct CharIndex {
 	// Rightmost run whose key (char_start when by_char, else byte_index) is
 	// <= target, or -1 when all runs start after it.
 	func rightmost_run = (self, int target, bool by_char, out int) {
-		var int lo = 0
+		var lo = 0
 		var int hi = self.runs.length - 1
 		var int found = -1
 		while lo <= hi {

package/core/System/Text/Chars.nm

@@ -9,7 +9,7 @@
  **/
 pub struct Chars {
 	var view string source
-	var int byte_pos = 0
+	var byte_pos = 0
 
 	pub func #init = (self, view string source) {
 		self.source = source

package/core/System/Text/JsonTree.nm

@@ -23,7 +23,7 @@ struct JsonNode {
  * A flat, buffer-backed pool of JSON tree nodes — the parsed representation `Json.parse` produces
  **/
 pub struct JsonTree {
-	var Buffer<JsonNode> nodes = Buffer<JsonNode>()
+	var nodes = Buffer<JsonNode>()
 	var count = 0
 
 	func alloc_node = (ref self, out int) {

package/core/System/Text/Regex.nm

@@ -65,7 +65,12 @@ pub struct Regex {
 	// group that did not participate in the match) and return true. Return
 	// false with `out` untouched when nothing matches. A group that repeats
 	// (`(a)+`) reports its LAST iteration.
-	pub func captures = (string pattern, string input, ref List<string> dst, out bool) {		var int pat_len = pattern.length
+	pub func captures = (
+		string pattern,
+		string input,
+		ref List<string> dst,
+		out bool
+	) { var int pat_len = pattern.length
 		var int len = input.length
 		var string charset = first_byte_set(pattern, pat_len)
 		var int clen = charset.length
@@ -83,7 +88,7 @@ pub struct Regex {
 			if end >= 0 {
 				var string whole = input.substring(i, end)
 				dst.push(whole)
-				var int g = 1
+				var g = 1
 				while g <= groups; g += 1 {
 					var int at = last_capture_index(caps, g)
 					if at >= 0 {
@@ -166,7 +171,12 @@ pub struct Regex {
 	}
 
 	// Replace all non-overlapping occurrences of pattern in input with replacement.
-	pub func replace_all = (string pattern, string input, string replacement, out string) {		var sb = StringBuilder()
+	pub func replace_all = (
+		string pattern,
+		string input,
+		string replacement,
+		out string
+	) { var sb = StringBuilder()
 		var int pat_len = pattern.length
 		var int len = input.length
 		var string charset = first_byte_set(pattern, pat_len)
@@ -241,7 +251,7 @@ pub struct Regex {
 func fold_pattern = (string pattern, move out string) {
 	var int n = pattern.length
 	var sb = StringBuilder()
-	var int i = 0
+	var i = 0
 	while i < n; i += 1 {
 		var char c = pattern.at(i)
 		if (c as int) == 92 {
@@ -412,7 +422,13 @@ func first_byte_set = (string pattern, int pat_len, out string) {
 // byte(s) of each alternative to sb. Alternations at depth 0 are split on '|'.
 // Returns -1 when any alternative's first-byte set can't be determined (the
 // caller must then disable the prefilter), 0 otherwise.
-func collect_first_bytes = (string pattern, int pat_pos, int pat_end, ref StringBuilder sb, out int) {
+func collect_first_bytes = (
+	string pattern,
+	int pat_pos,
+	int pat_end,
+	ref StringBuilder sb,
+	out int
+) {
 	var depth = 0
 	var int i = pat_pos
 	var int alt_start = pat_pos
@@ -506,7 +522,7 @@ func alt_first_bytes = (string pattern, int start, int end, ref StringBuilder sb
 			// can also come from whatever follows it. A second '?' marks the
 			// quantifier lazy and is skipped either way.
 			var int after = a_end
-			var int nullable = 0
+			var nullable = 0
 			if after < end {
 				var char q = pattern.at(after)
 				if q == '?' || q == '*' {
@@ -568,7 +584,7 @@ func add_class_chars = (string pattern, int start, int end, ref StringBuilder sb
 			}
 		} else {
 			sb.append_char(pattern.at(i))
-				i += 1
+			i += 1
 		}
 	}
 }
@@ -613,7 +629,15 @@ func match_here = (
 				}
 				if (c as int) == 124 {
 					if depth == 0 {
-						var int left = match_here(pattern, pat_pos, i, input, in_pos, in_len, ref caps)
+						var int left = match_here(
+							pattern,
+							pat_pos,
+							i,
+							input,
+							in_pos,
+							in_len,
+							ref caps,
+						)
 						if left >= 0 {
 							return left
 						}
@@ -655,7 +679,7 @@ func match_here = (
 	if a_end < pat_end {
 		var char q = pattern.at(a_end)
 		if q == '*' || q == '+' || q == '?' {
-			var int lazy = 0
+			var lazy = 0
 			var int rest = a_end + 1
 			if rest < pat_end {
 				if pattern.at(rest) == '?' {
@@ -664,12 +688,47 @@ func match_here = (
 				}
 			}
 			if q == '*' {
-				return match_star(pattern, pat_pos, a_end, rest, pat_end, input, in_pos, 0, lazy, in_len, ref caps)
+				return match_star(
+					pattern,
+					pat_pos,
+					a_end,
+					rest,
+					pat_end,
+					input,
+					in_pos,
+					0,
+					lazy,
+					in_len,
+					ref caps,
+				)
 			}
 			if q == '+' {
-				return match_star(pattern, pat_pos, a_end, rest, pat_end, input, in_pos, 1, lazy, in_len, ref caps)
+				return match_star(
+					pattern,
+					pat_pos,
+					a_end,
+					rest,
+					pat_end,
+					input,
+					in_pos,
+					1,
+					lazy,
+					in_len,
+					ref caps,
+				)
 			}
-			return match_optional(pattern, pat_pos, a_end, rest, pat_end, input, in_pos, lazy, in_len, ref caps)
+			return match_optional(
+				pattern,
+				pat_pos,
+				a_end,
+				rest,
+				pat_end,
+				input,
+				in_pos,
+				lazy,
+				in_len,
+				ref caps,
+			)
 		}
 	}
 
@@ -768,7 +827,15 @@ func match_single_atom = (
 			old_start = caps.at(at + 1)
 			old_end = caps.at(at + 2)
 		}
-		var int next = match_here(pattern, atom_start + 1, atom_end - 1, input, in_pos, in_len, ref caps)
+		var int next = match_here(
+			pattern,
+			atom_start + 1,
+			atom_end - 1,
+			input,
+			in_pos,
+			in_len,
+			ref caps,
+		)
 		if next >= 0 {
 			record_capture(ref caps, g, in_pos, next)
 			return next
@@ -958,7 +1025,15 @@ func match_star_group = (
 				return stop
 			}
 		}
-		var int next = match_single_atom(pattern, atom_start, atom_end, input, in_pos, in_len, ref caps)
+		var int next = match_single_atom(
+			pattern,
+			atom_start,
+			atom_end,
+			input,
+			in_pos,
+			in_len,
+			ref caps,
+		)
 		if next >= 0 {
 			if next != in_pos {
 				var new_min = 0
@@ -1035,7 +1110,15 @@ func match_optional = (
 		if skip >= 0 {
 			return skip
 		}
-		var int next = match_single_atom(pattern, atom_start, atom_end, input, in_pos, in_len, ref caps)
+		var int next = match_single_atom(
+			pattern,
+			atom_start,
+			atom_end,
+			input,
+			in_pos,
+			in_len,
+			ref caps,
+		)
 		if next >= 0 {
 			return match_here(pattern, rest, pat_end, input, next, in_len, ref caps)
 		}
@@ -1136,8 +1219,8 @@ func char_in_class = (
 // groups).
 func capture_count = (string pattern, out int) {
 	var int n = pattern.length
-	var int count = 0
-	var int i = 0
+	var count = 0
+	var i = 0
 	while i < n; i += 1 {
 		var char c = pattern.at(i)
 		if (c as int) == 92 {
@@ -1159,8 +1242,8 @@ func capture_count = (string pattern, out int) {
 // open_pos: one more than the number of capture opens before it in the
 // pattern (the whole match is group 0).
 func group_index_at = (string pattern, int open_pos, out int) {
-	var int count = 0
-	var int i = 0
+	var count = 0
+	var i = 0
 	while i < open_pos; i += 1 {
 		var char c = pattern.at(i)
 		if (c as int) == 92 {
@@ -1198,7 +1281,7 @@ func record_capture = (ref List<int> caps, int group, int start, int end) {
 // has no entry. Entries are (group, start, end) triples.
 func last_capture_index = (List<int> caps, int group, out int) {
 	var int best = -1
-	var int i = 0
+	var i = 0
 	while i < caps.length; i += 3 {
 		if caps.at(i) == group {
 			best = i
@@ -1211,11 +1294,11 @@ 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 {
-	var bool found = false
-	var int start = 0
-	var int end = 0
-	var int length = 0
-	var string text = ""
+	var found = false
+	var start = 0
+	var end = 0
+	var length = 0
+	var text = ""
 }
 
 // Whether the escaped character c (the byte after a backslash) is a
@@ -1233,7 +1316,14 @@ func backref_group = (char c, out int) {
 // Match the text capture group `group` last matched, at in_pos. Returns the
 // position after the span, or -1 when the group has no span here (it did not
 // participate) or the text differs.
-func match_backref = (string input, int group, int in_pos, int in_len, ref List<int> caps, out int) {
+func match_backref = (
+	string input,
+	int group,
+	int in_pos,
+	int in_len,
+	ref List<int> caps,
+	out int
+) {
 	var int at = last_capture_index(caps, group)
 	if at < 0 {
 		return -1
@@ -1246,7 +1336,7 @@ func match_backref = (string input, int group, int in_pos, int in_len, ref List<
 	if in_pos + len > in_len {
 		return -1
 	}
-	var int i = 0
+	var i = 0
 	while i < len; i += 1 {
 		if input.at(in_pos + i) != input.at(s + i) {
 			return -1
@@ -1372,22 +1462,22 @@ func shorthand_members = (char c, ref StringBuilder sb, out int) {
 		return -1
 	}
 	if kind == 100 {
-		var int code = 48
+		var code = 48
 		while code <= 57; code += 1 {
 			sb.append_char(code as char)
 		}
 		return 0
 	}
 	if kind == 119 {
-		var int code = 48
+		var code = 48
 		while code <= 57; code += 1 {
 			sb.append_char(code as char)
 		}
-		var int upper = 65
+		var upper = 65
 		while upper <= 90; upper += 1 {
 			sb.append_char(upper as char)
 		}
-		var int lower = 97
+		var lower = 97
 		while lower <= 122; lower += 1 {
 			sb.append_char(lower as char)
 		}
@@ -1395,7 +1485,7 @@ func shorthand_members = (char c, ref StringBuilder sb, out int) {
 		return 0
 	}
 	// \s: tab, LF, VT, FF, CR, space
-	var int w = 9
+	var w = 9
 	while w <= 13; w += 1 {
 		sb.append_char(w as char)
 	}

package/core/System/Text/Utf8.nm

@@ -45,8 +45,8 @@ pub struct Utf8 {
 		if b0 < 0xF0 {
 			// E0 forbids second bytes below A0 (overlong); ED forbids
 			// AA-BF (surrogate halves).
-			var int lo = 0x80
-			var int hi = 0xBF
+			var lo = 0x80
+			var hi = 0xBF
 			if b0 == 0xE0 {
 				lo = 0xA0
 			}
@@ -68,8 +68,8 @@ pub struct Utf8 {
 		}
 		// F0 forbids second bytes below 90 (overlong); F4 forbids above 8F
 		// (past U+10FFFF).
-		var int lo = 0x80
-		var int hi = 0xBF
+		var lo = 0x80
+		var hi = 0xBF
 		if b0 == 0xF0 {
 			lo = 0x90
 		}
@@ -138,8 +138,8 @@ pub struct Utf8 {
 	// Count the code points in text (one pass; malformed bytes each count
 	// as one U+FFFD).
 	pub func char_count = (view string text, out int) {
-		var int n = 0
-		var int pos = 0
+		var n = 0
+		var pos = 0
 		var int len = text.length
 		while pos < len {
 			pos = pos + Utf8.width_at(text, pos)