@futdevpro/nts-dynamo 1.14.64 → 1.14.67

package/build/_modules/local-vector-search/_services/lvs-local-vector-search.data-service.js

@@ -0,0 +1,241 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DyNTS_LVS_VectorDataService = void 0;
+const fsm_dynamo_1 = require("@futdevpro/fsm-dynamo");
+const lvs_search_mode_enum_1 = require("../_enums/lvs-search-mode.enum");
+const lvs_vector_pool_control_service_1 = require("./lvs-vector-pool.control-service");
+const oai_vector_data_service_1 = require("../../ai/_modules/open-ai/_services/data-services/oai-vector-data.service");
+const global_settings_const_1 = require("../../../_collections/global-settings.const");
+/**
+ * Local Vector Data Service
+ * Extends {@link DyNTS_OAI_VectorDataService} to perform in-memory vector similarity search
+ * instead of MongoDB vector search
+ *
+ * This service loads data from the database, builds an in-memory vector pool,
+ * and performs brute-force vector similarity search using cosine similarity or L2 distance
+ *
+ * @example
+ * ```typescript
+ * const service = new DyNTS_OAI_LocalVectorDataService(
+ *   data,
+ *   dataParams,
+ *   openAISettings,
+ *   issuer
+ * );
+ *
+ * const results = await service.vectorSearch({
+ *   input: 'search query',
+ *   searchInKey: 'contentVectorized',
+ *   limit: 10,
+ *   filterBy: { category: 'docs' }
+ * });
+ * ```
+ */
+class DyNTS_LVS_VectorDataService extends oai_vector_data_service_1.DyNTS_OAI_VectorDataService {
+    /**
+     * Default search mode
+     * Cosine similarity is typically preferred for text embeddings
+     */
+    defaultSearchMode = lvs_search_mode_enum_1.LVS_Search_Mode.cosineSimilarity;
+    /**
+     * Whether to use L2 normalization when storing vectors
+     * Normalized vectors are more efficient for cosine similarity calculations
+     */
+    useL2Normalization = true;
+    /**
+     * Instance-based vector pool utility
+     * Minden service instance saját vektor pool-t tart fenn
+     */
+    vectorPool = new lvs_vector_pool_control_service_1.LVS_VectorPool_ControlService();
+    constructor(
+    /**
+     * Initial data, this will be used by functions on default
+     */
+    data, 
+    /**
+     * DB data params will be used to connect to usable dbService on GlobalService
+     */
+    dataParams, 
+    /**
+     * OpenAI settings
+     */
+    openAISettings, 
+    /**
+     * Initial set for issuer to be able to follow the issuer's activity
+     */
+    issuer) {
+        super(data, dataParams, openAISettings, issuer);
+    }
+    /**
+     * Overrides the parent vectorSearch method to perform local in-memory vector search
+     *
+     * Process:
+     * 1. Load data from DB using filterBy (if provided) or getAll()
+     * 2. Extract vectorized properties from loaded data
+     * 3. Build in-memory vector pool
+     * 4. Vectorize input query
+     * 5. Perform local vector search
+     * 6. Map search results back to full data objects
+     *
+     * @param set Search parameters
+     * @returns Array of data objects sorted by similarity score
+     */
+    async vectorSearch(set) {
+        try {
+            if (!set.input) {
+                throw new fsm_dynamo_1.DyFM_Error({
+                    ...this.getDefaultErrorSettings('vectorSearch', new Error('input is required')),
+                    errorCode: `${global_settings_const_1.DyNTS_global_settings.systemShortCodeName}|DyNTS-LVS-VS1`,
+                });
+            }
+            set.limit ??= 3;
+            const { input, searchInKey, limit, filterBy, searchMode } = set;
+            // Validáljuk, hogy a searchInKey létezik-e
+            const property = this.dataParams.properties[searchInKey];
+            if (!property) {
+                throw new fsm_dynamo_1.DyFM_Error({
+                    ...this.getDefaultErrorSettings('vectorSearch', new Error(`Property "${searchInKey}" not found! ` +
+                        `while searching "${this.dataParams.dataName}" ` +
+                        `(The searchable properties are: ` +
+                        `${this.vectorizedProperties.map(p => `"${p.key}"`).join(', ')})`)),
+                    errorCode: `${global_settings_const_1.DyNTS_global_settings.systemShortCodeName}|DyNTS-LVS-VS2`,
+                    __localStack: this.dataParams.stackLocation,
+                });
+            }
+            // Ellenőrizzük, hogy a property vectorized-e
+            if (!this.vectorizedProperties.some((p) => p.key === searchInKey)) {
+                throw new fsm_dynamo_1.DyFM_Error({
+                    ...this.getDefaultErrorSettings('vectorSearch', new Error(`Property "${searchInKey}" is not a vectorized property! ` +
+                        `(The vectorized properties are: ` +
+                        `${this.vectorizedProperties.map(p => `"${p.key}"`).join(', ')})`)),
+                    errorCode: `${global_settings_const_1.DyNTS_global_settings.systemShortCodeName}|DyNTS-LVS-VS3`,
+                    __localStack: this.dataParams.stackLocation,
+                });
+            }
+            // 1. Betöltjük az adatokat a DB-ből (filterBy-val szűrve, ha van)
+            let dataList;
+            if (filterBy) {
+                // Ha van filterBy, akkor először szűrünk a DB-ben
+                if (this.debugLog) {
+                    fsm_dynamo_1.DyFM_Log.log(`Local vector search: filtering data with filterBy...`);
+                }
+                dataList = await this.findDataList(filterBy, true);
+            }
+            else {
+                // Ha nincs filterBy, akkor minden adatot betöltünk
+                if (this.debugLog) {
+                    fsm_dynamo_1.DyFM_Log.log(`Local vector search: loading all data...`);
+                }
+                dataList = await this.getAll(true);
+            }
+            if (dataList.length === 0) {
+                if (this.debugLog) {
+                    fsm_dynamo_1.DyFM_Log.log(`Local vector search: no data found`);
+                }
+                return [];
+            }
+            // 2. Kinyerjük a vectorized property-ket és építjük a vector pool-t
+            if (this.debugLog) {
+                fsm_dynamo_1.DyFM_Log.log(`Local vector search: building vector pool from ${dataList.length} items...`);
+            }
+            // Töröljük a korábbi pool-t
+            this.vectorPool.clearPool();
+            // Hozzáadjuk a vektorokat a pool-hoz
+            const dataMap = new Map();
+            for (const dataItem of dataList) {
+                if (!dataItem._id) {
+                    // Ha nincs _id, akkor kihagyjuk
+                    if (this.debugLog) {
+                        fsm_dynamo_1.DyFM_Log.warn(`Local vector search: skipping item without _id`);
+                    }
+                    continue;
+                }
+                const vectorizedValue = dataItem[searchInKey];
+                if (!vectorizedValue || !Array.isArray(vectorizedValue)) {
+                    // Ha nincs vectorized érték, akkor kihagyjuk
+                    if (this.debugLog) {
+                        fsm_dynamo_1.DyFM_Log.warn(`Local vector search: skipping item "${dataItem._id}" ` +
+                            `without vectorized value for "${searchInKey}"`);
+                    }
+                    continue;
+                }
+                // Hozzáadjuk a vektort a pool-hoz
+                this.vectorPool.addVector(dataItem._id, vectorizedValue);
+                dataMap.set(dataItem._id, dataItem);
+            }
+            if (dataMap.size === 0) {
+                if (this.debugLog) {
+                    fsm_dynamo_1.DyFM_Log.log(`Local vector search: no valid vectors found`);
+                }
+                return [];
+            }
+            // 3. Vectorizáljuk a query input-ot
+            if (this.debugLog) {
+                fsm_dynamo_1.DyFM_Log.log(`Local vector search: vectorizing query input...`);
+            }
+            const queryVector = await this.vectorize(input, property.embeddingModel);
+            // 4. Végrehajtjuk a local vector search-t
+            const mode = searchMode ?? this.defaultSearchMode;
+            if (this.debugLog) {
+                fsm_dynamo_1.DyFM_Log.log(`Local vector search: searching with mode "${mode}", limit: ${limit}...`);
+            }
+            const searchResults = this.vectorPool.search(queryVector, limit, mode);
+            if (this.debugLog) {
+                fsm_dynamo_1.DyFM_Log.log(`Local vector search: found ${searchResults.length} results`);
+            }
+            // 5. Map-eljük vissza a search results-ot a teljes data objektumokra
+            const results = [];
+            for (const searchResult of searchResults) {
+                const dataItem = dataMap.get(searchResult.id);
+                if (dataItem) {
+                    results.push(dataItem);
+                }
+            }
+            // Töröljük a pool-t a memória felszabadítása érdekében
+            this.vectorPool.clearPool();
+            return results;
+        }
+        catch (error) {
+            // Töröljük a pool-t hiba esetén is
+            this.vectorPool.clearPool();
+            throw new fsm_dynamo_1.DyFM_Error({
+                ...this.getDefaultErrorSettings('vectorSearch', error),
+                errorCode: `${global_settings_const_1.DyNTS_global_settings.systemShortCodeName}|DyNTS-LVS-VS0`,
+            });
+        }
+    }
+}
+exports.DyNTS_LVS_VectorDataService = DyNTS_LVS_VectorDataService;
+/**
+ * @example
+ * ```typescript
+ * // Create a local vector data service
+ * const localVectorService = new DyNTS_OAI_LocalVectorDataService<CodeChunk>(
+ *   new CodeChunk(),
+ *   codeChunk_dataParams,
+ *   openAISettings,
+ *   'example-issuer'
+ * );
+ *
+ * // Perform vector search with filterBy
+ * const results = await localVectorService.vectorSearch({
+ *   input: 'How to implement authentication?',
+ *   searchInKey: 'chunkParentedContentVectorized',
+ *   limit: 5,
+ *   filterBy: {
+ *     // Filter by category before vector search
+ *     category: 'documentation'
+ *   },
+ *   searchMode: LVS_Search_Mode.cosineSimilarity
+ * });
+ *
+ * // Results are sorted by similarity score (highest first for cosine)
+ * console.log(`Found ${results.length} similar chunks`);
+ *
+ * // Access the results
+ * for (const result of results) {
+ *   console.log(`Chunk ID: ${result._id}, Content: ${result.chunkContent}`);
+ * }
+ * ```
+ */
+//# sourceMappingURL=lvs-local-vector-search.data-service.js.map

