@sharkdyt/omni-memory-mcp 1.0.0

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 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 Support. 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 2025 Allan Schramm
+
+   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 @@
+# Omni Memory MCP
+
+Universal memory MCP server for multi-agent workflows.  
+100% local with SQLite + FTS5.
+
+## Why this exists
+
+- Keep AI memory local (no cloud dependency)
+- Reuse the same memory across tools/agents
+- Search fast with SQLite FTS5
+
+## Features
+
+- Local-first storage (SQLite)
+- Full-text search with FTS5
+- MCP-native tools
+- CRUD operations (`memory_add`, `memory_get`, `memory_update`, `memory_delete`, `memory_list`, `memory_search`)
+- Organization by `area`, `project`, and `tags`
+
+## Quick Start (Most Newbie Friendly)
+
+You do **not** need to set a path to `dist/index.js` if you use `npx`.
+
+Use this in your MCP client config:
+
+```json
+{
+  "mcpServers": {
+    "omni-memory": {
+      "command": "npx",
+      "args": ["-y", "@sharkdyt/omni-memory-mcp"],
+      "env": {
+        "OMNI_MEMORY_DIR": "~/.omni-memory"
+      }
+    }
+  }
+}
+```
+
+This is the easiest setup because:
+- No manual clone path
+- No manual build path
+- Works after npm registry publish
+
+## Path Guide (Relative vs Absolute)
+
+If you prefer running from local source (`dist/index.js`), use an **absolute path**.
+
+- Relative path example (can break): `./dist/index.js`
+- Absolute path example (recommended): full path to file on disk
+
+Why relative paths break:
+- Many MCP clients resolve paths from their own process working directory, not from your config file directory.
+
+### Absolute path examples
+
+Linux:
+
+```json
+{
+  "command": "node",
+  "args": ["/home/your-user/.local/mcp/omni-memory-mcp/dist/index.js"]
+}
+```
+
+macOS:
+
+```json
+{
+  "command": "node",
+  "args": ["/Users/your-user/.local/mcp/omni-memory-mcp/dist/index.js"]
+}
+```
+
+Windows:
+
+```json
+{
+  "command": "node",
+  "args": ["C:\\Users\\your-user\\.local\\mcp\\omni-memory-mcp\\dist\\index.js"]
+}
+```
+
+Note:
+- `~` is convenient, but not every client expands it consistently on Windows. Absolute paths are safer.
+
+## Install from Source (Local Dev)
+
+```bash
+git clone https://github.com/allanschramm/omni-memory-mcp.git
+cd omni-memory-mcp
+npm install
+npm run build
+```
+
+Then configure your MCP client with `node` + absolute path to `dist/index.js`.
+
+## Tools
+
+### `memory_add`
+
+```json
+{
+  "content": "User prefers TypeScript with strict mode",
+  "area": "preferences",
+  "project": "my-project",
+  "tags": ["typescript", "coding-style"]
+}
+```
+
+### `memory_get`
+
+```json
+{
+  "id": "abc123"
+}
+```
+
+### `memory_update`
+
+```json
+{
+  "id": "abc123",
+  "content": "Updated content",
+  "tags": ["new-tag"]
+}
+```
+
+### `memory_delete`
+
+```json
+{
+  "id": "abc123"
+}
+```
+
+### `memory_list`
+
+```json
+{
+  "area": "snippets",
+  "project": "my-project",
+  "tag": "important",
+  "limit": 20
+}
+```
+
+### `memory_search`
+
+```json
+{
+  "query": "typescript configuration",
+  "project": "my-project",
+  "limit": 10
+}
+```
+
+## Memory Areas
+
+| Area | Description |
+| --- | --- |
+| `general` | General notes |
+| `snippets` | Code snippets and patterns |
+| `solutions` | Problem-solution pairs |
+| `preferences` | User/team preferences |
+
+## Data Storage
+
+Default directory:
+
+```text
+~/.omni-memory/
+|- omni-memory.db
+|- omni-memory.db-wal
+`- omni-memory.db-shm
+```
+
+Environment variables:
+
+| Variable | Default | Description |
+| --- | --- | --- |
+| `OMNI_MEMORY_DIR` | `~/.omni-memory` | Data storage directory |
+| `OMNI_MEMORY_DB` | `{OMNI_MEMORY_DIR}/omni-memory.db` | SQLite DB file path |
+
+## Development
+
+```bash
+npm install
+npm run check
+npm run build
+npm test
+```
+
+Extra commands:
+
+```bash
+npm run dev    # watch mode
+npm run start  # run server from dist/
+```
+
+## Publish to npm
+
+Checklist:
+
+```bash
+npm whoami
+npm run check
+npm test
+npm pack
+npm publish --access public
+```
+
+Notes:
+- Package name is scoped: `@sharkdyt/omni-memory-mcp`
+- `publishConfig.access=public` is already configured in `package.json`
+
+## License
+
+Apache 2.0. See `LICENSE`.

package/dist/database.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Omni Memory MCP - Database Module
+ * SQLite + FTS5 for local memory storage and full-text search
+ */
+import type { Memory, AddMemoryArgs, UpdateMemoryArgs, ListMemoryArgs, SearchMemoryArgs, SearchResult } from "./types.js";
+declare function normalizeUserPath(inputPath: string): string;
+declare function resolveStoragePaths(): {
+    dataDir: string;
+    dbPath: string;
+};
+export declare function addMemory(args: AddMemoryArgs): {
+    id: string;
+};
+export declare function getMemory(id: string): Memory | null;
+export declare function updateMemory(args: UpdateMemoryArgs): {
+    changes: number;
+};
+export declare function deleteMemory(id: string): {
+    changes: number;
+};
+export declare function listMemories(args: ListMemoryArgs): Memory[];
+export declare function searchMemories(args: SearchMemoryArgs): SearchResult[];
+export declare function closeDatabase(): void;
+export { resolveStoragePaths, normalizeUserPath };
+export declare function resetDatabase(): void;
+//# sourceMappingURL=database.d.ts.map

package/dist/database.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"database.d.ts","sourceRoot":"","sources":["../src/database.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,OAAO,KAAK,EACV,MAAM,EAEN,aAAa,EACb,gBAAgB,EAChB,cAAc,EACd,gBAAgB,EAChB,YAAY,EACb,MAAM,YAAY,CAAC;AAcpB,iBAAS,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CASpD;AAED,iBAAS,mBAAmB,IAAI;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAQlE;AAuFD,wBAAgB,SAAS,CAAC,IAAI,EAAE,aAAa,GAAG;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,CAe7D;AAED,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAMnD;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,gBAAgB,GAAG;IAAE,OAAO,EAAE,MAAM,CAAA;CAAE,CAwBxE;AAED,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG;IAAE,OAAO,EAAE,MAAM,CAAA;CAAE,CAM5D;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,EAAE,CA6B3D;AAED,wBAAgB,cAAc,CAAC,IAAI,EAAE,gBAAgB,GAAG,YAAY,EAAE,CA8CrE;AA+BD,wBAAgB,aAAa,IAAI,IAAI,CAKpC;AAED,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,CAAC;AAGlD,wBAAgB,aAAa,IAAI,IAAI,CASpC"}

package/dist/database.js

@@ -0,0 +1,257 @@
+/**
+ * Omni Memory MCP - Database Module
+ * SQLite + FTS5 for local memory storage and full-text search
+ */
+import Database from "better-sqlite3";
+import { v4 as uuidv4 } from "uuid";
+import { join, dirname, isAbsolute, resolve, normalize } from "path";
+import { mkdirSync, existsSync } from "fs";
+import { homedir } from "os";
+function expandHomePath(inputPath) {
+    if (inputPath === "~") {
+        return homedir();
+    }
+    if (inputPath.startsWith("~/") || inputPath.startsWith("~\\")) {
+        return join(homedir(), inputPath.slice(2));
+    }
+    return inputPath;
+}
+function normalizeUserPath(inputPath) {
+    const trimmedPath = inputPath.trim();
+    const expandedPath = expandHomePath(trimmedPath);
+    if (isAbsolute(expandedPath)) {
+        return normalize(expandedPath);
+    }
+    return normalize(resolve(process.cwd(), expandedPath));
+}
+function resolveStoragePaths() {
+    const defaultDir = join(homedir(), ".omni-memory");
+    const dataDir = normalizeUserPath(process.env.OMNI_MEMORY_DIR || defaultDir);
+    const dbPath = process.env.OMNI_MEMORY_DB
+        ? normalizeUserPath(process.env.OMNI_MEMORY_DB)
+        : join(dataDir, "omni-memory.db");
+    return { dataDir, dbPath };
+}
+const { dataDir: DATA_DIR, dbPath: DB_PATH } = resolveStoragePaths();
+let db = null;
+function getDatabase() {
+    if (db)
+        return db;
+    // Ensure storage directories exist
+    if (!existsSync(DATA_DIR)) {
+        mkdirSync(DATA_DIR, { recursive: true });
+    }
+    const dbDirectory = dirname(DB_PATH);
+    if (!existsSync(dbDirectory)) {
+        mkdirSync(dbDirectory, { recursive: true });
+    }
+    db = new Database(DB_PATH);
+    db.pragma("journal_mode = WAL");
+    initializeSchema(db);
+    return db;
+}
+function initializeSchema(database) {
+    // Create memories table
+    database.exec(`
+    CREATE TABLE IF NOT EXISTS memories (
+      id TEXT PRIMARY KEY,
+      content TEXT NOT NULL,
+      area TEXT DEFAULT 'general',
+      project TEXT,
+      tags TEXT DEFAULT '[]',
+      created_at TEXT DEFAULT (datetime('now')),
+      updated_at TEXT DEFAULT (datetime('now'))
+    )
+  `);
+    // Create FTS5 virtual table
+    database.exec(`
+    CREATE VIRTUAL TABLE IF NOT EXISTS memories_fts USING fts5(
+      content,
+      project,
+      tags,
+      content='memories',
+      content_rowid='rowid'
+    )
+  `);
+    // Create triggers for FTS sync
+    database.exec(`
+    CREATE TRIGGER IF NOT EXISTS memories_ai AFTER INSERT ON memories BEGIN
+      INSERT INTO memories_fts(rowid, content, project, tags)
+      VALUES (new.rowid, new.content, COALESCE(new.project, ''), new.tags);
+    END
+  `);
+    database.exec(`
+    CREATE TRIGGER IF NOT EXISTS memories_ad AFTER DELETE ON memories BEGIN
+      INSERT INTO memories_fts(memories_fts, rowid, content, project, tags)
+      VALUES('delete', old.rowid, old.content, COALESCE(old.project, ''), old.tags);
+    END
+  `);
+    database.exec(`
+    CREATE TRIGGER IF NOT EXISTS memories_au AFTER UPDATE ON memories BEGIN
+      INSERT INTO memories_fts(memories_fts, rowid, content, project, tags)
+      VALUES('delete', old.rowid, old.content, COALESCE(old.project, ''), old.tags);
+      INSERT INTO memories_fts(rowid, content, project, tags)
+      VALUES (new.rowid, new.content, COALESCE(new.project, ''), new.tags);
+    END
+  `);
+}
+function rowToMemory(row) {
+    return {
+        id: row.id,
+        content: row.content,
+        area: row.area || "general",
+        project: row.project,
+        tags: JSON.parse(row.tags || "[]"),
+        created_at: row.created_at,
+        updated_at: row.updated_at,
+    };
+}
+export function addMemory(args) {
+    const database = getDatabase();
+    const id = uuidv4();
+    const area = args.area || "general";
+    const project = args.project || null;
+    const tags = JSON.stringify(args.tags || []);
+    const stmt = database.prepare(`
+    INSERT INTO memories (id, content, area, project, tags)
+    VALUES (?, ?, ?, ?, ?)
+  `);
+    stmt.run(id, args.content, area, project, tags);
+    return { id };
+}
+export function getMemory(id) {
+    const database = getDatabase();
+    const stmt = database.prepare("SELECT * FROM memories WHERE id = ?");
+    const row = stmt.get(id);
+    return row ? rowToMemory(row) : null;
+}
+export function updateMemory(args) {
+    const database = getDatabase();
+    // First get existing memory
+    const existing = getMemory(args.id);
+    if (!existing) {
+        return { changes: 0 };
+    }
+    // Merge updates
+    const content = args.content ?? existing.content;
+    const area = args.area ?? existing.area;
+    const project = args.project !== undefined ? args.project : existing.project;
+    const tags = args.tags !== undefined ? JSON.stringify(args.tags) : JSON.stringify(existing.tags);
+    const stmt = database.prepare(`
+    UPDATE memories 
+    SET content = ?, area = ?, project = ?, tags = ?, updated_at = datetime('now')
+    WHERE id = ?
+  `);
+    const result = stmt.run(content, area, project, tags, args.id);
+    return { changes: result.changes };
+}
+export function deleteMemory(id) {
+    const database = getDatabase();
+    const stmt = database.prepare("DELETE FROM memories WHERE id = ?");
+    const result = stmt.run(id);
+    return { changes: result.changes };
+}
+export function listMemories(args) {
+    const database = getDatabase();
+    const limit = Math.min(args.limit || 50, 100);
+    let sql = "SELECT * FROM memories WHERE 1=1";
+    const params = [];
+    if (args.area) {
+        sql += " AND area = ?";
+        params.push(args.area);
+    }
+    if (args.project) {
+        sql += " AND project = ?";
+        params.push(args.project);
+    }
+    if (args.tag) {
+        sql += " AND tags LIKE ?";
+        params.push(`%"${args.tag}"%`);
+    }
+    sql += " ORDER BY created_at DESC LIMIT ?";
+    params.push(limit);
+    const stmt = database.prepare(sql);
+    const rows = stmt.all(...params);
+    return rows.map(rowToMemory);
+}
+export function searchMemories(args) {
+    const database = getDatabase();
+    const limit = Math.min(args.limit || 10, 50);
+    // Build FTS5 query with filters
+    let ftsQuery = args.query;
+    // Add area filter to query
+    if (args.area) {
+        // We'll filter results after search
+    }
+    // Build SQL for FTS search
+    let sql = `
+    SELECT m.*, fts.rank as score
+    FROM memories m
+    JOIN memories_fts fts ON m.rowid = fts.rowid
+    WHERE memories_fts MATCH ?
+  `;
+    const params = [ftsQuery];
+    if (args.area) {
+        sql += " AND m.area = ?";
+        params.push(args.area);
+    }
+    if (args.project) {
+        sql += " AND m.project = ?";
+        params.push(args.project);
+    }
+    sql += " ORDER BY fts.rank LIMIT ?";
+    params.push(limit);
+    try {
+        const stmt = database.prepare(sql);
+        const rows = stmt.all(...params);
+        return rows.map((row) => ({
+            ...rowToMemory(row),
+            score: Math.abs(row.score) || 0,
+        }));
+    }
+    catch (error) {
+        // FTS5 might fail on special characters, fallback to LIKE search
+        return fallbackSearch(args);
+    }
+}
+function fallbackSearch(args) {
+    const database = getDatabase();
+    const limit = Math.min(args.limit || 10, 50);
+    let sql = "SELECT * FROM memories WHERE content LIKE ?";
+    const params = [`%${args.query}%`];
+    if (args.area) {
+        sql += " AND area = ?";
+        params.push(args.area);
+    }
+    if (args.project) {
+        sql += " AND project = ?";
+        params.push(args.project);
+    }
+    sql += " ORDER BY created_at DESC LIMIT ?";
+    params.push(limit);
+    const stmt = database.prepare(sql);
+    const rows = stmt.all(...params);
+    return rows.map((row) => ({
+        ...rowToMemory(row),
+        score: 0.5, // Default score for fallback search
+    }));
+}
+export function closeDatabase() {
+    if (db) {
+        db.close();
+        db = null;
+    }
+}
+export { resolveStoragePaths, normalizeUserPath };
+// For testing
+export function resetDatabase() {
+    if (db) {
+        db.exec("DROP TABLE IF EXISTS memories");
+        db.exec("DROP TABLE IF EXISTS memories_fts");
+        db.exec("DROP TRIGGER IF EXISTS memories_ai");
+        db.exec("DROP TRIGGER IF EXISTS memories_ad");
+        db.exec("DROP TRIGGER IF EXISTS memories_au");
+        initializeSchema(db);
+    }
+}
+//# sourceMappingURL=database.js.map