aifastdb 3.1.1 → 3.1.3

package/dist/social-graph-v2-traversal.test.js

@@ -1,212 +0,0 @@
-#!/usr/bin/env node
-"use strict";
-/**
- * SocialGraphV2 Graph Traversal & Mutations — Integration Test (T107.4)
- *
- * Covers:
- *   - outgoingByType / incomingByType (typed relation queries)
- *   - extractSubgraph (N-hop sub-graph extraction)
- *   - traverse (BFS/DFS/WeightedBFS)
- *   - applyMutations (batch graph mutations)
- *   - updateRelationWeight / adjustRelationWeight / updateRelationMetadata
- *   - dynamicRecordAccess / dynamicDemote / dynamicPromote / dynamicScan
- */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-const os = __importStar(require("os"));
-const path = __importStar(require("path"));
-const fs = __importStar(require("fs"));
-const social_graph_v2_1 = require("./social-graph-v2");
-// ============================================================================
-// Test Utilities
-// ============================================================================
-let passed = 0;
-let failed = 0;
-const failures = [];
-function assert(condition, message) {
-    if (condition) {
-        passed++;
-        console.log(`  ✅ ${message}`);
-    }
-    else {
-        failed++;
-        failures.push(message);
-        console.log(`  ❌ ${message}`);
-    }
-}
-function section(name) {
-    console.log(`\n── ${name} ──`);
-}
-function createTempDir() {
-    const dir = path.join(os.tmpdir(), `sgv2-traversal-test-${Date.now()}-${Math.random().toString(36).slice(2)}`);
-    fs.mkdirSync(dir, { recursive: true });
-    return dir;
-}
-function cleanup(dir) {
-    try {
-        fs.rmSync(dir, { recursive: true, force: true });
-    }
-    catch { /* ignore */ }
-}
-// ============================================================================
-// Main Test
-// ============================================================================
-async function main() {
-    passed = 0;
-    failed = 0;
-    failures.length = 0;
-    console.log('=== SocialGraphV2 Traversal & Mutations Tests (Phase-107) ===\n');
-    const dir = createTempDir();
-    let sg;
-    try {
-        sg = social_graph_v2_1.SocialGraphV2.open(dir);
-        // Build a small test graph:
-        //   Alice --FRIEND--> Bob --FRIEND--> Charlie
-        //   Alice --COLLEAGUE--> Dave
-        //   Bob --COLLEAGUE--> Eve
-        sg.addPerson({ id: 'alice', name: 'Alice', properties: { gender: 'F' } });
-        sg.addPerson({ id: 'bob', name: 'Bob', properties: { gender: 'M' } });
-        sg.addPerson({ id: 'charlie', name: 'Charlie', properties: { gender: 'M' } });
-        sg.addPerson({ id: 'dave', name: 'Dave', properties: { gender: 'M' } });
-        sg.addPerson({ id: 'eve', name: 'Eve', properties: { gender: 'F' } });
-        sg.addFriend('alice', 'bob', { relationType: 'friend', weight: 0.9 });
-        sg.addFriend('bob', 'charlie', { relationType: 'friend', weight: 0.8 });
-        sg.addFriend('alice', 'dave', { relationType: 'colleague', weight: 0.5 });
-        sg.addFriend('bob', 'eve', { relationType: 'colleague', weight: 0.3 });
-        // ── Typed Relation Queries ──
-        section('outgoingByType / incomingByType');
-        const friendsFromAlice = sg.outgoingByType('alice', 'FRIEND');
-        assert(friendsFromAlice.length >= 1, `outgoingByType FRIEND from Alice found ${friendsFromAlice.length} relation(s)`);
-        const colleaguesFromAlice = sg.outgoingByType('alice', 'COLLEAGUE');
-        assert(colleaguesFromAlice.length >= 1, `outgoingByType COLLEAGUE from Alice found ${colleaguesFromAlice.length} relation(s)`);
-        const incomingToBob = sg.incomingByType('bob', 'FRIEND');
-        assert(incomingToBob.length >= 1, `incomingByType FRIEND to Bob found ${incomingToBob.length} relation(s)`);
-        // ── Sub-graph Extraction ──
-        section('extractSubgraph');
-        const subgraph1 = sg.extractSubgraph('alice', { max_hops: 1 });
-        assert(subgraph1 != null, 'extractSubgraph returned a result');
-        assert(subgraph1.root_id === 'alice', 'subgraph root_id is alice');
-        assert(subgraph1.entity_count >= 3, `subgraph 1-hop has ${subgraph1.entity_count} entities (≥3 expected: alice+bob+dave)`);
-        const subgraph2 = sg.extractSubgraph('alice', { max_hops: 2 });
-        assert(subgraph2.entity_count >= 4, `subgraph 2-hop has ${subgraph2.entity_count} entities (≥4 expected)`);
-        const subgraphFiltered = sg.extractSubgraph('alice', { max_hops: 2, relation_type_filter: ['FRIEND'] });
-        // With FRIEND filter: alice → bob → charlie, should not include dave/eve (COLLEAGUE)
-        assert(subgraphFiltered.entity_count >= 2, `subgraph FRIEND-only has ${subgraphFiltered.entity_count} entities`);
-        // ── Graph Traversal ──
-        section('traverse');
-        const bfsResult = sg.traverse('alice', { max_hops: 3, strategy: 'BFS' });
-        assert(bfsResult != null, 'BFS traverse returned a result');
-        assert(bfsResult.visited_order.length >= 3, `BFS visited ${bfsResult.visited_order.length} entities`);
-        assert(bfsResult.visited_order[0] === 'alice', 'BFS starts with alice');
-        const dfsResult = sg.traverse('alice', { max_hops: 3, strategy: 'DFS' });
-        assert(dfsResult != null, 'DFS traverse returned a result');
-        assert(dfsResult.visited_order.length >= 3, `DFS visited ${dfsResult.visited_order.length} entities`);
-        const weightedResult = sg.traverse('alice', { max_hops: 2, strategy: 'WeightedBFS' });
-        assert(weightedResult != null, 'WeightedBFS traverse returned a result');
-        assert(weightedResult.visited_order.length >= 2, `WeightedBFS visited ${weightedResult.visited_order.length} entities`);
-        // ── Relation Weight Updates ──
-        section('updateRelationWeight / adjustRelationWeight / updateRelationMetadata');
-        // Find a relation to update
-        const aliceRels = sg.getEntityRelations('alice');
-        const friendRel = aliceRels.find((r) => r.relation_type === 'FRIEND' || r.relationType === 'FRIEND');
-        if (friendRel) {
-            const relId = friendRel.id;
-            await sg.updateRelationWeight(relId, 'alice', 0.95);
-            assert(true, `updateRelationWeight succeeded for relation ${relId}`);
-            await sg.adjustRelationWeight(relId, 'alice', 0.02);
-            assert(true, `adjustRelationWeight succeeded for relation ${relId}`);
-            await sg.updateRelationMetadata(relId, 'alice', 'note', 'best-friend');
-            assert(true, `updateRelationMetadata succeeded for relation ${relId}`);
-        }
-        else {
-            assert(false, 'Could not find a FRIEND relation to test updates on');
-        }
-        // ── Batch Mutations ──
-        section('applyMutations');
-        const mutCount = await sg.applyMutations([
-            {
-                type: 'PutEntity',
-                entity: { id: 'frank', name: 'Frank', entity_type: 'person', properties: {}, memory_refs: [], created_at: Date.now(), updated_at: Date.now() },
-            },
-            {
-                type: 'PutRelation',
-                relation: { id: 'rel-frank-alice', source: 'frank', target: 'alice', relation_type: 'FRIEND', weight: 0.7, bidirectional: false, metadata: {}, created_at: Date.now() },
-            },
-        ]);
-        assert(mutCount === 2, `applyMutations applied ${mutCount} mutations (expected 2)`);
-        // Verify the entity was created
-        const frank = sg.getEntity('frank');
-        assert(frank != null, 'Frank entity exists after PutEntity mutation');
-        // ── Dynamic Node Management ──
-        section('dynamicRecordAccess / dynamicDemote / dynamicPromote');
-        const stats = sg.dynamicRecordAccess('alice');
-        assert(stats != null, 'dynamicRecordAccess returned stats for alice');
-        if (stats) {
-            assert(stats.hit_count >= 1, `alice hit_count=${stats.hit_count} after recordAccess`);
-        }
-        const demoted = sg.dynamicDemote('charlie');
-        assert(typeof demoted === 'boolean', `dynamicDemote returned boolean: ${demoted}`);
-        const isShadow = sg.isShadowEntity('charlie');
-        assert(typeof isShadow === 'boolean', `isShadowEntity returned boolean: ${isShadow}`);
-        if (isShadow) {
-            const promoted = sg.dynamicPromote('charlie');
-            assert(typeof promoted === 'boolean', `dynamicPromote returned boolean: ${promoted}`);
-        }
-        // ── Summary ──
-        console.log(`\n${'═'.repeat(50)}`);
-        console.log(`Total: ${passed + failed} | ✅ Passed: ${passed} | ❌ Failed: ${failed}`);
-        if (failures.length > 0) {
-            console.log('\nFailures:');
-            failures.forEach((f) => console.log(`  - ${f}`));
-        }
-        console.log(`${'═'.repeat(50)}`);
-    }
-    finally {
-        cleanup(dir);
-    }
-    if (failed > 0) {
-        throw new Error(`SocialGraphV2 traversal test failed (${failed} failures)`);
-    }
-}
-if (require.main === module) {
-    main().catch((err) => {
-        console.error('Fatal error:', err);
-        process.exit(2);
-    });
-}
-test('SocialGraphV2 traversal & mutations integration', async () => {
-    await main();
-});
-//# sourceMappingURL=social-graph-v2-traversal.test.js.map

