@nicia-ai/typegraph 0.13.0 → 0.15.0

package/dist/index.d.cts

@@ -1,12 +1,12 @@
 import { z } from 'zod';
 import { N as NodeType, E as EdgeType } from './types-DMzKq0d5.cjs';
 export { A as AnyEdgeType, C as Cardinality, a as Collation, D as DeleteBehavior, b as EdgeId, c as EdgeProps, d as EdgeRegistration, e as EdgeTypeWithEndpoints, f as EndpointExistence, G as GraphDefaults, g as NodeId, h as NodeProps, i as NodeRegistration, S as SqlDialect, T as TemporalMode, U as UniqueConstraint, j as UniquenessScope, k as isEdgeType, l as isEdgeTypeWithEndpoints, m as isNodeType } from './types-DMzKq0d5.cjs';
-import { I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-GLkwvQvS.cjs';
-export { D as DEFAULT_SQL_SCHEMA, G as GraphBackend, a as MetaEdgeProperties, S as SqlSchema, b as SqlTableNames, T as TransactionBackend, c as createSqlSchema, i as isMetaEdge } from './types-GLkwvQvS.cjs';
-import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-Bmdt_dS6.cjs';
-export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, h as Edge, i as EdgeAccessor, j as EdgeCollection, k as EdgeFindByEndpointsOptions, l as EdgeGetOrCreateByEndpointsOptions, m as EdgeGetOrCreateByEndpointsResult, n as EmbeddingSchema, o as EmbeddingValue, p as ExecutableAggregateQuery, q as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, H as HookContext, I as IfExistsMode, N as Node, r as NodeAccessor, s as NodeAlias, t as NodeCollection, u as NodeGetOrCreateByConstraintOptions, v as NodeGetOrCreateByConstraintResult, w as NodeRef, O as OperationHookContext, P as PaginateOptions, x as PaginatedResult, y as Predicate, z as PreparedQuery, D as PropsAccessor, J as QueryHookContext, K as QueryOptions, R as RecursiveTraversalOptions, S as SelectContext, L as SelectableEdge, M as SelectableNode, U as Store, V as StoreHooks, W as StoreOptions, X as StreamOptions, Y as SubgraphOptions, Z as SubgraphResult, _ as SubsetEdge, $ as SubsetNode, a0 as TransactionContext, a1 as TypedEdgeCollection, a2 as UnionableQuery, a3 as UpdateEdgeInput, a4 as UpdateNodeInput, a5 as createStore, a6 as createStoreWithSchema, a7 as defineSubgraphProject, a8 as embedding, a9 as exists, aa as fieldRef, ab as getEmbeddingDimensions, ac as inSubquery, ad as isEmbeddingSchema, ae as isParameterRef, af as notExists, ag as notInSubquery, ah as param } from './store-Bmdt_dS6.cjs';
-import { G as GraphDef, K as KindRegistry } from './manager-DGSnJa1v.cjs';
-export { A as AllEdgeTypes, a as AllNodeTypes, E as EdgeKinds, b as GetEdgeType, c as GetNodeType, N as NodeKinds, d as defineGraph, g as getEdgeKinds, e as getNodeKinds, i as isGraphDef } from './manager-DGSnJa1v.cjs';
+import { I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-B3mmOMJV.cjs';
+export { D as DEFAULT_SQL_SCHEMA, G as GraphBackend, a as MetaEdgeProperties, S as SqlSchema, b as SqlTableNames, T as TransactionBackend, c as createSqlSchema, i as isMetaEdge } from './types-B3mmOMJV.cjs';
+import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-BNercm8P.cjs';
+export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, h as Edge, i as EdgeAccessor, j as EdgeCollection, k as EdgeFindByEndpointsOptions, l as EdgeGetOrCreateByEndpointsOptions, m as EdgeGetOrCreateByEndpointsResult, n as EmbeddingSchema, o as EmbeddingValue, p as ExecutableAggregateQuery, q as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, r as GraphEdgeCollections, s as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as Node, t as NodeAccessor, u as NodeAlias, v as NodeCollection, w as NodeGetOrCreateByConstraintOptions, x as NodeGetOrCreateByConstraintResult, y as NodeRef, O as OperationHookContext, P as PaginateOptions, z as PaginatedResult, D as Predicate, J as PreparedQuery, K as PropsAccessor, L as QueryHookContext, M as QueryOptions, R as RecursiveTraversalOptions, S as SelectContext, U as SelectableEdge, V as SelectableNode, W as Store, X as StoreHooks, Y as StoreOptions, Z as StoreProjection, _ as StreamOptions, $ as SubgraphOptions, a0 as SubgraphResult, a1 as SubsetEdge, a2 as SubsetNode, a3 as TransactionContext, a4 as TypedEdgeCollection, a5 as UnionableQuery, a6 as UpdateEdgeInput, a7 as UpdateNodeInput, a8 as createStore, a9 as createStoreWithSchema, aa as defineSubgraphProject, ab as embedding, ac as exists, ad as fieldRef, ae as getEmbeddingDimensions, af as inSubquery, ag as isEmbeddingSchema, ah as isParameterRef, ai as notExists, aj as notInSubquery, ak as param } from './store-BNercm8P.cjs';
+import { G as GraphDef, K as KindRegistry } from './manager-Bj1UEnhE.cjs';
+export { A as AllEdgeTypes, a as AllNodeTypes, E as EdgeKinds, b as GetEdgeType, c as GetNodeType, N as NodeKinds, S as SchemaManagerOptions, d as SchemaValidationResult, e as defineGraph, g as getEdgeKinds, f as getNodeKinds, i as isGraphDef } from './manager-Bj1UEnhE.cjs';
 export { C as CardinalityError, a as CompilerInvariantError, b as ConfigurationError, D as DatabaseOperationError, c as DisjointError, E as EdgeNotFoundError, d as EndpointError, e as EndpointNotFoundError, f as ErrorCategory, K as KindNotFoundError, M as MigrationError, N as NodeConstraintNotFoundError, g as NodeNotFoundError, R as RestrictedDeleteError, S as SchemaMismatchError, T as TypeGraphError, h as TypeGraphErrorOptions, U as UniquenessError, i as UnsupportedPredicateError, V as ValidationError, j as ValidationErrorDetails, k as ValidationIssue, l as VersionConflictError, m as getErrorSuggestion, n as isConstraintError, o as isSystemError, p as isTypeGraphError, q as isUserRecoverable } from './index-QTnQwakS.cjs';
 import { A as AggregateExpr, F as FieldRef, C as ComparisonOp, a as AggregateComparisonPredicate } from './ast-Bh2NDeaK.cjs';
 export { J as JsonPointer, b as JsonPointerFor, c as JsonPointerInput, d as JsonPointerSegment, e as JsonPointerSegments, f as JsonPointerSegmentsFor, M as MAX_JSON_POINTER_DEPTH, O as OrderSpec, P as ParameterRef, R as ResolveJsonPointer, g as ResolveJsonPointerSegments, S as SortDirection, T as TraversalExpansion, j as joinJsonPointers, h as jsonPointer, n as normalizeJsonPointer, p as parseJsonPointer } from './ast-Bh2NDeaK.cjs';
@@ -437,10 +437,13 @@ declare const core: {
 /**
  * Maximum depth for recursive CTE queries when maxDepth is unlimited (-1).
  *
- * This default limit prevents runaway recursion for unbounded traversals while
- * still supporting typical neighborhood/path use-cases.
+ * Graphs with branching factor B produce O(B^depth) rows before cycle
+ * detection can prune them. A default of 10 covers typical neighborhood,
+ * shortest-path, and hierarchy use-cases without risking exponential blowup
+ * on dense graphs. Users who need deeper traversals should call .maxHops(N)
+ * explicitly (up to MAX_EXPLICIT_RECURSIVE_DEPTH).
  */
-declare const MAX_RECURSIVE_DEPTH = 100;
+declare const MAX_RECURSIVE_DEPTH = 10;
 /**
  * Maximum depth for explicit maxDepth traversals.
  *

package/dist/index.d.ts

@@ -1,12 +1,12 @@
 import { z } from 'zod';
 import { N as NodeType, E as EdgeType } from './types-DMzKq0d5.js';
 export { A as AnyEdgeType, C as Cardinality, a as Collation, D as DeleteBehavior, b as EdgeId, c as EdgeProps, d as EdgeRegistration, e as EdgeTypeWithEndpoints, f as EndpointExistence, G as GraphDefaults, g as NodeId, h as NodeProps, i as NodeRegistration, S as SqlDialect, T as TemporalMode, U as UniqueConstraint, j as UniquenessScope, k as isEdgeType, l as isEdgeTypeWithEndpoints, m as isNodeType } from './types-DMzKq0d5.js';
-import { I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-1YJKodRv.js';
-export { D as DEFAULT_SQL_SCHEMA, G as GraphBackend, a as MetaEdgeProperties, S as SqlSchema, b as SqlTableNames, T as TransactionBackend, c as createSqlSchema, i as isMetaEdge } from './types-1YJKodRv.js';
-import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-6-vH0ZIj.js';
-export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, h as Edge, i as EdgeAccessor, j as EdgeCollection, k as EdgeFindByEndpointsOptions, l as EdgeGetOrCreateByEndpointsOptions, m as EdgeGetOrCreateByEndpointsResult, n as EmbeddingSchema, o as EmbeddingValue, p as ExecutableAggregateQuery, q as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, H as HookContext, I as IfExistsMode, N as Node, r as NodeAccessor, s as NodeAlias, t as NodeCollection, u as NodeGetOrCreateByConstraintOptions, v as NodeGetOrCreateByConstraintResult, w as NodeRef, O as OperationHookContext, P as PaginateOptions, x as PaginatedResult, y as Predicate, z as PreparedQuery, D as PropsAccessor, J as QueryHookContext, K as QueryOptions, R as RecursiveTraversalOptions, S as SelectContext, L as SelectableEdge, M as SelectableNode, U as Store, V as StoreHooks, W as StoreOptions, X as StreamOptions, Y as SubgraphOptions, Z as SubgraphResult, _ as SubsetEdge, $ as SubsetNode, a0 as TransactionContext, a1 as TypedEdgeCollection, a2 as UnionableQuery, a3 as UpdateEdgeInput, a4 as UpdateNodeInput, a5 as createStore, a6 as createStoreWithSchema, a7 as defineSubgraphProject, a8 as embedding, a9 as exists, aa as fieldRef, ab as getEmbeddingDimensions, ac as inSubquery, ad as isEmbeddingSchema, ae as isParameterRef, af as notExists, ag as notInSubquery, ah as param } from './store-6-vH0ZIj.js';
-import { G as GraphDef, K as KindRegistry } from './manager-BCLhWysp.js';
-export { A as AllEdgeTypes, a as AllNodeTypes, E as EdgeKinds, b as GetEdgeType, c as GetNodeType, N as NodeKinds, d as defineGraph, g as getEdgeKinds, e as getNodeKinds, i as isGraphDef } from './manager-BCLhWysp.js';
+import { I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-ThB4cFLp.js';
+export { D as DEFAULT_SQL_SCHEMA, G as GraphBackend, a as MetaEdgeProperties, S as SqlSchema, b as SqlTableNames, T as TransactionBackend, c as createSqlSchema, i as isMetaEdge } from './types-ThB4cFLp.js';
+import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-CD_0yf2s.js';
+export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, h as Edge, i as EdgeAccessor, j as EdgeCollection, k as EdgeFindByEndpointsOptions, l as EdgeGetOrCreateByEndpointsOptions, m as EdgeGetOrCreateByEndpointsResult, n as EmbeddingSchema, o as EmbeddingValue, p as ExecutableAggregateQuery, q as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, r as GraphEdgeCollections, s as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as Node, t as NodeAccessor, u as NodeAlias, v as NodeCollection, w as NodeGetOrCreateByConstraintOptions, x as NodeGetOrCreateByConstraintResult, y as NodeRef, O as OperationHookContext, P as PaginateOptions, z as PaginatedResult, D as Predicate, J as PreparedQuery, K as PropsAccessor, L as QueryHookContext, M as QueryOptions, R as RecursiveTraversalOptions, S as SelectContext, U as SelectableEdge, V as SelectableNode, W as Store, X as StoreHooks, Y as StoreOptions, Z as StoreProjection, _ as StreamOptions, $ as SubgraphOptions, a0 as SubgraphResult, a1 as SubsetEdge, a2 as SubsetNode, a3 as TransactionContext, a4 as TypedEdgeCollection, a5 as UnionableQuery, a6 as UpdateEdgeInput, a7 as UpdateNodeInput, a8 as createStore, a9 as createStoreWithSchema, aa as defineSubgraphProject, ab as embedding, ac as exists, ad as fieldRef, ae as getEmbeddingDimensions, af as inSubquery, ag as isEmbeddingSchema, ah as isParameterRef, ai as notExists, aj as notInSubquery, ak as param } from './store-CD_0yf2s.js';
+import { G as GraphDef, K as KindRegistry } from './manager-Chhrq1vl.js';
+export { A as AllEdgeTypes, a as AllNodeTypes, E as EdgeKinds, b as GetEdgeType, c as GetNodeType, N as NodeKinds, S as SchemaManagerOptions, d as SchemaValidationResult, e as defineGraph, g as getEdgeKinds, f as getNodeKinds, i as isGraphDef } from './manager-Chhrq1vl.js';
 export { C as CardinalityError, a as CompilerInvariantError, b as ConfigurationError, D as DatabaseOperationError, c as DisjointError, E as EdgeNotFoundError, d as EndpointError, e as EndpointNotFoundError, f as ErrorCategory, K as KindNotFoundError, M as MigrationError, N as NodeConstraintNotFoundError, g as NodeNotFoundError, R as RestrictedDeleteError, S as SchemaMismatchError, T as TypeGraphError, h as TypeGraphErrorOptions, U as UniquenessError, i as UnsupportedPredicateError, V as ValidationError, j as ValidationErrorDetails, k as ValidationIssue, l as VersionConflictError, m as getErrorSuggestion, n as isConstraintError, o as isSystemError, p as isTypeGraphError, q as isUserRecoverable } from './index-QTnQwakS.js';
 import { A as AggregateExpr, F as FieldRef, C as ComparisonOp, a as AggregateComparisonPredicate } from './ast-COMyNeMn.js';
 export { J as JsonPointer, b as JsonPointerFor, c as JsonPointerInput, d as JsonPointerSegment, e as JsonPointerSegments, f as JsonPointerSegmentsFor, M as MAX_JSON_POINTER_DEPTH, O as OrderSpec, P as ParameterRef, R as ResolveJsonPointer, g as ResolveJsonPointerSegments, S as SortDirection, T as TraversalExpansion, j as joinJsonPointers, h as jsonPointer, n as normalizeJsonPointer, p as parseJsonPointer } from './ast-COMyNeMn.js';
@@ -437,10 +437,13 @@ declare const core: {
 /**
  * Maximum depth for recursive CTE queries when maxDepth is unlimited (-1).
  *
- * This default limit prevents runaway recursion for unbounded traversals while
- * still supporting typical neighborhood/path use-cases.
+ * Graphs with branching factor B produce O(B^depth) rows before cycle
+ * detection can prune them. A default of 10 covers typical neighborhood,
+ * shortest-path, and hierarchy use-cases without risking exponential blowup
+ * on dense graphs. Users who need deeper traversals should call .maxHops(N)
+ * explicitly (up to MAX_EXPLICIT_RECURSIVE_DEPTH).
  */
-declare const MAX_RECURSIVE_DEPTH = 100;
+declare const MAX_RECURSIVE_DEPTH = 10;
 /**
  * Maximum depth for explicit maxDepth traversals.
  *