'XhN+ddlmZmZddlmZddlmZmZmZmZm Z m Z ddl m Z ddl mZmZddlmZmZmZmZeeefZeedfZeedfZeed fZeed fZeed fZeed fZGd dedZGddedZGddedZGddedZ GddeZ!GddeZ"GddeZ#GddedZ$Gdd edZ%Gd!d"edZ&Gd#d$eeZ'Gd%d&eeZ(Gd'd(edZ)Gd)d*eeZ*Gd+d,edZ+Gd-d.edZ,Gd/d0eZ-Gd1d2eZ.Gd3d4eZ/Gd5d6eZ0Gd7d8eZ1Gd9d:eZ2Gd;deZ4Gd?d@eZ5GdAdBeZ6GdCdDeZ7GdEdFeZ8GdGdHedZ9GdIdJeeZ:GdKdLeZ;GdMdNeZ<GdOdPeZ=GdQdReZ>GdSdTeZ?GdUdVeeZ@GdWdXeZAGdYdZeZBGd[d\eZCGd]d^eZDGd_d`edZEGdadbedZFGdcddedZGGdedfedZHGdgdheZIGdidjeeZJGdkdledZKGdmdnedZLGdodpedZMGdqdredZNGdsdtedZOGdudvedZPGdwdxeeZQGdydzedZRGd{d|edZSGd}d~eeZTGddedZUGddedZVGddedZWGddedZXGddedZYGddedZZGddedZ[GddedZ\GddedZ]GddedZ^GddeeZ_GddeeZ`GddedZaGddedZbGddedZcGddedZdGddeeZeGddedZfGddedZgGddedZhGddedZiGddedZjGddedZkGddeZlGddeZmGddedZnGddedZoGddedZpGddeZqGddeZrGddeZsGddedZtGddedZuGddedZvGdÄdedZwGdńdeeZxGdDŽdedZyGdɄdeeZzGd˄dedZ{Gd̈́dedZ|GdτdedZ}GdфdedZ~GdӄdedZGdՄdedZGdׄdeeZGdلdedZGdۄdedZGd݄dedZGd߄dedZGddeZGddeZGddeZGddeZGddeZGddedZGddedZGddeZGddedZGddeZGddedZGddeZGddeZGddedZGddeZGddedZGddeZGddeZGddeZGddeZGd d eZGd d eZGd deZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGdd eZGd!d"eZGd#d$eZGd%d&eZGd'd(eZGd)d*eZGd+d,eZGd-d.eZGd/d0eZGd1d2eZGd3d4eZGd5d6eZGd7d8edZGd9d:eeZGd;dedZGd?d@edZGdAdBeeZGdCdDeeZGdEdFedZGdGdHedZGdIdJeZGdKdLeZGdMdNedZGdOdPedZGdQdRedZGdSdTedZGdUdVedZGdWdXedZGdYdZedZGd[d\edZGd]d^eeZGd_d`eZGdadbeZGdcddedZGdedfedZGdgdheZGdidjeeZGdkdledZGdmdnedZGdodpedZGdqdreeZGdsdtedZGdudvedZGdwdxedZGdydzedZGd{d|edZGd}d~edZGddedZGddeZGddeZGddeZGddedZGddeeZGddeZGddedZGddedZGddedZGddeZGddeZGddedZGddeZGddeZGddeeZGddedZGddedZGddeZGddeZGddeZGddeZGddeZGddeZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGdÄdedZGdńdedZGdDŽdedZGdɄdedZGd˄dedZGd̈́deZGdτdeZGdфdedZGdӄdeeZGdՄdedZGdׄdedZGdلdedZGdۄdedZGd݄dedZGd߄deeZGddeZGddeZGddeZGddedZ GddedZ GddedZ GddeZ GddeeZ GddedZGddedZGddeZGddeeZGddeeZGddeZGddedZGddedZGddeZGddeeZGddedZGddedZGd d edZGd d eeZGd deZGddedZGddeZGddedZGddeZ GddeZ!GddeZ"GddedZ#GddedZ$Gdd edZ%Gd!d"edZ&Gd#d$eZ'Gd%d&eZ(Gd'd(eZ)Gd)d*eeZ*Gd+d,edZ+Gd-d.edZ,Gd/d0eZ-Gd1d2eZ.Gd3d4eeZ/Gd5d6eZ0Gd7d8eZ1Gd9d:edZ2Gd;deZ4Gd?d@eeZ5GdAdBeeZ6GdCdDeeZ7GdEdFeeZ8GdGdHeeZ9GdIdJeZ:GdKdLeeZ;GdMdNedZ<GdOdPeeZ=GdQdReeZ>GdSdTedZ?GdUdVeZ@GdWdXedZAGdYdZeeZBGd[d\eeZCGd]d^eeZDGd_d`edZEGdadbeZFGdcdedZGGdddeeeZHGdfdgeeZIGdhdiedZJGdjdkedZKGdldmedZLGdndoeeZMGdpdqedZNGdrdsedZOGdtdueZPGdvdedZQGdwd eZRGdxd edZSGdyd eZTGdzd{edZUGd|d}eZVGd~dedZWGddeeZXGddeeZYGddeeZZGddeZ[GddeZ\GddeZ]GddedZ^GddedZ_GddeZ`GddeeZaGddedZbGddedZcGddedZdGddeZeGddedZfGddeeZgGddedZhGddeZiGddeZjGddeZkGddedZlGdd edZmGddeeZnGddeeZoGddeeZpGddeeZqGddeeZrGddeZsGddeZtGddedZuGddeZvGddedZwGddeeZxe eLeYe fZye eeeefZze e̐eeeiePekeeLef Z{e e.e/fZ|e e;erBr rDrFrHrIboolrJrKr rrr#r$r%r<r<)scr*D#*"-GS-16tQS1THh-.T16tQS1Th~.T7 "?r$r<ceZdZUeddZeed<eddZeed<eddZeed<eddZ eed<eddZ eed<y ) rA.rrdebugservice_debug_feature recovery_modegpurocksdbN) rr r!rrNrLr"rOrPrQrRr#r$r%rArA5sX,E4,"'"<4<4M44cr*C*#2.GT.r$rAczeZdZUeddZeded<eddZded<edd Ze ed ed <y) Batch.rrExtendedPointIdidsBatchVectorStructvectorsNr?Payloadpayloads) rr r!rrVrr"rXrZr r#r$r%rTrT=sE#("#=C =#("#=G =*/"*MHhtI'Mr$rTc,eZdZUeddZded<y)BinaryQuantization.rrBinaryQuantizationConfigbinaryN)rr r!rr^r"r#r$r%r\r\C).s)CF &Cr$r\czeZdZUeddZeeed<eddZeded<eddZ eded <y) r]Nrr? always_ramBinaryQuantizationEncodingencodingzAsymmetric quantization configuration allows a query to have different quantization than stored vectors. It can increase the accuracy of search at the cost of performance.BinaryQuantizationQueryEncodingquery_encoding) rr r!rrar rLr"rcrer#r$r%r]r]GsP!&t!DJD7?r$r]ceZdZdZdZdZy)rbone_bittwo_bitsone_and_half_bitsN)rr r!ONE_BITTWO_BITSONE_AND_HALF_BITSr#r$r%rbrbPsGH+r$rbceZdZdZdZdZdZy)rdr@r^ scalar4bits scalar8bitsN)rr r!DEFAULTBINARY SCALAR4BITS SCALAR8BITSr#r$r%rdrdVsG FKKr$rdcPeZdZUeddZded<eddZeeed <y) BoolIndexParams.rr BoolIndexTypetypeN1If true, store the index on disk. Default: false.r?on_disk rr r!rrwr"ryr rLr#r$r%ruru]s)!#26D/6#D>qrGXd^rr$ruceZdZdZy)rvrLN)rr r!BOOLr#r$r%rvrvb Dr$rvc6eZdZUdZeddZeded<y)ChangeAliasesOperationz Operation for performing changes of collection aliases. Alias changes are atomic, meaning that no collection modifications can happen between alias operations. .zOperation for performing changes of collection aliases. Alias changes are atomic, meaning that no collection modifications can happen between alias operations.rAliasOperationsactionsN)rr r!__doc__rrrr"r#r$r%rrfs)(- v(GT# $r$rc,eZdZUeddZded<y)ClearPayloadOperation.rrPointsSelector clear_payloadN)rr r!rrr"r#r$r%rrqs&+CR&@M#@r$rcheZdZUeddZeed<eddZded<eddZded<y ) ClusterConfigTelemetry.rrgrpc_timeout_msP2pConfigTelemetryp2pConsensusConfigTelemetry consensusN) rr r!rrr-r"rrr#r$r%rrus7 "5OS5 %cr :C :,1#2,FI)Fr$rc2eZdZUeddZeded<y)ClusterStatusOneOf.rr)disabledstatusN)rr r!rrr r"r#r$r%rr{s" cr" G #r$rceZdZUdZeddZeded<eddZe ed<edd Z e e d fed <eddZ d ed <eddZded<eddZe e dfed<y)ClusterStatusOneOf1z( Description of enabled cluster .zDescription of enabled clusterr)enabledrID of this peerpeer_idz6Peers composition of the cluster with main informationPeerInfopeersRaftInfo raft_infoConsensusThreadStatusconsensus_thread_statuszConsequent failures of message send operations in consensus by peer address. On the first success to send to that peer - entry is removed from this hashmap.MessageSendErrorsmessage_send_failuresN)rr r!rrrr r"rr-rrr:rrrr#r$r%rrs c?@ G A*;CD^u>v8D)9$:;vr$rceZdZUdZeddZded<eddZded<eddZd ed <ed d Z e d ed<ed d Z e ded<ed d Z e ded<y )CollectionConfigz8 Information about the collection configuration .z.Information about the collection configurationrCollectionParamsparams HnswConfig hnsw_configOptimizersConfigoptimizer_configNr? WalConfig wal_configQuantizationConfigquantization_configStrictModeConfigOutputstrict_mode_config) rr r!rrrr"rrrr rrr#r$r%rrs"'s8h!iF i %c7g hKh+0Br+s(s(-"R)J%;@"R;"67>C"R>!9:r$rceZdZUeddZded<eddZded<eddZded <eddZd ed <ed d Z e ded<ed d Z e ded<ed d Z e e ed<y )CollectionConfigTelemetry.rrrrrrrrrrNr?rrrruuid)rr r!rrr"rrrrr rrr r#r$r%rrs!&s!;F ; %cr :K:+0"+E(E#CR8J 8:?Z\:]"67]=B4]_=`!9:` 2>D(4.>r$rc,eZdZUeddZeed<y)CollectionDescription.rrr=Nrr r!rr=r:r"r#r$r%rrcr*D#*r$rc0eZdZUdZeddZeed<y)CollectionExistencezS State of existence of a collection, true = exists, false = does not exist .zIState of existence of a collection, true = exists, false = does not existrexistsN)rr r!rrrrLr"r#r$r%rrs*uvFDvr$rceZdZUdZeddZded<eddZded<ed d Ze e ed <ed d Z e e ed<ed d Z e e ed<eddZ e ed<eddZded<eddZeedfed<y )CollectionInfoz@ Current statistics and configuration of the collection .z6Current statistics and configuration of the collectionrCollectionStatusrOptimizersStatusoptimizer_statusNzDEPRECATED: Approximate number of vectors in collection. All vectors in collection are available for querying. Calculated as `points_count x vectors_per_point`. Where `vectors_per_point` is a number of named vectors in schema.r? vectors_countzApproximate number of indexed vectors in the collection. Indexed vectors in large segments are faster to query, as it is stored in a specialized vector index.indexed_vectors_countzkApproximate number of points (vectors + payloads) in collection. Each point could be accessed by unique id. points_countzXNumber of segments in collection. Each segment has independent vector as payload indexessegments_countrrzTypes of stored payloadPayloadIndexInfopayload_schema)rr r!rrrr"rrr r-rrrrrrr:r#r$r%rrs"'s8p!qF q+0 Q,($)y$M8C=,1u,8C=#(B#L(3-  sNC"'s8p!qF q49#Kd4eND001er$rc8eZdZUeddZeded<eddZeeed<edd Z ed ed <edd Z eeed <eddZ eeed<eddZ eeed<eddZ eeed<eddZeeedfed<y)rNrr? VectorsConfigrXz#Number of shards the collection has shard_numberSharding method Default is Auto - points are distributed across all available shards Custom - points are distributed across shards according to shard keyShardingMethodsharding_method!Number of replicas for each shardreplication_factorDefines how many replicas should apply the operation for us to consider it successful. Increasing this number will make the collection more resilient to inconsistencies, but will also make it fail if not enough replicas are available. Does not have any performance impact.write_consistency_factora&Defines how many additional replicas should be processing read request at the same time. Default value is Auto, which means that fan-out will be determined automatically based on the busyness of the local replica. Having more than 0 might be useful to smooth latency spikes of individual nodes.read_fan_out_factorT#If true - point's payload will not be stored in memory. It will be read from the disk every time it is requested. This setting saves RAM by (slightly) increasing the response time. Note: those payload values that are involved in filtering and are indexed - remain in RAM. Default: trueon_disk_payloadz*Configuration of the sparse vector storagersparse_vectors)rr r!rrXr r"rr-rrrrrrLrrr:r#r$r%rrs).t)LGXo &L"'?d"eL(3-e27p3OX./).aEh(i i.3g/hsm*/}*#',z'OXd^AF"NANHT#';";<=r$rceZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z ee ed <y) CollectionParamsDiffNrr?rzRMinimal number successful responses from replicas to consider operation successfulrzfFan-out every read request to these many additional remote nodes (and return first available response)raIf true - point's payload will not be stored in memory. It will be read from the disk every time it is requested. This setting saves RAM by (slightly) increasing the response time. Note: those payload values that are involved in filtering and are indexed - remain in RAM.r) rr r!rrr r-r"rrrrLr#r$r%rrss(-dHk(l l.3"v/hsm*/|*#',k'OXd^r$rc,eZdZdZdefdZdZdZdZdZ y) rz Current state of the collection. `Green` - all good. `Yellow` - optimization is running, 'Grey' - optimizations are possible but not triggered, `Red` - some operations failed and was not recovered returnc,t|jSNr:valueselfs r%__str__zCollectionStatus.__str__%4::r$greenyellowgreyredN rr r!rr:rGREENYELLOWGREYREDr#r$r%rr ) E F D Cr$rceZdZUeddZeed<eddZeed<eddZ ded<edd Z e e d ed <edd Z e e d ed <edd Ze e ded<edd Ze eedfed<y)CollectionTelemetry.rrid init_time_msrrNr?ReplicaSetTelemetryshardsr transfersr reshardingShardCleanStatusTelemetryshard_clean_tasks)rr r!rrr:r"rr-rrr rrrrrr#r$r%rr.sCR(B(cr2L#2*/*DF 'D49$TV4WFHT/0 1W5:4UW5XIx012X38SU3VJ./0VJOX\jlJmxS*E%E FGmr$rcheZdZUeddZeed<eddZded<eddZded<y ) CollectionsAggregatedTelemetry.rrrXroptimizers_statusrrN) rr r!rrXr-r"r rr#r$r%r r 8s8"-GS-,1#2,F)F!&s!;F ;r$r c2eZdZUeddZeded<y)CollectionsAliasesResponse.rrr7aliasesN)rr r!rrrr"r#r$r%r r >s(-cr(BGT$ %Br$r c2eZdZUeddZeded<y)CollectionsResponse.rrr collectionsN)rr r!rrrr"r#r$r%rrBs16s1KK-.Kr$rczeZdZUeddZeed<eddZeeed<eddZ ee ded <y) CollectionsTelemetry.rrnumber_of_collectionsNr?max_collectionsCollectionTelemetryEnumr) rr r!rrr-r"rr rrr#r$r%rrFsF!&s!;3;%*4R%HOXc]H=B4]_=`K$89:`r$rc eZdZdZdZdZdZdZy)CompressionRatiox4x8x16x32x64N)rr r!X4X8X16X32X64r#r$r%rrLs B B C C Cr$rcheZdZUeddZeed<eddZeed<eddZeed<y)r.rrmax_message_queue_sizetick_period_msbootstrap_timeout_secN) rr r!rr$r-r"r%r&r#r$r%rrTs7"'"<C<4NC4!&s!;3;r$rcZeZdZUeddZeded<eddZee e fed<y)ConsensusThreadStatusOneOf.rr)workingr last_updateN) rr r!rrr r"r*r rrr#r$r%r(r(Zs> cr"W#*/s)CKx~&Cr$r(c2eZdZUeddZeded<y)ConsensusThreadStatusOneOf1.rr)stoppedrN)rr r!rrr r"r#r$r%r,r,as" cr"W#r$r,cPeZdZUeddZeded<eddZeed<y)ConsensusThreadStatusOneOf2.rr)stopped_with_errrerrN) rr r!rrr r"r1r:r#r$r%r/r/gs5 cr"W#Sb)C)r$r/cJeZdZUeddZded<eddZded<y)ContextExamplePair.rrRecommendExamplepositivenegativeNrr r!rr5r"r6r#r$r%r3r3ns&#("#=H =#("#=H =r$r3cJeZdZUeddZded<eddZded<y) ContextPair.rr VectorInputr5r6Nr7r#r$r%r9r9ss$#CR8Hm8#CR8Hm8r$r9c,eZdZUeddZded<y) ContextQuery.rr ContextInputcontextN)rr r!rr>r"r#r$r%r<r<xs#CR8G^8r$r<c~eZdZUdZeddZeded<eddZeded <ed d Z ee ed <y) CountRequestz Count Request Counts the number of points which satisfy the given filter. If filter is not provided, the count of all points in the collection will be returned. NUSpecify in which shards to look for the points, if not specified - look in all shardsr?ShardKeySelector shard_key4Look only for points which satisfies this conditionsFilterfilterTzIf true, count exact number of points. If false, count approximate number of points faster. Approximate count might be unreliable during the indexing process. Default: trueexact) rr r!rrrCr r"rFrGrLr#r$r%r@r@|s]/4k/Ix*+"'tAw!xFHX x!CE8D>r$r@c,eZdZUeddZeed<y) CountResult.z-Number of points which satisfy the conditionsrcountN)rr r!rrJr-r"r#r$r%rIrIss(WXE3Xr$rIceZdZdZdZdZy) CpuEndianlittlebigotherN)rr r!LITTLEBIGOTHERr#r$r%rLrLs F C Er$rLcNeZdZUdZeddZeed<eddZeed<y) CreateAliaszw Create alternative name for a collection. Collection will be available under both names for search, retrieve, .zmCreate alternative name for a collection. Collection will be available under both names for search, retrieve,rr9r8N) rr r!rrr9r:r"r8r#r$r%rTrTs?! DOS DJr$rTc,eZdZUeddZded<y)CreateAliasOperation.rrrT create_aliasN)rr r!rrWr"r#r$r%rVrVs"'"ANHT#';";<=8=TWl7m!34mr$rYcPeZdZUeddZeed<eddZeded<y) CreateFieldIndex.rr field_nameNr?PayloadFieldSchema field_schema) rr r!rrer:r"rgr r#r$r%rdrds+CR0J038SU3VL(/0Vr$rdceZdZUeddZded<eddZeeed <edd Z eeed <edd Z ee eed <y)CreateShardingKey.rrShardKeyrCNz_How many shards to create for this key If not specified, will use the default value from configr? shards_numberzcHow many replicas to create for each shard If not specified, will use the default value from configrzPlacement of shards for this key List of peer ids, that can be used to place shards for this key If not specified, will be randomly placed among all peers placement) rr r!rrCr"rkr r-rrlrr#r$r%ririsq!#26Iz6#(u$M8C=).y) &+q&IxS "r$ric,eZdZUeddZded<y)CreateShardingKeyOperation.rrricreate_sharding_keyN)rr r!rror"r#r$r%rnrns/4Sb/I,Ir$rnceZdZdZdZdZy)Datatypefloat32uint8float16N)rr r!FLOAT32UINT8FLOAT16r#r$r%rqrqsG EGr$rqc,eZdZUeddZeed<y)DatetimeExpression.rrrN)rr r!rrr:r"r#r$r%ryrys#2.Hc.r$rycteZdZUeddZded<eddZeeed <edd Z eeed <y) DatetimeIndexParams.rrDatetimeIndexTyperwNIf true - use this key to organize storage of the collection data. This option assumes that this key will be used in majority of filtered requests.r? is_principalrxry rr r!rrwr"r~r rLryr#r$r%r{r{sJ %cr :D :#(j$L(4.$D>qrGXd^rr$r{ceZdZdZy)r|rN)rr r!DATETIMEr#r$r%r|r|Hr$r|c,eZdZUeddZeed<y)DatetimeKeyExpression.rr datetime_keyN)rr r!rrr:r"r#r$r%rr scr2L#2r$rceZdZUdZeddZeeee fe d<eddZ eeee fe d<eddZ eeee fe d <edd Z eeee fe d <y) DatetimeRange Range filter request Npoint.key < range.ltr?ltpoint.key > range.gtgtpoint.key >= range.gtegtepoint.key <= range.ltelte)rr r!rrrr r rrr"rrrr#r$r%rrs+0Jc*dBx~&'d*/Jc*dBx~&'d+0Kf+gC%$' (g+0Kf+gC%$' (gr$rceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <y)DecayParamsExpression.rrr3xNz7The target value to start decaying from. Defaults to 0.r?targetzdThe scale factor of the decay, in terms of `x`. Defaults to 1.0. Must be a non-zero positive number.scalezcThe midpoint of the decay. Defaults to 0.5. Output will be this value when `|x - target| == scale`.midpoint) rr r!rrr"rr rfloatrr#r$r%rrsiCR0A|0%*"[&FH\ "#zE8E?!&y!Hhuor$rc0eZdZUdZeddZeed<y) DeleteAlias Delete alias if exists .Delete alias if existsrr8N)rr r!rrr8r:r"r#r$r%rr)sC-EFJFr$rc0eZdZUdZeddZded<y)DeleteAliasOperationr.rrr delete_aliasN)rr r!rrrr"r#r$r%rr1s#(9Q"RL-Rr$rc,eZdZUeddZded<y)DeleteOperation.rrrdeleteN)rr r!rrr"r#r$r%rr9s$Sb9F 9r$rceZdZUdZeddZeeed<eddZ e ed ed <edd Z e d ed <eddZ e ded<y) DeletePayloadY This data structure is used in API interface and applied across multiple shards .z+List of payload keys to remove from payloadrkeysN+Deletes values from each point in this listr?rUpoints=Deletes values from points that satisfy this filter conditionrErFOThis data structure is used in API interface and applied across multiple shardsrBrC) rr r!rrrrr:r"rr rFrCr#r$r%rr=s~C-Z[D$s)[05"O1FHT+, -"'"a"FHX /4"s/Ix*+r$rc,eZdZUeddZded<y)DeletePayloadOperation.rrrdelete_payloadN)rr r!rrr"r#r$r%rrN&+CR&@NO@r$rceZdZUeddZeeded<eddZeded<ed d Z ee ed <edd Z eded<y) DeleteVectorsNrr?rUrrrErF.z Vector namesrvectorrrBrC) rr r!rrr rr"rFrr:rCr#r$r%rrRsp05"O1FHT+, -"'"a"FHX c~>FDI>.3Db.QIx*+Qr$rc,eZdZUeddZded<y)DeleteVectorsOperation.rrrdelete_vectorsN)rr r!rrr"r#r$r%rr]rr$rceZdZdZdZy) DirectionascdescN)rr r!ASCDESCr#r$r%rras C Dr$rceZdZdZy)DisabledN)rr r!DISABLEDr#r$r%rrfrr$rcZeZdZUeddZded<eddZeeddfed<y ) DiscoverInput.rrr:rz:Search space will be constrained by these pairs of vectorsr9r>N) rr r!rrr"r>r rr#r$r%rrjs9!#26FM69> U:GU4 & 5 6r$rc,eZdZUeddZded<y) DiscoverQuery.rrrdiscoverN)rr r!rrr"r#r$r%rrqs %cr :Ho:r$rceZdZUdZeddZeded<eddZeded <edd Z ee d ed <edd Z eded<eddZ eded<eddZ eed<eddZeeed<eddZeded<eddZeded<eddZed ed!<edd"Zed#ed$<y)%DiscoverRequestz_ Use context and a target to find the most similar points, constrained by the context. NrAr?rBrCzLook for vectors closest to this. When using the target (with or without context), the integer part of the score represents the rank with respect to the context, while the decimal part of the score relates to the distance to the target.r4raPairs of { positive, negative } examples to constrain the search. When using only the context (without a target), a special search - called context search - is performed where pairs of points are used to generate a loss that guides the search towards the zone where most positive examples overlap. This means that the score minimizes the scenario of finding a point closer to a negative than to a positive part of a pair. Since the score of a context relates to loss, the maximum score a point can get is 0.0, and it becomes normal that many points can have a score of 0.0. For discovery search (when including a target), the context part of the score for each pair is calculated +1 if the point is closer to a positive than to a negative part of a pair, and -1 otherwise.r3r>rDrErFAdditional search params SearchParamsr.Max number of result to returnrlimit~Offset of the first result to return. May be used to paginate results. Note: large offset values may cause performance issues.offsetCSelect which payload to return with the response. Default is false.WithPayloadInterface with_payloadPOptions for specifying which vectors to include into response. Default is false. WithVector with_vector[Define which vector to use for recommendation, if not specified - try to use default vector UsingVectorusingThe location used to lookup vectors. If not specified - use current collection. Note: the other collection should have the same vector size as the current collectionLookupLocation lookup_from)rr r!rrrCr r"rr>rrFrrr-rrrrrr#r$r%rrusL/4k/Ix*+,1D,FH' (5:^ 5GXd/0 1"'tAw!xFHX x',TGa'bFH^ $bs(HIE3I!UFHSM6;"g6L(12+0"t+K,'&+q&E8M "/4|/K*+r$rc2eZdZUeddZeded<y)DiscoverRequestBatch.rrrsearchesNrr r!rrrr"r#r$r%rrs(-cr(BHd$%Br$rc,eZdZdZdefdZdZdZdZdZ y) Distancezc Type of internal tags, build from payload Distance function types used to compare vectors rc,t|jSrrrs r%rzDistance.__str__rr$CosineEuclidDot ManhattanN) rr r!rr:rCOSINEEUCLIDDOT MANHATTANr#r$r%rrs)F F CIr$rc,eZdZUeddZded<y) DivExpression.rr DivParamsdivN)rr r!rrr"r#r$r%rrSb1C1r$rcneZdZUeddZded<eddZded<eddZee ed <y) r.rrr3leftrightNr?by_zero_default) rr r!rrr"rrr rr#r$r%rrs9s3D,34E<4',Tr'JOXe_Jr$rc|eZdZUdZeddZeed<eddZeed<edd Z e e ee fed <y) Documentz WARN: Work-in-progress, unimplemented Text document for embedding. Requires inference infrastructure, unimplemented. .zMText of the document This field will be used as input for the embedding modelrtext\Name of the model used to generate the vector List of available models depends on a providermodelNDParameters for the model Values of the parameters are model-specificr?options) rr r!rrrr:r"rrr rrr#r$r%rrsXc'vwD#w wE3)."h)GXd38n %r$rc,eZdZUeddZded<y)DropReplicaOperation.rrReplica drop_replicaN)rr r!rrr"r#r$r%rrs#CR8L)8r$rc,eZdZUeddZded<y)DropShardingKey.rrrjrCN)rr r!rrCr"r#r$r%rrs!#26Iz6r$rc,eZdZUeddZded<y)DropShardingKeyOperation.rrrdrop_sharding_keyN)rr r!rrr"r#r$r%rrs+0"+E(Er$rczeZdZUeddZeeed<eddZeded<eddZ ee ed<y) ErrorResponseN"Time spent to process this requestr?timerErrorResponseStatusrresult) rr r!rrr rr"rrrr#r$r%rrsD!$<`aD(5/a.3Db.QFH* +Q!$B?FHSM?r$rc2eZdZUeddZeeed<y)rNz"Description of the occurred error.r?error)rr r!rrr r:r"r#r$r%rrs ;_`E8C=`r$rc,eZdZUeddZded<y)ExpDecayExpression.rrr exp_decayN)rr r!rrr"r#r$r%rr).s)CI&Cr$rc,eZdZUeddZded<y) ExpExpression.rrr3expN)rr r!rr r"r#r$r%r r r5r$r ceZdZUeddZeded<eddZeed <edd Z ee ed <edd Z ed ed<eddZ ee ed<y) FacetRequestNrr?rBrC.z Payload key to use for faceting.rkeyz,Max number of hits to return. Default is 10.rzGFilter conditions - only consider points that satisfy these conditions.rErFzaWhether to do a more expensive exact count for each of the values in the facet. Default is false.rG)rr r!rrCr r"rr:rr-rFrGrLr#r$r%rrsz.3Db.QIx*+QS&HICI ;ijE8C=j!&"k"FHX "wE8D>r$rc2eZdZUeddZeded<y) FacetResponse.rr FacetValueHithitsN)rr r!rrrr"r#r$r%rrs"'"C"Q?FHU4 ,k9: ;)."\)J%=B$\wqrGXd^rr$r:ceZdZdZy)r;rN)rr r!FLOATr#r$r%r;r;Qs Er$r;cZeZdZUeddZded<eidZeee e fed<y) FormulaQuery.rrr3formular?defaultsN) rr r!rr@r"rAr rr:rr#r$r%r?r?Us1!#26G\6).rr)JHhtCH~&Jr$r?c$eZdZdZdefdZdZdZy)Fusionz Fusion algorithm allows to combine results of multiple prefetches. Available fusion algorithms: * `rrf` - Reciprocal Rank Fusion * `dbsf` - Distribution-Based Score Fusion rc,t|jSrrrs r%rzFusion.__str___rr$rrfdbsfN)rr r!rr:rRRFDBSFr#r$r%rCrCZs C Dr$rCc,eZdZUeddZded<y) FusionQuery.rrrCfusionN)rr r!rrKr"r#r$r%rJrJfSb1FH1r$rJc,eZdZUeddZded<y)GaussDecayExpression.rrr gauss_decayN)rr r!rrOr"r#r$r%rNrNjs+0"+EK(Er$rNcNeZdZUdZeddZded<eddZded<y) r&z Geo filter request Matches coordinates inside the rectangle, described by coordinates of lop-left and bottom-right edges .zyGeo filter request Matches coordinates inside the rectangle, described by coordinates of lop-left and bottom-right edgesrGeoPointtop_left bottom_rightN)rr r!rrrRr"rSr#r$r%r&r&ns?! PHj % P L*r$r&c,eZdZUeddZded<y) GeoDistance.rrGeoDistanceParams geo_distanceN)rr r!rrWr"r#r$r%rUrU}s(-cr(BL%Br$rUcJeZdZUeddZded<eddZeed<y) rV.rrrQoriginz,Payload field with the destination geo pointtoN)rr r!rrYr"rZr:r#r$r%rVrVs%s3FJ3C%STBTr$rVcPeZdZUeddZded<eddZeeed <y) GeoIndexParams.rr GeoIndexTyperwNrxr?ryrzr#r$r%r\r\s) "5D.5#D>qrGXd^rr$r\ceZdZdZy)r]geoN)rr r!GEOr#r$r%r]r]s Cr$r]c6eZdZUdZeddZeded<y) GeoLineStringz= Ordered sequence of GeoPoints representing the line .z3Ordered sequence of GeoPoints representing the linerrQrN)rr r!rrrrr"r#r$r%rbrbs  %S6klFD lr$rbcNeZdZUdZeddZeed<eddZeed<y)rQz" Geo point payload schema .zGeo point payload schemarlonlatN) rr r!rrrdrr"rer#r$r%rQrQs-s(BCCCs(BCCCr$rQcZeZdZUdZeddZded<edd Zee ded <y) r*zk Geo filter request Matches coordinates inside the polygon, defined by `exterior` and `interiors` .zaGeo filter request Matches coordinates inside the polygon, defined by `exterior` and `interiors`rrbexteriorNzInterior lines (if present) bound holes within the surface each GeoLineString must consist of a minimum of 4 points, and the first and last points must be the same.r? interiors) rr r!rrrgr"rhr rr#r$r%r*r*sF!& w!Ho27{2Ix_-.r$r*cNeZdZUdZeddZded<eddZeed<y ) r(zt Geo filter request Matches coordinates inside the circle of `radius` and center with coordinates `center` .zjGeo filter request Matches coordinates inside the circle of `radius` and center with coordinates `center`rrQcenterzRadius of the area in metersradiusN) rr r!rrrjr"rkrr#r$r%r(r(s7 AFJ#+IJFEJr$r(c,eZdZUeddZeed<y)GpuDeviceTelemetry.rrr=Nrr#r$r%rmrmrr$rmc2eZdZUeddZeded<y) GroupsResult.rr PointGroupgroupsN)rr r!rrqrr"r#r$r%roros!&s!;FD ;r$roc6eZdZUeddZeedfed<y) GrpcTelemetry.rrOperationDurationStatistics responsesNrr r!rrurr:r"r#r$r%rsrss:?QS:TItC667Tr$rsc6eZdZUeddZeedfed<y)HardwareTelemetry.rr HardwareUsagecollection_dataN)rr r!rrzrr:r"r#r$r%rxrxs272LOT#./Lr$rxceZdZUdZeddZeed<eddZeed<eddZ eed<eddZ eed<eddZ eed <eddZ eed <eddZ eed <y ) ryG Usage of the hardware resources, spent to process the request .=Usage of the hardware resources, spent to process the requestrcpupayload_io_readpayload_io_writepayload_index_io_readpayload_index_io_writevector_io_readvector_io_writeN)rr r!rrr~r-r"rrrrrrr#r$r%ryrysS&efCf 2qrOSr!#3rscs!&s8w!x3x"' X#C 1pqNCq 2qrOSrr$ryc6eZdZUdZeddZeded<y)HasIdConditionz& ID-based filtering condition .zID-based filtering conditionrrUhas_idN)rr r!rrrrr"r#r$r%rrs!',C=[&\FD" #\r$rc0eZdZUdZeddZeed<y)HasVectorConditionz; Filter points which have specific vector assigned .z1Filter points which have specific vector assignedr has_vectorN)rr r!rrrr:r"r#r$r%rrsC-`aJar$rceZdZUdZeddZeed<eddZeed<eddZ eed <ed d Z e eed <edd Z e e ed<edd Ze eed<y)rz Config of HNSW index .nNumber of edges per node in the index graph. Larger the value - more accurate the search, more space required.rmzNumber of neighbours to consider during the index building. Larger the value - more accurate the search, more time required to build index. ef_constructa=Minimal size (in KiloBytes) of vectors for additional payload-based indexing. If payload chunk is smaller than `full_scan_threshold_kb` additional indexing won't be used - in this case full-scan search should be preferred by query planner and additional indexing is not required. Note: 1Kb = 1 vector of size 256full_scan_thresholdrzNumber of parallel threads used for background index building. If 0 - automatically select from 8 to 16. Best to keep between 8 and 16 to prevent likelihood of slow building or broken/inefficient HNSW graphs. On small CPUs, less threads are used.r?max_indexing_threadsNzVStore HNSW index on disk. If set to false, index will be stored in RAM. Default: falseryzZCustom M param for hnsw graph built for payload index. If not set, default M will be used. payload_m)rr r!rrrr-r"rrrr ryrLrr#r$r%rrs EAs bL# % T +0M+(3-$lGXd^ %p Ix}r$rceZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z eeed <edd Z ee ed <edd Z eeed<y)r\Nrr?rzNumber of neighbours to consider during the index building. Larger the value - more accurate the search, more time required to build the index.ra=Minimal size (in kilobytes) of vectors for additional payload-based indexing. If payload chunk is smaller than `full_scan_threshold_kb` additional indexing won't be used - in this case full-scan search should be preferred by query planner and additional indexing is not required. Note: 1Kb = 1 vector of size 256rzNumber of parallel threads used for background index building. If 0 - automatically select from 8 to 16. Best to keep between 8 and 16 to prevent likelihood of building broken/inefficient HNSW graphs. On small CPUs, less threads are used.rzZStore HNSW index on disk. If set to false, the index will be stored in RAM. Default: falseryz[Custom M param for additional payload-aware HNSW links. If not set, default M will be used.r)rr r!rrr r-r"rrrryrLrr#r$r%r\r\ sEAx}#(f#L(3-*/T*#+0E+(3-$pGXd^ %q Ix}r$r\c2eZdZUeddZeeed<y)rEg333333?zEnable HNSW healing if the ratio of missing points is no more than this value. To disable healing completely, set this value to `0.0`.r?healing_thresholdN)rr r!rrr rr"r#r$r%rErE%s!).]*xr$rEc|eZdZUdZeddZeed<eddZe ed<edd Z e e e efed <y) Imagez~ WARN: Work-in-progress, unimplemented Image object for embedding. Requires inference infrastructure, unimplemented. .z*Image data: base64 encoded image or an URLrimagerrNrr?r) rr r!rrrrr"rr:rr rr#r$r%rr,sXs(TUE3U wE3)."h)GXd38n %r$rcTeZdZUdZeddZeded<eddZe ed<y) IndexesOneOfz Do not use any index, scan whole vector collection during search. Guarantee 100% precision, but may be time consuming on large collections. .zDo not use any index, scan whole vector collection during search. Guarantee 100% precision, but may be time consuming on large collections.r)plainrwrN) rr r!rrrwr r"rrr#r$r%rr:sD$ bD'(  bGSr$rcTeZdZUdZeddZeded<eddZded<y ) IndexesOneOf1z Use filterable HNSW index for approximate search. Is very fast even on a very huge collections, but require additional space to store index and additional time to build it. .zUse filterable HNSW index for approximate search. Is very fast even on a very huge collections, but require additional space to store index and additional time to build it.r)hnswrwrrN) rr r!rrrwr r"rr#r$r%rrIsD# CD'' " CG\r$rc|eZdZUdZeddZeed<eddZe ed<edd Z e e e efed <y) InferenceObjectz WARN: Work-in-progress, unimplemented Custom object for embedding. Requires inference infrastructure, unimplemented. .zvArbitrary data, used as input for the embedding model Used if the model requires more than one input or a custom inputrobjectrrNrr?r) rr r!rrrrr"rr:rr rr#r$r%rrXsb MFC wE3)."h)GXd38n %r$rc6eZdZUeddZeedfed<y)InferenceUsage.rr ModelUsagemodelsN)rr r!rrrr:r"r#r$r%rris&+CR&@FDl" #@r$rc0eZdZUdZeddZeed<y)r`rZ.r[r collectionN)rr r!rrrr:r"r#r$r%r`r`ms  fJr$r`ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee ed <y) InlineResponse200Nrr?Usageusagerrrr) rr r!rrr r"rrrr:rrLr#r$r%rrwsX$TrBE8G B!$<`aD(5/a!$B?FHSM?"4R@FHTN@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2001Nrr?rrrrr TelemetryDatar rr r!rrr r"rrrr:rr#r$r%rr~Y$TrBE8G B!$<`aD(5/a!$B?FHSM?(-d(KFH_ %Kr$rczeZdZUeddZeeed<eddZee ed<eddZ ee ed<y)InlineResponse20010Nrr?rrrr) rr r!rrr rr"rr:rrLr#r$r%rrsB!$<`aD(5/a!$B?FHSM?"4R@FHTN@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20011Nrr?rrrrrSnapshotDescriptionr rr r!rrr r"rrrr:rrr#r$r%rrs`$TrBE8G B!$<`aD(5/a!$B?FHSM?49$TV4WFHT/0 1Wr$rczeZdZUeddZeeed<eddZee ed<eddZ eded<y) InlineResponse20012Nrr?rrrrr) rr r!rrr rr"rr:rr#r$r%rrsD!$<`aD(5/a!$B?FHSM?.3Db.QFH* +Qr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20013Nrr?rrrrrRecordrrr#r$r%rrsY$TrBE8G B!$<`aD(5/a!$B?FHSM?!&t!DFHX Dr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20014Nrr?rrrrrrrrr#r$r%rrs]$TrBE8G B!$<`aD(5/a!$B?FHSM?',Tr'JFHT(^ $Jr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20015Nrr?rrrrr UpdateResultrrr#r$r%rrs^$TrBE8G B!$<`aD(5/a!$B?FHSM?-24R-PFHT.) *Pr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20016Nrr?rrrrr ScrollResultrrr#r$r%rrY$TrBE8G B!$<`aD(5/a!$B?FHSM?',Tr'JFH^ $Jr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20017Nrr?rrrrr ScoredPointrrr#r$r%rrs^$TrBE8G B!$<`aD(5/a!$B?FHSM?,1$B,OFHT-( )Or$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee e d ed <y) InlineResponse20018Nrr?rrrrrrrrr#r$r%rrsd$TrBE8G B!$<`aD(5/a!$B?FHSM?27RT2UFHT$}-. /Ur$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20019Nrr?rrrrrrorrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2002Nrr?rrrrr LocksOptionrrr#r$r%rrY$TrBE8G B!$<`aD(5/a!$B?FHSM?&+Db&IFH] #Ir$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20020Nrr?rrrrrrIrrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20021Nrr?rrrrrrrrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20022Nrr?rrrrr QueryResponserrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20023Nrr?rrrrrrrrr#r$r%rrs^$TrBE8G B!$<`aD(5/a!$B?FHSM?.3Db.QFHT/* +Qr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20024Nrr?rrrrrSearchMatrixPairsResponserrr#r$r%rrs[$TrBE8G B!$<`aD(5/a!$B?FHSM?49$TV4WFH0 1Wr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20025Nrr?rrrrrSearchMatrixOffsetsResponserrr#r$r%rrs[$TrBE8G B!$<`aD(5/a!$B?FHSM?6;DVX6YFH2 3Yr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2003Nrr?rrrrr ClusterStatusrrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2004Nrr?rrrrrrrrr#r$r%rrZ$TrBE8G B!$<`aD(5/a!$B?FHSM?.3Db.QFH* +Qr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2005Nrr?rrrrrrrrr#r$r%rrsZ$TrBE8G B!$<`aD(5/a!$B?FHSM?).t)LFH% &Lr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2006Nrr?rrrrrrrrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2007Nrr?rrrrrrrrr#r$r%rrrr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2008Nrr?rrrrrrrrr#r$r%rrs[$TrBE8G B!$<`aD(5/a!$B?FHSM?05dPR0SFH, -Sr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2009Nrr?rrrrrr rrr#r$r%rr$s[$TrBE8G B!$<`aD(5/a!$B?FHSM?5:4UW5XFH1 2Xr$rcVeZdZUeddZeeed<eddZee ed<y)InlineResponse202Nrr?rrr) rr r!rrr rr"rr:r#r$r%rr+s-!$<`aD(5/a!$B?FHSM?r$rceZdZUeddZded<eddZeeed <edd Z eeed <edd Z eeed <eddZ eeed<y)IntegerIndexParams.rrIntegerIndexTyperwNz2If true - support direct lookups. Default is true.r?lookupz2If true - support ranges filters. Default is true.r%zIf true - use this key to organize storage of the collection data. This option assumes that this key will be used in majority of filtered requests. Default is false.r~zCIf true, store the index on disk. Default: false. Default is false.ry) rr r!rrwr"rr rLr%r~ryr#r$r%rr0s{$Sb9D 9"4=qrFHTNr!$q#(|$L(4.$"gGXd^r$rceZdZdZy)rintegerN)rr r!INTEGERr#r$r%rr=Gr$rc0eZdZUdZeddZded<y)IsEmptyConditionz@ Select points with empty payload for a specified field .z6Select points with empty payload for a specified fieldr PayloadFieldr.N)rr r!rrr.r"r#r$r%rrAs %S6noHnor$rc0eZdZUdZeddZded<y)IsNullConditionz? Select points with null payload for a specified field .z5Select points with null payload for a specified fieldrrr/N)rr r!rrr/r"r#r$r%rrIs$C5lmG^mr$rcteZdZUeddZded<eddZeeed <edd Z eeed <y) KeywordIndexParams.rrKeywordIndexTyperwNz7If true - used for tenant optimization. Default: false.r? is_tenantrxry rr r!rrwr"rr rLryr#r$r%rrQsG$Sb9D 9 %"[!Ix~$D>qrGXd^rr$rceZdZdZy)rkeywordN)rr r!KEYWORDr#r$r%rrYrr$rceZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZ y) Languagearabic azerbaijanibasquebengalicatalanchinesedanishdutchenglishfinnishfrenchgermangreekhebrewhinglish hungarian indonesianitalianjapanesekazakhnepali norwegian portugueseromanianrussianslovenespanishswedishtajikturkishN)!rr r!ARABIC AZERBAIJANIBASQUEBENGALICATALANCHINESEDANISHDUTCHENGLISHFINNISHFRENCHGERMANGREEKHEBREWHINGLISH HUNGARIAN INDONESIANITALIANJAPANESEKAZAKHNEPALI NORWEGIAN PORTUGUESEROMANIANRUSSIANSLOVENESPANISHSWEDISHTAJIKTURKISHr#r$r%rr]s FK FGGG F EGG F F E FHIJGH F FIJHGGGG EGr$rc,eZdZUeddZded<y)LinDecayExpression.rrr lin_decayN)rr r!rrEr"r#r$r%rDrD~r r$rDc,eZdZUeddZded<y) LnExpression.rrr3lnN)rr r!rrHr"r#r$r%rGrGsSb1B 1r$rGceZdZUeddZeed<eddZeded <edd Z eed <edd Z d ed<y)r.zLocal shard idrr*NUser-defined sharding keyr?rjrCzNumber of points in the shardrr ReplicaStatestate) rr r!rr*r-r"rCr rrLr#r$r%rrsN#+;6r$rcpeZdZUeddZeeed<eddZeded<edd Z e ed <edd Z ee ed <edd Z ee ed<eddZ ee ed<eddZee ed<eddZeeded<edd Zded<eddZeeed<y)LocalShardTelemetryNrr? variant_name ShardStatusr.z6Total number of optimized points since the last start.rtotal_optimized_pointsyAn ESTIMATION of effective amount of bytes used for vectors Do NOT rely on this number unless you know what you are doingvectors_size_bytesz~An estimation of the effective amount of bytes used for payloads Do NOT rely on this number unless you know what you are doingpayloads_size_byteszqSum of segment points This is an approximate number Do NOT rely on this number unless you know what you are doing num_pointszSum of number of vectors in all segments This is an approximate number Do NOT rely on this number unless you know what you are doing num_vectorsSegmentTelemetrysegmentsOptimizerTelemetry optimizations async_scorer)rr r!rrOr r:r"rrQr-rSrTrUrVrXrrZr[rLr#r$r%rNrNs"'""EL(3-E&+Db&IFH] #I"'9q"rCr(-P) */U*#!&H!J "'["K#49SU3VHht./0V*/*DM'D#(2#FL(4.Fr$rNcPeZdZUeddZeeed<eddZe ed<y)rNrr? error_message.rwrite) rr r!rr]r r:r"r^rLr#r$r%rrs(#(2#FM8C=F,E4,r$rc,eZdZUeddZded<y)Log10Expression.rrr3log10N)rr r!rrar"r#r$r%r`r`s4E<4r$r`cxeZdZUdZeddZeed<eddZe eed <edd Z e d ed <y) rzj Defines a location to use for looking up the vector. Specifies collection and vector field name. .z&Name of the collection used for lookuprrNzpOptional name of the vector field within the collection. If not provided, the default vector field will be used.r?rrArBrC) rr r!rrrr:r"rr rCr#r$r%rrsXC-UVJV!GFHSM/4k/Ix*+r$rc0eZdZUdZeddZded<y)MatchAnyz0 Exact match on any of the given values .z&Exact match on any of the given valuesr AnyVariantsanyN)rr r!rrrfr"r#r$r%rdrdss0XYCYr$rdc2eZdZUdZedddZded<y) MatchExceptzJ Should have at least one value not matching the any given values .z@Should have at least one value not matching the any given valuesexceptraliasreexcept_N)rr r!rrrlr"r#r$r%rhrhs## [ckG]r$rhc0eZdZUdZeddZeed<y) MatchPhrasez/ Full-text phrase match of the string. .z%Full-text phrase match of the string.rphraseN)rr r!rrror:r"r#r$r%rnrns)PQFCQr$rnc0eZdZUdZeddZeed<y) MatchTextz) Full-text match of the strings. .zFull-text match of the strings.rrN)rr r!rrrr:r"r#r$r%rqrqsc'HID#Ir$rqc0eZdZUdZeddZded<y) MatchValuez( Exact match of the given value .zExact match of the given valuer ValueVariantsrN)rr r!rrrr"r#r$r%rsrss#34TUE?Ur$rsceZdZdZy)MaxOptimizationThreadsSettingautoN)rr r!AUTOr#r$r%rvrvr}r$rvceZdZUeddZeed<eddZeed<eddZeed<edd Z eed <edd Z eed <y )MemoryTelemetry.zBTotal number of bytes in active pages allocated by the applicationr active_bytesz2Total number of bytes allocated by the applicationallocated_bytesz+Total number of bytes dedicated to metadatametadata_bytesz@Maximum number of bytes in physically resident data pages mappedresident_bytesz0Total number of bytes in virtual memory mappingsretained_bytesN) rr r!rr{r-r"r|r}r~rr#r$r%rzrzs\c/stL#t 2fgOSg1^_NC_1stNCt1cdNCdr$rzceZdZUdZeddZeed<eddZe e ed<edd Z e e e efed <y) rz5 Message send failures for a particular peer .z+Message send failures for a particular peerrrJNr? latest_errorzTimestamp of the latest errorlatest_error_timestamp)rr r!rrrJr-r"rr r:rr rrr#r$r%rrsWs(UVE3V"'Bo"pL(3-p>C"A?HU8T>%:;r$rcPeZdZUeddZeded<eddZeed<y)r3.rrr1 conditions min_countN) rr r!rrrr"rr-r#r$r%r3r3s)$)#2$>J[!>3B/Is/r$r3cZeZdZUdZeddZeeed<eddZ ee ed<y)MmrzO Maximal Marginal Relevance (MMR) algorithm for re-ranking the points. Na!Tunable parameter for the MMR algorithm. Determines the balance between diversity and relevance. A higher value favors diversity (dissimilarity to selected results), while a lower value favors relevance (similarity to the query vector). Must be in the range [0, 1]. Default value is 0.5.r? diversityzjThe maximum number of candidates to consider for re-ranking. If not specified, the `limit` value is used.candidates_limit) rr r!rrrr rr"rr-r#r$r%rrsH"'x"Ix',A'hsmr$rc,eZdZUeddZeed<y)r.rrtokensN)rr r!rrr-r"r#r$r%rr,FC,r$rc$eZdZdZdefdZdZdZy)Modifierz If used, include weight modification, which will be applied to sparse vectors at query time: None - no modification (default) Idf - inverse document frequency, based on statistics of the collection rc,t|jSrrrs r%rzModifier.__str__rr$noneidfN)rr r!rr:rNONEIDFr#r$r%rrs D Cr$rceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <y) MoveShard.rrr*r+r,N:Method for transferring the shard from one node to anotherr?ShardTransferMethodmethod rr r!rr*r-r"r+r,rr r#r$r%rr%R#2.Hc.CR0J0cr2L#2.3"^/FH* +r$rc,eZdZUeddZded<y)MoveShardOperation.rrr move_shardN)rr r!rrr"r#r$r%rr.s#CR8J 8r$rc2eZdZUeddZeded<y)MultExpression.rrr3multN)rr r!rrrr"r#r$r%rr2s$Sb9D$| 9r$rceZdZdZy)MultiVectorComparatormax_simN)rr r!MAX_SIMr#r$r%rr6rr$rc,eZdZUeddZded<y)MultiVectorConfig.rrr comparatorN)rr r!rrr"r#r$r%rr:s*/*DJ'Dr$rcNeZdZUdZeddZeed<eddZded<y ) NamedSparseVectorz& Sparse vector data with name .Name of vector datarr=zSparse vector data with name SparseVectorrN) rr r!rrr=r:r"rr#r$r%rr>s-c'<=D#="34RSFNSr$rcTeZdZUdZeddZeed<eddZe e ed<y) NamedVectorz% Dense vector data with name .rrr=z Vector datarN) rr r!rrr=r:r"rrrr#r$r%rrGs0c'<=D#=?FDK?r$rcPeZdZUeddZded<eddZed ed <y) NearestQuery.rrr:nearestNz|Perform MMR (Maximal Marginal Relevance) reranking after search, using the same vector in this query to calculate relevance.r?rmmr)rr r!rrr"rr r#r$r%rrPs1"3B7G]7 SC%r$rc,eZdZUeddZded<y) NegExpression.rrr3negN)rr r!rrr"r#r$r%rrXr5r$rcNeZdZUdZeddZeed<eddZded<y) NestedzA Select points with payload for a specified nested field .z7Select points with payload for a specified nested fieldrrrErFN) rr r!rrrr:r"rFr#r$r%rr\s-S&_`C`S.ghFHhr$rc,eZdZUeddZded<y)NestedCondition.rrrnestedN)rr r!rrr"r#r$r%rrerLr$rceZdZUeddZeed<eddZeeed<eddZ ee ed <edd Z ee ed <edd Z ee ed <eddZ eeed<eddZeeeefed<y)rt.rrrJNr? fail_countzOThe average time taken by 128 latest operations, calculated as a weighted mean.avg_duration_microszCThe minimum duration of the operations across all the measurements.min_duration_microszCThe maximum duration of the operations across all the measurements.max_duration_microsz5The total duration of all operations in microseconds.total_duration_microslast_responded)rr r!rrJr-r"rr rrrrrrr rrr#r$r%rtrtiss+E3+ %d CJ C+0"s,%,1"g,%,1"g,%,1"Y,8C=723Yr$rtcteZdZUeddZded<eddZded<edd Zee d ed <y) rY.rrrrrtrZNr?TrackerTelemetrylog) rr r!rrr"rZrr rr#r$r%rYrY{sB!&s!;F ;38"3MM0M.3Db.QC$)* +Qr$rYceZdZUeddZeed<eddZeed<eddZ eed<ed d Z e eed <ed d Z e eed<ed d Z e eed<eddZeed<ed d Ze eed<y )r.^The minimal fraction of deleted vectors in a segment, required to perform segment optimizationrdeleted_thresholdTThe minimal number of vectors in a segment, required to perform segment optimizationvacuum_min_vector_numberaTarget amount of segments optimizer will try to keep. Real amount of segments may vary depending on multiple parameters: - Amount of stored points - Current write RPS It is recommended to select default number of segments as a factor of the number of search threads, so that each segment would be handled evenly by one of the threads. If `default_segment_number = 0`, will be automatically selected by the number of available CPUs.default_segment_numberNaDo not create segments larger this size (in kilobytes). Large segments might require disproportionately long indexation times, therefore it makes sense to limit the size of segments. If indexing speed is more important - make this parameter lower. If search speed is more important - make this parameter higher. Note: 1Kb = 1 vector of size 256 If not set, will be automatically selected considering the number of available CPUs.r?max_segment_sizea|Maximum size (in kilobytes) of vectors to store in-memory per segment. Segments larger than this threshold will be stored as read-only memmapped file. Memmap storage is disabled by default, to enable it, set this threshold to a reasonable value. To disable memmap storage, set this to `0`. Internally it will use the largest threshold possible. Note: 1Kb = 1 vector of size 256memmap_thresholdaMaximum size (in kilobytes) of vectors allowed for plain index, exceeding this threshold will enable vector indexing Default value is 10,000, based on experiments and observations. To disable vector indexing, set to `0`. Note: 1kB = 1 vector of size 256.indexing_threshold(Minimum interval between forced flushes.flush_interval_seca(Max number of threads (jobs) for running optimizations per shard. Note: each optimization job will also use `max_indexing_threads` threads by itself for index building. If null - have no limit and choose dynamically to saturate CPU. If 0 - no optimization threads, optimizations will be disabled.max_optimization_threads)rr r!rrrr"rr-rrr rrrrr#r$r%rrs$ t u%* o%c#( G#C',E'hsm',S'hsm).X) $C5_``.3/hsmr$rc.eZdZUeddZeeed<eddZee ed<eddZ ee ed<edd Z ee ed <edd Z ee ed <edd Z ee ed<eddZee ed<eddZeded<y)r^Nrr?rrraTarget amount of segments optimizer will try to keep. Real amount of segments may vary depending on multiple parameters: - Amount of stored points - Current write RPS It is recommended to select default number of segments as a factor of the number of search threads, so that each segment would be handled evenly by one of the threads If `default_segment_number = 0`, will be automatically selected by the number of available CPUsraeDo not create segments larger this size (in kilobytes). Large segments might require disproportionately long indexation times, therefore it makes sense to limit the size of segments. If indexation speed have more priority for your - make this parameter lower. If search speed is more important - make this parameter higher. Note: 1Kb = 1 vector of size 256raeMaximum size (in kilobytes) of vectors to store in-memory per segment. Segments larger than this threshold will be stored as read-only memmapped file. Memmap storage is disabled by default, to enable it, set this threshold to a reasonable value. To disable memmap storage, set this to `0`. Note: 1Kb = 1 vector of size 256 Deprecated since Qdrant 1.15.0raDMaximum size (in kilobytes) of vectors allowed for plain index, exceeding this threshold will enable vector indexing Default value is 20,000, based on <https://github.com/google-research/google-research/blob/master/scann/docs/algorithms.md>. To disable vector indexing, set to `0`. Note: 1kB = 1 vector of size 256.rrra4Max number of threads (jobs) for running optimizations per shard. Note: each optimization job will also use `max_indexing_threads` threads by itself for index building. If "auto" - have no limit and choose dynamically to saturate CPU. If 0 - no optimization threads, optimizations will be disabled.MaxOptimizationThreadsr)rr r!rrr rr"rr-rrrrrrr#r$r%r^r^s).t*x/4"x/hsm-2E-HSM',|'hsm',|'hsm).[) ).dHr(s sCHKDh'?@r$r^c eZdZdZdefdZdZy)OptimizersStatusOneOfz. Optimizers are reporting as expected rc,t|jSrrrs r%rzOptimizersStatusOneOf.__str__rr$okN)rr r!rr:rOKr#r$r%rr Br$rc0eZdZUdZeddZeed<y)OptimizersStatusOneOf1z2 Something wrong happened with optimizers .z(Something wrong happened with optimizersrrN)rr r!rrrr:r"r#r$r%rrss(RSE3Sr$rcteZdZUeddZeed<eddZeded <edd Z ed ed <y) OrderBy.zPayload key to order byrrNz=Direction of ordering: `asc` or `desc`. Default is ascending.r?r directionzmWhich payload value to start scrolling from. Default is the lowest value for `asc` and the highest for `desc` StartFrom start_from) rr r!rrr:r"rr rr#r$r%rrsQS&?@C@',"a(Ix $).D)J%r$rc,eZdZUeddZded<y) OrderByQuery.rrOrderByInterfaceorder_byN)rr r!rrr"r#r$r%rrs#("#=H =r$rc,eZdZUeddZded<y)OverwritePayloadOperation.rr SetPayloadoverwrite_payloadN)rr r!rrr"r#r$r%rrs&+CR&@|@r$rc,eZdZUeddZeed<y)r.rrconnection_pool_sizeN)rr r!rrr-r"r#r$r%rrs %cr :#:r$rcheZdZUeddZeed<eddZeed<eddZ eed<y)PartialSnapshotTelemetry.rr ongoing_create_snapshot_requests is_recoveringrecovery_timestampN) rr r!rrr-r"rrLrr#r$r%rrs7,1#2,F$cF4M44#CR88r$rc0eZdZUdZeddZeed<y)rz Payload field .zPayload field namerrN)rr r!rrrr:r"r#r$r%rrsS&:;C;r$rcreZdZUdZeddZded<eddZed ed <edd Z e ed <y) rz< Display payload field type & index information .z2Display payload field type & index informationrPayloadSchemaType data_typeNr?PayloadSchemaParamsrz(Number of points indexed with this indexr) rr r!rrrr"rr rr-r#r$r%rrsM&+3eZdZUeddZeeeddfed<eddZ eded<eddZ ee ed <edd Z ed ed <edd Z eded<eddZeeed<eddZeeed<eddZeded<y)PrefetchNzhSub-requests to perform first. If present, the query will be performed on the results of the prefetches.r?prefetchUQuery to perform. If missing without prefetches, returns points ordered by their IDs.QueryInterfacequeryUDefine which vector name to use for querying. If missing, the default vector is used.rSFilter conditions - return only those points that satisfy the specified conditions.rErF+Search params for when there is no prefetchrr5Return points with scores better than this threshold.score_threshold.Max number of points to return. Default is 10.rThe location to use for IDs lookup, if not specified - use the current collection and the 'using' vector Note: the other collection vectors should have the same vector size as the 'using' vector in the current collectionrr)rr r!rr+r r rr"r.rr:rFrr3rrr-rr#r$r%r*r*zs>C~?HhuT*-z9:;).k)E8$ %!kE8C="'"w"FHX (-TGt'uFH^ $u',"Y(OXe_!;klE8C=l.3G/K*+r$r*c,eZdZUeddZded<y)ProductQuantization.rrProductQuantizationConfigproductN)rr r!rr9r"r#r$r%r7r7s+0"+EG (Er$r7cPeZdZUeddZded<eddZeeed<y) r8.rrr compressionNr?ra) rr r!rr;r"rar rLr#r$r%r8r8s)&+CR&@K#@!&t!DJDr$r8c~eZdZUdZeddZeeed<eddZ eeed<edd Z ee ed <y) QuantizationSearchParams- Additional parameters of the search Fz9If true, quantized vectors are ignored. Default is false.r?ignoreNzIf true, use original vectors to re-score top-k results. Might require more time in case if original vectors are stored on disk. If not set, qdrant decides automatically apply rescoring or not.rescoreaZOversampling factor for quantization. Default is 1.0. Defines how many extra vectors should be pre-selected using quantized index, and then re-scored using original vectors. For example, if `oversampling` is 2.4 and `limit` is 100, then 240 vectors will be pre-selected using quantized index, and then top-100 will be returned after re-scoring. oversampling) rr r!rrr?r rLr"r@rArr#r$r%r=r=sd##^FHTN$XGXd^%*q%L(5/r$r=ceZdZUeddZeded<eddZeee ddfed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<eddZeeed<eddZeded<eddZeded<eddZeded<edd !Ze ed"<edd#Zeeed$<edd%Zeeed&<edd'Zed(ed)<y)*QueryGroupsRequestNrr?rBrCjSub-requests to perform first. If present, the query will be performed on the results of the prefetch(es).r*r+r,r-r.r/rr0rErFr1rrr2r3TOptions for specifying which vectors to include into the response. Default is false.rrIOptions for specifying which payload to include or not. Default is false.rrr5rr.Payload field to group by, must be a string or number field. If the field contains more than 1 value, all values will be used for grouping. One point can be in multiple groups.rgroup_byz;Maximum amount of points to return per group. Default is 3. group_sizez2Maximum amount of groups to return. Default is 10.r9Look for points in another collection using the group idsWithLookupInterface with_lookup)rr r!rrCr r"r+r rr.rr:rFrr3rrrrrHrIr-rrLr#r$r%rCrCs.3Db.QIx*+Q>CA?HhuT*-z9:;).k)E8$ %!kE8C="'"w"FHX (-TGt'uFH^ $u',"Y(OXe_+0"x+K,'6;"m6L(12/4G/K*+ GHc!&"_!J !;opE8C=p38"]4K/0r$rCceZdZUeddZeded<eddZeee ddfed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<eddZeeed<eddZeeed<eddZeeed<eddZeded<eddZeded<edd Zed!ed"<y)# QueryRequestNrr?rBrCrDr*r+r,r-r.r/rr0rErFr1rrr2r3r4rz9Offset of the result. Skip this many points. Default is 0rrErrrFrrr5rr)rr r!rrCr r"r+r rr.rr:rFrr3rrr-rrrrr#r$r%rNrNs`.3Db.QIx*+Q>CA?HhuT*-z9:;).k)E8$ %!kE8C="'"w"FHX (-TGt'uFH^ $u',"Y(OXe_!;klE8C=l!$"?r$rPc2eZdZUeddZeded<y)r.rrrrN)rr r!rrrr"r#r$r%rrs"'"6r$rceZdZUeddZeed<eddZeeed<eddZ ded <eddZ ded <y) RemoteShardTelemetry.rrr*Nr?rrtrupdates) rr r!rr*r-r"rr rrr#r$r%rrsL#2.Hc."4R@GXc]@.3CR.HH+H-23B-GG *Gr$rcNeZdZUdZeddZeed<eddZeed<y) RenameAlias# Change alias to a new one .Change alias to a new onerold_alias_namenew_alias_nameN) rr r!rrrr:r"rr#r$r%rrs- 1LMNCM1LMNCMr$rc0eZdZUdZeddZded<y)RenameAliasOperationr.rrr rename_aliasN)rr r!rrrr"r#r$r%rrs#(9T"UL-Ur$rcJeZdZUeddZeed<eddZeed<y)r.rrr*rN)rr r!rr*r-r"rr#r$r%rrs$#2.Hc."-GS-r$rceZdZUeddZeed<eddZeded<eddZ ed ed <eddZ e d ed <eddZ e ed fed<eddZeded<y)r.rrrNr?rjrrNlocalrremoterKreplicate_statesrpartial_snapshot)rr r!rrr-r"rr rrrrrr:rr#r$r%rrsCR(B( %d CC* C-24R-PE8) *P+0"+EFD' (E272Ld3./L=B4]_=`h9:`r$rc@eZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d Zy )rKz9 State of the single shard within a replica set. rc,t|jSrrrs r%rzReplicaState.__str__rr$ActiveDeadPartial InitializingListenerPartialSnapshotRecovery ReshardingReshardingScaleDownN)rr r!rr:rACTIVEDEADPARTIAL INITIALIZINGLISTENERPARTIALSNAPSHOTRECOVERY RESHARDINGRESHARDINGSCALEDOWNr#r$r%rKrKsCF DG!LH'OHJ/r$rKceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <y) ReplicateShard.rrr*r+r,Nrr?rrrr#r$r%rrrr$rc,eZdZUeddZded<y)ReplicateShardOperation.rrrreplicate_shardN)rr r!rrr"r#r$r%rrs(-cr(BO%Br$rcJeZdZUeddZded<eddZded<y) RequestsTelemetry.rrWebApiTelemetryrestrsgrpcN)rr r!rrr"rr#r$r%rrs%#CR8D 8!#26D/6r$rc eZdZdZdefdZdZy)ReshardingDirectionOneOfz# Scale up, add a new shard rc,t|jSrrrs r%rz ReshardingDirectionOneOf.__str__ rr$upN)rr r!rr:rUPr#r$r%rr rr$rc eZdZdZdefdZdZy)ReshardingDirectionOneOf1z$ Scale down, remove a shard rc,t|jSrrrs r%rz!ReshardingDirectionOneOf1.__str__ rr$downN)rr r!rr:rDOWNr#r$r%rr  Dr$rceZdZUeddZded<eddZeed<eddZeed<edd Z e d ed <y) r.rrReshardingDirectionrr*rNr?rjrC) rr r!rrr"r*r-rrCr r#r$r%rr sL',Sb'AI$A#2.Hc."-GS-&+Db&IIx #Ir$rceZdZUeddZeed<eddZeed<eddZeed<eddZ ded<y ) RestartTransfer.rrr*r,r+rrN) rr r!rr*r-r"r,r+rr#r$r%rr! sG#2.Hc.cr2L#2CR0J0$)#2$>F !>r$rc,eZdZUeddZded<y)RestartTransferOperation.rrrrestart_transferN)rr r!rrr"r#r$r%rr( */*D'Dr$rcLeZdZUeddZeeed<eddZeeed<eddZ e ed<eddZ ee ed <eddZ ee ed <eddZee ed <eddZeed <eddZed ed<eddZeeded<y)rGNrr? distributiondistribution_version.r is_dockercoresram_size disk_size cpu_flagsrL cpu_endianrm gpu_devices)rr r!rrr r:r"rrrLrr-rrrrrrr#r$r%rGrG, s"'""EL(3-E*/"*M(3-MCR0It0 2>E8C=>#DbAHhsmA$TrBIx}B3B/Is/(-d(KJ%K8=dXZ8[K$345[r$rGceZdZdZy)SamplerandomN)rr r!RANDOMr#r$r%rr8 s Fr$rc,eZdZUeddZded<y) SampleQuery.rrrsampleN)rr r!rrr"r#r$r%rr< rLr$rc,eZdZUeddZded<y)ScalarQuantization.rrScalarQuantizationConfigscalarN)rr r!rrr"r#r$r%rr@ r_r$rcteZdZUeddZded<eddZeeed <edd Z ee ed <y) r.rr ScalarTyperwNziQuantile for quantization. Expected value range in [0.5, 1.0]. If not set - use the whole range of valuesr?quantilez]If true - quantized vectors always will be stored in RAM, ignoring the config of main storagera) rr r!rrwr"rr rrarLr#r$r%rrD sKs3D,3 %!Hhuo"'s"Jr$rceZdZdZy)rint8N)rr r!INT8r#r$r%rrP r}r$rceZdZUdZeddZded<eddZeed<edd Z e ed <ed d Z e ded<ed d Z e ded<ed d Ze ded<ed d Ze ded<y )rz Search result .z Search resultrrUrz Point versionr>z*Points vector distance to the query vectorscoreNrzr?rYrr{r|rr}rjrCzOrder-by valuer~r)rr r!rrrr"r>r-rrrr rrCrr#r$r%rrT s"#?CBC/:GS:*VWE5W#(Ck#lGXi l-24Mb-cFH) *c&+Dk&RIx #R*/JZ*[K,'[r$rceZdZUdZeddZeded<eddZeded <edd Z ee ed <edd Z ed ed<eddZ eded<eddZ eded<eddZeded<y) ScrollRequestzQ Scroll request - paginate over all points which matches given condition NrAr?rBrCzStart ID to read points from.rUrzPage size. Default: 10rzSLook only for points which satisfies this conditions. If not provided - all points.rErFrrrzGScroll request - paginate over all points which matches given conditionrrz%Order the records by a payload field.rr)rr r!rrrCr r"rrr-rFrrrr#r$r%rrb s/4k/Ix*++0Ji*jFH& 'j ;STE8C=T!&"w"FHX 6;"f6L(12+0"k+K,'.34Mt-uHh)*ur$rcZeZdZUdZeddZeded<edd Ze d ed <y) rz+ Result of the points read request .zList of retrieved pointsrrrNz:Offset which should be used to retrieve a next page resultr?rUnext_page_offset) rr r!rrrrr"rr r#r$r%rry s=#34NOFDNO49"^5h01r$rceZdZUeddZeded<eddZd ed <edd Zed ed <eddZ eded<eddZ eded<eddZ eded<eddZ ee ed<eddZeed<eddZeed<eddZeed<eddZed ed!<y)"SearchGroupsRequestNrAr?rBrC.rrNamedVectorStructrrDrErFrrrrrrrrrrer3rGrHrfrIrgrrJrKrL)rr r!rrCr r"rrFrrrr3rrHr:rIr-rrLr#r$r%rr s.3k/Ix*+#("NzParams relevant to HNSW index Size of the beam in a beam-search. Larger the value - more accurate the result, more time required for search.r?hnsw_efFzYSearch without approximation. If set to true, search may run long but with exact results.rGzQuantization paramsr= quantizationzIf enabled, the engine will only perform search among indexed or small segments. Using this option prevents slow searches in case of delayed index, but does not guarantee that all uploaded vectors will be included in search results indexed_only) rr r!rrrr r-r"rGrLrrr#r$r%rr s|#cGXc]"oE8D>:?tYn9oL(56o#(~$L(4.r$rcJeZdZUdZeddZeded<edd Zd ed <edd Z ed ed<eddZ eded<edd Z e ed<eddZ ee ed<eddZeded<eddZeded<eddZeeed<y) SearchRequestz Search request. Holds all conditions and parameters for the search of most similar points by vector similarity given the filtering restrictions. NrAr?rBrC.zSearch request. Holds all conditions and parameters for the search of most similar points by vector similarity given the filtering restrictions.rrrrDrErFrrrrrrrrrrrrrrer3)rr r!rrrCr r"rrFrrr-rrrr3rr#r$r%rr s/4k/Ix*+#( g#F "'tAw!xFHX x',TGa'bFH^ $bs(HIE3I!UFHSM6;"g6L(12+0"t+K,'(-r(OXe_r$rc2eZdZUeddZeded<y)SearchRequestBatch.rrrrNrr#r$r%rr s&+CR&@Hd?#@r$rceZdZUeidZeeedfed<eddZ eeedfed<edd Z d ed <y) SegmentConfigrr?VectorDataConfig vector_dataNSparseVectorDataConfigsparse_vector_data.rPayloadStorageTypepayload_storage_type) rr r!rrr rr:r"rrr#r$r%rr s[;@Y[;\K$s$6678\HMVZhjHkc+C&C!DEk16s1K.Kr$rceZdZUdZeddZded<eddZeed<eddZ eed<eddZ eed <eddZ eed <edd Z eed <edd Z eed<eddZeed<eddZeed<eddZeed<eddZeedfed<eddZeedfed<y) SegmentInfoz. Aggregated information about segment .z$Aggregated information about segmentr SegmentType segment_typerVrUnum_indexed_vectorsnum_deleted_vectorsrRrSz@An estimation of the effective amount of bytes used for payloadsrTram_usage_bytesdisk_usage_bytes is_appendabler index_schemaVectorDataInforN)rr r!rrrr"rVr-rUrr rSrTr r r rLr rr:rr#r$r%rr s #(9_"`L-`S.TUKUC-STJT$S6\]]$S6\]]# P % [ !2XYOSY!#3YZcZ1WXM4X27Io2pL$s../p/4SFl/mKc++,mr$rceZdZUeddZded<eddZded<eddZeded <eddZ ed ed <y ) rW.rrrinforrVectorIndexSearchesTelemetryvector_index_searchesrpayload_field_indicesN) rr r!rrr"rrrrr#r$r%rWrW sV4D-4#CR8FO8BGY[B\4 >?\;@RT;U4 78Ur$rWc(eZdZdZdefdZdZdZdZy)rz Type of segment rc,t|jSrrrs r%rzSegmentType.__str__( rr$rindexedspecialN) rr r!rr:rPLAININDEXEDSPECIALr#r$r%rr# s$ EGGr$rceZdZUdZeddZded<edd Zee d ed <edd Z ed ed<edd Z eded<edd Z ee ed<y)rr.rrrYrNz*Assigns payload to each point in this listr?rUrz@Assigns payload to each point that satisfy this filter conditionrErFrBrCz@Assigns payload to each point that satisfy this path of propertyr)rr r!rrrr"rr rrFrCrr:r#r$r%rr0 s jGY16"N1FHT+, -"'"d"FHX /4"s/Ix*+"dC#r$rc,eZdZUeddZded<y)SetPayloadOperation.rrr set_payloadN)rr r!rrr"r#r$r%rrF s %cr :K:r$rc,eZdZUeddZeed<y)ShardCleanStatusFailedTelemetry.rrreasonN)rr r!rr!r:r"r#r$r%r r J rr$r c,eZdZUeddZeed<y)!ShardCleanStatusProgressTelemetry.rrdeleted_pointsN)rr r!rr$r-r"r#r$r%r#r#N s4NC4r$r#ceZdZdZdZdZy)ShardCleanStatusTelemetryOneOfstarteddone cancelledN)rr r!STARTEDDONE CANCELLEDr#r$r%r&r&R sG DIr$r&c,eZdZUeddZded<y)ShardCleanStatusTelemetryOneOf1.rrr#progressN)rr r!rr/r"r#r$r%r.r.X s49#24NH1Nr$r.c,eZdZUeddZded<y)ShardCleanStatusTelemetryOneOf2.rrr failedN)rr r!rr2r"r#r$r%r1r1\ s05cr0JF -Jr$r1ceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <y)ShardSnapshotRecover.rrShardSnapshotLocationlocationNr?SnapshotPrioritypriorityFOptional SHA256 checksum to verify snapshot integrity before recovery.checksumCOptional API key used when fetching the snapshot from a remote URL.api_key) rr r!rr6r"r8r r:r:r<r#r$r%r4r4` sc(-cr(BH%B-24R-PHh)*P#"jHhsm#"gGXc]r$r4c,eZdZdZdefdZdZdZdZdZ y) rPz Current state of the shard (supports same states as the collection) `Green` - all good. `Yellow` - optimization is running, 'Grey' - optimizations are possible but not triggered, `Red` - some operations failed and was not recovered rc,t|jSrrrs r%rzShardStatus.__str__p rr$rrrrNrr#r$r%rPrPk rr$rPceZdZUeddZeed<eddZeeed<edd d Z eed <edd Z eed<eddZ e ed<eddZ eded<eddZeeed<y)r.rrr*NzpTarget shard ID if different than source shard ID Used exclusively with `ReshardStreamRecords` transfer method.r? to_shard_idzSource peer idfromrjfrom_zDestination peer idrZzyIf `true` transfer is a synchronization of a replicas If `false` transfer is a moving of a shard from one peer to anothersyncrrzTA human-readable report of the transfer progress. Available only on the source peer.comment)rr r!rr*r-r"r@r rBrZrCrLrrDr:r#r$r%rry s#2.Hc.!&G"K#s(8GE3GC%:;B; PD$/4Db.QFH* +Q""xGXc]r$rc eZdZdZdefdZdZy)ShardTransferMethodOneOfzS Stream all shard records in batches until the whole shard is transferred. rc,t|jSrrrs r%rz ShardTransferMethodOneOf.__str__ rr$stream_recordsN)rr r!rr:rSTREAM_RECORDSr#r$r%rFrF s&Nr$rFc eZdZdZdefdZdZy)ShardTransferMethodOneOf1zF Snapshot the shard, transfer and restore it on the receiver. rc,t|jSrrrs r%rz!ShardTransferMethodOneOf1.__str__ rr$snapshotN)rr r!rr:rSNAPSHOTr#r$r%rKrK sHr$rKc eZdZdZdefdZdZy)ShardTransferMethodOneOf2z< Attempt to transfer shard difference by WAL delta. rc,t|jSrrrs r%rz!ShardTransferMethodOneOf2.__str__ rr$ wal_deltaN)rr r!rr:r WAL_DELTAr#r$r%rPrP sIr$rPc eZdZdZdefdZdZy)ShardTransferMethodOneOf3zh Shard transfer for resharding: stream all records in batches until all points are transferred. rc,t|jSrrrs r%rz!ShardTransferMethodOneOf3.__str__ rr$resharding_stream_recordsN)rr r!rr:rRESHARDING_STREAM_RECORDSr#r$r%rUrU s!<r$rUceZdZdZdZy)rrwcustomN)rr r!rxCUSTOMr#r$r%rr s D Fr$rceZdZUeddZeed<eddZeeed<eddZ e ed<eddZ eeed <y) r.rrr=Nr? creation_timesizer:) rr r!rr=r:r"r]r r^r-r:r#r$r%rr sNcr*D#*#(2#FM8C=Fcr*D#*#DbAHhsmAr$rc(eZdZdZdefdZdZdZdZy)r7z Defines source of truth for snapshot recovery: `NoSync` means - restore snapshot without *any* additional synchronization. `Snapshot` means - prefer snapshot data over the current state. `Replica` means - prefer existing data over the snapshot. rc,t|jSrrrs r%rzSnapshotPriority.__str__ rr$no_syncrMreplicaN) rr r!rr:rNO_SYNCrNREPLICAr#r$r%r7r7 s$GHGr$r7ceZdZUeddZeed<eddZeded <edd Z eeed <edd Z eeed <y)SnapshotRecover.zExamples: - URL `http://localhost:8080/collections/my_collection/snapshots/my_snapshot` - Local path `file:///qdrant/snapshots/test_collection-2022-08-04-10-49-10.snapshot`rr6Na[Defines which data should be used as a source of truth if there are other replicas in the cluster. If set to `Snapshot`, the snapshot will be used as a source of truth, and the current state will be overwritten. If set to `Replica`, the current state will be used as a source of truth, and after recovery if will be synchronized with the snapshot.r?r7r8r9r:r;r<) rr r!rr6r:r"r8r r:r<r#r$r%rfrf sx CHc.3r.Hh)*$"jHhsm#"gGXc]r$rfceZdZdZy)SnowballsnowballN)rr r!SNOWBALLr#r$r%rhrh rr$rhcheZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZy)SnowballLanguagez2 Languages supported by snowball stemmer. rc,t|jSrrrs r%rzSnowballLanguage.__str__ rr$rarmenianr rrrrrrrrrrrrr!r"tamilr$N)rr r!rr:rr%ARMENIANr+r,r-r.r/r0r1r4r6r:r;r<r=r?r@TAMILrBr#r$r%rlrl stFH F EGG F F EIGIJHGGG EGr$rlcJeZdZUeddZded<eddZded<y) SnowballParams.rrrhrwrllanguageN)rr r!rrwr"rtr#r$r%rsrs s%Sb1D*1#("#=H =r$rscxeZdZUdZeddZeeed<eddZ d ed <edd Z ed ed <y)SparseIndexConfig2 Configuration for sparse inverted index. NvWe prefer a full scan search upto (excluding) this number of vectors. Note: this is number of vectors, not KiloBytes.r?r.z(Configuration for sparse inverted index.rSparseIndexTyperz,Datatype used to store weights in the index.VectorStorageDatatypedatatype) rr r!rrrr r-r"rr{r#r$r%rvrv sZ*/M*#%*#;e$fJ!f27"P3Hh./r$rvc~eZdZUdZeddZeeed<eddZ ee ed<eddZ ed ed <y) SparseIndexParamsrwNrxr?rzUStore index on disk. If set to false, the index will be stored in RAM. Default: falserya9Defines which datatype should be used for the index. Choosing different datatypes allows to optimize memory usage and performance vs accuracy. - For `float32` datatype - vectors are stored as single-precision floating point numbers, 4 bytes. - For `float16` datatype - vectors are stored as half-precision floating point numbers, 2 bytes. - For `uint8` datatype - vectors are quantized to unsigned 8-bit integers, 1 byte. Quantization to fit byte range `[0, 255]` happens during indexing automatically, so the actual vector data does not need to conform to this range.rqr{) rr r!rrrr r-r"ryrLr{r#r$r%r}r} sf*/M*#$kGXd^&+P &Hhz"r$r}c eZdZdZdefdZdZy)SparseIndexTypeOneOfz" Mutable RAM sparse index rc,t|jSrrrs r%rzSparseIndexTypeOneOf.__str__. rr$ MutableRamN)rr r!rr:r MUTABLERAMr#r$r%rr) sJr$rc eZdZdZdefdZdZy)SparseIndexTypeOneOf1z$ Immutable RAM sparse index rc,t|jSrrrs r%rzSparseIndexTypeOneOf1.__str__9 rr$ ImmutableRamN)rr r!rr:r IMMUTABLERAMr#r$r%rr4 s"Lr$rc eZdZdZdefdZdZy)SparseIndexTypeOneOf2z Mmap sparse index rc,t|jSrrrs r%rzSparseIndexTypeOneOf2.__str__D rr$MmapNrr r!rr:rMMAPr#r$r%rr? rr$rcZeZdZUdZeddZeeed<eddZ ee ed<y) rz! Sparse vector structure .zIndices must be uniquerindicesz*Values and indices must be the same lengthvaluesN) rr r!rrrrr-r"rrr#r$r%rrJ s5s0HIGT#YI1]^FDK^r$rcTeZdZUdZeddZded<eddZed ed <y) rz5 Config of single sparse vector data storage .z+Config of single sparse vector data storagerrvindexNr?SparseVectorStorageType storage_type) rr r!rrrr"rr r#r$r%rrS s9"'s8e!fE f8="O9L(45r$rcZeZdZUdZeddZeded<eddZeded <y) rz5 Params of single sparse vector data storage NzQCustom params for index. If none - values from collection configuration are used.r?r}rzIConfigures addition value modifications for sparse vectors. Default: nonermodifier) rr r!rrrr r"rr#r$r%rr^ sD,1"u,E8' (&+"m&Hhz"r$c eZdZdZdefdZdZy)SparseVectorStorageTypeOneOfz+ Storage on disk (rocksdb storage) rc,t|jSrrrs r%rz$SparseVectorStorageTypeOneOf.__str__p rr$ryN)rr r!rr:rON_DISKr#r$r%rrk sGr$rc eZdZdZdefdZdZy)SparseVectorStorageTypeOneOf1z4 Storage in memory maps (gridstore storage) rc,t|jSrrrs r%rz%SparseVectorStorageTypeOneOf1.__str__{ rr$r Nrr#r$r%rrv rr$rc,eZdZUeddZded<y)SqrtExpression.rrr3sqrtN)rr r!rrr"r#r$r%rr ss3D,3r$rcteZdZUeddZded<eddZeeed<eddZ ed ed <y) StartResharding.rrrrNr?rrjrC) rr r!rrr"rr r-rCr#r$r%rr s?',Sb'AI$A"4R@GXc]@&+Db&IIx #Ir$rc,eZdZUeddZded<y)StartReshardingOperation.rrrstart_reshardingN)rr r!rrr"r#r$r%rr rr$rc,eZdZdZdefdZdZdZdZdZ y) rz+ Role of the peer in the consensus rc,t|jSrrrs r%rzStateRole.__str__ rr$Follower CandidateLeader PreCandidateN) rr r!rr:rFOLLOWER CANDIDATELEADER PRECANDIDATEr#r$r%rr s)HI F!Lr$rcbeZdZUeddZeeded<eddZeee ed<y) StopwordsSetNrr?r languagesrZ) rr r!rrr rr"rZr:r#r$r%rr s7,1$B,OIxZ()O"'""EFHT#Y Er$rceZdZUeddZeeed<eddZee ed<eddZ ee ed<edd Z eeed <edd Z eeed <edd Z ee ed<eddZeeed<eddZeeed<eddZee ed<eddZee ed<eddZee ed<eddZee ed<eddZee ed<eddZee ed<eddZee ed <edd!Zee ed"<edd#Zed$ed%<edd&Zed'ed(<y))rbN7Whether strict mode is enabled for a collection or not.r?rTMax allowed `limit` parameter for all APIs that don't have their own max limit.max_query_limit Max allowed `timeout` parameter. max_timeoutIAllow usage of unindexed fields in retrieval based (e.g. search) filters.unindexed_filtering_retrieveMAllow usage of unindexed fields in filtered updates (e.g. delete by payload).unindexed_filtering_update,Max HNSW value allowed in search parameters.search_max_hnsw_ef'Whether exact search is allowed or not.search_allow_exact)Max oversampling value allowed in search.search_max_oversamplingMax batchsize when upsertingupsert_max_batchsizeEMax size of a collections vector storage in bytes, ignoring replicas. max_collection_vector_size_bytes4Max number of read operations per minute per replicaread_rate_limit5Max number of write operations per minute per replicawrite_rate_limit2Max size of a collections payload storage in bytes!max_collection_payload_size_bytes.Max number of points estimated in a collectionmax_points_count!Max conditions a filter can have.filter_max_conditions1Max size of a condition, eg. items in `MatchAny`.condition_max_sizeMultivector configurationStrictModeMultivectorConfigmultivector_configSparse vector configurationStrictModeSparseConfig sparse_configrr r!rrr rLr"rr-rrrrrrrrrrrrrrrrrr#r$r%rbrb s#D>wxGXd^x%*"x&OXc]"'tAc!dK#d38"m4 (4.27"q2).dHv(w w).tIr)ss/4"M0Xe_+0Jh*i(3-i6;"i7$hsm&+"X&OXc]',"Y'hsm8="V8%x}',DFv&whsmw+0Kn+o8C=o(-"U) CH"=C!>?9>dXu8vM845vr$rbceZdZUeddZeeed<eddZee ed<eddZ ee ed<edd Z eeed <edd Z eeed <edd Z ee ed<eddZeeed<eddZeeed<eddZee ed<eddZee ed<eddZee ed<eddZee ed<eddZee ed<eddZee ed<eddZee ed <edd!Zee ed"<edd#Zed$ed%<edd&Zed'ed(<y))rNrr?rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr!StrictModeMultivectorConfigOutputrrStrictModeSparseConfigOutputrrr#r$r%rr s#D>wxGXd^x%*"x&OXc]"'tAc!dK#d38"m4 (4.27"q2).dHv(w w).tIr)ss/4"M0Xe_+0Jh*i(3-i6;"i7$hsm&+"X&OXc]',"Y'hsm8="V8%x}',DFv&whsmw+0Kn+o8C=o(-"U) IN"=I!DE?D"??M8:;r$rc2eZdZUeddZeeed<y)rN&Max number of vectors in a multivectorr? max_vectorsrr r!rrr r-r"r#r$r%rr !&tAi!jK#jr$c2eZdZUeddZeeed<y)rNrr?rrr#r$r%rr rr$c2eZdZUeddZeeed<y)rNMax length of sparse vectorr? max_lengthrr r!rrr r-r"r#r$r%rr  %d@] ^J ^r$c2eZdZUeddZeeed<y)rNrr?rrr#r$r%rr rr$c2eZdZUeddZeded<y) SumExpression.rrr3sumN)rr r!rrrr"r#r$r%rr s#CR8Cl 8r$rceZdZUeddZeed<eddZded<eddZded<ed d Z e d ed <ed d Z e d ed<ed d Z e ded<ed d Z e ded<y )r.rrrr<apprrNr?rclusterrrequestsrzmemoryrxhardware)rr r!rrr:r"rrrr rrrr#r$r%rr sCR(B($Sb9C 9*/*DK'D,1$B,OGX( )O.3Db.QHh*+Q*/"*MFH& 'M.3Db.QHh*+Qr$rcLeZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <eddZ ee ed<eddZ ee ed<eddZeded<eddZee ed<eddZeded<y)TextIndexParams.rr TextIndexTyperwNr? TokenizerType tokenizerz#Minimum characters to be tokenized. min_token_lenz#Maximum characters to be tokenized. max_token_lenz-If true, lowercase all tokens. Default: true. lowercasez1If true, support phrase matching. Default: false.phrase_matchingz\Ignore this set of tokens. Can select from predefined languages and/or provide a custom set.StopwordsInterface stopwordsrxryz*Algorithm for stemming. Default: disabled.StemmingAlgorithmstemmer)rr r!rrwr"rr rr-rrrLrrryrr#r$r%rr s!#26D/6+02+NIx(N#(Ch#iM8C=i#(Ch#iM8C=i %d@o pIx~p&+"U'OXd^16r1Ix,-$D>qrGXd^r-2"N.GX) *r$rceZdZdZy)rrN)rr r!rr#r$r%rr' r}r$rceZdZdZdZdZdZy)rprefix whitespaceword multilingualN)rr r!PREFIX WHITESPACEWORD MULTILINGUALr#r$r%rr+ s FJ D!Lr$rceZdZdZdZy)TrackerStatusOneOf optimizingr(N)rr r! OPTIMIZINGr+r#r$r%r r 2 s J Dr$r c,eZdZUeddZeed<y)TrackerStatusOneOf1.rrr)N)rr r!rr)r:r"r#r$r%rr7 s3B/Is/r$rc,eZdZUeddZeed<y)TrackerStatusOneOf2.rrrN)rr r!rrr:r"r#r$r%rr; ss+E3+r$rceZdZUdZeddZeed<eddZe e ed<eddZ d ed <edd Z e eefed <ed dZee eefed<y )rz* Tracker object used in telemetry .zName of the optimizerrr=zSegment IDs being optimized segment_idsz Tracker object used in telemetry TrackerStatusrzStart time of the optimizerstart_atNzEnd time of the optimizerr?end_at)rr r!rrr=r:r"rrr-rrr rrrr r#r$r%rr? s~c'>?D#?"34QRKcR#C5WXFOX&+C=Z&[HeHdN#[.3DNi.jFHU8T>* +jr$rceZdZUdZeddZeded<eddZeded <edd Z ed ed <edd Z eded<eddZ eded<eddZ eded<eddZ eded<y)UpdateCollectionzF Operation for updating parameters of the existing collection NzMap of vector data parameters to update for each named vector. To update parameters in a collection having a single unnamed vector, use an empty string as name.r?VectorsConfigDiffrXzCustom params for Optimizers. If none - it is left unchanged. This operation is blocking, it will only proceed once all current optimizations are completer^r_z7Collection base params. If none - it is left unchanged.rrzSHNSW parameters to update for the collection index. If none - it is left unchanged.r\rzBQuantization parameters to update. If none - it is left unchanged.QuantizationConfigDiffrzFMap of sparse vector data parameters to update for each sparse vector.SparseVectorsConfigrzqrGXd^rr$r4ceZdZdZy)r5rN)rr r!r r#r$r%r5r5 r}r$r5ceZdZUdZeddZeeed<eddZ eeed<eddZ eeed <edd Z eeed <y) r,z% Values count filter request Nz'point.key.length() < values_count.ltr?rz'point.key.length() > values_count.gtrz)point.key.length() >= values_count.gterz)point.key.length() <= values_count.lter) rr r!rrrr r-r"rrrr#r$r%r,r, sad8abB bd8abB bt9deC#et9deC#er$r,ceZdZUdZeddZeed<eddZded<eddZ d ed <eddZ d ed <ed dZ e ded<ed dZ e ded<ed dZe ded<y )rz. Config of single vector data storage .z'Size/dimensionality of the vectors usedrr^z$Config of single vector data storagerdistanceVectorStorageTyperIndexesrNzDVector specific quantization config that overrides collection configr?rrzBVector specific configuration to enable multiple vectors per pointrrzBVector specific configuration to set specific storage element typerzr{)rr r!rrr^r-r"r9rrrr rr{r#r$r%rr sc'PQD#Q 2XYHjY(-c?e(fL%fS.TUE9U:?"h;"679>"f9!4538"f3Hh./r$rcheZdZUeddZeed<eddZeed<eddZeed<y)r.rrrVrr N) rr r!rrVr-r"rr r#r$r%rr s7Sb1K1$Sb99$Sb99r$rc@eZdZUeddZeeed<eddZded<eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZded<eddZded<eddZded<y)rNrr? index_name.rrtunfiltered_plainunfiltered_hnswunfiltered_sparsefiltered_plainfiltered_small_cardinalityfiltered_large_cardinalityfiltered_exactfiltered_sparseunfiltered_exact)rr r!rr>r r:r"r?r@rArBrCrDrErFrGr#r$r%rr s %d CJ C6;CR6P3P5:3B5OO2O7"H9!45r$rIczeZdZUeddZeded<eddZeded<edd Zee ed <y) rNzAUpdate params for HNSW index. If empty object - it will be unset.r?r\rz?Update params for quantization. If none - it is left unchanged.rrzQIf true, vectors are served from disk, improving RAM usage at the cost of latencyry) rr r!rrr r"rryrLr#r$r%rr s].3"e/K*+?D"c?":;$"uGXd^r$c(eZdZdZdefdZdZdZdZy)rzz# Storage types for vectors rc,t|jSrrrs r%rzVectorStorageDatatype.__str__ rr$rrrtrsN) rr r!rr:rrurwrvr#r$r%rzrz s$GG Er$rzc eZdZdZdefdZdZy)VectorStorageTypeOneOfz^ Storage in memory (RAM) Will be very fast at the cost of consuming a lot of memory. rc,t|jSrrrs r%rzVectorStorageTypeOneOf.__str__ rr$MemoryN)rr r!rr:rMEMORYr#r$r%rNrN sFr$rNc eZdZdZdefdZdZy)VectorStorageTypeOneOf1z Storage in mmap file, not appendable Search performance is defined by disk speed and the fraction of vectors that fit in memory. rc,t|jSrrrs r%rzVectorStorageTypeOneOf1.__str__ rr$rNrr#r$r%rSrS rr$rSc eZdZdZdefdZdZy)VectorStorageTypeOneOf2z Storage in chunked mmap files, appendable Search performance is defined by disk speed and the fraction of vectors that fit in memory. rc,t|jSrrrs r%rzVectorStorageTypeOneOf2.__str__$ rr$ ChunkedMmapN)rr r!rr:r CHUNKEDMMAPr#r$r%rVrV s Kr$rVc eZdZdZdefdZdZy)VectorStorageTypeOneOf3z Same as `ChunkedMmap`, but vectors are forced to be locked in RAM In this way we avoid cold requests to disk, but risk to run out of memory Designed as a replacement for `Memory`, which doesn't depend on RocksDB rc,t|jSrrrs r%rzVectorStorageTypeOneOf3.__str__/ rr$InRamChunkedMmapN)rr r!rr:rINRAMCHUNKEDMMAPr#r$r%r[r[* s*r$r[cneZdZUeddZeed<eddZeed<eddZe eed<y) VersionInfo.rrtitler>Nr?r) rr r!rrar:r"r>rr r#r$r%r`r`5 s9s+E3+"-GS-!$B?FHSM?r$r`cJeZdZUeddZeed<eddZeed<y)r."Size of a single WAL segment in MBrwal_capacity_mbrs#<<%HH sCx.3 445"3(?#?@$(.K)K$L!c#556#C)A$AB0017y73(3 FYhF3IX36y6 @ @/9/NIXN D(Dy,d,  c4 sixs CYhAIXAGYG ## )$RYRMyM wI wy&? ?+I+w)wfYf8y2 9H  sD n)n(> 9)89 99H9 9H  Y)YT )8 =9H=/ny/ndWyW    J(JsD /(/s)8sT3IX3hIXh IX G)8GS9HS:ix:IX"AYhARIXRAYhAT sDIX;IX;%ix%PC9HC sD 2IX2K K y 99H97ix7FyF@I@ a)aD(D3IX3 9H =I=,I, 9 FYh0 Yh RYhR sysS$K9HK S$ 2)82F9HF Yh C)8CU U sYhs 3mIXmDyD (  K  K++<9<UIUM M sI s ]Yh]b(b>Yh6y IX  9  I ix"AYAyA ALLA)A X)XR)R E)EK)KQ)QK)KP)PV)VK)KJJJ)JL)LL)LR)RX)XZ)ZLLRRMMKKRRTTYY@ @ ( sDpypnixns(ssDsDBD(D29H27Y7G)G2-)8- 5ix5 Yh  ZyZ)8R)8RJ JV(VCeie  0 0 )8 -- sD  9(9:Yh:CE ET T@)8@9H3IX3iYhi2ix2Z)Z$RR y>9H>CTYTix>9H>A A;;9y9 <9H< Uy UOIOT$^Yh^RYhR#i# #y# #y# #y# NyNvv R9HR N9H N`)8` 89H8 R)8R R(R 2IX28 8 y6F)8FE E y$)()X 9H F@ @=I=QyQ(XIXX #t &Yh&R Yh =Yh=&y&RDIXD T  XY X7i7H9HN)8NV9HV.ix. a)a030&YhCixC7 7 sDTJYJ?ix?EyE \) \S$2)82D(D y d \) \vIXv.9)8:X)XNyNd d )8  9H(IX@A(ALIL n)n0VyV #t (,;)8;-i-5 5S$ OiOKiK9H #t  $&sD&TT<T<S$ B)B sD ix"sDsD:>Yh>   &3"C"C_9H_Y ( 3C4Yh4JixJ EyE "T "F9HF &wy&wR(Y(VkIXkk)k_y__Y_9IX9RIRix&C"C"d 0)0,), ky ky<EyE898 3 RIXR AYhAAixA I sixs Cf)8fy(:Y: Q9 Q9H8 y  C S$c4 c4 *c4*@)@ u u IX`i`( C  OO    "$     !                  !#              ""##%     J    !#      O    J    k     k   L !#  O k d; !DL !NK   % *  Nk     k F     k L !# O   r$