h5ESSKJr SSKJrJrJrJrJr SSKJ r SSK J r J r J r JrJrJrJrJrJr SSKJrJrJrJrJrJr S/rSrS rS rS r"S S5r \RBS\RDS\RFS \RHS0r%SSjr&g)) annotations)OptionalIteratorIterableAnyCallable)Self) Vec3NULLVECOCSBezier3PBezier4PMatrix44has_clockwise_orientationUVec BoundingBox)CommandLineToMoveToCurve3ToCurve4To PathElementPathg{Gz?g-C6?) _vertices _start_index _commands_has_sub_paths _user_datacZ\rSrSr\r\4S,Sjjr\S-S.Sjj5r S/Sjr S0Sjr S1Sjr S2Sjr S3S jrS4S jrS5S jrS6S jr\r\S7S j5r\R*S8Sj5r\S9Sj5r\R*S:Sj5r\S9Sj5rS;SjrSSjrS:Sjr S:Sjr!S?Sjr"S@Sjr#SASjr$SASjr%SBS jr&S5S!jr'S5S"jr(S5S#jr)SCSDS$jjr*SESFS%jjr+SGS&jr,SHS'jr-SIS(jr.SJS)jr/SJS*jr0S+r1g)Kr)c^[U5/Ul/Ul/UlSUlSUlg)NF)r rrrrr )selfstarts A/var/www/html/env/lib/python3.13/site-packages/ezdxf/path/path.py__init__ Path.__init__,s-&*5k]')(*##NcU"5n[U5S:XaU$XlX$l[U5Ul[ SU55UlX4lU$)zECreate path instances from a list of vertices and a list of commands.rc3F# UHo[R:Hv M g7fNrMOVE_TO.0cmds r& 2Path.from_vertices_and_commands..Cs%V W__&< !)lenrrmake_vertex_indexranyrr )clsvertices command_codes user_datanew_paths r&from_vertices_and_commandsPath.from_vertices_and_commands5sS5 x=A O%* 1- @"%%V %V"V'r)cxUR5n[URUR55UlU$)zlReturns a new transformed path. Args: m: transformation matrix of type :class:`~ezdxf.math.Matrix44` )clonelisttransform_verticesr)r$mr<s r& transformPath.transformGs0::<!!"6"6t~~"FGr)c4[UR55$)z_Returns the bounding box of all control vertices as :class:`~ezdxf.math.BoundingBox` instance. )rcontrol_verticesr$s r&bbox Path.bboxRs400233r)c,[UR5$)zReturns count of path elements.)r5rrHs r&__len__ Path.__len__Xs4>>""r)c[U[5(a [S5eURUnURUnUR nU[ R:Xa [XC5$U[ R:Xa [XC5$U[ R:Xa[XCS-XC5$U[ R:Xa[XCS-XCXCS-5$[SU35e)zBReturns the path element at given index, slicing is not supported.zslicing not supportedrInvalid command: ) isinstanceslice TypeErrorrrrrr.rLINE_TOr CURVE3_TOr CURVE4_TOr ValueError)r$itemr1indexr9s r& __getitem__Path.__getitem__\s dE " "34 4nnT"!!$'>> '// !(/* * '// !(/* * '## #HQY/A A '## ###  ,SE233r)cT^U4Sj[[TR555$)Nc3.># UH nTUv M g7fr,)r0ir$s r&r2 Path.__iter__..rs>':!;<>"c%//&::::..--/!..335#22??r)cUR$)zAttach arbitrary user data to a :class:`Path` object. The user data is copied by reference, no deep copy is applied therefore a mutable state is shared between copies. r rHs r&r;Path.user_datas r)cXlgr,rp)r$datas r&r;rqsr)c URS$)zS:class:`Path` start point, resetting the start point of an empty path is possible. rrrHs r&r% Path.starts ~~a  r)clUR(a [S5e[U5URS'g)NzRequires an empty path.r)rrWr rr$locations r&r%rvs' >>67 7 $XDNN1 r)c URS$)z:class:`Path` end point.rurHs r&endPath.ends~~b!!r)cRUR(a[UR5$/$)z6Yields all path control vertices in consecutive order.)rrArrHs r&rGPath.control_verticess >>' ' r)c,[UR5$)z Internal API.)rArrHs r&r:Path.command_codessDNN##r)chURn[U5S:aUSRUS5$g)z>Returns ``True`` if the start point is close to the end point.rrr{F)rr5isclose)r$r9s r& is_closedPath.is_closeds5>> x=1 A;&&x|4 4r)c<[RUR;$)z3Returns ``True`` if the path has any line segments.)rrTrrHs r& has_linesPath.has_liness$..00r)c[RUR;=(d [RUR;$)z4Returns ``True`` if the path has any curve segments.)rrVrrUrHs r& has_curvesPath.has_curvess/    / V73D3D3V r)cUR$)z_Returns ``True`` if the path is a :term:`Multi-Path` object that contains multiple sub-paths. )rrHs r& has_sub_pathsPath.has_sub_pathss """r)cdUR(a [S5e[UR5$)zReturns ``True`` if 2D path has clockwise orientation, ignores z-axis of all control vertices. Raises: TypeError: can't detect orientation of a :term:`Multi-Path` object z/can't detect orientation of a multi-path object)rrSrrrHs r&rPath.has_clockwise_orientations(   MN N(88r)cURnU[R:XaURUR5 gU[R :XaUR UR5 gU[R:Xa'URURUR5 gU[R:Xa2URURURUR5 g[SU35e)zAppend a single path element.rPN)typerrTline_tor|r.move_torU curve3_toctrlrV curve4_toctrl1ctrl2rW)r$r1ts r&append_path_elementPath.append_path_elements HH   LL ! '// ! LL ! '## # NN377CHH - '## # NN377CIIsyy 9045 5r)cURR[R5 URR[ UR 55 UR R[U55 g)z4Add a line from actual path end point to `location`.N)rappendrrTrr5rr rxs r&r Path.line_tosK goo.   T^^!45 d8n-r)cURnU(d[U5URS'gSUlUS[R :XaDUR 5 URR 5 URR 5 UR[R 5 URR[UR55 URR[U55 g)a+Start a new sub-path at `location`. This creates a gap between the current end-point and the start-point of the new sub-path. This converts the instance into a :term:`Multi-Path` object. If the :meth:`move_to` command is the first command, the start point of the path will be reset to `location`. rNTr{) rr rrrr.poprrr5)r$ryres r&r Path.move_tos>> $XDNN1  " B<7?? * LLN NN      ! ! #(   T^^!45 d8n-r)cURR[R5 URR[ UR 55 UR R[U5[U545 g)uAdd a quadratic Bèzier-curve from actual path end point to `location`, `ctrl` is the control point for the quadratic Bèzier-curve. N) rrrrUrr5rextendr )r$ryrs r&rPath.curve3_tosX g//0   T^^!45 tDz4>:;r)c$URR[R5 URR[ UR 55 UR R[U5[U5[U545 g)uAdd a cubic Bèzier-curve from actual path end point to `location`, `ctrl1` and `ctrl2` are the control points for the cubic Bèzier-curve. N) rrrrVrr5rrr )r$ryrrs r&rPath.curve4_tos^ g//0   T^^!45 tE{DKhHIr)c^UR(dURUR5 gg)zKClose path by adding a line segment from the end point to the start point. N)rrr%rHs r&close Path.closes ~~ LL $r)cUR(aMUR5nUcS5eURRU5(dUR U5 ggUR 5 g)zClose last sub-path by adding a line segment from the end point to the start point of the last sub-path. Behaves like :meth:`close` for :term:`Single-Path` instances. Nz2internal error: required MOVE_TO command not found)r_start_of_last_sub_pathr|rrr)r$ start_points r&close_sub_pathPath.close_sub_pathsd   668K' DC D'88##K00 [)1 JJLr)c[RnURn[U5S- nUS:a1X#U:XaURUR U$US-nUS:aM1g)Nrr)rr.rr5rr)r$rrerYs r&rPath._start_of_last_sub_path,sd//>>H !ai')~~d&7&7&>?? QJEair)cUR5nUR(dU$URS[R:XaoURR 5 UR R 5 UR R 5 [SUR55UlURR5 UR R5 [UR5UlU$)zJReturns a new :class:`Path` with reversed commands and control vertices. r{c3F# UHo[R:Hv M g7fr,r-r/s r&r2 Path.reversed..Gs&2@3w&.r4) r@rrr.rrrr7rreverser6)r$paths r&reversed Path.reversed7s zz|~~K >>"  0 NN   NN      ! ! #"%&26..&#D     -dnn= r)clUR5(aUR5$UR5$)zReturns new :class:`Path` in clockwise orientation. Raises: TypeError: can't detect orientation of a :term:`Multi-Path` object )rr@rrHs r& clockwisePath.clockwiseOs+  ) ) + +::< ==? "r)clUR5(aUR5$UR5$)zReturns new :class:`Path` in counter-clockwise orientation. Raises: TypeError: can't detect orientation of a :term:`Multi-Path` object )rrr@rHs r&counter_clockwisePath.counter_clockwise[s+  ) ) + +==? "::< r)cF^SU4SjjnSU4SjjnURX#5$)u)Approximate path by vertices, `segments` is the count of approximation segments for each Bézier curve. Does not yield any vertices for empty paths, where only a start point is present! Approximation of :term:`Multi-Path` objects is possible, but gaps are indistinguishable from line segments. cN>[[XU45RT55$r,)iterr approximate)p0p1p2segmentss r&curve3 Path.approximate..curve3ts""".::8DE Er)cN>[[XX#45RT55$r,)rrr)rrrp3rs r&curve4 Path.approximate..curve4ws#""!12>>xHI Ir)rr rr rr returnIterator[Vec3] rr rr rr rr rr _approximate)r$rrrs ` r&rPath.approximatehs" F J  00r)cL^^SUU4SjjnSUU4SjjnURX45$)uApproximate path by vertices and use adaptive recursive flattening to approximate Bèzier curves. The argument `segments` is the minimum count of approximation segments for each curve, if the distance from the center of the approximation segment to the curve is bigger than `distance` the segment will be subdivided. Does not yield any vertices for empty paths, where only a start point is present! Flattening of :term:`Multi-Path` objects is possible, but gaps are indistinguishable from line segments. Args: distance: maximum distance from the center of the curve to the center of the line segment between two approximation points to determine if a segment should be subdivided. segments: minimum segment count per Bézier curve cr>TS:Xa [S5e[[XU45RTT55$Ngzinvalid max distance: 0.0)rWrr flattening)rrrdistancers r&rPath.flattening..curve3s73 #<>>"".99(HMN Nr)cr>TS:Xa [S5e[[XX#45RTT55$r)rWrrr)rrrrrrs r&rPath.flattening..curve4s83 #<>>""!12==hQR Rr)rrr)r$rrrrs `` r&rPath.flattening|s.* O O  S S   00r)c#<# UR(dgURSnUv URn[URUR5HupVU[R :XdU[R :Xa XEnUv OU[R:Xa(XEUS-upU"X8U5n [U 5 U ShvN OKU[R:Xa)XEUS-upnU"X:X5n [U 5 U ShvN O[SU35eUnM gNWN7f)NrrOrP) rrziprrrTr.rUnextrVrW) r$rrr%r9sir1 end_locationrptsrrs r&rPath._approximates~~ q! >>4,,dnn=GBgoo%)?'| "")))%-26%:"U,7S )))-526-B*lU5?S  #4SE!:;; E!> s$B>DDDDcR^^[UU4SjUR55Ulg)z;Transform path from given `ocs` to WCS coordinates inplace.c3r># UH,nTRUR[T5S95v M. g7f))zN)to_wcsreplacefloat)r0v elevationocss r&r2Path.to_wcs..s0 ?M!CJJqyy5#3y4 5 5~s47N)rAr)r$rrs ``r&r Path.to_wcss  ?C~~  r)c#X# URURS9nURUl[RnUR 5HTnUR U:Xa0Uv URURS9nURUlMCURU5 MV Uv g7f)zYield all sub-paths as :term:`Single-Path` objects. It's safe to call :meth:`sub_paths` on any path-type: :term:`Single-Path`, :term:`Multi-Path` and :term:`Empty-Path`. )r%N) rhr%r rr.rerr|r)r$rrr1s r& sub_pathsPath.sub_pathss~~DJJ~/////==?Cxx7" ~~CGG~4"&//((- # sB(B*c[U5(aDURUR5 UR5HnUR U5 M gg)zExtend the path by another path. The source path is automatically a :term:`Multi-Path` object, even if the previous end point matches the start point of the appended path. Ignores paths without any commands (empty paths). N)r5rr%rerr$rr1s r&extend_multi_pathPath.extend_multi_paths@ t99 LL $}}((-' r)cD[U5S:XagUR(aFURRUR5(dUR UR5 OURUlUR 5HnURU5 M g)zAppend another path to this path. Adds a :code:`self.line_to(path.start)` if the end of this path != the start of appended path. rN)r5rr|rr%rrerrs r& append_pathPath.append_pathsl t9>  >>88##DJJ// TZZ(DJ==?C  $ $S )#r))rrrr rr%)r%rr,)r9 list[Vec3]r:z list[Command]r;rrr )rCrrr )rr)rint)rr)rzIterator[PathElement])rzlist[PathElement])rr )r@rrNone)rr)rsr)rr )ryrrr)rr)r list[int])rbool)r1rrr)ryrrrrr)ryrrrrrrr)rr)rzOptional[Vec3]))rrrr)r)rrrrrr)rrrrrr)rr rrrr)rzIterator[Self])rrrr)2__name__ __module__ __qualname____firstlineno___slots __slots__r r' classmethodr=rDrIrLrZrbrerkrjr@propertyr;setterr%r|rGr:rrrrrrrrrrrrrrrrrrrrrrr__static_attributes__r^r)r&rr)sI%,$RV!2?LO " 4 #4*=%+ E !!  \\// "" $11  ## 9 6. ..<J%  0 #  1(1B!4 & . *r)rOrc\[nSn/nUHnURU5 X!U- nM U$)Nr)CMD_SIZEr)r:cmd_sizer% start_indexcodes r&r6r6s=HEK5! $ r)N)r:zIterable[Command]rr)' __future__rtypingrrrrrtyping_extensionsr ezdxf.mathr r r r rrrrrrerrrrrr__all__ MAX_DISTANCE MIN_SEGMENTSG1_TOLrrr.rTrUrVr r6r^r)r&rs##    (   S@*@*H OOQ OOQ q q  r)