package/build/_modules/local-vector-search/_services/lvs-local-vector-search.data-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lvs-local-vector-search.data-service.js","sourceRoot":"","sources":["../../../../src/_modules/local-vector-search/_services/lvs-local-vector-search.data-service.ts"],"names":[],"mappings":";;;AAAA,sDAA6D;AAS7D,yEAAiE;AAEjE,uFAAkF;AAClF,uHAAwH;AACxH,uFAAoF;AAEpF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAa,2BAAqD,SAAQ,qDAA8B;IAEtG;;;OAGG;IACH,iBAAiB,GAAoB,sCAAe,CAAC,gBAAgB,CAAC;IAEtE;;;OAGG;IACH,kBAAkB,GAAY,IAAI,CAAC;IAEnC;;;OAGG;IACK,UAAU,GAAkC,IAAI,+DAA6B,EAAE,CAAC;IAExF;IACE;;OAEG;IACH,IAAO;IACP;;OAEG;IACH,UAAoC;IACpC;;OAEG;IACH,cAAiC;IACjC;;OAEG;IACH,MAAc;QAEd,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;;;;;;;;OAaG;IACM,KAAK,CAAC,YAAY,CACzB,GAmBC;QAED,IAAI,CAAC;YACH,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,IAAI,uBAAU,CAAC;oBACnB,GAAG,IAAI,CAAC,uBAAuB,CAC7B,cAAc,EACd,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAC/B;oBACD,SAAS,EAAE,GAAG,6CAAqB,CAAC,mBAAmB,gBAAgB;iBACxE,CAAC,CAAC;YACL,CAAC;YAED,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC;YAChB,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,GAAG,CAAC;YAEhE,2CAA2C;YAC3C,MAAM,QAAQ,GACZ,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAE1C,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,IAAI,uBAAU,CAAC;oBACnB,GAAG,IAAI,CAAC,uBAAuB,CAC7B,cAAc,EACd,IAAI,KAAK,CACP,aAAa,WAAW,eAAe;wBACvC,oBAAoB,IAAI,CAAC,UAAU,CAAC,QAAQ,IAAI;wBAChD,kCAAkC;wBAClC,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAClE,CACF;oBACD,SAAS,EAAE,GAAG,6CAAqB,CAAC,mBAAmB,gBAAgB;oBACvE,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,aAAa;iBAC5C,CAAC,CAAC;YACL,CAAC;YAED,6CAA6C;YAC7C,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CACjC,CAAC,CAAmC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,WAAW,CAC/D,EAAE,CAAC;gBACF,MAAM,IAAI,uBAAU,CAAC;oBACnB,GAAG,IAAI,CAAC,uBAAuB,CAC7B,cAAc,EACd,IAAI,KAAK,CACP,aAAa,WAAW,kCAAkC;wBAC1D,kCAAkC;wBAClC,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAClE,CACF;oBACD,SAAS,EAAE,GAAG,6CAAqB,CAAC,mBAAmB,gBAAgB;oBACvE,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,aAAa;iBAC5C,CAAC,CAAC;YACL,CAAC;YAED,kEAAkE;YAClE,IAAI,QAAa,CAAC;YAClB,IAAI,QAAQ,EAAE,CAAC;gBACb,kDAAkD;gBAClD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClB,qBAAQ,CAAC,GAAG,CAAC,sDAAsD,CAAC,CAAC;gBACvE,CAAC;gBACD,QAAQ,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,mDAAmD;gBACnD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClB,qBAAQ,CAAC,GAAG,CAAC,0CAA0C,CAAC,CAAC;gBAC3D,CAAC;gBACD,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;YAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClB,qBAAQ,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;gBACrD,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,oEAAoE;YACpE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,qBAAQ,CAAC,GAAG,CACV,kDAAkD,QAAQ,CAAC,MAAM,WAAW,CAC7E,CAAC;YACJ,CAAC;YAED,4BAA4B;YAC5B,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;YAE5B,qCAAqC;YACrC,MAAM,OAAO,GAAmB,IAAI,GAAG,EAAa,CAAC;YACrD,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBAChC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;oBAClB,gCAAgC;oBAChC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAClB,qBAAQ,CAAC,IAAI,CACX,gDAAgD,CACjD,CAAC;oBACJ,CAAC;oBACD,SAAS;gBACX,CAAC;gBAED,MAAM,eAAe,GACnB,QAAQ,CAAC,WAAW,CAAyB,CAAC;gBAEhD,IAAI,CAAC,eAAe,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,CAAC;oBACxD,6CAA6C;oBAC7C,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAClB,qBAAQ,CAAC,IAAI,CACX,uCAAuC,QAAQ,CAAC,GAAG,IAAI;4BACvD,iCAAiC,WAAW,GAAG,CAChD,CAAC;oBACJ,CAAC;oBACD,SAAS;gBACX,CAAC;gBAED,kCAAkC;gBAClC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,EAAE,eAAe,CAAC,CAAC;gBACzD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACvB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;oBAClB,qBAAQ,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAC;gBAC9D,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,oCAAoC;YACpC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,qBAAQ,CAAC,GAAG,CAAC,iDAAiD,CAAC,CAAC;YAClE,CAAC;YAED,MAAM,WAAW,GAAa,MAAM,IAAI,CAAC,SAAS,CAChD,KAAK,EACL,QAAQ,CAAC,cAAc,CACxB,CAAC;YAEF,0CAA0C;YAC1C,MAAM,IAAI,GAAoB,UAAU,IAAI,IAAI,CAAC,iBAAiB,CAAC;YAEnE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,qBAAQ,CAAC,GAAG,CACV,6CAA6C,IAAI,aAAa,KAAK,KAAK,CACzE,CAAC;YACJ,CAAC;YAED,MAAM,aAAa,GAAuB,IAAI,CAAC,UAAU,CAAC,MAAM,CAC9D,WAAW,EACX,KAAK,EACL,IAAI,CACL,CAAC;YAEF,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,qBAAQ,CAAC,GAAG,CACV,8BAA8B,aAAa,CAAC,MAAM,UAAU,CAC7D,CAAC;YACJ,CAAC;YAED,qEAAqE;YACrE,MAAM,OAAO,GAAQ,EAAE,CAAC;YACxB,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAkB,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;gBAC7D,IAAI,QAAQ,EAAE,CAAC;oBACb,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;YAED,uDAAuD;YACvD,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;YAE5B,OAAO,OAAO,CAAC;QACjB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,mCAAmC;YACnC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;YAE5B,MAAM,IAAI,uBAAU,CAAC;gBACnB,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,KAAK,CAAC;gBACtD,SAAS,EAAE,GAAG,6CAAqB,CAAC,mBAAmB,gBAAgB;aACxE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF;AA/PD,kEA+PC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG"}

