Ng +ddlmZmZddlmZddlmZmZmZmZm Z m Z ddl m Z m Z ddlmZmZmZmZeeefZeedfZeedfZGdd e d ZGd d e d ZGdde ZGdde ZGdde ZGdde d ZGdde d ZGdde d ZGdde d ZGddeeZ Gdde d Z!Gd d!e d Z"Gd"d#e Z#Gd$d%e Z$Gd&d'e Z%Gd(d)e Z&Gd*d+e Z'Gd,d-e Z(Gd.d/e Z)Gd0d1e Z*Gd2d3e Z+Gd4d5e Z,Gd6d7e Z-Gd8d9e d Z.Gd:d;eeZ/Gd<d=e Z0Gd>d?e Z1Gd@dAe Z2GdBdCe Z3GdDdEe Z4GdFdGeeZ5GdHdIe Z6GdJdKe Z7GdLdMe Z8GdNdOe Z9GdPdQe d Z:GdRdSe d Z;GdTdUe d Z<GdVdWe d Z=GdXdYe Z>GdZd[e d Z?Gd\d]e d Z@Gd^d_e d ZAGd`dae d ZBGdbdce d ZCGdddee d ZDGdfdgeeZEGdhdie d ZFGdjdkeeZGGdldme d ZHGdndoe d ZIGdpdqe d ZJGdrdse d ZKGdtdue d ZLGdvdwe d ZMGdxdye d ZNGdzd{e d ZOGd|d}eeZPGd~deeZQGdde d ZRGdde d ZSGdde d ZTGdde d ZUGddeeZVGdde d ZWGdde d ZXGdde d ZYGdde d ZZGdde Z[Gdde Z\Gdde d Z]Gdde Z^Gdde Z_Gdde d Z`Gdde d ZaGdde d ZbGdde d ZcGddeeZdGddeeZeGdde d ZfGdde d ZgGdde d ZhGddeeZiGdde d ZjGdde d ZkGdde d ZlGdde d ZmGdde ZnGdde ZoGdde d ZpGdde ZqGdde d ZrGd„de ZsGdĄde ZtGdƄde d ZuGdȄde ZvGdʄde ZwGd̄de ZxGd΄de ZyGdЄde ZzGd҄de Z{GdԄde Z|Gdքde Z}Gd؄de Z~Gdڄde ZGd܄de ZGdބde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde ZGdde d ZGddeeZGdde d ZGdde d ZGdde d ZGddeeZGdd e ZGd d e ZGd d e d ZGdde d ZGdde d ZGdde d ZGdde d ZGdde d ZGdde ZGdde d ZGddeeZGdde d ZGd d!e d ZGd"d#eeZGd$d%e d ZGd&d'e d ZGd(d)e d ZGd*d+e d ZGd,d-e d ZGd.d/e d ZGd0d1e ZGd2d3e ZGd4d5e ZGd6d7e d ZGd8d9eeZGd:d;e ZGd<d=e d ZGd>d?e d ZGd@dAe d ZGdBdCe ZGdDdEe d ZGdFdGe ZGdHdIe ZGdJdKeeZGdLdMe d ZGdNdOe d ZGdPdQe ZGdRdSe ZGdTdUe ZGdVdWe ZGdXdYe d ZGdZd[e d ZGd\d]e d ZGd^d_e d ZGd`dae d ZGdbdce d ZGdddee d ZGdfdge d ZGdhdie d ZGdjdke d ZGdldme d ZGdndoe d ZGdpdqe d ZGdrdse ZGdtdue ZGdvdwe d ZGdxdyeeZGdzd{e d ZGd|d}e d ZGd~de d ZGdde d ZGdde d ZGddeeZGdde ZGdde ZGdde ZGdde d ZGdde d ZGdde d ZGdde ZGddeeZGdde d ZGdde d ZGdde ZGddeeZGddeeZGdde ZGdde d ZGdde d ZGdde ZGddeeZGdde d ZGdde d ZGdde d ZGddeeZGdde ZGdde d ZGdde ZGdde d ZGdde ZGdde ZGdde ZGdde d ZGd„de d ZGdĄde d ZGdƄde d ZGdȄde ZGdʄde ZGd̄de ZGd΄deeZGdЄde d ZGd҄de d ZGdԄde d ZGdքdeeZGd؄de ZGdڄdeeZGd܄deeZGdބdeeZGddeeZGdde ZGddeeZGdde d ZGdde ZGdde d ZGddeeZGddeeZ GddeeZ Gdde d Z Gdde Z Gdde d Z GddeeZGdde ZGdde d ZGddeeZGddeeZGddeeZGdde ZGdde ZGdde ZGd d e d ZGd d e d ZGd de ZGddeeZGdde d ZGdde d ZGdde d ZGdde d ZGddeeZGdde d Z Gdde Z!Gdd e Z"Gd!d"e Z#Gd#d$e d Z$Gd%de d Z%Gd&d'eeZ&Gd(d)eeZ'Gd*d+eeZ(Gd,d-eeZ)Gd.d/eeZ*Gd0d1e Z+Gd2d3e Z,Gd4d5e d Z-Gd6d7e Z.Gd8d9e d Z/Gd:d;eeZ0e e@eJefZ1e eeeefZ2e eeeeXeDeZefZ3e e$e%fZ4e e0e1fZ5e e`eeepeeafZ6e e7e8e9fZ7e e;ee;fZ8e eefZ9e eeefZ:e eefZ;e esetfZe eefZ?e eefZ@e eefZAe eeeceheeeFefZBe eefZCe eefZDe eefZEe eebfZFe eeefZGe eeeeQfZHe eeeSe "?????r"r/ceZdZUeddZeed<eddZeed<eddZeed<eddZ eed<dS) r4.rrdebug web_featureservice_debug_feature recovery_modeN) rrrr r=r;r r>r?r@r!r"r#r4r4&s%,,,E4,,,cr222K222"'%"<"<"<4<<<%444M444444r"r4ceZdZUeddZeded<eddZded<edd Ze ed ed <dS) Batch.rrExtendedPointIdidsBatchVectorStructvectorsNr2Payloadpayloads) rrrr rDrr rFrHr r!r"r#rBrB-s#(5"#=#=#=C ===#(5"#=#=#=G ===*/%"*M*M*MHhtI'MMMMMr"rBc4eZdZUeddZded<dS)BinaryQuantization.rrBinaryQuantizationConfigbinaryN)rrrr rLr r!r"r#rJrJ32).s)C)C)CF &CCCCCr"rJc@eZdZUeddZeeed<dS)rKNrr2 always_ram)rrrr rOr r;r r!r"r#rKrK7s5!&t!D!D!DJDDDDDr"rKc4eZdZUeddZded<dS)BoolIndexParams.rr BoolIndexTypetypeN)rrrr rSr r!r"r#rQrQ;s1!E#2666D/66666r"rQceZdZdZdS)rRr;N)rrrBOOLr!r"r#rRrR? DDDr"rRcDeZdZUdZeddZeded<dS)ChangeAliasesOperationz Operation for performing changes of collection aliases. Alias changes are atomic, meaning that no collection modifications can happen between alias operations. .zOperation for performing changes of collection aliases. Alias changes are atomic, meaning that no collection modifications can happen between alias operations.rAliasOperationsactionsN)rrr__doc__r rZrr r!r"r#rXrXCsX(-u v(((GT# $r"rXc4eZdZUeddZded<dS)ClearPayloadOperation.rrPointsSelector clear_payloadN)rrrr r_r r!r"r#r]r]Ns2&+eCR&@&@&@M#@@@@@r"r]c|eZdZUeddZeed<eddZded<eddZded<d S) ClusterConfigTelemetry.rrgrpc_timeout_msP2pConfigTelemetryp2pConsensusConfigTelemetry consensusN) rrrr rbrr rdrfr!r"r#raraRsq 5"555OS555 %cr : : :C :::,1E#2,F,F,FI)FFFFFr"rac@eZdZUeddZeded<dS)ClusterStatusOneOf.rr)disabledstatusN)rrrr rjr r r!r"r#rhrhXsH cr""" G #####r"rhceZdZUdZeddZeded<eddZe ed<edd Z e e d fed <eddZ d ed <eddZded<eddZe e dfed<dS)ClusterStatusOneOf1z( Description of enabled cluster .zDescription of enabled clusterr)enabledrjID 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)rrrr[r rjr r rorrqrr-rsrurwr!r"r#rlrl^s c?@@@ G AAA5*;<<CeD^u>v>v>v8D)9$:;vvvvvr"rceZdZUeddZded<eddZded<eddZded <eddZd ed <ed d Z e ded<d S)CollectionConfig.rrCollectionParamsparams HnswConfig hnsw_configOptimizersConfigoptimizer_config WalConfig wal_configNr2QuantizationConfigquantization_config) rrrr rr rrrrr r!r"r#rrs!&s!;!;!;F ;;; %cr : : :K:::+05"+E+E+E(EEE#eCR888J 888:?%Z\:]:]:]"67]]]]]r"rc4eZdZUeddZeed<dS)CollectionDescription.rrr0N)rrrr r0r-r r!r"r#rrs1cr***D#*****r"rc8eZdZUdZeddZeed<dS)CollectionExistencezS State of existence of a collection, true = exists, false = does not exist .zIState of existence of a collection, true = exists, false = does not existrexistsN)rrrr[r rr;r r!r"r#rrs>5*uvvvFDvvvvvr"rcheZdZUdZeddZded<eddZded<ed d Ze e ed <ed d Z e e ed<ed d Z e e ed<eddZ e ed<eddZded<eddZeedfed<d S)CollectionInfoz@ Current statistics and configuration of the collection .z6Current statistics and configuration of the collectionrCollectionStatusrjOptimizersStatusoptimizer_statusNzDEPRECATED: Approximate number of vectors in collection. All vectors in collection are available for querying. Calculated as `points_count x vectors_per_point`. Where `vectors_per_point` is a number of named vectors in schema.r2 vectors_countzApproximate number of indexed vectors in the collection. Indexed vectors in large segments are faster to query, as it is stored in a specialized vector index.indexed_vectors_countzkApproximate number of points (vectors + payloads) in collection. Each point could be accessed by unique id. points_countzXNumber of segments in collection. Each segment has independent vector as payload indexessegments_countrrzTypes of stored payloadPayloadIndexInfopayload_schema)rrrr[r rjr rrr rrrrrrrr-r!r"r#rrs"'s8p!q!q!qF qqq+05 Q,,,($)5y$$$M8C=,15u,,,8C=#(%B###L(3- % sNC"'s8p!q!q!qF qqq49E#Kd4e4e4eND001eeeeer"rceZdZUeddZeded<eddZeeed<edd Z ed ed <edd Z eeed <eddZ eeed<eddZ eeed<eddZ eeed<eddZeeedfed<dS)rNrr2 VectorsConfigrFz#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_factorFIf 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.on_disk_payloadz*Configuration of the sparse vector storagersparse_vectors)rrrr rFr r rrrrrrrr;rrr-r!r"r#rrs).t)L)L)LGXo &LLL"'%?d"e"e"eL(3-eee27%p333OX./).aEh(i(i(i iii.3eg///hsm*/}***#',ek'''OXd^AF"NAAANHT#';";<=r"rceZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z ee ed <dS) CollectionParamsDiffNrr2rzRMinimal number successful responses from replicas to consider operation successfulrzfFan-out every read request to these many additional remote nodes (and return first available response)rrr) rrrr rr rr rrrr;r!r"r#rrs(-dHk(l(l(l lll.3e"v///hsm*/|***#',ek'''OXd^r"rc.eZdZdZdefdZdZdZdZdZ dS) rz Current state of the collection. `Green` - all good. `Yellow` - optimization is running, 'Grey' - optimizations are possible but not triggered, `Red` - some operations failed and was not recovered returnc*t|jSNr-valueselfs r#__str__zCollectionStatus.__str__4:r"greenyellowgreyredN rrrr[r-rGREENYELLOWGREYREDr!r"r#rrI E F D CCCr"rc eZdZUeddZeed<eddZeed<eddZ ded<eddZ e ded <eddZ e d ed <eddZ e d ed <dS)CollectionTelemetry.rrid init_time_msrrReplicaSetTelemetryshardsr transfersr reshardingN)rrrr rr-r rrrrrrrr!r"r#rrseCR(((B(((cr222L#222!&s!;!;!;F ;;;*/%*D*D*DFD& 'DDD+05"+E+E+EIt'(EEE).s)C)C)CJ%&CCCCCr"rc|eZdZUeddZeed<eddZded<eddZded<d S) CollectionsAggregatedTelemetry.rrrFroptimizers_statusrrN) rrrr rFrr rrr!r"r#rrsr5"---GS---,1E#2,F,F,F)FFF!&s!;!;!;F ;;;;;r"rc@eZdZUeddZeded<dS)CollectionsAliasesResponse.rrr*aliasesN)rrrr rrr r!r"r#rrs7(-cr(B(B(BGT$ %BBBBBr"rc@eZdZUeddZeded<dS)CollectionsResponse.rrr collectionsN)rrrr rrr r!r"r#rr s716s1K1K1KK-.KKKKKr"rcpeZdZUeddZeed<eddZee ded<dS) CollectionsTelemetry.rrnumber_of_collectionsNr2CollectionTelemetryEnumr) rrrr rrr rr rr!r"r#rr s]!&s!;!;!;3;;;=BU4]_=`=`=`K$89:`````r"rc"eZdZdZdZdZdZdZdS)CompressionRatiox4x8x16x32x64N)rrrX4X8X16X32X64r!r"r#rrs' B B C C CCCr"rc|eZdZUeddZeed<eddZeed<eddZeed<dS)re.rrmax_message_queue_sizetick_period_msbootstrap_timeout_secN) rrrr rrr rrr!r"r#reresq"'%"<"<"<C<<<%444NC444!&s!;!;!;3;;;;;r"recteZdZUeddZeded<eddZee e fed<dS)ConsensusThreadStatusOneOf.rr)workingru last_updateN) rrrr rur r rr rrr!r"r#rr sn cr"""W###*/s)C)C)CKx~&CCCCCr"rc@eZdZUeddZeded<dS)ConsensusThreadStatusOneOf1.rr)stoppedruN)rrrr rur r r!r"r#rr'sH cr"""W#####r"rcdeZdZUeddZeded<eddZeed<dS)ConsensusThreadStatusOneOf2.rr)stopped_with_errruerrN) rrrr rur r rr-r!r"r#rr-se cr"""W###uSb)))C)))))r"rcXeZdZUeddZded<eddZded<dS)ContextExamplePair.rrRecommendExamplepositivenegativeNrrrr rr rr!r"r#rr4sR#(5"#=#=#=H ===#(5"#=#=#=H =====r"rcXeZdZUeddZded<eddZded<dS) ContextPair.rr VectorInputrrNrr!r"r#rr9sP#eCR888Hm888#eCR888Hm88888r"rc4eZdZUeddZded<dS) ContextQuery.rr ContextInputcontextN)rrrr r r r!r"r#r r >s1#eCR888G^88888r"r ceZdZUdZeddZeded<eddZeded <ed d Z ee ed <dS) 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 shardsr2ShardKeySelector 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) rrrr[r rr r rrr;r!r"r#rrBs/4ek///Ix*+"'tAw!x!x!xFHX xxx!ECE8D>r"rc4eZdZUeddZeed<dS) CountResult.z-Number of points which satisfy the conditionsrcountN)rrrr rrr r!r"r#rrRs2s(WXXXE3XXXXXr"rc\eZdZUdZeddZeed<eddZeed<dS) CreateAliaszw Create alternative name for a collection. Collection will be available under both names for search, retrieve, .zmCreate alternative name for a collection. Collection will be available under both names for search, retrieve,rr,r+N) rrrr[r r,r-r r+r!r"r#rrVs!5 DOSe DJr"rc4eZdZUeddZded<dS)CreateAliasOperation.rrr create_aliasN)rrrr rr r!r"r#rres1"'%"<"<"AAANHT#';";<=r"r cdeZdZUeddZeed<eddZeded<dS) CreateFieldIndex.rr field_nameNr2PayloadFieldSchema field_schema) rrrr r+r-r r-r r!r"r#r*r*sWeCR000J000385SU3V3V3VL(/0VVVVVr"r*ceZdZUeddZded<eddZeeed <edd Z eeed <edd Z ee eed <dS)CreateShardingKey.rrShardKeyrNz_How many shards to create for this key If not specified, will use the default value from configr2 shards_numberzcHow many replicas to create for each shard If not specified, will use the default value from configrzPlacement of shards for this key List of peer ids, that can be used to place shards for this key If not specified, will be randomly placed among all peers placement) rrrr rr r1r rrr2rr!r"r#r/r/s!E#2666Iz666#(5u$$$M8C=).y))) &+Uq&&&IxS "r"r/c4eZdZUeddZded<dS)CreateShardingKeyOperation.rrr/create_sharding_keyN)rrrr r5r r!r"r#r4r4s3/4uSb/I/I/I,IIIIIr"r4ceZdZdZdZdZdS)Datatypefloat32uint8float16N)rrrFLOAT32UINT8FLOAT16r!r"r#r7r7sG EGGGr"r7ceZdZUeddZded<eddZeeed <edd Z eeed <dS) DatetimeIndexParams.rrDatetimeIndexTyperSNIf 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.r2 is_principal1If true, store the index on disk. Default: false.on_disk rrrr rSr rBr r;rDr!r"r#r?r?s %cr : : :D :::#(5j$$$L(4.$eD>qrrrGXd^rrrrrr"r?ceZdZdZdS)r@rN)rrrDATETIMEr!r"r#r@r@HHHr"r@ceZdZUdZeddZeeee fe d<eddZ eeee fe d<eddZ eeee fe d <edd Z eeee fe d <dS) DatetimeRange Range filter request Npoint.key < range.ltr2ltpoint.key > range.gtgtpoint.key >= range.gtegtepoint.key <= range.ltelte)rrrr[r rMr r rrr rOrQrSr!r"r#rJrJs+0%Jc*d*d*dBx~&'ddd*/%Jc*d*d*dBx~&'ddd+05Kf+g+g+gC%$' (ggg+05Kf+g+g+gC%$' (gggggr"rJc8eZdZUdZeddZeed<dS) DeleteAlias Delete alias if exists .Delete alias if existsrr+N)rrrr[r r+r-r r!r"r#rUrUs>eC-EFFFJFFFFFr"rUc8eZdZUdZeddZded<dS)DeleteAliasOperationrV.rWrrU delete_aliasN)rrrr[r rZr r!r"r#rYrYs>#(%9Q"R"R"RL-RRRRRr"rYc4eZdZUeddZded<dS)DeleteOperation.rrr^deleteN)rrrr r]r r!r"r#r\r\s2$uSb999F 99999r"r\ceZdZUdZeddZeeed<eddZ e ed ed <edd Z e d ed <eddZ e ded<dS) DeletePayloadY This data structure is used in API interface and applied across multiple shards .z+List of payload keys to remove from payloadrkeysN+Deletes values from each point in this listr2rCpoints=Deletes values from points that satisfy this filter conditionrrOThis data structure is used in API interface and applied across multiple shardsrr) rrrr[r rarr-r rcr rrr!r"r#r_r_seC-Z[[[D$s)[[[05"O111FHT+, -"'"a"""FHX /4e"s///Ix*+r"r_c4eZdZUeddZded<dS)DeletePayloadOperation.rrr_delete_payloadN)rrrr rhr r!r"r#rgrg1&+eCR&@&@&@NO@@@@@r"rgceZdZUeddZeeded<eddZeded<ed d Z ee ed <edd Z eded<dS) DeleteVectorsNrbr2rCrcrdrr.z Vector namesrvectorrrr) rrrr rcr rr rrlr-rr!r"r#rkrks05"O111FHT+, -"'"a"""FHX c~>>>FDI>>>.3eDb.Q.Q.QIx*+QQQQQr"rkc4eZdZUeddZded<dS)DeleteVectorsOperation.rrrkdelete_vectorsN)rrrr ror r!r"r#rnrnrir"rnceZdZdZdZdS) DirectionascdescN)rrrASCDESCr!r"r#rqrqs C DDDr"rqceZdZdZdS)DisabledN)rrrDISABLEDr!r"r#rwrw rHr"rwcteZdZUeddZded<eddZeeddfed<d S) DiscoverInput.rrr targetz:Search space will be constrained by these pairs of vectorsrr N) rrrr r{r r r rr!r"r#rzrzsq!E#2666FM6669> U:::GU4 & 5 6r"rzc4eZdZUeddZded<dS) DiscoverQuery.rrrzdiscoverN)rrrr r~r r!r"r#r}r}s1 %cr : : :Ho:::::r"r}c$eZdZUdZeddZeded<eddZeded <edd Z ee d ed <edd Z eded<eddZ eded<eddZ eed<eddZeeed<eddZeded<eddZeded<eddZed ed!<edd"Zed#ed$<dS)%DiscoverRequestz_ Use context and a target to find the most similar points, constrained by the context. Nrr2rrzLook 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.rr{aPairs 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.rr rrrAdditional 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)rrrr[r rr r r{r rrrrrrrrrrr!r"r#rrs?/4ek///Ix*+,15D,,,FH' (5:E^ 555GXd/0 1"'tAw!x!x!xFHX xxx',uTGa'b'b'bFH^ $bbbs(HIIIE3III!EUFHSM6;U"g666L(12+0%"t+++K,'&+Uq&&&E8M "/4e|///K*+r"rc@eZdZUeddZeded<dS)DiscoverRequestBatch.rrrsearchesNrrrr rrr r!r"r#rrCs7(-cr(B(B(BHd$%BBBBBr"rc.eZdZdZdefdZdZdZdZdZ dS) Distancezc Type of internal tags, build from payload Distance function types used to compare vectors rc*t|jSrrrs r#rzDistance.__str__Lrr"CosineEuclidDot ManhattanN) rrrr[r-rCOSINEEUCLIDDOT MANHATTANr!r"r#rrGsIF F CIIIr"rcheZdZUdZeddZeed<eddZe eed <dS) Documentz WARN: Work-in-progress, unimplemented Text document for embedding. Requires inference infrastructure, unimplemented. .zCText document to be embedded by FastEmbed or Cloud inference serverrtextNz/Model name to be used for embedding computationr2model) rrrr[r rr-r rr r!r"r#rrUsbc'lmmmD#mmm 5;lmmmE8C=mmmmmr"rc4eZdZUeddZded<dS)DropReplicaOperation.rrReplica drop_replicaN)rrrr rr r!r"r#rr^s1#eCR888L)88888r"rc4eZdZUeddZded<dS)DropShardingKey.rrr0rN)rrrr rr r!r"r#rrbs1!E#2666Iz66666r"rc4eZdZUeddZded<dS)DropShardingKeyOperation.rrrdrop_sharding_keyN)rrrr rr r!r"r#rrfs3+05"+E+E+E(EEEEEr"rceZdZUeddZeeed<eddZeded<eddZ ee ed<dS) ErrorResponseN"Time spent to process this requestr2timerErrorResponseStatusrjresult) rrrr rr floatr rjrrr!r"r#rrjs~!E$<`aaaD(5/aaa.3eDb.Q.Q.QFH* +QQQ!E$B???FHSM?????r"rc@eZdZUeddZeeed<dS)rNz"Description of the occurred error.r2error)rrrr rr r-r r!r"r#rrps6 5;_```E8C=`````r"rceZdZUeddZeded<eddZeed <edd Z ee ed <edd Z ed ed<eddZ ee ed<dS) FacetRequestNrr2rr.z Payload key to use for faceting.rkeyz,Max number of hits to return. Default is 10.rzGFilter conditions - only consider points that satisfy these conditions.rrzaWhether to do a more expensive exact count for each of the values in the facet. Default is false.r)rrrr rr r rr-rrrrr;r!r"r#rrts.3eDb.Q.Q.QIx*+QQQuS&HIIICIII 5;ijjjE8C=jjj!&"k"""FHX "EwE8D>r"rc@eZdZUeddZeded<dS) FacetResponse.rr FacetValueHithitsN)rrrr rrr r!r"r#rrs6"'%"<"<"Ce"Q???FHU4 ,k9: ;)."\)))J%=BE$\wqrrrGXd^rrrrrr"rceZdZdZdS)rrN)rrrFLOATr!r"r#rrs EEEr"rc&eZdZdZdefdZdZdZdS)Fusionz Fusion algorithm allows to combine results of multiple prefetches. Available fusion algorithms: * `rrf` - Reciprocal Rank Fusion * `dbsf` - Distribution-Based Score Fusion rc*t|jSrrrs r#rzFusion.__str__rr"rrfdbsfN)rrrr[r-rRRFDBSFr!r"r#rrs? C DDDr"rc4eZdZUeddZded<dS) FusionQuery.rrrfusionN)rrrr rr r!r"r#rr1uSb111FH11111r"rc\eZdZUdZeddZded<eddZded<dS) rz 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)rrrr[r rr rr!r"r#rrs!5 PHj %u P   L*r"rcdeZdZUeddZded<eddZeeed <dS) GeoIndexParams.rr GeoIndexTyperSNrCr2rD) rrrr rSr rDr r;r!r"r#rrsU 5"555D.555#eD>qrrrGXd^rrrrrr"rceZdZdZdS)rgeoN)rrrGEOr!r"r#rrs CCCr"rcDeZdZUdZeddZeded<dS) GeoLineStringz= Ordered sequence of GeoPoints representing the line .z3Ordered sequence of GeoPoints representing the linerrrcN)rrrr[r rcrr r!r"r#rrsC %uS6klllFD lllllr"rc\eZdZUdZeddZeed<eddZeed<dS)rz" Geo point payload schema .zGeo point payload schemarlonlatN) rrrr[r rrr rr!r"r#rrs^s(BCCCCCCCs(BCCCCCCCCCr"rcteZdZUdZeddZded<edd Zee ded <dS) rzk 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.r2 interiors) rrrr[r rr rr rr!r"r#rrs!& w!!!Ho27{222Ix_-.r"rc\eZdZUdZeddZded<eddZeed<d S) rzt 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) rrrr[r rr rrr!r"r#rrsp AFJE#+IJJJFEJJJJJr"rc@eZdZUeddZeded<dS) GroupsResult.rr PointGroupgroupsN)rrrr rrr r!r"r#rrs6!&s!;!;!;FD ;;;;;r"rcDeZdZUeddZeedfed<dS) GrpcTelemetry.rrOperationDurationStatistics responsesNrrrr rrr-r r!r"r#rrs=:?%QS:T:T:TItC667TTTTTr"rcDeZdZUdZeddZeded<dS)HasIdConditionz& ID-based filtering condition .zID-based filtering conditionrrChas_idN)rrrr[r rrr r!r"r#rrsD',eC=[&\&\&\FD" #\\\\\r"rceZdZUdZeddZeed<eddZeed<eddZ eed <ed d Z e eed <edd Z e e ed<edd Ze eed<dS)rz Config of HNSW index .nNumber of edges per node in the index graph. Larger the value - more accurate the search, more space required.rmzNumber of neighbours to consider during the index building. Larger the value - more accurate the search, more time required to build index. ef_constructa=Minimal size (in KiloBytes) of vectors for additional payload-based indexing. If payload chunk is smaller than `full_scan_threshold_kb` additional indexing won't be used - in this case full-scan search should be preferred by query planner and additional indexing is not required. Note: 1Kb = 1 vector of size 256full_scan_thresholdrzNumber of parallel threads used for background index building. If 0 - automatically select from 8 to 16. Best to keep between 8 and 16 to prevent likelihood of slow building or broken/inefficient HNSW graphs. On small CPUs, less threads are used.r2max_indexing_threadsNzVStore HNSW index on disk. If set to false, index will be stored in RAM. Default: falserDzZCustom M param for hnsw graph built for payload index. If not set, default M will be used. payload_m)rrrr[r r rr r r rr rDr;rr!r"r#rrsTU EAs bL# %u T   +0%M+++(3-$elGXd^ %up   Ix}r"rc0eZdZUeddZeeed<eddZeeed<eddZ eeed<edd Z eeed <edd Z ee ed <edd Z eeed<dS)r#Nr r2r zNumber of neighbours to consider during the index building. Larger the value - more accurate the search, more time required to build the index.r a=Minimal size (in kilobytes) of vectors for additional payload-based indexing. If payload chunk is smaller than `full_scan_threshold_kb` additional indexing won't be used - in this case full-scan search should be preferred by query planner and additional indexing is not required. Note: 1Kb = 1 vector of size 256r zNumber 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: falserDz[Custom M param for additional payload-aware HNSW links. If not set, default M will be used.r)rrrr r r rr r r rrDr;rr!r"r#r#r#>sTuEAx}#(%f###L(3-*/T***#+0%E+++(3-$epGXd^ %uq   Ix}r"r#cheZdZUdZeddZeded<eddZe ed<dS) IndexesOneOfz Do not use any index, scan whole vector collection during search. Guarantee 100% precision, but may be time consuming on large collections. .zDo not use any index, scan whole vector collection during search. Guarantee 100% precision, but may be time consuming on large collections.r)plainrSoptionsN) rrrr[r rSr r rrr!r"r#rrYs$e bD'( 5 bGSr"rcheZdZUdZeddZeded<eddZded<d S) IndexesOneOf1z Use filterable HNSW index for approximate search. Is very fast even on a very huge collections, but require additional space to store index and additional time to build it. .zUse filterable HNSW index for approximate search. Is very fast even on a very huge collections, but require additional space to store index and additional time to build it.r)hnswrSrrN) rrrr[r rSr r rr!r"r#rrhs#U CD'' "E CG\r"rc8eZdZUdZeddZeed<dS)r'r!.r"r collectionN)rrrr[r rr-r r!r"r#r'r'wsOe fJr"r'ceZdZUeddZeeed<eddZee ed<eddZ ee ed<dS)InlineResponse200Nrr2rrrjr) rrrr rr rr rjr-rr;r!r"r#rrs|!E$<`aaaD(5/aaa!E$B???FHSM???"U4R@@@FHTN@@@@@r"rceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2001Nrr2rrrj TelemetryDatar rrrr rr rr rjr-rr!r"r#rr}!E$<`aaaD(5/aaa!E$B???FHSM???(-d(K(K(KFH_ %KKKKKr"rceZdZUeddZeeed<eddZee ed<eddZ ee ded<dS) InlineResponse20010Nrr2rrrjSnapshotDescriptionr rrrr rr rr rjr-rrr!r"r#r"r"s!E$<`aaaD(5/aaa!E$B???FHSM???49E$TV4W4W4WFHT/0 1WWWWWr"r"ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20011Nrr2rrrjr#rrr!r"r#r&r&~!E$<`aaaD(5/aaa!E$B???FHSM???.3eDb.Q.Q.QFH* +QQQQQr"r&ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20012Nrr2rrrjRecordrrr!r"r#r)r)s}!E$<`aaaD(5/aaa!E$B???FHSM???!&t!D!D!DFHX DDDDDr"r)ceZdZUeddZeeed<eddZee ed<eddZ ee ded<dS) InlineResponse20013Nrr2rrrjr*rr$r!r"r#r,r,s!E$<`aaaD(5/aaa!E$B???FHSM???',uTr'J'J'JFHT(^ $JJJJJr"r,ceZdZUeddZeeed<eddZee ed<eddZ ee ded<dS) InlineResponse20014Nrr2rrrj UpdateResultrr$r!r"r#r.r.s!E$<`aaaD(5/aaa!E$B???FHSM???-2U4R-P-P-PFHT.) *PPPPPr"r.ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20015Nrr2rrrj ScrollResultrrr!r"r#r1r1}!E$<`aaaD(5/aaa!E$B???FHSM???',uTr'J'J'JFH^ $JJJJJr"r1ceZdZUeddZeeed<eddZee ed<eddZ ee ded<dS) InlineResponse20016Nrr2rrrj ScoredPointrr$r!r"r#r5r5s!E$<`aaaD(5/aaa!E$B???FHSM???,1E$B,O,O,OFHT-( )OOOOOr"r5ceZdZUeddZeeed<eddZee ed<eddZ ee e ded<dS) InlineResponse20017Nrr2rrrjr6rr$r!r"r#r8r8s!E$<`aaaD(5/aaa!E$B???FHSM???27%RT2U2U2UFHT$}-. /UUUUUr"r8ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20018Nrr2rrrjrrrr!r"r#r:r:r3r"r:ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20019Nrr2rrrjrrrr!r"r#r<r<}!E$<`aaaD(5/aaa!E$B???FHSM???&+eDb&I&I&IFH] #IIIIIr"r<ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2002Nrr2rrrj LocksOptionrrr!r"r#r?r?r=r"r?ceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20020Nrr2rrrjrrrr!r"r#rBrBr r"rBceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20021Nrr2rrrj QueryResponserrr!r"r#rDrDr r"rDceZdZUeddZeeed<eddZee ed<eddZ ee ded<dS) InlineResponse20022Nrr2rrrjrErr$r!r"r#rGrGs!E$<`aaaD(5/aaa!E$B???FHSM???.3eDb.Q.Q.QFHT/* +QQQQQr"rGceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20023Nrr2rrrjSearchMatrixPairsResponserrr!r"r#rIrIs!E$<`aaaD(5/aaa!E$B???FHSM???49E$TV4W4W4WFH0 1WWWWWr"rIceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse20024Nrr2rrrjSearchMatrixOffsetsResponserrr!r"r#rLrLs!E$<`aaaD(5/aaa!E$B???FHSM???6;eDVX6Y6Y6YFH2 3YYYYYr"rLceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2003Nrr2rrrj ClusterStatusrrr!r"r#rOrOr r"rOceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2004Nrr2rrrjrrrr!r"r#rRrRr'r"rRceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2005Nrr2rrrjrrrr!r"r#rTrTs~!E$<`aaaD(5/aaa!E$B???FHSM???).t)L)L)LFH% &LLLLLr"rTceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2006Nrr2rrrjr/rrr!r"r#rVrVr3r"rVceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2007Nrr2rrrjrrrr!r"r#rXrXr'r"rXceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2008Nrr2rrrjrrrr!r"r#rZrZ s!E$<`aaaD(5/aaa!E$B???FHSM???05dPR0S0S0SFH, -SSSSSr"rZceZdZUeddZeeed<eddZee ed<eddZ eded<dS) InlineResponse2009Nrr2rrrjrrrr!r"r#r\r\s!E$<`aaaD(5/aaa!E$B???FHSM???5:U4UW5X5X5XFH1 2XXXXXr"r\cpeZdZUeddZeeed<eddZee ed<dS)InlineResponse202Nrr2rrrj) rrrr rr rr rjr-r!r"r#r^r^sY!E$<`aaaD(5/aaa!E$B???FHSM?????r"r^ceZdZUeddZded<eddZeeed <edd Z eeed <edd Z eeed <eddZ eeed<dS)IntegerIndexParams.rrIntegerIndexTyperSNz!If true - support direct lookups.r2lookupz!If true - support ranges filters.rrArBrCrD) rrrr rSr rbr r;rrBrDr!r"r#r`r`s$uSb999D 999"U4=`aaaFHTNaaa!E$<_```E8D>```#(5j$$$L(4.$eD>qrrrGXd^rrrrrr"r`ceZdZdZdS)raintegerN)rrrINTEGERr!r"r#rara'GGGr"rac8eZdZUdZeddZded<dS)IsEmptyConditionz@ Select points with empty payload for a specified field .z6Select points with empty payload for a specified fieldr PayloadFieldis_emptyN)rrrr[r rjr r!r"r#rhrh+s> %uS6noooHnooooor"rhc8eZdZUdZeddZded<dS)IsNullConditionz? Select points with null payload for a specified field .z5Select points with null payload for a specified fieldrriis_nullN)rrrr[r rmr r!r"r#rlrl3s>$eC5lmmmG^mmmmmr"rlceZdZUeddZded<eddZeeed <edd Z eeed <dS) KeywordIndexParams.rrKeywordIndexTyperSNz7If true - used for tenant optimization. Default: false.r2 is_tenantrCrD rrrr rSr rqr r;rDr!r"r#roro;s$uSb999D 999 %"[!!!Ix~$eD>qrrrGXd^rrrrrr"roceZdZdZdS)rpkeywordN)rrrKEYWORDr!r"r#rprpCrfr"rpceZdZUeddZeed<eddZeded <edd Z eed <edd Z d ed<dS)r.zLocal shard idrrNUser-defined sharding keyr2r0rzNumber of points in the shardrr ReplicaStatestate) rrrr rrr rr rryr!r"r#rrGsE#+;<<66666r"rceZdZUeddZeeed<eddZeded<edd Z e ed <edd Z e d ed <edd Z d ed<dS)LocalShardTelemetryNrr2 variant_name ShardStatusrj.z6Total number of optimized points since the last start.rtotal_optimized_pointsSegmentTelemetrysegmentsOptimizerTelemetry optimizations)rrrr r|r r-r rjr~rrrrr!r"r#r{r{Ns"'%""E"E"EL(3-EEE&+eDb&I&I&IFH] #III"'%9q"r"r"rCrrr).s)C)C)CHd%&CCC*/%*D*D*DM'DDDDDr"r{cdeZdZUeddZeeed<eddZe ed<dS)r@Nrr2 error_message.rwrite) rrrr rr r-r rr;r!r"r#r@r@VsT#(52#F#F#FM8C=FFF%,,,E4,,,,,r"r@ceZdZUdZeddZeed<eddZe eed <edd Z e d ed <dS) rzj Defines a location to use for looking up the vector. Specifies collection and vector field name. .z&Name of the collection used for lookuprrNzpOptional name of the vector field within the collection. If not provided, the default vector field will be used.r2rlrrr) rrrr[r rr-r rlr rr!r"r#rr[seC-UVVVJVVV!EGFHSM/4ek///Ix*+r"rc8eZdZUdZeddZded<dS)MatchAnyz0 Exact match on any of the given values .z&Exact match on any of the given valuesr AnyVariantsanyN)rrrr[r rr r!r"r#rrks>s0XYYYCYYYYYr"rc:eZdZUdZedddZded<dS) MatchExceptzJ Should have at least one value not matching the any given values .z@Should have at least one value not matching the any given valuesexceptraliasrexcept_N)rrrr[r rr r!r"r#rrssR#U [ckG]r"rc8eZdZUdZeddZeed<dS) MatchTextz) Full-text match of the strings. .zFull-text match of the strings.rrN)rrrr[r rr-r r!r"r#rr}s>c'HIIID#IIIIIr"rc8eZdZUdZeddZded<dS) MatchValuez( Exact match of the given value .zExact match of the given valuer ValueVariantsrN)rrrr[r rr r!r"r#rrs>#U34TUUUE?UUUUUr"rceZdZUdZeddZeed<eddZe e ed<edd Z e e e efed <dS) rvz5 Message send failures for a particular peer .z+Message send failures for a particular peerrrNr2 latest_errorzTimestamp of the latest errorlatest_error_timestamp)rrrr[r rrr rr r-rr rrr!r"r#rvrvss(UVVVE3VVV"'%Bo"p"p"pL(3-ppp>Ce"A???HU8T>%:;r"rvcdeZdZUeddZeded<eddZeed<dS)r.rrr conditions min_countN) rrrr rrr rrr!r"r#rrsU$)E#2$>$>$>J[!>>>U3B///Is/////r"rc&eZdZdZdefdZdZdZdS)Modifierz If used, include weight modification, which will be applied to sparse vectors at query time: None - no modification (default) Idf - inverse document frequency, based on statistics of the collection rc*t|jSrrrs r#rzModifier.__str__rr"noneidfN)rrrr[r-rNONEIDFr!r"r#rrs? D CCCr"rceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <dS) MoveShard.rrrrrN:Method for transferring the shard from one node to anotherr2ShardTransferMethodmethod rrrr rrr rrrr r!r"r#rrE#2...Hc...eCR000J000cr222L#222.3e"^///FH* +r"rc4eZdZUeddZded<dS)MoveShardOperation.rrr move_shardN)rrrr rr r!r"r#rrs1#eCR888J 88888r"rceZdZdZdS)MultiVectorComparatormax_simN)rrrMAX_SIMr!r"r#rrrfr"rc4eZdZUeddZded<dS)MultiVectorConfig.rrr comparatorN)rrrr rr r!r"r#rrs2*/%*D*D*DJ'DDDDDr"rc\eZdZUdZeddZeed<eddZded<d S) NamedSparseVectorz& Sparse vector data with name .Name of vector datarr0zSparse vector data with name SparseVectorrlN) rrrr[r r0r-r rlr!r"r#rrs^c'<===D#==="U34RSSSFNSSSSSr"rcheZdZUdZeddZeed<eddZe e ed<dS) NamedVectorz% Dense vector data with name .rrr0z Vector datarlN) rrrr[r r0r-r rlrrr!r"r#rrsac'<===D#===%???FDK?????r"rc4eZdZUeddZded<dS) NearestQuery.rrr nearestN)rrrr rr r!r"r#rrs1"U3B777G]77777r"rc\eZdZUdZeddZeed<eddZded<dS) NestedzA Select points with payload for a specified nested field .z7Select points with payload for a specified nested fieldrrrrN) rrrr[r rr-r rr!r"r#rrs^uS&_```C```uS.ghhhFHhhhhhr"rc4eZdZUeddZded<dS)NestedCondition.rrrnestedN)rrrr rr r!r"r#rrrr"rcXeZdZUeddZeed<eddZeeed<eddZ ee ed <edd Z ee ed <edd Z ee ed <eddZ eed<eddZeeeefed<dS)r.rrrNr2 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)rrrr rrr rr rrrrrrr rrr!r"r#rrs?s+++E3+++ %d C C CJ CCC+05"s,,,%,15"g,,,%,15"g,,,%"'s8o!p!p!p3ppp6;eDVX6Y6Y6YNHU8T>23YYYYYr"rceZdZUeddZded<eddZded<eddZeded <d S) r.rrrrjrrTrackerTelemetrylogN) rrrr rjr rrrr!r"r#rrsw!&s!;!;!;F ;;;385"3M3M3MM0MMM$)E#2$>$>$>C !>>>>>r"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<d S)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.r2max_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 memmaped 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_thresholdDMaximum 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.indexing_threshold(Minimum interval between forced flushes.flush_interval_sec(Max number of threads (jobs) for running optimizations per shard. Note: each optimization job will also use `max_indexing_threads` threads by itself for index building. If null - have no limit and choose dynamically to saturate CPU. If 0 - no optimization threads, optimizations will be disabled.max_optimization_threads)rrrr rrr rrrrr rrrrr!r"r#rrs$u t   u%*E o%%%c#(% G###C',eE'''hsm',eR'''hsm).[))) $eC5_``````.3e///hsmr"rceZdZUeddZeeed<eddZee ed<eddZ ee ed<edd Z ee ed <edd Z ee ed <edd Z ee ed<eddZee ed<eddZee ed<dS)r%Nrr2rrraTarget amount of segments optimizer will try to keep. Real amount of segments may vary depending on multiple parameters: - Amount of stored points - Current write RPS It is recommended to select default number of segments as a factor of the number of search threads, so that each segment would be handled evenly by one of the threads If `default_segment_number = 0`, will be automatically selected by the number of available CPUsraeDo not create segments larger this size (in kilobytes). Large segments might require disproportionately long indexation times, therefore it makes sense to limit the size of segments. If indexation speed have more priority for your - make this parameter lower. If search speed is more important - make this parameter higher. Note: 1Kb = 1 vector of size 256raDMaximum size (in kilobytes) of vectors to store in-memory per segment. Segments larger than this threshold will be stored as read-only memmaped 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 256rrrrrrr)rrrr rr rr rrrrrrrrr!r"r#r%r%s).t***x/4e"x///hsm-2EE---HSM',e|'''hsm',e['''hsm).[))) ).dHr(s(s(s sss.3e///hsmr"r%c"eZdZdZdefdZdZdS)OptimizersStatusOneOfz. Optimizers are reporting as expected rc*t|jSrrrs r#rzOptimizersStatusOneOf.__str__;rr"okN)rrrr[r-rOKr!r"r#rr6: BBBr"rc8eZdZUdZeddZeed<dS)OptimizersStatusOneOf1z2 Something wrong happened with optimizers .z(Something wrong happened with optimizersrrN)rrrr[r rr-r r!r"r#rrAs>s(RSSSE3SSSSSr"rceZdZUeddZeed<eddZeded <edd Z ed ed <dS) OrderBy.zPayload key to order byrrNz=Direction of ordering: `asc` or `desc`. Default is ascending.r2rq directionzmWhich payload value to start scrolling from. Default is the lowest value for `asc` and the highest for `desc` StartFrom start_from) rrrr rr-r rr rr!r"r#rrIsuS&?@@@C@@@',u"a(((Ix $).D)))J%r"rc4eZdZUeddZded<dS) OrderByQuery.rrOrderByInterfaceorder_byN)rrrr rr r!r"r#rrTs2#(5"#=#=#=H =====r"rc4eZdZUeddZded<dS)OverwritePayloadOperation.rr SetPayloadoverwrite_payloadN)rrrr rr r!r"r#rrXs2&+eCR&@&@&@|@@@@@r"rc4eZdZUeddZeed<dS)rc.rrconnection_pool_sizeN)rrrr rrr r!r"r#rcrc\s2 %cr : : :#:::::r"rcc8eZdZUdZeddZeed<dS)riz Payload field .zPayload field namerrN)rrrr[r rr-r r!r"r#riri`s>uS&:;;;C;;;;;r"riceZdZUdZeddZded<eddZed ed <edd Z e ed <dS) rz< Display payload field type & index information .z2Display payload field type & index informationrPayloadSchemaType data_typeNr2PayloadSchemaParamsrz(Number of points indexed with this indexrc) rrrr[r rr rr rcrr!r"r#rrhs&+U3eZdZdZdefdZdZdZdZdZ dZ d Z d Z d Z d S) rz- All possible names of payload types rc*t|jSrrrs r#rzPayloadSchemaType.__str__rr"rtrdrrrr;ruuidN)rrrr[r-rrurerrTEXTrUrGUUIDr!r"r#rr{s]GG E C D DH DDDr"rc@eZdZUeddZeeed<dS)PayloadSelectorExclude.z*Exclude this fields from returning payloadrexcludeN)rrrr rrr-r r!r"r#rrs6s0\]]]GT#Y]]]]]r"rc@eZdZUeddZeeed<dS)PayloadSelectorInclude.zOnly include this payload keysrincludeN)rrrr rrr-r r!r"r#rrs6s0PQQQGT#YQQQQQr"rc@eZdZUeddZeded<dS)PayloadStorageTypeOneOf.rr) in_memoryrSNrrrr rSr r r!r"r#rrsH cr""" ' #####r"rc@eZdZUeddZeded<dS)PayloadStorageTypeOneOf1.rr)rDrSNr r!r"r#r r sH cr""" ' #####r"r c8eZdZUdZeddZeed<dS)rpz. Information of a peer in the cluster .z$Information of a peer in the clusterruriN)rrrr[r r r-r r!r"r#rprps>uS&LMMMCMMMMMr"rpceZdZUeddZeded<eddZded<ed d Ze d ed <d S)r.z:Scored points that have the same value of the group_by keyrr6rrGroupIdrNz1Record that has been looked up using the group idr2r*rb) rrrr rrr rrbr r!r"r#rrs{ %c7s t t tD$} tttE#2...B ...!&tAt!u!u!uFHX uuuuur"rcpeZdZUeddZeded<eddZeded <dS) PointIdsList.rrrCrcNr2rr rrrr rcrr rr r!r"r#rrs\&+eCR&@&@&@FD" #@@@.3eDb.Q.Q.QIx*+QQQQQr"rceZdZUeddZeded<eddZed ed <edd Z ed ed <eddZ eded<dS) PointRequestNrr2rr.zLook for points with idsrrCrDBSelect which payload to return with the response. Default is true.rrrrr) rrrr rr r rDrrrr!r"r#rrs.3ek///Ix*+$)5:T#U#U#UC UUU5:U"f666L(12+0%"*M*M*MK,'MMMMMr"rceZdZUeddZded<eddZded<edd Zed ed <dS) PointStruct.rrrCr VectorStructrlNzPayload values (optional)r2rGpayload) rrrr rr rlrr r!r"r#rrsv!E#2666B666"U3B777FN777#(5C^#_#_#_GXi _____r"rcXeZdZUeddZded<eddZded<dS) PointVectors.rrrCrrrlN)rrrr rr rlr!r"r#rrsQ!E#2666B666"U3B777FN77777r"rcdeZdZUeddZded<eddZeded <dS) PointsBatch.rrrBbatchNr2rr)rrrr rr rr r!r"r#rrsVU3B///E7///.3eDb.Q.Q.QIx*+QQQQQr"rcpeZdZUeddZeded<eddZeded <dS) PointsList.rrrrcNr2rrrr!r"r#r r s["'%"<"<"Ce~???HhuT*-z9:;).k)))E8$ %!5kE8C="'"w"""FHX (-uTGt'u'u'uFH^ $uuu',u"Y(((OXe_!5;klllE8C=lll.3eG///K*+r"r"c4eZdZUeddZded<dS)ProductQuantization.rrProductQuantizationConfigproductN)rrrr r1r r!r"r#r/r/s2+05"+E+E+EG (EEEEEr"r/cdeZdZUeddZded<eddZeeed<dS) r0.rrr compressionNr2rO) rrrr r3r rOr r;r!r"r#r0r0sU&+eCR&@&@&@K#@@@!&t!D!D!DJDDDDDr"r0ceZdZUdZeddZeeed<eddZ eeed<edd Z ee ed <dS) QuantizationSearchParams- Additional parameters of the search Fz9If true, quantized vectors are ignored. Default is false.r2ignoreNzIf 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) rrrr[r r7r r;r r8r9rr!r"r#r5r5s#U#^FHTN$eXGXd^%*Eq%%%L(5/r"r5ceZdZUeddZeded<eddZeee ddfed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<eddZeeed<eddZeded<eddZeded<eddZeded<edd !Ze ed"<edd#Zeeed$<edd%Zeeed&<edd'Zed(ed)<dS)*QueryGroupsRequestNrr2rrjSub-requests to perform first. If present, the query will be performed on the results of the prefetch(es).r"r#r$r%r&r'rr(rrr)rrr*r+TOptions for specifying which vectors to include into the response. Default is false.rrIOptions for specifying which payload to include or not. Default is false.rrr-rr.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)rrrr rr r r#r rr&rr-rrr+rrrrr@rArrrDr!r"r#r;r; s.3eDb.Q.Q.QIx*+QQQ>CeA???HhuT*-z9:;).k)))E8$ %!5kE8C="'"w"""FHX (-uTGt'u'u'uFH^ $uuu',u"Y(((OXe_+0%"x+++K,'6;U"m666L(12/4eG///K*+E GHc!&"_!!!J !5;opppE8C=ppp385"]444K/0r"r;cleZdZUeddZeded<eddZeee ddfed<edd Z ed ed <edd Z ee ed <eddZ eded<eddZeded<eddZeeed<eddZeeed<eddZeeed<eddZeded<eddZeded<edd Zed!ed"<dS)# QueryRequestNrr2rrr<r"r#r$r%r&r'rr(rrr)rrr*r+r,rz9Offset of the result. Skip this many points. Default is 0rr=rrr>rrr-rr)rrrr rr r r#r rr&rr-rrr+rrrrrrrr!r"r#rFrF7s\.3eDb.Q.Q.QIx*+QQQ>CeA???HhuT*-z9:;).k)))E8$ %!5kE8C="'"w"""FHX (-uTGt'u'u'uFH^ $uuu',u"Y(((OXe_!5;klllE8C=lll!E$"?????r"rHc@eZdZUeddZeded<dS)rE.rrr6rcN)rrrr rcrr r!r"r#rErE^s6"'%"<"<"66666r"rceZdZUeddZeed<eddZeeed<eddZ ded <eddZ ded <dS) RemoteShardTelemetry.rrrNr2rorrupdates) rrrr rrr ror rryr!r"r#rxrxsE#2...Hc..."U4R@@@GXc]@@@.3eCR.H.H.HH+HHH-2U3B-G-G-GG *GGGGGr"rxc\eZdZUdZeddZeed<eddZeed<dS) RenameAlias# Change alias to a new one .Change alias to a new onerold_alias_namenew_alias_nameN) rrrr[r r~r-r rr!r"r#r{r{s^ %1LMMMNCMMM%1LMMMNCMMMMMr"r{c8eZdZUdZeddZded<dS)RenameAliasOperationr|.r}rr{ rename_aliasN)rrrr[r rr r!r"r#rr#s>#(%9T"U"U"UL-UUUUUr"rcXeZdZUeddZeed<eddZeed<dS)r.rrrroN)rrrr rrr ror!r"r#rr+sPE#2...Hc...5"---GS-----r"rceZdZUeddZeed<eddZeded<eddZ e d ed <eddZ e e d fed <dS) r.rrrNr2r{localrxremoterxreplicate_states)rrrr rrr rr rrrrr-r!r"r#rr0seCR(((B(((-2U4R-P-P-PE8) *PPP+05"+E+E+EFD' (EEE27%2L2L2Ld3./LLLLLr"rc:eZdZdZdefdZdZdZdZdZ dZ d Z d Z d S) rxz9 State of the single shard within a replica set. rc*t|jSrrrs r#rzReplicaState.__str__<rr"ActiveDeadPartial InitializingListenerPartialSnapshotRecoveryN) rrrr[r-rACTIVEDEADPARTIAL INITIALIZINGLISTENERPARTIALSNAPSHOTRECOVERYr!r"r#rxrx7sXF DG!LH'OHHHr"rxceZdZUeddZeed<eddZeed<eddZeed<edd Z e d ed <dS) ReplicateShard.rrrrrNrr2rrrr!r"r#rrHrr"rc4eZdZUeddZded<dS)ReplicateShardOperation.rrrreplicate_shardN)rrrr rr r!r"r#rrQs2(-cr(B(B(BO%BBBBBr"rcXeZdZUeddZded<eddZded<dS) RequestsTelemetry.rrWebApiTelemetryrestrgrpcN)rrrr rr rr!r"r#rrUsQ#eCR888D 888!E#2666D/66666r"rc"eZdZdZdefdZdZdS)ReshardingDirectionOneOfz# Scale up, add a new shard rc*t|jSrrrs r#rz ReshardingDirectionOneOf.__str___rr"upN)rrrr[r-rUPr!r"r#rrZrr"rc"eZdZdZdefdZdZdS)ReshardingDirectionOneOf1z$ Scale down, remove a shard rc*t|jSrrrs r#rz!ReshardingDirectionOneOf1.__str__jrr"downN)rrrr[r-rDOWNr!r"r#rre: DDDr"rceZdZUeddZded<eddZeed<eddZeed<edd Z e d ed <edd Z e e ed <dS)r.rrReshardingDirectionrrroNr2r0rzUA human-readable report of the operation progress. Available only on the source peer.comment) rrrr rr rrrorr rr-r!r"r#rrps',uSb'A'A'AI$AAAE#2...Hc...5"---GS---&+eDb&I&I&IIx #III"UkGXc]r"rceZdZUeddZeed<eddZeed<eddZeed<eddZ ded<d S) RestartTransfer.rrrrrrrN) rrrr rrr rrrr!r"r#rr{sE#2...Hc...cr222L#222eCR000J000$)E#2$>$>$>F !>>>>>r"rc4eZdZUeddZded<dS)RestartTransferOperation.rrrrestart_transferN)rrrr rr r!r"r#rrs3*/%*D*D*D'DDDDDr"rcHeZdZUeddZeeed<eddZeeed<eddZ e ed<eddZ ee ed <eddZ ee ed <eddZee ed <eddZeed <dS) r6Nrr2 distributiondistribution_version.r is_dockercoresram_size disk_size cpu_flags)rrrr rr r-r rrr;rrrrrr!r"r#r6r6s"'%""E"E"EL(3-EEE*/%"*M*M*M(3-MMMeCR000It000 52>>>E8C=>>>#eDbAAAHhsmAAA$uTrBBBIx}BBBU3B///Is/////r"r6ceZdZdZdS)SamplerandomN)rrrRANDOMr!r"r#rrs FFFr"rc4eZdZUeddZded<dS) SampleQuery.rrrsampleN)rrrr rr r!r"r#rrrr"rc4eZdZUeddZded<dS)ScalarQuantization.rrScalarQuantizationConfigscalarN)rrrr rr r!r"r#rrrMr"rceZdZUeddZded<eddZeeed <edd Z ee ed <dS) r.rr ScalarTyperSNziQuantile for quantization. Expected value range in [0.5, 1.0]. If not set - use the whole range of valuesr2quantilez]If true - quantized vectors always will be stored in RAM, ignoring the config of main storagerO) rrrr rSr rr rrOr;r!r"r#rrss333D,333 %!!!Hhuo"'s"""Jr"rceZdZdZdS)rint8N)rrrINT8r!r"r#rrrVr"rc@eZdZUdZeddZded<eddZeed<edd Z e ed <ed d Z e ded<ed d Z e ded<ed d Ze ded<ed d Ze ded<d S)r6z Search result .z Search resultrrCrz Point versionr1z*Points vector distance to the query vectorscoreNrqr2rGrrrrrlrsr0rzOrder-by valuertru)rrrr[r rr r1rrrrr rlrrur!r"r#r6r6s"E#?CCCBCCC5/:::GS:::5*VWWWE5WWW#(5Ck#l#l#lGXi lll',uTG\']']']FH^ $]]]&+eDk&R&R&RIx #RRR*/%JZ*[*[*[K,'[[[[[r"r6cdeZdZUdZeddZeded<eddZeded <edd Z ee ed <edd Z ed ed<eddZ eded<eddZ eded<eddZeded<dS) ScrollRequestzQ Scroll request - paginate over all points which matches given condition Nrr2rrzStart ID to read points from.rCrzPage size. Default: 10rzSLook only for points which satisfies this conditions. If not provided - all points.rrrrrzGScroll request - paginate over all points which matches given conditionrrz%Order the records by a payload field.rr)rrrr[r rr r rrrrrrrr!r"r#rrs`/4ek///Ix*++0%Ji*j*j*jFH& 'jjj 5;STTTE8C=TTT!&"w"""FHX 6;U"f666L(12+0%"k+++K,'.3U4Mt-u-u-uHh)*uuuuur"rcteZdZUdZeddZeded<edd Ze d ed <dS) r2z+ Result of the points read request .zList of retrieved pointsrr*rcNz:Offset which should be used to retrieve a next page resultr2rCnext_page_offset) rrrr[r rcrr rr r!r"r#r2r2sz#U34NOOOFDNOOO49E"^555h01r"r2ceZdZUeddZeded<eddZd ed <edd Zed ed <eddZ eded<eddZ eded<eddZ eded<eddZ ee ed<eddZeed<eddZeed<eddZeed<eddZed ed!<dS)"SearchGroupsRequestNrr2rr.rrNamedVectorStructrlrrrrrrrrrrrrr^r+r?r@r_rAr`rrBrCrD)rrrr rr r rlrrrrr+rr@r-rArrrDr!r"r#rrs.3ek///Ix*+#(%"<"<":?tYn9o9o9oL(56ooo#(5~$$$L(4.r"rceZdZUdZeddZeded<edd Zd ed <edd Z ed ed<eddZ eded<edd Z e ed<eddZ ee ed<eddZeded<eddZeded<eddZeeed<dS) SearchRequestz Search request. Holds all conditions and parameters for the search of most similar points by vector similarity given the filtering restrictions. Nrr2rr.zSearch request. Holds all conditions and parameters for the search of most similar points by vector similarity given the filtering restrictions.rrrlrrrrrrrrrrrrrrrrr^r+)rrrr[r rr r rlrrrrrrrr+rr!r"r#rr2s/4ek///Ix*+#(% g###F "'tAw!x!x!xFHX xxx',uTGa'b'b'bFH^ $bbbs(HIIIE3III!EUFHSM6;U"g666L(12+0%"t+++K,'(-ur(((OXe_r"rc@eZdZUeddZeded<dS)SearchRequestBatch.rrrrNrr!r"r#rrRs6&+eCR&@&@&@Hd?#@@@@@r"rceZdZUeidZeeedfed<eddZ eeedfed<edd Z d ed <dS) SegmentConfigrr2VectorDataConfig vector_dataNSparseVectorDataConfigsparse_vector_data.rPayloadStorageTypepayload_storage_type) rrrr rr rr-r rrr!r"r#rrVs;@5Y[;\;\;\K$s$6678\\\HMVZhjHkHkHkc+C&C!DEkkk16s1K1K1K.KKKKKr"rceZdZUdZeddZded<eddZeed<eddZ eed<eddZ eed <eddZ eed <eddZ eed <eddZ eed <eddZeed <eddZeedfed<eddZeedfed<dS) SegmentInfoz. Aggregated information about segment .z$Aggregated information about segmentr SegmentType segment_type num_vectors num_pointsnum_indexed_vectorsnum_deleted_vectorsram_usage_bytesdisk_usage_bytes is_appendabler index_schemaVectorDataInforN)rrrr[r rr rrrrrrrrr;rrr-rr!r"r#rr\sw#(%9_"`"`"`L-```uS.TUUUKUUUeC-STTTJTTT$uS6\]]]]]]$uS6\]]]]]] 52XYYYOSYYY!E#3YZZZcZZZ%1WXXXM4XXX27%Io2p2p2pL$s../ppp/4uSFl/m/m/mKc++,mmmmmr"rceZdZUeddZded<eddZded<eddZeded <eddZ ed ed <d S) r.rrrinforrVectorIndexSearchesTelemetryvector_index_searchesrpayload_field_indicesN) rrrr rr rrrrr!r"r#rrms%444D-444#eCR888FO888BG%Y[B\B\B\4 >?\\\;@5RT;U;U;U4 78UUUUUr"rc*eZdZdZdefdZdZdZdZdS)rz Type of segment rc*t|jSrrrs r#rzSegmentType.__str__yrr"rindexedspecialN) rrrr[r-rPLAININDEXEDSPECIALr!r"r#rrtsD EGGGGr"rceZdZUdZeddZded<edd Zee d ed <edd Z ed ed<edd Z eded<edd Z ee ed<dS)rr`.rerrGrNz*Assigns payload to each point in this listr2rCrcz@Assigns payload to each point that satisfy this filter conditionrrrrz@Assigns payload to each point that satisfy this path of propertyr)rrrr[r rr rcr rrrrr-r!r"r#rrs% jGY16"N111FHT+, -"'"d"""FHX /4e"s///Ix*+"dC#r"rc4eZdZUeddZded<dS)SetPayloadOperation.rrr set_payloadN)rrrr rr r!r"r#rrs1 %cr : : :K:::::r"rceZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <dS)ShardSnapshotRecover.rrShardSnapshotLocationlocationNr2SnapshotPrioritypriorityFOptional SHA256 checksum to verify snapshot integrity before recovery.checksumCOptional API key used when fetching the snapshot from a remote URL.api_key) rrrr rr rr rr-rr!r"r#rrs(-cr(B(B(BH%BBB-2U4R-P-P-PHh)*PPP#e"jHhsm#U"gGXc]r"rc.eZdZdZdefdZdZdZdZdZ dS) r}z Current state of the shard (supports same states as the collection) `Green` - all good. `Yellow` - optimization is running, 'Grey' - optimizations are possible but not triggered, `Red` - some operations failed and was not recovered rc*t|jSrrrs r#rzShardStatus.__str__rr"rrrrNrr!r"r#r}r}rr"r}ceZdZUeddZeed<edddZeed<edd Zeed <edd Z e ed <ed dZ e ded<ed dZ e eed<d S)r.rrrzSource peer idfromrfrom_zDestination peer idtozyIf `true` transfer is a synchronization of a replicas If `false` transfer is a moving of a shard from one peer to anothersyncNr2rrzTA human-readable report of the transfer progress. Available only on the source peer.r)rrrr rrr rrr r;rr rr-r!r"r#rrsE#2...Hc...s(8GGGE3GGGeC%:;;;B;;; PD$/4eDb.Q.Q.QFH* +QQQ"U"xGXc]r"rc"eZdZdZdefdZdZdS)ShardTransferMethodOneOfzS Stream all shard records in batches until the whole shard is transferred. rc*t|jSrrrs r#rz ShardTransferMethodOneOf.__str__rr"stream_recordsN)rrrr[r-rSTREAM_RECORDSr!r"r#r"r"s:&NNNr"r"c"eZdZdZdefdZdZdS)ShardTransferMethodOneOf1zF Snapshot the shard, transfer and restore it on the receiver. rc*t|jSrrrs r#rz!ShardTransferMethodOneOf1.__str__rr"snapshotN)rrrr[r-rSNAPSHOTr!r"r#r'r's:HHHr"r'c"eZdZdZdefdZdZdS)ShardTransferMethodOneOf2z< Attempt to transfer shard difference by WAL delta. rc*t|jSrrrs r#rz!ShardTransferMethodOneOf2.__str__rr" wal_deltaN)rrrr[r-r WAL_DELTAr!r"r#r,r,s:IIIr"r,ceZdZdZdZdS)rautocustomN)rrrAUTOCUSTOMr!r"r#rrs D FFFr"rceZdZUeddZeed<eddZeeed<eddZ e ed<eddZ eeed <dS) r#.rrr0Nr2 creation_timesizer) rrrr r0r-r r6r r7rrr!r"r#r#r#scr***D#***#(52#F#F#FM8C=FFFcr***D#***#eDbAAAHhsmAAAAAr"r#c*eZdZdZdefdZdZdZdZdS)rz Defines source of truth for snapshot recovery: `NoSync` means - restore snapshot without *any* additional synchronization. `Snapshot` means - prefer snapshot data over the current state. `Replica` means - prefer existing data over the snapshot. rc*t|jSrrrs r#rzSnapshotPriority.__str__rr"no_syncr)replicaN) rrrr[r-rNO_SYNCr*REPLICAr!r"r#rrsDGHGGGr"rceZdZUeddZeed<eddZeded <edd Z eeed <edd Z eeed <dS)SnapshotRecover.zExamples: - URL `http://localhost:8080/collections/my_collection/snapshots/my_snapshot` - Local path `file:///qdrant/snapshots/test_collection-2022-08-04-10-49-10.snapshot`rrNa[Defines which data should be used as a source of truth if there are other replicas in the cluster. If set to `Snapshot`, the snapshot will be used as a source of truth, and the current state will be overwritten. If set to `Replica`, the current state will be used as a source of truth, and after recovery if will be synchronized with the snapshot.r2rrrrrr) rrrr rr-r rr rrr!r"r#r?r?sE CHc.3Ur...Hh)*$e"jHhsm#U"gGXc]r"r?ceZdZUdZeddZeeed<eddZ d ed <edd Z ed ed <dS)SparseIndexConfig2 Configuration for sparse inverted index. NvWe prefer a full scan search upto (excluding) this number of vectors. Note: this is number of vectors, not KiloBytes.r2r .z(Configuration for sparse inverted index.rSparseIndexType index_typez,Datatype used to store weights in the index.VectorStorageDatatypedatatype) rrrr[r r r rr rErGr!r"r#rArA s*/M***#%*E#;e$f$f$fJ!fff27%"P333Hh./r"rAceZdZUdZeddZeeed<eddZ ee ed<eddZ ed ed <dS) SparseIndexParamsrBNrCr2r zUStore index on disk. If set to false, the index will be stored in RAM. Default: falserDa9Defines 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.r7rG) rrrr[r r r rr rDr;rGr!r"r#rIrI s*/M***#$ekGXd^&+UP &&&Hhz"r"rIc"eZdZdZdefdZdZdS)SparseIndexTypeOneOfz" Mutable RAM sparse index rc*t|jSrrrs r#rzSparseIndexTypeOneOf.__str__4 rr" MutableRamN)rrrr[r-r MUTABLERAMr!r"r#rKrK/ s:JJJr"rKc"eZdZdZdefdZdZdS)SparseIndexTypeOneOf1z$ Immutable RAM sparse index rc*t|jSrrrs r#rzSparseIndexTypeOneOf1.__str__? rr" ImmutableRamN)rrrr[r-r IMMUTABLERAMr!r"r#rPrP: s:"LLLr"rPc"eZdZdZdefdZdZdS)SparseIndexTypeOneOf2z Mmap sparse index rc*t|jSrrrs r#rzSparseIndexTypeOneOf2.__str__J rr"MmapNrrrr[r-rMMAPr!r"r#rUrUE rr"rUcteZdZUdZeddZeeed<eddZ ee ed<dS) rz! Sparse vector structure .zIndices must be uniquerindicesz*Values and indices must be the same lengthvaluesN) rrrr[r r[rrr r\rr!r"r#rrP sfs0HIIIGT#YIII%1]^^^FDK^^^^^r"rc8eZdZUdZeddZded<dS)rz5 Config of single sparse vector data storage .z+Config of single sparse vector data storagerrAindexN)rrrr[r r^r r!r"r#rrY s?"'s8e!f!f!fE fffffr"rcteZdZUdZeddZeded<eddZeded <dS) rz5 Params of single sparse vector data storage NzQCustom params for index. If none - values from collection configuration are used.r2rIr^zIConfigures addition value modifications for sparse vectors. Default: nonermodifier) rrrr[r r^r r r`r!r"r#rra s,15"u,,,E8' (&+U"m&&&Hhz"r"c.eZdZdZdefdZdZdZdZdZ dS) r~z+ Role of the peer in the consensus rc*t|jSrrrs r#rzStateRole.__str__s rr"Follower CandidateLeader PreCandidateN) rrrr[r-rFOLLOWER CANDIDATELEADER PRECANDIDATEr!r"r#r~r~n sIHI F!LLLr"r~ceZdZUeddZeed<eddZded<eddZded<eddZ d ed <eddZ d ed <d S)r.rrrr/apprrrclusterrrequestsN) rrrr rr-r rlrrmrnr!r"r#rr| seCR(((B((($uSb999C 999*/%*D*D*DK'DDD"'%"<"<"$>$>H!>>>>>r"rc$eZdZUeddZded<eddZeded <edd Zee ed <edd Z ee ed <eddZ ee ed<eddZ ee ed<dS)TextIndexParams.rr TextIndexTyperSNr2 TokenizerType tokenizerz#Minimum characters to be tokenized. min_token_lenz#Maximum characters to be tokenized. max_token_lenz-If true, lowercase all tokens. Default: true. lowercaserCrD)rrrr rSr rsr rtrrurvr;rDr!r"r#rprp s!E#2666D/666+052+N+N+NIx(NNN#(5Ch#i#i#iM8C=iii#(5Ch#i#i#iM8C=iii %d@o p p pIx~ppp#eD>qrrrGXd^rrrrrr"rpceZdZdZdS)rqrN)rrrrr!r"r#rqrq rVr"rqceZdZdZdZdZdZdS)rrprefix whitespaceword multilingualN)rrrPREFIX WHITESPACEWORD MULTILINGUALr!r"r#rrrr s" FJ D!LLLr"rrceZdZdZdZdS)TrackerStatusOneOf optimizingdoneN)rrr OPTIMIZINGDONEr!r"r#rr sJ DDDr"rc4eZdZUeddZeed<dS)TrackerStatusOneOf1.rr cancelledN)rrrr rr-r r!r"r#rr s1U3B///Is/////r"rc4eZdZUeddZeed<dS)TrackerStatusOneOf2.rrrN)rrrr rr-r r!r"r#rr s1s+++E3+++++r"rceZdZUdZeddZeed<eddZe e ed<eddZ d ed <edd Z e eefed <ed dZee eefed<d S)rz* Tracker object used in telemetry .zName of the optimizerrr0zSegment IDs being optimized segment_idsz Tracker object used in telemetry TrackerStatusrjzStart time of the optimizerstart_atNzEnd time of the optimizerr2end_at)rrrr[r r0r-r rrrrjrr rrrr r!r"r#rr sc'>???D#???"U34QRRRKcRRR#eC5WXXXFOXXX&+eC=Z&[&[&[HeHdN#[[[.3eDNi.j.j.jFHU8T>* +jjjjjr"rc4eZdZUdZeddZeded<eddZeded <edd Z ed ed <edd Z eded<eddZ eded<eddZ eded<dS)UpdateCollectionzF Operation for updating parameters of the existing collection NzMap of vector data parameters to update for each named vector. To update parameters in a collection having a single unnamed vector, use an empty string as name.r2VectorsConfigDiffrFzCustom params for Optimizers. If none - it is left unchanged. This operation is blocking, it will only proceed once all current optimizations are completer%r&z7Collection base params. If none - it is left unchanged.rrzSHNSW parameters to update for the collection index. If none - it is left unchanged.r#rzBQuantization parameters to update. If none - it is left unchanged.QuantizationConfigDiffrzFMap of sparse vector data parameters to update for each sparse vector.SparseVectorsConfigr) rrrr[r rFr r r&rrrrr!r"r#rr sh.3Uw...GX) *;@%r;;;x 6705u"[000FH+ ,/4e"w///K*+?De"f???":;7qrrrGXd^rrrrrr"rceZdZdZdS)rrN)rrrrr!r"r#rr rVr"rceZdZUdZeddZeeed<eddZ eeed<eddZ eeed <edd Z eeed <dS) rz% Values count filter request Nz'point.key.length() < values_count.ltr2rMz'point.key.length() > values_count.gtrOz)point.key.length() >= values_count.gterQz)point.key.length() <= values_count.lterS) rrrr[r rMr rr rOrQrSr!r"r#rr sd8abbbB bbbd8abbbB bbbt9deeeC#eeet9deeeC#eeeeer"rc4eZdZUdZeddZeed<eddZded<eddZ d ed <eddZ d ed <ed dZ e ded<ed dZ e ded<ed dZe ded<d S)rz. Config of single vector data storage .z'Size/dimensionality of the vectors usedrr7z$Config of single vector data storagerdistanceVectorStorageType storage_typeIndexesr^NzDVector specific quantization config that overrides collection configr2rrzBVector specific configuration to enable multiple vectors per pointrmultivector_configzBVector specific configuration to set specific storage element typerFrG)rrrr[r r7rr rrr^rr rrGr!r"r#rr sBc'PQQQD#QQQ 52XYYYHjYYY(-c?e(f(f(fL%fffuS.TUUUE9UUU:?%"h;;;"679>"f999!4538%"f333Hh./r"rc|eZdZUeddZeed<eddZeed<eddZeed<dS)r.rrrrrN) rrrr rrr rrr!r"r#rr squSb111K111$uSb999999$uSb99999999r"rceZdZUeddZeeed<eddZded<eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZ ded <eddZded<eddZded<eddZded<dS)rNrr2 index_name.rrunfiltered_plainunfiltered_hnswunfiltered_sparsefiltered_plainfiltered_small_cardinalityfiltered_large_cardinalityfiltered_exactfiltered_sparseunfiltered_exact)rrrr rr r-r rrrrrrrrrr!r"r#rr s\ %d C C CJ CCC6;eCR6P6P6P3PPP5:U3B5O5O5OO2OOO7"H999!45r"rceZdZUeddZeded<eddZeded<edd Zee ed <dS) rNzAUpdate params for HNSW index. If empty object - it will be unset.r2r#rz?Update params for quantization. If none - it is left unchanged.rrzQIf true, vectors are served from disk, improving RAM usage at the cost of latencyrD) rrrr rr r rrDr;r!r"r#rrF s.3e"e///K*+?De"c???":;$e"uGXd^r"c*eZdZdZdefdZdZdZdZdS)rFz# Storage types for vectors rc*t|jSrrrs r#rzVectorStorageDatatype.__str__W rr"r8r:r9N) rrrr[r-rr;r=r<r!r"r#rFrFR sDGG EEEr"rFc"eZdZdZdefdZdZdS)VectorStorageTypeOneOfz^ Storage in memory (RAM) Will be very fast at the cost of consuming a lot of memory. rc*t|jSrrrs r#rzVectorStorageTypeOneOf.__str__d rr"MemoryN)rrrr[r-rMEMORYr!r"r#rr_ s:FFFr"rc"eZdZdZdefdZdZdS)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__o rr"rWNrXr!r"r#rrj rr"rc"eZdZdZdefdZdZdS)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__z rr" ChunkedMmapN)rrrr[r-r CHUNKEDMMAPr!r"r#rru s: KKKr"rc"eZdZdZdefdZdZdS)VectorStorageTypeOneOf3z Same as `ChunkedMmap`, but vectors are forced to be locked in RAM In this way we avoid cold requests to disk, but risk to run out of memory Designed as a replacement for `Memory`, which doesn't depend on RocksDB rc*t|jSrrrs r#rzVectorStorageTypeOneOf3.__str__ rr"InRamChunkedMmapN)rrrr[r-rINRAMCHUNKEDMMAPr!r"r#rr s=*r"rceZdZUeddZeed<eddZeed<eddZe eed<dS) VersionInfo.rrtitler1Nr2r|) rrrr rr-r r1r|r r!r"r#rr sss+++E3+++5"---GS---!E$B???FHSM?????r"rcXeZdZUeddZeed<eddZeed<dS)r."Size of a single WAL segment in MBrwal_capacity_mbrs"=########<<<<<<<<<<<<<<<<%%%%%%%%HHHHHHHHHHHH sCx.3 44500133333(3333 FFFFFYhFFFF66666y666 @@@@@ @@@555559555NNNNNIXNNNN DDDDD(DDDDEEEEEyEEEE77777ix7777CYhAAAAAIXAAAAGGGGGYGGG ######## )$RRRRRYRRRMMMMMyMMM w w w w wI w w w^^^^^y^^^+++++I+++wwwww)wwwfffffYfff8y2     9H         sD   DDDDD)DDD<<<<>>>>(>>>> 99999)89999 999999H9999     9H     YYYYY)YYY     )8    =====9H====,,,,,y,,,,^WWWWWyWWWW           JJJJJ(JJJJsD sssss)8ssssThhhhhIXhhhhGGGGG)8GGGGSSSSS9HSSSS:::::ix::::IX"AAAAAYhAAAARRRRRIXRRRRAAAAAYhAAAAT sDIX;;;;;IX;;;;%%%%%ix%%%%PCCCCC9HCCCC     sD   nnnnnynnnn999999H999977777ix7777FFFFFyFFFF@@@@@I@@@ aaaaa)aaa     9H    =====I===,,,,,I,,, sssssYhssss$     Yh    RRRRRYhRRRR sssssyssssS$     S$   22222)82222     Yh    sssssYhssss 3mmmmmIXmmmmDDDDDyDDDD     (     K K K K K  K K K K<<<<<9<<<UUUUUIUUU]]]]]Yh]]]]>Yh6     9        I   yAAAAA AAA LLLLLLLL XXXXX)XXX RRRRR)RRR EEEEE)EEE KKKKK)KKK QQQQQ)QQQ KKKKK)KKK PPPPP)PPP VVVVV)VVV KKKKK)KKK JJJJJ)JJJ JJJJJJJJ LLLLL)LLL LLLLL)LLL RRRRR)RRR XXXXX)XXX ZZZZZ)ZZZ LLLLLLLL RRRRRRRR MMMMMMMM KKKKKKKK RRRRRRRR TTTTTTTT YYYYYYYY @@@@@ @@@ sssss(sssssDpppppyppppnnnnnixnnnnsssss(sssssD77777Y777EEEEE)EEE-----)8----     Yh     ZZZZZyZZZZ)8JJJJJ JJJJVVVVV(VVVV        00000 0000     sD    99999(9999CEEEEE EEEETTTTT TTTT@@@@@)8@@@@888889H8888iiiiiYhiiii22222ix2222 Z Z Z Z Z) Z Z Z ???????? y>9H>CTTTTTYTTTix>>>>>9H>>>>AAAAA AAAA;;;;;;;;<<<<<9H<<<< U U U U Uy U U UOOOOOIOOOT$^^^^^Yh^^^^RRRRRYhRRRR#####i### #####y### NNNNNyNNNvvvvvvvv RRRRR9HRRRR N N N N N9H N N N N`````)8```` 888889H8888 RRRRR)8RRRR RRRRR(RRRR y6FFFFF)8FFFFEEEEE EEEE y$)))))())))X     9H    F@@@@@ @@@@=====I===QQQQQyQQQ(XXXXXIXXXXX     #t   &&&&&Yh&&&&R     Yh    =====Yh====&&&&&y&&&&RDDDDDIXDDDD     T    X X X X XY X X X77777i777HHHHH9HHHNNNNN)8NNNNVVVVV9HVVVV.....ix.... MMMMM)MMM3"YhCCCCCixCCCC77777 777 sDTY?????ix????EEEEEyEEEE00000)000S$22222)82222DDDDD(DDDD     y    d \ \ \ \ \) \ \ \vvvvvIXvvvv.9)8:XXXXX)XXXNNNNNyNNNddddd ddd     )8     9H(IX@AAAAA(AAAALLLLLILLL nnnnn)nnn"VVVVVyVVV     #t   (,;;;;;)8;;;;9H     #t           &&&&&sD&&&TTS$ BBBBB)BBB     sD   ix"         &3"""""C"""C_____9H____gggggYggg     (     " " " " "T " " "?????I???sssssixssssC"""""C"""d 00000)000,,,,,),,, k k k k ky k k ky6EEEEEyEEEE888889888     3   RRRRRIXRRRR AAAAAYhAAAAAAAAAixAAAAsssssixssss Cfffff)8ffffy(:::::Y::: Q Q Q Q Q9 Q Q Q9H8     y         C   S$c4     c4   *****c4***@@@@@)@@@ uuuuu uuu IX`````i```(     C    OO    "$     !                                    J          J    k     L !#  O k d; !DL !N   Nk   k F   O   r"