hu<SSKJr SSKJrJrJr SSKJr SSKrSSK J r SSK J r SSK JrJrJrJrJr SSKJr SS K JrJr SS KJr /S Qr"S S \R45r"SS\5r"SS\5r"SS\5rSS.SSjjrSS.SSjjr SS.SSjjr!SS Sjjr"SS.S!Sjjr#SS.S"Sjjr$SS.S#Sjjr%"SS5r&g)$) annotations)IterableCallableSequence)overrideN)bbox) DXFEntity)UVecVec2Vec3 BoundingBox2dis_point_in_polygon_2d)CohenSutherlandLineClipping2d)rtree BoundingBox) EntityQuery) bbox_chainedbbox_crosses_fence bbox_inside bbox_outside bbox_overlapCirclePlanarSearchIndex point_in_bboxPolygonWindowc\rSrSrSr\R SSj5r\R SSj5r\R SSj5r Sr g) SelectionShapeznAbstractBaseClass for selection shapes. It is guaranteed that all methods get an entity_bbox which has data! cgNself entity_bboxs >/var/www/html/env/lib/python3.13/site-packages/ezdxf/select.pyis_inside_bboxSelectionShape.is_inside_bbox$sBEcgr!r"r#s r&is_outside_bboxSelectionShape.is_outside_bbox'sCFr)cgr!r"r#s r&is_overlapping_bbox"SelectionShape.is_overlapping_bbox*sGJr)r"Nr%r returnbool) __name__ __module__ __qualname____firstlineno____doc__abcabstractmethodr'r+r.__static_attributes__r"r)r&rrsE  EEFFJJr)rc^\rSrSrSrS Sjr\S Sj5r\S Sj5r\S Sj5r Sr g) r.zThis selection shape tests entities against a rectangular and axis-aligned 2D window. All entities are projected on the xy-plane. Args: p1: first corner of the window p2: second corner of the window c&[X45Ulgr!)r _bbox)r$p1p2s r&__init__Window.__init__7s"B8, r)c8URRU5$r!)r>containsr#s r&r'Window.is_inside_bbox:szz"";//r)cBURRU5(+$r!r> has_overlapr#s r&r+Window.is_outside_bbox>s::))+666r)c8URRU5$r!rGr#s r&r.Window.is_overlapping_bboxBszz%%k22r))r>N)r?r r@r r0) r3r4r5r6r7rArr'r+r.r:r"r)r&rr.sH-007733r)rch\rSrSrSrS SjrS Sjr\S Sj5r\S Sj5r \S Sj5r Sr g ) rGzThis selection shape tests entities against a circle. All entities are projected on the xy-plane. Args: center: center of the circle radius: radius of the circle c[U5Ul[U5Ul[URUR5n[ URU- URU-45Ulgr!)r _centerfloat_radiusr r>)r$centerradiusr_vecs r&rACircle.__init__PsOF| V} T\\4<<0"DLL5$8$,,:N#OP r)cRURRU5UR:*$r!)rOdistancerQ)r$vs r&_is_vertex_insideCircle._is_vertex_insideVs ||$$Q'4<<77r)cJ^[U4SjUR555$)Nc3F># UHnTRU5v M g7fr!rY.0rXr$s r& (Circle.is_inside_bbox..[s!R6Q4))!,,6Q!)all rect_verticesr#s` r&r'Circle.is_inside_bboxYsRk6O6O6QRRRr)c.URU5(+$r!r.r#s r&r+Circle.is_outside_bbox]++K888r)c^TRRU5(dg[U4SjUR555(agTR UR 5$)NFc3F># UHnTRU5v M g7fr!r]r^s r&r`-Circle.is_overlapping_bbox..es!N2MQt%%a((2MrbT)r>rHanyrdrYrRr#s` r&r.Circle.is_overlapping_bboxasOzz%%k22 N+2K2K2MN N N%%k&8&899r))r>rOrQN)rRr rSrP)rXr r1r2r0) r3r4r5r6r7rArYrr'r+r.r:r"r)r&rrGsPQ 8SS99::r)rch\rSrSrSrS SjrS Sjr\S Sj5r\S Sj5r \S Sj5r Sr g ) rjzThis selection shape tests entities against an arbitrary closed polygon. All entities are projected on the xy-plane. Complex **concave** polygons may not work as expected. c0[R"U5n[U5S:a [S5eUSR US5(aUR 5 [U5S:a [S5eX l[UR 5Ulg)Nz3 or more vertices requiredr) r listlen ValueErrorisclosepop _verticesr r>)r$verticesrXs r&rAPolygon.__init__pss IIh  q6A::; ; Q4<<"   EEG q6A::; ;%&"4>>2 r)c[X5nURn[U5H#upVURXES- U5(dM# g g)NTF)rry enumerate clip_line)r$extminextmaxcsrzindexends r&_has_intersectionPolygon._has_intersection{sF *6 :>>#H-JE||HQY/55.r)c*^^^^^TRRU5(dg[U4SjUR555(agURummUR umm[UUUU4SjTR 55(+$)NFc3V># UHn[UTR5S:v M g7frNrryr^s r&r`)Polygon.is_inside_bbox..s( 0 #1dnn 5 90&)c3># UHJnTURs=:=(a T:Os =(a TURs=:=(a T:Os v ML g7fr!)xy)r_rXmax_xmax_ymin_xmin_ys r&r`rs> ESUQSS 5 ;uqss':':U': ;^sAA)r>rHrmrdrrry)r$r%rrrrs` @@@@r&r'Polygon.is_inside_bboxszz%%k22   ..0   #)) u")) u EI^^    r)c.URU5(+$r!rgr#s r&r+Polygon.is_outside_bboxrir)c^TRRU5(dg[U4SjUR555(agTR UR UR 5$)NFc3V># UHn[UTR5S:v M g7frrr^s r&r`.Polygon.is_overlapping_bbox..s( 0 #1dnn 5 :0rT)r>rHrmrdrrrr#s` r&r.Polygon.is_overlapping_bboxsdzz%%k22   ..0   %%k&8&8+:L:LMMr))r>ryN)rzIterable[UVec])rr rr r1r2r0) r3r4r5r6r7rArrr'r+r.r:r"r)r&rrjsO 3  $99 N Nr)r)cachec.[XRU5$)zSelects entities whose bounding box lies withing the selection shape. Args: shape: seclection shape entities: iterable of DXFEntities cache: optional :class:`ezdxf.bbox.Cache` instance )select_by_bboxr'shapeentitiesrs r&rrs ($8$8% @@r)c.[XRU5$)zSelects entities whose bounding box is completely outside the selection shape. Args: shape: seclection shape entities: iterable of DXFEntities cache: optional :class:`ezdxf.bbox.Cache` instance )rr+rs r&rrs ($9$95 AAr)c.[XRU5$)zSelects entities whose bounding box overlaps the selection shape. Args: shape: seclection shape entities: iterable of DXFEntities cache: optional :class:`ezdxf.bbox.Cache` instance )rr.rs r&rrs ($=$=u EEr)c/nUHVn[R"U4SUS9nUR(dM-U"[U55(dMEUR U5 MX [ U5$)ahCalculates the bounding box for each entity and returns all entities for that the test function returns ``True``. Args: entities: iterable of DXFEntities func: test function which takes the bounding box of the entity as input and returns ``True`` if the entity is part of the selection. cache: optional :class:`ezdxf.bbox.Cache` instance Tfastr)rextentshas_datar appendr)r test_funcr selectionentityrs r&rrs^"$I,,yt5A  ]7+ , ,   V $  y !!r)c^^SUU4Sjjn[R"U5m[T5S:a [S5e[ T5m[ XU5$)aKSelects entities whose bounding box intersects an open polyline. All entities are projected on the xy-plane. A single point can not be selected by a fence polyline by definition. Args: vertices: vertices of the selection polyline entities: iterable of DXFEntities cache: optional :class:`ezdxf.bbox.Cache` instance c $>^^TRT5(dg[U4SjT55(agTRnTRnUR U5(ag[ X5m[U4Sj[ TTSS555$)NFc3F># UHnTRU5v M g7fr!inside)r_rXr%s r&r`:bbox_crosses_fence..is_crossing.. s8i{!!!$$irbTc3J># UHupTRX5v M g7fr!)r)r_startrrs r&r`rs# 7TBLL $ $7Ts #r})rHrmrrrwrzip)r%rrrr>rys` @r& is_crossing'bbox_crosses_fence..is_crossings  -- 8i8 8 8#### >>& ! ! *6 : 7:9iPQPRm7T   r)z2 or more vertices requiredr0)r rtrurvr r)rzrrrr>rys @@r&rrsL&   (#I 9~677 ) $E ( 77r)cB^SU4Sjjn[U5m[XU5$)zSelects entities where the selection point lies within the bounding box. All entities are projected on the xy-plane. Args: point: selection point entities: iterable of DXFEntities cache: optional :class:`ezdxf.bbox.Cache` instance c&>URT5$r!r)r%points r&r"point_in_bbox..is_crossing-s!!%((r)r0)r r)locationrrrrs @r&rr s ) NE ( 77r)cb^SU4SjjnTc[R"5mX"U50n[U5nSnU(aYSnUHHnXd;aM U"U5nUR5H"nUR U5(dMXtU'Sn MF MJ U(aMY[ UR 55$)ukSelects elements that are directly or indirectly connected to each other by overlapping bounding boxes. The selection begins at the specified starting element. Warning: the current implementation has a complexity of O(n²). Args: start: first entity of selection entities: iterable of DXFEntities cache: optional :class:`ezdxf.bbox.Cache` instance cD>[[R"U4STS95$)NTr)r rr)rrs r& get_bbox_2d!bbox_chained..get_bbox_2dCsT\\6)$eLMMr)TF)rr r1r )rCachertvaluesrHrkeys) rrrrselectedrestartrr% selected_bboxs ` r&rr4sN } 05{57I/JHH~HG F!%f-K!)!2 **=99'2V$"G "3  ' x}} ''r)cZ\rSrSrSrS S SjjrS SjrS SjrS SjrSr g)ri[a**Spatial Search Index for DXF Entities** This class implements a spatial search index for DXF entities based on their bounding boxes except for POINT and LINE. It operates strictly within the two-dimensional (2D) space of the xy-plane. The index is built once and cannot be extended afterward. The index can be used to pre-select DXF entities from a certain area to reduce the search space for other selection tools of this module. **Functionality** - The index relies on the bounding boxes of DXF entities, and only the corner vertices of these bounding boxes are indexed except for POINT and LINE. - It can only find DXF entities that have at least one bounding box vertex located within the search area. Entities whose bounding boxes overlap the search area but have no vertices inside it will not be found (e.g., a circle whose center point is inside the search area but none of its bounding box vertices will not be included). - The detection behavior can be customized by overriding the :meth:`detection_points` method. **Recommendations** Since this index is intended to be used in conjunction with other selection tools within this module, it's recommended to maintain a bounding box cache to avoid the computational cost of recalculating them frequently. This class creates a new bounding box cache if none is specified. This cache can be accessed through the public attribute :attr:`cache`. Nc ^^^ "SS[5mSU4SjjmU=(d [R"5Ul0Ul/nUHRnUR U5nU(dM[ U5m XPRT 'URUU 4SjU55 MT [R"U[S[U55S9Ul g)Nc\rSrSrSrSrg),PlanarSearchIndex.__init__..RTreeVtxiuidr"N)r3r4r5r6 __slots__r:r"r)r&RTreeVtxrs Ir)rc$>T"U5nXlU$r!r)rrvertexrs r&detection_vertex4PlanarSearchIndex.__init__..detection_vertexsh'FJMr)c36># UHnT"UT5v M g7fr!r")r_pntrrs r&r`-PlanarSearchIndex.__init__..s &6Fs c**6Fs) max_node_size)rr rintr1r) r rrr _entitiesdetection_pointsidextendrRTreemaxr _search_tree) r$rrrdetection_verticesrrrrrs @@@r&rAPlanarSearchIndex.__init__|s  !t !  *djjl /1-/F#44V< #V*C"(NN3   % %&6F& "KK c!S5G.H r)cUR5nUS:Xa [URR54$US:Xa>[URR5[URR 54$[ [R"U4SURS95nUR(aUR5$[5$)aReturns the detection points for a given DXF entity. The detection points must be 2D points projected onto the xy-plane (ignore z-axis). This implementation returns the corner vertices of the entity bounding box. Override this method to return more sophisticated detection points (e.g., the vertices of LWPOLYLINE and POLYLINE or equally spaced raster points for block references). POINTLINETr) dxftyper dxfrrrr rrrrrdtuple)r$rrbox2ds r&r"PlanarSearchIndex.detection_pointss.." g ,,-/ / f ))*D,@A AdllF94tzzRS >>&&( (wr)cURR[U5U5nURn[ SU55Vs/sHoTUPM sn$s snf)zzReturns all DXF entities that have at least one detection point located around `center` with a max. distance of `radius`. c38# UHoRv M g7fr!rr_rXs r&r`>PlanarSearchIndex.detection_point_in_circle..,O>),,O.rr)rpoints_in_bboxrr rr)r$r?r@rrrs r&detection_point_in_rect)PlanarSearchIndex.detection_point_in_rectsc"..== b48, - >>),,O*QQ$)Q QQr)r)rrrrrrr1rr!)rrrzCallable[[BoundingBox2d], bool]rrr1r)rzrrrrrr1r)rr rrrrr1r)rr rrrrr1r)' __future__rtypingrrrtyping_extensionsrr8ezdxfrezdxf.entitiesr ezdxf.mathr r r r rezdxf.math.clippingrrr ezdxf.queryr__all__ABCrrrrrrrrrrrrr"r)r&rs#//& $NN=)#  KSWW K 3^32 :^ :F;Nn;ND $ A A!A  A  A* $ B B!B  B  B* $ F F!F  F  F( $"!"." " "< $ (8(8!(8  (8  (8XRV8818=N88*TX$( $( 3$(?P$($(NgQgQr)