Add Prettier formatting and Gitea Actions CI (format, typecheck, test, build)

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_017Qxbkp4tA7G5SCWjzWuxmE

test/kv/sorted.test.ts

@@ -36,26 +36,31 @@ describe('ChunkedSortedMap (model-based, tiny chunks)', () => {
 
   it('iterators resume correctly after mutations between steps', () => {
     fc.assert(
-      fc.property(fc.uniqueArray(key, { minLength: 1, maxLength: 60 }), fc.array(fc.tuple(fc.boolean(), key), { maxLength: 40 }), fc.boolean(), (initial, muts, reverse) => {
-        const m = new ChunkedSortedMap<number>(3)
-        initial.forEach((k) => m.set(k, 0))
-        const live = new Set(initial)
-        const seen: string[] = []
-        let step = 0
-        for (const k of m.keys({ reverse })) {
-          seen.push(k)
-          const mut = muts[step++]
-          if (mut) {
-            const [add, mk] = mut
-            if (add) (m.set(mk, 1), live.add(mk))
-            else (m.delete(mk), live.delete(mk))
+      fc.property(
+        fc.uniqueArray(key, { minLength: 1, maxLength: 60 }),
+        fc.array(fc.tuple(fc.boolean(), key), { maxLength: 40 }),
+        fc.boolean(),
+        (initial, muts, reverse) => {
+          const m = new ChunkedSortedMap<number>(3)
+          initial.forEach((k) => m.set(k, 0))
+          const live = new Set(initial)
+          const seen: string[] = []
+          let step = 0
+          for (const k of m.keys({ reverse })) {
+            seen.push(k)
+            const mut = muts[step++]
+            if (mut) {
+              const [add, mk] = mut
+              if (add) (m.set(mk, 1), live.add(mk))
+              else (m.delete(mk), live.delete(mk))
+            }
           }
-        }
-        // Strictly monotone, and every key present throughout the iteration was visited.
-        for (let i = 1; i < seen.length; i++) expect(reverse ? seen[i]! < seen[i - 1]! : seen[i]! > seen[i - 1]!).toBe(true)
-        const stable = initial.filter((k) => !muts.some(([, mk]) => mk === k))
-        for (const k of stable) expect(seen).toContain(k)
-      }),
+          // Strictly monotone, and every key present throughout the iteration was visited.
+          for (let i = 1; i < seen.length; i++) expect(reverse ? seen[i]! < seen[i - 1]! : seen[i]! > seen[i - 1]!).toBe(true)
+          const stable = initial.filter((k) => !muts.some(([, mk]) => mk === k))
+          for (const k of stable) expect(seen).toContain(k)
+        },
+      ),
       { numRuns: 500 },
     )
   })