/j%x dZddlmZmZddlmZmZmZmZm Z m Z m Z dZ e dZ Gddee Ze de Zd ed efd Zd ed efd ZGddZGddee efZGddee efZGddeZGddee efZe dZGddeee efZGddee efee ee effee efZGddeee ZGdd eee ee Zy!)"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)AnyCallableGenericOptionalTupleTypeVarcastKTceZdZdZdefdZy)Elementz+All items stored in the BTree are Elements.returnct)zFThe key for this element; the returned type must implement comparison.)NotImplementedErrorselfs KC:\xampp\htdocs\tradingbinance\backend\.venv\Lib\site-packages\dns/btree.pykeyz Element.keys!!N)__name__ __module__ __qualname____doc__r rrrrrs5"R"rrET)boundtrc |dz S)z[The minimum number of keys in a non-root node for a BTree with the specified ``t`` rrs r_MINr#s  q5Lrcd|zdz S)zGThe maximum number of keys in node for a BTree with the specified ``t``r!rr"s r_MAXr&#s q519rceZdZdZdZy)_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. ct|dS)Nx)idrs r__str__z_Creator.__str__0sT(1rN)rrrrr,rrrr(r((s rr(c eZdZdZgdZdededefdZdefdZ defd Z d e de eeffd Z d edd fdZd e deed effdZd e dedzfdZd eddfdZdedededzfdZde d ed ffdZdd d edefdZdd d edefdZdd dedd ddfdZdd d eddfdZdefdZdefd Zdd d eddfd!Zd e ded d"edzdedzfd#Zd$eegdfddfd%Z d$ed gdfddfd&Z!deded fd'Z"dedd fd(Z#d)Z$y)*_NodezFA Node in the BTree. A Node (leaf or internal) of the BTree. rcreatoris_leafeltschildrenrr0r1cX|dk\sJ||_||_||_g|_g|_y)Nr/)rrr0r1s r__init__z_Node.__init__<s0Av v    -/ rrct|jt|jksJt|jt|jk(S)z/Does this node have the maximal number of keys?)lenr2r&rrs r is_maximalz_Node.is_maximalD;499~dff---499~dff--rct|jt|jk\sJt|jt|jk(S)z/Does this node have the minimal number of keys?)r8r2r#rrs r is_minimalz_Node.is_minimalIr:rrcht|j}|dkDr'||j|dz jkDr|dfSd}t|j}|dz }d}||krK||zdz}|j|j}||k(r |}d} ||fS||kr|}|dz }n|dz}||krK||fS)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)r8r2r)rrlirequalmks rsearch_in_nodez_Node.search_in_nodeNs  N q5S499QU+//11e8O   N E1fQ1 A !   "Aax %x qEE1f%xrindexz _Node[KT, ET]c|jrJ|j|}|j|j}|r||j|<|S|SN)r1r3 maybe_cowr0)rrEchildcloneds rmaybe_cow_childz_Node.maybe_cow_childksJ<< e$. #)DMM% MLrc|j|\}}|r||fS|jry|j|}|j|S)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)rDr1rK _get_node)rrr?rArIs rrNz_Node._get_nodeusN&&s+5 !9  \\((+E??3' 'rNc|j|\}}|r|j|S|jry|j|j |S)z8Get the element associated with *key* or return ``None``N)rDr2r1r3get)rrr?rAs rrPz _Node.getsK&&s+5 99Q<  \\==#'', ,rc|dk(ry|j|dz }t|jt|jk(ry|j |dz }t|jt|jkrC|j ||dz syt|jt|jkrByy)a-Try 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!)r3r8r2r&rrKtry_right_steal)rrElefts roptimize_in_order_insertionz!_Node.optimize_in_order_insertions A: }}UQY' tyy>T$&&\ ) ##EAI.$))ntDFF|+''eai8$))ntDFF|+relementin_orderc|jrJ |j}|j|\}}|r |j|}||j|<|S|jr|jj ||y|j |}|jr|j|j|j||}|r|j||SrG) r9rrDr2r1insertrKadoptsplitinsert_nonfullrT) rrUrVrr?rAoldrIoelts rr[z_Node.insert_nonfulls??$$$++-C**3/HAuiil& !     G,,,Q/##%DJJ .++GX>44Q7 rc|jsJ|j|j|j|j}t |j t|jdzd|_|j t|j}t |j dt|j|_|jsft |jt|jdzd|_t |jdt|jdz|_|||fS)zASplit a maximal node into two minimal ones and a central element.r!N) r9 __class__rr0r1listr2r#r3)rrightmiddles rrZz _Node.splits   tvvt||T\\B$))DL1$4$678 4<(>T$&&\23 ||!$--TVV q0@0B"CDEN /Adff1A!BCDMVU""rparentc|dk7r|j|dz }|js|j|dz }|j|dz }|jj |j|dz <|jj d||j sD|j rJ|jj }|jj d|yy)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)r3r<rKr2poprXr1)rrcrErSeltrIs rtry_left_stealz_Node.try_left_steals A:??519-D??$--eai8kk%!),)- EAI&   C(||#||++ MM--/EMM((E2rc|dzt|jkr|j|dz}|js|j|dz}|j|}|jj d|j|<|jj ||jsD|jrJ|jj d}|jj |yy)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)r8r3r<rKr2reappendr1)rrcrErarfrIs rrRz_Node.try_right_steals 19s6??+ +OOEAI.E##%..uqy9kk%(%*ZZ^^A%6 E"   %}}#||++!NN..q1EMM((/rrSrbracv|jrJ|jrJ|j}|j|\}}|rJ|jj ||t |jdk(r ||g|_y|j||k(sJ|jj |dz|y)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)r9r1rrDr2rXr8r3)rrSrbrarr?rAs rrYz _Node.adopts??$$$<<jjl&&s+5y F# t}}  "!5MDM==#t+ ++ MM Q .rcV|jj|dz}|jj|jj||jj |j|j s&|jj |jyy)z>Merge this node's parent and its right sibling into this node.r!N)r3rer2riextendr1)rrcrEras rmergez _Node.mergesq##EAI. /0 $|| MM  0rcr|jr|jdS|jdjS)z"The least element in this subtree.r)r1r2r3minimumrs rroz _Node.minimums/ <<99Q< ==#++- -rcr|jr|jdS|jdjS)z%The greatest element in this subtree.)r1r2r3maximumrs rrrz _Node.maximum s/ <<99R= ==$,,. .rc|jrJ|j||ry|j||ry|dk(r|j||y|j |dz }|j||dz y)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!)r1rgrRrmrK)rrcrErSs rbalancez _Node.balancest>>!!   vu -     .  A: JJvu %))%!)4D JJvuqy )rexactc||jrJ|j|\}}d}|r~||j||ur td|jr|jj |Sd}|}|j |dzj}|j}|dz}|jr| tdy|j|}|jrK|j|||j|\}}|rJ|j |}|jrJ|j|||} |<|j|\} }| J| J| j|} | | j|<| } | S)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) r<rDr2 ValueErrorr1rer3rorrKrtdeleterN) rrrcrur?rA original_keyleast_successorrIrfnoder]s rrxz _Node.delete&s ~T__%666&&s+5  TYYq\%> !JKK||yy}}Q''EL"mmAE2:: 499%|| OO " "4== 1 rc |js8ddj|jDcgc]}t|dc}z}nd}t|dd|jd|j |Scc}w)N r*)r1joinr3r+r0r2)rcr3s rr,z _Node.__str__usm||SXXT]]&K]"Q%|]&KLLHHT(1Qt||nAdii[ CC'LsA1 )%rrrr __slots__intr(boolr6r9r<r tuplerDrKr rrNrrPrTr[rZrgrRrYrmrorrrtrxrrrrHrr,rrrr.r.4s7 @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/Drr.ceZdZdZddZddZddZdZdZde dzfd Z de dzfd Z d e d e ddfd Zdded e ddfdZddZddZdZdZy)CursorzA 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||_d|_d|_d|_d|_g|_d|_d|_d|_y)NrFT) btree current_node current_indexrecurse increasingparentsparked parking_keyparking_key_read)rrs rr6zCursor.__init__sG *.#$ 02  &* %rrNcX|jJ|jjs|jj|j|jf|jj |j|_|jJd|_|jjsyyrM)rr1rrirr3rs r _seek_leastzCursor._seek_leasts  ,,,##++ LL  !2!2D4F4F G H $ 1 1 : :4;M;M ND $$0 00!"D  ##++rc|jJ|jjs|jj|j|jf|jj |j|_|jJt |jj|_|jjsyyrG)rr1rrirr3r8r2rs r_seek_greatestzCursor._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)rrrrrrrrrr8r2r1rrrrers rnextz Cursor.nexts]     $!!Q&))Q...%)JJOO!%&"  "||??$$&$ "DO!!C(9(9(>(>$??'',,T-?-?@""a'"((00#'DL#&779 (,% t||$q(<@LL= 3Tr) r(r0 _immutablesetcursorsrwrrsizer.)rrrs rr6zBTree.__init__hs z    $'E  && !BCCZZDF DI DI1u !122DFdffdllD9DIDIrc,|jsd|_yy)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_immutablezBTree.make_immutables "DOrrcj|jrt|jD]}|jyrG)rrrrrcursors r_check_mutable_and_parkzBTree._check_mutable_and_parks% ??OllF KKM#rrfrVc|j|jj|j}|r||_|jj rY|j}t |j |jd|_|jj|j|jj||}||xjdz c_ |S)aEInsert 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!) rrrHr0r9r.rrYrZr[r)rrfrVrJold_rootr]s rinsert_elementzBTree.insert_elements $$&$$T\\2 DI 99   !yyHdffdllE:DI DIIOOX^^- .yy''X6 < IINI rrc8|jj|S)zhGet the element matching *key* from the BTree, or return ``None`` if it does not exist. )rrPrrs r get_elementzBTree.get_elementsyy}}S!!rruc|j|jj|j}|r||_|jj |d|}||xj dzc_t |jjdk(rX|jjsBt |jjdk(sJ|jjd|_|S)Nr!r) rrrHr0rxrr8r2r1r3)rrrurJrfs r_deletez BTree._deletes $$&$$T\\2 DIiisD%0 ? IINI499>>"a'yy((tyy112a777 $ 2 21 5DI rc&|j|dS)zDelete the element matching *key* from the BTree. Returns the matching element or ``None`` if it does not exist. N)rrs r delete_keyzBTree.delete_keys ||C&&rrUcR|j|j|}||usJ|S)zwDelete *element* from the BTree. Returns the matching element or ``None`` if it was not in the BTree. )rr)rrUdelts r delete_exactzBTree.delete_exacts+ ||GKKM73w rc|jSrG)rrs r__len__z BTree.__len__ yyrr|c:|jj|y)zBCall *visit*(element) on all elements in the tree in sorted order.N)rrrr|s rrzBTree.visit_in_orders   'rc:|jj|yrG)rrrs rrzBTree._visit_preorder_by_nodes ))%0rct|S)zCreate a cursor.)rrs rrz BTree.cursors d|rrc:|jj|y)z4Register a cursor for the automatic parking service.N)raddrs rrzBTree.register_cursors  rc:|jj|y)z7Deregister a cursor from the automatic parking service.N)rdiscardrs rrzBTree.deregister_cursors V$rc&|j|S)N)rr_rs r__copy__zBTree.__copy__s~~t~,,rc#K|j5} |j}|n|j& dddy#1swYyxYwwrG)rrr)rrrfs r__iter__zBTree.__iter__sE [[]fkkm;ggi  ]]sA(A AA Ar)F)rrrr DEFAULT_Trrr6rrrrrr rrrrrrrr.rrrrrrrrrrrres6<#,DS8I<#"d."r"b4i" 2b4iBI"'b'R$Y'B29(HbT4Z$8(T(1Xugtm-D11r2v!f!!%%4%- rrVTcDeZdZdZdedefdZdefdZdefdZdZ d Z y ) KVz/The BTree element type used in a ``BTreeDict``.rvaluec ||_||_yrG_key_value)rrrs rr6z KV.__init__s  rrc|jSrGrrs rrzKV.keyrrc|jSrG)rrs rrzKV.values {{rc<d|jd|jdSNzKV(z, )rrs rr,z KV.__str__ TYYKr$++a00rc<d|jd|jdSrrrs r__repr__z KV.__repr__ rrN) rrrrr rr6rrr,rrrrrrs:9BrRr11rrcteZdZdZeddddededzdeffdZd e d e fd Z d e d e d dfd Z d e d dfdZ xZS) BTreeDictzA MutableMapping implemented with a BTree. Unlike a normal Python dict, the BTreeDict may be mutated while iterating. NFrrrVrrrVc6t|||||_yNrsuperr6rVrrrrVr_s rr6zBTreeDict.__init__ 1x0  rrrcp|j|}|ttt|j SrG)rKeyErrorr rr)rrrfs r __getitem__zBTreeDict.__getitem__ s1s# ;NC=&&( (rrcTt||}|j||jyrG)rrrV)rrrrfs r __setitem__zBTreeDict.__setitem__'s!en C/rc2|j|tyrG)rrrs r __delitem__zBTreeDict.__delitem__+s ??3  'N (r)rrrrrrrrr6r rrr r  __classcell__rs@rrrsz!% ! !$, !  !)r)b)0r0"00rdrrc(eZdZdZdefdZdefdZy)Memberz.The BTree element type used in a ``BTreeSet``.rc||_yrGrrs rr6zMember.__init__3s  rrc|jSrGrrs rrz Member.key6rrN)rrrrr r6rrrrrr0s8BRrrcpeZdZdZeddddededzdeffdZd e d efd Z d e d dfd Z d e d dfdZ xZS)BTreeSetzyA MutableSet implemented with a BTree. Unlike a normal Python set, the BTreeSet may be mutated while iterating. NFrrrrVc6t|||||_yrrrs rr6zBTreeSet.__init__@rrrrc(|j|duSrG)rrs r __contains__zBTreeSet.__contains__Js$D00rrcRt|}|j||jyrG)rrrV)rrrfs rrz BTreeSet.addMsUm C/rc&|j|yrG)r)rrs rrzBTreeSet.discardQs r)rrrrrrrrr6rrr rrr rs@rrr:ss!% ! !$, !  !111000RDrrN)rcollections.abcrrtypingrrrrr r r rr rrrr#r&r(r.r ExceptionrrrrrrrrrrrsE 7III   T]"gbk" T!CCCC  FDGBFOFDR aWRV_aH" "Q GBFOQ h T]1'"b&/1(Br2b"f:~!6r2v8N@Wgbkugbk:b>r