+ ]iiJcsRt^RIHt^RIt^RIt^RIt^RIHt]P]!^R7R44t !RR] 4t Rt R tR tR tRR lt!R R4tRRltRRltRtRtRRltRtRtRRltR#)uP A module providing some utility functions regarding Bézier path manipulation. ) lru_cacheN)_api)ZmaxsizecsW8d^#\WV, 4p\P!^V^,4p\P!V^,V, V, 4P \ 4#)i)ZminnparangeZprodZastypeZint)nki&& 8/usr/lib64/python3.14/site-packages/matplotlib/bezier.py_combr sS u A1u A !QUA 77AEAIq= ! ( ( --cs]tRt^tRtR#)NonIntersectingPathExceptionN)__name__ __module__ __qualname____firstlineno____static_attributes__r r rr r sr r csZaW0,W!,, pWt,We,, p Y2)rYv)rW,W,, o\S4R8d \R4hY)rV )T ppV3RlWVV34wrppW,W,,pVV,VV ,,pVV3#)z Return the intersection between the line through (*cx1*, *cy1*) at angle *t1* and the line through (*cx2*, *cy2*) at angle *t2*. g-q=zcGiven lines do not intersect. Please verify that the angles are not equal or differ by 180 degrees.c3s4<"TF qS, xK R#5i)Nr )Z.0rad_bcs& rZ Z#get_intersection..9s:)9A%ii)9s)abs ValueError)Zcx1Zcy1cos_t1sin_t1Zcx2Zcy2cos_t2sin_t2Z line1_rhsZ line2_rhsZaZbZcdZa_Zb_Zc_Zd_xyrs&&&&&&&& @rget_intersectionr s v|+I v|+I 7q 7q EAEME 5zENO ORB:""b)9:NBB 'A Yi'A a4Kr csVR8XdWW3#Y2)reV)TrWE,V,WF,V,rWG,V,WH,V,rWW3#)z For a line passing through (*cx*, *cy*) and having an angle *t*, return locations of the two points located along its perpendicular line at the distance of *length*. r ) cxcyZcos_tZsin_tZlengthrrrrx1y1Zx2Zy2s &&&&& rget_normal_pointsr"AsY|r~FFVUF _r !6?R#7 _r !6?R#7 2>r csVVRR^V, ,VR,V,,pV#)NNNr )betatZ next_betarr_de_casteljau1r(Zs)Sb QU#d2hl2I r cs\P!V4pV.p\W4pVPV4\ V4^8XgK/TUu.uF q^,NK pp\ T4Uu.uF qR,NK ppY43#uupiuupi)u Split a Bézier segment defined by its control points *beta* into two separate segments divided at *t* and return their control points. r%)rasarrayr(appendlenZreversed)r&r'Z beta_listZ left_betaZ right_betas&& rsplit_de_casteljaur,_s ::d DI d& t9> %./YTaYI/'/ ':;':tr((':J;   0;s B.B csV!V4pV!V4pV!V4pV!V4pWx8XdWV8wd \R4h\P!V^,V^,, V^,V^,, 4V8dW#3#RW#,,p V!V 4p V!V 4p W{, 'dT pWj8XdW#3#T pKT pWZ8XdW#3#T pT pK)u$ Find the intersection of the Bézier curve with a closed path. The intersection point *t* is approximated by two parameters *t0*, *t1* such that *t0* <= *t* <= *t1*. Search starts from *t0* and *t1* and uses a simple bisecting algorithm therefore one of the end points must be inside the path while the other doesn't. The search stops when the distance of the points parametrized by *t0* and *t1* gets smaller than the given *tolerance*. Parameters ---------- bezier_point_at_t : callable A function returning x, y coordinates of the Bézier at parameter *t*. It must have the signature:: bezier_point_at_t(t: float) -> tuple[float, float] inside_closedpath : callable A function returning True if a given point (x, y) is inside the closed path. It must have the signature:: inside_closedpath(point: tuple[float, float]) -> bool t0, t1 : float Start parameters for the search. tolerance : float Maximal allowed distance between the final points. Returns ------- t0, t1 : float The Bézier path parameters. z3Both points are on the same side of the closed path?)r rZhypot) bezier_point_at_tinside_closedpatht0t1 toleranceZstartZendZ start_insideZ end_insideZmiddle_tZmiddleZ middle_insides &&&&& r*find_bezier_t_intersecting_with_closedpathr3qsL b !E B C$U+L"3'J!el* AC C  88E!Hs1v%uQx#a&'8 9I E6M"'?"8,)&1  ' 'B}v CBv E(Lr cs|a]tRt^toRtRtRtRt]R4t ]R4t ]R4t ]R4t R t R tVtR #) BezierSegmentu A d-dimensional Bézier segment. Parameters ---------- control_points : (N, d) array Location of the *N* control points. c s\\P!V4VnVPPwVnVn\P !VP4Vn\VP4Uu.uFxp\P!VP^, 4\P!V4\P!VP^, V, 4,,NKz ppVPPV,PVn R#uupi)r$N) rr)_cpointsZshape_N_dr_ordersZrangemathZ factorialT_px)selfcontrol_pointsrZcoeffs&& r__init__ZBezierSegment.__init__s >2 ==..yy)  .*(Q! ,^^A&! a)HHJJ( *MMOOe+..*s;A>D)c s"\P!V4p\PP^V, VPRRR1,4\PPWP4,VP ,#)u Evaluate the Bézier curve at point(s) *t* in [0, 1]. Parameters ---------- t : (k,) array-like Points at which to evaluate the curve. Returns ------- (k, d) array Value of the curve for each point in *t*. Nr%)rr)ZpowerZouterr8r;r<r'&&r__call__ZBezierSegment.__call__s^ JJqMq1udll4R4&89((..LL1259XX> >r c s$\V!V44#)zH Evaluate the curve at a single point, returning a tuple of *d* floats. )Ztupler?r@r point_at_tZBezierSegment.point_at_tsT!W~r c VP#)z The control points of the curve.)r5r<&rr=ZBezierSegment.control_pointss}}r c rC)zThe dimension of the curve.)r7rDrEr dimensionZBezierSegment.dimensions wwr c s(VP^, #)z@Degree of the polynomial. One less the number of control points.)r6rDrErdegreeZBezierSegment.degreesww{r c svVPpV^ 8d\P!R\4VPp\ P !V^,4R,p\ P !V^,4R,pRWC,,\W44,p\W4V,V,#)u: The polynomial coefficients of the Bézier curve. .. warning:: Follows opposite convention from `numpy.polyval`. Returns ------- (n+1, d) array Coefficients after expanding in polynomial basis, where :math:`n` is the degree of the Bézier curve and :math:`d` its dimension. These are the numbers (:math:`C_j`) such that the curve can be written :math:`\sum_{j=0}^n C_j t^j`. Notes ----- The coefficients are calculated as .. math:: {n \choose j} \sum_{i=0}^j (-1)^{i+j} {j \choose i} P_i where :math:`P_i` are the control points of the curve. zFPolynomial coefficients formula unstable for high order Bezier curves!NNNN)NrIr%)rGwarningsZwarnZRuntimeWarningr=rrr )r<rZPZjrZ prefactors& rpolynomial_coefficientsZ%BezierSegment.polynomial_coefficientss2 KK r6 MM12@ B    IIacN7 # IIacN7 #15ME!K/ Q{Y&**r c sVPpV^8:d-\P!.4\P!.43#VPp\P!^V^,4R,VR,,p.p.p\ VP 4F[wrg\P!VRRR1,4pVPV4VP\P!W44K] \P!V4p\P!V4p\P!V4V^8,V^8*,p WI,\P!V4V ,3#)a Return the dimension and location of the curve's interior extrema. The extrema are the points along the curve where one of its partial derivatives is zero. Returns ------- dims : array of int Index :math:`i` of the partial derivative which is zero at each interior extrema. dzeros : array of float Of same size as dims. The :math:`t` such that :math:`d/dx_i B(t) = 0` Nr#rHr%) rGrZarrayrKrZ enumerater:rootsr*Z full_like concatenateZisrealZreal) r<rZCjZdCjZdimsrLrpirZin_ranges & raxis_aligned_extremaZ"BezierSegment.axis_aligned_extremas  KK 688B<"- -  ) )ii1Q3(2b61suu%EADbD"A LLO KK Q* +&u%~~d#99U#uz2eqjA~rwwu~h777r )r6r5r7r8r;N)r rrr__doc__r>rArBZpropertyr=rFrGrKrPrZ__classdictcell__)Z __classdict__s@rr4r4st/>$ !+!+F88r r4cs\V4pVPp\WAVR7wrV\WV,R, 4wrxWx3#)u2 Split a Bézier curve into two at the intersection with a closed path. Parameters ---------- bezier : (N, 2) array-like Control points of the Bézier segment. See `.BezierSegment`. inside_closedpath : callable A function returning True if a given point (x, y) is inside the closed path. See also `.find_bezier_t_intersecting_with_closedpath`. tolerance : float The tolerance for the intersection. See also `.find_bezier_t_intersecting_with_closedpath`. Returns ------- left, right Lists of control points for the two Bézier segments. )r2g@)r4rBr3r,) Zbezierr/r2Zbzr.r0r1Z_leftZ_rights &&& r)split_bezier_intersecting_with_closedpathrR<sH, v B  7 CFB'vR2~>ME =r c s^RIHpVP4p\V4wrgV!VRR4pTp ^p ^p VFOwrgT p V \ V4^,, p V!VRR4V8wd\ P !V RRV.4p MTp KQ \R4hV PR4p \WV4wr\ V4^8Xd'VP.pVPVP.pM\ V4^8Xd=VPVP.pVPVPVP.pMm\ V4^8XdSVPVPVP.pVPVPVPVP.pM \R4hVR,pVR,pVPfXV!\ P !VP RV V.44pV!\ P !VVP V R.44pMV!\ P !VP RV V.4\ P !VPRV V.44pV!\ P !VVP V R.4\ P !VVPV R.44pV'd V'gTTppVV3#) zT Divide a path into two segments at the point where ``inside(x, y)`` becomes False. )PathNz*The path does not intersect with the patchzThis should never be reachedr#rIi)r%)pathrSZ iter_segmentsZnextr+rrMrZreshaperRZLINETOZMOVETOZCURVE3ZCURVE4ZAssertionErrorZcodesZvertices)rUZinsider2Z reorder_inoutrSZ path_iterZ ctl_pointsZcommandZ begin_insideZctl_points_oldZioldrZ bezier_pathZbpZleftZrightZ codes_leftZ codes_rightZ verts_leftZ verts_rightZpath_inZpath_outs&&&& rsplit_path_inoutrV_sw ""$Iy/J*RS/*LN D A(  S_ !! *RS/ "l 2...*=z)JKK # )EFF   W %B; IKD 4yA~kk] {{DKK0 Takk4;;/ {{DKK= Takk4;; < {{DKKdkkJ ;<<bJ(K zzr~~t}}Ra'8*&EFG T]]125F'GHIr~~t}}Ud';Z&HI~~tzz%4'8*&EFH T]]125F'GH TZZ^'DEG\$g H r cs.aaaV^,oVVV3RlpV#)z Return a function that checks whether a point is in a circle with center (*cx*, *cy*) and radius *r*. The returned function has the signature:: f(xy: tuple[float, float]) -> bool cs\<VwrVS, ^,VS, ^,,S8#)rTr )Zxyrrrrr2s& r_fZinside_circle.._fs*B1}B1},r11r r )rrrOrXrWsff& @r inside_circlerYs aB2 Ir csW , W1, rTWD,WU,,R,pV^8XdR#WF, WV, 3#)r-)rrr )Zx0Zy0r r!ZdxZdyrs&&&& r get_cos_sinrZs: Wbg 27 r!AAv 626>r cs\P!W4p\P!W#4p\WV, 4pWt8d^#\V\P, 4V8dR#R#)a Check if two lines are parallel. Parameters ---------- dx1, dy1, dx2, dy2 : float The gradients *dy*/*dx* of the two lines. tolerance : float The angular tolerance in radians up to which the lines are considered parallel. Returns ------- is_parallel - 1 if two lines are parallel in same direction. - -1 if two lines are parallel in opposite direction. - False otherwise. Fr%)rZarctan2rrN)Zdx1Zdy1Zdx2Zdy2r2Ztheta1Ztheta2Zdthetas&&&&& rcheck_if_parallelr[sR&ZZ !F ZZ !F  !F  Vbee^ y ( r c sV^,wr#V^,wrEV^,wrg\W$, W5, WF, WW, 4pVR8Xd(\P!R4\W#Wg4wrYrM\W#WE4wr\WEWg4wr\ W#WV4wrpp\ WgWV4wpppp\ WV V VVW4wpp\ VVV V VVW4wppW3VV3VV3.pVV3VV3VV3.pVV3# \ dDRT T,,RTT,,ppRTT,,RTT,,ppLfi;i)u Given the quadratic Bézier control points *bezier2*, returns control points of quadratic Bézier lines roughly parallel to given one separated by *width*. z8Lines do not intersect. A straight line is used instead.r-r%)r[rZ warn_externalrZr"rr)bezier2widthc1xc1ycmxcmyc2xc2yZ parallel_testrrrrc1x_leftc1y_left c1x_right c1y_rightZc2x_leftZc2y_leftZ c2x_rightZ c2y_rightZcmx_leftZcmy_leftZ cmx_rightZ cmy_right path_left path_rights&& r get_parallelsrjsqzHCqzHCqzHC%ci&)i( 0 9f06 906 @ 9 %H%H%'Ii(i(i(*J j  )   8h& '80C)D 9y( )3)i2G+H 9  s6'C66A EEcsR^V,W,, ,pR^V,W,, ,pW3Wg3WE3.#)u Find control points of the Bézier curve passing through (*c1x*, *c1y*), (*mmx*, *mmy*), and (*c2x*, *c2y*), at parametric values 0, 0.5, and 1. r-r )r^r_ZmmxZmmyrbrcr`ras&&&&&& rfind_control_pointsrk sA C39% &C C39% &C J SJ //r cs2V^,wrVV^,wrxV^,wr\WVWx4wr\WxW4wr\WVWW,4wpppp\WWW,4wppppWW,R,Wh,R,ppWy,R,W,R,ppVV,R,VV,R,pp\VVVV4wpp\VVVVW,4wpp p!p"\VVVV VV4p#\VVV!V"VV4p$V#V$3#)u Being similar to `get_parallels`, returns control points of two quadratic Bézier lines having a width roughly parallel to given one separated by *width*. r-)rZr"rk)%r\r]Zw1ZwmZw2r^r_r`raZc3xZc3yrrrrrdrerfrgZc3x_leftZc3y_leftZ c3x_rightZ c3y_rightZc12xZc12yZc23xZc23yZc123xZc123yZcos_t123Zsin_t123Z c123x_leftZ c123y_leftZ c123x_rightZ c123y_rightrhris%&&&&& rmake_wedged_bezier2rl*sAqzHCqzHCqzHC!34NF 34NF #FEJ?-Hh 9 #FEJ?-Hh 9 )r!CI#3$D)r!CI#3$D4K2%t r'95E%T4t<Hh %(EJG5J K$Hh$. $,h8I%Y %0+%. ;J j  r )r?{Gz?)rn)rnF)gh㈵>)rmr-r)rQZ functoolsrr9rJZnumpyrZ matplotlibrZ vectorizer rr rr"r(r,r3r4rRrVrYrZr[rjrkrlr r rros  3.. : B2 !$I)X|8|8~F:z&