@grafema/api 0.2.5-beta

package/LICENSE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to the Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2026 Vadim Reshetnikov
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,219 @@
+# @grafema/api
+
+GraphQL API server for Grafema code analysis toolkit.
+
+## Overview
+
+This package provides a GraphQL endpoint on top of Grafema's graph database. It enables external tools, IDE extensions, and AI agents to query the code graph through a standard, self-documenting protocol.
+
+**Key features:**
+- Cursor-based pagination (Relay Connection spec)
+- DataLoader pattern for N+1 query prevention
+- GraphiQL IDE for interactive exploration
+- Datalog query passthrough for advanced use cases
+
+## Prerequisites
+
+- RFDB server must be running (`grafema server start`)
+- Project must be analyzed (`grafema analyze`)
+
+## Usage
+
+### Via CLI
+
+```bash
+# Start GraphQL server (requires RFDB server running)
+grafema server graphql --port 4000
+
+# GraphiQL IDE available at http://localhost:4000/graphql
+```
+
+### Programmatic
+
+```typescript
+import { createGraphQLServer, startServer } from '@grafema/api';
+import { RFDBServerBackend } from '@grafema/core';
+
+// Connect to RFDB
+const backend = new RFDBServerBackend({ socketPath: '/tmp/grafema.sock' });
+await backend.connect();
+
+// Start server
+const server = startServer({
+  backend,
+  port: 4000,
+  hostname: 'localhost',
+});
+```
+
+## GraphQL Schema
+
+### Queries
+
+#### Node Lookups
+
+```graphql
+# Get single node by ID
+node(id: ID!): Node
+
+# Find nodes with filtering and pagination
+nodes(filter: NodeFilter, first: Int, after: String): NodeConnection!
+```
+
+#### Graph Traversal
+
+```graphql
+# BFS/DFS traversal
+bfs(startIds: [ID!]!, maxDepth: Int!, edgeTypes: [String!]!): [ID!]!
+dfs(startIds: [ID!]!, maxDepth: Int!, edgeTypes: [String!]): [ID!]!
+
+# Check if path exists between nodes
+reachability(from: ID!, to: ID!, edgeTypes: [String!], maxDepth: Int): Boolean!
+```
+
+#### Datalog Queries
+
+```graphql
+# Execute Datalog query
+datalog(query: String!, limit: Int, offset: Int): DatalogResult!
+```
+
+#### High-Level Queries
+
+```graphql
+findCalls(target: String!, className: String, limit: Int): [CallInfo!]!
+getFunctionDetails(name: String!, file: String): FunctionDetails
+findGuards(nodeId: ID!): [GuardInfo!]!
+traceAlias(variableName: String!, file: String!): [Node!]!
+traceDataFlow(source: String!, direction: TraversalDirection): [[String!]!]!
+```
+
+#### Statistics
+
+```graphql
+stats: GraphStats!
+analysisStatus: AnalysisStatus!
+```
+
+### Mutations
+
+```graphql
+# Run analysis
+analyzeProject(service: String, force: Boolean): AnalysisResult!
+
+# Guarantee management
+checkGuarantees(names: [String!]): GuaranteeCheckResult!
+checkInvariant(rule: String!, description: String): GuaranteeResult!
+```
+
+## Example Queries
+
+### Get all functions
+
+```graphql
+query {
+  nodes(filter: { type: "FUNCTION" }, first: 10) {
+    edges {
+      node {
+        id
+        name
+        file
+        line
+      }
+    }
+    pageInfo {
+      hasNextPage
+      endCursor
+    }
+    totalCount
+  }
+}
+```
+
+### Find async functions using Datalog
+
+```graphql
+query {
+  datalog(query: """
+    violation(X) :-
+      node(X, "FUNCTION"),
+      attr(X, "async", true).
+  """) {
+    count
+    results {
+      node {
+        name
+        file
+      }
+    }
+  }
+}
+```
+
+### Check reachability
+
+```graphql
+query {
+  reachability(
+    from: "MODULE:src/index.ts"
+    to: "FUNCTION:src/utils.ts->helper"
+    edgeTypes: ["CALLS", "IMPORTS"]
+    maxDepth: 5
+  )
+}
+```
+
+### Get graph statistics
+
+```graphql
+query {
+  stats {
+    nodeCount
+    edgeCount
+    nodesByType
+  }
+}
+```
+
+## Pagination
+
+All collection queries use cursor-based pagination following the Relay Connection spec:
+
+```graphql
+query {
+  nodes(filter: { type: "CALL" }, first: 20, after: "Y3Vyc29yOm5vZGUtMTA=") {
+    edges {
+      node { id name }
+      cursor
+    }
+    pageInfo {
+      hasNextPage
+      hasPreviousPage
+      startCursor
+      endCursor
+    }
+    totalCount
+  }
+}
+```
+
+**Limits:**
+- Default: 50 items
+- Maximum: 250 items per request
+
+## Configuration
+
+```typescript
+interface GraphQLServerOptions {
+  backend: RFDBServerBackend;  // Required: graph backend
+  port?: number;               // Default: 4000
+  hostname?: string;           // Default: 'localhost'
+  maxDepth?: number;           // Default: 10 (query depth limit)
+  maxComplexity?: number;      // Default: 1000 (query cost limit)
+  timeout?: number;            // Default: 30000ms
+}
+```
+
+## License
+
+Apache-2.0

package/dist/context.d.ts

@@ -0,0 +1,22 @@
+/**
+ * GraphQL Context
+ *
+ * Request-scoped context containing backend connection and DataLoaders.
+ */
+import type { IncomingMessage } from 'node:http';
+import type { RFDBServerBackend } from '@grafema/core';
+import { type DataLoaders } from './dataloaders/index.js';
+export interface GraphQLContext {
+    /** Graph backend connection */
+    backend: RFDBServerBackend;
+    /** DataLoaders for batching (per-request) */
+    loaders: DataLoaders;
+    /** Request start time for timeout tracking */
+    startTime: number;
+}
+/**
+ * Create context for a GraphQL request.
+ * Creates fresh DataLoaders to ensure no cross-request caching.
+ */
+export declare function createContext(backend: RFDBServerBackend, _req: IncomingMessage): GraphQLContext;
+//# sourceMappingURL=context.d.ts.map

package/dist/context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.d.ts","sourceRoot":"","sources":["../src/context.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAqB,KAAK,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAE7E,MAAM,WAAW,cAAc;IAC7B,+BAA+B;IAC/B,OAAO,EAAE,iBAAiB,CAAC;IAC3B,6CAA6C;IAC7C,OAAO,EAAE,WAAW,CAAC;IACrB,8CAA8C;IAC9C,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,iBAAiB,EAC1B,IAAI,EAAE,eAAe,GACpB,cAAc,CAMhB"}

package/dist/context.js

@@ -0,0 +1,18 @@
+/**
+ * GraphQL Context
+ *
+ * Request-scoped context containing backend connection and DataLoaders.
+ */
+import { createDataLoaders } from './dataloaders/index.js';
+/**
+ * Create context for a GraphQL request.
+ * Creates fresh DataLoaders to ensure no cross-request caching.
+ */
+export function createContext(backend, _req) {
+    return {
+        backend,
+        loaders: createDataLoaders(backend),
+        startTime: Date.now(),
+    };
+}
+//# sourceMappingURL=context.js.map

package/dist/context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context.js","sourceRoot":"","sources":["../src/context.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAE,iBAAiB,EAAoB,MAAM,wBAAwB,CAAC;AAW7E;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,OAA0B,EAC1B,IAAqB;IAErB,OAAO;QACL,OAAO;QACP,OAAO,EAAE,iBAAiB,CAAC,OAAO,CAAC;QACnC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;KACtB,CAAC;AACJ,CAAC"}

package/dist/dataloaders/index.d.ts

@@ -0,0 +1,18 @@
+/**
+ * DataLoader Factory
+ *
+ * Creates all DataLoaders for a request context.
+ * DataLoaders batch and cache database requests within a single GraphQL request.
+ */
+import type { RFDBServerBackend } from '@grafema/core';
+import { createNodeLoader } from './nodeLoader.js';
+export interface DataLoaders {
+    /** Batch node lookups by ID */
+    node: ReturnType<typeof createNodeLoader>;
+}
+/**
+ * Create all DataLoaders for a request.
+ * DataLoaders are per-request to prevent cross-request caching issues.
+ */
+export declare function createDataLoaders(backend: RFDBServerBackend): DataLoaders;
+//# sourceMappingURL=index.d.ts.map

package/dist/dataloaders/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/dataloaders/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD,MAAM,WAAW,WAAW;IAC1B,+BAA+B;IAC/B,IAAI,EAAE,UAAU,CAAC,OAAO,gBAAgB,CAAC,CAAC;CAC3C;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,iBAAiB,GAAG,WAAW,CAIzE"}

package/dist/dataloaders/index.js

@@ -0,0 +1,17 @@
+/**
+ * DataLoader Factory
+ *
+ * Creates all DataLoaders for a request context.
+ * DataLoaders batch and cache database requests within a single GraphQL request.
+ */
+import { createNodeLoader } from './nodeLoader.js';
+/**
+ * Create all DataLoaders for a request.
+ * DataLoaders are per-request to prevent cross-request caching issues.
+ */
+export function createDataLoaders(backend) {
+    return {
+        node: createNodeLoader(backend),
+    };
+}
+//# sourceMappingURL=index.js.map

package/dist/dataloaders/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/dataloaders/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAOnD;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAA0B;IAC1D,OAAO;QACL,IAAI,EAAE,gBAAgB,CAAC,OAAO,CAAC;KAChC,CAAC;AACJ,CAAC"}

package/dist/dataloaders/nodeLoader.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Node DataLoader
+ *
+ * Batches multiple getNode() calls into efficient parallel lookups.
+ * Critical for preventing N+1 queries in GraphQL.
+ */
+import DataLoader from 'dataloader';
+import type { BaseNodeRecord } from '@grafema/types';
+import type { RFDBServerBackend } from '@grafema/core';
+/**
+ * Create a DataLoader for batching node lookups.
+ *
+ * The loader batches all node ID requests made within a single tick
+ * and resolves them with parallel backend calls.
+ *
+ * Complexity: O(n) where n = unique node IDs requested
+ */
+export declare function createNodeLoader(backend: RFDBServerBackend): DataLoader<string, BaseNodeRecord | null>;
+//# sourceMappingURL=nodeLoader.d.ts.map

package/dist/dataloaders/nodeLoader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeLoader.d.ts","sourceRoot":"","sources":["../../src/dataloaders/nodeLoader.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,UAAU,MAAM,YAAY,CAAC;AACpC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAEvD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,iBAAiB,GACzB,UAAU,CAAC,MAAM,EAAE,cAAc,GAAG,IAAI,CAAC,CAmB3C"}

package/dist/dataloaders/nodeLoader.js

@@ -0,0 +1,31 @@
+/**
+ * Node DataLoader
+ *
+ * Batches multiple getNode() calls into efficient parallel lookups.
+ * Critical for preventing N+1 queries in GraphQL.
+ */
+import DataLoader from 'dataloader';
+/**
+ * Create a DataLoader for batching node lookups.
+ *
+ * The loader batches all node ID requests made within a single tick
+ * and resolves them with parallel backend calls.
+ *
+ * Complexity: O(n) where n = unique node IDs requested
+ */
+export function createNodeLoader(backend) {
+    return new DataLoader(async (ids) => {
+        // Parallelize individual lookups
+        // Future optimization: add batch getNodes() to RFDB protocol
+        const results = await Promise.all(ids.map((id) => backend.getNode(id).catch(() => null)));
+        return results;
+    }, {
+        // Cache results within this request
+        cache: true,
+        // Use identity function for cache key
+        cacheKeyFn: (id) => id,
+        // Max batch size to prevent overwhelming backend
+        maxBatchSize: 100,
+    });
+}
+//# sourceMappingURL=nodeLoader.js.map

