j<ddlmZmZddlmZddlmZmZmZmZm Z m Z ddl m Z ddl mZmZddlmZmZmZmZeeefZeedfZeedfZeed fZeed fZeed fZeed fZGd dedZGddedZGddedZGddedZ GddedZ!GddeZ"GddeZ#GddeZ$Gdd eZ%Gd!d"edZ&Gd#d$edZ'Gd%d&edZ(Gd'd(eeZ)Gd)d*eeZ*Gd+d,edZ+Gd-d.edZ,Gd/d0eeZ-Gd1d2edZ.Gd3d4edZ/Gd5d6eZ0Gd7d8eZ1Gd9d:eZ2Gd;deZ4Gd?d@eZ5GdAdBeZ6GdCdDeZ7GdEdFeZ8GdGdHeZ9GdIdJeZ:GdKdLeZ;GdMdNedZ<GdOdPeZ=GdQdReeZ>GdSdTeZ?GdUdVeZ@GdWdXeZAGdYdZeZBGd[d\eZCGd]d^eZDGd_d`eeZEGdadbeZFGdcddeZGGdedfeZHGdgdheZIGdidjedZJGdkdledZKGdmdnedZLGdodpeZMGdqdreeZNGdsdtedZOGdudvedZPGdwdxedZQGdydzedZRGd{d|edZSGd}d~edZTGddeeZUGddedZVGddedZWGddeeZXGddedZYGddedZZGddedZ[GddedZ\GddedZ]GddedZ^GddedZ_GddedZ`GddedZaGddedZbGddedZcGddedZdGddeeZeGddeeZfGddedZgGddedZhGddedZiGddeeZjGddeZkGddeZlGddeZmGddeZnGddeZoGddeZpGddeZqGddedZrGddedZsGddedZtGddedZuGddedZvGdÄdedZwGdńdeZxGdDŽdeZyGdɄdedZzGd˄dedZ{Gd̈́dedZ|GdτdeZ}GdфdeZ~GdӄdeZGdՄdedZGdׄdedZGdلdedZGdۄdedZGd݄dedZGd߄deeZGddedZGddeeZGddedZGddedZGddedZGddedZGddedZGddedZGddeeZGddedZGddedZGddedZGddedZGddeZGddeZGddeZGddeZGddeZGddedZGddedZGd d eZGd d edZGd deZGddedZGddeeZGddedZGddeZGddeZGddedZGddeZGddeZGdd eZGd!d"eZGd#d$eZGd%d&eZGd'd(eZGd)d*eZGd+d,eZGd-d.eZGd/d0eZGd1d2eZGd3d4eZGd5d6eZGd7d8eZGd9d:eZGd;deZGd?d@eZGdAdBeZGdCdDeZGdEdFeZGdGdHeZGdIdJeZGdKdLeZGdMdNeZGdOdPeZGdQdReZGdSdTeZGdUdVedZGdWdXeeZGdYdZeeZGd[d\edZGd]d^edZGd_d`edZGdadbeeZGdcddeeZGdedfedZGdgdhedZGdidjeZGdkdleZGdmdnedZGdodpedZGdqdreeZGdsdteeZGdudveeZGdwdxedZGdydzedZGd{d|edZGd}d~edZGddedZGddedZGddedZGddeeZGddeeZGddeZGddeZGddedZGddedZGddeZGddeeZGddedZGddedZGddedZGddeeZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddeeZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGddedZGddeeZGddeZGddedZGdÄdedZGdńdedZGdDŽdeZGdɄdeZGd˄dedZGd̈́deZGdτdeZGdфdeeZGdӄdedZGdՄdedZGdׄdedZGdلdeZGdۄdeZGd݄deZGd߄deZGddeZGddeZGddeZGddedZ GddedZ GddedZ GddedZ GddedZ GddedZGddedZGddedZGddedZGddedZGddedZGddeZGddedZGddedZGddedZGddedZGddeZGd d edZGd d eZGd deZGddeZGddeZGddeZGddedZ GddeeZ!GddedZ"GddedZ#GddeeZ$Gdd eZ%Gd!d"edZ&Gd#d$edZ'Gd%d&eZ(Gd'd(eZ)Gd)d*edZ*Gd+d,edZ+Gd-d.edZ,Gd/d0eZ-Gd1d2eeZ.Gd3d4edZ/Gd5d6edZ0Gd7d8edZ1Gd9d:edZ2Gd;deeZ4Gd?d@eZ5GdAdBedZ6GdCdDedZ7GdEdFedZ8GdGdHedZ9GdIdJeZ:GdKdLeeZ;GdMdNedZ<GdOdPedZ=GdQdRedZ>GdSdTeeZ?GdUdVeZ@GdWdXedZAGdYdZeZBGd[d\eZCGd]d^eZDGd_d`eZEGdadbedZFGdcddedZGGdedfeZHGdgdheZIGdidjeZJGdkdleZKGdmdneeZLGdodpedZMGdqdredZNGdsdteZOGdudveZPGdwdxeeZQGdydzeZRGd{d|eZSGd}d~eZTGddedZUGddeZVGddedZWGddeeZXGddeZYGddeeZZGddeZ[GddeeZ\GddedZ]GddedZ^GddeZ_GddeeZ`GddedZaGddeeZbGddeeZcGddedZdGddeZeGddedZfGddeeZgGddeeZhGddeeZiGddedZjGddedZkGddeZlGddedZmGddedZnGddeeZoGddeeZpGddedZqGddedZrGddedZsGddeeZtGddedZuGddedZvGd„deZwGdĄdedZxGdńd eZyGdƄd edZzGdDŽd eZ{GdȄdedZ|GdʄdeZ}Gd̄dedZ~Gd΄deeZGdЄdeeZGd҄deeZGdԄdeZGdքdeZGd؄deZGdڄdeeZGd܄dedZGdބdedZGddedZGddeeZGddedZGddeZGddeZGddeeZGddedZGddedZGddedZGddeZGddedZGddeeZGddedZGddeZGddeZGddeZGddedZGdd edZGddeeZGddeeZGddeeZGd d eeZGd d eeZGd deeZGddeeZGddeZGddeZGddedZGddeZGddedZGddeeZe ePe]e+fZe eeeefZe ee2eeueTewe7esee0f Ze e1e2fZe e?eAfZe eeeeee^eefZe eGeHeIfZe eJeeJfZe eeefe+fZe ee ee ffZe eeefZe efZe eefZe eefZe eefZe eeefZe eeeeeeefZe eefZe eefZe eefZe eefZe eeeee~e,eWefZe eefZe eefZe e efZe e efZe e=ee'efZe e=ee'eeffZe ee#eieKeee9ee<e'f Ze e eZfZe ee!fZe eQeReSfZe eefZe efZe egeheifZe eoepfZe eeeefZe edegfZe eǐeufZe eeefZe ee^eNee`e/eebfZe eeefZe eeejeeeeteefZe edemfZe eeejeeefZe eeeeeefZe eeeeffZe eefZe eeefZe eeeeeeeeeeefeeteeeefZe eeeeeVeYee|ee ereqee{eeeezefZe eefZe eeeeUfZe eeejeeeeeteefZe eeeeeeeefeteefZe eeeeeeeeffZe eeeefZe eܐefZdS()datedatetime)Enum)AnyDictListLiteralOptionalUnion)UUID) BaseModelField) StrictBool StrictFloat StrictInt StrictStrSparseVectorParamsStrictModeMultivectorStrictModeMultivectorOutputStrictModeSparseStrictModeSparseOutputVectorParamsDiffc4eZdZUeddZeed<dS)AbortReshardingOperation. descriptionabort_reshardingN)__name__ __module__ __qualname__rrr__annotations__NC:\Projects\DSCons\.venv\Lib\site-packages\qdrant_client\http\models\models.pyrrs2!E#2666c66666r$rforbid)extrac|eZdZUeddZeed<eddZeed<eddZeed<dS)AbortShardTransfer.rrshard_id to_peer_id from_peer_idN) rr r!rr*intr"r+r,r#r$r%r)r)soE#2...Hc...eCR000J000cr222L#22222r$r)c4eZdZUeddZded<dS)AbortTransferOperation.rrr)abort_transferN)rr r!rr0r"r#r$r%r/r/s2+05"+E+E+EN(EEEEEr$r/c4eZdZUeddZded<dS) AbsExpression.rr ExpressionabsN)rr r!rr4r"r#r$r%r2r2 1cr222C22222r$r2cteZdZUdZeddZeeed<eddZ ee ed<dS) AcornSearchParamsz) ACORN-related search parameters FzIf true, then ACORN may be used for the HNSW search based on filters selectivity. Improves search recall for searches with multiple low-selectivity payload filters, at cost of performance.defaultrenableNaMaximum selectivity of filters to enable ACORN. If estimated filters selectivity is higher than this value, ACORN will not be used. Selectivity is estimated as: `estimated number of points satisfying the filters / total number of points`. 0.0 for never, 1.0 for always. Default is 0.4.max_selectivity) rr r!__doc__rr:r boolr"r;floatr#r$r%r7r7$s#USFHTN(-uv(((OXe_r$r7cXeZdZUeddZeed<eddZeed<dS)AliasDescription.rr alias_namecollection_nameN)rr r!rrAstrr"rBr#r$r%r@r@3sPeCR000J000 5"555OS55555r$r@c eZdZUeddZeed<eddZeed<eddZe ded <eddZ e d ed <eddZ e d ed <eddZ e ded<eddZ e ded<eddZe eed<eddZe eed<eddZe ded<eddZeeefed<dS)AppBuildTelemetry.rrnameversionNr8AppFeaturesTelemetryfeatures FeatureFlagsruntime_features LowMemoryModelow_memory_modeHnswGlobalConfighnsw_global_configRunningEnvironmentTelemetrysystemjwt_rbachide_jwt_dashboardAuditTelemetryauditstartup)rr r!rrFrCr"rGrIr rKrMrOrQrRr=rSrUrVr rrr#r$r%rErE8scr***D#***5"---GS---16tQS1T1T1THh-.TTT16tQS1T1T1Th~.TTT16tQS1T1T1TOXo.TTT7 "?????r$rEceZdZUeddZeed<eddZeed<eddZeed<eddZ eed<eddZ eed<eddZ eed <d S) rH.rrdebugservice_debug_feature recovery_modegpurocksdbstagingN) rr r!rrXr=r"rYrZr[r\r]r#r$r%rHrHFs%,,,E4,,,"'%"<"<"<4<<<%444M4444cr***C***E#2...GT...E#2...GT.....r$rHceZdZUeddZeed<eddZeed<eddZe ed<eddZ e ed<eddZ e ed<ed d Z ee ed <d S) rT.rrdirrotation max_log_filestrust_forwarded_headerslog_apiNr8dir_size_bytes)rr r!rr_rCr"r`rar-rbr=rcrdr r#r$r%rTrTOsuSb)))C)))E#2...Hc...s333M3333$)E#2$>$>$>T>>>E#2...GT...$)E$B$G$G$GNHSMGGGGGr$rTceZdZUeddZeded<eddZded<edd Ze ed ed <dS) Batch.rrExtendedPointIdidsBatchVectorStructvectorsNr8Payloadpayloads) rr r!rrhrr"rjrlr r#r$r%rfrfXs#(5"#=#=#=C ===#(5"#=#=#=G ===*/%"*M*M*MHhtI'MMMMMr$rfc4eZdZUeddZded<dS)BinaryQuantization.rrBinaryQuantizationConfigbinaryN)rr r!rrpr"r#r$r%rnrn^2).s)C)C)CF &CCCCCr$rnceZdZUeddZeeed<eddZeded<eddZ ed ed <edd Z ed ed <dS)roN!Deprecated: use `memory` instead.r8 always_ramMemory placement of quantized vectors. Overrides the deprecated `always_ram` flag if both are set. Default: follow the memory placement of the original vector storage.MemorymemoryrBinaryQuantizationEncodingencodingzAsymmetric 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!rrtr r=r"rwryr{r#r$r%rorobs!&tAd!e!e!eJeee!&~"""FHX 8=uTWY7Z7Z7ZHh34ZZZBG%BCCCNH>?r$roceZdZdZdZdZdS)rxone_bittwo_bitsone_and_half_bitsN)rr r!ONE_BITTWO_BITSONE_AND_HALF_BITSr#r$r%rxrxos GH+r$rxceZdZdZdZdZdZdS)rzr9rp scalar4bits scalar8bitsN)rr r!DEFAULTBINARY SCALAR4BITS SCALAR8BITSr#r$r%rzrzus"G FKKKKr$rzc$eZdZUdZeddZeeed<eddZ eeed<ed d Z eeed <ed d Z eded<ed dZ ee ed<ed dZeeed<ed dZeeed<ed dZeded<ed dZeded<ed dZeeed<ed dZeeed<d S) Bm25Configz1 Configuration of the local bm25 models. g333333?zeControls term frequency saturation. Higher values mean term frequency has more impact. Default is 1.2r8kg?zControls document length normalization. Ranges from 0 (no normalization) to 1 (full normalization). Higher values mean longer documents have less impact. Default is 0.75.bzCExpected average document length in the collection. Default is 256.avg_lenNz'Configuration of the local bm25 models. TokenizerType tokenizerasDefines which language to use for text preprocessing. This parameter is used to construct default stopwords filter and stemmer. To disable language-specific processing, set `stemmer` to `{'type': 'none'}` and configure an empty stopword set. The legacy `'language': 'none'` hack is deprecated and may be rejected in a future release. If not specified, English is assumed.languagez:Lowercase the text before tokenization. Default is `true`. lowercaseutIf true, normalize tokens by folding accented characters to ASCII (e.g., 'ação' -> 'acao'). Default is `false`. ascii_foldingzConfiguration of the stopwords filter. Supports list of pre-defined languages and custom stopwords. Default: initialized for specified `language` or English if not specified.StopwordsInterface stopwordszConfiguration of the stemmer. Processes tokens to their root form. Default: initialized Snowball stemmer for specified `language` or English if not specified.StemmingAlgorithmstemmerzMinimum token length to keep. If token is shorter than this, it will be discarded. Default is `None`, which means no minimum length. min_token_lenzMaximum token length to keep. If token is longer than this, it will be discarded. Default is `None`, which means no maximum length. max_token_len)rr r!r<rrr r>r"rrrrrCrr=rrrrr-rr#r$r%rr|s\{AxAAx %u!f   GXe_,15Kt+u+u+uIx(uuu#eJHhsm!&"^!!!Ix~%*EK%%%M8D>16E111Ix,-.3Uu...GX) *$)5[$$$M8C=$)5Z$$$M8C=r$rceZdZUeddZded<eddZeeed <edd Z ed ed <edd Z eeed<dS)BoolIndexParams.rr BoolIndexTypetypeNSDeprecated: use `memory` instead. If true, store the index on disk. Default: false.r8on_diskMemory placement of the index. Overrides the deprecated `on_disk` flag if both are set. Default: `pinned` (`cold` if `on_disk` is set to true).rvrwEnable HNSW graph building for this payload field. If true, builds additional HNSW links (Need payload_m > 0). Default: true. enable_hnsw rr r!rrr"rr r=rwrr#r$r%rrs!E#2666D/666#e"wGXd^"'f"""FHX #(%W###K$r$rceZdZdZdS)rr=N)rr r!BOOLr#r$r%rr DDDr$rcDeZdZUdZeddZeded<dS)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!r<rrrr"r#r$r%rrsX(-u v(((GT# $r$rc4eZdZUeddZded<dS)ClearPayloadOperation.rrPointsSelector clear_payloadN)rr r!rrr"r#r$r%rrs2&+eCR&@&@&@M#@@@@@r$rc|eZdZUeddZeed<eddZded<eddZded<d S) ClusterConfigTelemetry.rrgrpc_timeout_msP2pConfigTelemetryp2pConsensusConfigTelemetry consensusN) rr r!rrr-r"rrr#r$r%rrsq 5"555OS555 %cr : : :C :::,1E#2,F,F,FI)FFFFFr$rc@eZdZUeddZeded<dS)ClusterStatusOneOf.rr)disabledstatusN)rr r!rrr r"r#r$r%rrsH cr""" G #####r$rceZdZUdZeddZeded<eddZe ed<edd Z e e d fed <eddZ d ed <eddZded<eddZe e dfed<dS)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!r<rrr r"rr-rrrCrrrr#r$r%rrs c?@@@ G AAA5*;<<tY[9\9\9\M8Dn!456\\\).t)L)L)LHhtCH~&LLL).t)L)L)LLLLLLr$rc(eZdZUdZeddZeed<eddZeed<eddZ e d ed <edd Z e d ed <eddZ e ded<eddZ ee ded<dS)CollectionClusterInfoz< Current clustering distribution for the collection .rrrzTotal number of shards shard_countz Local shardsLocalShardInfo local_shardsz Remote shardsRemoteShardInfo remote_shardszShard transfersShardTransferInfoshard_transfersNzResharding operationsr8ReshardingInforesharding_operations)rr r!r<rrr-r"rrrrrrr r#r$r%rrs5*;<<CeD^u>v>v>v8D)9$:;vvvvvr$rc@eZdZUdZeddZded<eddZded<eddZd ed <ed d Z e d ed<ed d Z e ded<ed d Z e ded<ed d Z e ded<d S)CollectionConfigz8 Information about the collection configuration .z.Information about the collection configurationrCollectionParamsparams HnswConfig hnsw_configOptimizersConfigoptimizer_configNr8 WalConfig wal_configQuantizationConfigquantization_configStrictModeConfigOutputstrict_mode_configArbitrary JSON metadata for the collection This can be used to store application-specific information such as creation time, migration data, inference model info, etc.rkr)rr r!r<rrr"rrrr rrrr#r$r%rr s\"'s8h!i!i!iF iii %c7g h h hKhhh+05Br+s+s+s(sss(-"R)))J%;@%"R;;;"67>CU"R>>>!9:%*E~%%%Hhy!r$rc`eZdZUeddZded<eddZded<eddZded <eddZd ed <ed d Z e ded<ed d Z e ded<ed d Z e e ed<ed d Ze ded<d S)CollectionConfigTelemetry.rrrrrrrrrrNr8rrrruuidz*Arbitrary JSON metadata for the collectionrkr)rr r!rrr"rrrrr rrr rr#r$r%rr#s'!&s!;!;!;F ;;; %cr : : :K:::+05"+E+E+E(EEE#eCR888J 888:?%Z\:]:]:]"67]]]=BU4]_=`=`=`!9:``` 52>>>D(4.>>>$)E$Dp$q$q$qHhy!qqqqqr$rc4eZdZUeddZeed<dS)CollectionDescription.rrrFNrr r!rrFrCr"r#r$r%rr.1cr***D#*****r$rc8eZdZUdZeddZeed<dS)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!r<rrr=r"r#r$r%rr2s>5*uvvvFDvvvvvr$rceZdZUdZeddZded<eddZded<ed d Ze e d ed <ed d Z e e ed<ed d Z e e ed<eddZe ed<eddZded<eddZeedfed<ed d Ze ded<d S)CollectionInfoz@ Current statistics and configuration of the collection .z6Current statistics and configuration of the collectionrCollectionStatusrOptimizersStatusoptimizer_statusNz"Warnings related to the collectionr8CollectionWarningwarningszApproximate 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_schemazUpdate queue infoUpdateQueueInfo update_queue)rr r!r<rrr"rrr rrr-rrrrrrCr r#r$r%rr:s"'s8p!q!q!qF qqq+05 Q,,,(5:E"F555Hht/01,15u,,,8C=#(%B###L(3- % sNC"'s8p!q!q!qF qqq49E#Kd4e4e4eND001eee05dPc0d0d0dL(,-dddddr$rceZdZUeddZeded<eddZeeed<edd Z ed ed <edd Z eeed <eddZ eeed<eddZ eeed<eddZ eeed<eddZeeed<eddZeded<eddZeeedfed<dS)rNrr8 VectorsConfigrjz#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_factorzDefine number of milliseconds to wait before attempting to read from another replica. This setting can help to reduce latency spikes in case of occasional slow replicas. Default is 0, which means delayed fan out request is disabled.read_fan_out_delay_msTMDeprecated: use `payload.memory` instead. 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_payload$Configuration of the payload storagePayloadStorageParamspayloadz*Configuration of the sparse vector storagersparse_vectors)rr r!rrjr r"r r-rrrrrrr=rrrrCr#r$r%rrVs).t)L)L)LGXo &LLL"'%?d"e"e"eL(3-eee27%p333OX./).aEh(i(i(i iii.3eg///hsm*/}***#,15,,,8C=',ed'''OXd^16dPv0w0w0wGX, -www@E"NAAANHT#';";<=r$rc0eZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z eeed <edd Z ee ed <edd Z eded<dS)CollectionParamsDiffNrr8rzRMinimal number successful responses from replicas to consider operation successfulrzfFan-out every read request to these many additional remote nodes (and return first available response)rzBDelay in milliseconds before sending read requests to remote nodesra>Deprecated: use `payload.memory` instead. 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.rzEUpdate params of the payload storage. If none - it is left unchanged.rr)rr r!rrr r-r"rrrrr=rr#r$r%rrts@(-dHk(l(l(l lll.3e"v///hsm*/|***#,15"f,,,8C=',eU'''OXd^16"i111GX, -r$rceZdZUeddZeed<eddZee ed<eddZ ee ed<eddZ ee ed <dS) CollectionSnapshotTelemetry.rridNr8running_snapshotsrunning_snapshot_recoverytotal_snapshot_creations) rr r!rr!rCr"r"r r-r#r$r#r$r%r r seCR(((B(((',uTr'J'J'Jx}JJJ/4uTr/R/R/Rx}RRR.3eDb.Q.Q.QhsmQQQQQr$r c.eZdZdZdefdZdZdZdZdZ dS) 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|jSNrCvalueselfs r%__str__zCollectionStatus.__str__4:r$greenyellowgreyredN rr r!r<rCr-GREENYELLOWGREYREDr#r$r%rrI E F D CCCr$rceZdZUeddZeed<eddZee ed<eddZ eded <eddZ ee d ed <eddZ ee d ed <eddZee ded<eddZeeedfed<dS)CollectionTelemetry.rrr!Nr8 init_time_msrrReplicaSetTelemetryshardsr transfersr reshardingShardCleanStatusTelemetryshard_clean_tasks)rr r!rr!rCr"r;r r-rr=rr>r?rArr#r$r%r:r:s-eCR(((B((("'%""E"E"EL(3-EEE49E$TV4W4W4WFH0 1WWW49E$TV4W4W4WFHT/0 1WWW5:U4UW5X5X5XIx012XXX385SU3V3V3VJ./0VVVJO%X\jlJmJmJmxS*E%E FGmmmmmr$r:c4eZdZUeddZeed<dS)r.zWarning messagermessageN)rr r!rrCrCr"r#r$r%rrs25*;<<r$rxc4eZdZUeddZeed<dS) CountResult.z-Number of points which satisfy the conditionsrcountN)rr r!rrr-r"r#r$r%rrs2s(WXXXE3XXXXXr$rceZdZdZdZdZdS) CpuEndianlittlebigotherN)rr r!LITTLEBIGOTHERr#r$r%rrs F C EEEr$rc\eZdZUdZeddZeed<eddZeed<dS) 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,rrBrAN) rr r!r<rrBrCr"rAr#r$r%rrs!5 DOSe DJr$rc4eZdZUeddZded<dS)CreateAliasOperation.rrr create_aliasN)rr r!rrr"r#r$r%rrs1"'%"<"<"AAANHT#';";<=8=uTWl7m7m7m!34mmm$)E~%%%Hhy!r$rcdeZdZUeddZeed<eddZeded<dS) CreateFieldIndex.rr field_nameNr8PayloadFieldSchema field_schema) rr r!rrrCr"rr r#r$r%rrMsWeCR000J000385SU3V3V3VL(/0VVVVVr$rceZdZUeddZded<eddZeeed <edd Z eeed <edd Z ee eed <eddZ eded<dS)CreateShardingKey.rrShardKeyr{Nz_How many shards to create for this key If not specified, will use the default value from configr8 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 placementzInitial state of the shards for this key If not specified, will be `Initializing` first and then `Active` Warning: do not change this unless you know what you are doing ReplicaState initial_state) rr r!rr{r"rr r-rrrrr#r$r%rrRs !E#2666Iz666#(5u$$$M8C=).y))) &+Uq&&&IxS "/4e///M8N+r$rc4eZdZUeddZded<dS)CreateShardingKeyOperation.rrrcreate_sharding_keyN)rr r!rrr"r#r$r%rrfs3/4uSb/I/I/I,IIIIIr$rceZdZdZdZdZdZdS)Datatypefloat32uint8float16turbo4N)rr r!FLOAT32UINT8FLOAT16TURBO4r#r$r%rrjs"G EG FFFr$rc4eZdZUeddZeed<dS)DatetimeExpression.rrrN)rr r!rrrCr"r#r$r%rrqs1E#2...Hc.....r$rceZdZUeddZded<eddZeeed <edd Z eeed <edd Z ed ed<eddZ eeed<dS)DatetimeIndexParams.rrDatetimeIndexTyperNIf 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.r8 is_principalrrrrvrwrr rr r!rrr"rr r=rrwrr#r$r%rrus  %cr : : :D :::#(5j$$$L(4.$e"wGXd^"'f"""FHX #(%W###K$r$rceZdZdZdS)rrN)rr r!DATETIMEr#r$r%rrHHHr$rc4eZdZUeddZeed<dS)DatetimeKeyExpression.rr datetime_keyN)rr r!rrrCr"r#r$r%rrs1cr222L#22222r$rceZdZUdZeddZeeee fe d<eddZ eeee fe d<eddZ eeee fe d <edd Z eeee fe d <dS) DatetimeRange Range filter request Npoint.key < range.ltr8ltpoint.key > range.gtgtpoint.key >= range.gtegtepoint.key <= range.ltelte)rr r!r<rrr r rrr"rrrr#r$r%rrs+0%Jc*d*d*dBx~&'ddd*/%Jc*d*d*dBx~&'ddd+05Kf+g+g+gC%$' (ggg+05Kf+g+g+gC%$' (gggggr$rceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <dS)DecayParamsExpression.rrr3xNz7The target value to start decaying from. Defaults to 0.r8targetzdThe scale factor of the decay, in terms of `x`. Defaults to 1.0. Must be a non-zero positive number.scalez}The midpoint of the decay. Should be between 0 and 1.Defaults to 0.5. Output will be this value when `|x - target| == scale`.midpoint) rr r!rrr"rr rr>rr#r$r%rrseCR000A|000%*U"[&&&FH\ "#UzE8E?!&T!!!Hhuor$rc8eZdZUdZeddZeed<dS) DeleteAlias Delete alias if exists .Delete alias if existsrrAN)rr r!r<rrArCr"r#r$r%rrs>eC-EFFFJFFFFFr$rc8eZdZUdZeddZded<dS)DeleteAliasOperationr.rrr delete_aliasN)rr r!r<rrr"r#r$r%rrs>#(%9Q"R"R"RL-RRRRRr$rc4eZdZUeddZded<dS)DeleteOperation.rrrdeleteN)rr r!rrr"r#r$r%rrs2$uSb999F 99999r$rceZdZUdZeddZeeed<eddZ e ed ed <edd Z e d ed <eddZ e ded<dS) 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 listr8rgpoints=Deletes values from points that satisfy this filter conditionr}r~OThis data structure is used in API interface and applied across multiple shardsrzr{) rr r!r<rrrrCr"rr r~r{r#r$r%rrseC-Z[[[D$s)[[[05"O111FHT+, -"'"a"""FHX /4e"s///Ix*+r$rc4eZdZUeddZded<dS)DeletePayloadOperation.rrrdelete_payloadN)rr r!rrr"r#r$r%rr1&+eCR&@&@&@NO@@@@@r$rceZdZUeddZeeded<eddZeded<ed d Z ee ed <edd Z eded<dS) DeleteVectorsNrr8rgrrr}r~.z Vector namesrvectorrrzr{) rr r!rrr rr"r~rrCr{r#r$r%rrs05"O111FHT+, -"'"a"""FHX c~>>>FDI>>>.3eDb.Q.Q.QIx*+QQQQQr$rc4eZdZUeddZded<dS)DeleteVectorsOperation.rrrdelete_vectorsN)rr r!rrr"r#r$r%rrrr$rceZdZUdZeddZeed<eddZded<ed d Z e d ed <ed d Z e ded<d S)DenseVectorConfigz Configuration for creating a new dense named vector. Only includes properties that define the vector space and cannot be changed after creation. Storage type, index type, and quantization are inferred. .zDimensionality of the vectorsrsizezConfiguration for creating a new dense named vector. Only includes properties that define the vector space and cannot be changed after creation. Storage type, index type, and quantization are inferred.DistancedistanceNz5Configuration for multi-vector points (e.g., ColBERT)r8MultiVectorConfigmultivector_configz6Element storage type (Float32, Float16, Uint8, Turbo4)VectorStorageDatatypedatatype) rr r!r<rrr-r"rrr rr#r$r%rrsc'FGGGD#GGG 5 aHj9>"Y999!4538%"Z333Hh./r$rc8eZdZUdZeddZded<dS)DenseVectorNameConfigz3 Wrapper for dense vector creation config. .z)Wrapper for dense vector creation config.rrdenseN)rr r!r<rrr"r#r$r%rrs?"'s8c!d!d!dE dddddr$rceZdZdZdZdS) DirectionascdescN)rr r!ASCDESCr#r$r%rrs C DDDr$rceZdZdZdS)DisabledN)rr r!DISABLEDr#r$r%rrrr$rc4eZdZUeddZded<dS)DisabledStemmerParams.rr NoStemmerrN)rr r!rrr"r#r$r%rrs1cr222D+22222r$rcteZdZUeddZded<eddZeeddfed<d S) DiscoverInput.rrrprz:Search space will be constrained by these pairs of vectorsrorvN) rr r!rrr"rvr rr#r$r%rr sq!E#2666FM6669> U:::GU4 & 5 6r$rc4eZdZUeddZded<dS) DiscoverQuery.rrrdiscoverN)rr r!rrr"r#r$r%rrs1 %cr : : :Ho:::::r$rc.eZdZdZdefdZdZdZdZdZ dS) rzc Type of internal tags, build from payload Distance function types used to compare vectors r&c*t|jSr(r)r+s r%r-zDistance.__str__r.r$CosineEuclidDot ManhattanN) rr r!r<rCr-COSINEEUCLIDDOT MANHATTANr#r$r%rrsIF F CIIIr$rceZdZUeddZeed<eddZee ed<eddZ e e dfed <dS) DistributedClusterTelemetry.rrrNr8rDistributedPeerInfor) rr r!rrr=r"rr r-rrrCr#r$r%rr"s~E#2...GT...%*U4R%H%H%HOXc]HHH.3eCR.H.H.HE4** +HHHHHr$rceZdZUeddZeed<eddZee ded <edd Z ee d ed <edd Z ee ded<dS)DistributedCollectionTelemetry.zCollection namerr!NzShards topologyr8DistributedShardTelemetryr=zOngoing resharding operationsr reshardingszOngoing shard transfersrr) rr r!rr!rCr"r=r rrrr#r$r%rr(seC%6777B777:?%Zk:l:l:lFHT56 7lll49E$Ts4t4t4tK$/01ttt;@5[t;u;u;uOXd#678uuuuur$rceZdZUeddZeed<eddZeded <edd Z e ed <edd Z e ed <eddZ e ed<eddZe ed<eddZded<dS)DistributedPeerDetails.zQdrant versionrrGNzConsensus role for the peerr8rrz.Whether it can participate in leader electionsrz Election termrzLatest accepted commitrz.Number of operations pending for being appliednum_pending_operationsrrr)rr r!rrGrCr"rr rr=rr-rrrr#r$r%rr/s5*:;;;GS;;;"'%B_"`"`"`D(; ```U3,\]]]Hd]]]c777D#777%)ABBBFCBBB"'%9i"j"j"jCjjj7666&+eDn&U&U&UFH] #UUU,1E$Ld,e,e,eHSMeee(-dHi(j(j(j jjj).tIk)l)l)l#lll %d@^ _ _ _J ___!&tA`!a!a!aK#aaa49E"I555$sCx.1DI5MDDD8$?@>CU">>>>h9:r$r!ceZdZUeddZeed<eddZeded <edd Z e d ed <dS) r.zShard IDrr!NzOptional shard keyr8rkeyzReplica informationr!replicas) rr r!rr!r-r"r.r r/rr#r$r%rrVs|eCZ000B000 %d@T U U UC* UUU49E#K`4a4a4aHd01aaaaar$rcteZdZUeddZeedfed<eddZe ded <dS) DistributedTelemetryData.rrrrLNr8rcluster) rr r!rrLrrCr"r2r r#r$r%r1r1\sc?DuSVX?Y?Y?YKc;;<YYY7r#r$r%r5r5esss333D,333%444E<444',uTr'J'J'JOXe_JJJJJr$r5ceZdZUdZeddZeed<eddZeed<edd Z e d ed <dS) Documentz WARN: Work-in-progress, unimplemented Text document for embedding. Requires inference infrastructure, unimplemented. .zOText of the document. This field will be used as input for the embedding model.rtext^Name of the model used to generate the vector. List of available models depends on a provider.modelNzwAdditional options for the model, will be passed to the inference service as-is. See model cards for available options.r8DocumentOptionsoptions) rr r!r<rr>rCr"r@rBr r#r$r%r=r=ks jD# tE3,15N,,,GX' (r$r=c4eZdZUeddZded<dS)DropReplicaOperation.rrReplica drop_replicaN)rr r!rrFr"r#r$r%rDrD}s1#eCR888L)88888r$rDc4eZdZUeddZded<dS)DropShardingKey.rrrr{N)rr r!rr{r"r#r$r%rHrHs1!E#2666Iz66666r$rHc4eZdZUeddZded<dS)DropShardingKeyOperation.rrrHdrop_sharding_keyN)rr r!rrKr"r#r$r%rJrJs3+05"+E+E+E(EEEEEr$rJceZdZUeddZeeed<eddZeded<eddZ ee ed<dS) ErrorResponseN"Time spent to process this requestr8timerErrorResponseStatusrresult) rr r!rrOr r>r"rrQrr#r$r%rMrMs~!E$<`aaaD(5/aaa.3eDb.Q.Q.QFH* +QQQ!E$B???FHSM?????r$rMc@eZdZUeddZeeed<dS)rPNz"Description of the occurred error.r8error)rr r!rrSr rCr"r#r$r%rPrPs6 5;_```E8C=`````r$rPc4eZdZUeddZded<dS)ExpDecayExpression.rrr exp_decayN)rr r!rrVr"r#r$r%rUrU2).s)C)C)CI&CCCCCr$rUc4eZdZUeddZded<dS) ExpExpression.rrr3expN)rr r!rrZr"r#r$r%rYrYr5r$rYceZdZUeddZeded<eddZeed <edd Z ee ed <edd Z ed ed<eddZ ee ed<dS) FacetRequestNrr8rzr{.z Payload key to use for faceting.rr.z,Max number of hits to return. Default is 10.limitzGFilter conditions - only consider points that satisfy these conditions.r}r~zaWhether to do a more expensive exact count for each of the values in the facet. Default is false.r)rr r!rr{r r"r.rCr]r-r~rr=r#r$r%r\r\s.3eDb.Q.Q.QIx*+QQQuS&HIIICIII 5;ijjjE8C=jjj!&"k"""FHX "EwE8D>r$r\c@eZdZUeddZeded<dS) FacetResponse.rr FacetValueHithitsN)rr r!rrarr"r#r$r%r_r_s6"'%"<"<".3Uq...HTN-2Ev---8D>',en'''OXd^-2EB---8D>r$rJcXeZdZUeddZded<eddZeed<dS) FeedbackItem.rrrpexamplescoreN)rr r!rrpr"rqr>r#r$r%rorosP"U3B777G]7775"---E5-----r$roceZdZUdZeddZeed<eddZe d ed <edd Z e d ed <eddZ e ded<eddZ e ded<eddZ e ded<eddZe ded<eddZe eed<eddZe eed<dS)FieldConditionz3 All possible payload filtering conditions .z Payload keyrr.Nz+Check if point has field with a given valuer8Matchmatchz+Check if points value lies in a given rangeRangeInterfacerangez0Check if points geolocation lies in a given areaGeoBoundingBoxgeo_bounding_boxz+Check if geo point is within a given radius GeoRadius geo_radiusz,Check if geo point is within a given polygon GeoPolygon geo_polygonz#Check number of values of the field ValuesCount values_countzNCheck that the field is empty, alternative syntax for `is_empty: 'field_name'`is_emptyzLCheck that the field is null, alternative syntax for `is_null: 'field_name'`is_null)rr r!r<rr.rCr"rur rwryr{r}rrr=rr#r$r%rsrssuSm444C444$uT?lmmmE8G mmm(-dHu(v(v(vE8$ %vvv385"T444h/0).dHu(v(v(vJ%vvv*/%"P+++K,'-2E$Lq,r,r,rL(=)rrr$u"r   Hhtn$e"pGXd^r$rsc$eZdZUeddZeeeddfed<eddZ eded<edd Z eeeddfed <edd Z eeeddfed <dS) r}Nz-At least one of those conditions should matchr8 Conditionshouldz8At least minimum amount of given conditions should match MinShould min_shouldzAll conditions must matchmustzAll conditions must NOT matchmust_not) rr r!rrr r rr"rrrr#r$r%r}r}s>Ce"Q???FHU4 ,k9: ;)."\)))J%=BE$\wN)rr r!FLOATr#r$r%rrs EEEr$rcteZdZUeddZded<eidZeee e fed<dS) FormulaQuery.rrr3formular8defaultsN) rr r!rrr"rr rrCrr#r$r%rrs]!E#2666G\666).rr)J)J)JHhtCH~&JJJJJr$rc&eZdZdZdefdZdZdZdS)Fusionz Fusion algorithm allows to combine results of multiple prefetches. Available fusion algorithms: * `rrf` - Reciprocal Rank Fusion (with default parameters) * `dbsf` - Distribution-Based Score Fusion r&c*t|jSr(r)r+s r%r-zFusion.__str__'r.r$rrfdbsfN)rr r!r<rCr-RRFDBSFr#r$r%rr"s? C DDDr$rc4eZdZUeddZded<dS) FusionQuery.rrrfusionN)rr r!rrr"r#r$r%rr.1uSb111FH11111r$rc4eZdZUeddZded<dS)GaussDecayExpression.rrr gauss_decayN)rr r!rrr"r#r$r%rr2s2+05"+E+E+EK(EEEEEr$rc\eZdZUdZeddZded<eddZded<dS) rxz 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!r<rrr"rr#r$r%rxrx6s!5 PHj %u P   L*r$rxc4eZdZUeddZded<dS) GeoDistance.rrGeoDistanceParams geo_distanceN)rr r!rrr"r#r$r%rrEs2(-cr(B(B(BL%BBBBBr$rcXeZdZUeddZded<eddZeed<dS) r.rrroriginz,Payload field with the destination geo pointtoN)rr r!rrr"rrCr#r$r%rrIsQs333FJ333eC%STTTBTTTTTr$rceZdZUeddZded<eddZeeed <edd Z ed ed <edd Z eeed<dS)GeoIndexParams.rr GeoIndexTyperNrr8rrrvrwrrrr#r$r%rrNs 5"555D.555#e"wGXd^"'f"""FHX #(%W###K$r$rceZdZdZdS)rgeoN)rr r!GEOr#r$r%rr]s CCCr$rcDeZdZUdZeddZeded<dS) GeoLineStringz= Ordered sequence of GeoPoints representing the line .z3Ordered sequence of GeoPoints representing the linerrrN)rr r!r<rrrr"r#r$r%rrasC %uS6klllFD lllllr$rc\eZdZUdZeddZeed<eddZeed<dS)rz" Geo point payload schema .zGeo point payload schemarlonlatN) rr r!r<rrr>r"rr#r$r%rris^s(BCCCCCCCs(BCCCCCCCCCr$rcteZdZUdZeddZded<edd Zee ded <dS) 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`rrexteriorNzInterior 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.r8 interiors) rr r!r<rrr"rr rr#r$r%r|r|rs!& w!!!Ho27{222Ix_-.r$r|c\eZdZUdZeddZded<eddZeed<d S) rzzt 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`rrcenterzRadius of the area in metersradiusN) rr r!r<rrr"rr>r#r$r%rzrzsp AFJE#+IJJJFEJJJJJr$rzc4eZdZUeddZeed<dS)GpuDeviceTelemetry.rrrFNrr#r$r%rrrr$rc@eZdZUeddZeded<dS) GroupsResult.rr PointGroupgroupsN)rr r!rrrr"r#r$r%rrs6!&s!;!;!;FD ;;;;;r$rceZdZUeddZeeeedffed<eddZe eeeeeedfffed<dS) GrpcTelemetry.rrOperationDurationStatistics responsesNr8per_collection_responses rr r!rrrrCr"rr r#r$r%rrEJU3\^E_E_E_ItCc#@@AAB___inin"jjjhtCc4Eb@b;c6c1d,d'efr$rcDeZdZUeddZeedfed<dS)HardwareTelemetry.rr HardwareUsagecollection_dataN)rr r!rrrrCr"r#r$r%rrs;27%2L2L2LOT#./LLLLLr$rceZdZUdZeddZeed<eddZeed<eddZ eed<eddZ eed<eddZ eed <eddZ eed <eddZ eed <d S) rG 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!r<rrr-r"rrrrrrr#r$r%rrsuS&efffCfff 52qrrrOSrrr!E#3rssscsss!&s8w!x!x!x3xxx"'% X###C %1pqqqNCqqq 52qrrrOSrrrrrr$rcDeZdZUdZeddZeded<dS)HasIdConditionz& ID-based filtering condition .zID-based filtering conditionrrghas_idN)rr r!r<rrrr"r#r$r%rrsD',eC=[&\&\&\FD" #\\\\\r$rc8eZdZUdZeddZeed<dS)HasVectorConditionz; Filter points which have specific vector assigned .z1Filter points which have specific vector assignedr has_vectorN)rr r!r<rrrCr"r#r$r%rrs>eC-`aaaJaaaaar$rcpeZdZUdZeddZeed<eddZeed<eddZ eed <ed d Z e eed <edd Z e e ed<edd Ze ded<edd Ze eed<edd Ze e ed<dS)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_constructMinimal size threshold (in KiloBytes) below which full-scan is preferred over HNSW search. This measures the total size of vectors being queried against. When the maximum estimated amount of points that a condition satisfies is smaller than `full_scan_threshold_kb`, the query planner will use full-scan search instead of HNSW index traversal for better performance. 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.r8max_indexing_threadsNzxDeprecated: use `memory` instead. Store HNSW index on disk. If set to false, index will be stored in RAM. Default: falserMemory placement of the HNSW graph. Overrides the deprecated `on_disk` flag if both are set. Default: `cached` (`cold` if `on_disk` is set to true).rvrwzZCustom M param for hnsw graph built for payload index. If not set, default M will be used. payload_mStore copies of original and quantized vectors within the HNSW index file. Default: false. Enabling this option will trade the search speed for disk usage by reducing amount of random seeks during the search. Requires quantized vectors to be enabled. Multi-vectors are not supported.inline_storage)rr r!r<rrr-r"rrrr rr=rwrrr#r$r%rrsU EAs bL# %u f   +0%M+++(3-$eOGXd^"'k"""FHX  %up   Ix}&+Ur&&&NHTNr$rceZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z eeed <edd Z ee ed <edd Z eded<eddZeeed<eddZee ed<dS)rNrr8rzNumber of neighbours to consider during the index building. Larger the value - more accurate the search, more time required to build the index.rrrzNumber 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.rz|Deprecated: use `memory` instead. Store HNSW index on disk. If set to false, the index will be stored in RAM. Default: falserrrvrwz[Custom M param for additional payload-aware HNSW links. If not set, default M will be used.rrr)rr r!rrr r-r"rrrrr=rwrrr#r$r%rrsuEAx}#(%f###L(3-*/f***#+0%E+++(3-$eSGXd^"'k"""FHX  %uq   Ix}&+Ur&&&NHTNr$rc@eZdZUeddZeeed<dS)rNg333333?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`.r8healing_thresholdN)rr r!rrr r>r"r#r$r%rNrN sK).]***xr$rNc8eZdZUdZeddZded<dS)IdfCorpusParamszK IDF statistics computed over the points matching a corpus filter. .zAIDF statistics computed over the points matching a corpus filter.rr}corpusN)rr r!r<rrr"r#r$r%rrs>uS.qrrrFHrrrrrr$rc"eZdZdZdefdZdZdS)IdfScopez2 Named IDF scope without a corpus filter. r&c*t|jSr(r)r+s r%r-zIdfScope.__str__r.r$globalN)rr r!r<rCr-GLOBALr#r$r%rr:FFFr$rceZdZUdZeddZeed<eddZe ed<edd Z e e e efed <dS) Imagez~ WARN: Work-in-progress, unimplemented Image object for embedding. Requires inference infrastructure, unimplemented. .z*Image data: base64 encoded image or an URLrimager?r@NDParameters for the model Values of the parameters are model-specificr8rB) rr r!r<rrrr"r@rCrBr rr#r$r%rr$ss(TUUUE3UUU tE3)."h)))GXd38n %r$rcheZdZUdZeddZeded<eddZe ed<dS) 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)plainrrBN) rr r!r<rrr r"rBrr#r$r%rr3s$e bD'( 5 bGSr$rcheZdZUdZeddZeded<eddZded<d S) 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)hnswrrrBN) rr r!r<rrr r"rBr#r$r%rrBs#U CD'' "E CG\r$rceZdZUdZeddZeed<eddZe ed<edd Z e e e efed <dS) InferenceObjectz WARN: Work-in-progress, unimplemented Custom object for embedding. Requires inference infrastructure, unimplemented. .zxArbitrary data, used as input for the embedding model. Used if the model requires more than one input or a custom input.robjectr?r@Nrr8rB) rr r!r<rrrr"r@rCrBr rr#r$r%rrQs% OFC tE3)."h)))GXd38n %r$rcDeZdZUeddZeedfed<dS)InferenceUsage.rr ModelUsagemodelsN)rr r!rrrrCr"r#r$r%rrcs;&+eCR&@&@&@FDl" #@@@@@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse200Nrr8UsageusagerNrOrShardKeysResponserQ rr r!rr r r"rOr>rrCrQr#r$r%rrgs$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???,1E$B,O,O,OFH( )OOOOOr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee ed <dS) InlineResponse2001Nrr8r r rNrOrrQ) rr r!rr r r"rOr>rrCrQr=r#r$r%rrns$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???"U4R@@@FHTN@@@@@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20010Nrr8r r rNrOrrrQr r#r$r%rru$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???05dPR0S0S0SFH, -SSSSSr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20011Nrr8r r rNrOrOptimizationsResponserQr r#r$r%rr|rr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20012Nrr8r r rNrOrrHrQr r#r$r%rrs$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???5:U4UW5X5X5XFH1 2XXXXXr$rceZdZUeddZeeed<eddZee ed<eddZ ee ed<dS)InlineResponse20013NrNr8rOrrrQ) rr r!rrOr r>r"rrCrQr=r#r$r%rrs|!E$<`aaaD(5/aaa!E$B???FHSM???"U4R@@@FHTN@@@@@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <dS) InlineResponse20014Nrr8r r rNrOrSnapshotDescriptionrQ rr r!rr r r"rOr>rrCrQrr#r$r%rrs$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???49E$TV4W4W4WFHT/0 1WWWWWr$rceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20015NrNr8rOrrrrQ) rr r!rrOr r>r"rrCrQr#r$r%rrs~!E$<`aaaD(5/aaa!E$B???FHSM???.3eDb.Q.Q.QFH* +QQQQQr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20016Nrr8r r rNrOrRecordrQr r#r$r%r r s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???!&t!D!D!DFHX DDDDDr$r ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <dS) InlineResponse20017Nrr8r r rNrOrr!rQrr#r$r%r#r#s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???',uTr'J'J'JFHT(^ $JJJJJr$r#ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <dS) InlineResponse20018Nrr8r r rNrOr UpdateResultrQrr#r$r%r%r%s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???-2U4R-P-P-PFHT.) *PPPPPr$r%ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20019Nrr8r r rNrOr ScrollResultrQr r#r$r%r(r($uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???',uTr'J'J'JFH^ $JJJJJr$r(ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2002Nrr8r r rNrOr TelemetryDatarQr r#r$r%r,r,$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???(-d(K(K(KFH_ %KKKKKr$r,ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20020Nrr8r r rNrOrrrQr r#r$r%r0r0$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???&+eDb&I&I&IFH] #IIIIIr$r0ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20021Nrr8r r rNrOrr_rQr r#r$r%r3r3r.r$r3ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20022Nrr8r r rNrOr QueryResponserQr r#r$r%r5r5r.r$r5ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <dS) InlineResponse20023Nrr8r r rNrOrr6rQrr#r$r%r8r8s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???.3eDb.Q.Q.QFHT/* +QQQQQr$r8ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20024Nrr8r r rNrOrrrQr r#r$r%r:r:r*r$r:ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20025Nrr8r r rNrOrSearchMatrixPairsResponserQr r#r$r%r<r<s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???49E$TV4W4W4WFH0 1WWWWWr$r<ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse20026Nrr8r r rNrOrSearchMatrixOffsetsResponserQr r#r$r%r?r?s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???6;eDVX6Y6Y6YFH2 3YYYYYr$r?ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2003Nrr8r r rNrOr ClusterStatusrQr r#r$r%rBrBr.r$rBceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2004Nrr8r r rNrOrr1rQr r#r$r%rErEs$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???385SU3V3V3VFH/ 0VVVVVr$rEceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2005Nrr8r r rNrOr QuotaStatusrQr r#r$r%rGrGr1r$rGceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2006Nrr8r r rNrOrrKrQr r#r$r%rJrJ$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???.3eDb.Q.Q.QFH* +QQQQQr$rJceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2007Nrr8r r rNrOrrrQr r#r$r%rMrM s$uTrBBBE8G BBB!E$<`aaaD(5/aaa!E$B???FHSM???).t)L)L)LFH% &LLLLLr$rMceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2008Nrr8r r rNrOrr&rQr r#r$r%rOrOr*r$rOceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <dS) InlineResponse2009Nrr8r r rNrOrrrQr r#r$r%rQrQrKr$rQcpeZdZUeddZeeed<eddZee ed<dS)InlineResponse202NrNr8rOrr) rr r!rrOr r>r"rrCr#r$r%rSrS"sY!E$<`aaaD(5/aaa!E$B???FHSM?????r$rScTeZdZUeddZded<eddZeeed <edd Z eeed <edd Z eeed <eddZ eeed<eddZ eded<eddZ eeed<dS)IntegerIndexParams.rrIntegerIndexTyperNz2If true - support direct lookups. Default is true.r8lookupz2If true - support ranges filters. Default is true.rwzIf 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.rrrrrvrwrr)rr r!rrr"rWr r=rwrrrwrr#r$r%rUrU'sR$uSb999D 999"U4=qrrrFHTNrrr!E$qqq#(5|$$$L(4.$e"wGXd^"'f"""FHX #(%W###K$r$rUceZdZdZdS)rVintegerN)rr r!INTEGERr#r$r%rVrV<GGGr$rVc&eZdZdZdefdZdZdZdS) IoBackenda\ Universal I/O backend that is used to read files. Decided when the component is opened based on `storage.performance.io_uring` option, component memory placement and kernel io_uring support. Options: * `Mmap` - Reads are served by the page cache through a memory mapping. * `IoUring` - Reads are submitted to the kernel with io_uring. r&c*t|jSr(r)r+s r%r-zIoBackend.__str__Er.r$mmapio_uringN)rr r!r<rCr-MMAPIO_URINGr#r$r%r]r]@s? DHHHr$r]c8eZdZUdZeddZded<dS)IsEmptyConditionz@ Select points with empty payload for a specified field .z6Select points with empty payload for a specified fieldr PayloadFieldrN)rr r!r<rrr"r#r$r%rdrdLs> %uS6noooHnooooor$rdc8eZdZUdZeddZded<dS)IsNullConditionz? Select points with null payload for a specified field .z5Select points with null payload for a specified fieldrrerN)rr r!r<rrr"r#r$r%rgrgTs>$eC5lmmmG^mmmmmr$rgc$eZdZUeddZded<eddZeeed <edd Z eeed <edd Z ed ed<eddZ eeed<eddZ eeed<dS)KeywordIndexParams.rrKeywordIndexTyperNz7If true - used for tenant optimization. Default: false.r8 is_tenantrrrrvrwrrz[If true, enable prefix matching (`match: { 'prefix': ... }`) on this field. Default: false.prefix) rr r!rrr"rkr r=rrwrrlr#r$r%riri\s:$uSb999D 999 %"[!!!Ix~$e"wGXd^"'f"""FHX #(%W###K$#UqFHTNr$riceZdZdZdS)rjkeywordN)rr r!KEYWORDr#r$r%rjrjrr[r$rjceZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZ dS) Languagearabic azerbaijanibasquebengalicatalanchinesedanishdutchenglishfinnishfrenchgermangreekhebrewhinglish hungarian indonesianitalianjapanesekazakhnepali norwegian portugueseromanianrussianslovenespanishswedishtajikturkishN)!rr r!ARABIC AZERBAIJANIBASQUEBENGALICATALANCHINESEDANISHDUTCHENGLISHFINNISHFRENCHGERMANGREEKHEBREWHINGLISH HUNGARIAN INDONESIANITALIANJAPANESEKAZAKHNEPALI NORWEGIAN PORTUGUESEROMANIANRUSSIANSLOVENESPANISHSWEDISHTAJIKTURKISHr#r$r%rqrqvs FK FGGG F EGG F F E FHIJGH F FIJHGGGG EGGGr$rqc4eZdZUeddZded<dS)LinDecayExpression.rrr lin_decayN)rr r!rrr"r#r$r%rrrWr$rc4eZdZUeddZded<dS) LnExpression.rrr3lnN)rr r!rrr"r#r$r%rrs1uSb111B 11111r$rceZdZUeddZeed<eddZeded <edd Z eed <edd Z d ed<dS)r.zLocal shard idrr*NUser-defined sharding keyr8rr{zNumber of points in the shardrrrr") rr r!rr*r-r"r{r rr"r#r$r%rrsE#+;<<66666r$rceZdZUeddZeeed<eddZeded<edd Z e ed <edd Z ee ed <edd Z ee ed<eddZ ee ed<eddZee ed<eddZeeee fed<eddZeeded<eddZeded<eddZeeed<eddZeeee fed<eddZeded<dS)LocalShardTelemetryNrr8 variant_namer#r.z6Total number of optimized points since the last start.rr$yAn ESTIMATION of effective amount of bytes used for vectors Do NOT rely on this number unless you know what you are doingr%z~An estimation of the effective amount of bytes used for payloads Do NOT rely on this number unless you know what you are doingr&zqSum of segment points This is an approximate number Do NOT rely on this number unless you know what you are doingr'zSum of number of vectors in all segments This is an approximate number Do NOT rely on this number unless you know what you are doingr(zSum of number of vectors across all segments, grouped by their name. This is an approximate number. Do NOT rely on this number unless you know what you are doingr)SegmentTelemetrysegmentsOptimizerTelemetry optimizations async_scorerindexed_only_excluded_vectorszUpdate queue statusShardUpdateQueueInfor )rr r!rrr rCr"rr$r-r%r&r'r(r)rrrrrr=rr r#r$r%rrs\"'%""E"E"EL(3-EEE&+eDb&I&I&IFH] #III"'%9q"r"r"rCrrr(-P))) */U***#!&H!!!J "'["""K#5:Ex555$sCx.1495SU3V3V3VHht./0VVV49E$TV4W4W4WM801WWW#(52#F#F#FL(4.FFF>CeD^`>a>a>a!8DcN#;aaa5:U4Uj5k5k5kL(12kkkkkr$rc4eZdZUeddZded<dS)Log10Expression.rrr3log10N)rr r!rrr"r#r$r%rrs1%444E<44444r$rceZdZUdZeddZeed<eddZe eed <edd Z e d ed <dS) LookupLocationzj Defines a location to use for looking up the vector. Specifies collection and vector field name. .z&Name of the collection used for lookupr collectionNzpOptional name of the vector field within the collection. If not provided, the default vector field will be used.r8rryrzr{) rr r!r<rrrCr"rr r{r#r$r%rrseC-UVVVJVVV!EGFHSM/4ek///Ix*+r$rc"eZdZdZdefdZdZdS)LowMemoryModeOneOfzB No special handling. Every component loads as persisted. r&c*t|jSr(r)r+s r%r-zLowMemoryModeOneOf.__str__r.r$rN)rr r!r<rCr-rr#r$r%rrs:HHHr$rc"eZdZdZdefdZdZdS)LowMemoryModeOneOf1a Load RAM-friendly components as their on-disk variants where possible: * Quantization is loaded as if `always_ram = false`. * Payload field indexes are loaded as if `on_disk = true`. * Payload storage is loaded as the mmap variant (lazy populate). r&c*t|jSr(r)r+s r%r-zLowMemoryModeOneOf1.__str__r.r$ no_residentN)rr r!r<rCr- NO_RESIDENTr#r$r%rr: KKKr$rc"eZdZdZdefdZdZdS)LowMemoryModeOneOf2z Same as [`LowMemoryMode::NoResident`], plus mmap page population is skipped on load (for original vectors, HNSW graph and payload storage). r&c*t|jSr(r)r+s r%r-zLowMemoryModeOneOf2.__str__r.r$ no_populateN)rr r!r<rCr- NO_POPULATEr#r$r%rrrr$rc8eZdZUdZeddZded<dS)MatchAnyz0 Exact match on any of the given values .z&Exact match on any of the given valuesr AnyVariantsanyN)rr r!r<rrr"r#r$r%rrs>s0XYYYCYYYYYr$rc:eZdZUdZedddZded<dS) 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 valuesexceptraliasrexcept_N)rr r!r<rrr"r#r$r%rrsR#U [ckG]r$rc8eZdZUdZeddZeed<dS) MatchPhrasez/ Full-text phrase match of the string. .z%Full-text phrase match of the string.rphraseN)rr r!r<rrrCr"r#r$r%rr s>%)PQQQFCQQQQQr$rc8eZdZUdZeddZeed<dS) MatchPrefixz Match keyword values that start with the given string. Byte-wise (hence, for valid UTF-8, character-wise) and case-sensitive, consistent with exact keyword matching. Served efficiently by a keyword index created with the `prefix` option. .zMatch keyword values that start with the given string. Byte-wise (hence, for valid UTF-8, character-wise) and case-sensitive, consistent with exact keyword matching. Served efficiently by a keyword index created with the `prefix` option.rrlN)rr r!r<rrlrCr"r#r$r%rrsR% EFCr$rc8eZdZUdZeddZeed<dS) MatchTextz) Full-text match of the strings. .zFull-text match of the strings.rr>N)rr r!r<rr>rCr"r#r$r%rrs>c'HIIID#IIIIIr$rc8eZdZUdZeddZeed<dS) MatchTextAnyz> Full-text match of at least one token of the string. .z4Full-text match of at least one token of the string.rtext_anyN)rr r!r<rrrCr"r#r$r%rr's>E#+abbbHcbbbbbr$rc8eZdZUdZeddZded<dS) MatchValuez( Exact match of the given value .zExact match of the given valuer ValueVariantsr*N)rr r!r<rr*r"r#r$r%rr/s>#U34TUUUE?UUUUUr$rceZdZdZdS)MaxOptimizationThreadsSettingautoN)rr r!AUTOr#r$r%rr7rr$rc*eZdZdZdefdZdZdZdZdS)rva Memory placement of a component's data. Data is always persisted on disk regardless of this setting; it only controls how the data is held in RAM. Options: * `Cold` - Data is not pre-loaded from disk to RAM. Preferred for rarely queried components or components larger than RAM size. First request might be slow, but data is cached with usage. * `Cached` - Data is pre-loaded into disk-cache RAM on start. First request is fast, but data may be evicted if there is not enough memory and some other component's data is used more frequently. * `Pinned` - Data is loaded in RAM and never evicted. First request is fast, but the component must fit in RAM at all times. Recommended for frequently queried small components like quantized vectors or primary indexes. r&c*t|jSr(r)r+s r%r-zMemory.__str__@r.r$coldcachedpinnedN) rr r!r<rCr-COLDCACHEDPINNEDr#r$r%rvrv;D D F FFFr$rvceZdZUeddZeed<eddZeed<eddZeed<edd Z eed <edd Z eed <d S)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!rrr-r"rrrrr#r$r%rrHsc/stttL#ttt 52fgggOSggg%1^___NC___%1stttNCttt%1cdddNCdddddr$rceZdZUdZeddZeed<eddZe e ed<edd Z e e e efed <dS) rz5 Message send failures for a particular peer .z+Message send failures for a particular peerrrNr8 latest_errorzTimestamp of the latest errorlatest_error_timestamp)rr r!r<rrr-r"rr rCrr rrr#r$r%rrPss(UVVVE3VVV"'%Bo"p"p"pL(3-ppp>Ce"A???HU8T>%:;r$rcdeZdZUeddZeded<eddZeed<dS)r.rrr conditions min_countN) rr r!rrrr"rr-r#r$r%rr\sU$)E#2$>$>$>J[!>>>U3B///Is/////r$rcteZdZUdZeddZeeed<eddZ ee ed<dS)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.r8 diversityzjThe maximum number of candidates to consider for re-ranking. If not specified, the `limit` value is used.candidates_limit) rr r!r<rrr r>r"r r-r#r$r%rras"'x"""Ix',eA'''hsmr$rc4eZdZUeddZeed<dS)r.rrtokensN)rr r!rr r-r"r#r$r%rrp1%,,,FC,,,,,r$rc&eZdZdZdefdZdZdZdS)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 r&c*t|jSr(r)r+s r%r-zModifier.__str__yr.r$noneidfN)rr r!r<rCr-NONEIDFr#r$r%rrts? D CCCr$rceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <dS) MoveShard.rrr*r+r,N:Method for transferring the shard from one node to anotherr8ShardTransferMethodmethod rr r!rr*r-r"r+r,rr r#r$r%rrE#2...Hc...eCR000J000cr222L#222.3e"^///FH* +r$rc4eZdZUeddZded<dS)MoveShardOperation.rrr move_shardN)rr r!rrr"r#r$r%rrs1#eCR888J 88888r$rc@eZdZUeddZeded<dS)MultExpression.rrr3multN)rr r!rr rr"r#r$r%rrs6$uSb999D$| 99999r$rceZdZdZdS)MultiVectorComparatormax_simN)rr r!MAX_SIMr#r$r%r"r"r[r$r"c4eZdZUeddZded<dS)r.rrr" comparatorN)rr r!rr&r"r#r$r%rrs2*/%*D*D*DJ'DDDDDr$rc4eZdZUeddZded<dS)NaiveFeedbackStrategy.rrNaiveFeedbackStrategyParamsnaiveN)rr r!rr*r"r#r$r%r(r(s2+05"+E+E+EE (EEEEEr$r(c|eZdZUeddZeed<eddZeed<eddZeed<dS)r).rrarcN) rr r!rr,r>r"rr-r#r$r%r)r)souSb)))Au)))uSb)))Au)))uSb)))Au)))))r$r)cdeZdZUeddZded<eddZed ed <dS) NearestQuery.rrrpnearestNz|Perform MMR (Maximal Marginal Relevance) reranking after search, using the same vector in this query to calculate relevance.r8rmmr)rr r!rr0r"r1r r#r$r%r/r/si"U3B777G]777 5SC%r$r/c4eZdZUeddZded<dS) NegExpression.rrr3negN)rr r!rr4r"r#r$r%r3r3r5r$r3c\eZdZUdZeddZeed<eddZded<dS) NestedzA Select points with payload for a specified nested field .z7Select points with payload for a specified nested fieldrr.r}r~N) rr r!r<rr.rCr"r~r#r$r%r6r6s^uS&_```C```uS.ghhhFHhhhhhr$r6c4eZdZUeddZded<dS)NestedCondition.rrr6nestedN)rr r!rr9r"r#r$r%r8r8rr$r8c"eZdZdZdefdZdZdS)rz= Tag selecting the explicit 'no stemming' algorithm. r&c*t|jSr(r)r+s r%r-zNoStemmer.__str__r.r$rN)rr r!r<rCr-rr#r$r%rr: DDDr$rcdeZdZUeddZeed<eddZeeed<eddZ ee ed <edd Z ee ed <edd Z ee ed <eddZ eeed<eddZeeeefed<dS)r.rrrNr8 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!rrr-r"r>r r?r>r@rArBrCr rrr#r$r%rrsRs+++E3+++ %d C C CJ CCC+05"s,,,%,15"g,,,%,15"g,,,%,15"Y,,,8C=723YYYYYr$rceZdZUeddZeed<eddZeed<eddZ ded <edd Z e d ed <eddZ d ed<dS) Optimization.zUnique identifier of the optimization process. After the optimization is complete, a new segment will be created with this UUID.rrz7Name of the optimizer that performed this optimization. optimizerr TrackerStatusrz|Segments being optimized. After the optimization is complete, these segments will be replaced by the new optimized segment.OptimizationSegmentInfor ProgressTreeprogressN) rr r!rrr r"rFrCrrrrJr#r$r%rErEs XD$U3,efffIsfff#eCR888FO88805 S111Hd,- %uSb999Hn99999r$rEcXeZdZUeddZeed<eddZeed<dS)rH.z!Unique identifier of the segment.rrz,Number of non-deleted points in the segment.rN) rr r!rrr r"rr-r#r$r%rHrHsRs(KLLLD$LLLc/]^^^L#^^^^^r$rHceZdZUdZeddZded<eddZeded <ed d Z e ed ed<ed d Z e eded<ed d Z e eded<d S)rz3 Optimizations progress for the collection .z)Optimizations progress for the collectionrOptimizationsSummarysummaryz Currently running optimizations.rErunningNzEAn estimated queue of pending optimizations. Requires `?with=queued`.r8PendingOptimizationqueuedzUCompleted optimizations. Requires `?with=completed`. Limited by `?completed_limit=N`. completedzNSegments that don't require optimization. Requires `?with=idle_segments`.rH idle_segments) rr r!r<rrNr"rOrrQr rRrSr#r$r%rrs',eC=h&i&i&iG #iii$)E#;]$^$^$^GT. !^^^49E"i555FHT/0 116k111Ix^,-@Eu"r@@@M8D!:;<r$rceZdZUeddZeed<eddZeed<eddZeed<edd Z eed <d S) rM.zNumber of pending optimizations in the queue. Each optimization will take one or more unoptimized segments and produce one optimized segment.rqueued_optimizationsz,Number of unoptimized segments in the queue.queued_segmentsz6Number of points in unoptimized segments in the queue. queued_pointsz8Number of segments that don't require optimization.rSN) rr r!rrUr-r"rVrWrSr#r$r%rMrMs % d!!!#!52`aaaOSaaas0hiiiM3iiis0jkkkM3kkkkkr$rMceZdZUeddZded<eddZded<edd Zee d ed <dS) r.rrrrrrNr8TrackerTelemetrylog) rr r!rrr"rrZr rr#r$r%rr s|!&s!;!;!;F ;;;385"3M3M3MM0MMM.3eDb.Q.Q.QC$)* +QQQQQr$rceZdZUeddZeeed<eddZee ed<edd Z e ed <ed d Z ee ed<ed dZ ee ed<ed dZ ee ed<edd Ze ed<ed dZee ed<ed dZeeed<d S)rg?^The minimal fraction of deleted vectors in a segment, required to perform segment optimizationr8deleted_thresholdiTThe minimal number of vectors in a segment, required to perform segment optimizationvacuum_min_vector_number.aTarget 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.rdefault_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.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_threadsIf enabled, the service will try to prevent the creation of large unoptimized segments. When enabled, new points written to segments larger than the indexing threshold are stored as 'deferred points': they are persisted in the WAL and segments, but excluded from read/search results until the corresponding segments are optimized (e.g. indexed, quantized, or moved to mmap storage). Update requests with `wait=true` will only return after the deferred points become visible, which may significantly increase the perceived latency between submitting an update and its completion. Update requests with `wait=false` are not affected. Default is disabled.prevent_unoptimizedrr r!rr]r r>r"r_r-r`rarbrcrerfrhr=r#r$r%rrs).t***x/4e"x///hsm#(% G###C',eE'''hsm',eS'''hsm).X))) $eC5_``````.3e///hsm+0%b +++$r$rceZdZUeddZeeed<eddZee ed<eddZ ee ed<edd Z ee ed <edd Z ee ed <edd Z ee ed<eddZee ed<eddZeded<eddZeeed<dS)rNr\r8r]r^r_aTarget 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 CPUsr`aeDo 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 256raaeMaximum 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.0rbaDMaximum 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.rcrdrea4Max 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.MaxOptimizationThreadsrfrgrhrir#r$r%rr2s).t***x/4e"x///hsm-2EE---HSM',e|'''hsm',e|'''hsm).[))) ).dHr(s(s(s sssCH5KDDDh'?@+0%b +++$r$rc"eZdZdZdefdZdZdS)OptimizersStatusOneOfz. Optimizers are reporting as expected r&c*t|jSr(r)r+s r%r-zOptimizersStatusOneOf.__str__Zr.r$okN)rr r!r<rCr-OKr#r$r%rmrmUs: BBBr$rmc8eZdZUdZeddZeed<dS)OptimizersStatusOneOf1z2 Something wrong happened with optimizers .z(Something wrong happened with optimizersrrSN)rr r!r<rrSrCr"r#r$r%rrrr`s>s(RSSSE3SSSSSr$rrceZdZUeddZeed<eddZeded <edd Z ed ed <dS) OrderBy.zPayload key to order byrr.Nz=Direction of ordering: `asc` or `desc`. Default is ascending.r8r directionzmWhich payload value to start scrolling from. Default is the lowest value for `asc` and the highest for `desc` StartFrom start_from) rr r!rr.rCr"rur rwr#r$r%rtrthsuS&?@@@C@@@',u"a(((Ix $).D)))J%r$rtc4eZdZUeddZded<dS) OrderByQuery.rrOrderByInterfaceorder_byN)rr r!rr{r"r#r$r%ryryss2#(5"#=#=#=H =====r$ryc4eZdZUeddZded<dS)OverwritePayloadOperation.rr SetPayloadoverwrite_payloadN)rr r!rrr"r#r$r%r}r}ws2&+eCR&@&@&@|@@@@@r$r}c4eZdZUeddZeed<dS)r.rrconnection_pool_sizeN)rr r!rrr-r"r#r$r%rr{s2 %cr : : :#:::::r$rc|eZdZUeddZeed<eddZeed<eddZ eed<dS)r+.rr ongoing_create_snapshot_requests is_recoveringrecovery_timestampN) rr r!rrr-r"rr=rr#r$r%r+r+sq,1E#2,F,F,F$cFFF%444M4444#eCR88888888r$r+c8eZdZUdZeddZeed<dS)rez Payload field .zPayload field namerr.N)rr r!r<rr.rCr"r#r$r%reres>uS&:;;;C;;;;;r$receZdZUdZeddZded<eddZed ed <edd Z e ed <dS) rz< Display payload field type & index information .z2Display payload field type & index informationrPayloadSchemaType data_typeNr8PayloadSchemaParamsrz(Number of points indexed with this indexr) rr r!r<rrr"rr rr-r#r$r%rrs&+U3eZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d S) rz- All possible names of payload types r&c*t|jSr(r)r+s r%r-zPayloadSchemaType.__str__r.r$rnrYr>rr>r=rrN)rr r!r<rCr-rorZrrTEXTrrr r#r$r%rrs]GG E C D DH DDDr$rc@eZdZUeddZeeed<dS)PayloadSelectorExclude.z*Exclude this fields from returning payloadrexcludeN)rr r!rrrrCr"r#r$r%rrs6s0\]]]GT#Y]]]]]r$rc@eZdZUeddZeeed<dS)PayloadSelectorInclude.zOnly include this payload keysrincludeN)rr r!rrrrCr"r#r$r%rrs6s0PQQQGT#YQQQQQr$rcDeZdZUdZeddZeded<dS)rz' Params of the payload storage NzMemory placement of the payload storage. Overrides the deprecated `on_disk_payload` flag if both are set. `pinned` is not supported for payload storage. Default: `cold` (`cached` if `on_disk_payload` is set to false).r8rvrw)rr r!r<rrwr r"r#r$r%rrsW"'p"""FHX r$rc@eZdZUeddZeded<dS)PayloadStorageTypeOneOf.rr)r_rNrr r!rrr r"r#r$r%rrsH cr""" ' #####r$rc@eZdZUeddZeded<dS)PayloadStorageTypeOneOf1.rr) in_ram_mmaprNrr#r$r%rrsH cr""" ' #####r$rc8eZdZUdZeddZeed<dS)rz. Information of a peer in the cluster .z$Information of a peer in the clusterrrN)rr r!r<rrrCr"r#r$r%rrs>uS&LMMMCMMMMMr$rc8eZdZUdZeddZeed<dS)rz< Metadata describing extra properties for each peer .zPeer Qdrant versionrrGN)rr r!r<rrGrCr"r#r$r%rrs>5*?@@@GS@@@@@r$rceZdZUdZeddZeed<eddZe e ed <edd Z e e ed <dS) PeerQuotaUsagez@ What one peer reports about the quota it is enforcing. .zWhether this peer is at or over one of the enforced limits, and so is currently refusing updates. Always false while the quota is disabled.rexceededNResident memory of this node's process, as a percentage of the memory available to it (cgroup limit if one applies, else total system memory).r8resident_memory_percentSUsed space of this node's storage filesystem, as a percentage of its capacity.disk_usage_percent) rr r!r<rrr=r"rr r-rr#r$r%rrsU bHd.3Uj...Xc])."w))) r$rcdeZdZUeddZeed<eddZeded<dS) rP.z7Name of the optimizer that scheduled this optimization.rrFz Segments that will be optimized.rHrN) rr r!rrFrCr"rrr#r$r%rPrPsXU3,efffIsfff05cGi0j0j0jHd,-jjjjjr$rPceZdZUeddZeded<eddZded<ed d Ze d ed <d S)r.z:Scored points that have the same value of the group_by keyr ScoredPointrarGroupIdr!Nz1Record that has been looked up using the group idr8r!rW) rr r!rrarr"r!rWr r#r$r%rrs{ %c7s t t tD$} tttE#2...B ...!&tAt!u!u!uFHX uuuuur$rcpeZdZUeddZeded<eddZeded <dS) PointIdsList.rrrgrNr8rzr{) rr r!rrrr"r{r r#r$r%rrs\&+eCR&@&@&@FD" #@@@.3eDb.Q.Q.QIx*+QQQQQr$rceZdZUeddZeded<eddZed ed <edd Z ed ed <eddZ eded<dS) PointRequestNryr8rzr{.zLook for points with idsrrgrhBSelect which payload to return with the response. Default is true.WithPayloadInterface with_payloadr WithVector with_vector) rr r!rr{r r"rhrrrr#r$r%rr s.3ek///Ix*+$)5:T#U#U#UC UUU5:U"f666L(12+0%"*M*M*MK,'MMMMMr$rceZdZUeddZded<eddZded<edd Zed ed <dS) PointStruct.rrrgr! VectorStructrNzPayload values (optional)r8rkr) rr r!rr!r"rrr r#r$r%rr sv!E#2666B666"U3B777FN777#(5C^#_#_#_GXi _____r$rcXeZdZUeddZded<eddZded<dS) PointVectors.rrrgr!rrN)rr r!rr!r"rr#r$r%rr sQ!E#2666B666"U3B777FN77777r$rceZdZUeddZded<eddZeded <edd Zed ed <edd Z eded<dS) PointsBatch.rrrfbatchNr8rzr{Filter to apply when updating existing points. Only points matching this filter will be updated. Points that don't match will keep their current state. New points will be inserted regardless of the filter.r} update_filterHMode of the upsert operation: insert_only, upsert (default), update_only UpdateMode update_mode) rr r!rrr"r{r rrr#r$r%rr sU3B///E7///.3eDb.Q.Q.QIx*+QQQ(-i)))M8H%+0%"l+++K,'r$rceZdZUeddZeded<eddZeded <edd Z ed ed <edd Z eded<dS) PointsList.rrrrNr8rzr{rr}rrrr) rr r!rrrr"r{r rrr#r$r%rr' s"'%"<"<"r]r-rr#r$r%rr< s>Ce~???HhuT*-z9:;).k)))E8$ %!5kE8C="'"w"""FHX (-uTGt'u'u'uFH^ $uuu',u"Y(((OXe_!5;klllE8C=lll.3eG///K*+r$rc4eZdZUeddZded<dS)ProductQuantization.rrProductQuantizationConfigproductN)rr r!rrr"r#r$r%rrW s2+05"+E+E+EG (EEEEEr$rceZdZUeddZded<eddZeeed <edd Z ed ed <dS) r.rrrT compressionNrsr8rtrurvrw) rr r!rrr"rtr r=rwr#r$r%rr[ s&+eCR&@&@&@K#@@@!&tAd!e!e!eJeee!&~"""FHX r$rceZdZUeddZeed<eddZee e e fed<edd Z ee e e fed <edd Z eeed <edd Zeeed<eddZeeed<eddZeeded<dS)rI.zName of the operation.rrFNzWhen the operation started.r8 started_atzWhen the operation finished. finished_atz8For finished operations, how long they took, in seconds. duration_secz1Number of completed units of work, if applicable.donez7Total number of units of work, if applicable and known.totalzChild operations.children)rr r!rrFrCr"rr r rrrrr>rr-rrrr#r$r%rIrId s3c'?@@@D#@@@27%Ro2p2p2pJx~./ppp385Sq3r3r3rK%$/0rrr$)E"\%%%L(5/ %:mnnnD(3-nnn 5;tuuuE8C=uuu/4uTOb/c/c/cHhtN+,cccccr$rIceZdZUdZeddZeeed<eddZ eeed<edd Z ee ed <dS) QuantizationSearchParams- Additional parameters of the search Fz9If true, quantized vectors are ignored. Default is false.r8ignoreNzIf 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.rescoreaXOversampling factor for quantization. Default is 1.0. Defines how many extra vectors should be preselected 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 preselected using quantized index, and then top-100 will be returned after re-scoring. oversampling) rr r!r<rrr r=r"rrr>r#r$r%rrp s#U#^FHTN$eXGXd^%*Eo%%%L(5/r$rceZdZUeddZeded<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)<dS)*QueryGroupsRequestNrr8rzr{jSub-requests to perform first. If present, the query will be performed on the results of the prefetch(es).rrrrrrrrr}r~rrrrrTOptions for specifying which vectors to include into the response. Default is false.rrIOptions for specifying which payload to include or not. Default is false.rrrrr.zPayload 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.r]z9Look for points in another collection using the group idsWithLookupInterface with_lookup)rr r!rr{r r"rr rrrrCr~rrr>rrrrrr-r]rr#r$r%rr s.3eDb.Q.Q.QIx*+QQQ>CeA???HhuT*-z9:;).k)))E8$ %!5kE8C="'"w"""FHX (-uTGt'u'u'uFH^ $uuu',u"Y(((OXe_+0%"x+++K,'6;U"m666L(12/4eG///K*+E GHc!&"_!!!J !5;opppE8C=ppp385"]444K/0r$rcleZdZUeddZeded<eddZeee ddfed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<eddZeeed<eddZeeed<eddZeeed<eddZeded<eddZeded<edd Zed!ed"<dS)# QueryRequestNrr8rzr{rrrrrrrrrr}r~rrrrrrr]z9Offset of the result. Skip this many points. Default is 0offsetrrrrrrrrr)rr r!rr{r r"rr rrrrCr~rrr>r]r-rrrrr#r$r%rr s\.3eDb.Q.Q.QIx*+QQQ>CeA???HhuT*-z9:;).k)))E8$ %!5kE8C="'"w"""FHX (-uTGt'u'u'uFH^ $uuu',u"Y(((OXe_!5;klllE8C=lll!E$"?????r$rc@eZdZUeddZeded<dS)r6.rrrrN)rr r!rrrr"r#r$r%r6r6 s6"'%"<"<"r"rrrr#r$r%rr@ s %:STTTBTTT%:STTTBTTT 5;VWWWC%WWW 5;VWWWC%WWWWWr$rc*eZdZdZdefdZdZdZdZdS)ReadConsistencyTypea * `majority` - send N/2+1 random request and return points, which present on all of them * `quorum` - send requests to all nodes and return points which present on majority of nodes * `all` - send requests to all nodes and return points which present on all nodes r&c*t|jSr(r)r+s r%r-zReadConsistencyType.__str__P r.r$majorityquorumreN) rr r!r<rCr-MAJORITYQUORUMALLr#r$r%rrK sDH F CCCr$rceZdZUeddZeeded<eddZeeded<eddZ ed ed <dS) RecommendInputNz9Look for vectors closest to the vectors from these pointsr8rprqz6Try to avoid vectors like the vector from these pointsrrz3How to use the provided vectors to find the resultsRecommendStrategystrategy) rr r!rrqr rr"rrrr#r$r%rrX s.3e"]///HhtM*+/4e"Z///HhtM*+/4e"W///Hh*+r$rc4eZdZUeddZded<dS)RecommendQuery.rrr recommendN)rr r!rrr"r#r$r%rrd s2"'%"<"<""???#(5"#=#=#=H =====r$r0c4eZdZUeddZded<dS)RelevanceFeedbackQuery.rrr0relevance_feedbackN)rr r!rr5r"r#r$r%r4r4 s3385"3M3M3M0MMMMMr$r4ceZdZUeddZeed<eddZeded <edd Z eed <edd Z d ed<dS)r.zRemote shard idrr*Nrr8rr{zRemote peer idrrrr") rr r!rr*r-r"r{r rr"r#r$r%rr sE#+<===Hc===&+eDFa&b&b&bIx #bbb5*:;;;GS;;;!E#2666E>66666r$rceZdZUeddZeed<eddZeed<eddZe ded <eddZ e ded <dS) RemoteShardTelemetry.rrr*rNr8rrupdates) rr r!rr*r-r"rrr r9r#r$r%r8r8 sE#2...Hc...5"---GS---8=dXZ8[8[8[Hh45[[[7rCr"r?r#r$r%r;r; s^ %1LMMMNCMMM%1LMMMNCMMMMMr$r;c8eZdZUdZeddZded<dS)RenameAliasOperationr<.r=rr; rename_aliasN)rr r!r<rrBr"r#r$r%rArA s>#(%9T"U"U"UL-UUUUUr$rAcXeZdZUeddZeed<eddZeed<dS)rE.rrr*rN)rr r!rr*r-r"rr#r$r%rErE sPE#2...Hc...5"---GS-----r$rEc(eZdZUeddZeed<eddZeded<eddZ ed ed <eddZ e d ed <eddZ e ed fed<eddZeded<dS)r<.rrr!Nr8rr.rlocalr8remoterreplicate_statesr+r,)rr r!rr!r-r"r.r rErFrrGrrCr,r#r$r%r<r< seCR(((B((( %d C C CC* CCC-2U4R-P-P-PE8) *PPP+05"+E+E+EFD' (EEE27%2L2L2Ld3./LLL=BU4]_=`=`=`h9:`````r$r<cJeZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdS)rz9 State of the single shard within a replica set. r&c*t|jSr(r)r+s r%r-zReplicaState.__str__ r.r$ActiveDeadPartial InitializingListenerPartialSnapshotRecovery ReshardingReshardingScaleDown ActiveReadManualRecoveryN)rr r!r<rCr-ACTIVEDEADPARTIAL INITIALIZINGLISTENERPARTIALSNAPSHOTRECOVERY RESHARDINGRESHARDINGSCALEDOWN ACTIVEREADMANUALRECOVERYr#r$r%rr smF DG!LH'OHJ/J%NNNr$rceZdZUeddZeded<eddZded <eddZded <dS) ReplicatePointsNrr8r}r~.rrfrom_shard_key to_shard_key) rr r!rr~r r"rbrcr#r$r%rara st!&t!D!D!DFHX DDD!&s!;!;!;NJ;;;$uSb999L*99999r$rac4eZdZUeddZded<dS)ReplicatePointsOperation.rrrareplicate_pointsN)rr r!rrfr"r#r$r%rere 3*/%*D*D*D'DDDDDr$receZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <dS) ReplicateShard.rrr*r+r,Nrr8rrrr#r$r%riri rr$ric4eZdZUeddZded<dS)ReplicateShardOperation.rrrireplicate_shardN)rr r!rrlr"r#r$r%rkrk s2(-cr(B(B(BO%BBBBBr$rkcXeZdZUeddZded<eddZded<dS) RequestsTelemetry.rrWebApiTelemetryrestrgrpcN)rr r!rrpr"rqr#r$r%rnrn sQ#eCR888D 888!E#2666D/66666r$rnc&eZdZdZdefdZdZdZdS)ReshardingDirectionz Resharding direction, scale up or down in number of shards - `up` - Scale up, add a new shard - `down` - Scale down, remove a shard r&c*t|jSr(r)r+s r%r-zReshardingDirection.__str__ r.r$updownN)rr r!r<rCr-UPDOWNr#r$r%rsrs s? B DDDr$rsceZdZUeddZded<eddZeed<eddZeed<edd Z e d ed <dS) r.rrrsrur*rNr8rr{) rr r!rrur"r*r-rr{r r#r$r%rr s',uSb'A'A'AI$AAAE#2...Hc...5"---GS---&+eDb&I&I&IIx #IIIIIr$rceZdZUeddZeed<eddZeed<eddZeed<eddZ ded<d S) RestartTransfer.rrr*r,r+rrN) rr r!rr*r-r"r,r+rr#r$r%r{r{ sE#2...Hc...cr222L#222eCR000J000$)E#2$>$>$>F !>>>>>r$r{c4eZdZUeddZded<dS)RestartTransferOperation.rrr{restart_transferN)rr r!rr~r"r#r$r%r}r} rgr$r}ceZdZUdZeddZeeed<eddZ ee e ed<dS)Rrfz/ Parameters for Reciprocal Rank Fusion Nz&K parameter for reciprocal rank fusionr8rzWeights for each prefetch source. Higher weight gives more influence on the final ranking. If not specified, all prefetches are weighted equally. The number of weights should match the number of prefetches.weights) rr r!r<rrr r-r"rrr>r#r$r%rr suT7_```Ax}```%*Ue&&&GXd5k "r$rc4eZdZUeddZded<dS)RrfQuery.rrrrN)rr r!rrr"r#r$r%rr s1s+++C+++++r$rceZdZUeddZeeed<eddZeeed<eddZ e ed<eddZ ee ed <edd Z eeed <edd Zee ed <eddZee ed<eddZeed<eddZeded<eddZeeded<dS)rPNrr8 distributiondistribution_version.r is_dockercoreszAverage number of CPU cores used by this process over roughly the last two seconds. `None` on unsupported platforms, before two samples are collected, or on transient failures reading process CPU time.cpu_cores_usedzJEffective total memory for this process in KiB (cgroup limit or host RAM).ram_sizezpSize in KiB of the filesystem hosting Qdrant's /storage path (if not available, fallback to host disk size) disk_size cpu_flagsr cpu_endianr gpu_devices)rr r!rrr rCr"rrr=rr-rr>rrrrrrr#r$r%rPrP s"'%""E"E"EL(3-EEE*/%"*M*M*M(3-MMMeCR000It000 52>>>E8C=>>>&+e`'''NHUO$e"nHhsm %uG   Ix}U3B///Is///(-d(K(K(KJ%KKK8=dXZ8[8[8[K$345[[[[[r$rPceZdZdZdS)SamplerandomN)rr r!RANDOMr#r$r%rr, s FFFr$rc4eZdZUeddZded<dS) SampleQuery.rrrsampleN)rr r!rrr"r#r$r%rr0 rr$rc4eZdZUeddZded<dS)ScalarQuantization.rrScalarQuantizationConfigscalarN)rr r!rrr"r#r$r%rr4 rqr$rceZdZUeddZded<eddZeeed <edd Z ee ed <edd Z ed ed<dS)r.rr ScalarTyperNziQuantile for quantization. Expected value range in [0.5, 1.0]. If not set - use the whole range of valuesr8quantilezDeprecated: use `memory` instead. If true - quantized vectors always will be stored in RAM, ignoring the config of main storagertrurvrw) rr r!rrr"rr r>rtr=rwr#r$r%rr8 ss333D,333 %!!!Hhuo"'V"""J"'~"""FHX r$rceZdZdZdS)rint8N)rr r!INT8r#r$r%rrH rr$rc@eZdZUdZeddZded<eddZeed<edd Z e ed <ed d Z e ded<ed d Z e ded<ed d Ze ded<ed d Ze ded<d S)rz Search result .z Search resultrrgr!z Point versionrGz*Points vector distance to the query vectorrqNr)r8rkrr*r+rr,rr{zOrder-by valuer-r.)rr r!r<rr!r"rGr-rqr>rr rr{r.r#r$r%rrL s"E#?CCCBCCC5/:::GS:::5*VWWWE5WWW#(5Ck#l#l#lGXi lll-2U4Mb-c-c-cFH) *ccc&+eDk&R&R&RIx #RRR*/%JZ*[*[*[K,'[[[[[r$rcdeZdZUdZeddZeded<eddZeded <edd Z ee ed <edd Z ed ed<eddZ eded<eddZ eded<eddZeded<dS) ScrollRequestzQ Scroll request - paginate over all points which matches given condition Nryr8rzr{zStart ID to read points from.rgrzPage size. Default: 10r]zSLook only for points which satisfies this conditions. If not provided - all points.r}r~rrrzGScroll request - paginate over all points which matches given conditionrrz%Order the records by a payload field.rzr{)rr r!r<rr{r r"rr]r-r~rrr{r#r$r%rrZ s`/4ek///Ix*++0%Ji*j*j*jFH& 'jjj 5;STTTE8C=TTT!&"w"""FHX 6;U"f666L(12+0%"k+++K,'.3U4Mt-u-u-uHh)*uuuuur$rcteZdZUdZeddZeded<edd Ze d ed <dS) r)z+ Result of the points read request .zList of retrieved pointsrr!rNz:Offset which should be used to retrieve a next page resultr8rgnext_page_offset) rr r!r<rrrr"rr r#r$r%r)r)q sz#U34NOOOFDNOOO49E"^555h01r$r)ceZdZUeddZeeed<eddZeeed<eddZ ee ed<edd Z ed ed <d S) r@.zRow indices of the matrixr offsets_rowzColumn indices of the matrix offsets_colz)Scores associated with matrix coordinatesscoreszIds of the points in orderrgrhN) rr r!rrrr-r"rrr>rhr#r$r%r@r@| s"U34OPPPKcPPP"U34RSSSKcSSS%1\]]]FDK]]]#(5:V#W#W#WC WWWWWr$r@ceZdZUdZeddZded<eddZded<eddZe ed<d S) SearchMatrixPairz* Pair of points (a, b) with score .z Pair of points (a, b) with scorerrgr,rrqN) rr r!r<rr,r"rrqr>r#r$r%rr s!52TUUUAUUU 52TUUUAUUU5*LMMME5MMMMMr$rc@eZdZUeddZeded<dS)r=.z#List of pairs of points with scoresrrpairsN)rr r!rrrr"r#r$r%r=r= s8&+eC=b&c&c&cE4" #cccccr$r=ceZdZUeddZeded<eddZeded<edd Zee ed <edd Z ee ed <edd Z ee ed<dS)SearchMatrixRequestNryr8rzr{r|r}r~z;How many points to select and search within. Default is 10.rz5How many neighbours per sample to find. Default is 3.r]rr) rr r!rr{r r"r~rr-r]rrCr#r$r%rr s.3ek///Ix*+"'tAw!x!x!xFHX xxx!E"_FHSM!5;rsssE8C=sss 5kE8C=r$rc4eZdZUdZeddZeeed<eddZ ee ed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<dS)rrNzParams relevant to HNSW index Size of the beam in a beam-search. Larger the value - more accurate the result, more time required for search.r8hnsw_efFzYSearch without approximation. If set to true, search may run long but with exact results.rzQuantization 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_onlyzACORN search paramsr7acornzWhich population sparse vector IDF statistics are computed over. By default (or with explicit `"global"`) statistics are collection-wide. Only applicable to sparse vectors with the IDF modifier enabled. IdfParamsr)rr r!r<rrr r-r"rr=rrrrr#r$r%rr sB#UcGXc]"EoE8D>:?tYn9o9o9oL(56ooo#(5~$$$L(4.,15K`+a+a+aE8' (aaa!&k"""C+ r$rceZdZUdZeddZeed<eddZe ed<eddZ e ed <d S) SearchThreadPoolTelemetrya Live snapshot of the adaptive search routing. `mode` is the runtime currently selected by [`SearchMode`]; `high_cpu_threads` and `high_io_threads` are the blocking-thread budgets of the two underlying runtimes that the adaptive handle routes between. .z0Currently active mode (`high_cpu` or `high_io`).rmodez.Blocking-thread count of the high-CPU runtime.high_cpu_threadsz-Blocking-thread count of the high-IO runtime.high_io_threadsN) rr r!r<rrrCr"rr-rr#r$r%rr sc'YZZZD#ZZZ!E#3cdddcddd 52abbbOSbbbbbr$rceZdZUeidZeeedfed<eddZ eeedfed<edd Z d ed <dS) SegmentConfigrr8VectorDataConfig vector_dataNSparseVectorDataConfigsparse_vector_data.rPayloadStorageTypepayload_storage_type) rr r!rrr rrCr"rrr#r$r%rr s;@5Y[;\;\;\K$s$6678\\\HMVZhjHkHkHkc+C&C!DEkkk16s1K1K1K.KKKKKr$rceZdZUdZeddZeed<eddZded<eddZ e ed<eddZ e ed <ed d Z e e ed <ed d Ze e ed <eddZe ed<eddZe ed<eddZe ed<eddZe ed<eddZe ed<eddZe ed<eddZeed<eddZeedfed<eddZeedfed<ed d Ze ded<ed d Ze e ed<d S) SegmentInfoz. Aggregated information about segment .z$Aggregated information about segmentrr SegmentType segment_typer(r'Nr8num_deferred_pointsnum_deleted_deferred_pointsnum_indexed_vectorsnum_deleted_vectorsrr%z@An estimation of the effective amount of bytes used for payloadsr&ram_usage_bytesdisk_usage_bytes is_appendabler index_schemaVectorDataInforzUniversal I/O backend that payload storage reads files with. Absent if payload storage does not support configurable backends or only supports a single backend type.r]payload_storage_io_backendzaInternal ID from which points are deferred (hidden from reads). Only set for appendable segments.deferred_internal_id)rr r!r<rrr r"rr(r-r'rr rrrr%r&rrrr=rrrCrrrr#r$r%rr ss(NOOOD$OOO"'%9_"`"`"`L-```uS.TUUUKUUUeC-STTTJTTT).tIo)p)p)p#ppp16tQw1x1x1x#xxx$uS6\]]]]]]$uS6\]]]]]]#e P %u [   !52XYYYOSYYY!E#3YZZZcZZZ%1WXXXM4XXX27%Io2p2p2pL$s../ppp/4uSFl/m/m/mKc++,mmm8=|999 5+0%w+++(3-r$rceZdZUeddZded<eddZded<eddZeded <eddZ ed ed <d S) r.rrrinforrVectorIndexSearchesTelemetryvector_index_searchesrpayload_field_indicesN) rr r!rrr"rrrrr#r$r%rr s%444D-444#eCR888FO888BG%Y[B\B\B\4 >?\\\;@5RT;U;U;U4 78UUUUUr$rc*eZdZdZdefdZdZdZdZdS)rz Type of segment r&c*t|jSr(r)r+s r%r-zSegmentType.__str__ r.r$rindexedspecialN) rr r!r<rCr-PLAININDEXEDSPECIALr#r$r%rr sD EGGGGr$rceZdZUdZeddZded<edd Zee d ed <edd Z ed ed<edd Z eded<edd Z ee ed<dS)r~r.rrrkrNz*Assigns payload to each point in this listr8rgrz@Assigns payload to each point that satisfy this filter conditionr}r~rzr{z@Assigns payload to each point that satisfy this path of propertyr.)rr r!r<rrr"rr rr~r{r.rCr#r$r%r~r~ s% jGY16"N111FHT+, -"'"d"""FHX /4e"s///Ix*+"dC#r$r~c4eZdZUeddZded<dS)SetPayloadOperation.rrr~ set_payloadN)rr r!rrr"r#r$r%rr s1 %cr : : :K:::::r$rc4eZdZUeddZeed<dS)ShardCleanStatusFailedTelemetry.rrreasonN)rr r!rrrCr"r#r$r%rr r r$rc4eZdZUeddZeed<dS)!ShardCleanStatusProgressTelemetry.rrdeleted_pointsN)rr r!rrr-r"r#r$r%rr s1%444NC44444r$rceZdZdZdZdZdS)ShardCleanStatusTelemetryOneOfstartedr cancelledN)rr r!STARTEDDONE CANCELLEDr#r$r%rr# sG DIIIr$rc4eZdZUeddZded<dS)ShardCleanStatusTelemetryOneOf1.rrrrJN)rr r!rrJr"r#r$r%rr) s249E#24N4N4NH1NNNNNr$rc4eZdZUeddZded<dS)ShardCleanStatusTelemetryOneOf2.rrrfailedN)rr r!rrr"r#r$r%rr- s205cr0J0J0JF -JJJJJr$rc4eZdZUeddZded<dS)ShardKeyDescription.rrrr.N)rr r!rr.r"r#r$r%rr1 s1eCR000C00000r$rcXeZdZUeddZded<eddZded<dS)ShardKeyWithFallback.rrrrfallbackN)rr r!rrr"rr#r$r%rr5 sPs333FJ333 5"555Hj55555r$rcLeZdZUeddZeeded<dS)r NzHThe existing shard keys. Only available when sharding method is `custom`r8r shard_keys)rr r!rrr rr"r#r$r%r r : sN8="l999J345r$r ceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <dS)ShardSnapshotRecover.rrShardSnapshotLocationlocationNr8SnapshotPrioritypriorityFOptional SHA256 checksum to verify snapshot integrity before recovery.checksumCOptional API key used when fetching the snapshot from a remote URL.api_key) rr r!rrr"rr rrCrr#r$r%rr@ s(-cr(B(B(BH%BBB-2U4R-P-P-PHh)*PPP#e"jHhsm#U"gGXc]r$rc.eZdZdZdefdZdZdZdZdZ dS) r#z 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 r&c*t|jSr(r)r+s r%r-zShardStatus.__str__P r.r$r/r0r1r2Nr3r#r$r%r#r#K r8r$r#c2eZdZUeddZeed<eddZeeed<edd d Z eed <edd Z eed<eddZ e ed<eddZ eded<eddZeeed<dS)r.rrr*NzsTarget shard ID if different than source shard ID Used exclusively with `ReshardingStreamRecords` transfer method.r8 to_shard_idzSource peer idfromrfrom_zDestination peer idrzyIf `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"rr r rr r=rr rCr#r$r%rrY s5E#2...Hc...!&J"""K#s(8GGGE3GGGeC%:;;;B;;; PD$/4eDb.Q.Q.QFH* +QQQ"U"xGXc]r$rc.eZdZdZdefdZdZdZdZdZ dS) ra Methods for transferring a shard from one node to another. - `stream_records` - Stream all shard records in batches until the whole shard is transferred. - `snapshot` - Snapshot the shard, transfer and restore it on the receiver. - `wal_delta` - Attempt to transfer shard difference by WAL delta. - `resharding_stream_records` - Shard transfer for resharding: stream all records in batches until all points are transferred. r&c*t|jSr(r)r+s r%r-zShardTransferMethod.__str__p r.r$stream_recordssnapshot wal_deltaresharding_stream_recordsN) rr r!r<rCr-STREAM_RECORDSSNAPSHOT WAL_DELTARESHARDING_STREAM_RECORDSr#r$r%rrk sL&NHI ;r$rceZdZUeddZeed<eddZeeed<edd Z eeed <dS) r.Number of elements in the queuerlengthNzlast operation number processedr8op_num^Number of points that are deferred (i.e hidden from search as they're not yet optimized).deferred_points) rr r!rrr-r"rr rr#r$r%rry s%)JKKKFCKKK!E$<]^^^FHSM^^^%*Ut&&&OXc]r$rceZdZdZdZdS)rrcustomN)rr r!rCUSTOMr#r$r%rr s D FFFr$rc\eZdZUdZeddZeed<eddZeed<dS) Slicea One of `total` disjoint deterministic slices of the id space. A point belongs to the slice iff `hash(id) % total == index`, where `hash` is SipHash-2-4 with a zero key over the canonical id bytes: 8 little-endian bytes for numeric ids, the 16 RFC 4122 bytes for UUIDs. For a fixed `total`, slices `0..total` are disjoint and together cover all points; membership is uniform regardless of the id scheme and stable across queries, segments, platforms and Qdrant versions. Slices with different `total` values are correlated (same hash, no salt): e.g. slice `0` of `total: 4` is a strict subset of slice `0` of `total: 2`. This keeps a smaller sample contained in a larger one. .z:Total number of disjoint slices the id space is split intorrz,Which slice to select, must be in `0..total`indexN) rr r!r<rrr-r"r!r#r$r%r r  s^s(deeeE3eees(VWWWE3WWWWWr$r c8eZdZUdZeddZded<dS)SliceConditionz Select points that fall into one of `total` disjoint deterministic slices of the id space, for parallel scans and reproducible sampling. .zSelect points that fall into one of `total` disjoint deterministic slices of the id space, for parallel scans and reproducible sampling.rr sliceN)rr r!r<rr$r"r#r$r%r#r# sRU _E7r$r#ceZdZUeddZeed<eddZeeed<eddZ e ed<eddZ eeed <dS) r.rrrFNr8 creation_timerr) rr r!rrFrCr"r&r rr-rr#r$r%rr scr***D#***#(52#F#F#FM8C=FFFcr***D#***#eDbAAAHhsmAAAAAr$rc*eZdZdZdefdZdZdZdZdS)rz 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. r&c*t|jSr(r)r+s r%r-zSnapshotPriority.__str__ r.r$no_syncrreplicaN) rr r!r<rCr-NO_SYNCrREPLICAr#r$r%rr sDGHGGGr$rceZdZUeddZeed<eddZeded <edd Z eeed <edd Z eeed <dS)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`rrNa[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.r8rrrrrr) rr r!rrrCr"rr rrr#r$r%r.r. sE CHc.3Ur...Hh)*$e"jHhsm#U"gGXc]r$r.ceZdZdZdS)SnowballsnowballN)rr r!SNOWBALLr#r$r%r0r0 rr$r0cjeZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdS)SnowballLanguagez2 Languages supported by snowball stemmer. r&c*t|jSr(r)r+s r%r-zSnowballLanguage.__str__ r.r$rrarmenianrxryrzr{r|r}r~rrrrrrrrtamilrN)rr r!r<rCr-rARMENIANrrrrrrrrrrrrrrrTAMILrr#r$r%r4r4 sFH F EGG F F EIGIJHGGG EGGGr$r4cXeZdZUeddZded<eddZded<dS) SnowballParams.rrr0rr4rN)rr r!rrr"rr#r$r%r;r; sQuSb111D*111#(5"#=#=#=H =====r$r;ceZdZUdZeddZeeed<eddZ d ed <edd Z ed ed <eddZ eded<dS)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.r8r.z(Configuration for sparse inverted index.rSparseIndexTyperz,Datatype used to store weights in the index.rrzRequested memory placement of the index. The structural decision is carried by `index_type`; this field additionally distinguishes `cold` from `cached` for the mmap index variant.rvrw) rr r!r<rrr r-r"rrrwr#r$r%r=r= s*/M***#%*E#;e$f$f$fJ!fff27%"P333Hh./"'K"""FHX r$r=ceZdZUdZeddZeeed<eddZ ee ed<eddZ ed ed <edd Z ed ed <dS)SparseIndexParamsr>Nr?r8rzwDeprecated: use `memory` instead. Store index on disk. If set to false, the index will be stored in RAM. Default: falserrrvrwa9Defines 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.rr) rr r!r<rrr r-r"rr=rwrr#r$r%rBrB s*/M***#$eNGXd^"'f"""FHX &+UP &&&Hhz"r$rBc"eZdZdZdefdZdZdS)SparseIndexTypeOneOfz" Mutable RAM sparse index r&c*t|jSr(r)r+s r%r-zSparseIndexTypeOneOf.__str__ r.r$ MutableRamN)rr r!r<rCr- MUTABLERAMr#r$r%rDrD s:JJJr$rDc"eZdZdZdefdZdZdS)SparseIndexTypeOneOf1z$ Immutable RAM sparse index r&c*t|jSr(r)r+s r%r-zSparseIndexTypeOneOf1.__str__ r.r$ ImmutableRamN)rr r!r<rCr- IMMUTABLERAMr#r$r%rIrI s:"LLLr$rIc"eZdZdZdefdZdZdS)SparseIndexTypeOneOf2z Mmap sparse index r&c*t|jSr(r)r+s r%r-zSparseIndexTypeOneOf2.__str__+ r.r$MmapNrr r!r<rCr-rar#r$r%rNrN& r<r$rNcteZdZUdZeddZeeed<eddZ ee ed<dS) SparseVectorz! Sparse vector structure .zIndices must be uniquerindicesz*Values and indices must be the same lengthvaluesN) rr r!r<rrTrr-r"rUr>r#r$r%rSrS1 sfs0HIIIGT#YIII%1]^^^FDK^^^^^r$rScteZdZUdZeddZeded<eddZeded <dS) SparseVectorConfigz Configuration for creating a new sparse named vector. Only includes properties that define the vector space and cannot be changed after creation. Nz-Value modifier for sparse vectors (e.g., IDF)r8rmodifierz+Datatype used to store weights in the indexrr) rr r!r<rrXr r"rr#r$r%rWrW: sz&+U4Et%u%u%uHhz"uuu27%"O333Hh./r$rWceZdZUdZeddZded<eddZed ed <edd Z ed ed <dS)rz5 Config of single sparse vector data storage .z+Config of single sparse vector data storagerr=r!Nr8SparseVectorStorageType storage_typeIConfigures addition value modifications for sparse vectors. Default: nonerrX) rr r!r<rr!r"r[r rXr#r$r%rrE s"'s8e!f!f!fE fff8="O999L(45&+U"m&&&Hhz"r$rc8eZdZUdZeddZded<dS)SparseVectorNameConfigz4 Wrapper for sparse vector creation config. .z*Wrapper for sparse vector creation config.rrWsparseN)rr r!r<rr_r"r#r$r%r^r^S s?$)5:f#g#g#gF gggggr$r^cteZdZUdZeddZeded<eddZeded <dS) rz5 Params of single sparse vector data storage NzQCustom params for index. If none - values from collection configuration are used.r8rBr!r\rrX) rr r!r<rr!r r"rXr#r$r%rr[ s,15"u,,,E8' (&+U"m&&&Hhz"r$c"eZdZdZdefdZdZdS)SparseVectorStorageTypeOneOfz4 Storage in memory maps (gridstore storage) r&c*t|jSr(r)r+s r%r-z$SparseVectorStorageTypeOneOf.__str__m r.r$r_NrQr#r$r%rbrbh r<r$rbc"eZdZdZdefdZdZdS)SparseVectorStorageTypeOneOf1z Placeholder storage: contains no data, all vectors reported as deleted. Used for newly created sparse named vectors on immutable segments. r&c*t|jSr(r)r+s r%r-z%SparseVectorStorageTypeOneOf1.__str__x r.r$emptyNrr r!r<rCr-EMPTYr#r$r%reres : EEEr$rec4eZdZUeddZded<dS)SqrtExpression.rrr3sqrtN)rr r!rrmr"r#r$r%rlrl~ s1s333D,33333r$rlceZdZUeddZded<eddZeeed <edd Z ed ed <dS) StartResharding.rrrsruNzPeer to create the new shard on, or to migrate points away from when scaling down. If not specified, the least loaded peer is picked when scaling up, a peer holding the removed shard when scaling down.r8rzlCustom shard key to reshard, must already exist. If not specified, shards without a shard key are resharded.rr{) rr r!rrur"rr r-r{r#r$r%roro s',uSb'A'A'AI$AAA"U`GXc]',eC'''Ix #r$roc4eZdZUeddZded<dS)StartReshardingOperation.rrrostart_reshardingN)rr r!rrrr"r#r$r%rqrq rgr$rqc.eZdZdZdefdZdZdZdZdZ dS) rz+ Role of the peer in the consensus r&c*t|jSr(r)r+s r%r-zStateRole.__str__ r.r$Follower CandidateLeader PreCandidateN) rr r!r<rCr-FOLLOWER CANDIDATELEADER PRECANDIDATEr#r$r%rr sIHI F!LLLr$rceZdZUeddZeeded<eddZeee ed<dS) StopwordsSetNz_Set of languages to use for stopwords. Multiple pre-defined lists of stopwords can be combined.r8rq languageszrrrrrrrrrrrrrr#r$r%rr s#eD>wxxxGXd^xxx%*U"x&&&OXc]"'tAc!d!d!dK#ddd385"m444 (4.27"q222)."S))) */tIk)l)l)llll/4u"M000Xe_+0%Jh*i*i*i(3-iii*/%Jh*i*i*i(3-iii6;e"i777$hsm&+U"X&&&OXc]',e"Y'''hsm8=u"V888%x}',eDFv&w&w&whsmwww+05Kn+o+o+o8C=ooo(-"U))) CH%"ICCC!>?9>"K999M845.3U"Q...Xc]27U222#r$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#Zee ed$<edd%Zed&ed'<edd(Zed)ed*<edd+Zee ed,<edd-Zee ed.<dS)/rNrr8rrrrrrrrrz,Max HNSW value allowed in search parameters.rz'Whether exact search is allowed or not.rrrrrrrrrrrrrrrrrrrrrzMultivector configuration!StrictModeMultivectorConfigOutputrzSparse vector configurationStrictModeSparseConfigOutputrrrzDeprecated: use the node-wide quota config instead. Reject memory-consuming update operations when resident memory exceeds this percentage of total RAM (1-100)rrr#r$r%rr s#eD>wxxxGXd^xxx%*U"x&&&OXc]"'tAc!d!d!dK#ddd385"m444 (4.27"q222).dHv(w(w(w www).tIr)s)s)ssss/4u"M000Xe_+0%Jh*i*i*i(3-iii*/%Jh*i*i*i(3-iii6;e"i777$hsm&+U"X&&&OXc]',e"Y'''hsm8=u"V888%x}',eDFv&w&w&whsmwww+05Kn+o+o+o8C=ooo(-"U))) IN"=III!DE?De"????M8:;.3U"Q...Xc]27v222#r$rc@eZdZUeddZeeed<dS)rN&Max number of vectors in a multivectorr8 max_vectorsrr r!rrr r-r"r#r$r%rr6!&tAi!j!j!jK#jjjjjr$c@eZdZUeddZeeed<dS)rNrr8rrr#r$r%rrrr$c@eZdZUeddZeeed<dS)rNMax length of sparse vectorr8 max_lengthrr r!rrr r-r"r#r$r%rr6 %d@] ^ ^ ^J ^^^^^r$c@eZdZUeddZeeed<dS)rNrr8rrr#r$r%rrrr$c@eZdZUeddZeded<dS) SumExpression.rrr3sumN)rr r!rrrr"r#r$r%rr"s6#eCR888Cl 88888r$rceZdZUeddZeed<eddZeded<eddZ d ed <eddZ ed ed <eddZ ed ed<eddZ eded<eddZ eded<eddZeded<eddZeded<dS)r-.rrr!Nr8rEapprNrLrr2rnrequestsrrwrhardwarer search_poolaBResource quota this node is enforcing, and whether it is currently over it. The config is whatever this node last persisted, so a peer that missed a consensus update reports what it is actually applying rather than what the cluster agreed on. Absent for a token without global access, which `GET /quotas` requires as well.r quota)rr r!rr!rCr"rr rLr2rrwrrrr#r$r%r-r-&sjeCR(((B((().t)L)L)LC% &LLL*/%*D*D*DK'DDD,1E$B,O,O,OGX( )OOO.3eDb.Q.Q.QHh*+QQQ*/%"*M*M*MFH& 'MMM.3eDb.Q.Q.QHh*+QQQ9>tY[9\9\9\K56\\\(-Y)))E8$ %r$r-cDeZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <eddZ ee ed<eddZ ee ed<eddZee ed<eddZeded<eddZee ed<eddZeded<eddZeded<eddZee ed <dS)!TextIndexParams.rr TextIndexTyperNr8rrz#Minimum characters to be tokenized.rz#Maximum characters to be tokenized.rz-If true, lowercase all tokens. Default: true.rupIf true, normalize tokens by folding accented characters to ASCII (e.g., 'ação' -> 'acao'). Default: false.rz1If true, support phrase matching. Default: false.phrase_matchingz\Ignore this set of tokens. Can select from predefined languages and/or provide a custom set.rrrrrrvrwz*Algorithm for stemming. Default: disabled.rrrr)rr r!rrr"rr rr-rrr=rrrrrwrrr#r$r%rr5s6!E#2666D/666+052+N+N+NIx(NNN#(5Ch#i#i#iM8C=iii#(5Ch#i#i#iM8C=iii %d@o p p pIx~ppp$)EG%%%M8D>',e"U'''OXd^16r111Ix,-$e"wGXd^"'f"""FHX .3U"N...GX) *#(%W###K$r$rceZdZdZdS)rr>N)rr r!rr#r$r%rrVrr$rceZdZdZdZdZdZdS)rrl whitespaceword multilingualN)rr r!PREFIX WHITESPACEWORD MULTILINGUALr#r$r%rrZs" FJ D!LLLr$rceZdZdZdZdS)TrackerStatusOneOf optimizingrN)rr r! OPTIMIZINGrr#r$r%rrasJ DDDr$rc4eZdZUeddZeed<dS)TrackerStatusOneOf1.rrrN)rr r!rrrCr"r#r$r%rrfs1U3B///Is/////r$rc4eZdZUeddZeed<dS)TrackerStatusOneOf2.rrrSN)rr r!rrSrCr"r#r$r%rrjs1s+++E3+++++r$rcTeZdZUdZeddZeed<eddZe ed<eddZ e e ed <edd Z e e ed <edd Zd ed<eddZeeefed<eddZeeeefed<dS)rYz* Tracker object used in telemetry .zName of the optimizerrrFz;UUID of the upcoming segment being created by the optimizerrzInternal segment IDs being optimized. These are local and in-memory, meaning that they can refer to different segments after a service restart. segment_idszSegment UUIDs being optimized. Refers to same segments as in `segment_ids`, but trackable across restarts, and reflect their directory name. segment_uuidsz Tracker object used in telemetryrGrzStart time of the optimizerstart_atNzEnd time of the optimizerr8end_at)rr r!r<rrFrCr"rr rrr-rrrr rrrr r#r$r%rYrYnsAc'>???D#???s(efffD$fff"U fKc!& c!!!M4:$eC5WXXXFOXXX&+eC=Z&[&[&[HeHdN#[[[.3eDNi.j.j.jFHU8T>* +jjjjjr$rYceZdZdZdZdZdZdS)TurboQuantBitSizebits1bits1_5bits2bits4N)rr r!BITS1BITS1_5BITS2BITS4r#r$r%rrs" EG E EEEr$rceZdZUeddZeeed<eddZeded<eddZ ed ed <dS) TurboQuantQuantizationConfigNrsr8rtrurvrwrrbits) rr r!rrtr r=r"rwrr#r$r%rrs!&tAd!e!e!eJeee!&~"""FHX +0%"*M*M*MD(& 'MMMMMr$rc4eZdZUeddZded<dS)TurboQuantization.rrrturboN)rr r!rrr"r#r$r%rrs2,1E#2,F,F,FE )FFFFFr$rceZdZUdZeddZeded<eddZeded <edd Z ed ed <edd Z eded<eddZ eded<eddZ eded<eddZ eded<eddZeded<dS)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.r8VectorsConfigDiffrjzCustom params for Optimizers. If none - it is left unchanged. This operation is blocking, it will only proceed once all current optimizations are completerrz7Collection base params. If none - it is left unchanged.rrzSHNSW parameters to update for the collection index. If none - it is left unchanged.rrzBQuantization parameters to update. If none - it is left unchanged.QuantizationConfigDiffrzFMap of sparse vector data parameters to update for each sparse vector.SparseVectorsConfigrz"f999!4538%"f333Hh./r$rceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <dS) r.rrr(rrNzUniversal I/O backend that this vector storage reads files with. Absent if vector storage does not support configurable backends or only supports a single backend type.r8r] io_backend) rr r!rr(r-r"rrrr r#r$r%rr1suSb111K111$uSb999999$uSb999999(-)))J%r$rceZdZUeddZeeed<eddZded<eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZded<eddZded<eddZded<dS)rNrr8 index_name.rrunfiltered_plainunfiltered_hnswunfiltered_sparsefiltered_plainfiltered_small_cardinalityfiltered_large_cardinalityfiltered_exactfiltered_sparseunfiltered_exact)rr r!rrr rCr"rrrrrrr r!r"r#r$r%rr;s\ %d C C CJ CCC6;eCR6P6P6P3PPP5:U3B5O5O5OO2OOO7"H999!45r$r$ceZdZUeddZeded<eddZeded<edd Zee ed <edd Z ed ed <dS)rNzAUpdate params for HNSW index. If empty object - it will be unset.r8rrz?Update params for quantization. If none - it is left unchanged.rrzsDeprecated: use `memory` instead. If true, vectors are served from disk, improving RAM usage at the cost of latencyrzMemory placement of the original vector storage. Overrides the deprecated `on_disk` flag if both are set. `pinned` is not supported for dense vector storage.rvrw) rr r!rrr r"rrr=rwr#r$r%rrhs.3e"e///K*+?De"c???":;$eJGXd^"'t"""FHX r$c.eZdZdZdefdZdZdZdZdZ dS) rz# Storage types for vectors r&c*t|jSr(r)r+s r%r-zVectorStorageDatatype.__str__~r.r$rrrrN) rr r!r<rCr-rrrrr#r$r%rrysIGG E FFFr$rc"eZdZdZdefdZdZdS)VectorStorageTypeOneOfz^ Storage in memory (RAM) Will be very fast at the cost of consuming a lot of memory. r&c*t|jSr(r)r+s r%r-zVectorStorageTypeOneOf.__str__r.r$rvN)rr r!r<rCr-MEMORYr#r$r%r)r)rr$r)c"eZdZdZdefdZdZdS)VectorStorageTypeOneOf1z Storage in mmap file, not appendable Search performance is defined by disk speed and the fraction of vectors that fit in memory. r&c*t|jSr(r)r+s r%r-zVectorStorageTypeOneOf1.__str__r.r$rPNrQr#r$r%r-r-r<r$r-c"eZdZdZdefdZdZdS)VectorStorageTypeOneOf2z Storage in chunked mmap files, appendable Search performance is defined by disk speed and the fraction of vectors that fit in memory. r&c*t|jSr(r)r+s r%r-zVectorStorageTypeOneOf2.__str__r.r$ ChunkedMmapN)rr r!r<rCr- CHUNKEDMMAPr#r$r%r0r0rr$r0c"eZdZdZdefdZdZdS)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 r&c*t|jSr(r)r+s r%r-zVectorStorageTypeOneOf3.__str__r.r$InRamChunkedMmapN)rr r!r<rCr-INRAMCHUNKEDMMAPr#r$r%r5r5s=*r$r5c"eZdZdZdefdZdZdS)VectorStorageTypeOneOf4zT Storage in a single mmap file, not appendable Pre-fetched into RAM on load r&c*t|jSr(r)r+s r%r-zVectorStorageTypeOneOf4.__str__r.r$ InRamMmapN)rr r!r<rCr- INRAMMMAPr#r$r%r:r:s:IIIr$r:c"eZdZdZdefdZdZdS)VectorStorageTypeOneOf5z Placeholder storage: contains no data, all vectors reported as deleted. Used for newly created named vectors on immutable segments. No files on disk, reconstructed from config on load. r&c*t|jSr(r)r+s r%r-zVectorStorageTypeOneOf5.__str__r.r$EmptyNrhr#r$r%r?r?rjr$r?ceZdZUeddZeed<eddZeed<eddZe eed<dS) VersionInfo.rrtitlerGNr8r) rr r!rrDrCr"rGrr r#r$r%rCrCsss+++E3+++5"---GS---!E$B???FHSM?????r$rCceZdZUeddZeed<eddZeed<edd Ze eed <d S) r."Size of a single WAL segment in MBrwal_capacity_mbrdsS########<<<<<<<<<<<<<<<<%%%%%%%%HHHHHHHHHHHH sCx.3 445"3(?#?@$(.K)K$L!c#556#C)A$AB00177777y777733333(3333 FFFFFYhFFFF33333IX3333          66666y666 @ @ @ @ @ @ @ @/////9///HHHHHYHHHNNNNNIXNNNN DDDDD(DDDD     y    ,,,,,d,,,      c4   +++++(++++\     ix    CYhAAAAAIXAAAAGGGGGYGGG ######## )$RRRRRYRRRMMMMMyMMM w w w w wI w w wy.rrrrr rrr+++++I+++wwwww)wwweeeeeYeee8y<9H*RRRRR)RRR     sD   nnnnn)nnn===== ===<<<<55555ix5555     Yh     d     #t        #t   ZZZZZyZZZZ)8RRRRR)8RRRR)8JJJJJ JJJJccccc9HccccVVVVV(VVVVC     S$   eeeeeieee        00000 0000     )8    --------     sD    99999(9999:::::Yh::::CEEEEE EEEEFFFFFIXFFFF*****)8**** 9H33333IX3333iiiiiYhiiii22222ix2222TZZZZZ)ZZZ$ : : : : :9 : : :_____i___ I&lllll9lllRRRRRRRR     y   F     9H    FCTTTTTYTTTix>>>>>9H>>>>AAAAA AAAA;;;;;;;;99999y999 <<<<<9H<<<< U U U U Uy U U UOOOOOIOOOT$^^^^^Yh^^^^RRRRRYhRRRR9H#####i### #####y### NNNNNyNNNAAAAA9AAAY$kkkkk)kkk vvvvvvvv RRRRR9HRRRR N N N N N9H N N N N`````)8```` 888889H8888     )8         (    22222IX222288888 8888 y6FFFFF)8FFFF  d d d d d9 d d dy$)))))())))X     9H    F@@@@@ @@@@=====I===)8(     I   )&     Y           QQQQQyQQQ(XXXXXIXXXXX     #t        Yh    =====Yh====     T    X X X X XY X X X>>>>>Yh>>>> NNNNNYhNNNN77777i777[[[[[9[[[NNNNN)8NNNNVVVVV9HVVVV.....ix.... aaaaa)aaa&&&&&3&&&*:::::ix:::: EEEEEyEEEEYhCCCCCixCCCC77777 777     #t   JJJJJYJJJ?????ix????EEEEEyEEEE     )8    ,,,,,y,,,,\\\\\)\\\*S$22222)82222DDDDD(DDDD     y     d \ \ \ \ \) \ \ \vvvvvIXvvvv.9XXXXX)XXXNNNNNyNNNddddd ddd     )8     9H2ccccc cccLLLLLILLL     )   FVVVVVyVVV     #t   (,;;;;;)8;;;;-----i---55555 555S$ OOOOOiOOOKKKKKiKKK11111)111666669H6666   9H     #t    $ < < < < <#t < < <9S$ XXXXXIXXXXXYhBBBBB)BBB     sD   ix"sDsD:>>>>>Yh>>>>  & .3"""""C"""C_____9H____(     Y   hhhhhYhhhhh     (    3C44444Yh4444     ix    EEEEEyEEEE " " " " "T " " "9H22222y2222j00000Y000fkkkkkIXkkkkkkkkk)kkk_____y_________Y___99999IX9999     I   ixBC"""""C"""d 00000)000,,,,,),,,kkkkkykkk(TNNNNN9HNNNNGGGGG GGGGyD      d    EEEEEyEEEEi888889888 " " " " "3 " " "LLLLLIXLLLL AAAAAYhAAAAAAAAAixAAAA     I        ix     Cfffff)8ffffy(Y Q Q Q Q Q9 Q Q Q9H@y"     C   S$c4     c4   *****c4***c4c4@@@@@)@@@ mmmmm mmm rrrrrIXrrrri(     C    OO     "$     !  C  )T/                   !#              ""##%     J   !#            k     k   L !#  O k d; !DL !NK   % * N k     k F     k L !# O   r$