Inheritance diagram for pcbnew.SHAPE_POLY_SET:
Public Member Functions | |
| def | __init__ (self, *args) |
| def | CacheTriangulation (self, aPartition=True, aSimplify=False) |
| def | IsTriangulationUpToDate (self) |
| def | GetHash (self) |
| def | GetRelativeIndices (self, aGlobalIdx, aRelativeIndices) |
| def | GetGlobalIndex (self, aRelativeIndices, aGlobalIdx) |
| def | CloneDropTriangulation (self) |
| def | NewOutline (self) |
| def | NewHole (self, aOutline=-1) |
| def | AddOutline (self, aOutline) |
| def | AddHole (self, aHole, aOutline=-1) |
| def | AddPolygon (self, apolygon) |
| def | Area (self) |
| def | ArcCount (self) |
| def | GetArcs (self, aArcBuffer) |
| def | ClearArcs (self) |
| def | Append (self, *args) |
| def | InsertVertex (self, aGlobalIndex, aNewVertex) |
| def | CVertex (self, *args) |
| def | GetNeighbourIndexes (self, aGlobalIndex, aPrevious, aNext) |
| def | IsPolygonSelfIntersecting (self, aPolygonIndex) |
| def | IsSelfIntersecting (self) |
| def | TriangulatedPolyCount (self) |
| def | OutlineCount (self) |
| def | VertexCount (self, aOutline=-1, aHole=-1) |
| def | FullPointCount (self) |
| def | HoleCount (self, aOutline) |
| def | Outline (self, *args) |
| def | Subset (self, aFirstPolygon, aLastPolygon) |
| def | UnitSet (self, aPolygonIndex) |
| def | Hole (self, aOutline, aHole) |
| def | Polygon (self, *args) |
| def | TriangulatedPolygon (self, aIndex) |
| def | COutline (self, aIndex) |
| def | CHole (self, aOutline, aHole) |
| def | CPolygon (self, aIndex) |
| def | CPolygons (self) |
| def | Iterate (self, *args) |
| def | IterateWithHoles (self, *args) |
| def | CIterate (self, *args) |
| def | CIterateWithHoles (self, *args) |
| def | IterateFromVertexWithHoles (self, aGlobalIdx) |
| def | IterateSegments (self, *args) |
| def | CIterateSegments (self, *args) |
| def | IterateSegmentsWithHoles (self, *args) |
| def | CIterateSegmentsWithHoles (self, *args) |
| def | BooleanAdd (self, *args) |
| def | BooleanSubtract (self, *args) |
| def | BooleanIntersection (self, *args) |
| def | BooleanXor (self, *args) |
| def | RebuildHolesFromContours (self) |
| def | Inflate (self, aAmount, aCornerStrategy, aMaxError, aSimplify=False) |
| def | Deflate (self, aAmount, aCornerStrategy, aMaxError) |
| def | OffsetLineChain (self, aLine, aAmount, aCornerStrategy, aMaxError, aSimplify) |
| def | InflateWithLinkedHoles (self, aFactor, aCornerStrategy, aMaxError, aFastMode) |
| def | Fracture (self, aFastMode) |
| def | Unfracture (self, aFastMode) |
| def | HasHoles (self) |
| def | HasTouchingHoles (self) |
| def | Simplify (self, aFastMode) |
| def | SimplifyOutlines (self, aMaxError=0) |
| def | NormalizeAreaOutlines (self) |
| def | Format (self, aCplusPlus=True) |
| def | Mirror (self, *args) |
| def | Rotate (self, *args) |
| def | BBox (self, aClearance=0) |
| def | PointOnEdge (self, aP, aAccuracy=0) |
| def | Collide (self, *args) |
| def | CollideVertex (self, aPoint, aClosestVertex=None, aClearance=0) |
| def | CollideEdge (self, aPoint, aClosestVertex=None, aClearance=0) |
| def | PointInside (self, aPt, aAccuracy=0, aUseBBoxCache=False) |
| def | BuildBBoxCaches (self) |
| def | BBoxFromCaches (self) |
| def | Contains (self, aP, aSubpolyIndex=-1, aAccuracy=0, aUseBBoxCaches=False) |
| def | IsEmpty (self) |
| def | RemoveVertex (self, *args) |
| def | RemoveAllContours (self) |
| def | RemoveContour (self, aContourIdx, aPolygonIdx=-1) |
| def | RemoveNullSegments (self) |
| def | SetVertex (self, *args) |
| def | TotalVertices (self) |
| def | DeletePolygon (self, aIdx) |
| def | DeletePolygonAndTriangulationData (self, aIdx, aUpdateHash=True) |
| def | UpdateTriangulationDataHash (self) |
| def | ChamferPolygon (self, aDistance, aIndex) |
| def | FilletPolygon (self, aRadius, aErrorMax, aIndex) |
| def | Chamfer (self, aDistance) |
| def | Fillet (self, aRadius, aErrorMax) |
| def | SquaredDistanceToPolygon (self, *args) |
| def | SquaredDistance (self, *args) |
| def | SquaredDistanceToSeg (self, aSegment, aNearest=None) |
| def | IsVertexInHole (self, aGlobalIdx) |
 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 | BuildPolysetFromOrientedPaths (aPaths, aReverseOrientation=False, aEvenOdd=False) |
