@akanjs/common 0.9.41 → 0.9.43

package/Logger.d.ts

@@ -4,6 +4,7 @@ export declare class Logger {
     #private;
     static level: LogLevel;
     static setLevel(level: LogLevel): void;
+    static isVerbose(): boolean;
     name?: string;
     constructor(name?: string);
     trace(msg: string, context?: string): void;

package/applyMixins.d.ts

@@ -1,3 +1,3 @@
 type Type<T = any> = new (...args: any[]) => T;
-export declare const applyMixins: (derivedCtor: Type, constructors: (Type | undefined)[], avoidKeys?: Set<string>) => void;
+export declare const applyMixins: (derivedCtor: Type, constructors: (Type | undefined)[], avoidKeys?: Set<string>) => Type<any>;
 export {};

package/cjs/Logger.js

@@ -66,6 +66,9 @@ class Logger {
     this.level = level;
     this.#levelIdx = logLevels.findIndex((l) => l === level);
   }
+  static isVerbose() {
+    return this.#levelIdx <= 1;
+  }
   name;
   constructor(name) {
     this.name = name;

package/cjs/applyMixins.js

@@ -39,4 +39,5 @@ const applyMixins = (derivedCtor, constructors, avoidKeys) => {
       Object.defineProperty(derivedCtor.prototype, name, { ...descriptor, configurable: true });
     });
   });
+  return derivedCtor;
 };

package/cjs/getDependencyGraph.js

@@ -0,0 +1,90 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var getDependencyGraph_exports = {};
+__export(getDependencyGraph_exports, {
+  getDependencyGraph: () => getDependencyGraph
+});
+module.exports = __toCommonJS(getDependencyGraph_exports);
+const sortByDependencyLevels = (items) => {
+  const graph = /* @__PURE__ */ new Map();
+  const inDegree = /* @__PURE__ */ new Map();
+  const allKeys = /* @__PURE__ */ new Set();
+  for (const item of items) {
+    allKeys.add(item.key);
+    if (!graph.has(item.key))
+      graph.set(item.key, /* @__PURE__ */ new Set());
+    if (!inDegree.has(item.key))
+      inDegree.set(item.key, 0);
+    for (const dep of item.deps) {
+      const deps = graph.get(dep) ?? /* @__PURE__ */ new Set();
+      deps.add(item.key);
+      graph.set(dep, deps);
+      inDegree.set(item.key, (inDegree.get(item.key) ?? 0) + 1);
+    }
+  }
+  const queue = [];
+  const levels = [];
+  const visited = /* @__PURE__ */ new Set();
+  for (const [key, degree] of inDegree.entries()) {
+    if (degree === 0)
+      queue.push(key);
+  }
+  while (queue.length > 0) {
+    const currentLevel = [];
+    const queueSize = queue.length;
+    for (let i = 0; i < queueSize; i++) {
+      const node = queue.shift();
+      if (!node)
+        continue;
+      if (allKeys.has(node))
+        currentLevel.push(node);
+      visited.add(node);
+      const dependents = graph.get(node) ?? /* @__PURE__ */ new Set();
+      for (const dependent of dependents) {
+        const newDegree = (inDegree.get(dependent) ?? 0) - 1;
+        inDegree.set(dependent, newDegree);
+        if (newDegree === 0)
+          queue.push(dependent);
+      }
+    }
+    if (currentLevel.length > 0)
+      levels.push(currentLevel);
+  }
+  const missingDeps = [];
+  for (const item of items) {
+    for (const dep of item.deps) {
+      if (!allKeys.has(dep))
+        missingDeps.push(`${item.key} -> ${dep} (undefined)`);
+    }
+  }
+  if (missingDeps.length > 0)
+    throw new Error(`Missing dependencies: ${missingDeps.join(", ")}`);
+  if (visited.size < allKeys.size) {
+    const unvisited = Array.from(allKeys).filter((key) => !visited.has(key));
+    throw new Error(`Circular dependency detected involving: ${unvisited.join(", ")}`);
+  }
+  return levels;
+};
+const getDependencyGraph = (items) => {
+  const levels = sortByDependencyLevels(items);
+  const levelMap = /* @__PURE__ */ new Map();
+  levels.forEach((level, index) => {
+    level.forEach((key) => levelMap.set(key, index));
+  });
+  return { levels, levelMap };
+};

package/cjs/index.js

@@ -23,6 +23,7 @@ __export(common_exports, {
   deepObjectify: () => import_deepObjectify.deepObjectify,
   formatNumber: () => import_formatNumber.formatNumber,
   formatPhone: () => import_formatPhone.formatPhone,
+  getDependencyGraph: () => import_getDependencyGraph.getDependencyGraph,
   isDayjs: () => import_isDayjs.isDayjs,
   isEmail: () => import_isEmail.isEmail,
   isPhoneNumber: () => import_isPhoneNumber.isPhoneNumber,
@@ -61,3 +62,4 @@ var import_isEmail = require("./isEmail");
 var import_isPhoneNumber = require("./isPhoneNumber");
 var import_formatNumber = require("./formatNumber");
 var import_formatPhone = require("./formatPhone");
+var import_getDependencyGraph = require("./getDependencyGraph");

package/esm/Logger.js

@@ -34,6 +34,9 @@ class Logger {
     this.level = level;
     this.#levelIdx = logLevels.findIndex((l) => l === level);
   }
+  static isVerbose() {
+    return this.#levelIdx <= 1;
+  }
   name;
   constructor(name) {
     this.name = name;

package/esm/applyMixins.js

@@ -17,6 +17,7 @@ const applyMixins = (derivedCtor, constructors, avoidKeys) => {
       Object.defineProperty(derivedCtor.prototype, name, { ...descriptor, configurable: true });
     });
   });
