Inheritance diagram for pcbnew.SHAPE_LINE_CHAIN:
Public Member Functions | |
| def | __init__ (self, *args) |
| def | Collide (self, *args) |
| def | ClosestSegmentsFast (self, aOther, aPt0, aPt1) |
| def | Clear (self) |
| def | SetClosed (self, aClosed) |
| def | SetWidth (self, aWidth) |
| def | Width (self) |
| def | SegmentCount (self) |
| def | ShapeCount (self) |
| def | RemoveDuplicatePoints (self) |
| def | Simplify (self, aMaxError=0) |
| def | Simplify2 (self, aRemoveColinear=True) |
| def | PointCount (self) |
| def | Segment (self, aIndex) |
| def | CSegment (self, aIndex) |
| def | NextShape (self, aPointIndex) |
| def | SetPoint (self, aIndex, aPos) |
| def | CPoint (self, aIndex) |
| def | CPoints (self) |
| def | CLastPoint (self) |
| def | CArcs (self) |
| def | CShapes (self) |
| def | BBox (self, aClearance=0) |
| def | GenerateBBoxCache (self) |
| def | Reverse (self) |
| def | ClearArcs (self) |
| def | Length (self) |
| def | ReservePoints (self, aSize) |
| def | Append (self, *args) |
| def | Insert (self, *args) |
| def | Replace (self, *args) |
| def | Remove (self, *args) |
| def | RemoveShape (self, aPointIndex) |
| def | Find (self, aP, aThreshold=0) |
| def | FindSegment (self, aP, aThreshold=1) |
| def | Slice (self, aStartIndex, aEndIndex=-1) |
| def | Intersects (self, aChain) |
| def | Intersect (self, *args) |
| def | PathLength (self, aP, aIndex=-1) |
| def | CheckClearance (self, aP, aDist) |
| def | SelfIntersecting (self) |
| def | SelfIntersectingWithArcs (self) |
| def | NearestSegment (self, aP) |
| def | NearestPoint (self, *args) |
| def | Format (self, aCplusPlus=True) |
| def | __ne__ (self, aRhs) |
| def | CompareGeometry (self, aOther) |
| def | Mirror (self, *args) |
| def | Rotate (self, *args) |
| def | PointAlong (self, aPathLength) |
| def | Area (self, aAbsolute=True) |
| def | Split (self, *args) |
| def | OffsetLine (self, aAmount, aCornerStrategy, aMaxError, aLeft, aRight, aSimplify=False) |
| def | ArcCount (self) |
| def | ArcIndex (self, aSegment) |
| def | Arc (self, aArc) |
| def | IsSharedPt (self, aIndex) |
| def | IsPtOnArc (self, aPtIndex) |
| def | IsArcSegment (self, aSegment) |
| def | IsArcStart (self, aIndex) |
| def | IsArcEnd (self, aIndex) |
| def | Distance (self, *args) |
 Public Member Functions inherited from pcbnew.SHAPE_LINE_CHAIN_BASE | |
