+ +O|j%x <Rt^RIHtHt^RIHtHtHtHtH t H t H t ^t ] !R4t !RR]] ,4t] !R]R7tRR ltR R lt!R R 4t!RR]] ]3,4t!RR]] ]3,4t!RR]4t!RR]] ]3,4t] !R4t!RR]]] ]3,4t!RR]] ]3,]] ]] ]3,3,]] ]3,4t!RR]]] ,4t!RR]]] ,]] ,4tR#) 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)AnyCallableGenericOptionalTupleTypeVarcastKTc6a]tRt^toRtV3RlRltRtVtR#)Elementz+All items stored in the BTree are Elements.c <V^8dQhRS[/#returnr )format __classdict__s"BC:\Users\alokc\chatbot\backend\venv\Lib\site-packages\dns/btree.py __annotate__Element.__annotate__s""R"c \h)zFThe key for this element; the returned type must implement comparison.)NotImplementedErrorselfs&rkey Element.keys!!rN)__name__ __module__ __qualname____firstlineno____doc__r__static_attributes____classdictcell__rs@rr r s5""rr ET)boundc0V^8dQhR\R\/#rtrint)rs"rrrsCCrcV^, #)zSThe minimum number of keys in a non-root node for a BTree with the specified ``t`` rr,s&r_MINr1s  q5Lrc0V^8dQhR\R\/#r+r-)rs"rrr#sCCrc"^V,^, #)zGThe maximum number of keys in node for a BTree with the specified ``t``rr0s&r_MAXr4#s q519rc*a]tRt^(toRtRtRtVtR#)_CreatorzA _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\V4R #)x)idrs&r__str___Creator.__str__0sT(1rrN)r r!r"r#r$r:r%r&r's@rr6r6(srr6ca]tRt^4toRt.R1OtV3RlRltV3RlRltV3RlRltV3RlR lt V3R lR lt V3R lR lt V3RlRlt V3RlRlt V3RlRltV3RlRltV3RlRltV3RlRltV3RlRltV3RlRltV3RlRltV3R lR!ltV3R"lR#ltV3R$lR%ltV3R&lR'ltV3R(lR)ltV3R*lR+ltV3R,lR-ltR.tR/tVtR0#)2_Nodez>A Node in the BTree. A Node (leaf or internal) of the BTree. c,<V^8dQhRS[RS[RS[/#)rr,creatoris_leaf)r.r6bool)rrs"rr_Node.__annotate__<s"00#0040rcXV^8gQhWnW nW0n.Vn.VnR#)Nr,r?r@eltschildren)rr,r?r@s&&&&r__init___Node.__init__<s*Av v    -/ rc <V^8dQhRS[/#rrA)rrs"rrrBD..D.rc \VP4\VP48:gQh\VP4\VP48H#)z/Does this node have the maximal number of keys?)lenrFr4r,rs&r is_maximal_Node.is_maximalD;499~dff---499~dff--rc <V^8dQhRS[/#rrK)rrs"rrrBIrLrc \VP4\VP48gQh\VP4\VP48H#)z/Does this node have the minimal number of keys?)rNrFr1r,rs&r is_minimal_Node.is_minimalIrQrc<<V^8dQhRS[RS[S[S[3,/#rrr)r tupler.rA)rrs"rrrBNs$"sDy)9rc \VP4pV^8d1WPV^, ,P48dVR3#^p\VP4pV^, pRpW$8:d]W$,^,pVPV,P4pW8Xd TpRpW53#W8dTpV^, pKWV^,pKbW53#)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. FT)rNrFr)rrlirequalmks&& rsearch_in_node_Node.search_in_nodeNs  N q5S99QU+//11e8O   N Ef1 A !   "Ax x EExrc$<V^8dQhRS[RR/#)rindexr _Node[KT, ET]r-)rrs"rrrBksS_rcVP'dQhVPV,pVPVP4pV'dW0PV&V#V#N)r@rG maybe_cowr?)rrcchildcloneds&& rmaybe_cow_child_Node.maybe_cow_childksJ<<< e$. #)MM% MLrcJ<V^8dQhRS[RS[S[R,S[3,/#)rrrrd)r rrr.)rrs"rrrBus*((R(E(?*CS*H$I(rc VPV4wr#V'dW3#VP'dR#VPV4pVPV4#)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. )N)r`r@rj _get_node)rrr[r]rhs&& rro_Node._get_nodeusO&&s+ 9  \\\ ((+E??3' 'rc4<V^8dQhRS[RS[R,/#rrrNr r()rrs"rrrBs--r-b4i-rc VPV4wr#V'dVPV,#VP'dR#VPV,P V4#)z8Get the element associated with *key* or return ``None``N)r`rFr@rGget)rrr[r]s&& rru _Node.getsK&&s+ 99Q<  \\\==#'', ,rc$<V^8dQhRS[RR/#)rrcrNr-)rrs"rrrBsrc xV^8XdR#VPV^, ,p\VP4\VP48XdR#VP V^, 4p\VP4\VP48d#VP W^, 4'dKMR#R#)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. N)rGrNrFr4r,rjtry_right_steal)rrclefts&& roptimize_in_order_insertion!_Node.optimize_in_order_insertions A: }}UQY' tyy>T$&&\ ) ##EAI.$))ntDFF|+''ai88,rc:<V^8dQhRS[RS[RS[R,/#)relementin_orderrNr(rA)rrs"rrrBs&bDR$YrcVP4'dQhVP4pVPV4wrEV'd$VPV,pWPV&V#VP'dVPP WA4R#VP V4pVP4'd!VP!VP4!KVPW4pV'dVPV4V#TN) rOrr`rFr@insertrjadoptsplitinsert_nonfullr{) rr~rrr[r]oldrhoelts &&& rr_Node.insert_nonfulls??$$$$++-C**3/HAiil& !     ,,,Q/##%%JJ .++G>44Q7 rc6<V^8dQhRS[RS[R3,/#)rrrd)rXr()rrs"rrrBs # #u_b/AB #rc VP4'gQhVPVPVPVP4p\ VP \VP4^,R4VnVP \VP4,p\ VP R\VP44VnVP'go\ VP\VP4^,R4Vn\ VPR\VP4^,4VnWV3#)zASplit a maximal node into two minimal ones and a central element.N) rO __class__r,r?r@listrFr1rG)rrightmiddles& rr _Node.splits    tvvt||T\\B$))DL1$4$678 4<(>T$&&\23 |||!$--TVV q0@0B"CDEN /Adff1A!BCDMU""rc*<V^8dQhRRRS[RS[/#rparentrdrcrr.rA)rrs"rrrBs"_STrc *V^8wEd VPV^, ,pVP4'gVPV^, 4pVPV^, ,pVPP 4VPV^, &VPP ^V4VP 'gKVP 'dQhVPP 4pVPP ^V4R#R#)zTry to steal from this Node's left sibling for balancing purposes. Returns ``True`` if the theft was successful, or ``False`` if not. TF)rGrTrjrFpoprr@)rrrcrzeltrhs&&& rtry_left_steal_Node.try_left_steals A:??519-D??$$--eai8kk%!),)- EAI&   C(|||#|||++ MM--/EMM((E2rc*<V^8dQhRRRS[RS[/#rr)rrs"rrrBs"ocdrc @V^,\VP48dVPV^,,pVP4'gVPV^,4pVPV,pVPP ^4VPV&VPP V4VP'gKVP'dQhVPP ^4pVPP V4R#R#)zTry to steal from this Node's right sibling for balancing purposes. Returns ``True`` if the theft was successful, or ``False`` if not. TF)rNrGrTrjrFrappendr@)rrrcrrrhs&&& rry_Node.try_right_steals 19s6??+ +OOEAI.E##%%..uqy9kk%(%*ZZ^^A%6 E"   %}}}#|||++!NN..q1EMM((/rc,<V^8dQhRRRS[RRRR/#)rrzrdrrrNr()rrs"rrrBs*////2/o/RV/rc VP4'dQhVP'dQhVP4pVPV4wrVV'dQhVPP WR4\ VP4^8Xd W.VnR#VPV,V8XgQhVPP V^,V4R#)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.N)rOr@rr`rFrrNrG)rrzrrrr[r]s&&&& rr _Node.adopts??$$$$<<<jjl&&s+y # t}}  "!MDM==#t+ ++ MM Q .rc(<V^8dQhRRRS[RR/#rrrdrcrNr-)rrs"rrrBs"11O1C1D1rc nVPPV^,4pVPPVPPV44VPP VP4VP 'g(VPP VP4R#R#)z>Merge this node's parent and its right sibling into this node.N)rGrrFrextendr@)rrrcrs&&& rmerge _Node.mergess##EAI. /0 $||| MM  0rc <V^8dQhRS[/#rr)rrs"rrrBs...rc VP'dVP^,#VP^,P4#)z"The least element in this subtree.)r@rFrGminimumrs&rr _Node.minimums1 <<<99Q< ==#++- -rc <V^8dQhRS[/#rr)rrs"rrrB s///rc VP'dVPR,#VPR,P4#)z%The greatest element in this subtree.)r@rFrGmaximumrs&rr _Node.maximum s1 <<<99R= ==$,,. .rc(<V^8dQhRRRS[RR/#rr-)rrs"rrrBs"**o*c*d*rc &VP'dQhVPW4'dR#VPW4'dR#V^8XdVPW4R#VP V^, 4pVPW^, 4R#)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.N)r@rryrrj)rrrcrzs&&& rbalance _Node.balancest>>>!!   v - -     . .  A: JJv %))%!)4D JJvqy )rc \<V^8dQhRS[RS[R,RS[R,RS[R,/#)rrrrdexactNr)r rr()rrs"rrrB&s:---'8-ACd- d-rc VeVP4'dQhVPV4wrERpV'dVe#VPV,VJd \R4hVP'dVPP V4#RpTpVP V^,,P4pVP4pV^,pVP'dVe \R4hR#VPV4pVP4'dZVPW4VPV4wrEV'dQhVP V,pVP4'dQhVPWV4p VeCVPV4wrV fQhV fQhV PV,p WPV&T p V #)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 eltzexact delete had no match) rTr`rF ValueErrorr@rrGrrrjrdeletero) rrrrr[r] original_keyleast_successorrhrnoders &&&& rr _Node.delete&s ~T__%6%666&&s+  TYYq\%> !JKK|||yy}}Q''EL"mmAE2:: 499%||| OO " "4== 1 rc VP'g?RRPVPUu.uFp\V4R NK up4,pMRp\V4R RVP RVP V 2#uupi) r8)r@joinrGr9r?rF)rcrGs& rr: _Node.__str__uso|||SXXT]]&K]"Q%|]&KLLHHT(1Qt||nAdii[ CC'LsA= )rGr?rFr@r,NrE)r r!r"r#r$ __slots__rHrOrTr`rjrorur{rrrryrrrrrrrrrgrr:r%r&r's@rr=r=4s @I00.. .. :(( --$2 # #&&//"11..//**&--^4455DDrr=ca]tRtRtoRtV3RlRltV3RlRltV3RlRltR tR t V3R lR lt V3R lRlt V3RlRlt RV3RlRllt V3RlRltV3RlRltRtRtRtVtR#)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. c<V^8dQhRR/#)rbtreez BTree[KT, ET]r)rrs"rrCursor.__annotate__s & &o &rcWnRVn^VnRVnRVn.VnRVnRVnRVnR#)NFT) r current_node current_indexrecurse increasingparentsparked parking_keyparking_key_read)rrs&&rrHCursor.__init__sE *.#$ 02  &* %rc<V^8dQhRR/#rrNr)rrs"rrrs##T#rcJVPfQhVPP'gwVPPVPVP34VPP VP,VnVPfQh^VnKR#rf)rr@rrrrGrs&r _seek_leastCursor._seek_leasts  ,,,##+++ LL  !2!2D4F4F G H $ 1 1 : :4;M;M ND $$0 00!"D  ,rc<V^8dQhRR/#rr)rrs"rrrs===rcVPfQhVPP'gVPPVPVP34VPP VP,VnVPfQh\ VPP4VnKR#rf)rr@rrrrGrNrFrs&r_seek_greatestCursor._seek_greatests  ,,,##+++ LL  !2!2D4F4F G H $ 1 1 : :4;M;M ND $$0 00!$T%6%6%;%;!"##%|||'')$ #DO   ! # !!Q&'',,T-?-?@((000#'DL#&779 (,% t||$q(<@LLGet the next element, or return None if on the right boundary.NTF)rrrrrrrrrrNrFr@rrrrrs& rnext Cursor.nexts_     $!!Q&))Q...%)JJOO!%&"  "|||???$$&$ "DO!!C(9(9(>(>$??'',,T-?-?@""a'"((000#'DL#&779 (,% t||$q(<@LLVPW#4V'dVP4R#VP4R#VPPVPV34VPPV,VnVPeKQhVPPV4wr4V'dVPW#4R#W0nR#)aSeek to the specified key. If *before* is ``True`` (the default) then the cursor is positioned just before *key* if it exists, or before its least successor if it doesn't. A subsequent next() will retrieve this value. If *before* is ``False``, then the cursor is positioned just after *key* if it exists, or its greatest precessessor if it doesn't. A subsequent prev() will return this value. NF)rrrrrrrrrr@r`rrrrrGr)rrrr[r]s&&& rr Cursor.seeks%!JJOO  ,,,     %##+++((77= 3T) r6r? _immutablesetcursorsrr,rsizer=)rr,r%s&$$rrHBTree.__init__hs z    $'E  &&& !BCCZZDF DI DI1u !122FdffdllD9DIDIrc <VP'g RVnR#R#)zMake the BTree immutable. Attempts to alter the BTree after making it immutable will raise an Immutable exception. This operation cannot be undone. TN)r)rs&rmake_immutableBTree.make_immutables "DOrc<V^8dQhRR/#rr)rrs"rrr'src|VP'd\hVPFpVP4K R#rf)r)r"r+rrcursors& r_check_mutable_and_parkBTree._check_mutable_and_parks' ???OllF KKM#rc:<V^8dQhRS[RS[RS[R,/#)rrrrNr)rrs"rrr's&"drc VP4VPPVP4pV'dW0nVPP 4'd[VPp\ VP VPR4VnVPP!VP4!VPPW4pVfV;P^, un V#)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``. F) r5rrgr?rOr=r,rrrr,)rrrriold_rootrs&&& rinsert_elementBTree.insert_elements $$&$$T\\2 I 99   ! !yyHdffdllE:DI IIOOX^^- .yy''6 < IINI rc4<V^8dQhRS[RS[R,/#rrrs)rrs"rrr's""r"b4i"rc 8VPPV4#)zXGet the element matching *key* from the BTree, or return ``None`` if it does not exist. )rrurrs&&r get_elementBTree.get_elementsyy}}S!!rcH<V^8dQhRS[RS[R,RS[R,/#)rrrNrrs)rrs"rrr's*2b4iBIrcVP4VPPVP4pV'dW0nVPP VRV4pVeV;P ^,un\ VPP4^8XdeVPP'gI\ VPP4^8XgQhVPP^,VnV#rf) r5rrgr?rr,rNrFr@rG)rrrrirs&&& r_delete BTree._deletes $$&$$T\\2 IiisD%0 ? IINI499>>"a'yy(((tyy112a777 $ 2 21 5DI rc4<V^8dQhRS[RS[R,/#rrrs)rrs"rrr's''b'R$Y'rc &VPVR4#)zrDelete the element matching *key* from the BTree. Returns the matching element or ``None`` if it does not exist. N)rCr>s&&r delete_keyBTree.delete_keys ||C&&rc4<V^8dQhRS[RS[R,/#)rr~rNr)rrs"rrr'sB29rc TVPVP4V4pW!JgQhV#)zgDelete *element* from the BTree. Returns the matching element or ``None`` if it was not in the BTree. )rCr)rr~delts&& r delete_exactBTree.delete_exacts) ||GKKM73 rcVP#rf)r,rs&r__len__ BTree.__len__ yyrc:<V^8dQhRS[S[.R3,RR/#rr)rrs"rrr's&((HbT4Z$8(T(rc <VPPV4R#)zBCall *visit*(element) on all elements in the tree in sorted order.N)rrrrs&&rrBTree.visit_in_orders   'rc:<V^8dQhRS[S[.R3,RR/#r)rr=)rrs"rrr's&11Xugtm-D11rc<VPPV4R#rf)rrrTs&&rrBTree._visit_preorder_by_nodes ))%0rc6<V^8dQhRS[S[S[3,/#r)rr r()rrs"rrr'sr2vrc \V4#)zCreate a cursor.rrs&rr4 BTree.cursors d|rc$<V^8dQhRS[RR/#rr4rNr[)rrs"rrr's!!f!!rc <VPPV4R#)z4Register a cursor for the automatic parking service.N)r+addr3s&&rrBTree.register_cursors  rc$<V^8dQhRS[RR/#r^r[)rrs"rrr's%%%4%rc <VPPV4R#)z7Deregister a cursor from the automatic parking service.N)r+discardr3s&&rrBTree.deregister_cursors V$rc&VPVR7#))r%)rrs&r__copy__BTree.__copy__s~~t~,,rc#"VP4;_uu_4pVP4pVfMVP4xK*RRR4R# +'giR#;i5ir)r4rr)rr4rs& r__iter__BTree.__iter__s> [[]]fkkm;ggi ]]]sA$+A A$ A!  A$)r)r?r+rr,r,r)r r!r"r#r$ DEFAULT_TrHr/r5r:r?rCrGrLrOrrr4rrrgrjr%r&r's@rr$r$es<9D<#."" "''((11!!%%-  rr$VTcfa]tRtRtoRtV3RlRltV3RlRltV3RlRltR tR t R t Vt R #) KViz/The BTree element type used in a ``BTreeDict``.c&<V^8dQhRS[RS[/#)rrvaluer rm)rrs"rrKV.__annotate__sBrrcWnW nR#rf_key_value)rrrqs&&&rrH KV.__init__s   rc <V^8dQhRS[/#rr)rrs"rrrsRrcVP#rfrvrs&rrKV.keyrQrc <V^8dQhRS[/#r)rm)rrs"rrrssrrcVP#rf)rwrs&rrqKV.values {{rc<RVP RVP R2#zKV(z, )rurs&rr: KV.__str__ TYYKr$++a00rc<RVP RVP R2#rrurs&r__repr__ KV.__repr__ rrruN) r r!r"r#r$rHrrqr:rr%r&r's@rroros59111rrocaa]tRtRtoRtR]RRRR/V3RlV3R llltV3R lR ltV3R lR ltV3RlRlt Rt Vt V;t #) BTreeDictizwA MutableMapping implemented with a BTree. Unlike a normal Python dict, the BTreeDict may be mutated while iterating. r,r%NrFc:<V^8dQhRS[RS[R,RS[/#rr,r%Nrr.r$rA)rrs"rrBTreeDict.__annotate__/!! !$, !  !rc4<\SV`WR7W0nR#)r,r%NsuperrHrrr,r%rrs&$$$rrHBTreeDict.__init__ 10 rc&<V^8dQhRS[RS[/#rWrr)rrs"rrr s))r)b)rctVPV4pVf\h\\V4P 4#rf)r?KeyErrorr rorq)rrrs&& r __getitem__BTreeDict.__getitem__ s1s# ;NC=&&( (rc*<V^8dQhRS[RS[RR/#)rrrqrNrr)rrs"rrr's"00r0"00rcR\W4pVPW0P4R#rf)ror:r)rrrqrs&&& r __setitem__BTreeDict.__setitem__'sn C/rc$<V^8dQhRS[RR/#rrr)rrs"rrr+srdrc8VPV4f\hR#rf)rGrr>s&&r __delitem__BTreeDict.__delitem__+s ??3  'N (rr) r r!r"r#r$rlrHrrrr%r& __classcell__rrs@@rrrsU !!"& !  !!))00rrcHa]tRtRtoRtV3RlRltV3RlRltRtVtR#) Memberi0z.The BTree element type used in a ``BTreeSet``.c <V^8dQhRS[/#)rrr)rrs"rrMember.__annotate__3sBrcWnR#rfr|r>s&&rrHMember.__init__3s rc <V^8dQhRS[/#rr)rrs"rrr6rzrcVP#rfr|rs&rr Member.key6rQrr|N) r r!r"r#r$rHrr%r&r's@rrr0s8rrcaa]tRtRtoRtR]RRRR/V3RlV3R llltV3R lR ltV3R lR ltV3RlRlt Rt Vt V;t #)BTreeSeti:zqA MutableSet implemented with a BTree. Unlike a normal Python set, the BTreeSet may be mutated while iterating. r,r%NrFc:<V^8dQhRS[RS[R,RS[/#rr)rrs"rrBTreeSet.__annotate__@rrc4<\SV`WR7W0nR#rrrs&$$$rrHBTreeSet.__init__@rrc&<V^8dQhRS[RS[/#rW)rrA)rrs"rrrJs1111rc(VPV4RJ#rf)r?r>s&&r __contains__BTreeSet.__contains__Js$D00rc$<V^8dQhRS[RR/#rrqrNr)rrs"rrrMs0000rcR\V4pVPW P4R#rf)rr:r)rrqrs&& rr` BTreeSet.addMsUm C/rc$<V^8dQhRS[RR/#rr)rrs"rrrQsRDrc(VPV4R#rf)rG)rrqs&&rrdBTreeSet.discardQs rr) r r!r"r#r$rlrHrr`rdr%r&rrs@@rrr:sU !!"& !  !!1100rrN)r$collections.abcrrtypingrrrrrr r rlr r r(r1r4r6r=r Exceptionr"r$rmrorrrrrrrs) 7III   T]"gbk" T!  FDGBFOFDR aWRV_aH" "Q GBFOQ h T]1'"b&/1(Br2b"f:~!6r2v8N@Wgbkugbk:b>r