Biu/ddlmZmZddlmZddlmZmZmZmZm Z m Z ddl m Z ddl mZmZddlmZmZmZmZeeefZeedfZeedfZeed fZeed fZeed fZeed fZGd dedZGddedZGddedZGddedZ GddedZ!GddeZ"GddeZ#GddeZ$Gdd edZ%Gd!d"edZ&Gd#d$edZ'Gd%d&eeZ(Gd'd(eeZ)Gd)d*edZ*Gd+d,edZ+Gd-d.eeZ,Gd/d0edZ-Gd1d2edZ.Gd3d4eZ/Gd5d6eZ0Gd7d8eZ1Gd9d:eZ2Gd;deZ4Gd?d@eZ5GdAdBeZ6GdCdDeZ7GdEdFeZ8GdGdHeZ9GdIdJeZ:GdKdLedZ;GdMdNeZ<GdOdPeeZ=GdQdReZ>GdSdTeZ?GdUdVeZ@GdWdXeZAGdYdZeZBGd[d\eZCGd]d^eeZDGd_d`eZEGdadbeZFGdcddeZGGdedfeZHGdgdhedZIGdidjedZJGdkdledZKGdmdnedZLGdodpeZMGdqdreeZNGdsdtedZOGdudvedZPGdwdxedZQGdydzedZRGd{d|edZSGd}d~edZTGddeeZUGddedZVGddedZWGddeeZXGddedZYGddedZZGddedZ[GddedZ\GddedZ]GddedZ^GddedZ_GddedZ`GddedZaGddedZbGddeeZcGddeeZdGddedZeGddedZfGddedZgGddedZhGddeeZiGddeZjGddeZkGddeZlGddeZmGddeZnGddeZoGddeZpGddedZqGddedZrGddedZsGddedZtGddedZuGddedZvGdÄdeZwGdńdeZxGdDŽdedZyGdɄdedZzGd˄dedZ{Gd̈́deZ|GdτdeZ}GdфdeZ~GdӄdedZGdՄdedZGdׄdedZGdلdedZGdۄdedZGd݄deeZGd߄dedZGddeeZGddedZGddedZGddedZGddedZGddedZGddedZGddeeZGddedZGddedZGddedZGddedZGddeZGddeZGddeZGddeZGddeZGddedZGddedZGddeZGd d edZGd d eZGd dedZGddeZGddeZGddedZGddeZGddeZGddeZGddeZGddeZGdd eZGd!d"eZGd#d$eZGd%d&eZGd'd(eZGd)d*eZGd+d,eZGd-d.eZGd/d0eZGd1d2eZGd3d4eZGd5d6eZGd7d8eZGd9d:eZGd;deZGd?d@eZGdAdBeZGdCdDeZGdEdFeZGdGdHeZGdIdJeZGdKdLeZGdMdNeZGdOdPeZGdQdRedZGdSdTeeZGdUdVedZGdWdXedZGdYdZedZGd[d\eeZGd]d^eeZGd_d`edZGdadbedZGdcddeZGdedfeZGdgdhedZGdidjedZGdkdledZGdmdnedZGdodpedZGdqdredZGdsdtedZGdudvedZGdwdxeeZGdydzeZGd{d|eZGd}d~edZGddedZGddeZGddeeZGddedZGddedZGddedZGddeeZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddedZGddeZGddeZGddeZGddeZGddeZGddeZGddeZGddedZGddeeZGddeZGddedZGddedZGddedZGddeZGddeZGddedZGddeZGddeZGdÄdeeZGdńdedZGdDŽdedZGdɄdeZGd˄deZGd̈́deZGdτdeZGdфdeZGdӄdeZGdՄdeZGdׄdeZGdلdedZGdۄdedZGd݄dedZGd߄dedZGddedZGddedZGddedZGddedZ GddedZ GddedZ GddedZ GddeZ GddedZGddedZGddedZGddedZGddeZGddeZGddedZGddeeZGddedZGddedZGddedZGddedZGd d edZGd d eeZGd deZGddedZGddedZGddeZGddeZ GddedZ!GddedZ"GddedZ#GddeZ$Gdd eeZ%Gd!d"edZ&Gd#d$edZ'Gd%d&edZ(Gd'd(edZ)Gd)d*eZ*Gd+d,eeZ+Gd-d.eZ,Gd/d0edZ-Gd1d2edZ.Gd3d4edZ/Gd5d6edZ0Gd7d8eZ1Gd9d:eeZ2Gd;dedZ4Gd?d@edZ5GdAdBeeZ6GdCdDeZ7GdEdFedZ8GdGdHeZ9GdIdJedZ:GdKdLeZ;GdMdNeZ<GdOdPeZ=GdQdRedZ>GdSdTedZ?GdUdVedZ@GdWdXedZAGdYdZeZBGd[d\eZCGd]d^eZDGd_d`eeZEGdadbedZFGdcddedZGGdedfeZHGdgdheZIGdidjeeZJGdkdleZKGdmdneZLGdodpeZMGdqdredZNGdsdteZOGdudvedZPGdwdxeeZQGdydzeZRGd{d|eeZSGd}d~eZTGddeeZUGddeZVGddeeZWGddedZXGddeeZYGddeeZZGddedZ[GddeZ\GddedZ]GddeeZ^GddeeZ_GddeeZ`GddedZaGddeZbGddedZcGddeeZdGddeeZeGddedZfGddedZgGddedZhGddeeZiGddedZjGddedZkGddeZlGddedZmGdd eZnGdd edZoGdd eZpGddedZqGddeZrGddedZsGddeeZtGddeeZuGddeeZvGddeZwGddeZxGd„deZyGdĄdedZzGdƄdeeZ{GdȄdedZ|GdʄdeZ}Gd̄deZ~Gd΄deeZGdЄdedZGd҄dedZGdԄdedZGdքdeZGd؄dedZGdڄdeeZGd܄dedZGdބdeZGddeZGddeZGddedZGdd edZGddeeZGddeeZGddeeZGddeeZGddeeZGddeeZGddeZGddeZGddedZGddeZGddedZGddeeZe ePe]e"fZe eeeefZe eِe)eeteTeve.ehee'f Ze e0e1fZe e>e@fZe eeeeeeefZe eFeGeHfZe eJeeJfZe eeefe*fZe ee ee ffZe eeefZe efZe eefZe eefZe eeeeeefZe eefZe eeeefZe eefZe eefZe eefZe eeeeese+eWefZe eefZe eeeefZe eefZe eefZe e4e e&fZe e4e e&edfZe eeefeKeee0ee3ef Ze eeZfZe eefZe eJeKeLfZe eefZe efZe e^e_e`fZe edeefZe eeeefZe e[fZe eĐejfZe evewexfZe ee^eGee`e.eebfZe efZe eeefZe eeeaeeeeseefZe eeeaeeefZe eeeeefZe eeeeffZe eefZe eeefZe eeeeeeeeeeefeeseeeefZe eeeeeVeYeڐeqee eqefeezeeeeyefZe eefZe eeeeafZe eeeeNfZe eeeaeeeeeseefZe eeeeeeeefeseefZe eeeeeeeeffZe eeeefZe e͐efZѐy()datedatetime)Enum)AnyDictListLiteralOptionalUnion)UUID) BaseModelField) StrictBool StrictFloat StrictInt StrictStrSparseVectorParamsStrictModeMultivectorStrictModeMultivectorOutputStrictModeSparseStrictModeSparseOutputVectorParamsDiffc,eZdZUeddZeed<y)AbortReshardingOperation. descriptionabort_reshardingN)__name__ __module__ __qualname__rrr__annotations__b/var/www/pod-logistic/pod-ai/venv/lib/python3.12/site-packages/qdrant_client/http/models/models.pyrrs!#26c6r$rforbid)extracheZdZUeddZeed<eddZeed<eddZeed<y)AbortShardTransfer.rrshard_id to_peer_id from_peer_idN) rr r!rr*intr"r+r,r#r$r%r)r)s5#2.Hc.CR0J0cr2L#2r$r)c,eZdZUeddZded<y)AbortTransferOperation.rrr)abort_transferN)rr r!rr0r"r#r$r%r/r/s+0"+EN(Er$r/c,eZdZUeddZded<y) AbsExpression.rr ExpressionabsN)rr r!rr4r"r#r$r%r2r2 cr2C2r$r2cZeZdZUdZeddZeeed<eddZ ee ed<y) 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$sG#SFHTN(-v(OXe_r$r7cJeZdZUeddZeed<eddZeed<y)AliasDescription.rr alias_namecollection_nameN)rr r!rrAstrr"rBr#r$r%r@r@3s$CR0J0 "5OS5r$r@cJeZdZUeddZeed<eddZeed<eddZe ded <eddZ e d ed <eddZ e d ed <eddZ e ded<eddZ e eed<eddZe eed<eddZeeefed<y)AppBuildTelemetry.rrnameversionNr8AppFeaturesTelemetryfeatures FeatureFlagsruntime_featuresHnswGlobalConfighnsw_global_configRunningEnvironmentTelemetrysystemjwt_rbachide_jwt_dashboardstartup)rr r!rrFrCr"rGrIr rKrMrOrPr=rQrRr rrr#r$r%rErE8scr*D#*"-GS-16tQS1THh-.T16tQS1Th~.T7 "?r$rEceZdZUeddZeed<eddZeed<eddZeed<eddZ eed<eddZ eed<eddZ eed <y ) rH.rrdebugservice_debug_feature recovery_modegpurocksdbstagingN) rr r!rrTr=r"rUrVrWrXrYr#r$r%rHrHDsi,E4,"'"<4<4M44cr*C*#2.GT.#2.GT.r$rHczeZdZUeddZeded<eddZded<edd Ze ed ed <y) Batch.rrExtendedPointIdidsBatchVectorStructvectorsNr8Payloadpayloads) rr r!rr]rr"r_rar r#r$r%r[r[MsE#("#=C =#("#=G =*/"*MHhtI'Mr$r[c,eZdZUeddZded<y)BinaryQuantization.rrBinaryQuantizationConfigbinaryN)rr r!rrer"r#r$r%rcrcS).s)CF &Cr$rcczeZdZUeddZeeed<eddZeded<eddZ eded <y) rdNrr8 always_ramBinaryQuantizationEncodingencodingzAsymmetric quantization configuration allows a query to have different quantization than stored vectors. It can increase the accuracy of search at the cost of performance.BinaryQuantizationQueryEncodingquery_encoding) rr r!rrhr r=r"rjrlr#r$r%rdrdWsP!&t!DJD7?r$rdceZdZdZdZdZy)rione_bittwo_bitsone_and_half_bitsN)rr r!ONE_BITTWO_BITSONE_AND_HALF_BITSr#r$r%riri`sGH+r$riceZdZdZdZdZdZy)rkr9re scalar4bits scalar8bitsN)rr r!DEFAULTBINARY SCALAR4BITS SCALAR8BITSr#r$r%rkrkfsG FKKr$rkceZdZUdZeddZeeed<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<y ) 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 tokenizerzDefines which language to use for text preprocessing. This parameter is used to construct default stopwords filter and stemmer. To disable language-specific processing, set this to `'language': 'none'`. 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<rr}r r>r"r~rrrrCrr=rrrrr-rr#r$r%r|r|msY{AxAAx %!f GXe_,1Kt+uIx(u#GHhsm!&"^!Ix~%*K%M8D>16E1Ix,-.3u.GX) *$)[$M8C=$)Z$M8C=r$r|cteZdZUeddZded<eddZeeed <edd Z eeed <y) BoolIndexParams.rr BoolIndexTypetypeN1If true, store the index on disk. Default: false.r8on_diskEnable 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=rr#r$r%rrsG!#26D/6#D>qrGXd^r"'W#K$r$rceZdZdZy)rr=N)rr r!BOOLr#r$r%rr Dr$rc6eZdZUdZeddZeded<y)ChangeAliasesOperationz Operation for performing changes of collection aliases. Alias changes are atomic, meaning that no collection modifications can happen between alias operations. .zOperation for performing changes of collection aliases. Alias changes are atomic, meaning that no collection modifications can happen between alias operations.rAliasOperationsactionsN)rr r!r<rrrr"r#r$r%rrs)(- v(GT# $r$rc,eZdZUeddZded<y)ClearPayloadOperation.rrPointsSelector clear_payloadN)rr r!rrr"r#r$r%rrs&+CR&@M#@r$rcheZdZUeddZeed<eddZded<eddZded<y ) ClusterConfigTelemetry.rrgrpc_timeout_msP2pConfigTelemetryp2pConsensusConfigTelemetry consensusN) rr r!rrr-r"rrr#r$r%rrs7 "5OS5 %cr :C :,1#2,FI)Fr$rc2eZdZUeddZeded<y)ClusterStatusOneOf.rr)disabledstatusN)rr r!rrr r"r#r$r%rrs" cr" G #r$rceZdZUdZeddZeded<eddZe ed<edd Z e e d fed <eddZ d ed <eddZded<eddZe e dfed<y)ClusterStatusOneOf1z( Description of enabled cluster .zDescription of enabled clusterr)enabledrID of this peerpeer_idz6Peers composition of the cluster with main informationPeerInfopeersRaftInfo raft_infoConsensusThreadStatusconsensus_thread_statuszConsequent failures of message send operations in consensus by peer address. On the first success to send to that peer - entry is removed from this hashmap.MessageSendErrorsmessage_send_failuresN)rr r!r<rrr r"rr-rrrCrrrr#r$r%rrs c?@ G A*;tY[9\M8Dn!456\).t)LHhtCH~&L).t)LLr$rceZdZUdZeddZeed<eddZeed<eddZ e d ed <edd Z e d ed <eddZ e ded<eddZ ee ded<y)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%rrs*;CD^u>v8D)9$:;vr$rceZdZUdZeddZded<eddZded<eddZd ed <ed d Z e d ed<ed d Z e ded<ed d Z e ded<ed d Z e ded<y )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.r`r)rr r!r<rrr"rrrr rrrr#r$r%rrs"'s8h!iF i %c7g hKh+0Br+s(s(-"R)J%;@"R;"67>C"R>!9:%*~%Hhy!r$rceZdZUeddZded<eddZded<eddZded <eddZd ed <ed d Z e ded<ed d Z e ded<ed d Z e e ed<ed d Ze ded<y )CollectionConfigTelemetry.rrrrrrrrrrNr8rrrruuidz*Arbitrary JSON metadata for the collectionr`r)rr r!rrr"rrrrr rrr rr#r$r%rrs!&s!;F ; %cr :K:+0"+E(E#CR8J 8:?Z\:]"67]=B4]_=`!9:` 2>D(4.>$)$Dp$qHhy!qr$rc,eZdZUeddZeed<y)CollectionDescription.rrrFNrr r!rrFrCr"r#r$r%rrcr*D#*r$rc0eZdZUdZeddZeed<y)CollectionExistencezS State of existence of a collection, true = exists, false = does not exist .zIState of existence of a collection, true = exists, false = does not existrexistsN)rr r!r<rrr=r"r#r$r%rrs*uvFDvr$rcHeZdZUdZeddZded<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<y )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-rrrrrrCrr#r$r%rr%s"'s8p!qF q+0 Q,(5:"F5Hht/01,1u,8C=#(B#L(3-  sNC"'s8p!qF q49#Kd4eND001e05dPc0dL(,-dr$rc\eZdZUeddZeded<eddZeeed<edd Z ed ed <edd Z eeed <eddZ eeed<eddZ eeed<eddZ eeed<eddZeeed<eddZeeedfed<y)rNrr8 VectorsConfigr_z#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_msT#If true - point's payload will not be stored in memory. It will be read from the disk every time it is requested. This setting saves RAM by (slightly) increasing the response time. Note: those payload values that are involved in filtering and are indexed - remain in RAM. Default: trueon_disk_payloadz*Configuration of the sparse vector storagersparse_vectors)rr r!rr_r r"rr-rrrrrrr=r rrCr#r$r%rrAs).t)LGXo &L"'?d"eL(3-e27p3OX./).aEh(i i.3g/hsm*/}*#,1,8C=',z'OXd^AF"NANHT#';";<=r$rceZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z eeed <edd Z ee ed <y) 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 nodesraIf true - point's payload will not be stored in memory. It will be read from the disk every time it is requested. This setting saves RAM by (slightly) increasing the response time. Note: those payload values that are involved in filtering and are indexed - remain in RAM.r) rr r!rrr r-r"rrrrr=r#r$r%r r ^s(-dHk(l l.3"v/hsm*/|*#,1"f,8C=',k'OXd^r$r ceZdZUeddZeed<eddZee ed<eddZ ee ed<eddZ ee ed <y) CollectionSnapshotTelemetry.rridNr8running_snapshotsrunning_snapshot_recoverytotal_snapshot_creations) rr r!rrrCr"rr r-rrr#r$r%r r psUCR(B(',Tr'Jx}J/4Tr/Rx}R.3Db.QhsmQr$r c,eZdZdZdefdZdZdZdZdZ y) rz Current state of the collection. `Green` - all good. `Yellow` - optimization is running, 'Grey' - optimizations are possible but not triggered, `Red` - some operations failed and was not recovered returnc,t|jSNrCvalueselfs r%__str__zCollectionStatus.__str__|4::r$greenyellowgreyredN rr r!r<rCrGREENYELLOWGREYREDr#r$r%rrw) E F D Cr$rc eZdZUeddZeed<eddZee ed<eddZ eded <eddZ ee d ed <eddZ ee d ed <eddZee ded<eddZeeedfed<y)CollectionTelemetry.rrrNr8 init_time_msrrReplicaSetTelemetryshardsr transfersr reshardingShardCleanStatusTelemetryshard_clean_tasks)rr r!rrrCr"r(r r-rr*rr+r,r.rr#r$r%r'r'sCR(B("'""EL(3-E49$TV4WFH0 1W49$TV4WFHT/0 1W5:4UW5XIx012X38SU3VJ./0VJOX\jlJmxS*E%E FGmr$r'c,eZdZUeddZeed<y)r.zWarning messagermessageN)rr r!rr0rCr"r#r$r%rrs*; cr"W#*/s)CKx~&Cr$rQc2eZdZUeddZeded<y)ConsensusThreadStatusOneOf1.rr)stoppedrN)rr r!rrr r"r#r$r%rUrUs" cr"W#r$rUcPeZdZUeddZeded<eddZeed<y)ConsensusThreadStatusOneOf2.rr)stopped_with_errrerrN) rr r!rrr r"rZrCr#r$r%rXrXs5 cr"W#Sb)C)r$rXcJeZdZUeddZded<eddZded<y)ContextExamplePair.rrRecommendExamplepositivenegativeNrr r!rr^r"r_r#r$r%r\r\s&#("#=H =#("#=H =r$r\cJeZdZUeddZded<eddZded<y) ContextPair.rr VectorInputr^r_Nr`r#r$r%rbrbs$#CR8Hm8#CR8Hm8r$rbc,eZdZUeddZded<y) ContextQuery.rr ContextInputcontextN)rr r!rrgr"r#r$r%reres#CR8G^8r$rec~eZdZUdZeddZeded<eddZeded <ed d Z ee ed <y) CountRequestz Count Request Counts the number of points which satisfy the given filter. If filter is not provided, the count of all points in the collection will be returned. NUSpecify in which shards to look for the points, if not specified - look in all shardsr8ShardKeySelector shard_key4Look only for points which satisfies this conditionsFilterfilterTzIf true, count exact number of points. If false, count approximate number of points faster. Approximate count might be unreliable during the indexing process. Default: trueexact) rr r!r<rrlr r"rorpr=r#r$r%riris]/4k/Ix*+"'tAw!xFHX x!CE8D>r$ric,eZdZUeddZeed<y) CountResult.z-Number of points which satisfy the conditionsrcountN)rr r!rrsr-r"r#r$r%rrrrss(WXE3Xr$rrceZdZdZdZdZy) CpuEndianlittlebigotherN)rr r!LITTLEBIGOTHERr#r$r%rurus F C Er$rucNeZdZUdZeddZeed<eddZeed<y) CreateAliaszw Create alternative name for a collection. Collection will be available under both names for search, retrieve, .zmCreate alternative name for a collection. Collection will be available under both names for search, retrieve,rrBrAN) rr r!r<rrBrCr"rAr#r$r%r}r}s?! DOS DJr$r}c,eZdZUeddZded<y)CreateAliasOperation.rrr} create_aliasN)rr r!rrr"r#r$r%rrs"'"ANHT#';";<=8=TWl7m!34m$)~%Hhy!r$rcPeZdZUeddZeed<eddZeded<y) CreateFieldIndex.rr field_nameNr8PayloadFieldSchema field_schema) rr r!rrrCr"rr r#r$r%rr8s+CR0J038SU3VL(/0Vr$rceZdZUeddZded<eddZeeed <edd Z eeed <edd Z ee eed <eddZ eded<y)CreateShardingKey.rrShardKeyrlNz_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!rrlr"rr r-rrrrr#r$r%rr=s!#26Iz6#(u$M8C=).y) &+q&IxS "/4/M8N+r$rc,eZdZUeddZded<y)CreateShardingKeyOperation.rrrcreate_sharding_keyN)rr r!rrr"r#r$r%rrQs/4Sb/I,Ir$rceZdZdZdZdZy)Datatypefloat32uint8float16N)rr r!FLOAT32UINT8FLOAT16r#r$r%rrUsG EGr$rc,eZdZUeddZeed<y)DatetimeExpression.rrrN)rr r!rrrCr"r#r$r%rr[s#2.Hc.r$rceZdZUeddZded<eddZeeed <edd Z eeed <edd Z eeed <y)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_principalrrrr rr r!rrr"rr r=rrr#r$r%rr_sh %cr :D :#(j$L(4.$D>qrGXd^r"'W#K$r$rceZdZdZy)rrN)rr r!DATETIMEr#r$r%rrlHr$rc,eZdZUeddZeed<y)DatetimeKeyExpression.rr datetime_keyN)rr r!rrrCr"r#r$r%rrpscr2L#2r$rceZdZUdZeddZeeee fe d<eddZ eeee fe d<eddZ eeee fe d <edd Z eeee fe d <y) DatetimeRange Range filter request Npoint.key < range.ltr8ltpoint.key > range.gtgtpoint.key >= range.gtegtepoint.key <= range.ltelte)rr r!r<rrr r rrr"rrrr#r$r%rrts+0Jc*dBx~&'d*/Jc*dBx~&'d+0Kf+gC%$' (g+0Kf+gC%$' (gr$rceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <y)DecayParamsExpression.rrr3xNz7The target value to start decaying from. Defaults to 0.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%rrslCR0A|0%*"[&FH\ "#zE8E?!&T!Hhuor$rc0eZdZUdZeddZeed<y) DeleteAlias Delete alias if exists .Delete alias if existsrrAN)rr r!r<rrArCr"r#r$r%rrsC-EFJFr$rc0eZdZUdZeddZded<y)DeleteAliasOperationr.rrr delete_aliasN)rr r!r<rrr"r#r$r%rrs#(9Q"RL-Rr$rc,eZdZUeddZded<y)DeleteOperation.rrrdeleteN)rr r!rrr"r#r$r%rrs$Sb9F 9r$rceZdZUdZeddZeeed<eddZ e ed ed <edd Z e d ed <eddZ e ded<y) DeletePayloadY This data structure is used in API interface and applied across multiple shards .z+List of payload keys to remove from payloadrkeysN+Deletes values from each point in this listr8r\points=Deletes values from points that satisfy this filter conditionrnroOThis data structure is used in API interface and applied across multiple shardsrkrl) rr r!r<rrrrCr"rr rorlr#r$r%rrs~C-Z[D$s)[05"O1FHT+, -"'"a"FHX /4"s/Ix*+r$rc,eZdZUeddZded<y)DeletePayloadOperation.rrrdelete_payloadN)rr r!rrr"r#r$r%rr&+CR&@NO@r$rceZdZUeddZeeded<eddZeded<ed d Z ee ed <edd Z eded<y) DeleteVectorsNrr8r\rrrnro.z Vector namesrvectorrrkrl) rr r!rrr rr"rorrCrlr#r$r%rrsp05"O1FHT+, -"'"a"FHX c~>FDI>.3Db.QIx*+Qr$rc,eZdZUeddZded<y)DeleteVectorsOperation.rrrdelete_vectorsN)rr r!rrr"r#r$r%rrrr$rceZdZdZdZy) DirectionascdescN)rr r!ASCDESCr#r$r%rrs C Dr$rceZdZdZy)DisabledN)rr r!DISABLEDr#r$r%rrrr$rcZeZdZUeddZded<eddZeeddfed<y ) DiscoverInput.rrrcrz:Search space will be constrained by these pairs of vectorsrbrgN) rr r!rrr"rgr rr#r$r%rrs9!#26FM69> U:GU4 & 5 6r$rc,eZdZUeddZded<y) DiscoverQuery.rrrdiscoverN)rr r!rrr"r#r$r%rrs %cr :Ho:r$rceZdZUdZeddZeded<eddZeded <edd Z ee d ed <edd Z eded<eddZ eded<eddZ eed<eddZeeed<eddZeded<eddZeded<eddZed ed!<edd"Zed#ed$<y)%DiscoverRequestz_ Use context and a target to find the most similar points, constrained by the context. Nrjr8rkrlzLook for vectors closest to this. When using the target (with or without context), the integer part of the score represents the rank with respect to the context, while the decimal part of the score relates to the distance to the target.r]raPairs of { positive, negative } examples to constrain the search. When using only the context (without a target), a special search - called context search - is performed where pairs of points are used to generate a loss that guides the search towards the zone where most positive examples overlap. This means that the score minimizes the scenario of finding a point closer to a negative than to a positive part of a pair. Since the score of a context relates to loss, the maximum score a point can get is 0.0, and it becomes normal that many points can have a score of 0.0. For discovery search (when including a target), the context part of the score for each pair is calculated +1 if the point is closer to a positive than to a negative part of a pair, and -1 otherwise.r\rgrmrnroAdditional search params SearchParamsr.Max number of result to returnrlimit~Offset of the first result to return. May be used to paginate results. Note: large offset values may cause performance issues.offsetCSelect which payload to return with the response. Default is false.WithPayloadInterface with_payloadPOptions for specifying which vectors to include into response. Default is false. WithVector with_vector[Define which vector to use for recommendation, if not specified - try to use default vector UsingVectorusingThe location used to lookup vectors. If not specified - use current collection. Note: the other collection should have the same vector size as the current collectionLookupLocation lookup_from)rr r!r<rrlr r"rrgrrorrr-rrrrrr#r$r%rrsL/4k/Ix*+,1D,FH' (5:^ 5GXd/0 1"'tAw!xFHX x',TGa'bFH^ $bs(HIE3I!UFHSM6;"g6L(12+0"t+K,'&+q&E8M "/4|/K*+r$rc2eZdZUeddZeded<y)DiscoverRequestBatch.rrrsearchesNrr r!rrrr"r#r$r%rrs(-cr(BHd$%Br$rc,eZdZdZdefdZdZdZdZdZ y) Distancezc Type of internal tags, build from payload Distance function types used to compare vectors rc,t|jSrrrs r%rzDistance.__str__ rr$CosineEuclidDot ManhattanN) rr r!r<rCrCOSINEEUCLIDDOT MANHATTANr#r$r%rrs)F F CIr$rcxeZdZUeddZeed<eddZee ed<eddZ e e dfed <y) DistributedClusterTelemetry.rrrNr8rDistributedPeerInfor) rr r!rrr=r"rr r-rrrCr#r$r%r r sD#2.GT.%*4R%HOXc]H.3CR.HE4** +Hr$r ceZdZUeddZeed<eddZee ded <edd Z ee d ed <edd Z ee ded<y)DistributedCollectionTelemetry.zCollection namerrNzShards topologyr8DistributedShardTelemetryr*zOngoing resharding operationsr reshardingszOngoing shard transfersrr) rr r!rrrCr"r*r rrrr#r$r%rrskC%67B7:?Zk:lFHT56 7l49$Ts4tK$/01t;@[t;uOXd#678ur$rceZdZUeddZeed<eddZeded <edd Z e ed <edd Z e ed <eddZ e ed<eddZe ed<eddZded<y)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!s*:;GS;"'B_"`D(; `3,\]Hd]c7D#7)ABFCB"'9i"jCj76&+Dn&UFH] #U,1$Ld,eHSMe(-dHi(j j).tIk)l#l %d@^ _J _!&tA`!aK#a49"I5$sCx.1DIMD8$?@>C">>h9:r$rcteZdZUeddZeed<eddZeded <edd Z e d ed <y) r.zShard IDrrNzOptional shard keyr8rkeyzReplica informationrreplicas) rr r!rrr-r"r'r r(rr#r$r%rrHsBCZ0B0 %d@T UC* U49#K`4aHd01ar$rcZeZdZUeddZeedfed<eddZe ded <y) DistributedTelemetryData.rrrr9Nr8r cluster) rr r!rr9rrCr"r+r r#r$r%r*r*Ns7?DSVX?YKc;;<Y7r#r$r%r.r.Ws9s3D,34E<4',Tr'JOXe_Jr$r.creZdZUdZeddZeed<eddZeed<edd Z e d ed <y) 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<rr7rCr"r9r;r r#r$r%r6r6]s[ jD# tE3,1N,GX' (r$r6c,eZdZUeddZded<y)DropReplicaOperation.rrReplica drop_replicaN)rr r!rr?r"r#r$r%r=r=os#CR8L)8r$r=c,eZdZUeddZded<y)DropShardingKey.rrrrlN)rr r!rrlr"r#r$r%rArAss!#26Iz6r$rAc,eZdZUeddZded<y)DropShardingKeyOperation.rrrAdrop_sharding_keyN)rr r!rrDr"r#r$r%rCrCws+0"+E(Er$rCczeZdZUeddZeeed<eddZeded<eddZ ee ed<y) ErrorResponseN"Time spent to process this requestr8timerErrorResponseStatusrresult) rr r!rrHr r>r"rrJrr#r$r%rFrF{sD!$<`aD(5/a.3Db.QFH* +Q!$B?FHSM?r$rFc2eZdZUeddZeeed<y)rINz"Description of the occurred error.r8error)rr r!rrLr rCr"r#r$r%rIrIs ;_`E8C=`r$rIc,eZdZUeddZded<y)ExpDecayExpression.rrr exp_decayN)rr r!rrOr"r#r$r%rNrN).s)CI&Cr$rNc,eZdZUeddZded<y) ExpExpression.rrr3expN)rr r!rrSr"r#r$r%rRrRr5r$rRceZdZUeddZeded<eddZeed <edd Z ee ed <edd Z ed ed<eddZ ee ed<y) FacetRequestNrr8rkrl.z Payload key to use for faceting.rr'z,Max number of hits to return. Default is 10.rzGFilter conditions - only consider points that satisfy these conditions.rnrozaWhether to do a more expensive exact count for each of the values in the facet. Default is false.rp)rr r!rrlr r"r'rCrr-rorpr=r#r$r%rUrUsz.3Db.QIx*+QS&HICI ;ijE8C=j!&"k"FHX "wE8D>r$rUc2eZdZUeddZeded<y) FacetResponse.rr FacetValueHithitsN)rr r!rrYrr"r#r$r%rWrWs"'"r#r$r%riris$"3B7G]7"-E5-r$ricPeZdZUdZeddZeed<eddZe d ed <edd Z e d ed <eddZ e ded<eddZ e ded<eddZ e ded<eddZe ded<eddZe eed<eddZe eed<y)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"ror rqrsrurwryrzr=r{r#r$r%rmrmsSm4C4$T?lmE8G m(-dHu(vE8$ %v38"T4h/0).dHu(vJ%v*/"P+K,'-2$Lq,rL(=)r$"r Hhtn$"pGXd^r$rmceZdZUeddZeeeddfed<eddZ eded<edd Z eeeddfed <edd Z eeeddfed <y) rnNz-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!rr~r r rr"rrrr#r$r%rnrns>C"Q?FHU4 ,k9: ;)."\)J%=B$\wqrGXd^r"'W#K$r$rceZdZdZy)rr>N)rr r!FLOATr#r$r%rr s Er$rcZeZdZUeddZded<eidZeee e fed<y) FormulaQuery.rrr3formular8defaultsN) rr r!rrr"rr rrCrr#r$r%rrs1!#26G\6).rr)JHhtCH~&Jr$rc$eZdZdZdefdZdZdZy)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 rc,t|jSrrrs r%rzFusion.__str__rr$rrfdbsfN)rr r!r<rCrRRFDBSFr#r$r%rrs C Dr$rc,eZdZUeddZded<y) FusionQuery.rrrfusionN)rr r!rrr"r#r$r%rr"Sb1FH1r$rc,eZdZUeddZded<y)GaussDecayExpression.rrr gauss_decayN)rr r!rrr"r#r$r%rr&s+0"+EK(Er$rcNeZdZUdZeddZded<eddZded<y) rrz 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%rrrr*s?! PHj % P L*r$rrc,eZdZUeddZded<y) GeoDistance.rrGeoDistanceParams geo_distanceN)rr r!rrr"r#r$r%rr9s(-cr(BL%Br$rcJeZdZUeddZded<eddZeed<y) r.rrroriginz,Payload field with the destination geo pointtoN)rr r!rrr"rrCr#r$r%rr=s%s3FJ3C%STBTr$rcteZdZUeddZded<eddZeeed <edd Z eeed <y) GeoIndexParams.rr GeoIndexTyperNrr8rrrrr#r$r%rrBsG "5D.5#D>qrGXd^r"'W#K$r$rceZdZdZy)rgeoN)rr r!GEOr#r$r%rrKs Cr$rc6eZdZUdZeddZeded<y) GeoLineStringz= Ordered sequence of GeoPoints representing the line .z3Ordered sequence of GeoPoints representing the linerrrN)rr r!r<rrrr"r#r$r%rrOs  %S6klFD lr$rcNeZdZUdZeddZeed<eddZeed<y)rz" Geo point payload schema .zGeo point payload schemarlonlatN) rr r!r<rrr>r"rr#r$r%rrWs-s(BCCCs(BCCCr$rcZeZdZUdZeddZded<edd Zee ded <y) rvzk 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%rvrv`sF!& w!Ho27{2Ix_-.r$rvcNeZdZUdZeddZded<eddZeed<y ) rtzt 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%rtrtos7 AFJ#+IJFEJr$rtc,eZdZUeddZeed<y)GpuDeviceTelemetry.rrrFNrr#r$r%rr{rr$rc2eZdZUeddZeded<y) GroupsResult.rr PointGroupgroupsN)rr r!rrrr"r#r$r%rrs!&s!;FD ;r$rc@eZdZUeddZeeeedffed<y) GrpcTelemetry.rrOperationDurationStatistics responsesNrr r!rrrrCr"r#r$r%rr)EJ3\^E_ItCc#@@AAB_r$rc6eZdZUeddZeedfed<y)HardwareTelemetry.rr HardwareUsagecollection_dataN)rr r!rrrrCr"r#r$r%rrs272LOT#./Lr$rceZdZUdZeddZeed<eddZeed<eddZ eed<eddZ eed<eddZ eed <eddZ eed <eddZ eed <y ) 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%rrsS&efCf 2qrOSr!#3rscs!&s8w!x3x"' X#C 1pqNCq 2qrOSrr$rc6eZdZUdZeddZeded<y)HasIdConditionz& ID-based filtering condition .zID-based filtering conditionrr\has_idN)rr r!r<rrrr"r#r$r%rrs!',C=[&\FD" #\r$rc0eZdZUdZeddZeed<y)HasVectorConditionz; Filter points which have specific vector assigned .z1Filter points which have specific vector assignedr has_vectorN)rr r!r<rrrCr"r#r$r%rrsC-`aJar$rceZdZUdZeddZeed<eddZeed<eddZ eed <ed d Z e eed <edd Z e e ed<edd Ze eed<edd Ze e ed<y)rz Config of HNSW index .nNumber of edges per node in the index graph. Larger the value - more accurate the search, more space required.rmzNumber of neighbours to consider during the index building. Larger the value - more accurate the search, more time required to build index. ef_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_threadsNzVStore HNSW index on disk. If set to false, index will be stored in RAM. Default: falserzZCustom 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=rrr#r$r%rrs EAs bL# % f +0M+(3-$lGXd^ %p Ix}&+r&NHTNr$rc eZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z eeed <edd Z ee ed <edd Z eeed<eddZee ed<y)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.rzZStore HNSW index on disk. If set to false, the index will be stored in RAM. Default: falserz[Custom M param for additional payload-aware HNSW links. If not set, default M will be used.rrr)rr r!rrr r-r"rrrrr=rrr#r$r%rrsEAx}#(f#L(3-*/f*#+0E+(3-$pGXd^ %q Ix}&+r&NHTNr$rc2eZdZUeddZeeed<y)rLg333333?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%rLrLs!).]*xr$rLc|eZdZUdZeddZeed<eddZe ed<edd Z e e e efed <y) Imagez~ WARN: Work-in-progress, unimplemented Image object for embedding. Requires inference infrastructure, unimplemented. .z*Image data: base64 encoded image or an URLrimager8r9NDParameters for the model Values of the parameters are model-specificr8r;) rr r!r<rrrr"r9rCr;r rr#r$r%rrsXs(TUE3U tE3)."h)GXd38n %r$rcTeZdZUdZeddZeded<eddZe ed<y) IndexesOneOfz Do not use any index, scan whole vector collection during search. Guarantee 100% precision, but may be time consuming on large collections. .zDo not use any index, scan whole vector collection during search. Guarantee 100% precision, but may be time consuming on large collections.r)plainrr;N) rr r!r<rrr r"r;rr#r$r%rrsD$ bD'(  bGSr$rcTeZdZUdZeddZeded<eddZded<y ) IndexesOneOf1z Use filterable HNSW index for approximate search. Is very fast even on a very huge collections, but require additional space to store index and additional time to build it. .zUse filterable HNSW index for approximate search. Is very fast even on a very huge collections, but require additional space to store index and additional time to build it.r)hnswrrr;N) rr r!r<rrr r"r;r#r$r%rrsD# CD'' " CG\r$rc|eZdZUdZeddZeed<eddZe ed<edd Z e e e efed <y) InferenceObjectz WARN: Work-in-progress, unimplemented Custom object for embedding. Requires inference infrastructure, unimplemented. .zxArbitrary data, used as input for the embedding model. Used if the model requires more than one input or a custom input.robjectr8r9Nrr8r;) rr r!r<rrrr"r9rCr;r rr#r$r%rr!sb OFC tE3)."h)GXd38n %r$rc6eZdZUeddZeedfed<y)InferenceUsage.rr ModelUsagemodelsN)rr r!rrrrCr"r#r$r%rr3s&+CR&@FDl" #@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse200Nrr8UsageusagerGrHrShardKeysResponserJ rr r!rrr r"rHr>rrCrJr#r$r%rr7sZ$TrBE8G B!$<`aD(5/a!$B?FHSM?,1$B,OFH( )Or$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee ed <y) InlineResponse2001Nrr8rrrGrHrrJ) rr r!rrr r"rHr>rrCrJr=r#r$r%rr>sX$TrBE8G B!$<`aD(5/a!$B?FHSM?"4R@FHTN@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20010Nrr8rrrGrHrOptimizationsResponserJrr#r$r%rrE[$TrBE8G B!$<`aD(5/a!$B?FHSM?05dPR0SFH, -Sr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20011Nrr8rrrGrHrr5rJrr#r$r%rrLs[$TrBE8G B!$<`aD(5/a!$B?FHSM?5:4UW5XFH1 2Xr$rczeZdZUeddZeeed<eddZee ed<eddZ ee ed<y)InlineResponse20012NrGr8rHrrrJ) rr r!rrHr r>r"rrCrJr=r#r$r%rrSsB!$<`aD(5/a!$B?FHSM?"4R@FHTN@r$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20013Nrr8rrrGrHrSnapshotDescriptionrJ rr r!rrr r"rHr>rrCrJrr#r$r%rrYs`$TrBE8G B!$<`aD(5/a!$B?FHSM?49$TV4WFHT/0 1Wr$rczeZdZUeddZeeed<eddZee ed<eddZ eded<y) InlineResponse20014NrGr8rHrrrrJ) rr r!rrHr r>r"rrCrJr#r$r%r r `sD!$<`aD(5/a!$B?FHSM?.3Db.QFH* +Qr$r ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20015Nrr8rrrGrHrRecordrJrr#r$r%r r fsY$TrBE8G B!$<`aD(5/a!$B?FHSM?!&t!DFHX Dr$r ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20016Nrr8rrrGrHrrrJr r#r$r%rrms]$TrBE8G B!$<`aD(5/a!$B?FHSM?',Tr'JFHT(^ $Jr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20017Nrr8rrrGrHr UpdateResultrJr r#r$r%rrts^$TrBE8G B!$<`aD(5/a!$B?FHSM?-24R-PFHT.) *Pr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20018Nrr8rrrGrHr ScrollResultrJrr#r$r%rr{Y$TrBE8G B!$<`aD(5/a!$B?FHSM?',Tr'JFH^ $Jr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20019Nrr8rrrGrHr ScoredPointrJr r#r$r%rrs^$TrBE8G B!$<`aD(5/a!$B?FHSM?,1$B,OFHT-( )Or$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2002Nrr8rrrGrHr TelemetryDatarJrr#r$r%rrY$TrBE8G B!$<`aD(5/a!$B?FHSM?(-d(KFH_ %Kr$rceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee e d ed <y) InlineResponse20020Nrr8rrrGrHrrrJr r#r$r%r r sd$TrBE8G B!$<`aD(5/a!$B?FHSM?27RT2UFHT$}-. /Ur$r ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20021Nrr8rrrGrHrrrJrr#r$r%r"r"rr$r"ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20022Nrr8rrrGrHrrrrJrr#r$r%r$r$sY$TrBE8G B!$<`aD(5/a!$B?FHSM?&+Db&IFH] #Ir$r$ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20023Nrr8rrrGrHrrWrJrr#r$r%r&r&rr$r&ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20024Nrr8rrrGrHr QueryResponserJrr#r$r%r(r(rr$r(ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ee d ed <y) InlineResponse20025Nrr8rrrGrHrr)rJr r#r$r%r+r+s^$TrBE8G B!$<`aD(5/a!$B?FHSM?.3Db.QFHT/* +Qr$r+ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20026Nrr8rrrGrHrSearchMatrixPairsResponserJrr#r$r%r-r-s[$TrBE8G B!$<`aD(5/a!$B?FHSM?49$TV4WFH0 1Wr$r-ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse20027Nrr8rrrGrHrSearchMatrixOffsetsResponserJrr#r$r%r0r0s[$TrBE8G B!$<`aD(5/a!$B?FHSM?6;DVX6YFH2 3Yr$r0ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2003Nrr8rrrGrHr ClusterStatusrJrr#r$r%r3r3rr$r3ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2004Nrr8rrrGrHrr*rJrr#r$r%r6r6s[$TrBE8G B!$<`aD(5/a!$B?FHSM?38SU3VFH/ 0Vr$r6ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2005Nrr8rrrGrHrr8rJrr#r$r%r8r8Z$TrBE8G B!$<`aD(5/a!$B?FHSM?.3Db.QFH* +Qr$r8ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2006Nrr8rrrGrHrrrJrr#r$r%r;r;sZ$TrBE8G B!$<`aD(5/a!$B?FHSM?).t)LFH% &Lr$r;ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2007Nrr8rrrGrHrrrJrr#r$r%r=r=rr$r=ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2008Nrr8rrrGrHrrrJrr#r$r%r?r?r9r$r?ceZdZUeddZeded<eddZeeed<eddZ ee ed<eddZ ed ed <y) InlineResponse2009Nrr8rrrGrHrrrJrr#r$r%rArArr$rAcVeZdZUeddZeeed<eddZee ed<y)InlineResponse202NrGr8rHrr) rr r!rrHr r>r"rrCr#r$r%rCrCs-!$<`aD(5/a!$B?FHSM?r$rCceZdZUeddZded<eddZeeed <edd Z eeed <edd Z eeed <eddZ eeed<eddZ eeed<y)IntegerIndexParams.rrIntegerIndexTyperNz2If true - support direct lookups. Default is true.r8lookupz2If true - support ranges filters. Default is true.rqzIf 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.rzCIf true, store the index on disk. Default: false. Default is false.rrr) rr r!rrr"rGr r=rqrrrr#r$r%rErEs$Sb9D 9"4=qrFHTNr!$q#(|$L(4.$"gGXd^#(W#K$r$rEceZdZdZy)rFintegerN)rr r!INTEGERr#r$r%rFrFGr$rFc0eZdZUdZeddZded<y)IsEmptyConditionz@ Select points with empty payload for a specified field .z6Select points with empty payload for a specified fieldr PayloadFieldrzN)rr r!r<rrzr"r#r$r%rMrMs %S6noHnor$rMc0eZdZUdZeddZded<y)IsNullConditionz? Select points with null payload for a specified field .z5Select points with null payload for a specified fieldrrNr{N)rr r!r<rr{r"r#r$r%rPrPs$C5lmG^mr$rPceZdZUeddZded<eddZeeed <edd Z eeed <edd Z eeed <y)KeywordIndexParams.rrKeywordIndexTyperNz7If true - used for tenant optimization. Default: false.r8 is_tenantrrrr rr r!rrr"rTr r=rrr#r$r%rRrR#se$Sb9D 9 %"[!Ix~$D>qrGXd^r"'W#K$r$rRceZdZdZy)rSkeywordN)rr r!KEYWORDr#r$r%rSrS/rKr$rSceZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZ y) Languagearabic azerbaijanibasquebengalicatalanchinesedanishdutchenglishfinnishfrenchgermangreekhebrewhinglish hungarian indonesianitalianjapanesekazakhnepali norwegian portugueseromanianrussianslovenespanishswedishtajikturkishN)!rr r!ARABIC AZERBAIJANIBASQUEBENGALICATALANCHINESEDANISHDUTCHENGLISHFINNISHFRENCHGERMANGREEKHEBREWHINGLISH HUNGARIAN INDONESIANITALIANJAPANESEKAZAKHNEPALI NORWEGIAN PORTUGUESEROMANIANRUSSIANSLOVENESPANISHSWEDISHTAJIKTURKISHr#r$r%rZrZ3s FK FGGG F EGG F F E FHIJGH F FIJHGGGG EGr$rZc,eZdZUeddZded<y)LinDecayExpression.rrr lin_decayN)rr r!rrr"r#r$r%rrTrPr$rc,eZdZUeddZded<y) LnExpression.rrr3lnN)rr r!rrr"r#r$r%rrXsSb1B 1r$rceZdZUeddZeed<eddZeded <edd Z eed <edd Z d ed<y)r.zLocal shard idrr*NUser-defined sharding keyr8rrlzNumber of points in the shardrrrr) rr r!rr*r-r"rlr rrr#r$r%rr\sN#+;6r$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<y)LocalShardTelemetryNrr8 variant_namerr.z6Total number of optimized points since the last start.rryAn ESTIMATION of effective amount of bytes used for vectors Do NOT rely on this number unless you know what you are doingrz~An estimation of the effective amount of bytes used for payloads Do NOT rely on this number unless you know what you are doingrzqSum 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"rrr-rrr r!r"rrrrrr=rrr#r$r%rrcsn"'""EL(3-E&+Db&IFH] #I"'9q"rCr(-P) */U*#!&H!J "'["K#5:x5$sCx.149SU3VHht./0V49$TV4WM801W#(2#FL(4.F>CD^`>a!8DcN#;a5:4Uj5kL(12kr$rc,eZdZUeddZded<y)Log10Expression.rrr3log10N)rr r!rrr"r#r$r%rrs4E<4r$rcxeZdZUdZeddZeed<eddZe eed <edd Z e d ed <y) rzj Defines a location to use for looking up the vector. Specifies collection and vector field name. .z&Name of the collection used for lookupr collectionNzpOptional name of the vector field within the collection. If not provided, the default vector field will be used.r8rrjrkrl) rr r!r<rrrCr"rr rlr#r$r%rrsXC-UVJV!GFHSM/4k/Ix*+r$rc0eZdZUdZeddZded<y)MatchAnyz0 Exact match on any of the given values .z&Exact match on any of the given valuesr AnyVariantsanyN)rr r!r<rrr"r#r$r%rrss0XYCYr$rc2eZdZUdZedddZded<y) MatchExceptzJ Should have at least one value not matching the any given values .z@Should have at least one value not matching the any given valuesexceptraliasrexcept_N)rr r!r<rrr"r#r$r%rrs## [ckG]r$rc0eZdZUdZeddZeed<y) MatchPhrasez/ Full-text phrase match of the string. .z%Full-text phrase match of the string.rphraseN)rr r!r<rrrCr"r#r$r%rrs)PQFCQr$rc0eZdZUdZeddZeed<y) MatchTextz) Full-text match of the strings. .zFull-text match of the strings.rr7N)rr r!r<rr7rCr"r#r$r%rrsc'HID#Ir$rc0eZdZUdZeddZeed<y) 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%rrs#+abHcbr$rc0eZdZUdZeddZded<y) MatchValuez( Exact match of the given value .zExact match of the given valuer ValueVariantsrN)rr r!r<rrr"r#r$r%rrs#34TUE?Ur$rceZdZdZy)MaxOptimizationThreadsSettingautoN)rr r!AUTOr#r$r%rrrr$rceZdZUeddZeed<eddZeed<eddZeed<edd Z eed <edd Z eed <y )MemoryTelemetry.zBTotal number of bytes in active pages allocated by the applicationr active_bytesz2Total number of bytes allocated by the applicationallocated_bytesz+Total number of bytes dedicated to metadatametadata_bytesz@Maximum number of bytes in physically resident data pages mappedresident_bytesz0Total number of bytes in virtual memory mappingsretained_bytesN) rr r!rrr-r"rrrrr#r$r%rrs\c/stL#t 2fgOSg1^_NC_1stNCt1cdNCdr$rceZdZUdZeddZeed<eddZe e ed<edd Z e e e efed <y) rz5 Message send failures for a particular peer .z+Message send failures for a particular peerrrsNr8 latest_errorzTimestamp of the latest errorlatest_error_timestamp)rr r!r<rrsr-r"rr rCrr rrr#r$r%rrsWs(UVE3V"'Bo"pL(3-p>C"A?HU8T>%:;r$rcPeZdZUeddZeded<eddZeed<y)r.rrr} conditions min_countN) rr r!rrrr"rr-r#r$r%rrs)$)#2$>J[!>3B/Is/r$rcZeZdZUdZeddZeeed<eddZ ee ed<y)MmrzO Maximal Marginal Relevance (MMR) algorithm for re-ranking the points. Na!Tunable parameter for the MMR algorithm. Determines the balance between diversity and relevance. A higher value favors diversity (dissimilarity to selected results), while a lower value favors relevance (similarity to the query vector). Must be in the range [0, 1]. Default value is 0.5.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"rr-r#r$r%rrsH"'x"Ix',A'hsmr$rc,eZdZUeddZeed<y)r.rrtokensN)rr r!rrr-r"r#r$r%rr,FC,r$rc$eZdZdZdefdZdZdZy)Modifierz If used, include weight modification, which will be applied to sparse vectors at query time: None - no modification (default) Idf - inverse document frequency, based on statistics of the collection rc,t|jSrrrs r%rzModifier.__str__rr$noneidfN)rr r!r<rCrNONEIDFr#r$r%rrs D Cr$rceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <y) MoveShard.rrr*r+r,N:Method for transferring the shard from one node to anotherr8ShardTransferMethodmethod rr r!rr*r-r"r+r,rr r#r$r%rrR#2.Hc.CR0J0cr2L#2.3"^/FH* +r$rc,eZdZUeddZded<y)MoveShardOperation.rrr move_shardN)rr r!rrr"r#r$r%rr s#CR8J 8r$rc2eZdZUeddZeded<y)MultExpression.rrr3multN)rr r!rrrr"r#r$r%rrs$Sb9D$| 9r$rceZdZdZy)MultiVectorComparatormax_simN)rr r!MAX_SIMr#r$r%rrrKr$rc,eZdZUeddZded<y)MultiVectorConfig.rrr comparatorN)rr r!rrr"r#r$r%rrs*/*DJ'Dr$rc,eZdZUeddZded<y)NaiveFeedbackStrategy.rrNaiveFeedbackStrategyParamsnaiveN)rr r!rrr"r#r$r%rrs+0"+EE (Er$rcheZdZUeddZeed<eddZeed<eddZeed<y)r.rrar~cN) rr r!rrr>r"r~rr#r$r%rr!s5Sb)Au)Sb)Au)Sb)Au)r$rcNeZdZUdZeddZeed<eddZded<y ) NamedSparseVectorz& Sparse vector data with name .Name of vector datarrFzSparse vector data with name SparseVectorrN) rr r!r<rrFrCr"rr#r$r%rr's-c'<=D#="34RSFNSr$rcTeZdZUdZeddZeed<eddZe e ed<y) NamedVectorz% Dense vector data with name .rrrFz Vector datarN) rr r!r<rrFrCr"rrr>r#r$r%rr0s0c'<=D#=?FDK?r$rcPeZdZUeddZded<eddZed ed <y) NearestQuery.rrrcnearestNz|Perform MMR (Maximal Marginal Relevance) reranking after search, using the same vector in this query to calculate relevance.r8rmmr)rr r!rrr"rr r#r$r%rr9s1"3B7G]7 SC%r$rc,eZdZUeddZded<y) NegExpression.rrr3negN)rr r!rr r"r#r$r%r r Ar5r$r cNeZdZUdZeddZeed<eddZded<y) NestedzA Select points with payload for a specified nested field .z7Select points with payload for a specified nested fieldrr'rnroN) rr r!r<rr'rCr"ror#r$r%r r Es-S&_`C`S.ghFHhr$r c,eZdZUeddZded<y)NestedCondition.rrr nestedN)rr r!rrr"r#r$r%rrNrr$rceZdZUeddZeed<eddZeeed<eddZ ee ed <edd Z ee ed <edd Z ee ed <eddZ eeed<eddZeeeefed<y)r.rrrsNr8 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!rrsr-r"rr rr>rrrrr rrr#r$r%rrRss+E3+ %d CJ C+0"s,%,1"g,%,1"g,%,1"Y,8C=723Yr$rceZdZUeddZeed<eddZeed<eddZ ded <edd Z e d ed <eddZ d ed<y) 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"rrCrrrrr#r$r%rrdst XD$3,efIsf#CR8FO805 S1Hd,- %Sb9Hn9r$rcJeZdZUeddZeed<eddZeed<y)r.z!Unique identifier of the segment.rrz,Number of non-deleted points in the segment.rN) rr r!rrr r"rr-r#r$r%rrrs&s(KLD$Lc/]^L#^r$rceZdZUdZeddZded<eddZeded <ed d Z e ed ed<ed d Z e eded<ed d Z e eded<y )rz3 Optimizations progress for the collection .z)Optimizations progress for the collectionrOptimizationsSummarysummaryz Currently running optimizations.rrunningNzEAn 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`.r idle_segments) rr r!r<rr!r"r"rr$r r%r&r#r$r%rrws',C=h&iG #i$)#;]$^GT. !^49"i5FHT/0 116k1Ix^,-@E"r@M8D!:;<r$rceZdZUeddZeed<eddZeed<eddZeed<edd Z eed <y ) r .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.r&N) rr r!rr(r-r"r)r*r&r#r$r%r r sU % d!#!2`aOSas0hiM3is0jkM3kr$r cteZdZUeddZded<eddZded<edd Zee d ed <y) r.rrrrrrNr8TrackerTelemetrylog) rr r!rrr"rr-r rr#r$r%rrsB!&s!;F ;38"3MM0M.3Db.QC$)* +Qr$rc:eZdZUeddZeed<eddZeed<eddZ eed<ed d Z e eed <ed d Z e eed<ed d Z e eed<eddZeed<ed d Ze eed<ed d Ze eed<y )r.^The minimal fraction of deleted vectors in a segment, required to perform segment optimizationrdeleted_thresholdTThe minimal number of vectors in a segment, required to perform segment optimizationvacuum_min_vector_numberaTarget amount of segments optimizer will try to keep. Real amount of segments may vary depending on multiple parameters: - Amount of stored points - Current write RPS It is recommended to select default number of segments as a factor of the number of search threads, so that each segment would be handled evenly by one of the threads. If `default_segment_number = 0`, will be automatically selected by the number of available CPUs.default_segment_numberNaDo not create segments larger this size (in kilobytes). Large segments might require disproportionately long indexation times, therefore it makes sense to limit the size of segments. If indexing speed is more important - make this parameter lower. If search speed is more important - make this parameter higher. Note: 1Kb = 1 vector of size 256 If not set, will be automatically selected considering the number of available CPUs.r8max_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 this option is set, service will try to prevent creation of large unoptimized segments. When enabled, updates may be blocked at request level if there are unoptimized segments larger than indexing threshold. Updates will be resumed when optimization is completed and segments are optimized below the threshold. Using this option may lead to increased delay between submitting an update and its application. Default is disabled.prevent_unoptimized)rr r!rr0r>r"r2r-r3r4r r5r6r8r9r;r=r#r$r%rrs $ t u%* o%c#( G#C',E'hsm',S'hsm).X) $C5_``.3/hsm+0E+$r$rcReZdZUeddZeeed<eddZee ed<eddZ ee ed<edd Z ee ed <edd Z ee ed <edd Z ee ed<eddZee ed<eddZeded<eddZeeed<y)rNr/r8r0r1r2aTarget 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 CPUsr3aeDo 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 256r4aeMaximum 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.0r5aDMaximum 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.r6r7r8a4Max 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.MaxOptimizationThreadsr9r:r;)rr r!rr0r r>r"r2r-r3r4r5r6r8r9r;r=r#r$r%rrs).t*x/4"x/hsm-2E-HSM',|'hsm',|'hsm).[) ).dHr(s sCHKDh'?@+0E+$r$rc eZdZdZdefdZdZy)OptimizersStatusOneOfz. Optimizers are reporting as expected rc,t|jSrrrs r%rzOptimizersStatusOneOf.__str__rr$okN)rr r!r<rCrOKr#r$r%r?r?s Br$r?c0eZdZUdZeddZeed<y)OptimizersStatusOneOf1z2 Something wrong happened with optimizers .z(Something wrong happened with optimizersrrLN)rr r!r<rrLrCr"r#r$r%rDrDss(RSE3Sr$rDcteZdZUeddZeed<eddZeded <edd Z ed ed <y) 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"rGr rIr#r$r%rFrFsQS&?@C@',"a(Ix $).D)J%r$rFc,eZdZUeddZded<y) OrderByQuery.rrOrderByInterfaceorder_byN)rr r!rrMr"r#r$r%rKrKs#("#=H =r$rKc,eZdZUeddZded<y)OverwritePayloadOperation.rr SetPayloadoverwrite_payloadN)rr r!rrQr"r#r$r%rOrOs&+CR&@|@r$rOc,eZdZUeddZeed<y)r.rrconnection_pool_sizeN)rr r!rrSr-r"r#r$r%rrs %cr :#:r$rcheZdZUeddZeed<eddZeed<eddZ eed<y)r$.rr ongoing_create_snapshot_requests is_recoveringrecovery_timestampN) rr r!rrUr-r"rVr=rWr#r$r%r$r$ s7,1#2,F$cF4M44#CR88r$r$c0eZdZUdZeddZeed<y)rNz Payload field .zPayload field namerr'N)rr r!r<rr'rCr"r#r$r%rNrNsS&:;C;r$rNcreZdZUdZeddZded<eddZed ed <edd Z e ed <y) 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<rr[r"rr rr-r#r$r%rrsM&+3rr7r=rrN)rr r!r<rCrrXrJrrTEXTrrr r#r$r%rZrZ,s=GG E C D DH Dr$rZc2eZdZUeddZeeed<y)PayloadSelectorExclude.z*Exclude this fields from returning payloadrexcludeN)rr r!rrgrrCr"r#r$r%rfrf>ss0\]GT#Y]r$rfc2eZdZUeddZeeed<y)PayloadSelectorInclude.zOnly include this payload keysrincludeN)rr r!rrjrrCr"r#r$r%ririBss0PQGT#YQr$ric2eZdZUeddZeded<y)PayloadStorageTypeOneOf.rr) in_memoryrNrr r!rrr r"r#r$r%rlrlFs" cr" ' #r$rlc2eZdZUeddZeded<y)PayloadStorageTypeOneOf1.rr)rrNrnr#r$r%rprpLs" cr" ' #r$rpc2eZdZUeddZeded<y)PayloadStorageTypeOneOf2.rr)mmaprNrnr#r$r%rrrrRs" cr" ' #r$rrc2eZdZUeddZeded<y)PayloadStorageTypeOneOf3.rr) in_ram_mmaprNrnr#r$r%ruruXs" cr" ' #r$ruc0eZdZUdZeddZeed<y)rz. Information of a peer in the cluster .z$Information of a peer in the clusterrrN)rr r!r<rrrCr"r#r$r%rr^sS&LMCMr$rc0eZdZUdZeddZeed<y)rz< Metadata describing extra properties for each peer .zPeer Qdrant versionrrGN)rr r!r<rrGrCr"r#r$r%rrfs*?@GS@r$rcPeZdZUeddZeed<eddZeded<y) r#.z7Name of the optimizer that scheduled this optimization.rrz Segments that will be optimized.rrN) rr r!rrrCr"rrr#r$r%r#r#ns,3,efIsf05cGi0jHd,-jr$r#cteZdZUeddZeded<eddZded<ed d Ze d ed <y )r.z:Scored points that have the same value of the group_by keyrrrYrGroupIdrNz1Record that has been looked up using the group idr8rrG) rr r!rrYrr"rrGr r#r$r%rrssA %c7s tD$} t#2.B .!&tAt!uFHX ur$rcVeZdZUeddZeded<eddZeded <y) PointIdsList.rrr\rNr8rkrl) rr r!rrrr"rlr r#r$r%r}r}ys0&+CR&@FD" #@.3Db.QIx*+Qr$r}ceZdZUeddZeded<eddZed ed <edd Z ed ed <eddZ eded<y) PointRequestNrjr8rkrl.zLook for points with idsrr\r]BSelect which payload to return with the response. Default is true.rrrrr) rr r!rrlr r"r]rrrr#r$r%rr~sn.3k/Ix*+$):T#UC U5:"f6L(12+0"*MK,'Mr$rcneZdZUeddZded<eddZded<edd Zed ed <y) PointStruct.rrr\r VectorStructrNzPayload values (optional)r8r`payload) rr r!rrr"rrr r#r$r%rrs<!#26B6"3B7FN7#(C^#_GXi _r$rcJeZdZUeddZded<eddZded<y) PointVectors.rrr\rrrN)rr r!rrr"rr#r$r%rrs%!#26B6"3B7FN7r$rceZdZUeddZded<eddZeded <edd Zed ed <edd Z eded<y) PointsBatch.rrr[batchNr8rkrlFilter 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.rn update_filterHMode of the upsert operation: insert_only, upsert (default), update_only UpdateMode update_mode) rr r!rrr"rlr rrr#r$r%rrsg3B/E7/.3Db.QIx*+Q(-i)M8H%+0"l+K,'r$rceZdZUeddZeded<eddZeded <edd Z ed ed <edd Z eded<y) PointsList.rrrrNr8rkrlrrnrrrr) rr r!rrrr"rlr rrr#r$r%rrsl"'"eZdZUeddZeeeddfed<eddZ eded<eddZ ee ed <edd Z ed ed <edd Z eded<eddZeeed<eddZeeed<eddZeded<y)PrefetchNzhSub-requests to perform first. If present, the query will be performed on the results of the prefetches.r8prefetchUQuery to perform. If missing without prefetches, returns points ordered by their IDs.QueryInterfacequeryUDefine which vector name to use for querying. If missing, the default vector is used.rSFilter conditions - return only those points that satisfy the specified conditions.rnro+Search params for when there is no prefetchrr5Return points with scores better than this threshold.score_threshold.Max number of points to return. Default is 10.rThe location to use for IDs lookup, if not specified - use the current collection and the 'using' vector Note: the other collection vectors should have the same vector size as the 'using' vector in the current collectionrr)rr r!rrr r rr"rrrCrorrr>rr-rr#r$r%rrs>C~?HhuT*-z9:;).k)E8$ %!kE8C="'"w"FHX (-TGt'uFH^ $u',"Y(OXe_!;klE8C=l.3G/K*+r$rc,eZdZUeddZded<y)ProductQuantization.rrProductQuantizationConfigproductN)rr r!rrr"r#r$r%rrs+0"+EG (Er$rcPeZdZUeddZded<eddZeeed<y) r.rrrA compressionNr8rh) rr r!rrr"rhr r=r#r$r%rrs)&+CR&@K#@!&t!DJDr$rceZdZUeddZeed<eddZee e e fed<edd Z ee e e fed <edd Z eeed <edd Zeeed<eddZeeed<eddZeeded<y)r.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%rrsc'?@D#@27Ro2pJx~./p38Sq3rK%$/0r$)"\%L(5/ :mnD(3-n ;tuE8C=u/4TOb/cHhtN+,cr$rc~eZdZUdZeddZeeed<eddZ eeed<edd Z ee ed <y) 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.rescoreaZOversampling factor for quantization. Default is 1.0. Defines how many extra vectors should be pre-selected using quantized index, and then re-scored using original vectors. For example, if `oversampling` is 2.4 and `limit` is 100, then 240 vectors will be pre-selected using quantized index, and then top-100 will be returned after re-scoring. oversampling) rr r!r<rrr r=r"rrr>r#r$r%rrsd##^FHTN$XGXd^%*q%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)<y)*QueryGroupsRequestNrr8rkrljSub-requests to perform first. If present, the query will be performed on the results of the prefetch(es).rrrrrrrrrnrorrrrrTOptions 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.Payload field to group by, must be a string or number field. If the field contains more than 1 value, all values will be used for grouping. One point can be in multiple groups.rgroup_byz;Maximum amount of points to return per group. Default is 3. group_sizez2Maximum amount of groups to return. Default is 10.r9Look for points in another collection using the group idsWithLookupInterface with_lookup)rr r!rrlr r"rr rrrrCrorrr>rrrrrr-rrr#r$r%rrs.3Db.QIx*+Q>CA?HhuT*-z9:;).k)E8$ %!kE8C="'"w"FHX (-TGt'uFH^ $u',"Y(OXe_+0"x+K,'6;"m6L(12/4G/K*+ GHc!&"_!J !;opE8C=p38"]4K/0r$rceZdZUeddZeded<eddZeee ddfed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<eddZeeed<eddZeeed<eddZeeed<eddZeded<eddZeded<edd Zed!ed"<y)# QueryRequestNrr8rkrlrrrrrrrrrrnrorrrrrrrz9Offset of the result. Skip this many points. Default is 0rrrrrrrrrr)rr r!rrlr r"rr rrrrCrorrr>rr-rrrrr#r$r%rr$ s`.3Db.QIx*+Q>CA?HhuT*-z9:;).k)E8$ %!kE8C="'"w"FHX (-TGt'uFH^ $u',"Y(OXe_!;klE8C=l!$"?r$rc2eZdZUeddZeded<y)r).rrrrN)rr r!rrrr"r#r$r%r)r)K s"'"r"rrrr#r$r%rrc sa :STBT:STBT ;VWC%W ;VWC%Wr$rc(eZdZdZdefdZdZdZdZy)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 rc,t|jSrrrs r%rzReadConsistencyType.__str__s rr$majorityquorumr]N) rr r!r<rCrMAJORITYQUORUMALLr#r$r%rrn s$H F Cr$rc$eZdZUeddZeded<egdZeeded<egd Z eeded <edd Z ed ed <eddZ eded<eddZ eded<eddZ eded<eddZeded<eddZeeed<eddZeded<eddZed ed!<ed"d#$Zeed%<ed"d&$Zeed'<ed"d($Zeed)<edd*Zed+ed,<y)-RecommendGroupsRequestNrjr8rkrl!Look for vectors closest to thoser]r^Try to avoid vectors like thisr_=How to use positive and negative examples to find the resultsRecommendStrategystrategyrmrnrorrrrrrrrrDefine a minimal score threshold for the result. If defined, less similar results will not be returned. Score of the returned result might be higher or smaller than the threshold depending on the Distance function used. E.g. for cosine similarity only higher scores will be returned.rrrrrrr.rrr,Maximum amount of points to return per groupr"Maximum amount of groups to returnrrrr)rr r!rrlr r"r^rr_rrorrrrr>rrrrCrr-rrr#r$r%rr{ s.3k/Ix*+49Qt3uHht./0u38Qq3rHht./0r.3"a/Hh*+"'tAw!xFHX x',TGa'bFH^ $b5:"g6L(12+0"t+K,'(-r(OXe_&+q&E8M "/4|/K*+ GHcC-[\J\s(LME3M38"]4K/0r$rceZdZUeddZeeded<eddZeeded<eddZ ed ed <y) RecommendInputNz9Look for vectors closest to the vectors from these pointsr8rcr^z6Try to avoid vectors like the vector from these pointsr_z3How to use the provided vectors to find the resultsrr) rr r!rr^r rr"r_rr#r$r%rr se.3"]/HhtM*+/4"Z/HhtM*+/4"W/Hh*+r$rc,eZdZUeddZded<y)RecommendQuery.rrr recommendN)rr r!rrr"r#r$r%rr s"'"rrr#r$r%rr s|/4k/Ix*+49Qt3uHht./0u38Qq3rHht./0r.3"a/Hh*+"'tAw!xFHX x',TGa'bFH^ $bs(HIE3I!UFHSM6;"g6L(12+0"t+K,'(-r(OXe_&+q&E8M "/4|/K*+r$rc2eZdZUeddZeded<y)RecommendRequestBatch.rrrrNrr#r$r%rr s).s)CHd%&Cr$rc(eZdZdZdefdZdZdZdZy)ra How to use positive and negative examples to find the results, default is `average_vector`: * `average_vector` - Average positive and negative vectors and create a single query with the formula `query = avg_pos + avg_pos - avg_neg`. Then performs normal search. * `best_score` - Uses custom search objective. Each candidate is compared against all examples, its score is then chosen from the `max(max_pos_score, max_neg_score)`. If the `max_neg_score` is chosen then it is squared and negated, otherwise it is just the `max_pos_score`. * `sum_scores` - Uses custom search objective. Compares against all inputs, sums all the scores. Scores against positive vectors are added, against negatives are subtracted. rc,t|jSrrrs r%rzRecommendStrategy.__str__ rr$average_vector best_score sum_scoresN) rr r!r<rCrAVERAGE_VECTOR BEST_SCORE SUM_SCORESr#r$r%rr s$&NJJr$rceZdZUdZeddZded<edd Zed ed <edd Z ed ed<edd Z eded<edd Z eded<y)rz Point data .z Point datarr\rN&Payload - values assigned to the pointr8r`rVector of the pointVectorStructOutputr Shard Keyrrl OrderValue order_value) rr r!r<rrr"rr rrlrr#r$r%rr sv"#<@B@#(Ck#lGXi l-24Mb-cFH) *c&+Dk&RIx #R*/,*WK,'Wr$rcneZdZUeddZded<eddZeded<eddZded <y ) RelevanceFeedbackInput.rrrcrrifeedbackFeedbackStrategyrN) rr r!rrr"rrrr#r$r%rr s;!#26FM6%*3B%?Hd>"?#("#=H =r$rc,eZdZUeddZded<y)RelevanceFeedbackQuery.rrrrelevance_feedbackN)rr r!rrr"r#r$r%rr s38"3M0Mr$rceZdZUeddZeed<eddZeded <edd Z eed <edd Z d ed<y)r.zRemote shard idrr*Nrr8rrlzRemote peer idrrrr) rr r!rr*r-r"rlr rrr#r$r%rr sN#+<=Hc=&+DFa&bIx #b*:;GS;!#26E>6r$rceZdZUeddZeed<eddZeed<eddZe ded <eddZ e ded <y) RemoteShardTelemetry.rrr*rNr8rrupdates) rr r!rr*r-r"rrr rr#r$r%rr sT#2.Hc."-GS-8=dXZ8[Hh45[7.rrr*rN)rr r!rr*r-r"rr#r$r%r>r># s$#2.Hc."-GS-r$r>ceZdZUeddZeed<eddZeded<eddZ ed ed <eddZ e d ed <eddZ e ed fed<eddZeded<y)r).rrrNr8rr'rlocalrremoterreplicate_statesr$r%)rr r!rrr-r"r'r r r rrrrCr%r#r$r%r)r)( sCR(B( %d CC* C-24R-PE8) *P+0"+EFD' (E272Ld3./L=B4]_=`h9:`r$r)cHeZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZy)rz9 State of the single shard within a replica set. rc,t|jSrrrs r%rzReplicaState.__str__6 rr$ActiveDeadPartial InitializingListenerPartialSnapshotRecovery ReshardingReshardingScaleDown ActiveReadManualRecoveryN)rr r!r<rCrACTIVEDEADPARTIAL INITIALIZINGLISTENERPARTIALSNAPSHOTRECOVERY RESHARDINGRESHARDINGSCALEDOWN ACTIVEREADMANUALRECOVERYr#r$r%rr1 sMF DG!LH'OHJ/J%Nr$rcneZdZUeddZeded<eddZded <eddZded <y) ReplicatePointsNrr8rnro.rrfrom_shard_key to_shard_key) rr r!rror r"r)r*r#r$r%r(r(F s:!&t!DFHX D!&s!;NJ;$Sb9L*9r$r(c,eZdZUeddZded<y)ReplicatePointsOperation.rrr(replicate_pointsN)rr r!rr-r"r#r$r%r,r,L */*D'Dr$r,ceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <y) ReplicateShard.rrr*r+r,Nrr8rrrr#r$r%r0r0P rr$r0c,eZdZUeddZded<y)ReplicateShardOperation.rrr0replicate_shardN)rr r!rr3r"r#r$r%r2r2Y s(-cr(BO%Br$r2cJeZdZUeddZded<eddZded<y) RequestsTelemetry.rrWebApiTelemetryrestrgrpcN)rr r!rr7r"r8r#r$r%r5r5] s%#CR8D 8!#26D/6r$r5c$eZdZdZdefdZdZdZy)ReshardingDirectionz Resharding direction, scale up or down in number of shards - `up` - Scale up, add a new shard - `down` - Scale down, remove a shard rc,t|jSrrrs r%rzReshardingDirection.__str__g rr$updownN)rr r!r<rCrUPDOWNr#r$r%r:r:b s B Dr$r:ceZdZUeddZded<eddZeed<eddZeed<edd Z e d ed <y) r.rrr:rGr*rNr8rrl) rr r!rrGr"r*r-rrlr r#r$r%rrn sL',Sb'AI$A#2.Hc."-GS-&+Db&IIx #Ir$rceZdZUeddZeed<eddZeed<eddZeed<eddZ ded<y ) RestartTransfer.rrr*r,r+rrN) rr r!rr*r-r"r,r+rr#r$r%rBrBu sG#2.Hc.cr2L#2CR0J0$)#2$>F !>r$rBc,eZdZUeddZded<y)RestartTransferOperation.rrrBrestart_transferN)rr r!rrEr"r#r$r%rDrD| r.r$rDc`eZdZUdZeddZeeed<eddZ ee e ed<y)Rrfz/ Parameters for Reciprocal Rank Fusion Nz&K parameter for reciprocal rank fusionr8r}zWeights 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<rr}r r-r"rHrr>r#r$r%rGrG sBT7_`Ax}`%*e&GXd5k "r$rGc,eZdZUeddZded<y)RrfQuery.rrrGrN)rr r!rrr"r#r$r%rJrJ ss+C+r$rJcLeZdZUeddZeeed<eddZeeed<eddZ e ed<eddZ ee ed <eddZ ee ed <eddZee ed <eddZeed <eddZed ed<eddZeeded<y)rNNrr8 distributiondistribution_version.r is_dockercoresram_size disk_size cpu_flagsru cpu_endianr gpu_devices)rr r!rrLr rCr"rMrNr=rOr-rPrQrRrSrTrr#r$r%rNrN s"'""EL(3-E*/"*M(3-MCR0It0 2>E8C=>#DbAHhsmA$TrBIx}B3B/Is/(-d(KJ%K8=dXZ8[K$345[r$rNceZdZdZy)SamplerandomN)rr r!RANDOMr#r$r%rVrV s Fr$rVc,eZdZUeddZded<y) SampleQuery.rrrVsampleN)rr r!rr[r"r#r$r%rZrZ rr$rZc,eZdZUeddZded<y)ScalarQuantization.rrScalarQuantizationConfigscalarN)rr r!rr_r"r#r$r%r]r] rfr$r]cteZdZUeddZded<eddZeeed <edd Z ee ed <y) r^.rr ScalarTyperNziQuantile for quantization. Expected value range in [0.5, 1.0]. If not set - use the whole range of valuesr8quantilez]If true - quantized vectors always will be stored in RAM, ignoring the config of main storagerh) rr r!rrr"rbr r>rhr=r#r$r%r^r^ sKs3D,3 %!Hhuo"'s"Jr$r^ceZdZdZy)raint8N)rr r!INT8r#r$r%rara rr$raceZdZUdZeddZded<eddZeed<edd Z e ed <ed d Z e ded<ed d Z e ded<ed d Ze ded<ed d Ze ded<y )rz Search result .z Search resultrr\rz Point versionrGz*Points vector distance to the query vectorrkNrr8r`rrrrrrrlzOrder-by valuerr)rr r!r<rrr"rGr-rkr>rr rrlrr#r$r%rr s"#?CBC/:GS:*VWE5W#(Ck#lGXi l-24Mb-cFH) *c&+Dk&RIx #R*/JZ*[K,'[r$rceZdZUdZeddZeded<eddZeded <edd Z ee ed <edd Z ed ed<eddZ eded<eddZ eded<eddZeded<y) ScrollRequestzQ Scroll request - paginate over all points which matches given condition Nrjr8rkrlzStart ID to read points from.r\rzPage size. Default: 10rzSLook only for points which satisfies this conditions. If not provided - all points.rnrorrrzGScroll request - paginate over all points which matches given conditionrrz%Order the records by a payload field.rLrM)rr r!r<rrlr r"rrr-rorrrMr#r$r%rhrh s/4k/Ix*++0Ji*jFH& 'j ;STE8C=T!&"w"FHX 6;"f6L(12+0"k+K,'.34Mt-uHh)*ur$rhcZeZdZUdZeddZeded<edd Ze d ed <y) rz+ Result of the points read request .zList of retrieved pointsrrrNz:Offset which should be used to retrieve a next page resultr8r\next_page_offset) rr r!r<rrrr"rjr r#r$r%rr s=#34NOFDNO49"^5h01r$rceZdZUeddZeded<eddZd ed <edd Zed ed <eddZ eded<eddZ eded<eddZ eded<eddZ ee ed<eddZeed<eddZeed<eddZeed<eddZed ed!<y)"SearchGroupsRequestNrjr8rkrl.rrNamedVectorStructrrmrnrorrrrrrrrrrrrrrrrrrrr)rr r!rrlr r"rrorrrrr>rrCrr-rrr#r$r%rlrl s.3k/Ix*+#("r]r#r$r%r1r1 s\"34OPKcP"34RSKcS1\]FDK]#(:V#WC Wr$r1cleZdZUdZeddZded<eddZded<eddZe ed<y ) SearchMatrixPairz* Pair of points (a, b) with score .z Pair of points (a, b) with scorerr\rr~rkN) rr r!r<rrr"r~rkr>r#r$r%rsrs sA!2TUAU 2TUAU*LME5Mr$rsc2eZdZUeddZeded<y)r..z#List of pairs of points with scoresrrspairsN)rr r!rrurr"r#r$r%r.r. s&+C=b&cE4" #cr$r.ceZdZUeddZeded<eddZeded<edd Zee ed <edd Z ee ed <edd Z ee ed<y)SearchMatrixRequestNrjr8rkrlrmrnroz;How many points to select and search within. Default is 10.r[z5How many neighbours per sample to find. Default is 3.rrr) rr r!rrlr r"ror[r-rrrCr#r$r%rwrw s.3k/Ix*+"'tAw!xFHX x!"_FHSM!;rsE8C=s kE8C=r$rwceZdZUdZeddZeeed<eddZ ee ed<edd Z ed ed <edd Z ee ed <eddZ eded<y)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.rpzQuantization 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 paramsr7acorn)rr r!r<rryr r-r"rpr=rzr{r|r#r$r%rr* s#cGXc]"oE8D>:?tYn9oL(56o#(~$L(4.,1K`+aE8' (ar$rcJeZdZUdZeddZeded<edd Zd ed <edd Z ed ed<eddZ eded<edd Z e ed<eddZ ee ed<eddZeded<eddZeded<eddZeeed<y) SearchRequestz Search request. Holds all conditions and parameters for the search of most similar points by vector similarity given the filtering restrictions. Nrjr8rkrl.zSearch request. Holds all conditions and parameters for the search of most similar points by vector similarity given the filtering restrictions.rrmrrmrnrorrrrrrrrrrrrrrr)rr r!r<rrlr r"rrorrr-rrrrr>r#r$r%r~r~? s/4k/Ix*+#( g#F "'tAw!xFHX x',TGa'bFH^ $bs(HIE3I!UFHSM6;"g6L(12+0"t+K,'(-r(OXe_r$r~c2eZdZUeddZeded<y)SearchRequestBatch.rrr~rNrr#r$r%rr_ s&+CR&@Hd?#@r$rceZdZUeidZeeedfed<eddZ eeedfed<edd Z d ed <y) SegmentConfigrr8VectorDataConfig vector_dataNSparseVectorDataConfigsparse_vector_data.rPayloadStorageTypepayload_storage_type) rr r!rrr rrCr"rrr#r$r%rrc s[;@Y[;\K$s$6678\HMVZhjHkc+C&C!DEk16s1K.Kr$rceZdZUdZeddZeed<eddZded<eddZ e ed<eddZ e ed <eddZ e ed <eddZ e ed <edd Ze ed <eddZe ed<eddZe ed<eddZe ed<eddZeed<eddZeedfed<eddZeedfed<y) SegmentInfoz. Aggregated information about segment .z$Aggregated information about segmentrr SegmentType segment_typer!r num_indexed_vectorsnum_deleted_vectorsrrz@An estimation of the effective amount of bytes used for payloadsrram_usage_bytesdisk_usage_bytes is_appendabler index_schemaVectorDataInforN)rr r!r<rrr r"rr!r-r rrrrrrrr=rrrCrr#r$r%rri ss(NOD$O"'9_"`L-`S.TUKUC-STJT$S6\]]$S6\]]# P % [ !2XYOSY!#3YZcZ1WXM4X27Io2pL$s../p/4SFl/mKc++,mr$rceZdZUeddZded<eddZded<eddZeded <eddZ ed ed <y ) r.rrrinforrVectorIndexSearchesTelemetryvector_index_searchesr^payload_field_indicesN) rr r!rrr"rrrrr#r$r%rr sV4D-4#CR8FO8BGY[B\4 >?\;@RT;U4 78Ur$rc(eZdZdZdefdZdZdZdZy)rz Type of segment rc,t|jSrrrs r%rzSegmentType.__str__ rr$rindexedspecialN) rr r!r<rCrPLAININDEXEDSPECIALr#r$r%rr s$ EGGr$rceZdZUdZeddZded<edd Zee d ed <edd Z ed ed<edd Z eded<edd Z ee ed<y)rPr.rrr`rNz*Assigns payload to each point in this listr8r\rz@Assigns payload to each point that satisfy this filter conditionrnrorkrlz@Assigns payload to each point that satisfy this path of propertyr')rr r!r<rrr"rr rrorlr'rCr#r$r%rPrP s jGY16"N1FHT+, -"'"d"FHX /4"s/Ix*+"dC#r$rPc,eZdZUeddZded<y)SetPayloadOperation.rrrP set_payloadN)rr r!rrr"r#r$r%rr s %cr :K:r$rc,eZdZUeddZeed<y)ShardCleanStatusFailedTelemetry.rrreasonN)rr r!rrrCr"r#r$r%rr rr$rc,eZdZUeddZeed<y)!ShardCleanStatusProgressTelemetry.rrdeleted_pointsN)rr r!rrr-r"r#r$r%rr s4NC4r$rceZdZdZdZdZy)ShardCleanStatusTelemetryOneOfstartedr cancelledN)rr r!STARTEDDONE CANCELLEDr#r$r%rr sG DIr$rc,eZdZUeddZded<y)ShardCleanStatusTelemetryOneOf1.rrrrN)rr r!rrr"r#r$r%rr s49#24NH1Nr$rc,eZdZUeddZded<y)ShardCleanStatusTelemetryOneOf2.rrrfailedN)rr r!rrr"r#r$r%rr s05cr0JF -Jr$rc,eZdZUeddZded<y)ShardKeyDescription.rrrr'N)rr r!rr'r"r#r$r%rr sCR0C0r$rcJeZdZUeddZded<eddZded<y)ShardKeyWithFallback.rrrrfallbackN)rr r!rrr"rr#r$r%rr s$s3FJ3 "5Hj5r$rc8eZdZUeddZeeded<y)rNzHThe existing shard keys. Only available when sharding method is `custom`r8r shard_keys)rr r!rrr rr"r#r$r%rr s$8="l9J345r$rceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <y)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 sc(-cr(BH%B-24R-PHh)*P#"jHhsm#"gGXc]r$rc,eZdZdZdefdZdZdZdZdZ y) rz Current state of the shard (supports same states as the collection) `Green` - all good. `Yellow` - optimization is running, 'Grey' - optimizations are possible but not triggered, `Red` - some operations failed and was not recovered rc,t|jSrrrs r%rzShardStatus.__str__ rr$rrrrNr r#r$r%rr r%r$rceZdZUeddZeed<eddZeeed<edd d Z eed <edd Z eed<eddZ e ed<eddZ eded<eddZeeed<y)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 rrrr=rrrCr#r$r%rr s#2.Hc.!&J"K#s(8GE3GC%:;B; PD$/4Db.QFH* +Q""xGXc]r$rc,eZdZdZdefdZdZdZdZdZ y) 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. rc,t|jSrrrs r%rzShardTransferMethod.__str__ rr$stream_recordssnapshot wal_deltaresharding_stream_recordsN) rr r!r<rCrSTREAM_RECORDSSNAPSHOT WAL_DELTARESHARDING_STREAM_RECORDSr#r$r%rr s*&NHI ;r$rcPeZdZUeddZeed<eddZeeed<y) r.Number of elements in the queuerlengthNzlast operation number processedr8op_num) rr r!rrr-r"rr r#r$r%rr s*)JKFCK!$<]^FHSM^r$rceZdZdZdZy)rrcustomN)rr r!rCUSTOMr#r$r%rr s D Fr$rceZdZUeddZeed<eddZeeed<eddZ e ed<eddZ eeed <y) r.rrrFNr8 creation_timesizer) rr r!rrFrCr"rr rr-rr#r$r%rr sNcr*D#*#(2#FM8C=Fcr*D#*#DbAHhsmAr$rc(eZdZdZdefdZdZdZdZy)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. rc,t|jSrrrs r%rzSnapshotPriority.__str__$ rr$no_syncrreplicaN) rr r!r<rCrNO_SYNCrREPLICAr#r$r%rr s$GHGr$rceZdZUeddZeed<eddZeded <edd Z eeed <edd Z eeed <y)SnapshotRecover.zExamples: - URL `http://localhost:8080/collections/my_collection/snapshots/my_snapshot` - Local path `file:///qdrant/snapshots/test_collection-2022-08-04-10-49-10.snapshot`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%rr, sx CHc.3r.Hh)*$"jHhsm#"gGXc]r$rceZdZdZy)SnowballsnowballN)rr r!SNOWBALLr#r$r%rr= rr$rcheZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZdZdZdZdZdZdZy)SnowballLanguagez2 Languages supported by snowball stemmer. rc,t|jSrrrs r%rzSnowballLanguage.__str__F rr$r[armenianrarbrcrdrerfrgrjrlrprqrrrsrurvtamilrxN)rr r!r<rCrryARMENIANrrrrrrrrrrrrrrrTAMILrr#r$r%rrA stFH F EGG F F EIGIJHGGG EGr$rcJeZdZUeddZded<eddZded<y) SnowballParams.rrrrrrN)rr r!rrr"rr#r$r%rr^ s%Sb1D*1#("#=H =r$rcxeZdZUdZeddZeeed<eddZ d ed <edd Z ed ed <y)SparseIndexConfig2 Configuration for sparse inverted index. NvWe prefer a full scan search upto (excluding) this number of vectors. Note: this is number of vectors, not KiloBytes.r8r.z(Configuration for sparse inverted index.rSparseIndexTyper_z,Datatype used to store weights in the index.VectorStorageDatatypedatatype) rr r!r<rrr r-r"r_rr#r$r%rrc sZ*/M*#%*#;e$fJ!f27"P3Hh./r$rc~eZdZUdZeddZeeed<eddZ ee ed<eddZ ed ed <y) SparseIndexParamsrNrr8rzUStore index on disk. If set to false, the index will be stored in RAM. Default: falsera9Defines 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=rr#r$r%rrr sf*/M*#$kGXd^&+P &Hhz"r$rc eZdZdZdefdZdZy)SparseIndexTypeOneOfz" Mutable RAM sparse index rc,t|jSrrrs r%rzSparseIndexTypeOneOf.__str__ rr$ MutableRamN)rr r!r<rCr MUTABLERAMr#r$r%rr sJr$rc eZdZdZdefdZdZy)SparseIndexTypeOneOf1z$ Immutable RAM sparse index rc,t|jSrrrs r%rzSparseIndexTypeOneOf1.__str__ rr$ ImmutableRamN)rr r!r<rCr IMMUTABLERAMr#r$r%rr s"Lr$rc eZdZdZdefdZdZy)SparseIndexTypeOneOf2z Mmap sparse index rc,t|jSrrrs r%rzSparseIndexTypeOneOf2.__str__ rr$MmapNrr r!r<rCrMMAPr#r$r%r r   Dr$r cZeZdZUdZeddZeeed<eddZ ee ed<y) rz! Sparse vector structure .zIndices must be uniquerindicesz*Values and indices must be the same lengthvaluesN) rr r!r<rrrr-r"rr>r#r$r%rr s5s0HIGT#YI1]^FDK^r$rcxeZdZUdZeddZded<eddZed ed <edd Z ed ed <y)rz5 Config of single sparse vector data storage .z+Config of single sparse vector data storagerrindexNr8SparseVectorStorageType storage_typeIConfigures addition value modifications for sparse vectors. Default: nonermodifier) rr r!r<rrr"rr rr#r$r%rr sW"'s8e!fE f8="O9L(45&+"m&Hhz"r$rcZeZdZUdZeddZeded<eddZeded <y) rz5 Params of single sparse vector data storage NzQCustom params for index. If none - values from collection configuration are used.r8rrrrr) rr r!r<rrr r"rr#r$r%rr sD,1"u,E8' (&+"m&Hhz"r$c eZdZdZdefdZdZy)SparseVectorStorageTypeOneOfz+ Storage on disk (rocksdb storage) rc,t|jSrrrs r%rz$SparseVectorStorageTypeOneOf.__str__ rr$rN)rr r!r<rCrON_DISKr#r$r%rr sGr$rc eZdZdZdefdZdZy)SparseVectorStorageTypeOneOf1z4 Storage in memory maps (gridstore storage) rc,t|jSrrrs r%rz%SparseVectorStorageTypeOneOf1.__str__ rr$rsNrr#r$r%r!r! rr$r!c,eZdZUeddZded<y)SqrtExpression.rrr3sqrtN)rr r!rr%r"r#r$r%r$r$ ss3D,3r$r$cteZdZUeddZded<eddZeeed<eddZ ed ed <y) StartResharding.rrr:rGNr8rrrl) rr r!rrGr"rr r-rlr#r$r%r'r' s?',Sb'AI$A"4R@GXc]@&+Db&IIx #Ir$r'c,eZdZUeddZded<y)StartReshardingOperation.rrr'start_reshardingN)rr r!rr*r"r#r$r%r)r) r.r$r)c,eZdZdZdefdZdZdZdZdZ y) rz+ Role of the peer in the consensus rc,t|jSrrrs r%rzStateRole.__str__ rr$Follower CandidateLeader PreCandidateN) rr r!r<rCrFOLLOWER CANDIDATELEADER PRECANDIDATEr#r$r%rr s)HI F!Lr$rcbeZdZUeddZeeded<eddZeee ed<y) StopwordsSetNz_Set of languages to use for stopwords. Multiple pre-defined lists of stopwords can be combined.r8rZ languageszrGrIrKrMrOrQrSrUrWrYr[r#r$r%rr s#D>wxGXd^x%*"x&OXc]"'tAc!dK#d38"m4 (4.27"q2)."S) */tIk)ll/4"M0Xe_+0Jh*i(3-i6;"i7$hsm&+"X&OXc]',"Y'hsm8="V8%x}',DFv&whsmw+0Kn+o8C=o(-"U) CH"IC!>?9>"K9M845.3"Q.Xc]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#Zed$ed%<edd&Zed'ed(<edd)Zee ed*<y)+rNr9r8rr:r;r<r=r>r?r@rAz,Max HNSW value allowed in search parameters.rBz'Whether exact search is allowed or not.rCrDrErFrGrHrIrJrKrLrMrNrOrPrQrRrSrTrUzMultivector configuration!StrictModeMultivectorConfigOutputrWzSparse vector configurationStrictModeSparseConfigOutputrYrZr[r\r#r$r%rr6 s #D>wxGXd^x%*"x&OXc]"'tAc!dK#d38"m4 (4.27"q2).dHv(w w).tIr)ss/4"M0Xe_+0Jh*i(3-i6;"i7$hsm&+"X&OXc]',"Y'hsm8="V8%x}',DFv&whsmw+0Kn+o8C=o(-"U) IN"=I!DE?D"??M8:;.3"Q.Xc]r$rc2eZdZUeddZeeed<y)rN&Max number of vectors in a multivectorr8 max_vectorsrr r!rrbr r-r"r#r$r%rrd !&tAi!jK#jr$c2eZdZUeddZeeed<y)rNrar8rbrcr#r$r%rrh rdr$c2eZdZUeddZeeed<y)rNMax length of sparse vectorr8 max_lengthrr r!rrhr r-r"r#r$r%rrl  %d@] ^J ^r$c2eZdZUeddZeeed<y)rNrgr8rhrir#r$r%rrp rjr$c2eZdZUeddZeded<y) SumExpression.rrr3sumN)rr r!rrnrr"r#r$r%rmrmt s#CR8Cl 8r$rmceZdZUeddZeed<eddZeded<eddZ d ed <eddZ ed ed <eddZ ed ed<eddZ eded<eddZ eded<y)r.rrrNr8rEappr;r9rr+r5requestsrmemoryrhardware)rr r!rrrCr"rpr r9r+rqrrrsr#r$r%rrx sCR(B().t)LC% &L*/*DK'D,1$B,OGX( )O.3Db.QHh*+Q*/"*MFH& 'M.3Db.QHh*+Qr$rceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <eddZ ee ed<eddZ ee ed<eddZee ed<eddZeded<eddZee ed<eddZeded<eddZee ed<y)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.rrrrz*Algorithm for stemming. Default: disabled.rrrr)rr r!rrr"rr rr-rrr=rrwrrrrr#r$r%ruru s!#26D/6+02+NIx(N#(Ch#iM8C=i#(Ch#iM8C=i %d@o pIx~p$)G%M8D>',"U'OXd^16r1Ix,-$D>qrGXd^r-2"N.GX) *#(W#K$r$ruceZdZdZy)rvr7N)rr r!rdr#r$r%rvrv rr$rvceZdZdZdZdZdZy)rprefix whitespaceword multilingualN)rr r!PREFIX WHITESPACEWORD MULTILINGUALr#r$r%rr s FJ D!Lr$rceZdZdZdZy)TrackerStatusOneOf optimizingrN)rr r! OPTIMIZINGrr#r$r%rr s J Dr$rc,eZdZUeddZeed<y)TrackerStatusOneOf1.rrrN)rr r!rrrCr"r#r$r%rr s3B/Is/r$rc,eZdZUeddZeed<y)TrackerStatusOneOf2.rrrLN)rr r!rrLrCr"r#r$r%rr ss+E3+r$rc eZdZUdZeddZeed<eddZe ed<eddZ e e ed <edd Z e e ed <edd Zd ed<eddZeeefed<eddZeeeefed<y)r,z* 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 telemetryrrzStart time of the optimizerstart_atNzEnd time of the optimizerr8end_at)rr r!r<rrFrCr"rr rrr-rrrr rrrr r#r$r%r,r, sc'>?D#?s(efD$f" fKc!& c!M4:$C5WXFOX&+C=Z&[HeHdN#[.3DNi.jFHU8T>* +jr$r,c2eZdZUdZeddZeded<eddZeded <edd Z ed ed <edd Z eded<eddZ eded<eddZ eded<eddZ eded<eddZeded<y)UpdateCollectionzF Operation for updating parameters of the existing collection NzMap of vector data parameters to update for each named vector. To update parameters in a collection having a single unnamed vector, use an empty string as name.r8VectorsConfigDiffr_zCustom 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.r rzSHNSW 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.SparseVectorsConfigr zqrGXd^r"'W#K$r$rceZdZdZy)rrN)rr r!r r#r$r%rr7rr$rceZdZUdZeddZeeed<eddZ eeed<eddZ eeed <edd Z eeed <y) rxz% Values count filter request Nz'point.key.length() < values_count.ltr8rz'point.key.length() > values_count.gtrz)point.key.length() >= values_count.gterz)point.key.length() <= values_count.lter) rr r!r<rrr r-r"rrrr#r$r%rxrx;sad8abB bd8abB bt9deC#et9deC#er$rxceZdZUdZeddZeed<eddZded<eddZ d ed <eddZ d ed <ed dZ e ded<ed dZ e ded<ed dZe ded<y )rz. Config of single vector data storage .z'Size/dimensionality of the vectors usedrrz$Config of single vector data storagerdistanceVectorStorageTyperIndexesrNzDVector specific quantization config that overrides collection configr8rrzBVector specific configuration to enable multiple vectors per pointrrWzBVector specific configuration to set specific storage element typerr)rr r!r<rrr-r"rrrrr rWrr#r$r%rrFsc'PQD#Q 2XYHjY(-c?e(fL%fS.TUE9U:?"h;"679>"f9!4538"f3Hh./r$rcheZdZUeddZeed<eddZeed<eddZeed<y)r.rrr!rrN) rr r!rr!r-r"rrr#r$r%rrZs7Sb1K1$Sb99$Sb99r$rc@eZdZUeddZeeed<eddZded<eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZded<eddZded<eddZded<y)rNrr8 index_name.rrunfiltered_plainunfiltered_hnswunfiltered_sparsefiltered_plainfiltered_small_cardinalityfiltered_large_cardinalityfiltered_exactfiltered_sparseunfiltered_exact)rr r!rrr rCr"rrrrrrrrrr#r$r%rr`s %d CJ C6;CR6P3P5:3B5OO2O7"H9!45r$rczeZdZUeddZeded<eddZeded<edd Zee ed <y) rNzAUpdate params for HNSW index. If empty object - it will be unset.r8rrz?Update params for quantization. If none - it is left unchanged.rrzQIf true, vectors are served from disk, improving RAM usage at the cost of latencyr) rr r!rrr r"rrr=r#r$r%rrs].3"e/K*+?D"c?":;$"uGXd^r$c(eZdZdZdefdZdZdZdZy)rz# Storage types for vectors rc,t|jSrrrs r%rzVectorStorageDatatype.__str__rr$rrrN) rr r!r<rCrrrrr#r$r%rrs$GG Er$rc eZdZdZdefdZdZy)VectorStorageTypeOneOfz^ Storage in memory (RAM) Will be very fast at the cost of consuming a lot of memory. rc,t|jSrrrs r%rzVectorStorageTypeOneOf.__str__rr$MemoryN)rr r!r<rCrMEMORYr#r$r%rrsFr$rc eZdZdZdefdZdZy)VectorStorageTypeOneOf1z Storage in mmap file, not appendable Search performance is defined by disk speed and the fraction of vectors that fit in memory. rc,t|jSrrrs r%rzVectorStorageTypeOneOf1.__str__rr$rNrr#r$r%rrrr$rc eZdZdZdefdZdZy)VectorStorageTypeOneOf2z Storage in chunked mmap files, appendable Search performance is defined by disk speed and the fraction of vectors that fit in memory. rc,t|jSrrrs r%rzVectorStorageTypeOneOf2.__str__rr$ ChunkedMmapN)rr r!r<rCr CHUNKEDMMAPr#r$r%rrs Kr$rc eZdZdZdefdZdZy)VectorStorageTypeOneOf3z Same as `ChunkedMmap`, but vectors are forced to be locked in RAM In this way we avoid cold requests to disk, but risk to run out of memory Designed as a replacement for `Memory`, which doesn't depend on RocksDB rc,t|jSrrrs r%rzVectorStorageTypeOneOf3.__str__rr$InRamChunkedMmapN)rr r!r<rCrINRAMCHUNKEDMMAPr#r$r%rrs*r$rc eZdZdZdefdZdZy)VectorStorageTypeOneOf4zT Storage in a single mmap file, not appendable Pre-fetched into RAM on load rc,t|jSrrrs r%rzVectorStorageTypeOneOf4.__str__rr$ InRamMmapN)rr r!r<rCr INRAMMMAPr#r$r%rrsIr$rcneZdZUeddZeed<eddZeed<eddZe eed<y) VersionInfo.rrtitlerGNr8r) rr r!rrrCr"rGrr r#r$r%rrs9s+E3+"-GS-!$B?FHSM?r$rcneZdZUeddZeed<eddZeed<edd Ze eed <y ) r."Size of a single WAL segment in MBrwal_capacity_mb 2VWOSW#C5stt',QDk'lx}lr$rczeZdZUeddZeeed<eddZeeed<eddZ eeed<y) rNrr8rrrz'Number of closed WAL segments to retainr) rr r!rrr r-r"rrr#r$r%rrsM%*4Ei%jOXc]j(-"`) (-TGp'qx}qr$rc@eZdZUeddZeeeedffed<y)r6.rrrrNrr#r$r%r6r6rr$r6cteZdZUeddZeed<eddZeded <edd Z ed ed <y) WithLookup.z/Name of the collection to use for points lookuprrNz8Options for specifying which payload to include (or not)r8rrz8Options for specifying which vectors to include (or not)r with_vectors) rr r!rrrCr"rr rr#r$r%rrsOC-^_J_5:"\6L(12,1"\,L(<(r$rc(eZdZdZdefdZdZdZdZy) WriteOrderinga Defines write ordering guarantees for collection operations * `weak` - write operations may be reordered, works faster, default * `medium` - write operations go through dynamically selected leader, may be inconsistent for a short period of time in case of leader change * `strong` - Write operations go through the permanent leader, consistent, but may be unavailable if leader is down rc,t|jSrrrs r%rzWriteOrdering.__str__rr$weakmediumstrongN) rr r!r<rCrWEAKMEDIUMSTRONGr#r$r%rrs$ D F Fr$rN(rrenumrtypingrrrr r r rr pydanticr rpydantic.typesrrrrrCr`rrVr^rXr_rrr)r/r2r7r@rErHr[rcrdrirkr|rrrrrrrrrrrrrrrrr r rr'rr2r5r8r;rArrQrUrXr\rbrerirrrur}rrrrrrrrrrrrrrrrrrrrrrrrrrr rrr rrr*r-r.r6r=rArCrFrIrNrRrUrWrXrJrirmrnrrrrrrrrrrrrrrrrvrtrrrrrrrrrrLrrrrrrrrrrrr r rrrrrr r"r$r&r(r+r-r0r3r6r8r;r=r?rArCrErFrMrPrRrSrZrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr r rrrrrr rrrr?rDrFrKrOrr$rNrr^rZrfrirlrprrrurrr#rr}rrrrrrrrrrrrrrrr)rrrrrrrrrrrrrrrrr>r)rr(r,r0r2r5r:rrBrDrGrJrNrVrZr]r^rarrhrrlr1rsr.rwrr~rrrrrrPrrrrrrrrrrrrrrrrrrrrrrrrrr rrrrr!r$r'r)rr6rrrrrrrmrrurvrrrrr,rrrrrrrrrrrrrxrrrrrrrrrrrrrrr6rrrrClusterOperationsr4r>r}rrfr:r\r[rr{rrnr=rmrrLrr\PayloadSelectorrrrrrQueryrpReadConsistencyr-rrrrrHrrrrrrVector VectorOutputrrrrr^r3rr]rkrcrrrrr#r$r%rs#<<%HH sCx.3 445"3(?#?@$(.K)K$L!c#556#C)A$AB0017y73(3 FYhF3IX3   6y6 @ @/9/NIXN D(Dy,d,  c4 +(+\ixCYhAIXAGYG ## )$RYRMyM wI wy.r r+I+w)weYe8y:9H$R)R sD n)n= =(> 9)89 99H9 9H  Y)YT )8 =9H=0y0fWyW  (J(JsD /(/ )8 T3IX3hIXh IX G)8GS9HS:ix:IX"AYhARIXRAYhAT sDIX;IX;%ix%PC9HC sD I)I vYvRYR))*b b [y[ 2IX2K K y$99H97ix7FyF@I@ a)aD(D3IX3 9H =I=,I, +9+\.9H. Yh0 Yh RYhR y S$K9HK S$ 2)82F9HF Yh C)8CU U Yh3mIXmDyD (  K  K++<9<`I`M M sI s ]Yh]b(b  FYh>y IX  9  I ix$AYAP PAAT)TY)YA)A X)XR)R E)EK)KQ)QK)KP)PLLV)VK)KJ)JL)LL)LR)RX)XZ)ZLLWWRRMMKKRRTT@ @ ("sDpypnixn ( sDsDBD(D29H27Y7l)l>5ix5 Yh  ZyZ)8R)8RJ Jc9HcV(VCeie  0 0 )8 -- sD  9(9:Yh:CE EFIXF*)8* T T@)8@9H3IX3iYhi2ix2Z)Z$ :9 :_i_ I&l9lRR y F 9H FCTYTix>9H>A A;;9y9 <9H< Uy UOIOT$^Yh^RYhR#i# #y# #y# #y# NyNA9Ak)k vv R9HR N9H N`)8` 89H8 )8  ( 2IX28 8 y6F)8FE E d9 dy$)()X 9H F@ @=I=QyQ(XIXX #t &Yh&R Yh =Yh=&y&RDIXD T  XY X>Yh> NYhN7i7[9[N)8NV9HV.ix. a)a&3&*:ix: EyEYhCixC7 7 #t JYJ?ix?EyE )8 ,y, \) \S$2)82D(D y d \) \vIXv.9)8:X)XNyNd d )8  b9Hb*IX@A(ALIL n)n2VyV #t (,;)8;-i-5 5S$ OiOKiK1)169H6   9H #t  $ <#t <_9_ S$ B)B sD ix"sDsD:>Yh>   &3"C"C_9H_ Y  ( 3C4Yh4JixJ EyE "T "9H-y-`+Y+\kIXkk)k_y__Y_9IX9RIRix6C"C"d 0)0,),kyk(yD  d  EyELiL898 "3 "LIXL AYhAAixA I ixCf)8fy(:Y: Q9 Q9H8 y  C S$c4 c4 *c4*c4@)@ m m rIXr`i`( C  OO     "$     !  C  )T/               !#                ""##%     J   !#      O    J    k     k   L !#  O k d; !DL !NK   % *  N k     k F     k L !# O   r$