h£~SrSSKrSSKJr SSKJr SSKrSSKr SSK J r J r SSK JrJr SSKJr "S S 5rS rg) a A module for dealing with the polylines used throughout Matplotlib. The primary class for polyline handling in Matplotlib is `Path`. Almost all vector drawing makes use of `Path`\s somewhere in the drawing pipeline. Whilst a `Path` instance itself cannot be drawn, some `.Artist` subclasses, such as `.PathPatch` and `.PathCollection`, can be used for convenient `Path` visualisation. N) lru_cache)WeakValueDictionary)_api_path)_to_unmasked_float_arraysimple_linear_interpolation) BezierSegmentc ^\rSrSrSr\R r\"S5r\"S5r \"S5r \"S5r \"S5r \"S5r \S\ S\ S\ S\ S\ S0rS:S jr\S;S j5r\S 5rSr\S5r\R,S5r\S5r\R,S5r\S5r\R,S5r\S5r\R,S5r\S5rSrS;U4Sjjr\r\S5r\S5rSr Sr!SS%jr'S>S&jr(S;S'jr)S;S(jr*S?S)jr+S?S*jr,S+r-S@S,jr.S r/\S-5r0\1"5r2\S.5r3\1"5r4\SAS/j5r5\S05r6S r7\S15r8\SBS2j5r9S r:\S35r;\SCS4j5r<\S;S5j5r=\>\?"S65SDS7j55r@S?S8jrAS9rBU=rC$)EPathu  A series of possibly disconnected, possibly closed, line and curve segments. The underlying storage is made up of two parallel numpy arrays: - *vertices*: an (N, 2) float array of vertices - *codes*: an N-length `numpy.uint8` array of path codes, or None These two arrays always have the same length in the first dimension. For example, to represent a cubic curve, you must provide three vertices and three `CURVE4` codes. The code types are: - `STOP` : 1 vertex (ignored) A marker for the end of the entire path (currently not required and ignored) - `MOVETO` : 1 vertex Pick up the pen and move to the given vertex. - `LINETO` : 1 vertex Draw a line from the current position to the given vertex. - `CURVE3` : 1 control point, 1 endpoint Draw a quadratic Bézier curve from the current position, with the given control point, to the given end point. - `CURVE4` : 2 control points, 1 endpoint Draw a cubic Bézier curve from the current position, with the given control points, to the given end point. - `CLOSEPOLY` : 1 vertex (ignored) Draw a line segment to the start point of the current polyline. If *codes* is None, it is interpreted as a `MOVETO` followed by a series of `LINETO`. Users of Path objects should not access the vertices and codes arrays directly. Instead, they should use `iter_segments` or `cleaned` to get the vertex/code pairs. This helps, in particular, to consistently handle the case of *codes* being None. Some behavior of Path objects can be controlled by rcParams. See the rcParams whose keys start with 'path.'. .. note:: The vertices and codes arrays should be treated as immutable -- there are a number of optimizations and assumptions made up front in the constructor that will not change when the data changes. rrONFc[U5n[R"SUS9 Ub[U5(a[R "X R 5nURS:wd[U5[U5:wa%[SURSUR35e[U5(a1USUR:wa[SURS US35eOlU(ae[U5(aU[R"[U5UR S 9nURUS'URUSS &URUS 'XlX lX0lUR#5 U(aKS URR$lURbS URR$lS UlgS Ulg)a Create a new path with the given vertices and codes. Parameters ---------- vertices : (N, 2) array-like The path vertices, as an array, masked array or sequence of pairs. Masked values, if any, will be converted to NaNs, which are then handled correctly by the Agg PathIterator and other consumers of path data, such as :meth:`iter_segments`. codes : array-like or None, optional N-length array of integers representing the codes of the path. If not None, codes must be the same length as vertices. If None, *vertices* will be treated as a series of line segments. _interpolation_steps : int, optional Used as a hint to certain projections, such as Polar, that this path should be linearly interpolated immediately before drawing. This attribute is primarily an implementation detail and is not intended for public use. closed : bool, optional If *codes* is None and closed is True, vertices will be treated as line segments of a closed polygon. Note that the last vertex will then be ignored (as the corresponding code will be set to `CLOSEPOLY`). readonly : bool, optional Makes the path behave in an immutable way and sets the vertices and codes as read-only arrays. )Nr)verticesNrz`'codes' must be a 1D list or array with the same length of 'vertices'. Your vertices have shape z but your codes have shape rz7The first element of 'code' must be equal to 'MOVETO' (z). Your first code is dtypeFT)rr check_shapelennpasarray code_typendim ValueErrorshapeMOVETOemptyLINETO CLOSEPOLY _vertices_codes_interpolation_steps_update_valuesflags writeable _readonly)selfrcodesr%closedreadonlys A/var/www/html/env/lib/python3.13/site-packages/matplotlib/path.py__init__ Path.__init__cs<,H5 X6  XJJunn5EzzQ#e*H "= "==E^^>Ckk]"LMM5zzeAh$++5 "115 >77>1e*-d;;r1ch[RSUlURS:=(a [RS=(ae [UR5S:=(aF UR SL=(d1 [ R"UR [R:*5Ul g)Nr3rz path.simplify) r7r8r6rr#r$rallr r!r5r*s r.r&Path._update_valuess#&<<0I#J  $ $q ( H LL ) H  3 & H[[D FBFF4;;$+++E$F r1cUR$)z.The vertices of the `Path` as an (N, 2) array.)r#rGs r.r Path.verticess~~r1chUR(a [S5eXlUR5 g)Nz%Can't set vertices on a readonly Path)r)AttributeErrorr#r&)r*rs r.rrJs& >> !HI I! r1cUR$)a, The list of codes in the `Path` as a 1D array. Each code is one of `STOP`, `MOVETO`, `LINETO`, `CURVE3`, `CURVE4` or `CLOSEPOLY`. For codes that correspond to more than one vertex (`CURVE3` and `CURVE4`), that code will be repeated so that the length of `vertices` and `codes` is always the same. )r$rGs r.r+ Path.codess{{r1chUR(a [S5eXlUR5 g)Nz"Can't set codes on a readonly Path)r)rLr$r&)r*r+s r.r+rNs& >> !EF F  r1cUR$)zQ The fraction of a pixel difference below which vertices will be simplified out. r6rGs r.simplify_thresholdPath.simplify_thresholds '''r1cXlgNrQ)r* thresholds r.rRrSs#, r1cUR$)z4 `True` if the vertices array should be simplified. r5rGs r.should_simplifyPath.should_simplifys $$$r1cXlgrUrX)r*rYs r.rYrZs /r1cUR$)z$ `True` if the `Path` is read-only. )r)rGs r.r- Path.readonly s ~~r1c.[R"U5$)zf Return a shallow copy of the `Path`, which will share the vertices and codes with the source `Path`. )copyrGs r.r_ Path.copys yyr1cT>[R"[5U5nSUlU$)zb Return a deepcopy of the `Path`. The `Path` will not be readonly, even if the source `Path` is. F)r_deepcopysuperr))r*memop __class__s r. __deepcopy__Path.__deepcopy__s# MM%'4 ( r1clURup#nUS:wa [S5eUS-nX%-n[R"US45n[R"X`R UR S9nURUSSU2'URXSU2'[U5Hn USS2U 4XySU2'M U"Xx5$)z Make a compound `Path` object to draw a number of polygons with equal numbers of sides. .. plot:: gallery/misc/histogram_path.py Parameters ---------- XY : (numpolys, numsides, 2) array rz%The third dimension of 'XY' must be 2rrrN) rrrzerosfullr!rrr"range) r9XYnumpolysnumsidestwostridenvertsr:r+is r.make_compound_path_from_polys"Path.make_compound_path_from_polys#s#%((C !8DE EA"&!% #--@::aii"%--xA!!Q$xE)V) !5  r1c0U(d.[[R"SS/[RS95$[R"UVs/sHo"R PM sn5n[R"[ U5URS9nSnUHbn[ UR 5nURc)U(a!URXE'URXES-XV-&OURXEXV-&XV- nMd X@R:gnU"X7XG5$s snf)zM Concatenate a list of `Path`\s into a single `Path`, removing all `STOP`\s. rrrr) r rr float32r@rrrr+rr!STOP)r9argspathrr+rssize not_stop_masks r.make_compound_pathPath.make_compound_path?s !Qrzz:; ;>>T"BTT==T"BCXcmm< Dt}}%Dzz!"zzEH(+ EA#af%"&** IA) 8*E,@AA#Cs Dc@SUR<SUR<S3$)NzPath(z, ))rr+rGs r.__repr__ Path.__repr__Us t}}'r$**q99r1c,[UR5$rU)rrrGs r.__len__ Path.__len__Xs4==!!r1?c ## [U5(dgURUX#XEXgUS9n URn URn [ U R 5n [ U R 5n [X5H\upX:Xa gXS- nU(a=[U5H.n[U 5 [R"U[U 55nM0 X4v M^ g7f)a> Iterate over all curve segments in the path. Each iteration returns a pair ``(vertices, code)``, where ``vertices`` is a sequence of 1-3 coordinate pairs, and ``code`` is a `Path` code. Additionally, this method can provide a number of standard cleanups and conversions to the path. Parameters ---------- transform : None or :class:`~matplotlib.transforms.Transform` If not None, the given affine transformation will be applied to the path. remove_nans : bool, optional Whether to remove all NaNs from the path and skip over them using MOVETO commands. clip : None or (float, float, float, float), optional If not None, must be a four-tuple (x1, y1, x2, y2) defining a rectangle in which to clip the path. snap : None or bool, optional If True, snap all nodes to pixels; if False, don't snap them. If None, snap if the path contains only segments parallel to the x or y axes, and no more than 1024 of them. stroke_width : float, optional The width of the stroke being drawn (used for path snapping). simplify : None or bool, optional Whether to simplify the path by removing vertices that do not affect its appearance. If None, use the :attr:`should_simplify` attribute. See also :rc:`path.simplify` and :rc:`path.simplify_threshold`. curves : bool, optional If True, curve segments will be returned as curve segments. If False, all curves will be converted to line segments. sketch : None or sequence, optional If not None, must be a 3-tuple of the form (scale, length, randomness), representing the sketch parameters. N) transform remove_nansclipsnap stroke_widthsimplifycurvessketchr) rcleanedNUM_VERTICES_FOR_CODErxiterrr+ziprlnextrappend)r*rrrrrrrrrrrxrr+ curr_verticescodeextra_verticesrss r. iter_segmentsPath.iter_segments[sR4yy ,,+6$((0&, .!% : :yy(()W]]##&x#7 M|281>r1c SSKJn UbURU5nURc URnO[ [ R"UR[R[R/55S:XaMUR[ R"UR[R[R/5nOa/nUR"S0UD6H3upVUR5upxUR!U"S/UQSP55 M5 [ R""U5n[ U5(a$U"UR%SS9UR'SS9/5$UR)5$)a= Get Bbox of the path. Parameters ---------- transform : `~matplotlib.transforms.Transform`, optional Transform to apply to path before computing extents, if any. **kwargs Forwarded to `.iter_bezier`. Returns ------- matplotlib.transforms.Bbox The extents of the path Bbox([[xmin, ymin], [xmax, ymax]]) rBboxr)axisr) transformsrrr+rrr intersect1dr rrisinrr!raxis_aligned_extremarr@minmaxnull) r*rrrxyscurver_dzeross r. get_extentsPath.get_extents_s! %  ++D1D :: --C  T[[$++,FG HA M -- )-dkk(B!DECC#//9&9 !668  5!fa12 : ..%C s88a#''q'/:; ;99; r1c0[R"XU5$)z Return whether if this path intersects another given path. If *filled* is True, then this also returns True if one path completely encloses the other (i.e., the paths are treated as filled). )rpath_intersects_path)r*otherfilleds r.intersects_pathPath.intersects_paths))$v>>r1c[R"XRURURUR U5$)z Return whether this path intersects a given `~.transforms.Bbox`. If *filled* is True, then this also returns True if the path completely encloses the `.Bbox` (i.e., the path is treated as filled). The bounding box is always considered filled. )rpath_intersects_rectanglex0y0x1y1)r*bboxrs r.intersects_bboxPath.intersects_bboxs2.. ''477DGGTWWf> >r1cUS:XaU$[URU5nURnUbH[R"[ U5S- U-S-[ RURS9nX4SSU2'OSn[ X$5$)zj Return a new path resampled to length N x *steps*. Codes other than `LINETO` are not handled correctly. rNrr) r rr+rrkrr r!r)r*stepsrr+ new_codess r. interpolatedPath.interpolateds| A:K.t}}eD   Ua5 81 [U5S:a/$[R "USUS:g5(a /UQUSPnUcU/$UR U5/$[R"XX#U5$)u Convert this path to a list of polygons or polylines. Each polygon/polyline is an (N, 2) array of vertices. In other words, each polygon has no `MOVETO` instructions or curves. This is useful for displaying in backends that do not support compound paths or Bézier curves. If *width* and *height* are both non-zero then the lines will be simplified so that vertices outside of (0, 0), (width, height) will be clipped. The resulting polygons will be simplified if the :attr:`Path.should_simplify` attribute of the path is `True`. If *closed_only* is `True` (default), only closed polygons, with the last point being the same as the first point, will be returned. Any unclosed polylines in the path will be explicitly closed. If *closed_only* is `False`, any unclosed polygons in the path will be returned as unclosed polygons, and the closed polygons will be returned explicitly closed by setting the last point to the same as the first point. rrr) rrrr+ranyrrconvert_path_to_polygons)r*rwidthheight closed_onlyrs r. to_polygonsPath.to_polygonss. t}}  "I  !((*I :: 5A:1}}Hx=1$IVVHQK8B<788778A;7H  z!!++H566-- UK9 9r1clURcU"SS/SS/SS/SS/SS//SSS9UlUR$)zG Return a `Path` instance of the unit rectangle from (0, 0) to (1, 1). rrTr,r-)_unit_rectangler9s r.unit_rectanglePath.unit_rectanglesP    &"%1v1v1v1v1v&N-1D#BC """r1cUS::aURRU5nOSnUcS[R-U- [R"US-5-[RS- -n[R "[R "U5[R"U545nU"USSS9nUS::aX RU'U$)z Return a :class:`Path` instance for a unit regular polygon with the given *numVertices* such that the circumscribing circle has radius 1.0, centered at (0, 0). NrrTr)_unit_regular_polygonsgetrpiarange column_stackcossin)r9 numVerticesrzthetar:s r.unit_regular_polygonPath.unit_regular_polygons " --11+>DD <"%%i+-;?1KKuuqy!EOORVVE]BFF5M$BCEuTD9Db :>**;7 r1cUS::aURRX45nOSnUcUS-nS[R-U- [R"US-5-nU[RS- - n[R "US-5nX&SSS2'U[R "[R"U5[R"U545-RnU"USSS9nUS::aX0RX4'U$)zr Return a :class:`Path` for a unit regular star with the given numVertices and radius of 1.0, centered at (0, 0). rNrrg@Tr) _unit_regular_starsrrrronesvstackrrT)r9r innerCirclerzns2rrr:s r.unit_regular_starPath.unit_regular_stars " **.. /IJDD </CruuWS[299S1W#55E RUUS[ Ea A!addGBFF5M266%=#ABBEEEuTD9Db FJ''(BC r1c&URUS5$)zv Return a :class:`Path` for a unit regular asterisk with the given numVertices and radius of 1.0, centered at (0, 0). )r)r9rs r.unit_regular_asteriskPath.unit_regular_asterisks $$[#66r1c`URcURSSSS9UlUR$)zs Return the readonly :class:`Path` of the unit circle. For most cases, :func:`Path.circle` will be what you want. )rrrT)centerrr-) _unit_circlecirclers r. unit_circlePath.unit_circle's9    #"zz37 * 9C r1cSn[R"S5nXT-n[R"SS/US/XV- U*U- /XU*/XV-U*U-/SU*/SS/SU/XV-XV- /XU/XV- XV-/US/SS/U*S/U*U-XV-/U*U/U*U- XV- /SU/SS/SU*/U*U- U*U-/U*U*/U*U-U*U- /U*S/SS/SS//[S9nUR/S-nUR US'UR US '[Xr-U-XS 9$) u6 Return a `Path` representing a circle of a given radius and center. Parameters ---------- center : (float, float), default: (0, 0) The center of the circle. radius : float, default: 1 The radius of the circle. readonly : bool Whether the created path should have the "readonly" argument set when creating the Path instance. Notes ----- The circle is approximated using 8 cubic Bézier curves, as described in Lancaster, Don. `Approximating a Circle or an Ellipse Using Four Bezier Cubic Splines `_. rSl??rrrrrr-)rsqrtrfloatrrr"r ) r9rrr-MAGICSQRTHALFMAGIC45rr+s r.r Path.circle3s,773<"88c4[#T]&. '0AB& 2&. '0AB!E6]!3Z!5\&.0@A&1&.0@A#S\!3Z$fc]'i/1AB'i2'i/1AB"E]"C["UF^'i/(71BC'i(3'i/(71BC$fd^!4[!4[E"*F#(G#)J r!::aMMb H%.IIr1cURcSn[R"S5nX!-n[R"SS/US/X#- U*U- /X"*/X#-U*U-/SU*/SS/SU/X#-X#- /X"/X#- X#-/US/SS/SS//[5n[R "SUR URS9nURUS'URUS 'U"XES S 9UlUR$) zu Return a `Path` of the right half of a unit circle. See `Path.circle` for the reference on the approximation used. rrrr rrrrTr") _unit_circle_righthalfrr#rr$rkrrrr")r9r%r&r'rr+s r.unit_circle_righthalfPath.unit_circle_righthalfys  % % -Ewws|H&Gxxt"XIg$56I&"XIg$56vsu"H$45%"H$45st%(+H.GGB #--@EzzE!H E"I),Xt)LC &)))r1c[RS-nUnUS[R"X!- S- 5-- nX!:wa Xv::aUS- n[R"Xg/5upgUc'[ S[R "Xv- U- 5-5nUS:a [ S5eXv- U- n[R"SU-5n [R"U5[R"SSU -U --5S- -S- n [R"XgUS-S 5n [R"U 5n [R"U 5n U SS nU SS nU*nUnU SSnU SSnU*nUnU(aUS -S -n[R"US4[5n[R"UURUR S 9nUSUS/US'UR"UR$/USS&UR$UR&/USS&SnUS- nOoUS -S-n[R("US4[5n[R"UURUR S 9nUSUS/US'UR"US'SnUnXU--UUUS 2S4'XU--UUUS 2S4'UU U-- UUS-US 2S4'UU U-- UUS-US 2S4'UUUS-US 2S4'UUUS-US 2S4'U"UUS S9$)a Return a `Path` for the unit circle arc from angles *theta1* to *theta2* (in degrees). *theta2* is unwrapped to produce the shortest arc within 360 degrees. That is, if *theta2* > *theta1* + 360, the arc will be from *theta1* to *theta2* - 360 and not a full circle plus some extra overlap. If *n* is provided, it is the number of spline segments to make. If *n* is not provided, the number of spline segments is determined based on the delta between *theta1* and *theta2*. Masionobe, L. 2003. `Drawing an elliptical arc using polylines, quadratic or cubic Bezier curves `_. rihNrrzn must be >= 1 or Noneg@g@Trrrrrrr")rrfloordeg2radintceilrtanrr#linspacerrjr$rkrrrr!r"r )r9theta1theta2nis_wedgehalfpieta1eta2detatalpharcos_etasin_etaxAyAxA_dotyA_dotxByBxB_dotyB_dotlengthrr+ vertex_offsetends r.arcPath.arcs$bhh3'>???   CKDZZ -  9A$+!7889A q556 6 q  FF3: t cAgk(9 :Q >?#E DAt4&&-&&- Sb\ Sb\ QR[ QR[ UQYFxx U3HGGFCJJcmmDEa5"Q%.HQK**cjj1E!AJ**cmm4E"#JM1*CUQYFxx U3HGGFCJJcmmDEa5"Q%.HQKzzE!HMC+-+>s1$a'(+-+>s1$a'(-/%&.-@qQ&)*-/%&.-@qQ&)*-/qQ&)*-/qQ&)*8UT22r1c(URXUS5$)a  Return a `Path` for the unit circle wedge from angles *theta1* to *theta2* (in degrees). *theta2* is unwrapped to produce the shortest wedge within 360 degrees. That is, if *theta2* > *theta1* + 360, the wedge will be from *theta1* to *theta2* - 360 and not a full circle plus some extra overlap. If *n* is provided, it is the number of spline segments to make. If *n* is not provided, the number of spline segments is determined based on the delta between *theta1* and *theta2*. See `Path.arc` for the reference on the approximation used. T)rL)r9r5r6r7s r.wedge Path.wedges wwvq$//r1c(SSKJn UbU"X5$S$)z Given a hatch specifier, *hatchpattern*, generates a `Path` that can be used in a repeated hatching pattern. *density* is the number of lines per unit square. r)get_pathN)matplotlib.hatchrS) hatchpatterndensityrSs r.hatch Path.hatchs$ .+/ 715 7r1c[R"XU5nUVs/sHn[U5PM nnUR"U6$s snf)z Clip the path to the given bounding box. The path must be made up of one or more closed polygons. This algorithm will not behave correctly for unclosed paths. If *inside* is `True`, clip to the inside of the box, otherwise to the outside of the box. )rclip_path_to_rectr r})r*rinsider:polypathss r. clip_to_bboxPath.clip_to_bboxsD''F;(-.d.&&../sA)r$r%r)r5r6r#)NrFFrU)NTNFrNTN)NFN)Nr)T)NrrT)r))rrrF)NF))D__name__ __module__ __qualname____firstlineno____doc__ruint8rrxrr!rrr"rr/ classmethodr=rBr&propertyrsetterr+rRrYr-r_rgrbrtr}rrrrrrrrrrrrrrrrrrrrr rrrrrr+r,rLrO staticmethodrrWr^__static_attributes__ __classcell__)rfs@r.r r s,5nI Q)&-9^O##12*./.77L    AJAJF"'*'*RL3L3\00"q\77 / /r1r cSSKJn [U5S:Xa [S5e[U5S:Xa [S5e[R "X[ R"U5X45upgUR"USU06$)u Get bounding box of a `.PathCollection`\s internal objects. That is, given a sequence of `Path`\s, `.Transform`\s objects, and offsets, as found in a `.PathCollection`, return the bounding box that encapsulates all of them. Parameters ---------- master_transform : `~matplotlib.transforms.Transform` Global transformation applied to all paths. paths : list of `Path` transforms : list of `~matplotlib.transforms.Affine2DBase` If non-empty, this overrides *master_transform*. offsets : (N, 2) array-like offset_transform : `~matplotlib.transforms.Affine2DBase` Transform applied to the offsets before offsetting the path. Notes ----- The way that *paths*, *transforms* and *offsets* are combined follows the same method as for collections: each is iterated over independently, so if you have 3 paths (A, B, C), 2 transforms (α, β) and 1 offset (O), their combinations are as follows: - (A, α, O) - (B, β, O) - (C, α, O) rrrzNo paths providedzNo offsets providedminpos) rrrrrget_path_collection_extentsr atleast_3d from_extents)master_transformr]roffsetsoffset_transformrextentsrns r.rorosq<! 5zQ,-- 7|q.//77z!:#OG   g 5f 55r1)rer_ functoolsrweakrefrnumpyr matplotlibr7rrcbookrr bezierr r rorr1r.r}s6  'H!D/D/N &6r1