package/build/_modules/local-vector-search/_services/lvs-vector-pool.control-service.d.ts

@@ -0,0 +1,71 @@
+import { LVS_Search_Mode } from '../_enums/lvs-search-mode.enum';
+import { LVS_SearchResult } from '../_models/lvs-search-result.interface';
+/**
+ * Vektor pool kezelő utility class
+ * Instance-based class, amely in-memory vektor pool-t kezel és vektor hasonlósági számításokat végez
+ * Minden instance saját vektor pool-t tart fenn
+ */
+export declare class LVS_VectorPool_ControlService {
+    /**
+     * In-memory vektor pool tárolás
+     * Key: vektor ID, Value: vektor értékek
+     */
+    private vectorPool;
+    /**
+     * Normalizált vektor pool tárolás (L2 normalizált másolatok)
+     * Key: vektor ID, Value: L2 normalizált vektor értékek
+     */
+    private normalizedVectorPool;
+    /**
+     * Hozzáad egy vektort a pool-hoz
+     * Opcionálisan L2 normalizált másolatot is tárol
+     */
+    addVector(id: string, vector: number[]): void;
+    /**
+     * Eltávolít egy vektort a pool-ból
+     */
+    removeVector(id: string): void;
+    /**
+     * Frissít egy vektort a pool-ban
+     */
+    updateVector(id: string, vector: number[]): void;
+    /**
+     * Törli az összes vektort a pool-ból
+     */
+    clearPool(): void;
+    /**
+     * Visszaadja az összes vektort a pool-ból
+     * Debugging és export céljára
+     */
+    getAll(): Map<string, number[]>;
+    /**
+     * L2 normalizálás egy vektorra
+     * A vektor hosszát 1-re normalizálja
+     * Statikus metódus, mivel nincs szüksége instance state-re
+     */
+    private static l2Normalize;
+    /**
+     * Cosine similarity számítás két vektor között
+     * Normalizált vektorokat használ a számításhoz
+     * Eredmény: 0 és 1 közötti érték, ahol 1 a legnagyobb hasonlóság
+     * Statikus metódus, mivel nincs szüksége instance state-re
+     */
+    static cosineSimilarity(a: number[], b: number[]): number;
+    /**
+     * L2 distance (Euklideszi távolság) számítás két vektor között
+     * Eredmény: 0 vagy pozitív érték, ahol 0 a legkisebb távolság
+     * Statikus metódus, mivel nincs szüksége instance state-re
+     */
+    static l2Distance(a: number[], b: number[]): number;
+    /**
+     * Vektor keresés a pool-ban
+     * Brute-force megközelítés (lineáris keresés)
+     *
+     * @param query A keresési query vektor
+     * @param k A visszaadandó találatok száma (top-K)
+     * @param mode A keresési mód (cosine similarity vagy L2 distance)
+     * @returns A top-K találatok ID-val és score-rel, megfelelő sorrendben
+     */
+    search(query: number[], k: number, mode: LVS_Search_Mode): LVS_SearchResult[];
+}
+//# sourceMappingURL=lvs-vector-pool.control-service.d.ts.map

