soulcraft/brainy
2
0
Fork 0
Code Issues 1 Pull requests Projects Releases 335 Packages Wiki Activity Actions

fix: correct typo in README major updates section

Browse source 
🤖 Generated with [Claude Code](https://claude.ai/code)

Co-Authored-By: Claude <noreply@anthropic.com>
This commit is contained in:
David Snelling 2025-08-06 12:29:32 -07:00
parent d2ddb9199e
commit 1a4f035ffc
22 changed files with 4423 additions and 142 deletions
Download patch file Download diff file Expand all files Collapse all files

87
src/hnsw/hnswIndex.ts
View file

@ -280,7 +280,8 @@ export class HNSWIndex {
*/
public async search(
queryVector: Vector,
k: number = 10
k: number = 10,
filter?: (id: string) => Promise<boolean>
): Promise<Array<[string, number]>> {
if (this.nouns.size === 0) {
return []
@ -372,11 +373,14 @@ export class HNSWIndex {
}
// Search at level 0 with ef = k
// If we have a filter, increase ef to compensate for filtered results
const ef = filter ? Math.max(this.config.efSearch * 3, k * 3) : Math.max(this.config.efSearch, k)
const nearestNouns = await this.searchLayer(
queryVector,
currObj,
Math.max(this.config.efSearch, k),
0
ef,
0,
filter
)
// Convert to array and sort by distance
@ -599,24 +603,25 @@ export class HNSWIndex {
queryVector: Vector,
entryPoint: HNSWNoun,
ef: number,
level: number
level: number,
filter?: (id: string) => Promise<boolean>
): Promise<Map<string, number>> {
// Set of visited nouns
const visited = new Set<string>([entryPoint.id])
// Check if entry point passes filter
const entryPointDistance = this.distanceFunction(queryVector, entryPoint.vector)
const entryPointPasses = filter ? await filter(entryPoint.id) : true
// Priority queue of candidates (closest first)
const candidates = new Map<string, number>()
candidates.set(
entryPoint.id,
this.distanceFunction(queryVector, entryPoint.vector)
)
candidates.set(entryPoint.id, entryPointDistance)
// Priority queue of nearest neighbors found so far (closest first)
const nearest = new Map<string, number>()
nearest.set(
entryPoint.id,
this.distanceFunction(queryVector, entryPoint.vector)
)
if (entryPointPasses) {
nearest.set(entryPoint.id, entryPointDistance)
}
// While there are candidates to explore
while (candidates.size > 0) {
@ -660,17 +665,25 @@ export class HNSWIndex {
// Process the results
for (const { id, distance } of distances) {
// If we haven't found ef nearest neighbors yet, or this neighbor is closer than the farthest one we've found
if (nearest.size < ef || distance < farthestInNearest[1]) {
candidates.set(id, distance)
nearest.set(id, distance)
// Apply filter if provided
const passes = filter ? await filter(id) : true
// Always add to candidates for graph traversal
candidates.set(id, distance)
// Only add to nearest if it passes the filter
if (passes) {
// If we haven't found ef nearest neighbors yet, or this neighbor is closer than the farthest one we've found
if (nearest.size < ef || distance < farthestInNearest[1]) {
nearest.set(id, distance)
// If we have more than ef neighbors, remove the farthest one
if (nearest.size > ef) {
const sortedNearest = [...nearest].sort((a, b) => a[1] - b[1])
nearest.clear()
for (let i = 0; i < ef; i++) {
nearest.set(sortedNearest[i][0], sortedNearest[i][1])
// If we have more than ef neighbors, remove the farthest one
if (nearest.size > ef) {
const sortedNearest = [...nearest].sort((a, b) => a[1] - b[1])
nearest.clear()
for (let i = 0; i < ef; i++) {
nearest.set(sortedNearest[i][0], sortedNearest[i][1])
}
}
}
}
@ -691,18 +704,26 @@ export class HNSWIndex {
queryVector,
neighbor.vector
)
// Apply filter if provided
const passes = filter ? await filter(neighborId) : true
// Always add to candidates for graph traversal
candidates.set(neighborId, distToNeighbor)
// Only add to nearest if it passes the filter
if (passes) {
// If we haven't found ef nearest neighbors yet, or this neighbor is closer than the farthest one we've found
if (nearest.size < ef || distToNeighbor < farthestInNearest[1]) {
nearest.set(neighborId, distToNeighbor)
// If we haven't found ef nearest neighbors yet, or this neighbor is closer than the farthest one we've found
if (nearest.size < ef || distToNeighbor < farthestInNearest[1]) {
candidates.set(neighborId, distToNeighbor)
nearest.set(neighborId, distToNeighbor)
// If we have more than ef neighbors, remove the farthest one
if (nearest.size > ef) {
const sortedNearest = [...nearest].sort((a, b) => a[1] - b[1])
nearest.clear()
for (let i = 0; i < ef; i++) {
nearest.set(sortedNearest[i][0], sortedNearest[i][1])
// If we have more than ef neighbors, remove the farthest one
if (nearest.size > ef) {
const sortedNearest = [...nearest].sort((a, b) => a[1] - b[1])
nearest.clear()
for (let i = 0; i < ef; i++) {
nearest.set(sortedNearest[i][0], sortedNearest[i][1])
}
}
}
}

7
src/hnsw/optimizedHNSWIndex.ts
View file

@ -131,7 +131,8 @@ export class OptimizedHNSWIndex extends HNSWIndex {
*/
public async search(
queryVector: Vector,
k: number = 10
k: number = 10,
filter?: (id: string) => Promise<boolean>
): Promise<Array<[string, number]>> {
const startTime = Date.now()
@ -160,10 +161,10 @@ export class OptimizedHNSWIndex extends HNSWIndex {
try {
// This is a simplified approach - in practice, we'd need to modify
// the parent class to accept runtime parameter changes
results = await super.search(queryVector, k)
results = await super.search(queryVector, k, filter)
} catch (error) {
console.error('Optimized search failed, falling back to default:', error)
results = await super.search(queryVector, k)
results = await super.search(queryVector, k, filter)
}
// Record performance metrics