@lunora/advisor 1.0.0-alpha.3 → 1.0.0-alpha.30

package/dist/packem_shared/circularFk-B2freHrP.mjs

@@ -1,84 +0,0 @@
-import { e as emit } from './finding-Dm_zvzS1.mjs';
-
-const circularFk = {
-  categories: ["SCHEMA"],
-  description: "A chain of foreign-key relations forms a cycle (e.g. A → B → C → A). Circular FK dependencies can cause unexpected behavior during DELETE operations — a CASCADE chain may loop indefinitely, and even a RESTRICT cycle prevents deletion of any row in the loop without temporarily disabling constraints.",
-  facing: "INTERNAL",
-  level: "WARN",
-  name: "circular_fk",
-  remediation: "Remove or break the cycle by dropping at least one FK relation from the loop. Consider replacing the circular dependency with a nullable FK and explicit application logic, or restructure the schema using a junction table.",
-  run: (context) => {
-    const findings = [];
-    const edges = /* @__PURE__ */ new Map();
-    for (const table of context.schema.tables) {
-      for (const relation of table.relations) {
-        if (relation.kind !== "one") {
-          continue;
-        }
-        let targets = edges.get(table.name);
-        if (targets === void 0) {
-          targets = /* @__PURE__ */ new Set();
-          edges.set(table.name, targets);
-        }
-        targets.add(relation.table);
-      }
-    }
-    const onStack = /* @__PURE__ */ new Set();
-    const reported = /* @__PURE__ */ new Set();
-    const reportBackEdge = (neighbor, path) => {
-      const cycleStart = path.indexOf(neighbor);
-      if (cycleStart === -1) {
-        return;
-      }
-      const cycle = path.slice(cycleStart);
-      if (cycle.length < 2) {
-        return;
-      }
-      let minIndex = 0;
-      for (let index = 1; index < cycle.length; index += 1) {
-        if (cycle[index] < cycle[minIndex]) {
-          minIndex = index;
-        }
-      }
-      const canonical = [...cycle.slice(minIndex), ...cycle.slice(0, minIndex)];
-      const key = canonical.join("→");
-      if (reported.has(key)) {
-        return;
-      }
-      reported.add(key);
-      const displayPath = [...canonical, canonical[0]].join(" → ");
-      findings.push(
-        emit(circularFk, {
-          cacheKey: `circular_fk:${key}`,
-          detail: `Circular foreign-key dependency detected: ${displayPath}. This cycle can cause unexpected behavior during DELETE operations.`,
-          metadata: {
-            cycle: canonical,
-            path: displayPath,
-            tables: canonical
-          }
-        })
-      );
-    };
-    const dfs = (node, path) => {
-      onStack.add(node);
-      path.push(node);
-      for (const neighbor of edges.get(node) ?? []) {
-        if (onStack.has(neighbor)) {
-          reportBackEdge(neighbor, path);
-        } else {
-          dfs(neighbor, path);
-        }
-      }
-      path.pop();
-      onStack.delete(node);
-    };
-    for (const table of context.schema.tables) {
-      dfs(table.name, []);
-    }
-    return findings;
-  },
-  source: "static",
-  title: "Circular foreign-key dependency"
-};
-
-export { circularFk as default };

package/dist/packem_shared/helpers-DNCkMWZQ.mjs

@@ -1,4 +0,0 @@
-const SYSTEM_FIELDS = /* @__PURE__ */ new Set(["_creationTime", "_id"]);
-const tableColumnSet = (table) => /* @__PURE__ */ new Set([...SYSTEM_FIELDS, ...table.fields]);
-
-export { tableColumnSet as t };

package/dist/packem_shared/hotShard-Ir5D0B6J.mjs

@@ -1,48 +0,0 @@
-import { e as emit } from './finding-Dm_zvzS1.mjs';
-
-const HOT_SHARE_THRESHOLD = 0.5;
-const MIN_TOTAL_REQUESTS = 50;
-const hotShard = {
-  categories: ["PERFORMANCE"],
-  description: "One shard is taking a disproportionate share of a sharded function's traffic, so the busy shard becomes a single-DO bottleneck while its siblings sit idle — the hot-key skew sharding is meant to avoid.",
-  facing: "EXTERNAL",
-  level: "WARN",
-  name: "hot_shard",
-  remediation: "Re-shard on a higher-cardinality / more evenly-distributed key, or split the hot entity's state, so request volume spreads across shards instead of concentrating on one.",
-  run: (context) => {
-    const active = (context.shardTraffic ?? []).filter((shard) => shard.requests > 0);
-    const totalRequests = active.reduce((sum, shard) => sum + shard.requests, 0);
-    if (active.length < 2 || totalRequests < MIN_TOTAL_REQUESTS) {
-      return [];
-    }
-    const findings = [];
-    for (const shard of active) {
-      const share = shard.requests / totalRequests;
-      if (share < HOT_SHARE_THRESHOLD) {
-        continue;
-      }
-      const scope = shard.group !== void 0 && shard.group !== "" ? `"${shard.group}" ` : "";
-      const label = shard.shardKey === "" ? "the root shard" : `shard "${shard.shardKey}"`;
-      const percent = Math.round(share * 100);
-      findings.push(
-        emit(hotShard, {
-          cacheKey: `hot_shard:${shard.group ?? ""}:${shard.shardKey}`,
-          detail: `${scope}${label} handled ${shard.requests.toString()} of ${totalRequests.toString()} requests (${percent.toString()}%) across ${active.length.toString()} shards — a hot-key skew. Re-shard on a more evenly-distributed key.`,
-          metadata: {
-            group: shard.group,
-            requests: shard.requests,
-            shardCount: active.length,
-            shardKey: shard.shardKey,
-            share,
-            totalRequests
-          }
-        })
-      );
-    }
-    return findings;
-  },
-  source: "runtime",
-  title: "Hot shard"
-};
-
-export { hotShard as default };