package/build/_modules/local-vector-search/_services/lvs-vector-pool.control-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lvs-vector-pool.control-service.d.ts","sourceRoot":"","sources":["../../../../src/_modules/local-vector-search/_services/lvs-vector-pool.control-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AACjE,OAAO,EAAE,gBAAgB,EAAE,MAAM,wCAAwC,CAAC;AAE1E;;;;GAIG;AACH,qBAAa,6BAA6B;IACxC;;;OAGG;IACH,OAAO,CAAC,UAAU,CAAsD;IAExE;;;OAGG;IACH,OAAO,CAAC,oBAAoB,CAAsD;IAElF;;;OAGG;IACH,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI;IAwB7C;;OAEG;IACH,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAK9B;;OAEG;IACH,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI;IAQhD;;OAEG;IACH,SAAS,IAAI,IAAI;IAKjB;;;OAGG;IACH,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAI/B;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAa1B;;;;;OAKG;IACH,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM;IAsBzD;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM;IAiBnD;;;;;;;;OAQG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EAAE,EACf,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,eAAe,GACpB,gBAAgB,EAAE;CAqDtB"}

package/build/_modules/local-vector-search/_services/lvs-vector-pool.control-service.js

@@ -0,0 +1,182 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LVS_VectorPool_ControlService = void 0;
+const lvs_search_mode_enum_1 = require("../_enums/lvs-search-mode.enum");
+/**
+ * Vektor pool kezelő utility class
+ * Instance-based class, amely in-memory vektor pool-t kezel és vektor hasonlósági számításokat végez
+ * Minden instance saját vektor pool-t tart fenn
+ */
+class LVS_VectorPool_ControlService {
+    /**
+     * In-memory vektor pool tárolás
+     * Key: vektor ID, Value: vektor értékek
+     */
+    vectorPool = new Map();
+    /**
+     * Normalizált vektor pool tárolás (L2 normalizált másolatok)
+     * Key: vektor ID, Value: L2 normalizált vektor értékek
+     */
+    normalizedVectorPool = new Map();
+    /**
+     * Hozzáad egy vektort a pool-hoz
+     * Opcionálisan L2 normalizált másolatot is tárol
+     */
+    addVector(id, vector) {
+        if (!id) {
+            throw new Error('Vector ID is required');
+        }
+        if (!Array.isArray(vector) || vector.length === 0) {
+            throw new Error('Vector must be a non-empty array');
+        }
+        // Validáljuk, hogy a vektor számokból áll
+        for (let i = 0; i < vector.length; i++) {
+            if (typeof vector[i] !== 'number' || !isFinite(vector[i])) {
+                throw new Error(`Vector must contain only finite numbers at index ${i}`);
+            }
+        }
+        // Tároljuk az eredeti vektort
+        this.vectorPool.set(id, vector);
+        // L2 normalizált másolatot is tárolunk a cosine similarity számításokhoz
+        const normalized = LVS_VectorPool_ControlService.l2Normalize(vector);
+        this.normalizedVectorPool.set(id, normalized);
+    }
+    /**
+     * Eltávolít egy vektort a pool-ból
+     */
+    removeVector(id) {
+        this.vectorPool.delete(id);
+        this.normalizedVectorPool.delete(id);
+    }
+    /**
+     * Frissít egy vektort a pool-ban
+     */
+    updateVector(id, vector) {
+        if (!this.vectorPool.has(id)) {
+            throw new Error(`Vector with ID "${id}" does not exist`);
+        }
+        this.addVector(id, vector);
+    }
+    /**
+     * Törli az összes vektort a pool-ból
+     */
+    clearPool() {
+        this.vectorPool.clear();
+        this.normalizedVectorPool.clear();
+    }
+    /**
+     * Visszaadja az összes vektort a pool-ból
+     * Debugging és export céljára
+     */
+    getAll() {
+        return new Map(this.vectorPool);
+    }
+    /**
+     * L2 normalizálás egy vektorra
+     * A vektor hosszát 1-re normalizálja
+     * Statikus metódus, mivel nincs szüksége instance state-re
+     */
+    static l2Normalize(vector) {
+        const magnitude = Math.sqrt(vector.reduce((sum, value) => sum + value * value, 0));
+        if (magnitude === 0) {
+            // Ha a vektor nullvektor, akkor nullvektort adunk vissza
+            return new Array(vector.length).fill(0);
+        }
+        return vector.map((value) => value / magnitude);
+    }
+    /**
+     * Cosine similarity számítás két vektor között
+     * Normalizált vektorokat használ a számításhoz
+     * Eredmény: 0 és 1 közötti érték, ahol 1 a legnagyobb hasonlóság
+     * Statikus metódus, mivel nincs szüksége instance state-re
+     */
+    static cosineSimilarity(a, b) {
+        if (a.length !== b.length) {
+            throw new Error(`Vectors must have the same dimension. Got ${a.length} and ${b.length}`);
+        }
+        // Normalizáljuk a vektorokat
+        const normalizedA = this.l2Normalize(a);
+        const normalizedB = this.l2Normalize(b);
+        // Dot product számítása
+        let dotProduct = 0;
+        for (let i = 0; i < normalizedA.length; i++) {
+            dotProduct += normalizedA[i] * normalizedB[i];
+        }
+        // Cosine similarity = dot product of normalized vectors
+        // Mivel a vektorok normalizáltak, ez egyenlő a cosine similarity-vel
+        return dotProduct;
+    }
+    /**
+     * L2 distance (Euklideszi távolság) számítás két vektor között
+     * Eredmény: 0 vagy pozitív érték, ahol 0 a legkisebb távolság
+     * Statikus metódus, mivel nincs szüksége instance state-re
+     */
+    static l2Distance(a, b) {
+        if (a.length !== b.length) {
+            throw new Error(`Vectors must have the same dimension. Got ${a.length} and ${b.length}`);
+        }
+        // L2 distance = sqrt(sum((a[i] - b[i])^2))
+        let sumSquaredDiff = 0;
+        for (let i = 0; i < a.length; i++) {
+            const diff = a[i] - b[i];
+            sumSquaredDiff += diff * diff;
+        }
+        return Math.sqrt(sumSquaredDiff);
+    }
+    /**
+     * Vektor keresés a pool-ban
+     * Brute-force megközelítés (lineáris keresés)
+     *
+     * @param query A keresési query vektor
+     * @param k A visszaadandó találatok száma (top-K)
+     * @param mode A keresési mód (cosine similarity vagy L2 distance)
+     * @returns A top-K találatok ID-val és score-rel, megfelelő sorrendben
+     */
+    search(query, k, mode) {
+        if (!Array.isArray(query) || query.length === 0) {
+            throw new Error('Query vector must be a non-empty array');
+        }
+        if (k <= 0) {
+            throw new Error('k must be a positive number');
+        }
+        if (this.vectorPool.size === 0) {
+            return [];
+        }
+        // Validáljuk, hogy minden vektor ugyanolyan dimenziójú-e
+        const firstVector = Array.from(this.vectorPool.values())[0];
+        if (firstVector && firstVector.length !== query.length) {
+            throw new Error(`Query vector dimension (${query.length}) does not match pool vector ` +
+                `dimension (${firstVector.length})`);
+        }
+        // Számoljuk ki a hasonlóságot/távolságot minden vektorra
+        const results = [];
+        for (const [id, vector] of this.vectorPool.entries()) {
+            let score;
+            if (mode === lvs_search_mode_enum_1.LVS_Search_Mode.cosineSimilarity) {
+                // Cosine similarity: nagyobb érték = jobb hasonlóság
+                score = LVS_VectorPool_ControlService.cosineSimilarity(query, vector);
+            }
+            else if (mode === lvs_search_mode_enum_1.LVS_Search_Mode.l2Distance) {
+                // L2 distance: kisebb érték = jobb hasonlóság
+                score = LVS_VectorPool_ControlService.l2Distance(query, vector);
+            }
+            else {
+                throw new Error(`Unknown search mode: ${mode}`);
+            }
+            results.push({ id, score });
+        }
+        // Rendezzük az eredményeket
+        if (mode === lvs_search_mode_enum_1.LVS_Search_Mode.cosineSimilarity) {
+            // Cosine similarity: csökkenő sorrend (legnagyobb hasonlóság először)
+            results.sort((a, b) => b.score - a.score);
+        }
+        else {
+            // L2 distance: növekvő sorrend (legkisebb távolság először)
+            results.sort((a, b) => a.score - b.score);
+        }
+        // Visszaadjuk a top-K találatot
+        return results.slice(0, k);
+    }
+}
+exports.LVS_VectorPool_ControlService = LVS_VectorPool_ControlService;
+//# sourceMappingURL=lvs-vector-pool.control-service.js.map

