@soulcraft/brainy 3.25.0 → 3.25.2

package/CHANGELOG.md

@@ -2,6 +2,25 @@
 
 All notable changes to this project will be documented in this file. See [standard-version](https://github.com/conventional-changelog/standard-version) for commit guidelines.
 
+### [3.25.2](https://github.com/soulcraftlabs/brainy/compare/v3.25.1...v3.25.2) (2025-10-08)
+
+
+### 🐛 Bug Fixes
+
+* export ImportManager and add getStats() convenience method ([06b3bc7](https://github.com/soulcraftlabs/brainy/commit/06b3bc77e1fd4c5544dc61cccd4814bd7a26a1dd))
+
+### [3.25.1](https://github.com/soulcraftlabs/brainy/compare/v3.25.0...v3.25.1) (2025-10-07)
+
+
+### 🐛 Bug Fixes
+
+* implement stub methods in Neural API clustering ([1d2da82](https://github.com/soulcraftlabs/brainy/commit/1d2da823ede478e6b1bd5144be58ca4921e951e7))
+
+
+### ✅ Tests
+
+* use memory storage for domain-time clustering tests ([34fb6e0](https://github.com/soulcraftlabs/brainy/commit/34fb6e05b5a04f2c8fc635ca36c9b96ee19e3130))
+
 ### [3.25.0](https://github.com/soulcraftlabs/brainy/compare/v3.24.0...v3.25.0) (2025-10-07)
 
 - test: skip GitBridge Integration test (empty suite) (8939f59)

package/dist/brainy.d.ts

@@ -809,6 +809,27 @@ export declare class Brainy<T = any> implements BrainyInterface<T> {
         get: (name: string) => import("./augmentations/brainyAugmentation.js").BrainyAugmentation;
         has: (name: string) => boolean;
     };
+    /**
+     * Get complete statistics - convenience method
+     * For more granular counting, use brain.counts API
+     * @returns Complete statistics including entities, relationships, and density
+     */
+    getStats(): {
+        entities: {
+            total: number;
+            byType: {
+                [k: string]: number;
+            };
+        };
+        relationships: {
+            totalRelationships: number;
+            relationshipsByType: Record<string, number>;
+            uniqueSourceNodes: number;
+            uniqueTargetNodes: number;
+            totalNodes: number;
+        };
+        density: number;
+    };
     /**
      * Parse natural language query using advanced NLP with 220+ patterns
      * The embedding model is always available as it's core to Brainy's functionality

package/dist/brainy.js

@@ -1768,6 +1768,14 @@ export class Brainy {
             has: (name) => this.augmentationRegistry.getAll().some(a => a.name === name)
         };
     }
+    /**
+     * Get complete statistics - convenience method
+     * For more granular counting, use brain.counts API
+     * @returns Complete statistics including entities, relationships, and density
+     */
+    getStats() {
+        return this.counts.getStats();
+    }
     // ============= HELPER METHODS =============
     /**
      * Parse natural language query using advanced NLP with 220+ patterns

package/dist/index.d.ts

@@ -15,6 +15,8 @@ export { PresetName, ModelPrecision, StorageOption, FeatureSet, DistributedRole,
 export { Cortex, cortex } from './cortex.js';
 export { NeuralImport } from './cortex/neuralImport.js';
 export type { NeuralAnalysisResult, DetectedEntity, DetectedRelationship, NeuralInsight, NeuralImportOptions } from './cortex/neuralImport.js';
+export { ImportManager, createImportManager } from './importManager.js';
+export type { ImportOptions, ImportResult } from './importManager.js';
 import { euclideanDistance, cosineDistance, manhattanDistance, dotProductDistance } from './utils/index.js';
 export { euclideanDistance, cosineDistance, manhattanDistance, dotProductDistance };
 export { getBrainyVersion } from './utils/version.js';

package/dist/index.js

@@ -31,6 +31,8 @@ getPreset, isValidPreset, getPresetsByCategory, getAllPresetNames, getPresetDesc
 export { Cortex, cortex } from './cortex.js';
 // Export Neural Import (AI data understanding)
 export { NeuralImport } from './cortex/neuralImport.js';
+// Export Import Manager (comprehensive data import)
+export { ImportManager, createImportManager } from './importManager.js';
 // Augmentation types are already exported later in the file
 // Export distance functions for convenience
 import { euclideanDistance, cosineDistance, manhattanDistance, dotProductDistance } from './utils/index.js';

package/dist/neural/improvedNeuralAPI.d.ts

@@ -293,6 +293,7 @@ export declare class ImprovedNeuralAPI {
     private _calculateDomainConfidence;
     private _findCrossDomainMembers;
     private _findCrossDomainClusters;
+    private _averageVectors;
     private _getItemsByTimeWindow;
     private _calculateTemporalMetrics;
     private _mergeOverlappingTemporalClusters;

package/dist/neural/improvedNeuralAPI.js

@@ -1899,8 +1899,63 @@ export class ImprovedNeuralAPI {
         return Math.max(0, 1 - (avgDistance / maxDistance));
     }
     async _getItemsByField(field) {
-        // Implementation would query items by metadata field
-        return [];
+        try {
+            // Query all items from brain (limit to reasonable number for clustering)
+            const result = await this.brain.find({
+                query: '',
+                limit: 10000 // Max items for clustering
+            });
+            if (!result || !Array.isArray(result)) {
+                return [];
+            }
+            // Filter items that have the specified field (check both root level and metadata)
+            const itemsWithField = result.filter((item) => {
+                if (!item || !item.entity)
+                    return false;
+                const entity = item.entity;
+                // Check root level fields first (e.g., 'noun' for type)
+                if (field === 'type' || field === 'nounType') {
+                    return entity.noun != null;
+                }
+                // Check if field exists at root level
+                if (entity[field] != null) {
+                    return true;
+                }
+                // Check if field exists in metadata/data
+                if (entity.metadata?.[field] != null) {
+                    return true;
+                }
+                if (entity.data?.[field] != null) {
+                    return true;
+                }
+                return false;
+            });
+            // Map to format expected by clustering methods
+            return itemsWithField.map((item) => {
+                const entity = item.entity;
+                return {
+                    id: entity.id,
+                    vector: entity.embedding || entity.vector || [],
+                    metadata: {
+                        ...(entity.metadata || {}),
+                        ...(entity.data || {}),
+                        // Include root-level fields in metadata for easy access
+                        noun: entity.noun,
+                        type: entity.noun,
+                        createdAt: entity.createdAt,
+                        updatedAt: entity.updatedAt,
+                        label: entity.label
+                    },
+                    nounType: entity.noun,
+                    label: entity.label || entity.data || '',
+                    data: entity.data
+                };
+            });
+        }
+        catch (error) {
+            console.error('Error in _getItemsByField:', error);
+            return [];
+        }
     }
     // ===== TRIPLE INTELLIGENCE INTEGRATION =====
     /**
@@ -2262,11 +2317,34 @@ export class ImprovedNeuralAPI {
     _groupByDomain(items, field) {
         const groups = new Map();
         for (const item of items) {
-            const domain = item.metadata?.[field] || 'unknown';
-            if (!groups.has(domain)) {
-                groups.set(domain, []);
+            // Check multiple locations for the field value
+            let domain = 'unknown';
+            // Special handling for type/nounType field
+            if (field === 'type' || field === 'nounType') {
+                domain = item.nounType || item.metadata?.noun || item.metadata?.type || 'unknown';
             }
-            groups.get(domain).push(item);
+            else {
+                // Check root level first
+                domain = item[field];
+                // Then check metadata
+                if (domain == null) {
+                    domain = item.metadata?.[field];
+                }
+                // Then check data
+                if (domain == null) {
+                    domain = item.data?.[field];
+                }
+                // Fallback to unknown
+                if (domain == null) {
+                    domain = 'unknown';
+                }
+            }
+            // Convert domain to string for Map key
+            const domainKey = String(domain);
+            if (!groups.has(domainKey)) {
+                groups.set(domainKey, []);
+            }
+            groups.get(domainKey).push(item);
         }
         return groups;
     }
@@ -2283,16 +2361,177 @@ export class ImprovedNeuralAPI {
         return (density * 0.3 + coherence * 0.3 + domainRelevance * 0.4); // Weighted average
     }
     async _findCrossDomainMembers(cluster, threshold) {
-        // Find members that might belong to multiple domains
-        return [];
+        try {
+            // Find cluster members that have high similarity to items in other domains
+            const crossDomainMembers = [];
+            for (const memberId of cluster.members) {
+                try {
+                    // Get neighbors for this member
+                    const neighbors = await this.neighbors(memberId, {
+                        limit: 10,
+                        minSimilarity: threshold
+                    });
+                    if (Array.isArray(neighbors) && neighbors.length > 0) {
+                        // Check if any neighbors are NOT in this cluster
+                        const hasExternalNeighbors = neighbors.some(neighbor => !cluster.members.includes(typeof neighbor === 'object' ? neighbor.id : neighbor));
+                        if (hasExternalNeighbors) {
+                            crossDomainMembers.push(memberId);
+                        }
+                    }
+                }
+                catch (error) {
+                    // Skip members that can't be processed
+                    continue;
+                }
+            }
+            return crossDomainMembers;
+        }
+        catch (error) {
+            console.error('Error in _findCrossDomainMembers:', error);
+            return [];
+        }
     }
     async _findCrossDomainClusters(clusters, threshold) {
-        // Find clusters that span multiple domains
-        return [];
+        try {
+            const crossDomainClusters = [];
+            // Group clusters by domain
+            const domainMap = new Map();
+            for (const cluster of clusters) {
+                const domain = cluster.domain || 'unknown';
+                if (!domainMap.has(domain)) {
+                    domainMap.set(domain, []);
+                }
+                domainMap.get(domain).push(cluster);
+            }
+            // Find clusters with high inter-domain similarity
+            const domains = Array.from(domainMap.keys());
+            for (let i = 0; i < domains.length; i++) {
+                for (let j = i + 1; j < domains.length; j++) {
+                    const domain1 = domains[i];
+                    const domain2 = domains[j];
+                    const clusters1 = domainMap.get(domain1);
+                    const clusters2 = domainMap.get(domain2);
+                    // Compare clusters between domains
+                    for (const c1 of clusters1) {
+                        for (const c2 of clusters2) {
+                            try {
+                                // Calculate similarity between cluster centroids
+                                if (!c1.centroid || !c2.centroid || c1.centroid.length === 0 || c2.centroid.length === 0) {
+                                    continue;
+                                }
+                                const similarity = 1 - cosineDistance(Array.from(c1.centroid), Array.from(c2.centroid));
+                                if (similarity >= threshold) {
+                                    // Create a cross-domain cluster
+                                    const mergedMembers = [...new Set([...c1.members, ...c2.members])];
+                                    const mergedCentroid = this._averageVectors([
+                                        Array.from(c1.centroid),
+                                        Array.from(c2.centroid)
+                                    ]);
+                                    crossDomainClusters.push({
+                                        ...c1,
+                                        id: `cross-${domain1}-${domain2}-${crossDomainClusters.length}`,
+                                        label: `Cross-domain: ${c1.label} + ${c2.label}`,
+                                        members: mergedMembers,
+                                        centroid: mergedCentroid,
+                                        domain: `${domain1}+${domain2}`,
+                                        domainConfidence: similarity,
+                                        crossDomainMembers: mergedMembers
+                                    });
+                                }
+                            }
+                            catch (error) {
+                                // Skip cluster pairs that can't be compared
+                                continue;
+                            }
+                        }
+                    }
+                }
+            }
+            return crossDomainClusters;
+        }
+        catch (error) {
+            console.error('Error in _findCrossDomainClusters:', error);
+            return [];
+        }
+    }
+    _averageVectors(vectors) {
+        if (vectors.length === 0)
+            return [];
+        if (vectors.length === 1)
+            return [...vectors[0]];
+        const dim = vectors[0].length;
+        const result = new Array(dim).fill(0);
+        for (const vector of vectors) {
+            for (let i = 0; i < dim; i++) {
+                result[i] += vector[i];
+            }
+        }
+        for (let i = 0; i < dim; i++) {
+            result[i] /= vectors.length;
+        }
+        return result;
     }
     async _getItemsByTimeWindow(timeField, window) {
-        // Implementation would query items within time window
-        return [];
+        try {
+            // Query all items from brain
+            const result = await this.brain.find({
+                query: '',
+                limit: 10000 // Max items for clustering
+            });
+            if (!result || !Array.isArray(result)) {
+                return [];
+            }
+            // Filter items within the time window
+            const itemsInWindow = result.filter((item) => {
+                if (!item || !item.entity)
+                    return false;
+                const entity = item.entity;
+                // Get timestamp value from various possible locations
+                let timestamp = null;
+                // Check root level first
+                if (timeField === 'createdAt' || timeField === 'updatedAt') {
+                    timestamp = entity[timeField];
+                }
+                // Check metadata/data
+                if (timestamp == null) {
+                    timestamp = entity.metadata?.[timeField] || entity.data?.[timeField];
+                }
+                if (timestamp == null) {
+                    return false;
+                }
+                // Convert to Date if needed
+                const itemDate = timestamp instanceof Date ? timestamp : new Date(timestamp);
+                if (isNaN(itemDate.getTime())) {
+                    return false; // Invalid date
+                }
+                // Check if item falls within window
+                return itemDate >= window.start && itemDate <= window.end;
+            });
+            // Map to format expected by clustering methods
+            return itemsInWindow.map((item) => {
+                const entity = item.entity;
+                return {
+                    id: entity.id,
+                    vector: entity.embedding || entity.vector || [],
+                    metadata: {
+                        ...(entity.metadata || {}),
+                        ...(entity.data || {}),
+                        noun: entity.noun,
+                        type: entity.noun,
+                        createdAt: entity.createdAt,
+                        updatedAt: entity.updatedAt,
+                        label: entity.label
+                    },
+                    nounType: entity.noun,
+                    label: entity.label || entity.data || '',
+                    data: entity.data
+                };
+            });
+        }
+        catch (error) {
+            console.error('Error in _getItemsByTimeWindow:', error);
+            return [];
+        }
     }
     async _calculateTemporalMetrics(cluster, items, timeField) {
         // Calculate temporal characteristics of the cluster

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@soulcraft/brainy",
-  "version": "3.25.0",
+  "version": "3.25.2",
   "description": "Universal Knowledge Protocol™ - World's first Triple Intelligence database unifying vector, graph, and document search in one API. 31 nouns × 40 verbs for infinite expressiveness.",
   "main": "dist/index.js",
   "module": "dist/index.js",