Ńň
ńJc
@ sÇ d Z d d k Z d d k l Z d d k Z d d k l Z d d k l Z l Z l
Z
l Z l Z l
Z
l Z l Z d d k l Z l Z d d k l Z d e f d YZ e Z d
Z d S( s2
Contains a class for managing paths (polylines).
i˙˙˙˙N( t WeakValueDictionary( t ma( t
point_in_patht get_path_extentst point_in_path_collectiont get_path_collection_extentst path_in_patht path_intersects_patht convert_path_to_polygonst cleanup_path( t simple_linear_interpolationt maxdict( t rcParamst Pathc B sÜ e Z d Z d Z d Z d Z d Z d Z d Z d d d d d d d d d d d d d d d d g Z e
i Z d d d Z e d Z e d Z d
Z d Z d e d e d e d Z d
Z d d Z d d Z d d Z e d Z e d Z d Z d d d d Z d Z e d Z e! Z" e d Z# e! Z$ e d d Z% e d Z& d Z' e d Z( e d e d Z) e d d Z* e+ d Z, e d d Z- RS(! s~
:class:`Path` represents a series of possibly disconnected,
possibly closed, line and curve segments.
The underlying storage is made up of two parallel numpy arrays:
- *vertices*: an Nx2 float array of vertices
- *codes*: an N-length uint8 array of vertex types
These two arrays always have the same length in the first
dimension. For example, to represent a cubic curve, you must
provide three vertices as well as three codes ``CURVE3``.
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 Bezier curve from the current position,
with the given control point, to the given end point.
- ``CURVE4`` : 2 control points, 1 endpoint
Draw a cubic Bezier 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.
Users of Path objects should not access the vertices and codes
arrays directly. Instead, they should use :meth:`iter_segments`
to get the vertex/code pairs. This is important, since many
:class:`Path` objects, as an optimization, do not store a *codes*
at all, but have a default one provided for them by
:meth:`iter_segments`.
Note also that 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.
i i i i i iO c C sa t i | o" | i t i i t i } n t i | t i } | d j oP t i | | i } | i
d j p t t | t | j p t n | i
d j p t | i
d d j p t t d o6 t | d j o# | d j p t i | t i j | _ t d | _ t i | i | _ | | _ | | _ | | _ d S( sž
Create a new path with the given vertices and codes.
*vertices* is an Nx2 numpy float array, masked array or Python
sequence.
*codes* is an N-length numpy array or Python sequence of type
:attr:`matplotlib.path.Path.code_type`.
These two arrays must have the same length in the first
dimension.
If *codes* is None, *vertices* will be treated as a series of
line segments.
If *vertices* contains masked values, they 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`.
*interpolation_steps* is 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.
i i s
path.simplifyi s path.simplify_thresholdN( R t
isMaskedArrayt astypet npt float_t filledt nant asarrayt Nonet code_typet ndimt AssertionErrort lent shapeR t allR
t LINETOt should_simplifyt simplify_thresholdt isfinitet
has_nonfinitet codest verticest _interpolation_steps( t selfR" R! R# ( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyt __init__S s" "
$ (
c
C sŰ | i \ } } } | d j p t | d } | | } t i | d f } t i | t | i } | i | d d |
<| i | | d |
`_.
grSlůĐ?g ŕ?g @g g đżg đ?i i i˙˙˙˙N(
t _unit_circleR R t sqrtt arrayR t CURVE4R' R) R* ( R, t MAGICt SQRTHALFt MAGIC45R" R! ( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyt unit_circle¸ sJ
c C së | t i d 9} | t i d 9} t i d } t i d } t i t i | t i | } t i t i | t i | } | | t i | | | 8} | | t i j o" | | t i j o | | 7} n | d j o% t d t i | | | } n | d j o t d n | | | } t i
d | }
t i | t i d d |
|
d d } t i | | | d t
} t i | }
t i | } |
d } | d } | } | } |
d } | d } | } | } | oŁ | d
d } t i | d f t i } | i t i | f | i } | d | d g | d <| i | i g | d d +| i | i g | d
)d } | d } nz | d
d } t i | d f t i } | i t i | f | i } | d | d g | d <| i | d `_.
g f@g @g ŕ?i i s n must be >= 1 or Noneg @g @i˙˙˙˙i i i iţ˙˙˙N( R Rl t arctan2Rp Ro t floorR R( t ceilt
ValueErrort tanR| t linspacet Truet emptyR R~ R' R R) R R* ( R, t theta1t theta2t nt is_wedget twopit halfpit eta1t eta2t detat tt alphaRc t cos_etat sin_etat xAt yAt xA_dott yA_dott xBt yBt xB_dott yB_dotR@ R" R! t
vertex_offsett end( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyt arcő sd
$$ (
%
0
!!%% c C s | i | | | t S( sO
(staticmethod) Returns a wedge of the unit circle from angle
*theta1* to angle *theta2* (in degrees).
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*.
( R˘ R ( R, R R R ( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyt wedgeC s
i i c C sr d d k l } | d j o d S| i i | | f } | d j o | S| | | } | | i | | f <| S( sż
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.
i˙˙˙˙( t get_pathN( t matplotlib.hatchR¤ R t _hatch_dictRk ( R, t hatchpatternt densityR¤ t
hatch_path( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyt hatchQ s
N(. t __name__t
__module__t __doc__RE R) R t CURVE3R~ R* RD R t uint8R R R% t classmethodR5 RA RB RC R t FalseRQ RR RU RW RZ R\ Rb Re Rh Ri R^ R Rj Rs Rt Ry Rz R{ R R˘ RŁ R RŚ RŞ ( ( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyR
sX 0 0 :
=M c G sJ d d k l } t | d d j o t d n | i t | S( sp
Given a sequence of :class:`Path` objects, returns the bounding
box that encapsulates all of them.
i˙˙˙˙( RX i i s No paths provided( RY RX R R t from_extentst _get_path_collection_extents( R9 RX ( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyR f s ( R t matht weakrefR t numpyR R t matplotlib._pathR R R R R R R R t matplotlib.cbookR
R t
matplotlibR t objectR
Rł ( ( ( s5 /usr/lib64/python2.6/site-packages/matplotlib/path.pyt s :˙ ˙ U