@workglow/storage 0.0.102 → 0.0.103

package/dist/browser.js

@@ -1031,7 +1031,14 @@ class InMemoryKvStorage extends KvViaTabularStorage {
   }
 }
 // src/queue/InMemoryQueueStorage.ts
-import { createServiceToken as createServiceToken9, EventEmitter as EventEmitter3, makeFingerprint as makeFingerprint4, sleep, uuid4 as uuid42 } from "@workglow/util";
+import {
+  createServiceToken as createServiceToken9,
+  EventEmitter as EventEmitter3,
+  getLogger,
+  makeFingerprint as makeFingerprint4,
+  sleep,
+  uuid4 as uuid42
+} from "@workglow/util";
 
 // src/queue/IQueueStorage.ts
 import { createServiceToken as createServiceToken8 } from "@workglow/util";
@@ -1125,11 +1132,23 @@ class InMemoryQueueStorage {
     await sleep(0);
     const job = this.jobQueue.find((j) => j.id === id && this.matchesPrefixes(j));
     if (!job) {
-      console.warn("Job not found for progress update", id);
+      const jobWithAnyPrefix = this.jobQueue.find((j) => j.id === id);
+      getLogger().warn("Job not found for progress update", {
+        id,
+        reason: jobWithAnyPrefix ? "prefix_mismatch" : "missing",
+        existingStatus: jobWithAnyPrefix?.status,
+        queueName: this.queueName,
+        prefixValues: this.prefixValues
+      });
       return;
     }
     if (job.status === JobStatus.COMPLETED || job.status === JobStatus.FAILED) {
-      console.warn("Job already completed or failed for progress update", id);
+      getLogger().warn("Job already completed or failed for progress update", {
+        id,
+        status: job.status,
+        completedAt: job.completed_at,
+        error: job.error
+      });
       return;
     }
     const oldJob = { ...job };
@@ -4740,6 +4759,105 @@ class SupabaseRateLimiterStorage {
       throw nextError;
   }
 }
+// src/vector/IndexedDbVectorStorage.ts
+import { cosineSimilarity as cosineSimilarity2, createServiceToken as createServiceToken21 } from "@workglow/util";
+var IDB_VECTOR_REPOSITORY = createServiceToken21("storage.vectorRepository.indexedDb");
+function matchesFilter2(metadata, filter) {
+  for (const [key, value] of Object.entries(filter)) {
+    if (metadata[key] !== value) {
+      return false;
+    }
+  }
+  return true;
+}
+function textRelevance2(text, query) {
+  const textLower = text.toLowerCase();
+  const queryLower = query.toLowerCase();
+  const queryWords = queryLower.split(/\s+/).filter((w) => w.length > 0);
+  if (queryWords.length === 0) {
+    return 0;
+  }
+  let matches = 0;
+  for (const word of queryWords) {
+    if (textLower.includes(word)) {
+      matches++;
+    }
+  }
+  return matches / queryWords.length;
+}
+
+class IndexedDbVectorStorage extends IndexedDbTabularStorage {
+  vectorDimensions;
+  VectorType;
+  vectorPropertyName;
+  metadataPropertyName;
+  constructor(table = "vectors", schema, primaryKeyNames, indexes = [], dimensions, VectorType = Float32Array, migrationOptions = {}, clientProvidedKeys = "if-missing") {
+    super(table, schema, primaryKeyNames, indexes, migrationOptions, clientProvidedKeys);
+    this.vectorDimensions = dimensions;
+    this.VectorType = VectorType;
+    const vectorProp = getVectorProperty(schema);
+    if (!vectorProp) {
+      throw new Error("Schema must have a property with type array and format TypedArray");
+    }
+    this.vectorPropertyName = vectorProp;
+    this.metadataPropertyName = getMetadataProperty(schema);
+  }
+  getVectorDimensions() {
+    return this.vectorDimensions;
+  }
+  async similaritySearch(query, options = {}) {
+    const { topK = 10, filter, scoreThreshold = 0 } = options;
+    const results = [];
+    const allEntities = await this.getAll() || [];
+    for (const entity of allEntities) {
+      const vector = entity[this.vectorPropertyName];
+      const metadata = this.metadataPropertyName ? entity[this.metadataPropertyName] : {};
+      if (filter && !matchesFilter2(metadata, filter)) {
+        continue;
+      }
+      const score = cosineSimilarity2(query, vector);
+      if (score < scoreThreshold) {
+        continue;
+      }
+      results.push({
+        ...entity,
+        score
+      });
+    }
+    results.sort((a, b) => b.score - a.score);
+    const topResults = results.slice(0, topK);
+    return topResults;
+  }
+  async hybridSearch(query, options) {
+    const { topK = 10, filter, scoreThreshold = 0, textQuery, vectorWeight = 0.7 } = options;
+    if (!textQuery || textQuery.trim().length === 0) {
+      return this.similaritySearch(query, { topK, filter, scoreThreshold });
+    }
+    const results = [];
+    const allEntities = await this.getAll() || [];
+    for (const entity of allEntities) {
+      const vector = entity[this.vectorPropertyName];
+      const metadata = this.metadataPropertyName ? entity[this.metadataPropertyName] : {};
+      if (filter && !matchesFilter2(metadata, filter)) {
+        continue;
+      }
+      const vectorScore = cosineSimilarity2(query, vector);
+      const metadataText = Object.values(metadata).join(" ").toLowerCase();
+      const textScore = textRelevance2(metadataText, textQuery);
+      const combinedScore = vectorWeight * vectorScore + (1 - vectorWeight) * textScore;
+      if (combinedScore < scoreThreshold) {
+        continue;
+      }
+      results.push({
+        ...entity,
+        score: combinedScore
+      });
+    }
+    results.sort((a, b) => b.score - a.score);
+    const topResults = results.slice(0, topK);
+    return topResults;
+  }
+}
 export {
   registerTabularRepository,
   isSearchCondition,
@@ -4770,6 +4888,7 @@ export {
   KvStorage,
   KV_REPOSITORY,
   JobStatus,
+  IndexedDbVectorStorage,
   IndexedDbTabularStorage,
   IndexedDbRateLimiterStorage,
   IndexedDbQueueStorage,
@@ -4783,6 +4902,7 @@ export {
   IN_MEMORY_QUEUE_STORAGE,
   INDEXED_DB_RATE_LIMITER_STORAGE,
   INDEXED_DB_QUEUE_STORAGE,
+  IDB_VECTOR_REPOSITORY,
   IDB_TABULAR_REPOSITORY,
   IDB_KV_REPOSITORY,
   HybridSubscriptionManager,
@@ -4795,4 +4915,4 @@ export {
   BaseTabularStorage
 };
 
-//# debugId=B7E554C36B7CCFEF64756E2164756E21
+//# debugId=E59320A7A95CC7EE64756E2164756E21