@codyswann/lisa 1.32.0 → 1.33.0

package/all/copy-overwrite/.claude/skills/plan-create/SKILL.md

@@ -185,7 +185,7 @@ Include all required tasks defined in `@.claude/rules/plan-governance.md` (Requi
 
 ## Step 10: Implementation Team Instructions
 
-The plan must include explict instructions to "Create an agent team" for implementation. Recommend these specialized agents:
+The plan must include explict instructions to "Create an agent team" for implementation and run the /plan-implement skill. Recommend these specialized agents:
 
 | Agent | Use For |
 |-------|---------|

package/dist/utils/fibonacci.d.ts

@@ -1,55 +1,50 @@
 /**
  * @file fibonacci.ts
- * @description BigInt Fibonacci utilities using a lazy generator pattern.
- * Uses BigInt instead of Number to eliminate the precision ceiling at
- * fibonacci(78) — BigInt supports arbitrarily large integers, so callers
- * can compute fibonacci(1000) or beyond without silent corruption.
- * The generator pattern enables lazy evaluation, letting consumers pull
- * only the values they need without allocating the full sequence upfront.
- * @module fibonacci
+ * @description BigInt Fibonacci utilities built on a lazy infinite generator.
+ * Every public function delegates to `fibonacciGenerator` so the core
+ * recurrence relation lives in exactly one place (DRY). BigInt eliminates
+ * the precision ceiling that Number hits at fibonacci(78).
+ * @module utils
  */
 /**
- * Infinite lazy generator yielding Fibonacci numbers as BigInt.
- *
- * @returns Generator that yields successive Fibonacci numbers (0n, 1n, 1n, 2n, 3n, ...)
- * @remarks The generator never terminates — do not spread or collect without a length limit.
- * Each call creates an independent generator instance — safe for concurrent iteration.
+ * Infinite generator that lazily yields the Fibonacci sequence as BigInts
+ * @yields {bigint} The next Fibonacci number in the sequence (0n, 1n, 1n, 2n, 3n, …)
+ * @remarks Each call creates an independent iterator with its own state, so
+ * multiple consumers can advance through the sequence without interference.
  * @example
  * ```typescript
  * const gen = fibonacciGenerator();
  * gen.next().value; // 0n
  * gen.next().value; // 1n
- *
- * // Collect first 5 values:
- * const first5 = Array.from({ length: 5 }, () => gen.next().value);
+ * gen.next().value; // 1n
  * ```
  */
 export declare function fibonacciGenerator(): Generator<bigint, never, unknown>;
 /**
- * Compute the nth Fibonacci number (0-indexed) using BigInt.
- *
- * @param n - Zero-based index in the Fibonacci sequence (must be a non-negative integer)
- * @returns The nth Fibonacci number as a BigInt — compare with `===` against bigint literals (e.g. `55n`), not numbers
- * @throws {RangeError} If n is negative, non-integer, NaN, or Infinity
- * @remarks Delegates to fibonacciGenerator — O(n) time, consistent with the lazy generator approach
+ * Returns the nth Fibonacci number as a BigInt
+ * @param n - Zero-based index into the Fibonacci sequence (must be a non-negative integer)
+ * @returns The nth Fibonacci number (e.g. fibonacci(5) → 5n)
+ * @throws {RangeError} When n is negative, non-integer, NaN, or Infinity
+ * @remarks Delegates to `fibonacciGenerator` so the recurrence logic is defined once.
  * @example
  * ```typescript
- * fibonacci(10); // 55n (bigint, not number)
- * fibonacci(10) === 55n; // true
- * fibonacci(10) === 55; // false — bigint !== number
+ * fibonacci(0);   // 0n
+ * fibonacci(10);  // 55n
+ * fibonacci(78);  // 8944394323791464n — beyond Number.MAX_SAFE_INTEGER
  * ```
  */
 export declare function fibonacci(n: number): bigint;
 /**
- * Generate the first `length` Fibonacci numbers as a readonly BigInt array.
- *
- * @param length - How many Fibonacci numbers to generate (must be a non-negative integer)
- * @returns A readonly array of the first `length` Fibonacci numbers as BigInt
- * @throws {RangeError} If length is negative, non-integer, NaN, or Infinity
- * @remarks Wraps fibonacciGenerator so the sequence is computed once, not per-element
+ * Returns the first `length` Fibonacci numbers as a readonly BigInt array
+ * @param length - How many Fibonacci numbers to return (must be a non-negative integer)
+ * @returns A new array containing the first `length` Fibonacci numbers
+ * @throws {RangeError} When length is negative, non-integer, NaN, or Infinity
+ * @remarks Delegates to `fibonacciGenerator` so the recurrence logic is defined once.
+ * Returns a fresh array on every call — callers can safely mutate the result.
  * @example
  * ```typescript
- * fibonacciSequence(5); // [0n, 1n, 1n, 2n, 3n]
+ * fibonacciSequence(0);  // []
+ * fibonacciSequence(5);  // [0n, 1n, 1n, 2n, 3n]
  * ```
  */
 export declare function fibonacciSequence(length: number): readonly bigint[];

package/dist/utils/fibonacci.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fibonacci.d.ts","sourceRoot":"","sources":["../../src/utils/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;;;;;;;;;;;;;;GAeG;AACH,wBAAiB,kBAAkB,IAAI,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CASvE;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAY3C;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAUnE"}
+{"version":3,"file":"fibonacci.d.ts","sourceRoot":"","sources":["../../src/utils/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;;;;;;GAYG;AACH,wBAAiB,kBAAkB,IAAI,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CAUvE;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAU3C;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CASnE"}

package/dist/utils/fibonacci.js

@@ -1,27 +1,22 @@
 /**
  * @file fibonacci.ts
- * @description BigInt Fibonacci utilities using a lazy generator pattern.
- * Uses BigInt instead of Number to eliminate the precision ceiling at
- * fibonacci(78) — BigInt supports arbitrarily large integers, so callers
- * can compute fibonacci(1000) or beyond without silent corruption.
- * The generator pattern enables lazy evaluation, letting consumers pull
- * only the values they need without allocating the full sequence upfront.
- * @module fibonacci
+ * @description BigInt Fibonacci utilities built on a lazy infinite generator.
+ * Every public function delegates to `fibonacciGenerator` so the core
+ * recurrence relation lives in exactly one place (DRY). BigInt eliminates
+ * the precision ceiling that Number hits at fibonacci(78).
+ * @module utils
  */
 /**
- * Infinite lazy generator yielding Fibonacci numbers as BigInt.
- *
- * @returns Generator that yields successive Fibonacci numbers (0n, 1n, 1n, 2n, 3n, ...)
- * @remarks The generator never terminates — do not spread or collect without a length limit.
- * Each call creates an independent generator instance — safe for concurrent iteration.
+ * Infinite generator that lazily yields the Fibonacci sequence as BigInts
+ * @yields {bigint} The next Fibonacci number in the sequence (0n, 1n, 1n, 2n, 3n, …)
+ * @remarks Each call creates an independent iterator with its own state, so
+ * multiple consumers can advance through the sequence without interference.
  * @example
  * ```typescript
  * const gen = fibonacciGenerator();
  * gen.next().value; // 0n
  * gen.next().value; // 1n
- *
- * // Collect first 5 values:
- * const first5 = Array.from({ length: 5 }, () => gen.next().value);
+ * gen.next().value; // 1n
  * ```
  */
 export function* fibonacciGenerator() {
@@ -35,21 +30,20 @@ export function* fibonacciGenerator() {
     }
 }
 /**
- * Compute the nth Fibonacci number (0-indexed) using BigInt.
- *
- * @param n - Zero-based index in the Fibonacci sequence (must be a non-negative integer)
- * @returns The nth Fibonacci number as a BigInt — compare with `===` against bigint literals (e.g. `55n`), not numbers
- * @throws {RangeError} If n is negative, non-integer, NaN, or Infinity
- * @remarks Delegates to fibonacciGenerator — O(n) time, consistent with the lazy generator approach
+ * Returns the nth Fibonacci number as a BigInt
+ * @param n - Zero-based index into the Fibonacci sequence (must be a non-negative integer)
+ * @returns The nth Fibonacci number (e.g. fibonacci(5) → 5n)
+ * @throws {RangeError} When n is negative, non-integer, NaN, or Infinity
+ * @remarks Delegates to `fibonacciGenerator` so the recurrence logic is defined once.
  * @example
  * ```typescript
- * fibonacci(10); // 55n (bigint, not number)
- * fibonacci(10) === 55n; // true
- * fibonacci(10) === 55; // false — bigint !== number
+ * fibonacci(0);   // 0n
+ * fibonacci(10);  // 55n
+ * fibonacci(78);  // 8944394323791464n — beyond Number.MAX_SAFE_INTEGER
  * ```
  */
 export function fibonacci(n) {
-    if (!Number.isInteger(n) || n < 0) {
+    if (!Number.isFinite(n) || !Number.isInteger(n) || n < 0) {
         throw new RangeError(`Expected a non-negative integer for n, got ${String(n)}`);
     }
     const gen = fibonacciGenerator();
@@ -57,19 +51,20 @@ export function fibonacci(n) {
     return gen.next().value;
 }
 /**
- * Generate the first `length` Fibonacci numbers as a readonly BigInt array.
- *
- * @param length - How many Fibonacci numbers to generate (must be a non-negative integer)
- * @returns A readonly array of the first `length` Fibonacci numbers as BigInt
- * @throws {RangeError} If length is negative, non-integer, NaN, or Infinity
- * @remarks Wraps fibonacciGenerator so the sequence is computed once, not per-element
+ * Returns the first `length` Fibonacci numbers as a readonly BigInt array
+ * @param length - How many Fibonacci numbers to return (must be a non-negative integer)
+ * @returns A new array containing the first `length` Fibonacci numbers
+ * @throws {RangeError} When length is negative, non-integer, NaN, or Infinity
+ * @remarks Delegates to `fibonacciGenerator` so the recurrence logic is defined once.
+ * Returns a fresh array on every call — callers can safely mutate the result.
  * @example
  * ```typescript
- * fibonacciSequence(5); // [0n, 1n, 1n, 2n, 3n]
+ * fibonacciSequence(0);  // []
+ * fibonacciSequence(5);  // [0n, 1n, 1n, 2n, 3n]
  * ```
  */
 export function fibonacciSequence(length) {
-    if (!Number.isInteger(length) || length < 0) {
+    if (!Number.isFinite(length) || !Number.isInteger(length) || length < 0) {
         throw new RangeError(`Expected a non-negative integer for length, got ${String(length)}`);
     }
     const gen = fibonacciGenerator();

package/dist/utils/fibonacci.js.map

@@ -1 +1 @@
-{"version":3,"file":"fibonacci.js","sourceRoot":"","sources":["../../src/utils/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;;;;;;;;;;;;;;GAeG;AACH,MAAM,SAAS,CAAC,CAAC,kBAAkB;IACjC,8GAA8G;IAC9G,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,qFAAqF;IACrF,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,CAAC;QACR,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAClB,8CAA8C,MAAM,CAAC,CAAC,CAAC,EAAE,CAC1D,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,kBAAkB,EAAE,CAAC;IAEjC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAE5C,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,UAAU,CAClB,mDAAmD,MAAM,CAAC,MAAM,CAAC,EAAE,CACpE,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,kBAAkB,EAAE,CAAC;IAEjC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC"}
+{"version":3,"file":"fibonacci.js","sourceRoot":"","sources":["../../src/utils/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;;;;;;GAYG;AACH,MAAM,SAAS,CAAC,CAAC,kBAAkB;IACjC,8GAA8G;IAC9G,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,qFAAqF;IAErF,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,CAAC;QACR,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACzD,MAAM,IAAI,UAAU,CAClB,8CAA8C,MAAM,CAAC,CAAC,CAAC,EAAE,CAC1D,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,kBAAkB,EAAE,CAAC;IACjC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5C,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,UAAU,CAClB,mDAAmD,MAAM,CAAC,MAAM,CAAC,EAAE,CACpE,CAAC;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,kBAAkB,EAAE,CAAC;IACjC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC"}

package/package.json

@@ -88,7 +88,7 @@
     "@isaacs/brace-expansion": "^5.0.1"
   },
   "name": "@codyswann/lisa",
-  "version": "1.32.0",
+  "version": "1.33.0",
   "description": "Claude Code governance framework that applies guardrails, guidance, and automated enforcement to projects",
   "main": "dist/index.js",
   "bin": {