ye

Author: Axp3cter

src/shape/Grid.luau

@@ -102,6 +102,28 @@ function Grid.of (min: number, max: number, step: number, wraps: boolean?): Grid
     local under = min - room
     local over = max + room
 
+    --[[
+        A grid from zero at a whole step is its own index, so the shift and the division are a
+        subtraction of nothing and a division by one. Written apart rather than branched inside,
+        since the branch would then be taken once a field on every frame.
+    ]]
+    if min == 0 and step == 1 then
+        local function toIndex (value: any): number?
+            if type (value) ~= "number" then return nil end
+            if not (value >= under and value <= over) then return nil end
+            return math.clamp (math.round (value), 0, span)
+        end
+
+        return {
+            span = span,
+            width = width,
+            plain = true,
+            whole = span == bit32.lshift (1, width) - 1,
+            toIndex = toIndex,
+            fromIndex = fromIndex,
+        }
+    end
+
     local function toIndex (value: any): number?
         if type (value) ~= "number" then return nil end
         if not (value >= under and value <= over) then return nil end
@@ -111,7 +133,7 @@ function Grid.of (min: number, max: number, step: number, wraps: boolean?): Grid
     return {
         span = span,
         width = width,
-        plain = min == 0 and step == 1,
+        plain = false,
         whole = span == bit32.lshift (1, width) - 1,
         toIndex = toIndex,
         fromIndex = fromIndex,

src/shape/emit/Word.luau

@@ -78,6 +78,9 @@ function Word.emit (of: Ir.Word, paths: Serial.Interner, expected: Serial.Intern
         if spans[index] == 0 then table.insert (empties, index) end
     end
 
+    -- Whether there are any, since a walk over none is one a decode takes for nothing.
+    local barren = #empties > 0
+
     -- Per join, in the order the region reads its fields.
     local reach = #joins
     local starts = table.create (reach, 0)
@@ -193,8 +196,10 @@ function Word.emit (of: Ir.Word, paths: Serial.Interner, expected: Serial.Intern
         left there, and a field that straddles two windows meets its low piece first.
     ]]
     local function unpack (b: buffer, pos: number, into: any, slots: { number }, held: { any }): any
-        for _, leaf in empties do
-            slots[leaf] = 0
+        if barren then
+            for _, leaf in empties do
+                slots[leaf] = 0
+            end
         end
 
         for index = 1, windows do