@omfalos/mokosh 0.1.6 → 0.1.8

package/dist/index.d.mts

@@ -1014,7 +1014,9 @@ interface NodeQuery {
     maxImports?: number;
     minSize?: number;
     maxSize?: number;
-    sort?: "size" | "imports" | "commitCount90d" | "exportUsage";
+    sort?: "size" | "imports" | "commitCount90d" | "exportUsage" | "complexity" | "cognitiveComplexity";
+    /** Sort direction for `sort`. Defaults to `"desc"`, matching the pre-existing always-descending behavior. */
+    sortDir?: "asc" | "desc";
     limit?: number;
     hasDocstring?: boolean;
     /** Minimum line-coverage percentage; nodes below this value are excluded. Nodes with no coverage data are excluded. */
@@ -1025,6 +1027,26 @@ interface NodeQuery {
     minExportUsage?: number;
     /** Maximum avgExportUsage (0–1); nodes above this value are excluded. Nodes with no data are treated as 0. */
     maxExportUsage?: number;
+    /** Minimum McCabe cyclomatic complexity. Nodes with no complexity data (non-TS/JS files) are excluded. */
+    minComplexity?: number;
+    /** Maximum McCabe cyclomatic complexity. Nodes with no complexity data are treated as 0. */
+    maxComplexity?: number;
+    /** Minimum cognitive complexity. Nodes with no complexity data (non-TS/JS files) are excluded. */
+    minCognitiveComplexity?: number;
+    /** Maximum cognitive complexity. Nodes with no complexity data are treated as 0. */
+    maxCognitiveComplexity?: number;
+    /** Minimum commitCount90d. Nodes with no git-stats data are excluded. */
+    minCommits?: number;
+    /** Maximum commitCount90d. Nodes with no git-stats data are treated as 0. */
+    maxCommits?: number;
+    /** true = node has at least one markdown doc referencing it (documentedBy non-empty); false = undocumented nodes only. */
+    isDocumented?: boolean;
+    /** true = node is flagged as doc-stale (staleFor non-empty); false = non-stale nodes only. */
+    isStale?: boolean;
+    /** Exact match on FileNode.lastAuthor. Prefix with "!" to negate. Nodes with no author data fail the positive form and pass the negative form. */
+    lastAuthor?: string;
+    /** OR-group: node matches if it satisfies ANY sub-query in this array, ANDed with all other top-level fields on this NodeQuery. Populated by `any(key:val|key:val)` syntax in query strings. */
+    any?: NodeQuery[];
 }
 
 /** Filters a graph by applying NodeQuery predicates: category, type, tag, path, imports, coverage, and more. */
@@ -1045,6 +1067,8 @@ declare function filterGraph(graph: SerializedGraph, query: NodeQuery): Serializ
  * @description Parses a `"key:value,key:value"` query string into a structured `NodeQuery`.
  *   String values support `"!"` prefix for negation. The `tag`/`tags` key may appear multiple
  *   times; values are OR-matched (negated entries act as exclusions). `tag:a+b` maps to `allTags`.
+ *   A token of the form `any(key:val|key:val)` is parsed as an OR-group of single-key clauses
+ *   and accumulates into `query.any`, ANDed with every other top-level key in the string.
  * @param {string} queryString - Comma-separated `key:value` pairs, e.g. `"category:logic,tag:auth"`.
  * @returns {NodeQuery} The structured query object ready for use with `filterGraph` or `matchNode`.
  */

package/dist/index.d.ts

@@ -1014,7 +1014,9 @@ interface NodeQuery {
     maxImports?: number;
     minSize?: number;
     maxSize?: number;
-    sort?: "size" | "imports" | "commitCount90d" | "exportUsage";
+    sort?: "size" | "imports" | "commitCount90d" | "exportUsage" | "complexity" | "cognitiveComplexity";
+    /** Sort direction for `sort`. Defaults to `"desc"`, matching the pre-existing always-descending behavior. */
+    sortDir?: "asc" | "desc";
     limit?: number;
     hasDocstring?: boolean;
     /** Minimum line-coverage percentage; nodes below this value are excluded. Nodes with no coverage data are excluded. */
@@ -1025,6 +1027,26 @@ interface NodeQuery {
     minExportUsage?: number;
     /** Maximum avgExportUsage (0–1); nodes above this value are excluded. Nodes with no data are treated as 0. */
     maxExportUsage?: number;
+    /** Minimum McCabe cyclomatic complexity. Nodes with no complexity data (non-TS/JS files) are excluded. */
+    minComplexity?: number;
+    /** Maximum McCabe cyclomatic complexity. Nodes with no complexity data are treated as 0. */
+    maxComplexity?: number;
+    /** Minimum cognitive complexity. Nodes with no complexity data (non-TS/JS files) are excluded. */
+    minCognitiveComplexity?: number;
+    /** Maximum cognitive complexity. Nodes with no complexity data are treated as 0. */
+    maxCognitiveComplexity?: number;
+    /** Minimum commitCount90d. Nodes with no git-stats data are excluded. */
+    minCommits?: number;
+    /** Maximum commitCount90d. Nodes with no git-stats data are treated as 0. */
+    maxCommits?: number;
+    /** true = node has at least one markdown doc referencing it (documentedBy non-empty); false = undocumented nodes only. */
+    isDocumented?: boolean;
+    /** true = node is flagged as doc-stale (staleFor non-empty); false = non-stale nodes only. */
+    isStale?: boolean;
+    /** Exact match on FileNode.lastAuthor. Prefix with "!" to negate. Nodes with no author data fail the positive form and pass the negative form. */
+    lastAuthor?: string;
+    /** OR-group: node matches if it satisfies ANY sub-query in this array, ANDed with all other top-level fields on this NodeQuery. Populated by `any(key:val|key:val)` syntax in query strings. */
+    any?: NodeQuery[];
 }
 
 /** Filters a graph by applying NodeQuery predicates: category, type, tag, path, imports, coverage, and more. */
@@ -1045,6 +1067,8 @@ declare function filterGraph(graph: SerializedGraph, query: NodeQuery): Serializ
  * @description Parses a `"key:value,key:value"` query string into a structured `NodeQuery`.
  *   String values support `"!"` prefix for negation. The `tag`/`tags` key may appear multiple
  *   times; values are OR-matched (negated entries act as exclusions). `tag:a+b` maps to `allTags`.
+ *   A token of the form `any(key:val|key:val)` is parsed as an OR-group of single-key clauses
+ *   and accumulates into `query.any`, ANDed with every other top-level key in the string.
  * @param {string} queryString - Comma-separated `key:value` pairs, e.g. `"category:logic,tag:auth"`.
  * @returns {NodeQuery} The structured query object ready for use with `filterGraph` or `matchNode`.
  */