0/j%x SrSSKJrJr SSKJrJrJrJrJ r J r J r Sr \ "S5r "SS\\ 5r\ "S\S 9rS \S \4S jrS \S \4S jr"SS5r"SS\\ \45r"SS\\ \45r"SS\5r"SS\\ \45r\ "S5r"SS\\\ \45r"SS\\ \4\\ \\ \44\\ \45r"SS\\\ 5r"SS \\\ \\ 5rg!)"z A BTree in the style of Cormen, Leiserson, and Rivest's "Algorithms" book, with copy-on-write node updates, cursors, and optional space optimization for mostly-in-order insertion. )MutableMapping MutableSet)AnyCallableGenericOptionalTupleTypeVarcastKTc&\rSrSrSrS\4SjrSrg)Elementz+All items stored in the BTree are Elements.returnc[e)zFThe key for this element; the returned type must implement comparison.)NotImplementedErrorselfs b/var/www/html/health-monitoring.indevconsultancy.in/venv/lib/python3.13/site-packages/dns/btree.pykey Element.keys!!N)__name__ __module__ __qualname____firstlineno____doc__r r__static_attributes__rrrrrs5"R"rrET)boundtrc US- $)zSThe minimum number of keys in a non-root node for a BTree with the specified ``t`` rr#s r_MINr's  q5LrcSU-S- $)zGThe maximum number of keys in node for a BTree with the specified ``t``r%rr&s r_MAXr*#s q519rc\rSrSrSrSrSrg)_Creator(zA _Creator class instance is used as a unique id for the BTree which created a node. We use a dedicated creator rather than just a BTree reference to avoid circularity that would complicate GC. c[U5S$)Nx)idrs r__str___Creator.__str__0sT(1rrN)rrrrrr1r rrrr,r,(s rr,c (\rSrSrSr/SQrS\S\S\4Sjr S\4S jr S\4S jr S \ S\ \\44S jrS \SS4SjrS \ S\\S\44SjrS \ S\S-4SjrS \SS4SjrS\S\S\S-4SjrS\ S\S44SjrSSS \S\4SjrSSS \S\4SjrSSS\SSSS4SjrSSS \SS4SjrS\4S jrS\4S!jrSSS \SS4S"jrS \ S\SS#\S-S\S-4S$jrS%\ \/S4SS4S&jr!S%\ S/S4SS4S'jr"S\S\S4S(jr#S\SS4S)jr$S*r%S+r&g),_Node4z>A Node in the BTree. A Node (leaf or internal) of the BTree. r#creatoris_leafeltschildrenr#r7r8cTUS:deXlX lX0l/Ul/Ulg)Nr6)rr#r7r8s r__init___Node.__init__<s*Av v    -/ rrc[UR5[UR5::de[UR5[UR5:H$)z/Does this node have the maximal number of keys?)lenr9r*r#rs r is_maximal_Node.is_maximalD;499~dff---499~dff--rc[UR5[UR5:de[UR5[UR5:H$)z/Does this node have the minimal number of keys?)r@r9r'r#rs r is_minimal_Node.is_minimalIrCrrcf[UR5nUS:a'XRUS- R5:aUS4$Sn[UR5nUS- nSnX$::aJX$-S-nURUR5nX:XaUnSnX54$X:aUnUS- nOUS-nX$::aMJX54$)zGet the index of the ``Element`` matching ``key`` or the index of its least successor. Returns a tuple of the index and an ``equal`` boolean that is ``True`` iff. the key was found. rr%Fr)T)r@r9r)rrlirequalmks rsearch_in_node_Node.search_in_nodeNs  N q5S99QU+//11e8O   N Ef1 A !   "Ax x EEfxrindexz _Node[KT, ET]cUR(aeURUnURUR5nU(aX0RU'U$U$N)r8r: maybe_cowr7)rrPchildcloneds rmaybe_cow_child_Node.maybe_cow_childksH<< e$. #)MM% MLrcURU5up#U(aX4$UR(agURU5nURU5$)zGet the node associated with key and its index, doing copy-on-write if we have to descend. Returns a tuple of the node and the index, or the tuple ``(None, 0)`` if the key was not found. Nr)rNr8rV _get_node)rrrIrKrTs rrZ_Node._get_nodeusJ&&s+ 9  \\((+E??3' 'rNcURU5up#U(aURU$UR(agURUR U5$)z8Get the element associated with *key* or return ``None``N)rNr9r8r:get)rrrIrKs rr] _Node.getsI&&s+ 99Q<  \\==#'', ,rcUS:XagURUS- n[UR5[UR5:XagUR US- 5n[UR5[UR5:aIUR XS- 5(dg[UR5[UR5:aMHgg)aTry to minimize the number of Nodes in a BTree where the insertion is done in-order or close to it, by stealing as much as we can from our right sibling. If we don't do this, then an in-order insertion will produce a BTree where most of the nodes are minimal. rNr%)r:r@r9r*r#rVtry_right_steal)rrPlefts roptimize_in_order_insertion!_Node.optimize_in_order_insertions A: }}UQY' tyy>T$&&\ ) ##EAI.$))ntDFF|+''ai88$))ntDFF|+relementin_ordercUR5(aeUR5nURU5upEU(aURUnXRU'U$UR(aURR XA5 gUR U5nUR5(aUR"UR56 MURX5nU(aURU5 U$rR) rArrNr9r8insertrVadoptsplitinsert_nonfullrb) rrdrerrIrKoldrToelts rrj_Node.insert_nonfulls??$$$$++-C**3/HAiil& !     ,,,Q/##%%JJ .++G>44Q7 rcUR5(deURURURUR5n[ UR [UR5S-S5UlUR [UR5n[ UR S[UR55UlUR(df[ UR[UR5S-S5Ul[ URS[UR5S-5UlXU4$)zASplit a maximal node into two minimal ones and a central element.r%N) rA __class__r#r7r8listr9r'r:)rrightmiddles rri _Node.splits    tvvt||T\\B$))DL1$4$678 4<(>T$&&\23 ||!$--TVV q0@0B"CDEN /Adff1A!BCDMU""rparentcUS:waURUS- nUR5(dURUS- 5nURUS- nURR 5URUS- 'URR SU5 UR (dIUR (aeURR 5nURR SU5 gg)zTry to steal from this Node's left sibling for balancing purposes. Returns ``True`` if the theft was successful, or ``False`` if not. rr%TF)r:rErVr9poprgr8)rrtrPraeltrTs rtry_left_steal_Node.try_left_steals A:??519-D??$$--eai8kk%!),)- EAI&   C(||#||++ MM--/EMM((E2rc US-[UR5:aURUS-nUR5(dURUS-5nURUnURR S5URU'URR U5 UR(dIUR(aeURR S5nURR U5 gg)zTry to steal from this Node's right sibling for balancing purposes. Returns ``True`` if the theft was successful, or ``False`` if not. r%rTF)r@r:rErVr9rvappendr8)rrtrPrqrwrTs rr`_Node.try_right_steals 19s6??+ +OOEAI.E##%%..uqy9kk%(%*ZZ^^A%6 E"   %}}#||++!NN..q1EMM((/rrarrrqcUR5(aeUR(aeUR5nURU5upVU(aeURR XR5 [ UR5S:Xa X/UlgURUU:XdeURR US-U5 g)zAdopt left, middle, and right into our Node (which must not be maximal, and which must not be a leaf). In the case were we are not the new root, then the left child must already be in the Node.rr%N)rAr8rrNr9rgr@r:)rrarrrqrrIrKs rrh _Node.adopts??$$$$<<jjl&&s+y # t}}  "!MDM==#t+ ++ MM Q .rc`URRUS-5nURRURRU55 URR UR5 UR (d&URR UR5 gg)z>Merge this node's parent and its right sibling into this node.r%N)r:rvr9r{extendr8)rrtrPrqs rmerge _Node.mergesq##EAI. /0 $|| MM  0rc|UR(aURS$URSR5$)z"The least element in this subtree.r)r8r9r:minimumrs rr _Node.minimums/ <<99Q< ==#++- -rc|UR(aURS$URSR5$)z%The greatest element in this subtree.)r8r9r:maximumrs rr _Node.maximum s/ <<99R= ==$,,. .rcUR(aeURX5(agURX5(agUS:XaURX5 gUR US- 5nURXS- 5 g)zThis Node is minimal, and we want to make it non-minimal so we can delete. We try to steal from our siblings, and if that doesn't work we will merge with one of them.Nrr%)r8rxr`rrV)rrtrPras rbalance _Node.balancesr>>!!   v - -     . .  A: JJv %))%!)4D JJvqy )rexactcPUbUR5(aeURU5upESnU(aUbURUULa [S5eUR(aURR U5$SnUnUR US-R5nUR5nUS-nUR(aUb [S5egURU5nUR5(aSURX5 URU5upEU(aeUR UnUR5(aeURXU5n Ub<URU5upU ceU ceU RUn XRU'U n U $)zDelete an element matching *key* if it exists. If *exact* is not ``None`` then it must be an exact match with that element. The Node must not be minimal unless it is the root.Nz'exact delete did not match existing eltr%zexact delete had no match) rErNr9 ValueErrorr8rvr:rrrVrdeleterZ) rrrtrrIrK original_keyleast_successorrTrwnoderls rr _Node.delete&s ~T__%6%666&&s+  TYYq\%> !JKK||yy}}Q''EL"mmAE2:: UR(dURSR U5 gg)z-Call *visit* on all of the elements in order.rN) enumerater9r8r:visit_in_order)rrrIrws rr_Node.visit_in_orderUsa *FA<< a //6 #J+|| MM"  , ,U 3rcU"U5 UR(d%URHnURU5 M gg)z?Visit nodes in preorder. This method is only used for testing.N)r8r:_visit_preorder_by_node)rrrTs rr_Node._visit_preorder_by_node^s1 d ||--e4'rcDURULaURU5$g)zReturn a clone of this Node if it was not created by *creator*, or ``None`` otherwise (i.e. copy for copy-on-write if we haven't already copied it).N)r7clone)rr7s rrS_Node.maybe_cowes" < 499%|| OO " "4== 1 rc UR(d;SSRURVs/sHn[U5SPM sn5-nOSn[U5SSURSUR U3$s snf)N r/)r8joinr:r0r7r9)rcr:s rr1 _Node.__str__usm||SXXT]]&K]"Q%|]&KLLHHT(1Qt||nAdii[ CC'LsA9 )r:r7r9r8r#)'rrrrr __slots__intr,boolr=rArEr tuplerNrVr rrZr!r]rbrjrirxr`rhrrrrrrrrrSrr1r rrrr4r44s7 @I0#0040.D. .D. "sDy)9:S_(R(E(?*CS*H$I( -r-b4i-$bDR$Y2 #u_b/AB #_ST&ocd&///2/o/RV/"1O1C1D1..//*o*c*d*&--'8-ACd- d-^4HbT4Z$84T45X6G6M-N5SW5h.GX/Drr4c\rSrSrSrSSjrSSjrSSjrSrS r S\ S-4S jr S\ S-4S jr S \ S \SS4SjrSS\S \ SS4SjjrSSjrSSjrSrSrSrg)Cursori}zA seekable cursor for a BTree. If you are going to use a cursor on a mutable BTree, you should use it in a ``with`` block so that any mutations of the BTree automatically park the cursor. cXlSUlSUlSUlSUl/UlSUlSUlSUlg)NrFT) btree current_node current_indexrecurse increasingparentsparked parking_keyparking_key_read)rrs rr=Cursor.__init__sE *.#$ 02  &* %rrNcrURceURR(dURRURUR45 URR URUlURceSUlURR(dMggrY)rr8rr{rr:rs r _seek_leastCursor._seek_leasts  ,,,##++ LL  !2!2D4F4F G H $ 1 1 : :4;M;M ND $$0 00!"D  ##+++rcURceURR(dURRURUR45 URR URUlURce[ URR5UlURR(dMggrR)rr8rr{rr:r@r9rs r_seek_greatestCursor._seek_greatests  ,,,##++ LL  !2!2D4F4F G H $ 1 1 : :4;M;M ND $$0 00!$T%6%6%;%;!"##%||'')$ #DO   ! # !!Q&'',,T-?-?@((00#'DL#&779 (,% t||$q(<@LLGet the next element, or return None if on the right boundary.Nr%rTF)rrrrrrrrrr@r9r8rrrrvrs rnext Cursor.nexts]     $!!Q&))Q...%)JJOO!%&"  "||??$$&$ "DO!!C(9(9(>(>$??'',,T-?-?@""a'"((00#'DL#&779 (,% t||$q(<@LL= 3Tr) r,r7 _immutablesetcursorsrr#rsizer4)rr#rs rr=BTree.__init__hs z    $'E  && !BCCZZDF DI DI1u !122FdffdllD9DIDIrc6UR(dSUlgg)zMake the BTree immutable. Attempts to alter the BTree after making it immutable will raise an Immutable exception. This operation cannot be undone. TN)rrs rmake_immutableBTree.make_immutables "DOrrcxUR(a[eURHnUR5 M grR)rrrrrcursors r_check_mutable_and_parkBTree._check_mutable_and_parks% ??OllF KKM#rrwrecUR5 URRUR5nU(aX0lURR 5(aYURn[ UR URS5UlURR"UR56 URRX5nUcU=RS- sl U$)aInsert the element into the BTree. If *in_order* is ``True``, then extra work will be done to make left siblings full, which optimizes storage space when the the elements are inserted in-order or close to it. Returns the previously existing element at the element's key or ``None``. Fr%) rrrSr7rAr4r#rhrirjr)rrwrerUold_rootrls rinsert_elementBTree.insert_elements $$&$$T\\2 I 99   ! !yyHdffdllE:DI IIOOX^^- .yy''6 < IINI rrc8URRU5$)zXGet the element matching *key* from the BTree, or return ``None`` if it does not exist. )rr]rrs r get_elementBTree.get_elementsyy}}S!!rrcUR5 URRUR5nU(aX0lURR USU5nUbU=R S-sl[ URR5S:Xa^URR(dC[ URR5S:XdeURRSUlU$)Nr%r) rrrSr7rrr@r9r8r:)rrrrUrws r_delete BTree._deletes $$&$$T\\2 IiisD%0 ? IINI499>>"a'yy((tyy112a777 $ 2 21 5DI rc&URUS5$)zrDelete the element matching *key* from the BTree. Returns the matching element or ``None`` if it does not exist. N)rrs r delete_keyBTree.delete_keys ||C&&rrdcRURUR5U5nX!LdeU$)zgDelete *element* from the BTree. Returns the matching element or ``None`` if it was not in the BTree. )rr)rrddelts r delete_exactBTree.delete_exacts) ||GKKM73 rcUR$rR)rrs r__len__ BTree.__len__ yyrrc:URRU5 g)zBCall *visit*(element) on all elements in the tree in sorted order.N)rrrrs rrBTree.visit_in_orders   'rc:URRU5 grR)rrrs rrBTree._visit_preorder_by_nodes ))%0rc[U5$)zCreate a cursor.)rrs rr BTree.cursors d|rrc:URRU5 g)z4Register a cursor for the automatic parking service.N)raddrs rrBTree.register_cursors  rc:URRU5 g)z7Deregister a cursor from the automatic parking service.N)rdiscardrs rrBTree.deregister_cursors V$rc URUS9$)N)rrors r__copy__BTree.__copy__s~~t~,,rc## UR5nUR5nUcOUR5v M(SSS5 g!,(df  g=f7frR)rrr)rrrws r__iter__BTree.__iter__s? [[]fkkm;ggi ]]sA*A A AA)rr7rrrr#r)F)rrrrr DEFAULT_Trrr=rrr!rrr rrrr rrrr4rrrrrr!r$r rrrrres6<#,DS8I<#"d."r"b4i" 2b4iBI"'b'R$Y'B29(HbT4Z$8(T(1Xugtm-D11r2v!f!!%%4%- rrVTcR\rSrSrSrS\S\4SjrS\4SjrS\4Sjr S r S r S r g ) KViz/The BTree element type used in a ``BTreeDict``.rvaluecXlX lgrR_key_value)rrr*s rr= KV.__init__s   rrcUR$rRr-rs rrKV.keyrrcUR$rR)r.rs rr*KV.values {{rc<SURSURS3$NzKV(z, )r,rs rr1 KV.__str__ TYYKr$++a00rc<SURSURS3$r6r,rs r__repr__ KV.__repr__ r9rr,N) rrrrrr r'r=rr*r1r;r rrrr)r)s:9BrRr11rr)c^\rSrSrSr\SSS.S\S\S-S\4U4S jjjr S \ S \ 4S jr S \ S \ S S4Sjr S \ S S4SjrSrU=r$) BTreeDictizwA MutableMapping implemented with a BTree. Unlike a normal Python dict, the BTreeDict may be mutated while iterating. NFr#rrer#rrec,>[TU]XS9 X0lgNrsuperr=rerr#rreros rr=BTreeDict.__init__ 10 rrrcrURU5nUc[e[[U5R 5$rR)rKeyErrorr r)r*)rrrws r __getitem__BTreeDict.__getitem__ s1s# ;NC=&&( (rr*cP[X5nURX0R5 grR)r)rre)rrr*rws r __setitem__BTreeDict.__setitem__'sn C/rc4URU5c[egrR)rrHrs r __delitem__BTreeDict.__delitem__+s ??3  'N (rre)rrrrrr&rrrr=r r'rIrLrOr __classcell__r s@rr>r>s!% ! !$, !  !!)r)b)0r0"00rdrr>c4\rSrSrSrS\4SjrS\4SjrSrg) Memberi0z.The BTree element type used in a ``BTreeSet``.rcXlgrRr1rs rr=Member.__init__3s rrcUR$rRr1rs rr Member.key6rrr1N) rrrrrr r=rr rrrrTrT0s8BRrrTc^\rSrSrSr\SSS.S\S\S-S\4U4S jjjr S \ S \4S jr S \ S S4Sjr S \ S S4SjrSrU=r$)BTreeSeti:zqA MutableSet implemented with a BTree. Unlike a normal Python set, the BTreeSet may be mutated while iterating. NFr?r#rrec,>[TU]XS9 X0lgrArBrDs rr=BTreeSet.__init__@rFrrrc(URU5SL$rR)rrs r __contains__BTreeSet.__contains__Js$D00rr*cP[U5nURX R5 grR)rTrre)rr*rws rr BTreeSet.addMsUm C/rc&URU5 grR)r)rr*s rrBTreeSet.discardQs rrQ)rrrrrr&rrrr=rr^r rrr rRr s@rrZrZ:s}!% ! !$, !  !!111000RDrrZN)rcollections.abcrrtypingrrrrr r r r&r rr!rr'r*r,r4r Exceptionrrr'r)r>rTrZrrrrgsE 7III   T]"gbk" T!CCCC  FDGBFOFDR aWRV_aH" "Q GBFOQ h T]1'"b&/1(Br2b"f:~!6r2v8N@Wgbkugbk:b>r