"/a R@dZddlmZddlmZmZdZGddeZy)a intervaltree: A mutable, self-balancing interval tree for Python 2 and 3. Queries may be by point, by range overlap, or by range envelopment. Core logic: internal tree nodes. Copyright 2013-2018 Chaim Leib Halbert Modifications Copyright 2014 Konstantin Tretyakov Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. ) attrgetter)floorlogct|dS)z$ log base 2 :rtype real )r)nums 1lib/python3.12/site-packages/intervaltree/node.pyl2r s sA;c eZdZdZdeddfdZedZedZedZ dZ dZ d Z d Z d Zd Zd ZdZdZdZdZdZdZdZdZdZdZdZdZefdZdZdZdZ dZ!dZ"d Z#d"d!Z$y)#Node)x_centers_center left_node right_nodedepthbalanceNc||_t||_||_||_d|_d|_|jyNr)rsetrrrrrrotate)selfrrrrs r __init__z Node.__init__.s; ! H  "$   r c4|j}t||gS) :rtype : Node )beginr )clsintervalcenters r from_intervalzNode.from_interval;s FXJ''r cD|sytjt|SrN)r from_sorted_intervalssorted)r intervalss r from_intervalszNode.from_intervalsCs ))&*;< !<<> !r cf|jdkD}| }||}||||<|j||<||jDcgc]}|j|s|}}|r9|D]}||j |||<|jj ||j |Scc}w)z-Single rotation. Assumes that balance is +-2.r)rrrr6removeupdater?)rheavylightsaveiv promoteess r rDz Node.srotates q  E{5kU kkmU #'u+"6"6N"6B$//":MR"6 N "5k004U  MM  +  Os B.B.c|jdkD}||j||<|j|j}|Sr)rrDr?)rrFresults r rEz Node.drotatesD<Y$$& "&y/"5"5h"?Y{{}$r c.g}|j||dS)z Returns self after removing the interval and balancing. If interval is not present, raise ValueError. Tshould_raise_errorremove_interval_helperrrdones r rIz Node.removes!**8Td*SSr c.g}|j||dS)zv Returns self after removing interval and balancing. If interval is not present, do nothing. FrUrWrYs r discardz Node.discards! **8Te*TTr c|j|rn|s!||jvr|jd|S |jj||jr|jd|S|j S|j|}||s|rt|jd|S||j|||||<|s|jS|S#|j t |xYw)aU Returns self after removing interval and balancing. If interval doesn't exist, raise ValueError. This method may set done to [1] to tell all callers that rebalancing has completed. See Eternally Confuzzled's jsw_remove_r function (lines 1-32) in his AVL tree article for reference. r:) r6rr-rIprint_structureKeyErrorpruner8 ValueErrorrXr)rrrZrVrSs r rXzNode.remove_interval_helpers ??8 $%($--*G A  ) $$X.}} A ::< 1I ?%$$ A #9oDDXtUghDO{{}$KA )$$&x((s CC;cLt}|D]}|j|||S)zD Returns all intervals that overlap the point_list. )r search_point)r point_listrQjs r search_overlapzNode.search_overlap,s*A   a ( r c4|jD]6}|j|cxkr|jks#n&|j|8||jkr|dr|dj ||S||jkDr|dr|dj ||S|S)z; Returns all intervals that contain point. rr:)rrr,r.rrc)rpointrQr2s r rczNode.search_point5sAww%'!%%' 1  4== T!W7''v6 6 T]] "tAw7''v6 6 r c|dr|ds |d }||}|S|dj\}|d<|d|dc|d<|d<|j|j}|S)z} On a subtree where the root node's s_center is empty, return a new subtree with no empty s_centers. rr:)pop_greatest_childr?r)rrSrQheirs r r`z Node.pruneBs Awd1g G I )_FM!G668MD$q'#'q'47 T!Wd1g  ";;=DKr c: jstjtdd}|j }j |rC|j }|j |j k(r,t |j  |rC fd}t |}xj|jzc_jr|fS|dfSdj\}d<tjD]J}|j|j sjj||j|Ljr$jj}||fSj!}||fS)a Used when pruning a node with both a left and a right branch. Returns (greatest_child, node), where: * greatest_child is a new node to replace the removed node. * node is the subtree after: - removing the greatest child - balancing - moving overlapping nodes into greatest_child Assumes that self.s_center is not empty. See Eternally Confuzzled's jsw_remove_r function (lines 34-54) in his AVL tree article for reference. r,r)keyc3\KjD]}|js|ywN)rr4)rN new_x_centerrs r get_new_s_centerz1Node.pop_greatest_child..get_new_s_centers'--B((6b(s!,,rr:)rr$rrpoprr,r;r rjrr4rIr.r?rr`) rivsmax_iv next_max_ivrqchildgreatest_childrNnew_selfrps ` @r rjzNode.pop_greatest_childksh Jug,FGCWWYF==L!ggi ??fjj0("<A  A '7'9:E MMU^^ +M}}d{"d1g~%)-Q(B(B(D %^T!W$--($$^%<%<=MM((,"&&r*)}} $$&;;=%x//::< &x//r c|jD]}|j|sy|||jkD}|xr|j|S)zB Returns whether this node or a child overlaps p. T)rr4r)rprNbranchs r r4zNode.contains_pointsN--B  # a$--'(2&//22r c4|jtSro)all_children_helperrrs r all_childrenzNode.all_childrens''..r c|j|j|dr|dj||dr|dj||S)Nrr:)rJrr})rrQs r r}zNode.all_children_helpersI dmm$ 7 G ' ' / 7 G ' ' / r c t|jtsJ|j}t |dks&Jdj |j d|j||jk(s&Jdj |j d|js&Jdj |j d|jD]}t|dsJt|dsJ|j|jksJ|j|jsJt|D];}|j|sJd j |||j d|d rj|d j|jks Jd j |j|d j|j!|jg|d rk|d j|jkDs Jd j |j|d j|j!|jgyy)zw ## DEBUG ONLY ## Recursively ensures that the invariants of an interval subtree hold. rz5Error: Rotation should have happened, but didn't! {}T)tostringz*Error: self.balance not set correctly! {}zError: s_center is empty! {}rr,z&Error: Overlaps ancestor ({})! {} {}rz"Error: Out-of-order left child! {}r:z#Error: Out-of-order right child! {}N) isinstancerrrrCformatr^r?hasattrrr,overlapsrr$r4verifyunion)rparentsbalrNparents r rz Node.verifys: $---.-ll3x!|  D K K$$d$3  | dll"  9 @ @$$d$3  " }}  , 3 3$$d$3  }--B2w' ''2u% %%88bff$ $$;;t}}- -- /,,V4?FFD$8$8$$8$G4*   77##dmm3 K4;;DMMJ K3 GNN7==$--9 : 77##dmm3 L5<> !r c&|r||_y||_y)z%Sets the left (0) or right (1) child.Nr)rrmvalues r __setitem__zNode.__setitem__s #DO"DNr cddj|j|j|jS)z Shows info about this node. Since Nodes are internal data structures not revealed to the user, I'm not bothering to make this copy-paste-executable as a constructor. z!Node<{0}, depth={1}, balance={2}>)rrrrr~s r __str__z Node.__str__ s,399 MM JJ LL  r cd}|jr||jjz }|jr||jjz }|S)zP Count the number of Nodes in this subtree. :rtype: int r:)r count_nodesr)rcounts r rzNode.count_nodessJ  >> T^^//1 1E ?? T__002 2E r c|dk(rydttt|z}dtd|z|z z }||j d|zS)z Calculates flaws in balancing the tree. :param n: size of tree :param m: number of Nodes in tree :rtype: real rgr:)intrr floatdepth_score_helper)rnmdoptfs r depth_scorezNode.depth_score+sV 63uRU|$$ a!edl# #4**1d333r c||z }|dkDr|t|jz}nd}|jr"||jj|dz|z }|jr"||jj|dz|z }|S)z Gets a weighted count of the number of Intervals deeper than dopt. :param d: current depth, starting from 0 :param dopt: optimal maximum depth of a leaf Node :rtype: real rr:)r+rrrr)rdrdirs r rzNode.depth_score_helper:s}X 6T]]++EE ?? T__77AtD DE >> T^^66q1udC CE r c:d}|dz}t||zg}|jr=t|jD]%}|j|dzt |z|z'|j rB|j|dz|j|j j |dzd|jrB|j|dz|j|jj |dzddj|}|r|St|y ) z For debugging.  z  z<: r:Tz>: N) strrr$r-reprrr^rjoinprint)rindentrnlsprlistrNrQs r r^zNode.print_structureMs f_TR  ==T]]+ R#XR0256, >> LLf % LL77 DI J ?? LLf % LL88!TJ K M &Mr )rF)%__name__ __module__ __qualname__ __slots__rr classmethodr r&r#r(r6r8r?rArrDrEr.rIr\rXrfrcr`rjr4rr}rrrrrrrr^r r r r %sI% ((==&6.00"2B %" TU8t 'RM0^3/!U(;T"#  *  4&r r N) __doc__operatorrmathrrr objectr rr r rs%* }6}r