| def | __init__ (self, *args, **kwargs) |
| def | Collide (self, *args) |
| def | SquaredDistance (self, aP, aOutlineOnly=False) |
| def | PointInside (self, aPt, aAccuracy=0, aUseBBoxCache=False) |
| def | PointOnEdge (self, aP, aAccuracy=0) |
| def | EdgeContainingPoint (self, aP, aAccuracy=0) |
| def | GetPoint (self, aIndex) |
| def | GetSegment (self, aIndex) |
| def | GetPointCount (self) |
| def | GetSegmentCount (self) |
| def | IsClosed (self) |
| def | GetCachedBBox (self) |
| Public Member Functions inherited from pcbnew.SHAPE | |
| def | __init__ (self, *args, **kwargs) |
| def | Clone (self) |
| def | GetClearance (self, aOther) |
| def | IsNull (self) |
| def | Collide (self, *args) |
| def | BBox (self, aClearance=0) |
| def | Centre (self) |
| def | Distance (self, aP) |
| def | SquaredDistance (self, aP, aOutlineOnly=False) |
| def | PointInside (self, aPt, aAccuracy=0, aUseBBoxCache=False) |
| def | TransformToPolygon (self, aBuffer, aError, aErrorLoc) |
| def | Rotate (self, *args) |
| def | Move (self, aVector) |
| def | IsSolid (self) |
| def | Parse (self, aStream) |
| def | Format (self, aCplusPlus=True) |
| def | Cast (self) |
| Public Member Functions inherited from pcbnew.SHAPE_BASE | |
| def | __init__ (self, aType) |
| def | Type (self) |
| def | TypeName (self) |
| def | HasIndexableSubshapes (self) |
| def | GetIndexableSubshapeCount (self) |
| def | GetIndexableSubshapes (self, aSubshapes) |
Static Public Member Functions | |
| def | ClosestPoints (*args) |
| def | ClosestSegments (aMyPrevPt, aMyStart, aMyEnd, aOtherPrevPt, aOtherStart, aOtherEnd, aPt0, aPt1, aDistSq) |
Properties | |
| property | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
| Properties inherited from pcbnew.SHAPE_LINE_CHAIN_BASE | |
| property | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
| Properties inherited from pcbnew.SHAPE | |
| property | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
| Properties inherited from pcbnew.SHAPE_BASE | |
| property | thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") |
Additional Inherited Members | |
| Static Public Attributes inherited from pcbnew.SHAPE | |
| _pcbnew | MIN_PRECISION_IU = _pcbnew.SHAPE_MIN_PRECISION_IU |
Detailed Description
Constructor & Destructor Documentation
◆ __init__()
| def pcbnew.SHAPE_LINE_CHAIN.__init__ | ( | self, | |
| * | args | ||
| ) |
__init__(SHAPE_LINE_CHAIN self) -> SHAPE_LINE_CHAIN
__init__(SHAPE_LINE_CHAIN self, SHAPE_LINE_CHAIN aShape) -> SHAPE_LINE_CHAIN
__init__(SHAPE_LINE_CHAIN self, intVector aV) -> SHAPE_LINE_CHAIN
__init__(SHAPE_LINE_CHAIN self, VECTOR_VECTOR2I aV, bool aClosed=False) -> SHAPE_LINE_CHAIN
__init__(SHAPE_LINE_CHAIN self, SHAPE_ARC aArc, bool aClosed=False) -> SHAPE_LINE_CHAIN
__init__(SHAPE_LINE_CHAIN self, ClipperLib::Path const & aPath, std::vector< CLIPPER_Z_VALUE,std::allocator< CLIPPER_Z_VALUE > > const & aZValueBuffer, std::vector< SHAPE_ARC,std::allocator< SHAPE_ARC > > const & aArcBuffer) -> SHAPE_LINE_CHAIN
__init__(SHAPE_LINE_CHAIN self, Clipper2Lib::Path64 const & aPath, std::vector< CLIPPER_Z_VALUE,std::allocator< CLIPPER_Z_VALUE > > const & aZValueBuffer, std::vector< SHAPE_ARC,std::allocator< SHAPE_ARC > > const & aArcBuffer) -> SHAPE_LINE_CHAIN
Reimplemented from pcbnew.SHAPE_LINE_CHAIN_BASE.
Definition at line 6131 of file pcbnew.py.
Here is the caller graph for this function:
Member Function Documentation
◆ __ne__()
| def pcbnew.SHAPE_LINE_CHAIN.__ne__ | ( | self, | |
| aRhs | |||
| ) |
◆ Append()
| def pcbnew.SHAPE_LINE_CHAIN.Append | ( | self, | |
| * | args | ||
| ) |
Append(SHAPE_LINE_CHAIN self, int aX, int aY, bool aAllowDuplication=False)
Append(SHAPE_LINE_CHAIN self, VECTOR2I aP, bool aAllowDuplication=False)
Append(SHAPE_LINE_CHAIN self, SHAPE_LINE_CHAIN aOtherLine)
Append(SHAPE_LINE_CHAIN self, SHAPE_ARC aArc)
Append(SHAPE_LINE_CHAIN self, SHAPE_ARC aArc, double aAccuracy)
Definition at line 6268 of file pcbnew.py.
Here is the caller graph for this function:
◆ Arc()
| def pcbnew.SHAPE_LINE_CHAIN.Arc | ( | self, | |
| aArc | |||
| ) |
◆ ArcCount()
| def pcbnew.SHAPE_LINE_CHAIN.ArcCount | ( | self | ) |
◆ ArcIndex()
| def pcbnew.SHAPE_LINE_CHAIN.ArcIndex | ( | self, | |
| aSegment | |||
| ) |
◆ Area()
| def pcbnew.SHAPE_LINE_CHAIN.Area | ( | self, | |
aAbsolute = True |
|||
| ) |
◆ BBox()
| def pcbnew.SHAPE_LINE_CHAIN.BBox | ( | self, | |
aClearance = 0 |
|||
| ) |
BBox(SHAPE_LINE_CHAIN self, int aClearance=0) -> BOX2I
Reimplemented from pcbnew.SHAPE.
◆ CArcs()
| def pcbnew.SHAPE_LINE_CHAIN.CArcs | ( | self | ) |
◆ CheckClearance()
| def pcbnew.SHAPE_LINE_CHAIN.CheckClearance | ( | self, | |
| aP, | |||
| aDist | |||
| ) |
◆ CLastPoint()
| def pcbnew.SHAPE_LINE_CHAIN.CLastPoint | ( | self | ) |
◆ Clear()
| def pcbnew.SHAPE_LINE_CHAIN.Clear | ( | self | ) |
◆ ClearArcs()
| def pcbnew.SHAPE_LINE_CHAIN.ClearArcs | ( | self | ) |
◆ ClosestPoints()
|
static |
ClosestPoints(SHAPE_LINE_CHAIN aOther, VECTOR2I aPt0, VECTOR2I aPt1) -> bool
ClosestPoints(SHAPE_LINE_CHAIN::point_citer const & aMyStart, SHAPE_LINE_CHAIN::point_citer const & aMyEnd, SHAPE_LINE_CHAIN::point_citer const & aOtherStart, SHAPE_LINE_CHAIN::point_citer const & aOtherEnd, VECTOR2I aPt0, VECTOR2I aPt1, int64_t & aDistSq) -> bool
Definition at line 6152 of file pcbnew.py.
Here is the caller graph for this function:
◆ ClosestSegments()
|
static |
ClosestSegments(VECTOR2I aMyPrevPt, SHAPE_LINE_CHAIN::point_citer const & aMyStart, SHAPE_LINE_CHAIN::point_citer const & aMyEnd, VECTOR2I aOtherPrevPt, SHAPE_LINE_CHAIN::point_citer const & aOtherStart, SHAPE_LINE_CHAIN::point_citer const & aOtherEnd, VECTOR2I aPt0, VECTOR2I aPt1, int64_t & aDistSq) -> bool
◆ ClosestSegmentsFast()
| def pcbnew.SHAPE_LINE_CHAIN.ClosestSegmentsFast | ( | self, | |
| aOther, | |||
| aPt0, | |||
| aPt1 | |||
| ) |
◆ Collide()
| def pcbnew.SHAPE_LINE_CHAIN.Collide | ( | self, | |
| * | args | ||
| ) |
Collide(SHAPE_LINE_CHAIN self, VECTOR2I aP, int aClearance=0, int * aActual=None, VECTOR2I aLocation=None) -> bool
Collide(SHAPE_LINE_CHAIN self, SEG aSeg, int aClearance=0, int * aActual=None, VECTOR2I aLocation=None) -> bool
Reimplemented from pcbnew.SHAPE_LINE_CHAIN_BASE.
Definition at line 6144 of file pcbnew.py.
Here is the caller graph for this function:
◆ CompareGeometry()
| def pcbnew.SHAPE_LINE_CHAIN.CompareGeometry | ( | self, | |
| aOther | |||
| ) |
◆ CPoint()
| def pcbnew.SHAPE_LINE_CHAIN.CPoint | ( | self, | |
| aIndex | |||
| ) |
◆ CPoints()
| def pcbnew.SHAPE_LINE_CHAIN.CPoints | ( | self | ) |
◆ CSegment()
| def pcbnew.SHAPE_LINE_CHAIN.CSegment | ( | self, | |
| aIndex | |||
| ) |
◆ CShapes()
| def pcbnew.SHAPE_LINE_CHAIN.CShapes | ( | self | ) |
◆ Distance()
| def pcbnew.SHAPE_LINE_CHAIN.Distance | ( | self, | |
| * | args | ||
| ) |
Distance(SHAPE_LINE_CHAIN self, VECTOR2I aP) -> int
Distance(SHAPE_LINE_CHAIN self, VECTOR2I aP, bool aOutlineOnly) -> int
Reimplemented from pcbnew.SHAPE.
Definition at line 6427 of file pcbnew.py.
Here is the caller graph for this function:
◆ Find()
| def pcbnew.SHAPE_LINE_CHAIN.Find | ( | self, | |
| aP, | |||
aThreshold = 0 |
|||
| ) |
◆ FindSegment()
| def pcbnew.SHAPE_LINE_CHAIN.FindSegment | ( | self, | |
| aP, | |||
aThreshold = 1 |
|||
| ) |
◆ Format()
| def pcbnew.SHAPE_LINE_CHAIN.Format | ( | self, | |
aCplusPlus = True |
|||
| ) |
Format(SHAPE_LINE_CHAIN self, bool aCplusPlus=True) -> string
Reimplemented from pcbnew.SHAPE.
◆ GenerateBBoxCache()
| def pcbnew.SHAPE_LINE_CHAIN.GenerateBBoxCache | ( | self | ) |
◆ Insert()
| def pcbnew.SHAPE_LINE_CHAIN.Insert | ( | self, | |
| * | args | ||
| ) |
◆ Intersect()
| def pcbnew.SHAPE_LINE_CHAIN.Intersect | ( | self, | |
| * | args | ||
| ) |
Intersect(SHAPE_LINE_CHAIN self, SEG aSeg, SHAPE_LINE_CHAIN::INTERSECTIONS & aIp) -> int
Intersect(SHAPE_LINE_CHAIN self, SHAPE_LINE_CHAIN aChain, SHAPE_LINE_CHAIN::INTERSECTIONS & aIp, bool aExcludeColinearAndTouching=False, BOX2I aChainBBox=None) -> int
Definition at line 6319 of file pcbnew.py.
Here is the caller graph for this function:
◆ Intersects()
| def pcbnew.SHAPE_LINE_CHAIN.Intersects | ( | self, | |
| aChain | |||
| ) |
◆ IsArcEnd()
| def pcbnew.SHAPE_LINE_CHAIN.IsArcEnd | ( | self, | |
| aIndex | |||
| ) |
◆ IsArcSegment()
| def pcbnew.SHAPE_LINE_CHAIN.IsArcSegment | ( | self, | |
| aSegment | |||
| ) |
◆ IsArcStart()
| def pcbnew.SHAPE_LINE_CHAIN.IsArcStart | ( | self, | |
| aIndex | |||
| ) |
◆ IsPtOnArc()
| def pcbnew.SHAPE_LINE_CHAIN.IsPtOnArc | ( | self, | |
| aPtIndex | |||
| ) |
◆ IsSharedPt()
| def pcbnew.SHAPE_LINE_CHAIN.IsSharedPt | ( | self, | |
| aIndex | |||
| ) |
◆ Length()
| def pcbnew.SHAPE_LINE_CHAIN.Length | ( | self | ) |
◆ Mirror()
| def pcbnew.SHAPE_LINE_CHAIN.Mirror | ( | self, | |
| * | args | ||
| ) |
◆ NearestPoint()
| def pcbnew.SHAPE_LINE_CHAIN.NearestPoint | ( | self, | |
| * | args | ||
| ) |
◆ NearestSegment()
| def pcbnew.SHAPE_LINE_CHAIN.NearestSegment | ( | self, | |
| aP | |||
| ) |
◆ NextShape()
| def pcbnew.SHAPE_LINE_CHAIN.NextShape | ( | self, | |
| aPointIndex | |||
| ) |
◆ OffsetLine()
| def pcbnew.SHAPE_LINE_CHAIN.OffsetLine | ( | self, | |
| aAmount, | |||
| aCornerStrategy, | |||
| aMaxError, | |||
| aLeft, | |||
| aRight, | |||
aSimplify = False |
|||
| ) |
◆ PathLength()
| def pcbnew.SHAPE_LINE_CHAIN.PathLength | ( | self, | |
| aP, | |||
aIndex = -1 |
|||
| ) |
◆ PointAlong()
| def pcbnew.SHAPE_LINE_CHAIN.PointAlong | ( | self, | |
| aPathLength | |||
| ) |
◆ PointCount()
| def pcbnew.SHAPE_LINE_CHAIN.PointCount | ( | self | ) |
◆ Remove()
| def pcbnew.SHAPE_LINE_CHAIN.Remove | ( | self, | |
| * | args | ||
| ) |
◆ RemoveDuplicatePoints()
| def pcbnew.SHAPE_LINE_CHAIN.RemoveDuplicatePoints | ( | self | ) |
◆ RemoveShape()
| def pcbnew.SHAPE_LINE_CHAIN.RemoveShape | ( | self, | |
| aPointIndex | |||
| ) |
◆ Replace()
| def pcbnew.SHAPE_LINE_CHAIN.Replace | ( | self, | |
| * | args | ||
| ) |
◆ ReservePoints()
| def pcbnew.SHAPE_LINE_CHAIN.ReservePoints | ( | self, | |
| aSize | |||
| ) |
◆ Reverse()
| def pcbnew.SHAPE_LINE_CHAIN.Reverse | ( | self | ) |
◆ Rotate()
| def pcbnew.SHAPE_LINE_CHAIN.Rotate | ( | self, | |
| * | args | ||
| ) |
Rotate(SHAPE_LINE_CHAIN self, EDA_ANGLE aAngle, VECTOR2I aCenter={ 0, 0 })
Reimplemented from pcbnew.SHAPE.
◆ Segment()
| def pcbnew.SHAPE_LINE_CHAIN.Segment | ( | self, | |
| aIndex | |||
| ) |
◆ SegmentCount()
| def pcbnew.SHAPE_LINE_CHAIN.SegmentCount | ( | self | ) |
◆ SelfIntersecting()
| def pcbnew.SHAPE_LINE_CHAIN.SelfIntersecting | ( | self | ) |
◆ SelfIntersectingWithArcs()
| def pcbnew.SHAPE_LINE_CHAIN.SelfIntersectingWithArcs | ( | self | ) |
◆ SetClosed()
| def pcbnew.SHAPE_LINE_CHAIN.SetClosed | ( | self, | |
| aClosed | |||
| ) |
◆ SetPoint()
| def pcbnew.SHAPE_LINE_CHAIN.SetPoint | ( | self, | |
| aIndex, | |||
| aPos | |||
| ) |
◆ SetWidth()
| def pcbnew.SHAPE_LINE_CHAIN.SetWidth | ( | self, | |
| aWidth | |||
| ) |
◆ ShapeCount()
| def pcbnew.SHAPE_LINE_CHAIN.ShapeCount | ( | self | ) |
◆ Simplify()
| def pcbnew.SHAPE_LINE_CHAIN.Simplify | ( | self, | |
aMaxError = 0 |
|||
| ) |
◆ Simplify2()
| def pcbnew.SHAPE_LINE_CHAIN.Simplify2 | ( | self, | |
aRemoveColinear = True |
|||
| ) |
◆ Slice()
| def pcbnew.SHAPE_LINE_CHAIN.Slice | ( | self, | |
| aStartIndex, | |||
aEndIndex = -1 |
|||
| ) |
◆ Split()
| def pcbnew.SHAPE_LINE_CHAIN.Split | ( | self, | |
| * | args | ||
| ) |
◆ Width()
| def pcbnew.SHAPE_LINE_CHAIN.Width | ( | self | ) |
Property Documentation
◆ thisown
|
static |
The documentation for this class was generated from the following file:
