convex-supermemory 0.0.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (52) hide show
  1. package/LICENSE +201 -0
  2. package/README.md +306 -0
  3. package/dist/client/_generated/_ignore.d.ts +1 -0
  4. package/dist/client/_generated/_ignore.d.ts.map +1 -0
  5. package/dist/client/_generated/_ignore.js +3 -0
  6. package/dist/client/_generated/_ignore.js.map +1 -0
  7. package/dist/client/index.d.ts +188 -0
  8. package/dist/client/index.d.ts.map +1 -0
  9. package/dist/client/index.js +177 -0
  10. package/dist/client/index.js.map +1 -0
  11. package/dist/component/_generated/api.d.ts +34 -0
  12. package/dist/component/_generated/api.d.ts.map +1 -0
  13. package/dist/component/_generated/api.js +31 -0
  14. package/dist/component/_generated/api.js.map +1 -0
  15. package/dist/component/_generated/component.d.ts +152 -0
  16. package/dist/component/_generated/component.d.ts.map +1 -0
  17. package/dist/component/_generated/component.js +11 -0
  18. package/dist/component/_generated/component.js.map +1 -0
  19. package/dist/component/_generated/dataModel.d.ts +46 -0
  20. package/dist/component/_generated/dataModel.d.ts.map +1 -0
  21. package/dist/component/_generated/dataModel.js +11 -0
  22. package/dist/component/_generated/dataModel.js.map +1 -0
  23. package/dist/component/_generated/server.d.ts +133 -0
  24. package/dist/component/_generated/server.d.ts.map +1 -0
  25. package/dist/component/_generated/server.js +80 -0
  26. package/dist/component/_generated/server.js.map +1 -0
  27. package/dist/component/convex.config.d.ts +3 -0
  28. package/dist/component/convex.config.d.ts.map +1 -0
  29. package/dist/component/convex.config.js +4 -0
  30. package/dist/component/convex.config.js.map +1 -0
  31. package/dist/component/lib.d.ts +128 -0
  32. package/dist/component/lib.d.ts.map +1 -0
  33. package/dist/component/lib.js +196 -0
  34. package/dist/component/lib.js.map +1 -0
  35. package/dist/component/schema.d.ts +56 -0
  36. package/dist/component/schema.d.ts.map +1 -0
  37. package/dist/component/schema.js +33 -0
  38. package/dist/component/schema.js.map +1 -0
  39. package/package.json +106 -0
  40. package/src/client/_generated/_ignore.ts +1 -0
  41. package/src/client/index.ts +289 -0
  42. package/src/client/setup.test.ts +26 -0
  43. package/src/component/_generated/api.ts +50 -0
  44. package/src/component/_generated/component.ts +232 -0
  45. package/src/component/_generated/dataModel.ts +60 -0
  46. package/src/component/_generated/server.ts +169 -0
  47. package/src/component/convex.config.ts +5 -0
  48. package/src/component/lib.test.ts +127 -0
  49. package/src/component/lib.ts +224 -0
  50. package/src/component/schema.ts +43 -0
  51. package/src/component/setup.test.ts +11 -0
  52. package/src/test.ts +18 -0
package/LICENSE ADDED
@@ -0,0 +1,201 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ APPENDIX: How to apply the Apache License to your work.
179
+
180
+ To apply the Apache License to your work, attach the following
181
+ boilerplate notice, with the fields enclosed by brackets "[]"
182
+ replaced with your own identifying information. (Don't include
183
+ the brackets!) The text should be enclosed in the appropriate
184
+ comment syntax for the file format. We also recommend that a
185
+ file or class name and description of purpose be included on the
186
+ same "printed page" as the copyright notice for easier
187
+ identification within third-party archives.
188
+
189
+ Copyright [yyyy] [name of copyright owner]
190
+
191
+ Licensed under the Apache License, Version 2.0 (the "License");
192
+ you may not use this file except in compliance with the License.
193
+ You may obtain a copy of the License at
194
+
195
+ http://www.apache.org/licenses/LICENSE-2.0
196
+
197
+ Unless required by applicable law or agreed to in writing, software
198
+ distributed under the License is distributed on an "AS IS" BASIS,
199
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200
+ See the License for the specific language governing permissions and
201
+ limitations under the License.
package/README.md ADDED
@@ -0,0 +1,306 @@
1
+ # convex-supermemory
2
+
3
+ **Give your Convex app long-term, semantically searchable memory with Supermemory.** Reactive local memory and document state, direct REST integration.
4
+
5
+ [![npm version](https://img.shields.io/npm/v/convex-supermemory)](https://www.npmjs.com/package/convex-supermemory)
6
+ [![Convex Component](https://www.convex.dev/components/badge/sholajegede/convex-supermemory)](https://www.convex.dev/components/sholajegede/convex-supermemory)
7
+ [![npm downloads](https://img.shields.io/npm/dw/convex-supermemory)](https://www.npmjs.com/package/convex-supermemory)
8
+ [![License](https://img.shields.io/badge/license-Apache--2.0-blue)](./LICENSE)
9
+
10
+ ```ts
11
+ const supermemory = new Supermemory(components.convexSupermemory, {
12
+ apiKey: process.env.SUPERMEMORY_API_KEY!,
13
+ });
14
+
15
+ // Store a fact about a user
16
+ const { memoryId } = await supermemory.addMemory(ctx, {
17
+ containerTag: userId,
18
+ content: "Prefers dark mode and terse responses",
19
+ });
20
+
21
+ // Recall it later with semantic search
22
+ const { results } = await supermemory.search({
23
+ containerTag: userId,
24
+ query: "how does this user like responses formatted?",
25
+ });
26
+ ```
27
+
28
+ ## What this does
29
+
30
+ An AI agent is only as good as what it remembers between calls. [Supermemory](https://supermemory.ai) is a memory API purpose-built for this: you write facts and documents into a `containerTag` (typically one per user or agent), and it handles embedding, chunking, and semantic search so you can recall the right context later — without you running your own vector database.
31
+
32
+ This component wraps Supermemory's REST API directly (no SDK dependency) and mirrors everything you write into Convex tables, so you get:
33
+
34
+ - **Fast-path memory** — `addMemory()` stores a single fact immediately, no processing pipeline
35
+ - **Document ingestion** — `addDocument()` sends larger content through Supermemory's extraction/chunking pipeline, with `refreshDocument()` to poll status
36
+ - **Semantic search** — `search()` proxies Supermemory's hybrid RAG + memory search live
37
+ - **Reactive local state** — every memory and document is queryable from Convex without an extra API call
38
+ - **Forgetting** — `forgetMemory()` / `deleteDocument()` keep local state in sync with what Supermemory actually removes
39
+
40
+ ## Table of Contents
41
+
42
+ - [Install](#install)
43
+ - [Quick Start](#quick-start)
44
+ - [Usage](#usage)
45
+ - [Memories vs. Documents](#memories-vs-documents)
46
+ - [API Reference](#api-reference)
47
+ - [Type Reference](#type-reference)
48
+ - [Database Schema](#database-schema)
49
+ - [Container Tags](#container-tags)
50
+ - [Testing](#testing)
51
+ - [Example App](#example-app)
52
+ - [Limitations](#limitations)
53
+ - [Troubleshooting](#troubleshooting)
54
+ - [Contributing](#contributing)
55
+ - [Changelog](#changelog)
56
+
57
+ ## Install
58
+
59
+ ```bash
60
+ npm install convex-supermemory
61
+ ```
62
+
63
+ **Requirements:** Convex v1.33.1 or later, Node.js 18+, a [Supermemory](https://supermemory.ai) API key
64
+
65
+ ## Quick Start
66
+
67
+ Three steps to add memory to your Convex app.
68
+
69
+ ### 1. Add the component
70
+
71
+ In `convex/convex.config.ts`:
72
+
73
+ ```ts
74
+ import { defineApp } from "convex/server";
75
+ import convexSupermemory from "convex-supermemory/convex.config";
76
+
77
+ const app = defineApp();
78
+ app.use(convexSupermemory);
79
+
80
+ export default app;
81
+ ```
82
+
83
+ ### 2. Set environment variables
84
+
85
+ ```bash
86
+ npx convex env set SUPERMEMORY_API_KEY sm_xxxxxxxxxxxx
87
+ ```
88
+
89
+ ### 3. Initialize the client
90
+
91
+ In `convex/memory.ts`:
92
+
93
+ ```ts
94
+ import { components } from "./_generated/api";
95
+ import { Supermemory } from "convex-supermemory";
96
+
97
+ export const supermemory = new Supermemory(components.convexSupermemory, {
98
+ apiKey: process.env.SUPERMEMORY_API_KEY!,
99
+ });
100
+ ```
101
+
102
+ Import `supermemory` from this file in any Convex action that needs to read or write memory.
103
+
104
+ ## Usage
105
+
106
+ ### Remember a fact
107
+
108
+ ```ts
109
+ export const remember = action({
110
+ args: { userId: v.string(), fact: v.string() },
111
+ handler: async (ctx, args) => {
112
+ return await supermemory.addMemory(ctx, {
113
+ containerTag: args.userId,
114
+ content: args.fact,
115
+ isStatic: true, // long-term fact, not a fading conversational detail
116
+ });
117
+ },
118
+ });
119
+ // Returns: { memoryId }
120
+ ```
121
+
122
+ ### Recall with semantic search
123
+
124
+ ```ts
125
+ export const recall = action({
126
+ args: { userId: v.string(), query: v.string() },
127
+ handler: async (ctx, args) => {
128
+ return await supermemory.search({
129
+ containerTag: args.userId,
130
+ query: args.query,
131
+ limit: 5,
132
+ });
133
+ },
134
+ });
135
+ // Returns: { results: [{ documentId, score, summary, chunks, ... }], total }
136
+ ```
137
+
138
+ ### Forget a memory
139
+
140
+ `containerTag` is required here too — Supermemory scopes the delete by it, not just by `memoryId`.
141
+
142
+ ```ts
143
+ export const forget = action({
144
+ args: { userId: v.string(), memoryId: v.string() },
145
+ handler: async (ctx, args) => {
146
+ return await supermemory.forgetMemory(ctx, {
147
+ containerTag: args.userId,
148
+ memoryId: args.memoryId,
149
+ });
150
+ },
151
+ });
152
+ // Returns: { forgotten: boolean }
153
+ ```
154
+
155
+ ### List a user's memories reactively
156
+
157
+ ```ts
158
+ export const getMemories = query({
159
+ args: { userId: v.string() },
160
+ handler: async (ctx, args) => {
161
+ return await supermemory.listMemories(ctx, { containerTag: args.userId });
162
+ },
163
+ });
164
+ ```
165
+
166
+ ## Memories vs. Documents
167
+
168
+ Supermemory exposes two ways to write content, and this component exposes both:
169
+
170
+ - **`addMemory()`** — for short, discrete facts ("the user is on the Pro plan", "prefers metric units"). No processing delay; usable in search immediately.
171
+ - **`addDocument()`** — for longer content (a support transcript, a page of documentation, a whole conversation) that needs to be chunked and embedded. Processing is asynchronous — call `refreshDocument()` to check on `status` (`queued` → `extracting` → `chunking` → `embedding` → `indexing` → `done`).
172
+
173
+ ## API Reference
174
+
175
+ | Method | Kind | Description |
176
+ | --- | --- | --- |
177
+ | `addMemory(ctx, args)` | action | Stores a single fact immediately |
178
+ | `forgetMemory(ctx, args)` | action | Requests Supermemory forget a memory (scoped by `containerTag`) |
179
+ | `addDocument(ctx, args)` | action | Ingests larger content through the chunking pipeline |
180
+ | `refreshDocument(ctx, args)` | action | Pulls the latest status/title/summary for a document |
181
+ | `deleteDocument(ctx, args)` | action | Deletes a document from Supermemory and locally |
182
+ | `search(args)` | plain async | Live semantic search — not cached locally |
183
+ | `getMemory(ctx, args)` | query | Fetch one memory by id |
184
+ | `listMemories(ctx, args)` | query | List a container's memories, newest first |
185
+ | `getDocument(ctx, args)` | query | Fetch one document by id |
186
+ | `listDocuments(ctx, args)` | query | List a container's documents, newest first |
187
+ | `getStats(ctx)` | query | Aggregate memory/document counts for a small dashboard |
188
+ | `listRecentMemories(ctx, args?)` | query | Every memory, newest first, regardless of containerTag |
189
+ | `listRecentDocuments(ctx, args?)` | query | Every document, newest first, regardless of containerTag |
190
+
191
+ ## Type Reference
192
+
193
+ ```ts
194
+ type AddMemoryArgs = {
195
+ containerTag: string;
196
+ content: string;
197
+ isStatic?: boolean;
198
+ metadata?: Record<string, unknown>;
199
+ forgetAfter?: number; // ms epoch
200
+ forgetReason?: string;
201
+ };
202
+
203
+ type AddDocumentArgs = {
204
+ containerTag: string;
205
+ content: string;
206
+ customId?: string;
207
+ metadata?: Record<string, unknown>;
208
+ };
209
+
210
+ type SearchArgs = {
211
+ containerTag: string;
212
+ query: string;
213
+ limit?: number;
214
+ rerank?: boolean;
215
+ includeFullDocs?: boolean;
216
+ };
217
+
218
+ type SearchResponse = {
219
+ results: Array<{
220
+ documentId: string;
221
+ title: string | null;
222
+ score: number;
223
+ summary: string | null;
224
+ content: string | null;
225
+ chunks: Array<{ content: string; score: number; position: number; isRelevant: boolean }>;
226
+ }>;
227
+ total: number;
228
+ timing?: number; // ms, when Supermemory reports it
229
+ };
230
+ ```
231
+
232
+ ## Database Schema
233
+
234
+ ```ts
235
+ memories: {
236
+ memoryId, containerTag, content, isStatic, metadata?,
237
+ forgetAfter?, forgetReason?, forgotten,
238
+ createdAt, updatedAt,
239
+ }
240
+
241
+ documents: {
242
+ documentId, containerTag, content?, customId?, metadata?, status,
243
+ title?, summary?,
244
+ createdAt, updatedAt,
245
+ }
246
+ ```
247
+
248
+ `getStats()`, `listRecentMemories()`, and `listRecentDocuments()` read across these tables directly with a full scan — fine for a dashboard or history view, not intended as a high-volume production query path.
249
+
250
+ ## Container Tags
251
+
252
+ Supermemory scopes everything — writes, search, and profiles — by `containerTag`. Use one per user for personal memory, or one per agent/workspace for shared memory. Search only ever looks within the container tag you pass, so pick a convention early (this component doesn't enforce one).
253
+
254
+ ## Testing
255
+
256
+ ```bash
257
+ npm run test
258
+ ```
259
+
260
+ Component logic is tested with [`convex-test`](https://www.npmjs.com/package/convex-test) in `src/component/lib.test.ts`. Import `convex-supermemory/test` in your own app to register this component's schema against your test instance.
261
+
262
+ ## Example App
263
+
264
+ `example/` is a full Vite + React demo that exercises the entire component end to end against your own Supermemory account:
265
+
266
+ - **Memories** — add a fact with `addMemory()` (with suggestion chips to try), forget it with `forgetMemory()`, all reactive.
267
+ - **Documents** — ingest longer content with `addDocument()`, poll status with `refreshDocument()`, remove it with `deleteDocument()`.
268
+ - **Search** — run `search()` against whichever containerTag is selected, showing result score, matching chunks, and Supermemory's own reported `total`/`timing`.
269
+ - **containerTag switcher** — a row of chips lets you flip between a few demo users live, so you can see the exact same actions land in completely separate memory spaces.
270
+ - **History** — every memory and document ever written in the deployment, newest first, across every containerTag. Expand a row for full detail, or hit **Recreate live** to replay it as a brand-new memory/document.
271
+ - **Activity console** — a side-docked live log of every call this app makes into the Supermemory client, including real API errors (e.g. Supermemory returns `409` if you try to delete a document that's still processing).
272
+
273
+ Run it from the repo root:
274
+
275
+ ```bash
276
+ npm install --legacy-peer-deps
277
+ npx convex env set SUPERMEMORY_API_KEY sm_xxxxxxxxxxxx
278
+ npm run dev
279
+ ```
280
+
281
+ `npm run dev` starts the Convex backend and the Vite frontend together — there's no need to `cd example` or run either one separately.
282
+
283
+ ## Limitations
284
+
285
+ - `search()` always calls Supermemory live — results are not cached or mirrored into Convex tables, since they're a ranked view over the underlying memories/documents rather than durable records themselves.
286
+ - Document processing is asynchronous; this component does not poll for you. Call `refreshDocument()` on a schedule (e.g. a Convex cron or scheduled function) if you need status without a user-triggered refresh.
287
+ - `forgetMemory()` reflects whatever `forgotten` value Supermemory returns — if Supermemory forgets asynchronously, the local record may briefly still show `forgotten: false`.
288
+ - `deleteDocument()` throws if Supermemory reports the document is still processing (`409`) — retry after the document reaches a terminal status (`done`/`failed`).
289
+
290
+ ## Troubleshooting
291
+
292
+ **401/403 from Supermemory** — confirm `SUPERMEMORY_API_KEY` is set and starts with `sm_`.
293
+
294
+ **Search returns nothing** — confirm you're searching the same `containerTag` you wrote memories/documents into; container tags are exact-match scopes, not fuzzy. If the document was ingested moments ago, give it a few seconds to finish indexing even after `refreshDocument()` reports `done`.
295
+
296
+ **Document stuck in `queued`/`extracting`** — large documents can take longer to process; call `refreshDocument()` again after a short delay.
297
+
298
+ **Deleting a document fails with a "still processing" error** — Supermemory returns `409` for a document that hasn't reached a terminal status yet; wait for `refreshDocument()` to report `done` or `failed`, then delete.
299
+
300
+ ## Contributing
301
+
302
+ See [CONTRIBUTING.md](./CONTRIBUTING.md).
303
+
304
+ ## Changelog
305
+
306
+ See [CHANGELOG.md](./CHANGELOG.md).
@@ -0,0 +1 @@
1
+ //# sourceMappingURL=_ignore.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_ignore.d.ts","sourceRoot":"","sources":["../../../src/client/_generated/_ignore.ts"],"names":[],"mappings":""}
@@ -0,0 +1,3 @@
1
+ "use strict";
2
+ // This is only here so convex-test can detect a _generated folder
3
+ //# sourceMappingURL=_ignore.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_ignore.js","sourceRoot":"","sources":["../../../src/client/_generated/_ignore.ts"],"names":[],"mappings":";AAAA,kEAAkE"}