fix comptime yield targeting

std/static_string_map/static_string_map.bro

@@ -35,48 +35,51 @@ init func($V type, $N usize, $entries [N]Pair(V)) StaticStringMap(V) {
 			values[i] = entry.1
 		}
 
-		if N == 0 {
-			len_indexes [0]mut u32 = undefined
-			yield StaticStringMap(V) {
+		result :: done: {
+			if N == 0 {
+				len_indexes [0]mut u32 = undefined
+				yield :done StaticStringMap(V) {
+					keys = keys[..],
+					values = values[..],
+					len_indexes = len_indexes[..],
+					min_len = 0,
+					max_len = 0,
+				}
+			}
+
+			# ponytail: insertion sort is compile-time O(N²); replace if large maps affect builds.
+			i usize = 1
+			while i < N : i += 1 {
+				key :: keys[i]
+				value :: values[i]
+				j usize = i
+				while j > 0 and keys[j - 1].len > key.len : j -= 1 {
+					keys[j] = keys[j - 1]
+					values[j] = values[j - 1]
+				}
+				keys[j] = key
+				values[j] = value
+			}
+
+			min_len u32 :: u32(keys[0].len)
+			max_len u32 :: u32(keys[N - 1].len)
+			len_indexes [usize(max_len) + 1]mut u32 = undefined
+			entry_index usize = 0
+			length usize = 0
+			while length <= usize(max_len) : length += 1 {
+				while entry_index < N and keys[entry_index].len < length : entry_index += 1 {}
+				len_indexes[length] = u32(entry_index)
+			}
+
+			yield :done StaticStringMap(V) {
 				keys = keys[..],
 				values = values[..],
 				len_indexes = len_indexes[..],
-				min_len = 0,
-				max_len = 0,
+				min_len = min_len,
+				max_len = max_len,
 			}
 		}
-
-		# ponytail: insertion sort is compile-time O(N²); replace if large maps affect builds.
-		i usize = 1
-		while i < N : i += 1 {
-			key :: keys[i]
-			value :: values[i]
-			j usize = i
-			while j > 0 and keys[j - 1].len > key.len : j -= 1 {
-				keys[j] = keys[j - 1]
-				values[j] = values[j - 1]
-			}
-			keys[j] = key
-			values[j] = value
-		}
-
-		min_len u32 :: u32(keys[0].len)
-		max_len u32 :: u32(keys[N - 1].len)
-		len_indexes [usize(max_len) + 1]mut u32 = undefined
-		entry_index usize = 0
-		length usize = 0
-		while length <= usize(max_len) : length += 1 {
-			while entry_index < N and keys[entry_index].len < length : entry_index += 1 {}
-			len_indexes[length] = u32(entry_index)
-		}
-
-		yield StaticStringMap(V) {
-			keys = keys[..],
-			values = values[..],
-			len_indexes = len_indexes[..],
-			min_len = min_len,
-			max_len = max_len,
-		}
+		yield result
 	}
 }