Static Public Attributes | |
| _pcbnew | PM_FAST = _pcbnew.SHAPE_POLY_SET_PM_FAST |
| _pcbnew | PM_STRICTLY_SIMPLE = _pcbnew.SHAPE_POLY_SET_PM_STRICTLY_SIMPLE |
| Static Public Attributes inherited from pcbnew.SHAPE | |
| _pcbnew | MIN_PRECISION_IU = _pcbnew.SHAPE_MIN_PRECISION_IU |
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 | |
| 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") |
Detailed Description
Constructor & Destructor Documentation
◆ __init__()
| def pcbnew.SHAPE_POLY_SET.__init__ | ( | self, | |
| * | args | ||
| ) |
__init__(SHAPE_POLY_SET self) -> SHAPE_POLY_SET
__init__(SHAPE_POLY_SET self, BOX2D const & aRect) -> SHAPE_POLY_SET
__init__(SHAPE_POLY_SET self, SHAPE_LINE_CHAIN aOutline) -> SHAPE_POLY_SET
__init__(SHAPE_POLY_SET self, SHAPE_POLY_SET::POLYGON const & aPolygon) -> SHAPE_POLY_SET
__init__(SHAPE_POLY_SET self, SHAPE_POLY_SET aOther) -> SHAPE_POLY_SET
Reimplemented from pcbnew.SHAPE.
Definition at line 6760 of file pcbnew.py.
Here is the caller graph for this function:
Member Function Documentation
◆ AddHole()
| def pcbnew.SHAPE_POLY_SET.AddHole | ( | self, | |
| aHole, | |||
aOutline = -1 |
|||
| ) |
◆ AddOutline()
| def pcbnew.SHAPE_POLY_SET.AddOutline | ( | self, | |
| aOutline | |||
| ) |
◆ AddPolygon()
| def pcbnew.SHAPE_POLY_SET.AddPolygon | ( | self, | |
| apolygon | |||
| ) |
◆ Append()
| def pcbnew.SHAPE_POLY_SET.Append | ( | self, | |
| * | args | ||
| ) |
Append(SHAPE_POLY_SET self, int x, int y, int aOutline=-1, int aHole=-1, bool aAllowDuplication=False) -> int
Append(SHAPE_POLY_SET self, SHAPE_POLY_SET aSet)
Append(SHAPE_POLY_SET self, VECTOR2I aP, int aOutline=-1, int aHole=-1)
Append(SHAPE_POLY_SET self, SHAPE_ARC aArc, int aOutline=-1, int aHole=-1, double aAccuracy=SHAPE_ARC::DefaultAccuracyForPCB()) -> int
Definition at line 6831 of file pcbnew.py.
Here is the caller graph for this function:
◆ ArcCount()
| def pcbnew.SHAPE_POLY_SET.ArcCount | ( | self | ) |
◆ Area()
| def pcbnew.SHAPE_POLY_SET.Area | ( | self | ) |
◆ BBox()
| def pcbnew.SHAPE_POLY_SET.BBox | ( | self, | |
aClearance = 0 |
|||
| ) |
BBox(SHAPE_POLY_SET self, int aClearance=0) -> BOX2I
Reimplemented from pcbnew.SHAPE.
◆ BBoxFromCaches()
| def pcbnew.SHAPE_POLY_SET.BBoxFromCaches | ( | self | ) |
◆ BooleanAdd()
| def pcbnew.SHAPE_POLY_SET.BooleanAdd | ( | self, | |
| * | args | ||
| ) |
◆ BooleanIntersection()
| def pcbnew.SHAPE_POLY_SET.BooleanIntersection | ( | self, | |
| * | args | ||
| ) |
BooleanIntersection(SHAPE_POLY_SET self, SHAPE_POLY_SET b, SHAPE_POLY_SET::POLYGON_MODE aFastMode)
BooleanIntersection(SHAPE_POLY_SET self, SHAPE_POLY_SET a, SHAPE_POLY_SET b, SHAPE_POLY_SET::POLYGON_MODE aFastMode)
Definition at line 7012 of file pcbnew.py.
Here is the caller graph for this function:
◆ BooleanSubtract()
| def pcbnew.SHAPE_POLY_SET.BooleanSubtract | ( | self, | |
| * | args | ||
| ) |
◆ BooleanXor()
| def pcbnew.SHAPE_POLY_SET.BooleanXor | ( | self, | |
| * | args | ||
| ) |
◆ BuildBBoxCaches()
| def pcbnew.SHAPE_POLY_SET.BuildBBoxCaches | ( | self | ) |
◆ BuildPolysetFromOrientedPaths()
|
static |
◆ CacheTriangulation()
| def pcbnew.SHAPE_POLY_SET.CacheTriangulation | ( | self, | |
aPartition = True, |
|||
aSimplify = False |
|||
| ) |
◆ Chamfer()
| def pcbnew.SHAPE_POLY_SET.Chamfer | ( | self, | |
| aDistance | |||
| ) |
◆ ChamferPolygon()
| def pcbnew.SHAPE_POLY_SET.ChamferPolygon | ( | self, | |
| aDistance, | |||
| aIndex | |||
| ) |
◆ CHole()
| def pcbnew.SHAPE_POLY_SET.CHole | ( | self, | |
| aOutline, | |||
| aHole | |||
| ) |
◆ CIterate()
| def pcbnew.SHAPE_POLY_SET.CIterate | ( | self, | |
| * | args | ||
| ) |
CIterate(SHAPE_POLY_SET self, int aFirst, int aLast, bool aIterateHoles=False) -> SHAPE_POLY_SET::CONST_ITERATOR
CIterate(SHAPE_POLY_SET self, int aOutline) -> SHAPE_POLY_SET::CONST_ITERATOR
CIterate(SHAPE_POLY_SET self) -> SHAPE_POLY_SET::CONST_ITERATOR
Definition at line 6945 of file pcbnew.py.
Here is the caller graph for this function:
◆ CIterateSegments()
| def pcbnew.SHAPE_POLY_SET.CIterateSegments | ( | self, | |
| * | args | ||
| ) |
CIterateSegments(SHAPE_POLY_SET self, int aFirst, int aLast, bool aIterateHoles=False) -> SHAPE_POLY_SET::CONST_SEGMENT_ITERATOR
CIterateSegments(SHAPE_POLY_SET self, int aPolygonIdx) -> SHAPE_POLY_SET::CONST_SEGMENT_ITERATOR
CIterateSegments(SHAPE_POLY_SET self) -> SHAPE_POLY_SET::CONST_SEGMENT_ITERATOR
Definition at line 6972 of file pcbnew.py.
Here is the caller graph for this function:
◆ CIterateSegmentsWithHoles()
| def pcbnew.SHAPE_POLY_SET.CIterateSegmentsWithHoles | ( | self, | |
| * | args | ||
| ) |
◆ CIterateWithHoles()
| def pcbnew.SHAPE_POLY_SET.CIterateWithHoles | ( | self, | |
| * | args | ||
| ) |
◆ ClearArcs()
| def pcbnew.SHAPE_POLY_SET.ClearArcs | ( | self | ) |
◆ CloneDropTriangulation()
| def pcbnew.SHAPE_POLY_SET.CloneDropTriangulation | ( | self | ) |
◆ Collide()
| def pcbnew.SHAPE_POLY_SET.Collide | ( | self, | |
| * | args | ||
| ) |
Collide(SHAPE_POLY_SET self, SHAPE aShape, int aClearance=0, int * aActual=None, VECTOR2I aLocation=None) -> bool
Collide(SHAPE_POLY_SET self, VECTOR2I aP, int aClearance=0, int * aActual=None, VECTOR2I aLocation=None) -> bool
Collide(SHAPE_POLY_SET self, SEG aSeg, int aClearance=0, int * aActual=None, VECTOR2I aLocation=None) -> bool
Reimplemented from pcbnew.SHAPE.
Definition at line 7094 of file pcbnew.py.
Here is the caller graph for this function:
◆ CollideEdge()
| def pcbnew.SHAPE_POLY_SET.CollideEdge | ( | self, | |
| aPoint, | |||
aClosestVertex = None, |
|||
aClearance = 0 |
|||
| ) |
◆ CollideVertex()
| def pcbnew.SHAPE_POLY_SET.CollideVertex | ( | self, | |
| aPoint, | |||
aClosestVertex = None, |
|||
aClearance = 0 |
|||
| ) |
◆ Contains()
| def pcbnew.SHAPE_POLY_SET.Contains | ( | self, | |
| aP, | |||
aSubpolyIndex = -1, |
|||
aAccuracy = 0, |
|||
aUseBBoxCaches = False |
|||
| ) |
◆ COutline()
| def pcbnew.SHAPE_POLY_SET.COutline | ( | self, | |
| aIndex | |||
| ) |
◆ CPolygon()
| def pcbnew.SHAPE_POLY_SET.CPolygon | ( | self, | |
| aIndex | |||
| ) |
◆ CPolygons()
| def pcbnew.SHAPE_POLY_SET.CPolygons | ( | self | ) |
◆ CVertex()
| def pcbnew.SHAPE_POLY_SET.CVertex | ( | self, | |
| * | args | ||
| ) |
CVertex(SHAPE_POLY_SET self, int aIndex, int aOutline, int aHole) -> VECTOR2I
CVertex(SHAPE_POLY_SET self, int aGlobalIndex) -> VECTOR2I
CVertex(SHAPE_POLY_SET self, SHAPE_POLY_SET::VERTEX_INDEX aIndex) -> VECTOR2I
Definition at line 6844 of file pcbnew.py.
Here is the caller graph for this function:
◆ Deflate()
| def pcbnew.SHAPE_POLY_SET.Deflate | ( | self, | |
| aAmount, | |||
| aCornerStrategy, | |||
| aMaxError | |||
| ) |
◆ DeletePolygon()
| def pcbnew.SHAPE_POLY_SET.DeletePolygon | ( | self, | |
| aIdx | |||
| ) |
◆ DeletePolygonAndTriangulationData()
| def pcbnew.SHAPE_POLY_SET.DeletePolygonAndTriangulationData | ( | self, | |
| aIdx, | |||
aUpdateHash = True |
|||
| ) |
◆ Fillet()
| def pcbnew.SHAPE_POLY_SET.Fillet | ( | self, | |
| aRadius, | |||
| aErrorMax | |||
| ) |
◆ FilletPolygon()
| def pcbnew.SHAPE_POLY_SET.FilletPolygon | ( | self, | |
| aRadius, | |||
| aErrorMax, | |||
| aIndex | |||
| ) |
◆ Format()
| def pcbnew.SHAPE_POLY_SET.Format | ( | self, | |
aCplusPlus = True |
|||
| ) |
Format(SHAPE_POLY_SET self, bool aCplusPlus=True) -> string
Reimplemented from pcbnew.SHAPE.
◆ Fracture()
| def pcbnew.SHAPE_POLY_SET.Fracture | ( | self, | |
| aFastMode | |||
| ) |
◆ FullPointCount()
| def pcbnew.SHAPE_POLY_SET.FullPointCount | ( | self | ) |
◆ GetArcs()
| def pcbnew.SHAPE_POLY_SET.GetArcs | ( | self, | |
| aArcBuffer | |||
| ) |
◆ GetGlobalIndex()
| def pcbnew.SHAPE_POLY_SET.GetGlobalIndex | ( | self, | |
| aRelativeIndices, | |||
| aGlobalIdx | |||
| ) |
◆ GetHash()
| def pcbnew.SHAPE_POLY_SET.GetHash | ( | self | ) |
◆ GetNeighbourIndexes()
| def pcbnew.SHAPE_POLY_SET.GetNeighbourIndexes | ( | self, | |
| aGlobalIndex, | |||
| aPrevious, | |||
| aNext | |||
| ) |
◆ GetRelativeIndices()
| def pcbnew.SHAPE_POLY_SET.GetRelativeIndices | ( | self, | |
| aGlobalIdx, | |||
| aRelativeIndices | |||
| ) |
◆ HasHoles()
| def pcbnew.SHAPE_POLY_SET.HasHoles | ( | self | ) |
◆ HasTouchingHoles()
| def pcbnew.SHAPE_POLY_SET.HasTouchingHoles | ( | self | ) |
◆ Hole()
| def pcbnew.SHAPE_POLY_SET.Hole | ( | self, | |
| aOutline, | |||
| aHole | |||
| ) |
◆ HoleCount()
| def pcbnew.SHAPE_POLY_SET.HoleCount | ( | self, | |
| aOutline | |||
| ) |
◆ Inflate()
| def pcbnew.SHAPE_POLY_SET.Inflate | ( | self, | |
| aAmount, | |||
| aCornerStrategy, | |||
| aMaxError, | |||
aSimplify = False |
|||
| ) |
◆ InflateWithLinkedHoles()
| def pcbnew.SHAPE_POLY_SET.InflateWithLinkedHoles | ( | self, | |
| aFactor, | |||
| aCornerStrategy, | |||
| aMaxError, | |||
| aFastMode | |||
| ) |
◆ InsertVertex()
| def pcbnew.SHAPE_POLY_SET.InsertVertex | ( | self, | |
| aGlobalIndex, | |||
| aNewVertex | |||
| ) |
◆ IsEmpty()
| def pcbnew.SHAPE_POLY_SET.IsEmpty | ( | self | ) |
◆ IsPolygonSelfIntersecting()
| def pcbnew.SHAPE_POLY_SET.IsPolygonSelfIntersecting | ( | self, | |
| aPolygonIndex | |||
| ) |
◆ IsSelfIntersecting()
| def pcbnew.SHAPE_POLY_SET.IsSelfIntersecting | ( | self | ) |
◆ IsTriangulationUpToDate()
| def pcbnew.SHAPE_POLY_SET.IsTriangulationUpToDate | ( | self | ) |
◆ IsVertexInHole()
| def pcbnew.SHAPE_POLY_SET.IsVertexInHole | ( | self, | |
| aGlobalIdx | |||
| ) |
◆ Iterate()
| def pcbnew.SHAPE_POLY_SET.Iterate | ( | self, | |
| * | args | ||
| ) |
Iterate(SHAPE_POLY_SET self, int aFirst, int aLast, bool aIterateHoles=False) -> SHAPE_POLY_SET::ITERATOR
Iterate(SHAPE_POLY_SET self, int aOutline) -> SHAPE_POLY_SET::ITERATOR
Iterate(SHAPE_POLY_SET self) -> SHAPE_POLY_SET::ITERATOR
Definition at line 6930 of file pcbnew.py.
Here is the caller graph for this function:
◆ IterateFromVertexWithHoles()
| def pcbnew.SHAPE_POLY_SET.IterateFromVertexWithHoles | ( | self, | |
| aGlobalIdx | |||
| ) |
◆ IterateSegments()
| def pcbnew.SHAPE_POLY_SET.IterateSegments | ( | self, | |
| * | args | ||
| ) |
IterateSegments(SHAPE_POLY_SET self, int aFirst, int aLast, bool aIterateHoles=False) -> SHAPE_POLY_SET::SEGMENT_ITERATOR
IterateSegments(SHAPE_POLY_SET self, int aPolygonIdx) -> SHAPE_POLY_SET::SEGMENT_ITERATOR
IterateSegments(SHAPE_POLY_SET self) -> SHAPE_POLY_SET::SEGMENT_ITERATOR
Definition at line 6964 of file pcbnew.py.
Here is the caller graph for this function:
◆ IterateSegmentsWithHoles()
| def pcbnew.SHAPE_POLY_SET.IterateSegmentsWithHoles | ( | self, | |
| * | args | ||
| ) |
◆ IterateWithHoles()
| def pcbnew.SHAPE_POLY_SET.IterateWithHoles | ( | self, | |
| * | args | ||
| ) |
◆ Mirror()
| def pcbnew.SHAPE_POLY_SET.Mirror | ( | self, | |
| * | args | ||
| ) |
◆ NewHole()
| def pcbnew.SHAPE_POLY_SET.NewHole | ( | self, | |
aOutline = -1 |
|||
| ) |
◆ NewOutline()
| def pcbnew.SHAPE_POLY_SET.NewOutline | ( | self | ) |
◆ NormalizeAreaOutlines()
| def pcbnew.SHAPE_POLY_SET.NormalizeAreaOutlines | ( | self | ) |
◆ OffsetLineChain()
| def pcbnew.SHAPE_POLY_SET.OffsetLineChain | ( | self, | |
| aLine, | |||
| aAmount, | |||
| aCornerStrategy, | |||
| aMaxError, | |||
| aSimplify | |||
| ) |
◆ Outline()
| def pcbnew.SHAPE_POLY_SET.Outline | ( | self, | |
| * | args | ||
| ) |
◆ OutlineCount()
| def pcbnew.SHAPE_POLY_SET.OutlineCount | ( | self | ) |
◆ PointInside()
| def pcbnew.SHAPE_POLY_SET.PointInside | ( | self, | |
| aPt, | |||
aAccuracy = 0, |
|||
aUseBBoxCache = False |
|||
| ) |
PointInside(SHAPE_POLY_SET self, VECTOR2I aPt, int aAccuracy=0, bool aUseBBoxCache=False) -> bool
Reimplemented from pcbnew.SHAPE.
◆ PointOnEdge()
| def pcbnew.SHAPE_POLY_SET.PointOnEdge | ( | self, | |
| aP, | |||
aAccuracy = 0 |
|||
| ) |
◆ Polygon()
| def pcbnew.SHAPE_POLY_SET.Polygon | ( | self, | |
| * | args | ||
| ) |
◆ RebuildHolesFromContours()
| def pcbnew.SHAPE_POLY_SET.RebuildHolesFromContours | ( | self | ) |
◆ RemoveAllContours()
| def pcbnew.SHAPE_POLY_SET.RemoveAllContours | ( | self | ) |
◆ RemoveContour()
| def pcbnew.SHAPE_POLY_SET.RemoveContour | ( | self, | |
| aContourIdx, | |||
aPolygonIdx = -1 |
|||
| ) |
◆ RemoveNullSegments()
| def pcbnew.SHAPE_POLY_SET.RemoveNullSegments | ( | self | ) |
◆ RemoveVertex()
| def pcbnew.SHAPE_POLY_SET.RemoveVertex | ( | self, | |
| * | args | ||
| ) |
◆ Rotate()
| def pcbnew.SHAPE_POLY_SET.Rotate | ( | self, | |
| * | args | ||
| ) |
Rotate(SHAPE_POLY_SET self, EDA_ANGLE aAngle, VECTOR2I aCenter={ 0, 0 })
Reimplemented from pcbnew.SHAPE.
◆ SetVertex()
| def pcbnew.SHAPE_POLY_SET.SetVertex | ( | self, | |
| * | args | ||
| ) |
◆ Simplify()
| def pcbnew.SHAPE_POLY_SET.Simplify | ( | self, | |
| aFastMode | |||
| ) |
◆ SimplifyOutlines()
| def pcbnew.SHAPE_POLY_SET.SimplifyOutlines | ( | self, | |
aMaxError = 0 |
|||
| ) |
◆ SquaredDistance()
| def pcbnew.SHAPE_POLY_SET.SquaredDistance | ( | self, | |
| * | args | ||
| ) |
SquaredDistance(SHAPE_POLY_SET self, VECTOR2I aPoint, bool aOutlineOnly, VECTOR2I aNearest) -> SEG::ecoord
SquaredDistance(SHAPE_POLY_SET self, VECTOR2I aPoint, bool aOutlineOnly=False) -> SEG::ecoord
Reimplemented from pcbnew.SHAPE.
Definition at line 7195 of file pcbnew.py.
Here is the caller graph for this function:
◆ SquaredDistanceToPolygon()
| def pcbnew.SHAPE_POLY_SET.SquaredDistanceToPolygon | ( | self, | |
| * | args | ||
| ) |
SquaredDistanceToPolygon(SHAPE_POLY_SET self, VECTOR2I aPoint, int aIndex, VECTOR2I aNearest) -> SEG::ecoord
SquaredDistanceToPolygon(SHAPE_POLY_SET self, SEG aSegment, int aIndex, VECTOR2I aNearest) -> SEG::ecoord
Definition at line 7188 of file pcbnew.py.
Here is the caller graph for this function:
◆ SquaredDistanceToSeg()
| def pcbnew.SHAPE_POLY_SET.SquaredDistanceToSeg | ( | self, | |
| aSegment, | |||
aNearest = None |
|||
| ) |
◆ Subset()
| def pcbnew.SHAPE_POLY_SET.Subset | ( | self, | |
| aFirstPolygon, | |||
| aLastPolygon | |||
| ) |
◆ TotalVertices()
| def pcbnew.SHAPE_POLY_SET.TotalVertices | ( | self | ) |
◆ TriangulatedPolyCount()
| def pcbnew.SHAPE_POLY_SET.TriangulatedPolyCount | ( | self | ) |
◆ TriangulatedPolygon()
| def pcbnew.SHAPE_POLY_SET.TriangulatedPolygon | ( | self, | |
| aIndex | |||
| ) |
◆ Unfracture()
| def pcbnew.SHAPE_POLY_SET.Unfracture | ( | self, | |
| aFastMode | |||
| ) |
◆ UnitSet()
| def pcbnew.SHAPE_POLY_SET.UnitSet | ( | self, | |
| aPolygonIndex | |||
| ) |
◆ UpdateTriangulationDataHash()
| def pcbnew.SHAPE_POLY_SET.UpdateTriangulationDataHash | ( | self | ) |
◆ VertexCount()
| def pcbnew.SHAPE_POLY_SET.VertexCount | ( | self, | |
aOutline = -1, |
|||
aHole = -1 |
|||
| ) |
Member Data Documentation
◆ PM_FAST
|
static |
◆ PM_STRICTLY_SIMPLE
|
static |
Property Documentation
◆ thisown
|
static |
The documentation for this class was generated from the following file:
