@nicia-ai/typegraph 0.20.0 → 0.22.0

package/dist/index.d.cts

@@ -1,15 +1,13 @@
 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-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-DRRvALu8.cjs';
-export { a as AggregateResult, b as AlgorithmCyclePolicy, c as AnyEdge, d as AnyNode, B as BaseTraversalOptions, e as BatchResults, f as BatchableQuery, g as ConstraintNames, h as CreateEdgeInput, i as CreateNodeInput, D as DegreeOptions, j as DynamicEdgeCollection, k as DynamicNodeCollection, l as Edge, m as EdgeAccessor, n as EdgeCollection, o as EdgeFindByEndpointsOptions, p as EdgeGetOrCreateByEndpointsOptions, q as EdgeGetOrCreateByEndpointsResult, r as EmbeddingSchema, s as EmbeddingValue, t as ExecutableAggregateQuery, u as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, v as GraphAlgorithms, w as GraphEdgeCollections, x as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as NeighborsOptions, y as Node, z as NodeAccessor, J as NodeAlias, K as NodeCollection, L as NodeGetOrCreateByConstraintOptions, M as NodeGetOrCreateByConstraintResult, O as NodeIdentifier, P as NodeRef, R as OperationHookContext, S as PaginateOptions, U as PaginatedResult, V as PathNode, W as Predicate, X as PreparedQuery, Y as PropsAccessor, Z as QueryHookContext, _ as QueryOptions, $ as ReachableNode, a0 as ReachableOptions, a1 as RecursiveTraversalOptions, a2 as SelectContext, a3 as SelectableEdge, a4 as SelectableNode, a5 as ShortestPathOptions, a6 as ShortestPathResult, a7 as Store, a8 as StoreHooks, a9 as StoreOptions, aa as StoreProjection, ab as StreamOptions, ac as SubgraphEdgeResult, ad as SubgraphNodeResult, ae as SubgraphOptions, af as SubgraphResult, ag as SubsetEdge, ah as SubsetNode, ai as TemporalAlgorithmOptions, aj as TransactionContext, ak as TraversalDirection, al as TypedEdgeCollection, am as UnionableQuery, an as UpdateEdgeInput, ao as UpdateNodeInput, ap as createStore, aq as createStoreWithSchema, ar as defineSubgraphProject, as as embedding, at as exists, au as fieldRef, av as getEmbeddingDimensions, aw as inSubquery, ax as isEmbeddingSchema, ay as isParameterRef, az as notExists, aA as notInSubquery, aB as param } from './store-DRRvALu8.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';
+import { N as NodeType, E as EdgeType, I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-CQF88McG.cjs';
+export { A as AnyEdgeType, B as BackendCapabilities, C as Cardinality, a as Collation, D as DEFAULT_SQL_SCHEMA, b as DeleteBehavior, c as DeleteFulltextBatchParams, d as EdgeId, e as EdgeProps, f as EdgeRegistration, g as EdgeTypeWithEndpoints, h as EndpointExistence, F as FulltextBatchRow, i as FulltextCapabilities, j as FulltextQueryMode, k as FulltextSearchParams, l as FulltextSearchResult, m as FulltextStrategy, G as GraphBackend, n as GraphDefaults, o as MetaEdgeProperties, p as NodeId, q as NodeProps, r as NodeRegistration, S as SqlDialect, s as SqlSchema, t as SqlTableNames, T as TemporalMode, u as TransactionBackend, U as UniqueConstraint, v as UniquenessScope, w as UpsertFulltextBatchParams, V as VectorCapabilities, x as createSqlSchema, y as fts5Strategy, z as isEdgeType, H as isEdgeTypeWithEndpoints, J as isMetaEdge, K as isNodeType, L as tsvectorStrategy } from './types-CQF88McG.cjs';
+import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-2QW2SIRk.cjs';
+export { a as AggregateResult, b as AlgorithmCyclePolicy, c as AnyEdge, d as AnyNode, B as BaseTraversalOptions, e as BatchResults, f as BatchableQuery, g as ConstraintNames, h as CreateEdgeInput, i as CreateNodeInput, D as DEFAULT_SEARCHABLE_LANGUAGE, j as DegreeOptions, k as DynamicEdgeCollection, l as DynamicNodeCollection, m as Edge, n as EdgeAccessor, o as EdgeCollection, p as EdgeFindByEndpointsOptions, q as EdgeGetOrCreateByEndpointsOptions, r as EdgeGetOrCreateByEndpointsResult, s as EmbeddingSchema, t as EmbeddingValue, u as ExecutableAggregateQuery, v as ExecutableQuery, F as FieldAccessor, w as FulltextSearchHit, x as FulltextSearchOptions, G as GetOrCreateAction, y as GraphAlgorithms, z as GraphEdgeCollections, H as GraphNodeCollections, I as HookContext, J as HybridFulltextOptions, K as HybridSearchHit, L as HybridSearchOptions, M as HybridVectorOptions, N as IfExistsMode, O as NeighborsOptions, P as Node, R as NodeAccessor, S as NodeAlias, U as NodeCollection, V as NodeGetOrCreateByConstraintOptions, W as NodeGetOrCreateByConstraintResult, X as NodeIdentifier, Y as NodeRef, Z as OperationHookContext, _ as PaginateOptions, $ as PaginatedResult, a0 as PathNode, a1 as Predicate, a2 as PreparedQuery, a3 as PropsAccessor, a4 as QueryHookContext, a5 as QueryOptions, a6 as ReachableNode, a7 as ReachableOptions, a8 as RebuildFulltextOptions, a9 as RebuildFulltextResult, aa as RecursiveTraversalOptions, ab as SearchableMetadata, ac as SearchableOptions, ad as SearchableSchema, ae as SelectContext, af as SelectableEdge, ag as SelectableNode, ah as ShortestPathOptions, ai as ShortestPathResult, aj as Store, ak as StoreHooks, al as StoreOptions, am as StoreProjection, an as StoreSearch, ao as StreamOptions, ap as SubgraphEdgeResult, aq as SubgraphNodeResult, ar as SubgraphOptions, as as SubgraphResult, at as SubsetEdge, au as SubsetNode, av as TemporalAlgorithmOptions, aw as TransactionContext, ax as TraversalDirection, ay as TypedEdgeCollection, az as UnionableQuery, aA as UpdateEdgeInput, aB as UpdateNodeInput, aC as VectorSearchHit, aD as createStore, aE as createStoreWithSchema, aF as defineSubgraphProject, aG as embedding, aH as exists, aI as fieldRef, aJ as getEmbeddingDimensions, aK as getSearchableMetadata, aL as inSubquery, aM as isEmbeddingSchema, aN as isParameterRef, aO as isSearchableSchema, aP as notExists, aQ as notInSubquery, aR as param, aS as searchable } from './store-2QW2SIRk.cjs';
+import { G as GraphDef, K as KindRegistry } from './manager-BPK-2PUI.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-BPK-2PUI.cjs';
 export { B as BackendDisposedError, 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-DXkEXpNz.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';
+import { A as AggregateExpr, F as FieldRef, C as ComparisonOp, a as AggregateComparisonPredicate } from './ast-DogwbBqA.cjs';
+export { H as HybridFusionOptions, 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-DogwbBqA.cjs';
 import 'drizzle-orm';
 
 /**
@@ -482,6 +480,50 @@ declare function count(alias: string, field?: string): AggregateExpr;
  * @param field - Optional field to count distinct values of
  */
 declare function countDistinct(alias: string, field?: string): AggregateExpr;
+/**
+ * Creates a COUNT aggregate expression over an edge alias.
+ *
+ * Counts edges directly, without joining back to the target node table.
+ * This has different semantics from `count(targetAlias)`:
+ *
+ * - `countEdges(edgeAlias)` — counts live edges, regardless of target-node
+ *   temporal state. If a target node's `validTo` is in the past while its
+ *   incident edges are still live, those edges are still counted.
+ * - `count(targetAlias)` — counts edges whose target node is currently
+ *   valid under the query's temporal mode.
+ *
+ * For the common case ("how many follow relationships does this user
+ * have?") the edge-count semantics is what you want, and the compiler
+ * can skip the target-node join entirely — measurably faster on
+ * full-graph aggregates where the join dominates cost.
+ *
+ * @example
+ * ```typescript
+ * store
+ *   .query()
+ *   .from("User", "u")
+ *   .optionalTraverse("follows", "e", { expand: "none" })
+ *   .to("User", "target")
+ *   .groupByNode("u")
+ *   .aggregate({
+ *     name: field("u", "name"),
+ *     // counts edges — skips the target-node join
+ *     followCount: countEdges("e"),
+ *   })
+ *   .execute();
+ * ```
+ */
+declare function countEdges(edgeAlias: string): AggregateExpr;
+/**
+ * Creates a COUNT DISTINCT aggregate expression over an edge alias.
+ * See {@link countEdges} for semantics.
+ *
+ * Distinct-on-edge-id is equivalent to `countEdges` when the query
+ * surface produces each edge exactly once, but stays meaningful under
+ * polymorphic expansions and ontology-driven edge fan-outs where the
+ * same edge can appear multiple times in the join output.
+ */
+declare function countDistinctEdges(edgeAlias: string): AggregateExpr;
 /**
  * Creates a SUM aggregate expression.
  *
@@ -724,4 +766,4 @@ type IdConfig = Readonly<{
     edgeIdGenerator: IdGenerator;
 }>;
 
-export { AliasMap, type DefineEdgeOptions, type DefineNodeOptions, EdgeType, type ExternalRefSchema, type ExternalRefValue, FieldRef, type FlexibleQueryFragment, GraphDef, type IdConfig, type IdGenerator, InferenceType, MAX_EXPLICIT_RECURSIVE_DEPTH, MAX_RECURSIVE_DEPTH, MetaEdge, type MetaEdgeOptions, NodeType, OntologyRelation, QueryBuilder, type QueryFragment, type TraversalFragment, avg, broader, composeFragments, core, count, countDistinct, createExternalRef, createFragment, createQueryBuilder, defineEdge, defineNode, differentFrom, disjointWith, equivalentTo, externalRef, field, generateId, getExternalRefTable, hasPart, having, havingEq, havingGt, havingGte, havingLt, havingLte, implies, inverseOf, isExternalRefSchema, limitFragment, max, metaEdge, min, narrower, offsetFragment, orderByFragment, partOf, relatedTo, sameAs, subClassOf, sum };
+export { AliasMap, type DefineEdgeOptions, type DefineNodeOptions, EdgeType, type ExternalRefSchema, type ExternalRefValue, FieldRef, type FlexibleQueryFragment, GraphDef, type IdConfig, type IdGenerator, InferenceType, MAX_EXPLICIT_RECURSIVE_DEPTH, MAX_RECURSIVE_DEPTH, MetaEdge, type MetaEdgeOptions, NodeType, OntologyRelation, QueryBuilder, type QueryFragment, type TraversalFragment, avg, broader, composeFragments, core, count, countDistinct, countDistinctEdges, countEdges, createExternalRef, createFragment, createQueryBuilder, defineEdge, defineNode, differentFrom, disjointWith, equivalentTo, externalRef, field, generateId, getExternalRefTable, hasPart, having, havingEq, havingGt, havingGte, havingLt, havingLte, implies, inverseOf, isExternalRefSchema, limitFragment, max, metaEdge, min, narrower, offsetFragment, orderByFragment, partOf, relatedTo, sameAs, subClassOf, sum };

package/dist/index.d.ts

@@ -1,15 +1,13 @@
 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-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-BMrRi_mY.js';
-export { a as AggregateResult, b as AlgorithmCyclePolicy, c as AnyEdge, d as AnyNode, B as BaseTraversalOptions, e as BatchResults, f as BatchableQuery, g as ConstraintNames, h as CreateEdgeInput, i as CreateNodeInput, D as DegreeOptions, j as DynamicEdgeCollection, k as DynamicNodeCollection, l as Edge, m as EdgeAccessor, n as EdgeCollection, o as EdgeFindByEndpointsOptions, p as EdgeGetOrCreateByEndpointsOptions, q as EdgeGetOrCreateByEndpointsResult, r as EmbeddingSchema, s as EmbeddingValue, t as ExecutableAggregateQuery, u as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, v as GraphAlgorithms, w as GraphEdgeCollections, x as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as NeighborsOptions, y as Node, z as NodeAccessor, J as NodeAlias, K as NodeCollection, L as NodeGetOrCreateByConstraintOptions, M as NodeGetOrCreateByConstraintResult, O as NodeIdentifier, P as NodeRef, R as OperationHookContext, S as PaginateOptions, U as PaginatedResult, V as PathNode, W as Predicate, X as PreparedQuery, Y as PropsAccessor, Z as QueryHookContext, _ as QueryOptions, $ as ReachableNode, a0 as ReachableOptions, a1 as RecursiveTraversalOptions, a2 as SelectContext, a3 as SelectableEdge, a4 as SelectableNode, a5 as ShortestPathOptions, a6 as ShortestPathResult, a7 as Store, a8 as StoreHooks, a9 as StoreOptions, aa as StoreProjection, ab as StreamOptions, ac as SubgraphEdgeResult, ad as SubgraphNodeResult, ae as SubgraphOptions, af as SubgraphResult, ag as SubsetEdge, ah as SubsetNode, ai as TemporalAlgorithmOptions, aj as TransactionContext, ak as TraversalDirection, al as TypedEdgeCollection, am as UnionableQuery, an as UpdateEdgeInput, ao as UpdateNodeInput, ap as createStore, aq as createStoreWithSchema, ar as defineSubgraphProject, as as embedding, at as exists, au as fieldRef, av as getEmbeddingDimensions, aw as inSubquery, ax as isEmbeddingSchema, ay as isParameterRef, az as notExists, aA as notInSubquery, aB as param } from './store-BMrRi_mY.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';
+import { N as NodeType, E as EdgeType, I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-CQF88McG.js';
+export { A as AnyEdgeType, B as BackendCapabilities, C as Cardinality, a as Collation, D as DEFAULT_SQL_SCHEMA, b as DeleteBehavior, c as DeleteFulltextBatchParams, d as EdgeId, e as EdgeProps, f as EdgeRegistration, g as EdgeTypeWithEndpoints, h as EndpointExistence, F as FulltextBatchRow, i as FulltextCapabilities, j as FulltextQueryMode, k as FulltextSearchParams, l as FulltextSearchResult, m as FulltextStrategy, G as GraphBackend, n as GraphDefaults, o as MetaEdgeProperties, p as NodeId, q as NodeProps, r as NodeRegistration, S as SqlDialect, s as SqlSchema, t as SqlTableNames, T as TemporalMode, u as TransactionBackend, U as UniqueConstraint, v as UniquenessScope, w as UpsertFulltextBatchParams, V as VectorCapabilities, x as createSqlSchema, y as fts5Strategy, z as isEdgeType, H as isEdgeTypeWithEndpoints, J as isMetaEdge, K as isNodeType, L as tsvectorStrategy } from './types-CQF88McG.js';
+import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-C0q13mtJ.js';
+export { a as AggregateResult, b as AlgorithmCyclePolicy, c as AnyEdge, d as AnyNode, B as BaseTraversalOptions, e as BatchResults, f as BatchableQuery, g as ConstraintNames, h as CreateEdgeInput, i as CreateNodeInput, D as DEFAULT_SEARCHABLE_LANGUAGE, j as DegreeOptions, k as DynamicEdgeCollection, l as DynamicNodeCollection, m as Edge, n as EdgeAccessor, o as EdgeCollection, p as EdgeFindByEndpointsOptions, q as EdgeGetOrCreateByEndpointsOptions, r as EdgeGetOrCreateByEndpointsResult, s as EmbeddingSchema, t as EmbeddingValue, u as ExecutableAggregateQuery, v as ExecutableQuery, F as FieldAccessor, w as FulltextSearchHit, x as FulltextSearchOptions, G as GetOrCreateAction, y as GraphAlgorithms, z as GraphEdgeCollections, H as GraphNodeCollections, I as HookContext, J as HybridFulltextOptions, K as HybridSearchHit, L as HybridSearchOptions, M as HybridVectorOptions, N as IfExistsMode, O as NeighborsOptions, P as Node, R as NodeAccessor, S as NodeAlias, U as NodeCollection, V as NodeGetOrCreateByConstraintOptions, W as NodeGetOrCreateByConstraintResult, X as NodeIdentifier, Y as NodeRef, Z as OperationHookContext, _ as PaginateOptions, $ as PaginatedResult, a0 as PathNode, a1 as Predicate, a2 as PreparedQuery, a3 as PropsAccessor, a4 as QueryHookContext, a5 as QueryOptions, a6 as ReachableNode, a7 as ReachableOptions, a8 as RebuildFulltextOptions, a9 as RebuildFulltextResult, aa as RecursiveTraversalOptions, ab as SearchableMetadata, ac as SearchableOptions, ad as SearchableSchema, ae as SelectContext, af as SelectableEdge, ag as SelectableNode, ah as ShortestPathOptions, ai as ShortestPathResult, aj as Store, ak as StoreHooks, al as StoreOptions, am as StoreProjection, an as StoreSearch, ao as StreamOptions, ap as SubgraphEdgeResult, aq as SubgraphNodeResult, ar as SubgraphOptions, as as SubgraphResult, at as SubsetEdge, au as SubsetNode, av as TemporalAlgorithmOptions, aw as TransactionContext, ax as TraversalDirection, ay as TypedEdgeCollection, az as UnionableQuery, aA as UpdateEdgeInput, aB as UpdateNodeInput, aC as VectorSearchHit, aD as createStore, aE as createStoreWithSchema, aF as defineSubgraphProject, aG as embedding, aH as exists, aI as fieldRef, aJ as getEmbeddingDimensions, aK as getSearchableMetadata, aL as inSubquery, aM as isEmbeddingSchema, aN as isParameterRef, aO as isSearchableSchema, aP as notExists, aQ as notInSubquery, aR as param, aS as searchable } from './store-C0q13mtJ.js';
+import { G as GraphDef, K as KindRegistry } from './manager-0jVZtiE8.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-0jVZtiE8.js';
 export { B as BackendDisposedError, 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-DXkEXpNz.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';
+import { A as AggregateExpr, F as FieldRef, C as ComparisonOp, a as AggregateComparisonPredicate } from './ast-CSLbPIOC.js';
+export { H as HybridFusionOptions, 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-CSLbPIOC.js';
 import 'drizzle-orm';
 
 /**
@@ -482,6 +480,50 @@ declare function count(alias: string, field?: string): AggregateExpr;
  * @param field - Optional field to count distinct values of
  */
 declare function countDistinct(alias: string, field?: string): AggregateExpr;
+/**
+ * Creates a COUNT aggregate expression over an edge alias.
+ *
+ * Counts edges directly, without joining back to the target node table.
+ * This has different semantics from `count(targetAlias)`:
+ *
+ * - `countEdges(edgeAlias)` — counts live edges, regardless of target-node
+ *   temporal state. If a target node's `validTo` is in the past while its
+ *   incident edges are still live, those edges are still counted.
+ * - `count(targetAlias)` — counts edges whose target node is currently
+ *   valid under the query's temporal mode.
+ *
+ * For the common case ("how many follow relationships does this user
+ * have?") the edge-count semantics is what you want, and the compiler
+ * can skip the target-node join entirely — measurably faster on
+ * full-graph aggregates where the join dominates cost.
+ *
+ * @example
+ * ```typescript
+ * store
+ *   .query()
+ *   .from("User", "u")
+ *   .optionalTraverse("follows", "e", { expand: "none" })
+ *   .to("User", "target")
+ *   .groupByNode("u")
+ *   .aggregate({
+ *     name: field("u", "name"),
+ *     // counts edges — skips the target-node join
+ *     followCount: countEdges("e"),
+ *   })
+ *   .execute();
+ * ```
+ */
+declare function countEdges(edgeAlias: string): AggregateExpr;
+/**
+ * Creates a COUNT DISTINCT aggregate expression over an edge alias.
+ * See {@link countEdges} for semantics.
+ *
+ * Distinct-on-edge-id is equivalent to `countEdges` when the query
+ * surface produces each edge exactly once, but stays meaningful under
+ * polymorphic expansions and ontology-driven edge fan-outs where the
+ * same edge can appear multiple times in the join output.
+ */
+declare function countDistinctEdges(edgeAlias: string): AggregateExpr;
 /**
  * Creates a SUM aggregate expression.
  *
@@ -724,4 +766,4 @@ type IdConfig = Readonly<{
     edgeIdGenerator: IdGenerator;
 }>;
 
-export { AliasMap, type DefineEdgeOptions, type DefineNodeOptions, EdgeType, type ExternalRefSchema, type ExternalRefValue, FieldRef, type FlexibleQueryFragment, GraphDef, type IdConfig, type IdGenerator, InferenceType, MAX_EXPLICIT_RECURSIVE_DEPTH, MAX_RECURSIVE_DEPTH, MetaEdge, type MetaEdgeOptions, NodeType, OntologyRelation, QueryBuilder, type QueryFragment, type TraversalFragment, avg, broader, composeFragments, core, count, countDistinct, createExternalRef, createFragment, createQueryBuilder, defineEdge, defineNode, differentFrom, disjointWith, equivalentTo, externalRef, field, generateId, getExternalRefTable, hasPart, having, havingEq, havingGt, havingGte, havingLt, havingLte, implies, inverseOf, isExternalRefSchema, limitFragment, max, metaEdge, min, narrower, offsetFragment, orderByFragment, partOf, relatedTo, sameAs, subClassOf, sum };
+export { AliasMap, type DefineEdgeOptions, type DefineNodeOptions, EdgeType, type ExternalRefSchema, type ExternalRefValue, FieldRef, type FlexibleQueryFragment, GraphDef, type IdConfig, type IdGenerator, InferenceType, MAX_EXPLICIT_RECURSIVE_DEPTH, MAX_RECURSIVE_DEPTH, MetaEdge, type MetaEdgeOptions, NodeType, OntologyRelation, QueryBuilder, type QueryFragment, type TraversalFragment, avg, broader, composeFragments, core, count, countDistinct, countDistinctEdges, countEdges, createExternalRef, createFragment, createQueryBuilder, defineEdge, defineNode, differentFrom, disjointWith, equivalentTo, externalRef, field, generateId, getExternalRefTable, hasPart, having, havingEq, havingGt, havingGte, havingLt, havingLte, implies, inverseOf, isExternalRefSchema, limitFragment, max, metaEdge, min, narrower, offsetFragment, orderByFragment, partOf, relatedTo, sameAs, subClassOf, sum };