package/dist/social-graph-v2-traversal.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"social-graph-v2-traversal.test.js","sourceRoot":"","sources":["../ts/social-graph-v2-traversal.test.ts"],"names":[],"mappings":";;AACA;;;;;;;;;;GAUG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,uCAAyB;AACzB,2CAA6B;AAC7B,uCAAyB;AACzB,uDAAkD;AAElD,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E,IAAI,MAAM,GAAG,CAAC,CAAC;AACf,IAAI,MAAM,GAAG,CAAC,CAAC;AACf,MAAM,QAAQ,GAAa,EAAE,CAAC;AAE9B,SAAS,MAAM,CAAC,SAAkB,EAAE,OAAe;IACjD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,EAAE,CAAC;QACT,OAAO,CAAC,GAAG,CAAC,OAAO,OAAO,EAAE,CAAC,CAAC;IAChC,CAAC;SAAM,CAAC;QACN,MAAM,EAAE,CAAC;QACT,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,OAAO,OAAO,EAAE,CAAC,CAAC;IAChC,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,IAAI,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,aAAa;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,uBAAuB,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/G,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACvC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,GAAW;IAC1B,IAAI,CAAC;QACH,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;IAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;AAC1B,CAAC;AAED,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,KAAK,UAAU,IAAI;IACjB,MAAM,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,CAAC,CAAC;IACX,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACpB,OAAO,CAAC,GAAG,CAAC,iEAAiE,CAAC,CAAC;IAE/E,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC;IAC5B,IAAI,EAAiB,CAAC;IAEtB,IAAI,CAAC;QACH,EAAE,GAAG,+BAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE7B,4BAA4B;QAC5B,8CAA8C;QAC9C,8BAA8B;QAC9B,2BAA2B;QAC3B,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QAC1E,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACtE,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QAC9E,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACxE,EAAE,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QAEtE,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACtE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACxE,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1E,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAEvE,+BAA+B;QAC/B,OAAO,CAAC,iCAAiC,CAAC,CAAC;QAE3C,MAAM,gBAAgB,GAAG,EAAE,CAAC,cAAc,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC9D,MAAM,CAAC,gBAAgB,CAAC,MAAM,IAAI,CAAC,EAAE,0CAA0C,gBAAgB,CAAC,MAAM,cAAc,CAAC,CAAC;QAEtH,MAAM,mBAAmB,GAAG,EAAE,CAAC,cAAc,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QACpE,MAAM,CAAC,mBAAmB,CAAC,MAAM,IAAI,CAAC,EAAE,6CAA6C,mBAAmB,CAAC,MAAM,cAAc,CAAC,CAAC;QAE/H,MAAM,aAAa,GAAG,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACzD,MAAM,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,sCAAsC,aAAa,CAAC,MAAM,cAAc,CAAC,CAAC;QAE5G,6BAA6B;QAC7B,OAAO,CAAC,iBAAiB,CAAC,CAAC;QAE3B,MAAM,SAAS,GAAG,EAAE,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/D,MAAM,CAAC,SAAS,IAAI,IAAI,EAAE,mCAAmC,CAAC,CAAC;QAC/D,MAAM,CAAC,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE,2BAA2B,CAAC,CAAC;QACnE,MAAM,CAAC,SAAS,CAAC,YAAY,IAAI,CAAC,EAAE,sBAAsB,SAAS,CAAC,YAAY,yCAAyC,CAAC,CAAC;QAE3H,MAAM,SAAS,GAAG,EAAE,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/D,MAAM,CAAC,SAAS,CAAC,YAAY,IAAI,CAAC,EAAE,sBAAsB,SAAS,CAAC,YAAY,yBAAyB,CAAC,CAAC;QAE3G,MAAM,gBAAgB,GAAG,EAAE,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,oBAAoB,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACxG,qFAAqF;QACrF,MAAM,CAAC,gBAAgB,CAAC,YAAY,IAAI,CAAC,EAAE,4BAA4B,gBAAgB,CAAC,YAAY,WAAW,CAAC,CAAC;QAEjH,wBAAwB;QACxB,OAAO,CAAC,UAAU,CAAC,CAAC;QAEpB,MAAM,SAAS,GAAG,EAAE,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,SAAS,IAAI,IAAI,EAAE,gCAAgC,CAAC,CAAC;QAC5D,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,eAAe,SAAS,CAAC,aAAa,CAAC,MAAM,WAAW,CAAC,CAAC;QACtG,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,uBAAuB,CAAC,CAAC;QAExE,MAAM,SAAS,GAAG,EAAE,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,SAAS,IAAI,IAAI,EAAE,gCAAgC,CAAC,CAAC;QAC5D,MAAM,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,eAAe,SAAS,CAAC,aAAa,CAAC,MAAM,WAAW,CAAC,CAAC;QAEtG,MAAM,cAAc,GAAG,EAAE,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,CAAC;QACtF,MAAM,CAAC,cAAc,IAAI,IAAI,EAAE,wCAAwC,CAAC,CAAC;QACzE,MAAM,CAAC,cAAc,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,uBAAuB,cAAc,CAAC,aAAa,CAAC,MAAM,WAAW,CAAC,CAAC;QAExH,gCAAgC;QAChC,OAAO,CAAC,sEAAsE,CAAC,CAAC;QAEhF,4BAA4B;QAC5B,MAAM,SAAS,GAAG,EAAE,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,CAAC,YAAY,KAAK,QAAQ,CAAC,CAAC;QAC1G,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC;YAE3B,MAAM,EAAE,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YACpD,MAAM,CAAC,IAAI,EAAE,+CAA+C,KAAK,EAAE,CAAC,CAAC;YAErE,MAAM,EAAE,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YACpD,MAAM,CAAC,IAAI,EAAE,+CAA+C,KAAK,EAAE,CAAC,CAAC;YAErE,MAAM,EAAE,CAAC,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;YACvE,MAAM,CAAC,IAAI,EAAE,iDAAiD,KAAK,EAAE,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,KAAK,EAAE,qDAAqD,CAAC,CAAC;QACvE,CAAC;QAED,wBAAwB;QACxB,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAE1B,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,cAAc,CAAC;YACvC;gBACE,IAAI,EAAE,WAAW;gBACjB,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE;aAC/I;YACD;gBACE,IAAI,EAAE,aAAa;gBACnB,QAAQ,EAAE,EAAE,EAAE,EAAE,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE;aACxK;SACF,CAAC,CAAC;QACH,MAAM,CAAC,QAAQ,KAAK,CAAC,EAAE,0BAA0B,QAAQ,yBAAyB,CAAC,CAAC;QAEpF,gCAAgC;QAChC,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,IAAI,IAAI,EAAE,8CAA8C,CAAC,CAAC;QAEtE,gCAAgC;QAChC,OAAO,CAAC,sDAAsD,CAAC,CAAC;QAEhE,MAAM,KAAK,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAC9C,MAAM,CAAC,KAAK,IAAI,IAAI,EAAE,8CAA8C,CAAC,CAAC;QACtE,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,mBAAmB,KAAK,CAAC,SAAS,qBAAqB,CAAC,CAAC;QACxF,CAAC;QAED,MAAM,OAAO,GAAG,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,CAAC,OAAO,OAAO,KAAK,SAAS,EAAE,mCAAmC,OAAO,EAAE,CAAC,CAAC;QAEnF,MAAM,QAAQ,GAAG,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,CAAC,OAAO,QAAQ,KAAK,SAAS,EAAE,oCAAoC,QAAQ,EAAE,CAAC,CAAC;QAEtF,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,QAAQ,GAAG,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;YAC9C,MAAM,CAAC,OAAO,QAAQ,KAAK,SAAS,EAAE,oCAAoC,QAAQ,EAAE,CAAC,CAAC;QACxF,CAAC;QAED,gBAAgB;QAChB,OAAO,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,UAAU,MAAM,GAAG,MAAM,gBAAgB,MAAM,gBAAgB,MAAM,EAAE,CAAC,CAAC;QACrF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAC3B,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAEnC,CAAC;YAAS,CAAC;QACT,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,wCAAwC,MAAM,YAAY,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC;AAED,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;IAC5B,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;QACnB,OAAO,CAAC,KAAK,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,IAAI,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;IACjE,MAAM,IAAI,EAAE,CAAC;AACf,CAAC,CAAC,CAAC"}

