SOg_LSrSSKJr SSKrSSKrSSKrSSKrSSKJr SSK J r Sr Sr Sr S r"S S \5rS r"S S\5rSSjrSSjrSSjrSSjrg)zA Python implemntation of a kd-tree This package provides a simple implementation of a kd-tree in Python. https://en.wikipedia.org/wiki/K-d_tree )print_functionN)dequewrapsu Stefan Kögl z0.16z%https://github.com/stefankoegl/kdtreez ISC licensec\rSrSrSrSSjr\S5rSrSr Sr \S 5r S r S r S rS rSr\rSrSrSrg)NodezbA Node in a kd-tree A tree is represented by its root node, and every node represents its subtreeNc(XlX lX0lgNdataleftright)selfr rrs K/Users/admin/workspace/ai/Jarvis/env/lib/python3.13/site-packages/kdtree.py__init__ Node.__init__s   cjUR(+=(d [SUR55$)zkReturns True if a Node has no subnodes >>> Node().is_leaf True >>> Node( 1, left=Node(2) ).is_leaf False c3F# UHup[U5(+v M g7fr )bool).0cps r Node.is_leaf..0s:MDAQKKM!)r allchildrenrs ris_leaf Node.is_leaf%s)II <:DMM:: >> len(list(create(dimensions=2).children)) 0 >>> len(list(create([ (1, 2) ]).children)) 0 >>> len(list(create([ (2, 2), (2, 1), (2, 3) ]).children)) 2 Nr)rr rr s rr Node.childrenfsR$ 993))Q,  ::$**//5**a- 6:sA4A6c*US:XaX lgX lg)zRSets one of the node's children index 0 refers to the left, 1 to the right child rN)rr)rindexchilds r set_childNode.set_child~s A:IJrc [[U55n[U/URVVs/sHup#UR 5S-PM snn-5$s snnf)z Returns height of the (sub)tree, without considering empty leaf-nodes >>> create(dimensions=2).height() 0 >>> create([ (1, 2) ]).height() 1 >>> create([ (1, 2), (2, 3) ]).height() 2 r0)intrmaxrheight)r min_heightrrs rr: Node.heightsEd_ J)clsr )dict __class____name__reprr r s r__repr__ Node.__repr__s-% T^^,,4 ? CD DrcURSL$r r r s r __nonzero__Node.__nonzero__syy$$rc|[U[5(aURU:H$URUR:H$r ) isinstancetupler )rothers r__eq__ Node.__eq__s1 eU # #99% %99 * *rc[U5$r )idr s r__hash__ Node.__hash__s $xrr )NNN)rE __module__ __qualname____firstlineno____doc__rpropertyr!r$r*r-rr5r:r?rGrK__bool__rQrU__static_attributes__rrrrso   < <"""  .L&D %H+ rrc0^[T5U4Sj5nU$)zBCheck if the object of the function has axis and sel_axis members c >SURUR4;a)[S[TR[ U5S9-5eT"U/UQ70UD6$)NzO%(func_name) requires the node %(node)s to have an axis and a sel_axis function) func_namenode)axissel_axis ValueErrorrCrErF)rargskwargsfs r_wrapperrequire_axis.._wrappers[ DIIt}}- ->1::DJ?@A A''''rr)rhris` r require_axisrks" 1X(( Orc^\rSrSrSrSU4Sjjr\S5r\S5r\S5r Sr \SSj5r \S 5r \ S 5rS rS rS rSSjrSr\SSj5rSr\SSj5r\S5rSrSrU=r$)KDNodez7A Node that contains kd-tree specific data and methods cR>[[U] XU5 X@lXPlX`lg)aCreates a new node for a kd-tree If the node will be used within a tree, the axis and the sel_axis function should be supplied. sel_axis(axis) is used when creating subnodes of the current node. It receives the axis of the parent node and returns the axis of the child node. N)superrmrrcrd dimensions)rr rrrcrdrqrDs rrKDNode.__init__s% fd$T7  $rcUn[U/URS9 URcXlU$XRURUR:a<URc"UR U5UlUR$URnO;UR c"UR U5UlUR $UR nM)z Adds a point to the current node or iteratively descends to one of its children. Users should call add() only to the topmost tree. )rq)check_dimensionalityrqr rcrcreate_subnoder)rpointcurrents radd KDNode.adds %W5G5G H||#$ \\"W\\',,%??<<'#*#9#9%#@GL"<<'%llG==($+$:$:5$AGM"==(%mmG)rcURUURUR5URURS9$)z'Creates a subnode for the current node rcrdrq)rDrdrcrq)rr s rruKDNode.create_subnodes:~~d]]499-??, ,rcUR(a-URR[UR5upO,URR[ UR5upXbU4$U4$)z~Finds a replacement for the current node The replacement is returned as a (replacement-node, replacements-parent-node) tuple )r extreme_childminrcrr9)rr4parents rfind_replacementKDNode.find_replacement s[ :: JJ44S$))DME6 II33CCME!3v>>>>rc@URU:XdgUSL=(d X L$)z4checks if self's point (and maybe identity) matches FNrJrrvrbs r should_removeKDNode.should_removes"yyE! /$,/rcU(dgURX5(aURU5$UR(aAURRX5(a!URRU5UlOQUR(a@URRX5(a URRU5UlXRUR UR::a1UR(a URR X5UlXRUR UR:a1UR(a URR X5UlU$)aRemoves the node with the given point from the tree Returns the new root node of the (sub)tree. If there are multiple points matching "point", only one is removed. The optional "node" parameter is used for checking the identity, once the removeal candidate is decided.N)r_removerrrcr removers rr KDNode.remove!s     e * *<<& & 9900== ))%0DI ZZDJJ44UAA++E2DJ  tyy3 3yy II,,U9  tyy3 3zz!ZZ..u;  rcUR(a SUlU$UR5up#URURpTURURsUlUlXBLaUOUXRLaUOUsUlUlUR UR sUlUlX0La5UR U5nURX`5 URX5 U$URX5 U$r ) r!r rrrrcr?r5r)rrvrootmax_ptmp_ltmp_rr>s rrKDNode._removeFs <<DIK ++- yy$**u $ 4:: 4:).):uO`efj 4:#yy$)) 49  %%d+C OOC & LL %   KK $ rcUR(aURR5OSnUR(aURR5OSn[X- 5S:ag[ SUR 55$)ztReturns True if the (sub)tree is balanced The tree is balanced if the heights of both subtrees differ at most by 1 rr0Fc3># UHupURv M g7fr ) is_balancedrr_s rr%KDNode.is_balanced..ss;]TQ1==]s)rr:rabsrr)r left_height right_heights rrKDNode.is_balancedfs`-1IIdii&&(1 .2jjtzz((*a {) *Q .;T]];;;rcr[UR5Vs/sHoRPM sn5$s snf)z8 Returns the (possibly new) root of the rebalanced tree )creater*r r%s r rebalanceKDNode.rebalancevs) t||~6~!vv~6776s4cT[R"URUX- S5$)zQ Squared distance at the given axis between the current Node and the given point )mathpowr )rrvrcs r axis_distKDNode.axis_dist~s$ xx $%+5q99rc [UR5n[UVs/sHo0RX5PM sn5$s snf)z? Squared distance between the current Node and the given point )rangerqsumr)rrvris rdist KDNode.dists6 $// "a8aNN5,a8998sAc^^US:a [S5eTcU4SjnOUU4Sjn/nURTX%U[R"55 [ USS9VVVs/sH upgoU*4PM snnn$s snnnf)aReturn the k nearest neighbors of point and their distances point must be an actual point, not a node. k is the number of results to return. The actual results can be less (if there aren't more nodes to return) or more in case of equal distances. dist is a distance function, expecting two points and returning a distance value. Distance values can be any compareable type. The result is an ordered list of (node, distance) tuples. r0zk must be greater than 0.c&>URT5$r rnrvs r#KDNode.search_knn..s rc*>T"URT5$r rJ)rrrvs rrrsaffe!4rT)reverse)re _search_node itertoolscountsorted) rrvkrget_distresultsdrrbs ` ` r search_knnKDNode.search_knnsr q589 9 <.H4H %Xy7HI.4GT-JK-JzqTr -JKKKsA2c8U(dgU"U5nU*[U5U4n[U5U:a$U*USS:a[R"X75 O[R"X75 UR UR nXR U- n X-n XR U:a+URbURRXX4U5 O*URbURRXX4U5 U *USS:d[U5U:aXR UR UR :a,URbURRXX4U5 ggURbURRXX4U5 gggNr) nextlenheapq heapreplaceheappushr rcrrr) rrvrrrcounternodeDistitem split_plane plane_dist plane_dist2s rrKDNode._search_nodeso D> 4=$/ w<1 y71:a=(!!'0 NN7 )ii * 99% 3  -   k )yy$ &&uGLzz% '''WM <'!*Q- '3w ? .. #ii *   {1 1yy$ ))%wI  {1 1zz% **5J& 2rc>^/nU4SjnURTX$U5 U$)z Search the n nearest nodes of the given point which are within given distance point must be a location, not a node. A list containing the n nearest nodes to the point within the distance will be returned. c&>URT5$r rrs rr'KDNode.search_nn_dist..s QVVE]r)r)rrvdistancebestrrs ` rsearch_nn_distKDNode.search_nn_dists&* UHx@rcU(dgUR(a?URURURRUR:agUR(a?URURURRUR:ag[ SUR 55=(d UR $)zSChecks recursively if the tree is valid It is valid if each node splits correctly TFc3F# UHupUR5v M g7fr )is_validrs rr"KDNode.is_valid..$s:MDA1::<USRT$rrJ) child_parentrcs rr&KDNode.extreme_child..-s|A';';D'ArN)NNkey)rr~) rsel_funcrcmax_keymerr child_maxr candidatess ` rr~KDNode.extreme_child's B $tTl^AEOQ__Xt4 OCLM941am69 Mn  00PMs A4 A:)rcr rqrrrd)NNNNNNr )rErWrXrYrZrrkrxrurrrrr[rrrrrrrrrrr~r] __classcell__)rDs@rrmrmsB?C&* % ,,@,, ? ?0!!H> < <8::L@+4\AA"K*   KK"11rrmc v^^U(dT(d [S5eU(a [UT5mU=(d U4SjnU(d [UTTS9$[U5nUR U4SjS9 [ U5S-nXn[ USUTU"T55n[ XS-STU"T55n[XVUTUTS 9$) aCreates a kd-tree from a list of points All points in the list must be of the same dimensionality. If no point_list is given, an empty tree is created. The number of dimensions has to be given instead. If both a point_list and dimensions are given, the numbers must agree. Axis is the axis on which the root-node should split. sel_axis(axis) is used when creating subnodes of a node. It receives the axis of the parent node and returns the axis of the child node. z0either point_list or dimensions must be providedc>US-T-$)Nr0r^) prev_axisrqs rrcreate..Vsy{j.Hr)rdrcrqc>UT$r r^)rvrcs rrr]s eDkrrrNr0r{)rertrmlistsortrr) point_listrqrcrdmedianlocrrs `` rrr@s jKLL )*jA IHH xdzJJj!JOO1O2 _ !F  C :gv& HTN CD :qjk*J GE #UZ XXrczU=(d [US5nUHn[U5U:wdM[S5e U$)Nrz>All Points in the point_list must have the same dimensionality)rre)rrqrs rrtrtfs?1s:a=1J  q6Z ]^ ^ rc## [5nURU5 U(aUR5nUv U(dUR(a2URUR=(d UR 55 U(dUR (a2URUR =(d UR 55 U(aMgg7f)zReturns an iterator over the tree in level-order If include_all is set to True, empty parts of the tree are filled with dummy entries and the iterator becomes infinite. N)rrpopleftrrDr)tree include_allqrbs r level_orderrps} AHHTN yy{ $)) HHTYY2$.."2 3 $** HHTZZ34>>#3 4 !s CCCc[XR5S- 5n[SU5nSnSnSn[USS9Hn US:Xa![ 5 [ 5 [ SU-SS9 [ XR-U- 5n U (a[ U R5OSRU 5n [ U SS9 US- nXv:Xa SnUS-nUS- nX:dM O [ 5 [ 5 g ) zPrints the tree to stdout r0rrT)r )endN) rr:rrprintr8strr center) r max_level node_width left_paddingr: max_width per_levelin_levellevelrbwidthnode_strs r visualizersKKM!O ,FAvIIHEDd3 q= G G #l" ,I(23&*C N::5A hC A   H NI NE > )4, G Gr)NNrNr )F)d )rZ __future__rrroperatorr collectionsr functoolsr __author__ __version__ __website__ __license__objectrrkrmrrtrrr^rrrsn &   0  5  _6_D  q1Tq1j #YL5(! r