@wiscale/tauri-plugin-velesdb 1.14.4 → 1.17.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.d.mts +181 -2
- package/dist/index.d.ts +181 -2
- package/dist/index.js +74 -29
- package/dist/index.mjs +65 -29
- package/package.json +1 -1
package/dist/index.d.mts
CHANGED
|
@@ -511,7 +511,7 @@ declare function deletePoints(request: DeletePointsRequest): Promise<void>;
|
|
|
511
511
|
* collection: 'documents',
|
|
512
512
|
* searches: [
|
|
513
513
|
* { vector: embedding1, topK: 5 },
|
|
514
|
-
* { vector: embedding2, topK: 10, filter: { category: 'tech' } }
|
|
514
|
+
* { vector: embedding2, topK: 10, filter: { condition: { type: 'eq', field: 'category', value: 'tech' } } }
|
|
515
515
|
* ]
|
|
516
516
|
* });
|
|
517
517
|
* responses.forEach((resp, i) => {
|
|
@@ -873,5 +873,184 @@ declare function proceduralLearn(request: ProceduralLearnRequest): Promise<void>
|
|
|
873
873
|
* @returns Array of matching procedures
|
|
874
874
|
*/
|
|
875
875
|
declare function proceduralRecall(request: ProceduralRecallRequest): Promise<ProceduralMatchResult[]>;
|
|
876
|
+
/** Request for sparse-only vector search. */
|
|
877
|
+
interface SparseSearchRequest {
|
|
878
|
+
/** Target collection name. */
|
|
879
|
+
collection: string;
|
|
880
|
+
/** Sparse vector as `{ "<dimIndex>": weight, ... }`. */
|
|
881
|
+
sparseVector: Record<string, number>;
|
|
882
|
+
/** Number of results to return. Default: 10. */
|
|
883
|
+
topK?: number;
|
|
884
|
+
/** Optional named sparse index to query. */
|
|
885
|
+
indexName?: string;
|
|
886
|
+
}
|
|
887
|
+
/** Request for hybrid dense + sparse search. */
|
|
888
|
+
interface HybridSparseSearchRequest {
|
|
889
|
+
/** Target collection name. */
|
|
890
|
+
collection: string;
|
|
891
|
+
/** Dense query vector. */
|
|
892
|
+
vector: number[];
|
|
893
|
+
/** Sparse vector as `{ "<dimIndex>": weight, ... }`. */
|
|
894
|
+
sparseVector: Record<string, number>;
|
|
895
|
+
/** Number of results to return. Default: 10. */
|
|
896
|
+
topK?: number;
|
|
897
|
+
}
|
|
898
|
+
/** A {@link PointInput} carrying an optional sparse vector. */
|
|
899
|
+
interface SparsePointInput extends PointInput {
|
|
900
|
+
/** Optional sparse vector as `{ "<dimIndex>": weight, ... }`. */
|
|
901
|
+
sparseVector?: Record<string, number>;
|
|
902
|
+
}
|
|
903
|
+
/** Request to upsert points with optional sparse vectors. */
|
|
904
|
+
interface SparseUpsertRequest {
|
|
905
|
+
/** Target collection name. */
|
|
906
|
+
collection: string;
|
|
907
|
+
/** Points to insert or update. */
|
|
908
|
+
points: SparsePointInput[];
|
|
909
|
+
}
|
|
910
|
+
/**
|
|
911
|
+
* Searches a collection using a sparse vector (inverted-index retrieval).
|
|
912
|
+
*
|
|
913
|
+
* @param request - Sparse query parameters
|
|
914
|
+
* @returns Search results ordered by relevance
|
|
915
|
+
* @throws {CommandError} If the collection does not exist
|
|
916
|
+
*
|
|
917
|
+
* @example
|
|
918
|
+
* ```typescript
|
|
919
|
+
* const res = await sparseSearch({
|
|
920
|
+
* collection: 'docs',
|
|
921
|
+
* sparseVector: { '12': 0.8, '57': 0.6 },
|
|
922
|
+
* topK: 10,
|
|
923
|
+
* });
|
|
924
|
+
* ```
|
|
925
|
+
*/
|
|
926
|
+
declare function sparseSearch(request: SparseSearchRequest): Promise<SearchResponse>;
|
|
927
|
+
/**
|
|
928
|
+
* Searches a collection using both a dense and a sparse vector, fusing results.
|
|
929
|
+
*
|
|
930
|
+
* @param request - Hybrid dense + sparse query parameters
|
|
931
|
+
* @returns Fused search results ordered by relevance
|
|
932
|
+
* @throws {CommandError} If the collection does not exist
|
|
933
|
+
*/
|
|
934
|
+
declare function hybridSparseSearch(request: HybridSparseSearchRequest): Promise<SearchResponse>;
|
|
935
|
+
/**
|
|
936
|
+
* Upserts points with optional sparse vectors for hybrid retrieval.
|
|
937
|
+
*
|
|
938
|
+
* @param request - Points to insert or update
|
|
939
|
+
* @returns Number of points written
|
|
940
|
+
* @throws {CommandError} On dimension mismatch or write failure
|
|
941
|
+
*/
|
|
942
|
+
declare function sparseUpsert(request: SparseUpsertRequest): Promise<number>;
|
|
943
|
+
/** Request to train a Product Quantizer over a collection's vectors. */
|
|
944
|
+
interface TrainPqRequest {
|
|
945
|
+
/** Target collection name. */
|
|
946
|
+
collection: string;
|
|
947
|
+
/** Number of sub-quantizers. */
|
|
948
|
+
m?: number;
|
|
949
|
+
/** Number of centroids per sub-quantizer. */
|
|
950
|
+
k?: number;
|
|
951
|
+
/** Whether to use Optimized Product Quantization (OPQ). */
|
|
952
|
+
opq?: boolean;
|
|
953
|
+
}
|
|
954
|
+
/**
|
|
955
|
+
* Trains a Product Quantizer on the collection's existing vectors.
|
|
956
|
+
*
|
|
957
|
+
* @param request - PQ training parameters
|
|
958
|
+
* @returns A human-readable training summary
|
|
959
|
+
* @throws {CommandError} If the collection has too few vectors to train
|
|
960
|
+
*/
|
|
961
|
+
declare function trainPq(request: TrainPqRequest): Promise<string>;
|
|
962
|
+
/** Request to stream-insert points (requires the `persistence` feature). */
|
|
963
|
+
interface StreamInsertRequest {
|
|
964
|
+
/** Target collection name. */
|
|
965
|
+
collection: string;
|
|
966
|
+
/** Points to stream-insert. */
|
|
967
|
+
points: PointInput[];
|
|
968
|
+
}
|
|
969
|
+
/**
|
|
970
|
+
* Streams a batch of points into a collection for high-throughput ingestion.
|
|
971
|
+
*
|
|
972
|
+
* Only available when the plugin is built with the `persistence` feature.
|
|
973
|
+
*
|
|
974
|
+
* @param request - Points to stream-insert
|
|
975
|
+
* @returns Number of points written
|
|
976
|
+
* @throws {CommandError} If persistence is disabled or the write fails
|
|
977
|
+
*/
|
|
978
|
+
declare function streamInsert(request: StreamInsertRequest): Promise<number>;
|
|
979
|
+
/** Request to create a secondary index on a metadata field. */
|
|
980
|
+
interface CreateIndexRequest {
|
|
981
|
+
/** Target collection name. */
|
|
982
|
+
collection: string;
|
|
983
|
+
/** Metadata field name to index. */
|
|
984
|
+
fieldName: string;
|
|
985
|
+
}
|
|
986
|
+
/** Request to drop a secondary index on a metadata field. */
|
|
987
|
+
interface DropIndexRequest {
|
|
988
|
+
/** Target collection name. */
|
|
989
|
+
collection: string;
|
|
990
|
+
/** Metadata field name whose index to drop. */
|
|
991
|
+
fieldName: string;
|
|
992
|
+
}
|
|
993
|
+
/** Request to list secondary indexes on a collection. */
|
|
994
|
+
interface ListIndexesRequest {
|
|
995
|
+
/** Target collection name. */
|
|
996
|
+
collection: string;
|
|
997
|
+
}
|
|
998
|
+
/** A single secondary index entry. */
|
|
999
|
+
interface IndexInfoOutput {
|
|
1000
|
+
/** Node label (or field name for secondary indexes). */
|
|
1001
|
+
label: string;
|
|
1002
|
+
/** Property name. */
|
|
1003
|
+
property: string;
|
|
1004
|
+
/** Index type (`hash`, `range`, or `secondary`). */
|
|
1005
|
+
indexType: string;
|
|
1006
|
+
/** Number of unique values indexed. */
|
|
1007
|
+
cardinality: number;
|
|
1008
|
+
/** Memory usage in bytes. */
|
|
1009
|
+
memoryBytes: number;
|
|
1010
|
+
}
|
|
1011
|
+
/**
|
|
1012
|
+
* Creates a secondary index on a metadata field for faster filtered search.
|
|
1013
|
+
*
|
|
1014
|
+
* @param request - Index target
|
|
1015
|
+
* @throws {CommandError} If the collection does not exist
|
|
1016
|
+
*/
|
|
1017
|
+
declare function createIndex(request: CreateIndexRequest): Promise<void>;
|
|
1018
|
+
/**
|
|
1019
|
+
* Drops a secondary index on a metadata field.
|
|
1020
|
+
*
|
|
1021
|
+
* @param request - Index target
|
|
1022
|
+
* @returns `true` if an index was removed, `false` if none existed
|
|
1023
|
+
* @throws {CommandError} If the collection does not exist
|
|
1024
|
+
*/
|
|
1025
|
+
declare function dropIndex(request: DropIndexRequest): Promise<boolean>;
|
|
1026
|
+
/**
|
|
1027
|
+
* Lists all secondary indexes on a collection.
|
|
1028
|
+
*
|
|
1029
|
+
* @param request - Target collection
|
|
1030
|
+
* @returns Array of index descriptors
|
|
1031
|
+
* @throws {CommandError} If the collection does not exist
|
|
1032
|
+
*/
|
|
1033
|
+
declare function listIndexes(request: ListIndexesRequest): Promise<IndexInfoOutput[]>;
|
|
1034
|
+
/** Request for multi-source parallel BFS traversal. */
|
|
1035
|
+
interface TraverseGraphParallelRequest {
|
|
1036
|
+
/** Target collection name. */
|
|
1037
|
+
collection: string;
|
|
1038
|
+
/** Source node IDs to start traversal from. */
|
|
1039
|
+
sources: number[];
|
|
1040
|
+
/** Maximum traversal depth. Default: 3. */
|
|
1041
|
+
maxDepth?: number;
|
|
1042
|
+
/** Maximum results to return. Default: 100. */
|
|
1043
|
+
limit?: number;
|
|
1044
|
+
/** Optional relationship types to follow. */
|
|
1045
|
+
relTypes?: string[];
|
|
1046
|
+
}
|
|
1047
|
+
/**
|
|
1048
|
+
* Runs a multi-source parallel BFS traversal over a graph collection.
|
|
1049
|
+
*
|
|
1050
|
+
* @param request - Parallel traversal parameters
|
|
1051
|
+
* @returns Array of traversal result nodes
|
|
1052
|
+
* @throws {CommandError} If the collection is not a graph collection
|
|
1053
|
+
*/
|
|
1054
|
+
declare function traverseGraphParallel(request: TraverseGraphParallelRequest): Promise<TraversalOutput[]>;
|
|
876
1055
|
|
|
877
|
-
export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateGraphCollectionRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type EdgeOutput, type EpisodicRecentRequest, type EpisodicRecordRequest, type EpisodicResult, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridResult, type HybridSearchRequest, type IndividualSearchRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type ProceduralLearnRequest, type ProceduralMatchResult, type ProceduralRecallRequest, type QueryRequest, type QueryResponse, type ScrollRequest, type ScrollResponse, type SearchRequest, type SearchResponse, type SearchResult, type SemanticQueryRequest, type SemanticQueryResult, type SemanticStoreRequest, type StorageMode, type TextSearchRequest, type TraversalOutput, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createGraphCollection, createMetadataCollection, deleteCollection, deletePoints, episodicRecent, episodicRecord, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, isEmpty, listCollections, multiQuerySearch, proceduralLearn, proceduralRecall, query, scrollCollection, search, semanticQuery, semanticStore, textSearch, traverseGraph, upsert, upsertMetadata };
|
|
1056
|
+
export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateGraphCollectionRequest, type CreateIndexRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type DropIndexRequest, type EdgeOutput, type EpisodicRecentRequest, type EpisodicRecordRequest, type EpisodicResult, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridResult, type HybridSearchRequest, type HybridSparseSearchRequest, type IndexInfoOutput, type IndividualSearchRequest, type ListIndexesRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type ProceduralLearnRequest, type ProceduralMatchResult, type ProceduralRecallRequest, type QueryRequest, type QueryResponse, type ScrollRequest, type ScrollResponse, type SearchRequest, type SearchResponse, type SearchResult, type SemanticQueryRequest, type SemanticQueryResult, type SemanticStoreRequest, type SparsePointInput, type SparseSearchRequest, type SparseUpsertRequest, type StorageMode, type StreamInsertRequest, type TextSearchRequest, type TrainPqRequest, type TraversalOutput, type TraverseGraphParallelRequest, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createGraphCollection, createIndex, createMetadataCollection, deleteCollection, deletePoints, dropIndex, episodicRecent, episodicRecord, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, hybridSparseSearch, isEmpty, listCollections, listIndexes, multiQuerySearch, proceduralLearn, proceduralRecall, query, scrollCollection, search, semanticQuery, semanticStore, sparseSearch, sparseUpsert, streamInsert, textSearch, trainPq, traverseGraph, traverseGraphParallel, upsert, upsertMetadata };
|
package/dist/index.d.ts
CHANGED
|
@@ -511,7 +511,7 @@ declare function deletePoints(request: DeletePointsRequest): Promise<void>;
|
|
|
511
511
|
* collection: 'documents',
|
|
512
512
|
* searches: [
|
|
513
513
|
* { vector: embedding1, topK: 5 },
|
|
514
|
-
* { vector: embedding2, topK: 10, filter: { category: 'tech' } }
|
|
514
|
+
* { vector: embedding2, topK: 10, filter: { condition: { type: 'eq', field: 'category', value: 'tech' } } }
|
|
515
515
|
* ]
|
|
516
516
|
* });
|
|
517
517
|
* responses.forEach((resp, i) => {
|
|
@@ -873,5 +873,184 @@ declare function proceduralLearn(request: ProceduralLearnRequest): Promise<void>
|
|
|
873
873
|
* @returns Array of matching procedures
|
|
874
874
|
*/
|
|
875
875
|
declare function proceduralRecall(request: ProceduralRecallRequest): Promise<ProceduralMatchResult[]>;
|
|
876
|
+
/** Request for sparse-only vector search. */
|
|
877
|
+
interface SparseSearchRequest {
|
|
878
|
+
/** Target collection name. */
|
|
879
|
+
collection: string;
|
|
880
|
+
/** Sparse vector as `{ "<dimIndex>": weight, ... }`. */
|
|
881
|
+
sparseVector: Record<string, number>;
|
|
882
|
+
/** Number of results to return. Default: 10. */
|
|
883
|
+
topK?: number;
|
|
884
|
+
/** Optional named sparse index to query. */
|
|
885
|
+
indexName?: string;
|
|
886
|
+
}
|
|
887
|
+
/** Request for hybrid dense + sparse search. */
|
|
888
|
+
interface HybridSparseSearchRequest {
|
|
889
|
+
/** Target collection name. */
|
|
890
|
+
collection: string;
|
|
891
|
+
/** Dense query vector. */
|
|
892
|
+
vector: number[];
|
|
893
|
+
/** Sparse vector as `{ "<dimIndex>": weight, ... }`. */
|
|
894
|
+
sparseVector: Record<string, number>;
|
|
895
|
+
/** Number of results to return. Default: 10. */
|
|
896
|
+
topK?: number;
|
|
897
|
+
}
|
|
898
|
+
/** A {@link PointInput} carrying an optional sparse vector. */
|
|
899
|
+
interface SparsePointInput extends PointInput {
|
|
900
|
+
/** Optional sparse vector as `{ "<dimIndex>": weight, ... }`. */
|
|
901
|
+
sparseVector?: Record<string, number>;
|
|
902
|
+
}
|
|
903
|
+
/** Request to upsert points with optional sparse vectors. */
|
|
904
|
+
interface SparseUpsertRequest {
|
|
905
|
+
/** Target collection name. */
|
|
906
|
+
collection: string;
|
|
907
|
+
/** Points to insert or update. */
|
|
908
|
+
points: SparsePointInput[];
|
|
909
|
+
}
|
|
910
|
+
/**
|
|
911
|
+
* Searches a collection using a sparse vector (inverted-index retrieval).
|
|
912
|
+
*
|
|
913
|
+
* @param request - Sparse query parameters
|
|
914
|
+
* @returns Search results ordered by relevance
|
|
915
|
+
* @throws {CommandError} If the collection does not exist
|
|
916
|
+
*
|
|
917
|
+
* @example
|
|
918
|
+
* ```typescript
|
|
919
|
+
* const res = await sparseSearch({
|
|
920
|
+
* collection: 'docs',
|
|
921
|
+
* sparseVector: { '12': 0.8, '57': 0.6 },
|
|
922
|
+
* topK: 10,
|
|
923
|
+
* });
|
|
924
|
+
* ```
|
|
925
|
+
*/
|
|
926
|
+
declare function sparseSearch(request: SparseSearchRequest): Promise<SearchResponse>;
|
|
927
|
+
/**
|
|
928
|
+
* Searches a collection using both a dense and a sparse vector, fusing results.
|
|
929
|
+
*
|
|
930
|
+
* @param request - Hybrid dense + sparse query parameters
|
|
931
|
+
* @returns Fused search results ordered by relevance
|
|
932
|
+
* @throws {CommandError} If the collection does not exist
|
|
933
|
+
*/
|
|
934
|
+
declare function hybridSparseSearch(request: HybridSparseSearchRequest): Promise<SearchResponse>;
|
|
935
|
+
/**
|
|
936
|
+
* Upserts points with optional sparse vectors for hybrid retrieval.
|
|
937
|
+
*
|
|
938
|
+
* @param request - Points to insert or update
|
|
939
|
+
* @returns Number of points written
|
|
940
|
+
* @throws {CommandError} On dimension mismatch or write failure
|
|
941
|
+
*/
|
|
942
|
+
declare function sparseUpsert(request: SparseUpsertRequest): Promise<number>;
|
|
943
|
+
/** Request to train a Product Quantizer over a collection's vectors. */
|
|
944
|
+
interface TrainPqRequest {
|
|
945
|
+
/** Target collection name. */
|
|
946
|
+
collection: string;
|
|
947
|
+
/** Number of sub-quantizers. */
|
|
948
|
+
m?: number;
|
|
949
|
+
/** Number of centroids per sub-quantizer. */
|
|
950
|
+
k?: number;
|
|
951
|
+
/** Whether to use Optimized Product Quantization (OPQ). */
|
|
952
|
+
opq?: boolean;
|
|
953
|
+
}
|
|
954
|
+
/**
|
|
955
|
+
* Trains a Product Quantizer on the collection's existing vectors.
|
|
956
|
+
*
|
|
957
|
+
* @param request - PQ training parameters
|
|
958
|
+
* @returns A human-readable training summary
|
|
959
|
+
* @throws {CommandError} If the collection has too few vectors to train
|
|
960
|
+
*/
|
|
961
|
+
declare function trainPq(request: TrainPqRequest): Promise<string>;
|
|
962
|
+
/** Request to stream-insert points (requires the `persistence` feature). */
|
|
963
|
+
interface StreamInsertRequest {
|
|
964
|
+
/** Target collection name. */
|
|
965
|
+
collection: string;
|
|
966
|
+
/** Points to stream-insert. */
|
|
967
|
+
points: PointInput[];
|
|
968
|
+
}
|
|
969
|
+
/**
|
|
970
|
+
* Streams a batch of points into a collection for high-throughput ingestion.
|
|
971
|
+
*
|
|
972
|
+
* Only available when the plugin is built with the `persistence` feature.
|
|
973
|
+
*
|
|
974
|
+
* @param request - Points to stream-insert
|
|
975
|
+
* @returns Number of points written
|
|
976
|
+
* @throws {CommandError} If persistence is disabled or the write fails
|
|
977
|
+
*/
|
|
978
|
+
declare function streamInsert(request: StreamInsertRequest): Promise<number>;
|
|
979
|
+
/** Request to create a secondary index on a metadata field. */
|
|
980
|
+
interface CreateIndexRequest {
|
|
981
|
+
/** Target collection name. */
|
|
982
|
+
collection: string;
|
|
983
|
+
/** Metadata field name to index. */
|
|
984
|
+
fieldName: string;
|
|
985
|
+
}
|
|
986
|
+
/** Request to drop a secondary index on a metadata field. */
|
|
987
|
+
interface DropIndexRequest {
|
|
988
|
+
/** Target collection name. */
|
|
989
|
+
collection: string;
|
|
990
|
+
/** Metadata field name whose index to drop. */
|
|
991
|
+
fieldName: string;
|
|
992
|
+
}
|
|
993
|
+
/** Request to list secondary indexes on a collection. */
|
|
994
|
+
interface ListIndexesRequest {
|
|
995
|
+
/** Target collection name. */
|
|
996
|
+
collection: string;
|
|
997
|
+
}
|
|
998
|
+
/** A single secondary index entry. */
|
|
999
|
+
interface IndexInfoOutput {
|
|
1000
|
+
/** Node label (or field name for secondary indexes). */
|
|
1001
|
+
label: string;
|
|
1002
|
+
/** Property name. */
|
|
1003
|
+
property: string;
|
|
1004
|
+
/** Index type (`hash`, `range`, or `secondary`). */
|
|
1005
|
+
indexType: string;
|
|
1006
|
+
/** Number of unique values indexed. */
|
|
1007
|
+
cardinality: number;
|
|
1008
|
+
/** Memory usage in bytes. */
|
|
1009
|
+
memoryBytes: number;
|
|
1010
|
+
}
|
|
1011
|
+
/**
|
|
1012
|
+
* Creates a secondary index on a metadata field for faster filtered search.
|
|
1013
|
+
*
|
|
1014
|
+
* @param request - Index target
|
|
1015
|
+
* @throws {CommandError} If the collection does not exist
|
|
1016
|
+
*/
|
|
1017
|
+
declare function createIndex(request: CreateIndexRequest): Promise<void>;
|
|
1018
|
+
/**
|
|
1019
|
+
* Drops a secondary index on a metadata field.
|
|
1020
|
+
*
|
|
1021
|
+
* @param request - Index target
|
|
1022
|
+
* @returns `true` if an index was removed, `false` if none existed
|
|
1023
|
+
* @throws {CommandError} If the collection does not exist
|
|
1024
|
+
*/
|
|
1025
|
+
declare function dropIndex(request: DropIndexRequest): Promise<boolean>;
|
|
1026
|
+
/**
|
|
1027
|
+
* Lists all secondary indexes on a collection.
|
|
1028
|
+
*
|
|
1029
|
+
* @param request - Target collection
|
|
1030
|
+
* @returns Array of index descriptors
|
|
1031
|
+
* @throws {CommandError} If the collection does not exist
|
|
1032
|
+
*/
|
|
1033
|
+
declare function listIndexes(request: ListIndexesRequest): Promise<IndexInfoOutput[]>;
|
|
1034
|
+
/** Request for multi-source parallel BFS traversal. */
|
|
1035
|
+
interface TraverseGraphParallelRequest {
|
|
1036
|
+
/** Target collection name. */
|
|
1037
|
+
collection: string;
|
|
1038
|
+
/** Source node IDs to start traversal from. */
|
|
1039
|
+
sources: number[];
|
|
1040
|
+
/** Maximum traversal depth. Default: 3. */
|
|
1041
|
+
maxDepth?: number;
|
|
1042
|
+
/** Maximum results to return. Default: 100. */
|
|
1043
|
+
limit?: number;
|
|
1044
|
+
/** Optional relationship types to follow. */
|
|
1045
|
+
relTypes?: string[];
|
|
1046
|
+
}
|
|
1047
|
+
/**
|
|
1048
|
+
* Runs a multi-source parallel BFS traversal over a graph collection.
|
|
1049
|
+
*
|
|
1050
|
+
* @param request - Parallel traversal parameters
|
|
1051
|
+
* @returns Array of traversal result nodes
|
|
1052
|
+
* @throws {CommandError} If the collection is not a graph collection
|
|
1053
|
+
*/
|
|
1054
|
+
declare function traverseGraphParallel(request: TraverseGraphParallelRequest): Promise<TraversalOutput[]>;
|
|
876
1055
|
|
|
877
|
-
export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateGraphCollectionRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type EdgeOutput, type EpisodicRecentRequest, type EpisodicRecordRequest, type EpisodicResult, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridResult, type HybridSearchRequest, type IndividualSearchRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type ProceduralLearnRequest, type ProceduralMatchResult, type ProceduralRecallRequest, type QueryRequest, type QueryResponse, type ScrollRequest, type ScrollResponse, type SearchRequest, type SearchResponse, type SearchResult, type SemanticQueryRequest, type SemanticQueryResult, type SemanticStoreRequest, type StorageMode, type TextSearchRequest, type TraversalOutput, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createGraphCollection, createMetadataCollection, deleteCollection, deletePoints, episodicRecent, episodicRecord, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, isEmpty, listCollections, multiQuerySearch, proceduralLearn, proceduralRecall, query, scrollCollection, search, semanticQuery, semanticStore, textSearch, traverseGraph, upsert, upsertMetadata };
|
|
1056
|
+
export { type AddEdgeRequest, type BatchSearchRequest, type CollectionInfo, type CommandError, type CreateCollectionRequest, type CreateGraphCollectionRequest, type CreateIndexRequest, type CreateMetadataCollectionRequest, type DeletePointsRequest, type DistanceMetric, type DropIndexRequest, type EdgeOutput, type EpisodicRecentRequest, type EpisodicRecordRequest, type EpisodicResult, type FusionParams, type FusionStrategy, type GetEdgesRequest, type GetNodeDegreeRequest, type GetPointsRequest, type HybridResult, type HybridSearchRequest, type HybridSparseSearchRequest, type IndexInfoOutput, type IndividualSearchRequest, type ListIndexesRequest, type MetadataPointInput, type MultiQuerySearchRequest, type NodeDegreeOutput, type PointInput, type PointOutput, type ProceduralLearnRequest, type ProceduralMatchResult, type ProceduralRecallRequest, type QueryRequest, type QueryResponse, type ScrollRequest, type ScrollResponse, type SearchRequest, type SearchResponse, type SearchResult, type SemanticQueryRequest, type SemanticQueryResult, type SemanticStoreRequest, type SparsePointInput, type SparseSearchRequest, type SparseUpsertRequest, type StorageMode, type StreamInsertRequest, type TextSearchRequest, type TrainPqRequest, type TraversalOutput, type TraverseGraphParallelRequest, type TraverseGraphRequest, type UpsertMetadataRequest, type UpsertRequest, addEdge, batchSearch, createCollection, createGraphCollection, createIndex, createMetadataCollection, deleteCollection, deletePoints, dropIndex, episodicRecent, episodicRecord, flush, getCollection, getEdges, getNodeDegree, getPoints, hybridSearch, hybridSparseSearch, isEmpty, listCollections, listIndexes, multiQuerySearch, proceduralLearn, proceduralRecall, query, scrollCollection, search, semanticQuery, semanticStore, sparseSearch, sparseUpsert, streamInsert, textSearch, trainPq, traverseGraph, traverseGraphParallel, upsert, upsertMetadata };
|
package/dist/index.js
CHANGED
|
@@ -24,9 +24,11 @@ __export(index_exports, {
|
|
|
24
24
|
batchSearch: () => batchSearch,
|
|
25
25
|
createCollection: () => createCollection,
|
|
26
26
|
createGraphCollection: () => createGraphCollection,
|
|
27
|
+
createIndex: () => createIndex,
|
|
27
28
|
createMetadataCollection: () => createMetadataCollection,
|
|
28
29
|
deleteCollection: () => deleteCollection,
|
|
29
30
|
deletePoints: () => deletePoints,
|
|
31
|
+
dropIndex: () => dropIndex,
|
|
30
32
|
episodicRecent: () => episodicRecent,
|
|
31
33
|
episodicRecord: () => episodicRecord,
|
|
32
34
|
flush: () => flush,
|
|
@@ -35,8 +37,10 @@ __export(index_exports, {
|
|
|
35
37
|
getNodeDegree: () => getNodeDegree,
|
|
36
38
|
getPoints: () => getPoints,
|
|
37
39
|
hybridSearch: () => hybridSearch,
|
|
40
|
+
hybridSparseSearch: () => hybridSparseSearch,
|
|
38
41
|
isEmpty: () => isEmpty,
|
|
39
42
|
listCollections: () => listCollections,
|
|
43
|
+
listIndexes: () => listIndexes,
|
|
40
44
|
multiQuerySearch: () => multiQuerySearch,
|
|
41
45
|
proceduralLearn: () => proceduralLearn,
|
|
42
46
|
proceduralRecall: () => proceduralRecall,
|
|
@@ -45,109 +49,143 @@ __export(index_exports, {
|
|
|
45
49
|
search: () => search,
|
|
46
50
|
semanticQuery: () => semanticQuery,
|
|
47
51
|
semanticStore: () => semanticStore,
|
|
52
|
+
sparseSearch: () => sparseSearch,
|
|
53
|
+
sparseUpsert: () => sparseUpsert,
|
|
54
|
+
streamInsert: () => streamInsert,
|
|
48
55
|
textSearch: () => textSearch,
|
|
56
|
+
trainPq: () => trainPq,
|
|
49
57
|
traverseGraph: () => traverseGraph,
|
|
58
|
+
traverseGraphParallel: () => traverseGraphParallel,
|
|
50
59
|
upsert: () => upsert,
|
|
51
60
|
upsertMetadata: () => upsertMetadata
|
|
52
61
|
});
|
|
53
62
|
module.exports = __toCommonJS(index_exports);
|
|
54
63
|
var import_core = require("@tauri-apps/api/core");
|
|
55
|
-
|
|
64
|
+
function createCollection(request) {
|
|
56
65
|
return (0, import_core.invoke)("plugin:velesdb|create_collection", { request });
|
|
57
66
|
}
|
|
58
|
-
|
|
67
|
+
function createMetadataCollection(request) {
|
|
59
68
|
return (0, import_core.invoke)("plugin:velesdb|create_metadata_collection", { request });
|
|
60
69
|
}
|
|
61
70
|
async function deleteCollection(name) {
|
|
62
|
-
|
|
71
|
+
await (0, import_core.invoke)("plugin:velesdb|delete_collection", { name });
|
|
63
72
|
}
|
|
64
|
-
|
|
73
|
+
function listCollections() {
|
|
65
74
|
return (0, import_core.invoke)("plugin:velesdb|list_collections");
|
|
66
75
|
}
|
|
67
|
-
|
|
76
|
+
function getCollection(name) {
|
|
68
77
|
return (0, import_core.invoke)("plugin:velesdb|get_collection", { name });
|
|
69
78
|
}
|
|
70
|
-
|
|
79
|
+
function upsert(request) {
|
|
71
80
|
return (0, import_core.invoke)("plugin:velesdb|upsert", { request });
|
|
72
81
|
}
|
|
73
|
-
|
|
82
|
+
function upsertMetadata(request) {
|
|
74
83
|
return (0, import_core.invoke)("plugin:velesdb|upsert_metadata", { request });
|
|
75
84
|
}
|
|
76
|
-
|
|
85
|
+
function search(request) {
|
|
77
86
|
return (0, import_core.invoke)("plugin:velesdb|search", { request });
|
|
78
87
|
}
|
|
79
|
-
|
|
88
|
+
function textSearch(request) {
|
|
80
89
|
return (0, import_core.invoke)("plugin:velesdb|text_search", { request });
|
|
81
90
|
}
|
|
82
|
-
|
|
91
|
+
function hybridSearch(request) {
|
|
83
92
|
return (0, import_core.invoke)("plugin:velesdb|hybrid_search", { request });
|
|
84
93
|
}
|
|
85
|
-
|
|
94
|
+
function query(request) {
|
|
86
95
|
return (0, import_core.invoke)("plugin:velesdb|query", { request });
|
|
87
96
|
}
|
|
88
|
-
|
|
97
|
+
function getPoints(request) {
|
|
89
98
|
return (0, import_core.invoke)("plugin:velesdb|get_points", { request });
|
|
90
99
|
}
|
|
91
100
|
async function deletePoints(request) {
|
|
92
|
-
|
|
101
|
+
await (0, import_core.invoke)("plugin:velesdb|delete_points", { request });
|
|
93
102
|
}
|
|
94
|
-
|
|
103
|
+
function batchSearch(request) {
|
|
95
104
|
return (0, import_core.invoke)("plugin:velesdb|batch_search", { request });
|
|
96
105
|
}
|
|
97
|
-
|
|
106
|
+
function multiQuerySearch(request) {
|
|
98
107
|
return (0, import_core.invoke)("plugin:velesdb|multi_query_search", { request });
|
|
99
108
|
}
|
|
100
|
-
|
|
109
|
+
function isEmpty(name) {
|
|
101
110
|
return (0, import_core.invoke)("plugin:velesdb|is_empty", { name });
|
|
102
111
|
}
|
|
103
112
|
async function flush(name) {
|
|
104
|
-
|
|
113
|
+
await (0, import_core.invoke)("plugin:velesdb|flush", { name });
|
|
105
114
|
}
|
|
106
115
|
async function addEdge(request) {
|
|
107
|
-
|
|
116
|
+
await (0, import_core.invoke)("plugin:velesdb|add_edge", { request });
|
|
108
117
|
}
|
|
109
|
-
|
|
118
|
+
function getEdges(request) {
|
|
110
119
|
return (0, import_core.invoke)("plugin:velesdb|get_edges", { request });
|
|
111
120
|
}
|
|
112
|
-
|
|
121
|
+
function traverseGraph(request) {
|
|
113
122
|
return (0, import_core.invoke)("plugin:velesdb|traverse_graph", { request });
|
|
114
123
|
}
|
|
115
|
-
|
|
124
|
+
function getNodeDegree(request) {
|
|
116
125
|
return (0, import_core.invoke)("plugin:velesdb|get_node_degree", { request });
|
|
117
126
|
}
|
|
118
|
-
|
|
127
|
+
function createGraphCollection(request) {
|
|
119
128
|
return (0, import_core.invoke)("plugin:velesdb|create_graph_collection", { request });
|
|
120
129
|
}
|
|
121
|
-
|
|
130
|
+
function scrollCollection(request) {
|
|
122
131
|
return (0, import_core.invoke)("plugin:velesdb|scroll_collection", { request });
|
|
123
132
|
}
|
|
124
133
|
async function semanticStore(request) {
|
|
125
|
-
|
|
134
|
+
await (0, import_core.invoke)("plugin:velesdb|semantic_store", { request });
|
|
126
135
|
}
|
|
127
|
-
|
|
136
|
+
function semanticQuery(request) {
|
|
128
137
|
return (0, import_core.invoke)("plugin:velesdb|semantic_query", { request });
|
|
129
138
|
}
|
|
130
139
|
async function episodicRecord(request) {
|
|
131
|
-
|
|
140
|
+
await (0, import_core.invoke)("plugin:velesdb|episodic_record", { request });
|
|
132
141
|
}
|
|
133
|
-
|
|
142
|
+
function episodicRecent(request) {
|
|
134
143
|
return (0, import_core.invoke)("plugin:velesdb|episodic_recent", { request });
|
|
135
144
|
}
|
|
136
145
|
async function proceduralLearn(request) {
|
|
137
|
-
|
|
146
|
+
await (0, import_core.invoke)("plugin:velesdb|procedural_learn", { request });
|
|
138
147
|
}
|
|
139
|
-
|
|
148
|
+
function proceduralRecall(request) {
|
|
140
149
|
return (0, import_core.invoke)("plugin:velesdb|procedural_recall", { request });
|
|
141
150
|
}
|
|
151
|
+
function sparseSearch(request) {
|
|
152
|
+
return (0, import_core.invoke)("plugin:velesdb|sparse_search", { request });
|
|
153
|
+
}
|
|
154
|
+
function hybridSparseSearch(request) {
|
|
155
|
+
return (0, import_core.invoke)("plugin:velesdb|hybrid_sparse_search", { request });
|
|
156
|
+
}
|
|
157
|
+
function sparseUpsert(request) {
|
|
158
|
+
return (0, import_core.invoke)("plugin:velesdb|sparse_upsert", { request });
|
|
159
|
+
}
|
|
160
|
+
function trainPq(request) {
|
|
161
|
+
return (0, import_core.invoke)("plugin:velesdb|train_pq", { request });
|
|
162
|
+
}
|
|
163
|
+
function streamInsert(request) {
|
|
164
|
+
return (0, import_core.invoke)("plugin:velesdb|stream_insert", { request });
|
|
165
|
+
}
|
|
166
|
+
async function createIndex(request) {
|
|
167
|
+
await (0, import_core.invoke)("plugin:velesdb|create_index", { request });
|
|
168
|
+
}
|
|
169
|
+
function dropIndex(request) {
|
|
170
|
+
return (0, import_core.invoke)("plugin:velesdb|drop_index", { request });
|
|
171
|
+
}
|
|
172
|
+
function listIndexes(request) {
|
|
173
|
+
return (0, import_core.invoke)("plugin:velesdb|list_indexes", { request });
|
|
174
|
+
}
|
|
175
|
+
function traverseGraphParallel(request) {
|
|
176
|
+
return (0, import_core.invoke)("plugin:velesdb|traverse_graph_parallel", { request });
|
|
177
|
+
}
|
|
142
178
|
// Annotate the CommonJS export names for ESM import in node:
|
|
143
179
|
0 && (module.exports = {
|
|
144
180
|
addEdge,
|
|
145
181
|
batchSearch,
|
|
146
182
|
createCollection,
|
|
147
183
|
createGraphCollection,
|
|
184
|
+
createIndex,
|
|
148
185
|
createMetadataCollection,
|
|
149
186
|
deleteCollection,
|
|
150
187
|
deletePoints,
|
|
188
|
+
dropIndex,
|
|
151
189
|
episodicRecent,
|
|
152
190
|
episodicRecord,
|
|
153
191
|
flush,
|
|
@@ -156,8 +194,10 @@ async function proceduralRecall(request) {
|
|
|
156
194
|
getNodeDegree,
|
|
157
195
|
getPoints,
|
|
158
196
|
hybridSearch,
|
|
197
|
+
hybridSparseSearch,
|
|
159
198
|
isEmpty,
|
|
160
199
|
listCollections,
|
|
200
|
+
listIndexes,
|
|
161
201
|
multiQuerySearch,
|
|
162
202
|
proceduralLearn,
|
|
163
203
|
proceduralRecall,
|
|
@@ -166,8 +206,13 @@ async function proceduralRecall(request) {
|
|
|
166
206
|
search,
|
|
167
207
|
semanticQuery,
|
|
168
208
|
semanticStore,
|
|
209
|
+
sparseSearch,
|
|
210
|
+
sparseUpsert,
|
|
211
|
+
streamInsert,
|
|
169
212
|
textSearch,
|
|
213
|
+
trainPq,
|
|
170
214
|
traverseGraph,
|
|
215
|
+
traverseGraphParallel,
|
|
171
216
|
upsert,
|
|
172
217
|
upsertMetadata
|
|
173
218
|
});
|
package/dist/index.mjs
CHANGED
|
@@ -1,100 +1,129 @@
|
|
|
1
1
|
// index.ts
|
|
2
2
|
import { invoke } from "@tauri-apps/api/core";
|
|
3
|
-
|
|
3
|
+
function createCollection(request) {
|
|
4
4
|
return invoke("plugin:velesdb|create_collection", { request });
|
|
5
5
|
}
|
|
6
|
-
|
|
6
|
+
function createMetadataCollection(request) {
|
|
7
7
|
return invoke("plugin:velesdb|create_metadata_collection", { request });
|
|
8
8
|
}
|
|
9
9
|
async function deleteCollection(name) {
|
|
10
|
-
|
|
10
|
+
await invoke("plugin:velesdb|delete_collection", { name });
|
|
11
11
|
}
|
|
12
|
-
|
|
12
|
+
function listCollections() {
|
|
13
13
|
return invoke("plugin:velesdb|list_collections");
|
|
14
14
|
}
|
|
15
|
-
|
|
15
|
+
function getCollection(name) {
|
|
16
16
|
return invoke("plugin:velesdb|get_collection", { name });
|
|
17
17
|
}
|
|
18
|
-
|
|
18
|
+
function upsert(request) {
|
|
19
19
|
return invoke("plugin:velesdb|upsert", { request });
|
|
20
20
|
}
|
|
21
|
-
|
|
21
|
+
function upsertMetadata(request) {
|
|
22
22
|
return invoke("plugin:velesdb|upsert_metadata", { request });
|
|
23
23
|
}
|
|
24
|
-
|
|
24
|
+
function search(request) {
|
|
25
25
|
return invoke("plugin:velesdb|search", { request });
|
|
26
26
|
}
|
|
27
|
-
|
|
27
|
+
function textSearch(request) {
|
|
28
28
|
return invoke("plugin:velesdb|text_search", { request });
|
|
29
29
|
}
|
|
30
|
-
|
|
30
|
+
function hybridSearch(request) {
|
|
31
31
|
return invoke("plugin:velesdb|hybrid_search", { request });
|
|
32
32
|
}
|
|
33
|
-
|
|
33
|
+
function query(request) {
|
|
34
34
|
return invoke("plugin:velesdb|query", { request });
|
|
35
35
|
}
|
|
36
|
-
|
|
36
|
+
function getPoints(request) {
|
|
37
37
|
return invoke("plugin:velesdb|get_points", { request });
|
|
38
38
|
}
|
|
39
39
|
async function deletePoints(request) {
|
|
40
|
-
|
|
40
|
+
await invoke("plugin:velesdb|delete_points", { request });
|
|
41
41
|
}
|
|
42
|
-
|
|
42
|
+
function batchSearch(request) {
|
|
43
43
|
return invoke("plugin:velesdb|batch_search", { request });
|
|
44
44
|
}
|
|
45
|
-
|
|
45
|
+
function multiQuerySearch(request) {
|
|
46
46
|
return invoke("plugin:velesdb|multi_query_search", { request });
|
|
47
47
|
}
|
|
48
|
-
|
|
48
|
+
function isEmpty(name) {
|
|
49
49
|
return invoke("plugin:velesdb|is_empty", { name });
|
|
50
50
|
}
|
|
51
51
|
async function flush(name) {
|
|
52
|
-
|
|
52
|
+
await invoke("plugin:velesdb|flush", { name });
|
|
53
53
|
}
|
|
54
54
|
async function addEdge(request) {
|
|
55
|
-
|
|
55
|
+
await invoke("plugin:velesdb|add_edge", { request });
|
|
56
56
|
}
|
|
57
|
-
|
|
57
|
+
function getEdges(request) {
|
|
58
58
|
return invoke("plugin:velesdb|get_edges", { request });
|
|
59
59
|
}
|
|
60
|
-
|
|
60
|
+
function traverseGraph(request) {
|
|
61
61
|
return invoke("plugin:velesdb|traverse_graph", { request });
|
|
62
62
|
}
|
|
63
|
-
|
|
63
|
+
function getNodeDegree(request) {
|
|
64
64
|
return invoke("plugin:velesdb|get_node_degree", { request });
|
|
65
65
|
}
|
|
66
|
-
|
|
66
|
+
function createGraphCollection(request) {
|
|
67
67
|
return invoke("plugin:velesdb|create_graph_collection", { request });
|
|
68
68
|
}
|
|
69
|
-
|
|
69
|
+
function scrollCollection(request) {
|
|
70
70
|
return invoke("plugin:velesdb|scroll_collection", { request });
|
|
71
71
|
}
|
|
72
72
|
async function semanticStore(request) {
|
|
73
|
-
|
|
73
|
+
await invoke("plugin:velesdb|semantic_store", { request });
|
|
74
74
|
}
|
|
75
|
-
|
|
75
|
+
function semanticQuery(request) {
|
|
76
76
|
return invoke("plugin:velesdb|semantic_query", { request });
|
|
77
77
|
}
|
|
78
78
|
async function episodicRecord(request) {
|
|
79
|
-
|
|
79
|
+
await invoke("plugin:velesdb|episodic_record", { request });
|
|
80
80
|
}
|
|
81
|
-
|
|
81
|
+
function episodicRecent(request) {
|
|
82
82
|
return invoke("plugin:velesdb|episodic_recent", { request });
|
|
83
83
|
}
|
|
84
84
|
async function proceduralLearn(request) {
|
|
85
|
-
|
|
85
|
+
await invoke("plugin:velesdb|procedural_learn", { request });
|
|
86
86
|
}
|
|
87
|
-
|
|
87
|
+
function proceduralRecall(request) {
|
|
88
88
|
return invoke("plugin:velesdb|procedural_recall", { request });
|
|
89
89
|
}
|
|
90
|
+
function sparseSearch(request) {
|
|
91
|
+
return invoke("plugin:velesdb|sparse_search", { request });
|
|
92
|
+
}
|
|
93
|
+
function hybridSparseSearch(request) {
|
|
94
|
+
return invoke("plugin:velesdb|hybrid_sparse_search", { request });
|
|
95
|
+
}
|
|
96
|
+
function sparseUpsert(request) {
|
|
97
|
+
return invoke("plugin:velesdb|sparse_upsert", { request });
|
|
98
|
+
}
|
|
99
|
+
function trainPq(request) {
|
|
100
|
+
return invoke("plugin:velesdb|train_pq", { request });
|
|
101
|
+
}
|
|
102
|
+
function streamInsert(request) {
|
|
103
|
+
return invoke("plugin:velesdb|stream_insert", { request });
|
|
104
|
+
}
|
|
105
|
+
async function createIndex(request) {
|
|
106
|
+
await invoke("plugin:velesdb|create_index", { request });
|
|
107
|
+
}
|
|
108
|
+
function dropIndex(request) {
|
|
109
|
+
return invoke("plugin:velesdb|drop_index", { request });
|
|
110
|
+
}
|
|
111
|
+
function listIndexes(request) {
|
|
112
|
+
return invoke("plugin:velesdb|list_indexes", { request });
|
|
113
|
+
}
|
|
114
|
+
function traverseGraphParallel(request) {
|
|
115
|
+
return invoke("plugin:velesdb|traverse_graph_parallel", { request });
|
|
116
|
+
}
|
|
90
117
|
export {
|
|
91
118
|
addEdge,
|
|
92
119
|
batchSearch,
|
|
93
120
|
createCollection,
|
|
94
121
|
createGraphCollection,
|
|
122
|
+
createIndex,
|
|
95
123
|
createMetadataCollection,
|
|
96
124
|
deleteCollection,
|
|
97
125
|
deletePoints,
|
|
126
|
+
dropIndex,
|
|
98
127
|
episodicRecent,
|
|
99
128
|
episodicRecord,
|
|
100
129
|
flush,
|
|
@@ -103,8 +132,10 @@ export {
|
|
|
103
132
|
getNodeDegree,
|
|
104
133
|
getPoints,
|
|
105
134
|
hybridSearch,
|
|
135
|
+
hybridSparseSearch,
|
|
106
136
|
isEmpty,
|
|
107
137
|
listCollections,
|
|
138
|
+
listIndexes,
|
|
108
139
|
multiQuerySearch,
|
|
109
140
|
proceduralLearn,
|
|
110
141
|
proceduralRecall,
|
|
@@ -113,8 +144,13 @@ export {
|
|
|
113
144
|
search,
|
|
114
145
|
semanticQuery,
|
|
115
146
|
semanticStore,
|
|
147
|
+
sparseSearch,
|
|
148
|
+
sparseUpsert,
|
|
149
|
+
streamInsert,
|
|
116
150
|
textSearch,
|
|
151
|
+
trainPq,
|
|
117
152
|
traverseGraph,
|
|
153
|
+
traverseGraphParallel,
|
|
118
154
|
upsert,
|
|
119
155
|
upsertMetadata
|
|
120
156
|
};
|
package/package.json
CHANGED