package/dist/social-graph-v2-uri.test.d.ts

@@ -1,12 +0,0 @@
-#!/usr/bin/env node
-/**
- * SocialGraphV2 URI / Path Indexing — Integration Test (T132.5)
- *
- * Covers:
- *   - anchorUpsert() auto URI/path generation
- *   - anchorFindByUri() direct URI lookup
- *   - anchorListByPath() directory-style browsing
- *   - anchorBackfillUriPath() idempotent migration API
- */
-export {};
-//# sourceMappingURL=social-graph-v2-uri.test.d.ts.map

package/dist/social-graph-v2-uri.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"social-graph-v2-uri.test.d.ts","sourceRoot":"","sources":["../ts/social-graph-v2-uri.test.ts"],"names":[],"mappings":";AACA;;;;;;;;GAQG"}

package/dist/social-graph-v2-uri.test.js

@@ -1,141 +0,0 @@
-#!/usr/bin/env node
-"use strict";
-/**
- * SocialGraphV2 URI / Path Indexing — Integration Test (T132.5)
- *
- * Covers:
- *   - anchorUpsert() auto URI/path generation
- *   - anchorFindByUri() direct URI lookup
- *   - anchorListByPath() directory-style browsing
- *   - anchorBackfillUriPath() idempotent migration API
- */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-const os = __importStar(require("os"));
-const path = __importStar(require("path"));
-const fs = __importStar(require("fs"));
-const social_graph_v2_1 = require("./social-graph-v2");
-let passed = 0;
-let failed = 0;
-const failures = [];
-function assert(condition, message) {
-    if (condition) {
-        passed++;
-        console.log(`  OK ${message}`);
-    }
-    else {
-        failed++;
-        failures.push(message);
-        console.log(`  FAIL ${message}`);
-    }
-}
-function section(name) {
-    console.log(`\n-- ${name} --`);
-}
-function createTempDir() {
-    const dir = path.join(os.tmpdir(), `sgv2-uri-test-${Date.now()}-${Math.random().toString(36).slice(2)}`);
-    fs.mkdirSync(dir, { recursive: true });
-    return dir;
-}
-function cleanup(dir) {
-    try {
-        fs.rmSync(dir, { recursive: true, force: true });
-    }
-    catch {
-        // ignore
-    }
-}
-async function main() {
-    passed = 0;
-    failed = 0;
-    failures.length = 0;
-    console.log('=== SocialGraphV2 URI / Path Integration Test (Phase-132) ===');
-    const dir = createTempDir();
-    let sg = null;
-    try {
-        sg = social_graph_v2_1.SocialGraphV2.open(dir);
-        section('anchorUpsert auto URI/path');
-        const rag = sg.anchorUpsert('RagChat', 'module', 'RAG chat module');
-        const planner = sg.anchorUpsert('Query Planner', 'module', 'planner module');
-        const concept = sg.anchorUpsert('Score Propagation', 'concept', 'ranking strategy');
-        assert(!!rag.uri && rag.uri.startsWith('aidb://memory/anchors/module/'), 'rag.uri generated');
-        assert(rag.path === 'anchors/module/ragchat', 'rag.path normalized to anchors/module/ragchat');
-        assert(planner.path === 'anchors/module/query-planner', 'planner.path slug normalized');
-        assert(concept.path === 'anchors/concept/score-propagation', 'concept.path slug normalized');
-        section('anchorFindByUri direct lookup');
-        const foundByUri = rag.uri ? sg.anchorFindByUri(rag.uri) : null;
-        assert(foundByUri !== null, 'anchorFindByUri returns anchor');
-        assert(foundByUri?.id === rag.id, 'anchorFindByUri returns expected anchor id');
-        section('anchorListByPath directory browsing');
-        const moduleAnchors = sg.anchorListByPath('anchors/module');
-        assert(moduleAnchors.length >= 2, 'path prefix anchors/module returns module anchors');
-        assert(moduleAnchors.some((a) => a.id === rag.id) &&
-            moduleAnchors.some((a) => a.id === planner.id), 'module path contains rag and planner anchors');
-        assert(moduleAnchors.every((a) => (a.path ?? '').startsWith('anchors/module/')), 'module path result items keep module prefix');
-        const moduleAnchorsByUri = sg.anchorListByPath('aidb://memory/anchors/module');
-        assert(moduleAnchorsByUri.length >= 2, 'URI prefix works for directory listing');
-        section('anchorBackfillUriPath idempotent migration API');
-        const first = sg.anchorBackfillUriPath();
-        assert(first.total_anchors >= 3, 'backfill report total_anchors is valid');
-        assert(first.updated_anchors === 0, 'fresh data should not need backfill updates');
-        const second = sg.anchorBackfillUriPath();
-        assert(second.updated_anchors === 0, 'second backfill remains zero updates (idempotent)');
-        assert(second.unchanged_anchors >= 3, 'second backfill unchanged_anchors is valid');
-        console.log(`\nTotal: ${passed + failed} | Passed: ${passed} | Failed: ${failed}`);
-        if (failures.length > 0) {
-            console.log('Failures:');
-            for (const f of failures)
-                console.log(`  - ${f}`);
-        }
-    }
-    finally {
-        if (sg)
-            sg.shutdown();
-        cleanup(dir);
-    }
-    if (failed > 0) {
-        throw new Error(`SocialGraphV2 URI test failed (${failed} failures)`);
-    }
-}
-if (require.main === module) {
-    main().catch((err) => {
-        console.error('Fatal error:', err);
-        process.exit(2);
-    });
-}
-test('SocialGraphV2 URI / Path integration', async () => {
-    await main();
-});
-//# sourceMappingURL=social-graph-v2-uri.test.js.map

