nomen-lang 0.9.0 → 0.11.0

package/core/System/Text/Regex.nm

@@ -69,7 +69,7 @@ pub struct Regex {
 	pub func captures = (
 		string pattern,
 		string input,
-		ref List<string> dst,
+		ref List<string> dst { items },
 		out bool
 	) { var int pat_len = pattern.length
 		var int len = input.length
@@ -117,7 +117,7 @@ pub struct Regex {
 	// first, so a reused RegexMatch carries nothing over. Scans every
 	// position: the first-byte prefilter would skip nullable patterns'
 	// empty matches at skipped positions, reporting a wrong .start.
-	pub func find = (string pattern, string input, ref RegexMatch dst) {
+	pub func find = (string pattern, string input, ref RegexMatch dst { text }) {
 		dst.found = false
 		dst.start = 0
 		dst.end = 0
@@ -232,13 +232,13 @@ pub struct Regex {
 	}
 
 	// find, ignoring ASCII case.
-	pub func find_ci = (string pattern, string input, ref RegexMatch dst) {
+	pub func find_ci = (string pattern, string input, ref RegexMatch dst { text }) {
 		var string folded = fold_pattern(pattern)
 		Regex.find(folded, input, ref dst)
 	}
 
 	// captures, ignoring ASCII case.
-	pub func captures_ci = (string pattern, string input, ref List<string> dst, out bool) {
+	pub func captures_ci = (string pattern, string input, ref List<string> dst { items }, out bool) {
 		var string folded = fold_pattern(pattern)
 		return Regex.captures(folded, input, ref dst)
 	}
@@ -308,7 +308,7 @@ func fold_pattern = (string pattern, mv out string) {
 
 // fold a character class [cs..ce): copy its contents, adding the case
 // counterpart of every letter member and mirroring letter ranges.
-func fold_class = (string pattern, int cs, int ce, ref StringBuilder dst) {
+func fold_class = (string pattern, int cs, int ce, ref StringBuilder dst {}) {
 	dst.append_char('[')
 	var int i = cs + 1
 	if i < ce - 1 {
@@ -435,7 +435,7 @@ func collect_first_bytes = (
 	string pattern,
 	int pat_pos,
 	int pat_end,
-	ref StringBuilder sb,
+	ref StringBuilder sb {},
 	out int
 ) {
 	var depth = 0
@@ -482,7 +482,7 @@ func collect_first_bytes = (
 // atom — literal, escaped, class, or group — quantified with '?'/'*' is
 // nullable: what FOLLOWS it can also be first, so the scan continues past it.
 // A wildcard '.' or an empty alternative makes the set indeterminable.
-func alt_first_bytes = (string pattern, int start, int end, ref StringBuilder sb, out int) {
+func alt_first_bytes = (string pattern, int start, int end, ref StringBuilder sb {}, out int) {
 	var int i = start
 	while i < end {
 		var char c = pattern.at(i)
@@ -722,7 +722,7 @@ func add_class_chars = (
 	string pattern,
 	int start,
 	int end,
-	ref StringBuilder sb
+	ref StringBuilder sb {}
 ) { var int cs = start
 	if cs < end {
 		if pattern.at(cs) == '^' {
@@ -777,7 +777,7 @@ func match_here = (
 	string input,
 	int in_pos,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int: out <= in_len
 ) {
 	// Handle top-level alternation: a '|' at bracket/paren depth 0 splits the
@@ -1036,7 +1036,7 @@ func match_group_then_rest = (
 	string input,
 	int in_pos,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	var int g = group_index_at(pattern, atom_start)
@@ -1127,7 +1127,7 @@ func match_single_atom = (
 	string input,
 	int in_pos,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	var char pc = pattern.at(atom_start)
@@ -1309,7 +1309,7 @@ func match_counted = (
 	int lazy,
 	int count,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	var can_stop = count >= min_count
@@ -1407,7 +1407,7 @@ func match_star = (
 	int min_count,
 	int lazy,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	var char pc = pattern.at(atom_start)
@@ -1490,7 +1490,7 @@ func match_star_group = (
 	int min_count,
 	int lazy,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	if lazy > 0 {
@@ -1559,7 +1559,7 @@ func match_group_iteration = (
 	int min_count,
 	int lazy,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	var int g = group_index_at(pattern, atom_start)
@@ -1626,7 +1626,7 @@ func match_optional = (
 	int in_pos,
 	int lazy,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	if lazy > 0 {
@@ -1899,7 +1899,7 @@ func group_index_at = (string pattern, int open_pos, out int) {
 // group_pos. A later span for the same group supersedes the earlier one, so
 // a repeated group reports its last iteration; a failed group records
 // (-1, -1) so stale spans from an abandoned attempt never surface.
-func record_capture = (ref List<int> caps, int group, int start, int end) {
+func record_capture = (ref List<int> caps { items }, int group, int start, int end) {
 	if group <= 0 {
 		return
 	}
@@ -1958,7 +1958,7 @@ func match_backref = (
 	int group,
 	int in_pos,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps {},
 	out int
 ) {
 	var int at = last_capture_index(caps, group)
@@ -1994,7 +1994,7 @@ func match_star_backref = (
 	int min_count,
 	int lazy,
 	int in_len,
-	ref List<int> caps,
+	ref List<int> caps { items },
 	out int
 ) {
 	var int group = backref_group(pattern.at(atom_start + 1))
@@ -2116,7 +2116,7 @@ func matches_shorthand = (char c, char b, out bool) {
 // first-byte charset. Complement shorthands (S/D/W) match "anything else" —
 // not expressible as an inclusion set — so they return -1, which disables
 // the caller's prefilter.
-func shorthand_members = (char c, ref StringBuilder sb, out int) {
+func shorthand_members = (char c, ref StringBuilder sb {}, out int) {
 	var int kind = c as int
 	if kind == 83 || kind == 68 || kind == 87 {
 		return -1

package/core/System/Thread.nm

@@ -82,9 +82,13 @@ pub mv struct Thread<T> : 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, mv out Task<T>) {
+	pub func start = (ref self {}, mv out Task<T>) {
 		```
 		#arch: c
+		// Single-launch contract: a consumed construction (started) owns
+		// nothing — the handles below are zeroed, and writing the ref count
+		// through the null future would fault. Abort with the reason.
+		if (self->started) __nomen_spawn_double_start_abort();
 		struct nomen_future *_f = (struct nomen_future *)self->future;
 		_f->refs = self->nursery_futures ? 3 : 2;
 		__nomen_pool_submit((struct nomen_closure *)self->task);
@@ -94,7 +98,12 @@ pub mv struct Thread<T> : Spawnable<T> {
 		```
 		```
 		#arch: aarch64
-		// x19 = self. f = self->future (#32); nursery_futures at #48.
+		// x19 = self. started at #40; f = self->future (#32); nursery_futures
+		// at #48. Single-launch contract first: a consumed construction has
+		// zeroed handles, and the ref-store below would write through null.
+		ldrb w9, [x19, #40]
+		cbnz w9, .Lnomen_start_double
+		// f = self->future (#32); nursery_futures at #48.
 		ldr x0, [x19, #32]
 		ldr x1, [x19, #48]
 		mov w2, #2
@@ -113,6 +122,10 @@ pub mv struct Thread<T> : Spawnable<T> {
 		ldr x3, [x19, #32]
 		bl ___nomen_nursery_track
 		.Lnomen_start_notrack:
+		b .Lnomen_start_done
+		.Lnomen_start_double:
+		bl ___nomen_spawn_double_start_abort
+		.Lnomen_start_done:
 		```
 		// The handle is a fresh heap Task built through the internal #init;
 		// the caller owns it (a discarded statement form is reclaimed at
@@ -136,9 +149,12 @@ pub mv struct Thread<T> : Spawnable<T> {
 	// mid-execution BY DESIGN. The unused future (a Thread always carries
 	// the full machinery) is released — first detaching the closure from it,
 	// so the daemon runner owns the closure now.
-	pub func detach = (ref self) {
+	pub func detach = (ref self {}) {
 		```
 		#arch: c
+		// Single-launch contract (see .start): a consumed construction has
+		// zeroed handles, and detaching the null closure would crash a worker.
+		if (self->started) __nomen_spawn_double_start_abort();
 		struct nomen_future *_uf = (struct nomen_future *)self->future;
 		if (_uf) {
 			_uf->owner_args = NULL;
@@ -148,6 +164,9 @@ pub mv struct Thread<T> : Spawnable<T> {
 		```
 		```
 		#arch: aarch64
+		// Single-launch contract first (see .start): started at #40.
+		ldrb w9, [x19, #40]
+		cbnz w9, .Lnomen_detach_double
 		// if (self->future) { owner_args = NULL; release it }
 		ldr x0, [x19, #32]
 		cbz x0, .Lnomen_detach_nofut
@@ -157,6 +176,10 @@ pub mv struct Thread<T> : Spawnable<T> {
 		// __nomen_task_detach(self->task)
 		ldr x0, [x19, #8]
 		bl ___nomen_task_detach
+		b .Lnomen_detach_done
+		.Lnomen_detach_double:
+		bl ___nomen_spawn_double_start_abort
+		.Lnomen_detach_done:
 		```
 		self.task = 0
 		self.future = 0

package/core/System/Tree.nm

@@ -13,7 +13,7 @@ pub mv struct Tree<T>: Enumerable {
 	var parents = Buffer<int>()
 	var count = 0
 
-	pub func add = (ref self, mv T value) {
+	pub func add = (ref self { lefts, parents, rights, values }, mv T value) {
 		const int idx = self.count
 		self.values.grow_int(idx + 1)
 		const int v = value
@@ -27,12 +27,12 @@ pub mv struct Tree<T>: Enumerable {
 		self.count = self.count + 1
 	}
 
-	pub func set_left = (ref self, int idx, int left) {
+	pub func set_left = (ref self { lefts, parents }, int idx, int left) {
 		self.lefts.store_int(idx, left)
 		self.parents.store_int(left, idx)
 	}
 
-	pub func set_right = (ref self, int idx, int right) {
+	pub func set_right = (ref self { parents, rights }, int idx, int right) {
 		self.rights.store_int(idx, right)
 		self.parents.store_int(right, idx)
 	}
@@ -57,6 +57,22 @@ pub mv struct Tree<T>: Enumerable {
 		return self.values.load_int(idx)
 	}
 
+	// Bounds-checked access: `fallback` when idx is outside [0, self.count).
+	pub func at_or = (self, int idx, T fallback, out T) {
+		if idx >= 0 && idx < self.count {
+			return self.at(idx)
+		}
+		return fallback
+	}
+
+	// Bounds-checked access that traps when idx is outside [0, self.count).
+	pub func at_or_panic = (self, int idx, out T) {
+		if idx >= 0 && idx < self.count {
+			return self.at(idx)
+		}
+		panic("index out of range")
+	}
+
 	pub func count_nodes = (self, int idx, out int) {
 		if idx == -1 {
 			return 0