package/dist/dataloaders/nodeLoader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodeLoader.js","sourceRoot":"","sources":["../../src/dataloaders/nodeLoader.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,UAAU,MAAM,YAAY,CAAC;AAIpC;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC9B,OAA0B;IAE1B,OAAO,IAAI,UAAU,CACnB,KAAK,EAAE,GAAsB,EAAE,EAAE;QAC/B,iCAAiC;QACjC,6DAA6D;QAC7D,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CACvD,CAAC;QACF,OAAO,OAAO,CAAC;IACjB,CAAC,EACD;QACE,oCAAoC;QACpC,KAAK,EAAE,IAAI;QACX,sCAAsC;QACtC,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE;QACtB,iDAAiD;QACjD,YAAY,EAAE,GAAG;KAClB,CACF,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * @grafema/api - GraphQL API for Grafema code graph
+ *
+ * Provides a GraphQL endpoint for querying the code graph.
+ * Supports cursor-based pagination, subscriptions for streaming,
+ * and Datalog query passthrough.
+ */
+export { createGraphQLServer, startServer } from './server.js';
+export type { GraphQLServerOptions } from './server.js';
+export type { GraphQLContext } from './context.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC/D,YAAY,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACxD,YAAY,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC"}

package/dist/index.js

@@ -0,0 +1,9 @@
+/**
+ * @grafema/api - GraphQL API for Grafema code graph
+ *
+ * Provides a GraphQL endpoint for querying the code graph.
+ * Supports cursor-based pagination, subscriptions for streaming,
+ * and Datalog query passthrough.
+ */
+export { createGraphQLServer, startServer } from './server.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,mBAAmB,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}

package/dist/pagination.d.ts

@@ -0,0 +1,50 @@
+/**
+ * Cursor-based Pagination Utilities
+ *
+ * Implements Relay Connection spec for cursor-based pagination.
+ */
+/**
+ * Encode a cursor from an ID.
+ * Format: base64("cursor:${id}")
+ */
+export declare function encodeCursor(id: string): string;
+/**
+ * Decode a cursor to get the ID.
+ * Returns null if cursor is invalid.
+ */
+export declare function decodeCursor(cursor: string): string | null;
+/**
+ * PageInfo structure per Relay spec.
+ */
+export interface PageInfo {
+    hasNextPage: boolean;
+    hasPreviousPage: boolean;
+    startCursor: string | null;
+    endCursor: string | null;
+}
+/**
+ * Edge structure for connections.
+ */
+export interface Edge<T> {
+    node: T;
+    cursor: string;
+}
+/**
+ * Connection structure per Relay spec.
+ */
+export interface Connection<T> {
+    edges: Edge<T>[];
+    pageInfo: PageInfo;
+    totalCount: number;
+}
+/**
+ * Apply cursor-based pagination to an array.
+ *
+ * @param items - All items (already filtered)
+ * @param first - Number of items to return (default: 50, max: 250)
+ * @param after - Cursor to start after
+ * @param getId - Function to get ID from item for cursor encoding
+ * @returns Connection structure
+ */
+export declare function paginateArray<T>(items: T[], first: number | null | undefined, after: string | null | undefined, getId: (item: T) => string): Connection<T>;
+//# sourceMappingURL=pagination.d.ts.map

package/dist/pagination.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagination.d.ts","sourceRoot":"","sources":["../src/pagination.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;;GAGG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAE/C;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAU1D;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,WAAW,EAAE,OAAO,CAAC;IACrB,eAAe,EAAE,OAAO,CAAC;IACzB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,IAAI,CAAC,CAAC;IACrB,IAAI,EAAE,CAAC,CAAC;IACR,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAChC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAChC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GACzB,UAAU,CAAC,CAAC,CAAC,CAqCf"}