@codyswann/lisa 1.38.0 → 1.39.1

package/all/copy-overwrite/README.md

@@ -17,9 +17,9 @@ brew install claude-code
 
 > Ask Claude: "I just cloned this repo. Walk me through the full setup including installing dependencies, environment variables, and any other configuration."
 
-## Step 3: Run the App Locally
+## Step 3: Build and Test
 
-> Ask Claude: "How do I start the app locally? Walk me through the steps and verify it's running."
+> Ask Claude: "How do I build this package and run the tests?"
 
 ## Step 4: Work on a Feature
 
@@ -56,6 +56,10 @@ Or use utility commands:
 
 > Ask Claude: "Increase test coverage for the files I changed."
 
+### Publish to npm
+
+> Ask Claude: "Walk me through publishing a new version of this package to npm."
+
 ### Deploy
 
 > Ask Claude: "Walk me through deploying this project."

package/all/deletions.json

@@ -41,6 +41,24 @@
     ".claude/skills/sonarqube:check",
     ".claude/skills/sonarqube:fix",
     ".claude/skills/tasks:load",
-    ".claude/skills/tasks:sync"
+    ".claude/skills/tasks:sync",
+    ".claude/REFERENCE.md",
+    ".claude/commands/plan/implement.md",
+    ".claude/rules/plan-governance.md",
+    ".claude/rules/plan.md",
+    ".claude/skills/plan-create",
+    ".claude/skills/plan-implement",
+    ".claude/agents/architecture-planner.md",
+    ".claude/agents/codebase-analyzer.md",
+    ".claude/agents/codebase-locator.md",
+    ".claude/agents/codebase-pattern-finder.md",
+    ".claude/agents/consistency-checker.md",
+    ".claude/agents/product-planner.md",
+    ".claude/agents/product-reviewer.md",
+    ".claude/agents/security-planner.md",
+    ".claude/agents/spec-analyst.md",
+    ".claude/agents/tech-reviewer.md",
+    ".claude/agents/test-coverage-agent.md",
+    ".claude/agents/test-strategist.md"
   ]
 }

package/dist/utils/fibonacci.d.ts

@@ -1,31 +1,36 @@
 /**
  * @file fibonacci.ts
- * @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).
+ * @description Tuple-based Fibonacci utilities powered by an infinite BigInt generator.
+ * BigInt avoids the precision ceiling that Number hits at F(78), where values
+ * exceed Number.MAX_SAFE_INTEGER. Every public function derives its values from
+ * fibonacciGenerator, keeping the recurrence relation in a single place.
  * @module utils
  */
 /**
- * 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.
+ * Infinite generator yielding the Fibonacci sequence as BigInts.
+ *
+ * Uses a two-element pair to track consecutive values, yielding the leading
+ * element on each iteration and advancing the pair forward. Each call returns
+ * an independent iterator, so multiple consumers never interfere.
+ *
+ * @yields The next Fibonacci number (0n, 1n, 1n, 2n, 3n, 5n, …)
  * @example
  * ```typescript
  * const gen = fibonacciGenerator();
  * gen.next().value; // 0n
  * gen.next().value; // 1n
- * gen.next().value; // 1n
  * ```
  */
 export declare function fibonacciGenerator(): Generator<bigint, never, unknown>;
 /**
- * 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.
+ * Returns the nth Fibonacci number (0-indexed) as a BigInt.
+ *
+ * Collects n + 1 values from the generator and returns the final element,
+ * delegating the recurrence to fibonacciGenerator for DRY.
+ *
+ * @param n - Zero-based position in the Fibonacci sequence (non-negative integer)
+ * @returns The nth Fibonacci number as a BigInt
+ * @throws {RangeError} When n is negative, fractional, NaN, or infinite
  * @example
  * ```typescript
  * fibonacci(0);   // 0n
@@ -33,19 +38,22 @@ export declare function fibonacciGenerator(): Generator<bigint, never, unknown>;
  * fibonacci(78);  // 8944394323791464n — beyond Number.MAX_SAFE_INTEGER
  * ```
  */
-export declare function fibonacci(n: number): bigint;
+export declare const fibonacci: (n: number) => bigint;
 /**
- * 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.
+ * Returns the first `length` Fibonacci numbers as a readonly BigInt array.
+ *
+ * Spreads an empty array of the requested size and maps each slot to the
+ * next generator value, delegating the recurrence to fibonacciGenerator for DRY.
+ * Returns a fresh array on every call so callers can safely consume the result.
+ *
+ * @param length - How many Fibonacci numbers to collect (non-negative integer)
+ * @returns A new readonly array of the first `length` Fibonacci numbers
+ * @throws {RangeError} When length is negative, fractional, NaN, or infinite
  * @example
  * ```typescript
  * fibonacciSequence(0);  // []
  * fibonacciSequence(5);  // [0n, 1n, 1n, 2n, 3n]
  * ```
  */