package/dist/social-graph-v2-uri.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"social-graph-v2-uri.test.js","sourceRoot":"","sources":["../ts/social-graph-v2-uri.test.ts"],"names":[],"mappings":";;AACA;;;;;;;;GAQG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,uCAAyB;AACzB,2CAA6B;AAC7B,uCAAyB;AACzB,uDAAkD;AAElD,IAAI,MAAM,GAAG,CAAC,CAAC;AACf,IAAI,MAAM,GAAG,CAAC,CAAC;AACf,MAAM,QAAQ,GAAa,EAAE,CAAC;AAE9B,SAAS,MAAM,CAAC,SAAkB,EAAE,OAAe;IACjD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,EAAE,CAAC;QACT,OAAO,CAAC,GAAG,CAAC,QAAQ,OAAO,EAAE,CAAC,CAAC;IACjC,CAAC;SAAM,CAAC;QACN,MAAM,EAAE,CAAC;QACT,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,UAAU,OAAO,EAAE,CAAC,CAAC;IACnC,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,IAAI,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,aAAa;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CACnB,EAAE,CAAC,MAAM,EAAE,EACX,iBAAiB,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CACrE,CAAC;IACF,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACvC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,GAAW;IAC1B,IAAI,CAAC;QACH,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;IAAC,MAAM,CAAC;QACP,SAAS;IACX,CAAC;AACH,CAAC;AAED,KAAK,UAAU,IAAI;IACjB,MAAM,GAAG,CAAC,CAAC;IACX,MAAM,GAAG,CAAC,CAAC;IACX,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACpB,OAAO,CAAC,GAAG,CAAC,+DAA+D,CAAC,CAAC;IAE7E,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC;IAC5B,IAAI,EAAE,GAAyB,IAAI,CAAC;IAEpC,IAAI,CAAC;QACH,EAAE,GAAG,+BAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE7B,OAAO,CAAC,4BAA4B,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QAC7E,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,mBAAmB,EAAE,SAAS,EAAE,kBAAkB,CAAC,CAAC;QAEpF,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,+BAA+B,CAAC,EAAE,mBAAmB,CAAC,CAAC;QAC9F,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,wBAAwB,EAAE,+CAA+C,CAAC,CAAC;QAC/F,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,8BAA8B,EAAE,8BAA8B,CAAC,CAAC;QACxF,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,mCAAmC,EAAE,8BAA8B,CAAC,CAAC;QAE7F,OAAO,CAAC,+BAA+B,CAAC,CAAC;QACzC,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAChE,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,gCAAgC,CAAC,CAAC;QAC9D,MAAM,CAAC,UAAU,EAAE,EAAE,KAAK,GAAG,CAAC,EAAE,EAAE,4CAA4C,CAAC,CAAC;QAEhF,OAAO,CAAC,qCAAqC,CAAC,CAAC;QAC/C,MAAM,aAAa,GAAG,EAAE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;QAC5D,MAAM,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,mDAAmD,CAAC,CAAC;QACvF,MAAM,CACJ,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;YACxC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,CAAC,EAChD,8CAA8C,CAC/C,CAAC;QACF,MAAM,CACJ,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,EACxE,6CAA6C,CAC9C,CAAC;QAEF,MAAM,kBAAkB,GAAG,EAAE,CAAC,gBAAgB,CAAC,8BAA8B,CAAC,CAAC;QAC/E,MAAM,CAAC,kBAAkB,CAAC,MAAM,IAAI,CAAC,EAAE,wCAAwC,CAAC,CAAC;QAEjF,OAAO,CAAC,gDAAgD,CAAC,CAAC;QAC1D,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,EAAE,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,aAAa,IAAI,CAAC,EAAE,wCAAwC,CAAC,CAAC;QAC3E,MAAM,CAAC,KAAK,CAAC,eAAe,KAAK,CAAC,EAAE,6CAA6C,CAAC,CAAC;QAEnF,MAAM,MAAM,GAAG,EAAE,CAAC,qBAAqB,EAAE,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,eAAe,KAAK,CAAC,EAAE,mDAAmD,CAAC,CAAC;QAC1F,MAAM,CAAC,MAAM,CAAC,iBAAiB,IAAI,CAAC,EAAE,4CAA4C,CAAC,CAAC;QAEpF,OAAO,CAAC,GAAG,CAAC,YAAY,MAAM,GAAG,MAAM,cAAc,MAAM,cAAc,MAAM,EAAE,CAAC,CAAC;QACnF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,QAAQ;gBAAE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;YAAS,CAAC;QACT,IAAI,EAAE;YAAE,EAAE,CAAC,QAAQ,EAAE,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,kCAAkC,MAAM,YAAY,CAAC,CAAC;IACxE,CAAC;AACH,CAAC;AAED,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;IAC5B,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;QACnB,OAAO,CAAC,KAAK,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;IACtD,MAAM,IAAI,EAAE,CAAC;AACf,CAAC,CAAC,CAAC"}

package/dist/social-graph-v2-vector.test.d.ts

@@ -1,14 +0,0 @@
-#!/usr/bin/env node
-/**
- * SocialGraphV2 Vector Search — Integration Test (T32.4)
- *
- * Covers:
- *   - Vector search configuration via constructor
- *   - isVectorSearchEnabled / vectorCount
- *   - indexEntity / removeEntityVector
- *   - searchEntitiesByVector (k-NN)
- *   - hybridSearch (vector + text fusion)
- *   - Entity type filtering
- */
-export {};
-//# sourceMappingURL=social-graph-v2-vector.test.d.ts.map

package/dist/social-graph-v2-vector.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"social-graph-v2-vector.test.d.ts","sourceRoot":"","sources":["../ts/social-graph-v2-vector.test.ts"],"names":[],"mappings":";AACA;;;;;;;;;;GAUG"}