@wonderyard/vivarium 1.4.1 → 2.0.0

package/dist/main.d.ts

@@ -1,6 +1,6 @@
 export { Helpers } from './blueprint/helpers';
-export { ElementBlueprint, KindBlueprint, RefBlueprint, } from './blueprint/ref-blueprint';
-export { RuleBlueprint, RuleBlueprintWithAccept, } from './blueprint/rule-blueprint';
+export { ElementBlueprint, KindBlueprint, RefBlueprint } from './blueprint/ref-blueprint';
+export { RuleBlueprint, RuleBlueprintWithAccept } from './blueprint/rule-blueprint';
 export { VivariumBlueprint } from './blueprint/vivarium-blueprint';
 export { vivarium } from './vivarium/vivarium';
 export { setup } from './webgpu/setup';

package/dist/main.js

@@ -1,6 +1,6 @@
 import { Helpers as t } from "./blueprint/helpers.js";
 import { ElementBlueprint as i, KindBlueprint as o, RefBlueprint as u } from "./blueprint/ref-blueprint.js";
-import { R as m, a as n } from "./rule-blueprint-DGODv9IV.js";
+import { R as m, a as n } from "./rule-blueprint-C9qa6iP-.js";
 import { VivariumBlueprint as x } from "./blueprint/vivarium-blueprint.js";
 import { vivarium as a } from "./vivarium/vivarium.js";
 import { setup as R } from "./webgpu/setup.js";

package/dist/{rule-blueprint-DGODv9IV.js → rule-blueprint-C9qa6iP-.js}

@@ -1,6 +1,6 @@
 import { BaseBlueprint as r } from "./blueprint/base-blueprint.js";
 import { toRefIdOrPoint as s } from "./blueprint/utils.js";