-export declare function fibonacciSequence(length: number): readonly bigint[];
+export declare const fibonacciSequence: (length: number) => readonly bigint[];
 //# sourceMappingURL=fibonacci.d.ts.map

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

@@ -1 +1 @@
-{"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"}
+{"version":3,"file":"fibonacci.d.ts","sourceRoot":"","sources":["../../src/utils/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;;;;;;;;GAcG;AACH,wBAAiB,kBAAkB,IAAI,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,CASvE;AAED;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,SAAS,MAAO,MAAM,KAAG,MAYrC,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,iBAAiB,WAAY,MAAM,KAAG,SAAS,MAAM,EASjE,CAAC"}

package/dist/utils/fibonacci.js

@@ -1,40 +1,44 @@
 /**
  * @file fibonacci.ts
- * @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).
+ * @description Tuple-based Fibonacci utilities powered by an infinite BigInt generator.
+ * BigInt avoids the precision ceiling that Number hits at F(78), where values
+ * exceed Number.MAX_SAFE_INTEGER. Every public function derives its values from
+ * fibonacciGenerator, keeping the recurrence relation in a single place.
  * @module utils
  */
 /**
- * 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.
+ * Infinite generator yielding the Fibonacci sequence as BigInts.
+ *
+ * Uses a two-element pair to track consecutive values, yielding the leading
+ * element on each iteration and advancing the pair forward. Each call returns
+ * an independent iterator, so multiple consumers never interfere.
+ *
+ * @yields The next Fibonacci number (0n, 1n, 1n, 2n, 3n, 5n, …)
  * @example
  * ```typescript
  * const gen = fibonacciGenerator();
  * gen.next().value; // 0n
  * gen.next().value; // 1n
- * gen.next().value; // 1n
  * ```
  */
 export function* fibonacciGenerator() {
-    /* eslint-disable functional/no-let -- generator requires mutable state for iterative Fibonacci computation */
-    let a = 0n;
-    let b = 1n;
-    /* eslint-enable functional/no-let -- re-enable after generator state declarations */
-    while (true) {
-        yield a;
-        [a, b] = [b, a + b];
+    /* eslint-disable functional/no-let -- generator requires mutable pair to track consecutive Fibonacci values */
+    let pair = [0n, 1n];
+    /* eslint-enable functional/no-let -- re-enable after generator state declaration */
+    for (;;) {
+        yield pair[0];
+        pair = [pair[1], pair[0] + pair[1]];
     }
 }
 /**
- * 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.
+ * Returns the nth Fibonacci number (0-indexed) as a BigInt.
+ *
+ * Collects n + 1 values from the generator and returns the final element,
+ * delegating the recurrence to fibonacciGenerator for DRY.
+ *
+ * @param n - Zero-based position in the Fibonacci sequence (non-negative integer)
+ * @returns The nth Fibonacci number as a BigInt
+ * @throws {RangeError} When n is negative, fractional, NaN, or infinite
  * @example
  * ```typescript
  * fibonacci(0);   // 0n
@@ -42,32 +46,34 @@ export function* fibonacciGenerator() {
  * fibonacci(78);  // 8944394323791464n — beyond Number.MAX_SAFE_INTEGER
  * ```
  */
-export function fibonacci(n) {
+export const fibonacci = (n) => {
     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();
-    Array.from({ length: n }, () => gen.next());
-    return gen.next().value;
-}
+    return Array.from({ length: n + 1 }).reduce(() => gen.next().value, 0n);
+};
 /**
- * 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.
+ * Returns the first `length` Fibonacci numbers as a readonly BigInt array.
+ *
+ * Spreads an empty array of the requested size and maps each slot to the
+ * next generator value, delegating the recurrence to fibonacciGenerator for DRY.
+ * Returns a fresh array on every call so callers can safely consume the result.
+ *
+ * @param length - How many Fibonacci numbers to collect (non-negative integer)
+ * @returns A new readonly array of the first `length` Fibonacci numbers
+ * @throws {RangeError} When length is negative, fractional, NaN, or infinite
  * @example
  * ```typescript
  * fibonacciSequence(0);  // []
  * fibonacciSequence(5);  // [0n, 1n, 1n, 2n, 3n]
  * ```
  */
-export function fibonacciSequence(length) {
+export const fibonacciSequence = (length) => {
     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();
-    return Array.from({ length }, () => gen.next().value);
-}
+    return [...Array(length)].map(() => gen.next().value);
+};
 //# sourceMappingURL=fibonacci.js.map

package/dist/utils/fibonacci.js.map

@@ -1 +1 @@
-{"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"}
+{"version":3,"file":"fibonacci.js","sourceRoot":"","sources":["../../src/utils/fibonacci.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAM,SAAS,CAAC,CAAC,kBAAkB;IACjC,+GAA+G;IAC/G,IAAI,IAAI,GAA8B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/C,oFAAoF;IAEpF,SAAS,CAAC;QACR,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE;IAC7C,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,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,MAAM,CACzC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,EACtB,EAAE,CACH,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,MAAc,EAAqB,EAAE;IACrE,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,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC;AACxD,CAAC,CAAC"}

package/package.json

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

package/rails/copy-overwrite/.claude/skills/plan-add-test-coverage/SKILL.md

@@ -42,4 +42,4 @@ Configuration: .simplecov, update minimum_coverage to $ARGUMENTS%
 Verification: `bundle exec rspec` -> Expected: SimpleCov reports >= $ARGUMENTS% coverage
 ```
 
-Invoke `/plan-create` with this brief to create the implementation plan.
+Invoke `/plan-execute` with this brief to create the implementation plan.

package/rails/copy-overwrite/.claude/skills/plan-fix-linter-error/SKILL.md

@@ -42,4 +42,4 @@ Fix strategies: extract methods, reduce complexity, apply auto-correct where saf
 Verification: `bundle exec rubocop --format simple 2>&1 | grep -E "($ARGUMENTS)" | wc -l` -> Expected: 0
 ```
 
-Invoke `/plan-create` with this brief to create the implementation plan.
+Invoke `/plan-execute` with this brief to create the implementation plan.

package/rails/copy-overwrite/.claude/skills/plan-lower-code-complexity/SKILL.md

@@ -45,4 +45,4 @@ Refactoring strategies: extract methods, early returns, extract conditions, use
 Verification: `bundle exec rubocop --only Metrics/CyclomaticComplexity --format simple 2>&1 | grep "offense" | wc -l` -> Expected: 0
 ```
 
-Invoke `/plan-create` with this brief to create the implementation plan.
+Invoke `/plan-execute` with this brief to create the implementation plan.

package/rails/copy-overwrite/.claude/skills/plan-reduce-max-lines/SKILL.md

@@ -43,4 +43,4 @@ Refactoring strategies: extract concerns, extract service objects, remove duplic
 Verification: `bundle exec rubocop --only Metrics/ClassLength,Metrics/ModuleLength --format simple 2>&1 | grep "offense" | wc -l` -> Expected: 0
 ```
 
-Invoke `/plan-create` with this brief to create the implementation plan.
+Invoke `/plan-execute` with this brief to create the implementation plan.

package/rails/copy-overwrite/.claude/skills/plan-reduce-max-lines-per-function/SKILL.md

@@ -43,4 +43,4 @@ Refactoring strategies: extract methods, early returns, extract conditions, use
 Verification: `bundle exec rubocop --only Metrics/MethodLength --format simple 2>&1 | grep "offense" | wc -l` -> Expected: 0
 ```
 
-Invoke `/plan-create` with this brief to create the implementation plan.
+Invoke `/plan-execute` with this brief to create the implementation plan.

package/typescript/copy-contents/.husky/pre-push

@@ -85,11 +85,7 @@ elif [ "$PACKAGE_MANAGER" = "bun" ]; then
   # Parent packages pin ^4.4.1; fix requires major version 5.x (incompatible)
   # Risk: None - CLI build tool, not a production runtime dependency
 
-  # Excluding GHSA-43fc-jf86-j433: axios DoS via __proto__ key in mergeConfig
-  # Transitive dependency via aws-amplify > @aws-amplify/api-rest > axios
-  # bun overrides/resolutions cannot reach nested node_modules copies
-  # Risk: Low - only affects server-side mergeConfig with attacker-controlled input
-  if ! bun audit --audit-level=high --ignore GHSA-5j98-mcp5-4vw2 --ignore GHSA-8qq5-rm4j-mr97 --ignore GHSA-37qj-frw5-hhjh --ignore GHSA-43fc-jf86-j433; then
+  if ! bun audit --audit-level=high --ignore GHSA-5j98-mcp5-4vw2 --ignore GHSA-8qq5-rm4j-mr97 --ignore GHSA-37qj-frw5-hhjh; then
     echo "⚠️ Security audit failed. Please fix high/critical vulnerabilities before pushing."
     exit 1
   fi