+  return derivedCtor;
 };
 export {
   applyMixins

package/esm/getDependencyGraph.js

@@ -0,0 +1,71 @@
+const sortByDependencyLevels = (items) => {
+  const graph = /* @__PURE__ */ new Map();
+  const inDegree = /* @__PURE__ */ new Map();
+  const allKeys = /* @__PURE__ */ new Set();
+  for (const item of items) {
+    allKeys.add(item.key);
+    if (!graph.has(item.key))
+      graph.set(item.key, /* @__PURE__ */ new Set());
+    if (!inDegree.has(item.key))
+      inDegree.set(item.key, 0);
+    for (const dep of item.deps) {
+      const deps = graph.get(dep) ?? /* @__PURE__ */ new Set();
+      deps.add(item.key);
+      graph.set(dep, deps);
+      inDegree.set(item.key, (inDegree.get(item.key) ?? 0) + 1);
+    }
+  }
+  const queue = [];
+  const levels = [];
+  const visited = /* @__PURE__ */ new Set();
+  for (const [key, degree] of inDegree.entries()) {
+    if (degree === 0)
+      queue.push(key);
+  }
+  while (queue.length > 0) {
+    const currentLevel = [];
+    const queueSize = queue.length;
+    for (let i = 0; i < queueSize; i++) {
+      const node = queue.shift();
+      if (!node)
+        continue;
+      if (allKeys.has(node))
+        currentLevel.push(node);
+      visited.add(node);
+      const dependents = graph.get(node) ?? /* @__PURE__ */ new Set();
+      for (const dependent of dependents) {
+        const newDegree = (inDegree.get(dependent) ?? 0) - 1;
+        inDegree.set(dependent, newDegree);
+        if (newDegree === 0)
+          queue.push(dependent);
+      }
+    }
+    if (currentLevel.length > 0)
+      levels.push(currentLevel);
+  }
+  const missingDeps = [];
+  for (const item of items) {
+    for (const dep of item.deps) {
+      if (!allKeys.has(dep))
+        missingDeps.push(`${item.key} -> ${dep} (undefined)`);
+    }
+  }
+  if (missingDeps.length > 0)
+    throw new Error(`Missing dependencies: ${missingDeps.join(", ")}`);
+  if (visited.size < allKeys.size) {
+    const unvisited = Array.from(allKeys).filter((key) => !visited.has(key));
+    throw new Error(`Circular dependency detected involving: ${unvisited.join(", ")}`);
+  }
+  return levels;
+};
+const getDependencyGraph = (items) => {
+  const levels = sortByDependencyLevels(items);
+  const levelMap = /* @__PURE__ */ new Map();
+  levels.forEach((level, index) => {
+    level.forEach((key) => levelMap.set(key, index));
+  });
+  return { levels, levelMap };
+};
+export {
+  getDependencyGraph
+};

package/esm/index.js

@@ -19,6 +19,7 @@ import { isEmail } from "./isEmail";
 import { isPhoneNumber } from "./isPhoneNumber";
 import { formatNumber } from "./formatNumber";
 import { formatPhone } from "./formatPhone";
+import { getDependencyGraph } from "./getDependencyGraph";
 export {
   Logger,
   applyMixins,
@@ -26,6 +27,7 @@ export {
   deepObjectify,
   formatNumber,
   formatPhone,
+  getDependencyGraph,
   isDayjs,
   isEmail,
   isPhoneNumber,

package/getDependencyGraph.d.ts

@@ -0,0 +1,16 @@
+interface DependencyItem {
+    key: string;
+    deps: string[];
+}
+interface DependencyGraph {
+    levels: string[][];
+    levelMap: Map<string, number>;
+}
+/**
+ * Alternative: Returns a more detailed dependency graph with level information
+ */
+export declare const getDependencyGraph: (items: DependencyItem[]) => DependencyGraph;
+export {};
+/**
+ * Helper function to validate dependencies
+ */

package/index.d.ts

@@ -20,3 +20,4 @@ export { isEmail } from "./isEmail";
 export { isPhoneNumber } from "./isPhoneNumber";
 export { formatNumber } from "./formatNumber";
 export { formatPhone } from "./formatPhone";
+export { getDependencyGraph } from "./getDependencyGraph";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@akanjs/common",
-  "version": "0.9.41",
+  "version": "0.9.43",
   "sourceType": "module",
   "publishConfig": {
     "access": "public"