-import { n as c, c as a } from "./constants-D4GX9YB2.js";
+import { n as c, c as a } from "./constants-BT-9-x_4.js";
 const h = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
 let o = (i = 21) => {
   let t = "", e = crypto.getRandomValues(new Uint8Array(i |= 0));

package/dist/vivarium/vivarium.d.ts

@@ -4,6 +4,9 @@ import { VivariumBlueprint } from '../blueprint/vivarium-blueprint';
  * Creates a new vivarium builder used to define elements, kinds, and rules.
  *
  * @param neighborhoodName - The neighborhood type to use. Defaults to `"square"` (Moore neighborhood, 8 neighbors). Use `"cross"` for a von Neumann neighborhood (4 neighbors).
+ * @param options - Optional configuration object. Use `{ wrapping: true }` to enable toroidal grid wrapping. Defaults to non-wrapping.
  * @returns A {@link VivariumBlueprint} instance.
  */
-export declare function vivarium<N extends Neighborhood = "square">(neighborhoodName?: N): VivariumBlueprint<N>;
+export declare function vivarium<N extends Neighborhood = "square">(neighborhoodName?: N, options?: {
+    wrapping?: boolean;
+}): VivariumBlueprint<N>;

package/dist/vivarium/vivarium.js

@@ -1,7 +1,7 @@
-import { VivariumBlueprint as i } from "../blueprint/vivarium-blueprint.js";
-function t(r) {
-  return new i(r);
+import { VivariumBlueprint as n } from "../blueprint/vivarium-blueprint.js";
+function u(r, i) {
+  return new n(r, i);
 }
 export {
-  t as vivarium
+  u as vivarium
 };

package/dist/webgpu/compiler.d.ts

@@ -4,8 +4,9 @@ import * as d from "typegpu/data";
 type GpuRuleType = d.Infer<typeof GpuRule>;
 type GpuElementType = d.Infer<typeof GpuElement>;
 type GpuConditionType = d.Infer<typeof GpuCondition>;
+type GpuNeighborhoodType = 0 | 1;
 export type GpuAutomaton = {
-    gpuNeighborhood: number;
+    gpuNeighborhood: GpuNeighborhoodType;
     gpuElements: GpuElementType[];
     gpuRules: GpuRuleType[];
     gpuConditions: GpuConditionType[];

package/dist/webgpu/compiler.js

@@ -1,29 +1,25 @@
-import { G as N, a as O, T as u, l as I, b as k, O as m } from "../constants-D4GX9YB2.js";
+import { G as N, a as O, T as u, v as I, b as k, O as m } from "../constants-BT-9-x_4.js";
 import { colorToABGR as g } from "../common/utils.js";
-const T = (n) => {
-  if (n.some((t) => t > 31))
+const T = (o) => {
+  if (o.some((t) => t > 31))
     throw console.warn(
       `Elements with an index greater than 31 and extending one or more kinds are not allowed when they are involved in conditions referencing kinds.
 To assign a lower index, move the elements with extensions higher in the definition list or reduce the overall number of elements and kinds.`
-    ), new Error(
-      "Element in condition involving kinds has an index greater than 31"
-    );
-}, P = (n, t, f) => {
-  const { elements: h } = f, p = h.findIndex((r) => r.id === n);
+    ), new Error("Element in condition involving kinds has an index greater than 31");
+}, P = (o, t, f) => {
+  const { elements: h } = f, p = h.findIndex((r) => r.id === o);
   if (p !== -1)
     t.opcode = m.COUNT_ELEMENT, t.checkId = p;
   else {
-    const r = h.map((s, d) => ({ ...s, index: d })).filter(
-      (s) => s.extensions.some((d) => d === n)
-    ).map((s) => s.index);
+    const r = h.map((s, d) => ({ ...s, index: d })).filter((s) => s.extensions.some((d) => d === o)).map((s) => s.index);
     T(r);
     const c = r.reduce((s, d) => (s |= 1 << d, s), 0);
     t.checkId = c, t.opcode = m.COUNT_KIND;
   }
-}, _ = (n, t) => {
-  t.opcode = m.COUNT_POINT, t.checkPointOrComparePoint = I(n.x, n.y);
-}, S = (n, t, f) => {
-  const { check: h, count: p } = n;
+}, _ = (o, t) => {
+  t.opcode = m.COUNT_POINT, t.checkPointOrComparePoint = I(o.x, o.y);
+}, v = (o, t, f) => {
+  const { check: h, count: p } = o;
   if (typeof h > "u")
     throw new Error("condition.check is undefined");
   typeof h == "string" ? P(h, t, f) : _(h, t), t.countOrWithId = p.reduce(
@@ -32,53 +28,44 @@ To assign a lower index, move the elements with extensions higher in the definit
     (r, c) => (r |= 1 << c, r),
     0
   );
-}, M = (n, t, f) => {
-  const h = n.compare;
+}, S = (o, t, f) => {
+  const h = o.compare;
   if (typeof h > "u")
     throw new Error("condition.compare is undefined");
-  if (typeof n.with > "u")
+  if (typeof o.with > "u")
     throw new Error("condition.with is undefined");
-  if (t.checkPointOrComparePoint = I(
-    h.x,
-    h.y
-  ), typeof n.with == "string") {
-    const p = n.with;
+  if (t.checkPointOrComparePoint = I(h.x, h.y), typeof o.with == "string") {
+    const p = o.with;
     if (f.elements.some((r) => r.id === p)) {
       t.opcode = m.IS_ELEMENT;
-      const r = f.elements.findIndex(
-        (c) => c.id === p
-      );
+      const r = f.elements.findIndex((c) => c.id === p);
       t.countOrWithId = r;
     } else {
-      const r = f.elements.map((s, d) => ({ ...s, index: d })).filter(
-        (s) => s.extensions.some((d) => d === p)
-      ).map((s) => s.index);
+      const r = f.elements.map((s, d) => ({ ...s, index: d })).filter((s) => s.extensions.some((d) => d === p)).map((s) => s.index);
       T(r);
       const c = r.reduce((s, d) => (s |= 1 << d, s), 0);
       t.countOrWithId = c, t.opcode = m.IS_KIND;
     }
   } else
-    t.opcode = m.IS_POINT, t.withPoint = I(n.with.x, n.with.y);
-}, G = (n) => {
-  const { elements: t, rules: f } = n, h = f.filter((e) => e.fromType === "element").reduce(
-    (e, o) => {
-      const l = t.findIndex(
-        (i) => i.id === o.fromId
-      );
-      return e[l].push(o), e;
+    t.opcode = m.IS_POINT, t.withPoint = I(o.with.x, o.with.y);
+}, G = (o) => {
+  const { elements: t, rules: f } = o, h = f.filter((e) => e.fromType === "element").reduce(
+    (e, n) => {
+      const l = t.findIndex((i) => i.id === n.fromId);
+      return e[l].push(n), e;
     },
     t.map(() => [])
-  ), p = f.filter((e) => e.fromType === "kind").reduce((e, o) => (t.forEach((l, i) => {
-    l.extensions.includes(o.fromId) && e[i].push(o);
+  ), p = f.filter((e) => e.fromType === "kind").reduce((e, n) => (t.forEach((l, i) => {
+    l.extensions.includes(n.fromId) && e[i].push(n);
   }), e), h), r = [];
   let c = [];
   const s = /* @__PURE__ */ new Map();
   p.forEach((e) => {
-    e.forEach((o, l) => {
+    e.forEach((n, l) => {
       let i, a;
-      const w = `${o.fromId}:${l.toString()}`;
-      o.fromType === "kind" && s.has(w) ? [i, a] = s.get(w) : (i = c.length, Array.isArray(o.when) ? c = c.concat(o.when) : c = c.concat([o.when]), a = c.length, s.set(w, [i, a])), r.push({
-        ...o,
+      const w = `${n.fromId}:${l.toString()}`;
+      n.fromType === "kind" && s.has(w) ? [i, a] = s.get(w) : (i = c.length, Array.isArray(n.when) ? c = c.concat(n.when) : c = c.concat([n.when]), a = c.length, s.set(w, [i, a])), r.push({
+        ...n,
         conditionsStart: i,
         conditionsEnd: a
       });
@@ -86,8 +73,8 @@ To assign a lower index, move the elements with extensions higher in the definit
   });
   const d = [], y = [], x = [];
   let E = 0;
-  return t.forEach((e, o) => {
-    const l = E, i = E + p[o].length;
+  return t.forEach((e, n) => {
+    const l = E, i = E + p[n].length;
     E = i;
     const a = N({
       color: g(e.color),
@@ -96,11 +83,11 @@ To assign a lower index, move the elements with extensions higher in the definit
     });
     d.push(a);
   }), r.forEach((e) => {
-    const { conditionsStart: o, conditionsEnd: l } = e, i = O({
+    const { conditionsStart: n, conditionsEnd: l } = e, i = O({
       toType: u.ELEMENT_ID,
       toId: 0,
       toNeighbor: I(),
-      conditionsStart: o,
+      conditionsStart: n,
       conditionsEnd: l,
       accept: e.accept
     });
@@ -108,7 +95,7 @@ To assign a lower index, move the elements with extensions higher in the definit
       throw new Error("rule.to is undefined");
     typeof e.to == "string" ? (i.toType = u.ELEMENT_ID, i.toId = t.findIndex((a) => a.id === e.to)) : (i.toType = u.POINT, i.toNeighbor = I(e.to.x, e.to.y));
   }), c.forEach((e) => {
-    const o = k({
+    const n = k({
       opcode: m.NOOP,
       checkId: 0,
       countOrWithId: 0,
@@ -116,9 +103,9 @@ To assign a lower index, move the elements with extensions higher in the definit
       withPoint: I(),
       chance: 0
     });
-    x.push(o), e.type === "count" ? S(e, o, n) : e.type === "is" ? M(e, o, n) : (o.opcode = m.CHANCE, o.chance = e.ratio.part / e.ratio.whole);
+    x.push(n), e.type === "count" ? v(e, n, o) : e.type === "is" ? S(e, n, o) : (n.opcode = m.CHANCE, n.chance = e.ratio.part / e.ratio.whole);
   }), {
-    gpuNeighborhood: n.neighborhood === "cross" ? 4 : 8,
+    gpuNeighborhood: o.neighborhood === "square" ? 1 : 0,
     gpuElements: d,
     gpuRules: y,
     gpuConditions: x

package/dist/webgpu/setup.d.ts

@@ -1,11 +1,14 @@
-import { TgpuUniform } from 'typegpu';
 import { Automaton } from '../automaton/types';
+import { TgpuUniform } from 'typegpu';
 import * as d from "typegpu/data";
 export declare const setSeed: (s: TgpuUniform<d.F32>) => void;
 export declare const gridLayout: import('typegpu').TgpuBindGroupLayout<{
     dimensions: {
         uniform: d.Vec2u;
     };
+    wrapping: {
+        uniform: d.U32;
+    };
     colors: {
         storage: (elementCount: number) => d.WgslArray<d.U32>;
         access: "mutable";
@@ -58,7 +61,7 @@ export declare const automatonLayout: import('typegpu').TgpuBindGroupLayout<{
         access: "readonly";
     };
 }>;
-export declare const mainCompute: import('typegpu').TgpuComputeFn<{
+export declare const compute: import('typegpu').TgpuComputeFn<{
     pos: d.BuiltinGlobalInvocationId;
 }>;
 /**