package/build/_modules/local-vector-search/_services/lvs-vector-pool.control-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lvs-vector-pool.control-service.js","sourceRoot":"","sources":["../../../../src/_modules/local-vector-search/_services/lvs-vector-pool.control-service.ts"],"names":[],"mappings":";;;AAAA,yEAAiE;AAGjE;;;;GAIG;AACH,MAAa,6BAA6B;IACxC;;;OAGG;IACK,UAAU,GAA0B,IAAI,GAAG,EAAoB,CAAC;IAExE;;;OAGG;IACK,oBAAoB,GAA0B,IAAI,GAAG,EAAoB,CAAC;IAElF;;;OAGG;IACH,SAAS,CAAC,EAAU,EAAE,MAAgB;QACpC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QAED,0CAA0C;QAC1C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,EAAE,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAEhC,yEAAyE;QACzE,MAAM,UAAU,GAAa,6BAA6B,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC/E,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAU;QACrB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAU,EAAE,MAAgB;QACvC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,mBAAmB,EAAE,kBAAkB,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,SAAS;QACP,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,MAAM;QACJ,OAAO,IAAI,GAAG,CAAmB,IAAI,CAAC,UAAU,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,WAAW,CAAC,MAAgB;QACzC,MAAM,SAAS,GAAW,IAAI,CAAC,IAAI,CACjC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAW,EAAE,KAAa,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC,CAAC,CACtE,CAAC;QAEF,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,yDAAyD;YACzD,OAAO,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC9C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CACb,6CAA6C,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,MAAM,EAAE,CACxE,CAAC;QACJ,CAAC;QAED,6BAA6B;QAC7B,MAAM,WAAW,GAAa,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,WAAW,GAAa,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAElD,wBAAwB;QACxB,IAAI,UAAU,GAAW,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,wDAAwD;QACxD,qEAAqE;QACrE,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAW,EAAE,CAAW;QACxC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CACb,6CAA6C,CAAC,CAAC,MAAM,QAAQ,CAAC,CAAC,MAAM,EAAE,CACxE,CAAC;QACJ,CAAC;QAED,2CAA2C;QAC3C,IAAI,cAAc,GAAW,CAAC,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,cAAc,IAAI,IAAI,GAAG,IAAI,CAAC;QAChC,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CACJ,KAAe,EACf,CAAS,EACT,IAAqB;QAErB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACjD,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,yDAAyD;QACzD,MAAM,WAAW,GAAyB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YACvD,MAAM,IAAI,KAAK,CACb,2BAA2B,KAAK,CAAC,MAAM,+BAA+B;gBACtE,cAAc,WAAW,CAAC,MAAM,GAAG,CACpC,CAAC;QACJ,CAAC;QAED,yDAAyD;QACzD,MAAM,OAAO,GAAuB,EAAE,CAAC;QAEvC,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,IAAI,KAAa,CAAC;YAElB,IAAI,IAAI,KAAK,sCAAe,CAAC,gBAAgB,EAAE,CAAC;gBAC9C,qDAAqD;gBACrD,KAAK,GAAG,6BAA6B,CAAC,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACxE,CAAC;iBAAM,IAAI,IAAI,KAAK,sCAAe,CAAC,UAAU,EAAE,CAAC;gBAC/C,8CAA8C;gBAC9C,KAAK,GAAG,6BAA6B,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,EAAE,CAAC,CAAC;YAClD,CAAC;YAED,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,4BAA4B;QAC5B,IAAI,IAAI,KAAK,sCAAe,CAAC,gBAAgB,EAAE,CAAC;YAC9C,sEAAsE;YACtE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAmB,EAAE,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAChF,CAAC;aAAM,CAAC;YACN,4DAA4D;YAC5D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAmB,EAAE,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAChF,CAAC;QAED,gCAAgC;QAChC,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;CACF;AAlND,sEAkNC"}

package/build/_modules/local-vector-search/_services/lvs-vector-pool.control-service.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=lvs-vector-pool.control-service.spec.d.ts.map

package/build/_modules/local-vector-search/_services/lvs-vector-pool.control-service.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lvs-vector-pool.control-service.spec.d.ts","sourceRoot":"","sources":["../../../../src/_modules/local-vector-search/_services/lvs-vector-pool.control-service.spec.ts"],"names":[],"mappings":""}