Home
last modified time | relevance | path

Searched refs:SHAPE_LINE_CHAIN (Results 1 – 25 of 197) sorted by relevance

12345678

/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/common/geometry/
H A Dshape_line_chain.cpp91 const SHAPE_LINE_CHAIN SHAPE_LINE_CHAIN::Reverse() const in Reverse()
93 SHAPE_LINE_CHAIN a( *this ); in Reverse()
102 int SHAPE_LINE_CHAIN::Length() const in Length()
131 void SHAPE_LINE_CHAIN::Replace( int aStartIndex, int aEndIndex, const SHAPE_LINE_CHAIN& aLine ) in Replace()
228 const SHAPE_LINE_CHAIN SHAPE_LINE_CHAIN::Slice( int aStartIndex, int aEndIndex ) const in Slice()
230 SHAPE_LINE_CHAIN rv; in Slice()
283 int SHAPE_LINE_CHAIN::Intersect( const SHAPE_LINE_CHAIN& aChain, INTERSECTIONS& aIp ) const in Intersect()
435 const OPT<SHAPE_LINE_CHAIN::INTERSECTION> SHAPE_LINE_CHAIN::SelfIntersecting() const in SelfIntersecting()
483 SHAPE_LINE_CHAIN& SHAPE_LINE_CHAIN::Simplify() in Simplify()
605 bool SHAPE_LINE_CHAIN::CompareGeometry ( const SHAPE_LINE_CHAIN & aOther ) const in CompareGeometry()
[all …]
H A Dshape_collisions.cpp150 static inline bool Collide( const SHAPE_CIRCLE& aA, const SHAPE_LINE_CHAIN& aB, int aClearance, in Collide()
186 const SHAPE_LINE_CHAIN& lc( aB.Vertices() ); in Collide()
221 static inline bool Collide( const SHAPE_LINE_CHAIN& aA, const SHAPE_LINE_CHAIN& aB, int aClearance, in Collide()
232 static inline bool Collide( const SHAPE_LINE_CHAIN& aA, const SHAPE_SIMPLE& aB, int aClearance, in Collide()
246 static inline bool Collide( const SHAPE_RECT& aA, const SHAPE_LINE_CHAIN& aB, int aClearance, in Collide()
282 static inline bool Collide( const SHAPE_LINE_CHAIN& aA, const SHAPE_SEGMENT& aB, int aClearance, in Collide()
323 static inline bool Collide( const SHAPE_ARC& aA, const SHAPE_LINE_CHAIN& aB, int aClearance, in Collide()
386 … return CollCase<SHAPE_RECT, SHAPE_LINE_CHAIN>( aA, aB, aClearance, aNeedMTV, aMTV ); in CollideShapes()
432 … return CollCase<SHAPE_RECT, SHAPE_LINE_CHAIN>( aB, aA, aClearance, aNeedMTV, aMTV ); in CollideShapes()
438 … return CollCase<SHAPE_LINE_CHAIN, SHAPE_LINE_CHAIN>( aA, aB, aClearance, aNeedMTV, aMTV ); in CollideShapes()
[all …]
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/pcbnew/router/
H A Dpns_optimizer.cpp705 SHAPE_LINE_CHAIN path[2]; in mergeStep()
756 SHAPE_LINE_CHAIN l; in circleBreakouts()
782 SHAPE_LINE_CHAIN l; in customBreakouts()
971 SHAPE_LINE_CHAIN v; in smartPadsSingle()
1019 SHAPE_LINE_CHAIN l_best; in smartPadsSingle()
1189 const SHAPE_LINE_CHAIN& aRefBypass, const SHAPE_LINE_CHAIN& aCoupled, in coupledBypass()
1200 SHAPE_LINE_CHAIN bestBypass; in coupledBypass()
1277 SHAPE_LINE_CHAIN newRef; in mergeDpStep()
1278 SHAPE_LINE_CHAIN newCoup; in mergeDpStep()
1363 static int64_t shovedArea( const SHAPE_LINE_CHAIN& aOld, const SHAPE_LINE_CHAIN& aNew ) in shovedArea()
[all …]
H A Dpns_optimizer.h64 static int CornerCost( const SHAPE_LINE_CHAIN& aLine );
162 typedef std::vector<SHAPE_LINE_CHAIN> BREAKOUT_LIST;
230 const SHAPE_LINE_CHAIN& aCurrentPath,
255 const SHAPE_LINE_CHAIN& aCurrentPath,
274 const SHAPE_LINE_CHAIN& aCurrentPath,
275 const SHAPE_LINE_CHAIN& aReplacement ) override;
292 const SHAPE_LINE_CHAIN& aCurrentPath,
293 const SHAPE_LINE_CHAIN& aReplacement ) override;
307 const SHAPE_LINE_CHAIN& aCurrentPath,
325 const SHAPE_LINE_CHAIN& aCurrentPath,
[all …]
H A Dpns_line.h80 LINE( const LINE& aBase, const SHAPE_LINE_CHAIN& aLine ) : in LINE()
126 void SetShape( const SHAPE_LINE_CHAIN& aLine ) in SetShape()
136 SHAPE_LINE_CHAIN& Line() { return m_line; } in Line()
137 const SHAPE_LINE_CHAIN& CLine() const { return m_line; } in CLine()
181 bool Walkaround( SHAPE_LINE_CHAIN aObstacle, SHAPE_LINE_CHAIN& aPre, SHAPE_LINE_CHAIN& aWalk,
182 SHAPE_LINE_CHAIN& aPost, bool aCw ) const;
184 bool Walkaround( const SHAPE_LINE_CHAIN& aObstacle, SHAPE_LINE_CHAIN& aPath, bool aCw ) const;
237 VECTOR2I snapToNeighbourSegments( const SHAPE_LINE_CHAIN& aPath, const VECTOR2I& aP,
240 VECTOR2I snapDraggedCorner( const SHAPE_LINE_CHAIN& aPath, const VECTOR2I& aP,
243 SHAPE_LINE_CHAIN m_line; ///< The actual shape of the line.
H A Dpns_utils.h41 const SHAPE_LINE_CHAIN ArcHull( const SHAPE_ARC& aSeg, int aClearance, int aWalkaroundThickness );
43 const SHAPE_LINE_CHAIN OctagonalHull( const VECTOR2I& aP0, const VECTOR2I& aSize,
46 const SHAPE_LINE_CHAIN SegmentHull( const SHAPE_SEGMENT& aSeg, int aClearance,
57 const SHAPE_LINE_CHAIN ConvexHull( const SHAPE_SIMPLE& aConvex, int aClearance );
64 void HullIntersection( const SHAPE_LINE_CHAIN& hull, const SHAPE_LINE_CHAIN& line,
65 SHAPE_LINE_CHAIN::INTERSECTIONS& ips );
H A Dpns_diff_pair.h89 void SetEntryLines( const SHAPE_LINE_CHAIN& aEntryP, const SHAPE_LINE_CHAIN& aEntryN ) in SetEntryLines()
96 const SHAPE_LINE_CHAIN& EntryP() const { return m_entryP; } in EntryP()
97 const SHAPE_LINE_CHAIN& EntryN() const { return m_entryN; } in EntryN()
108 SHAPE_LINE_CHAIN m_entryP, m_entryN;
212 SHAPE_LINE_CHAIN p, n;
289 DIFF_PAIR( const SHAPE_LINE_CHAIN &aP, const SHAPE_LINE_CHAIN& aN, int aGap = 0 ) :
347 void SetShape( const SHAPE_LINE_CHAIN &aP, const SHAPE_LINE_CHAIN& aN, bool aSwapLanes = false )
474 const SHAPE_LINE_CHAIN& CP() const { return m_p; } in CP()
475 const SHAPE_LINE_CHAIN& CN() const { return m_n; } in CN()
481 int64_t CoupledLength( const SHAPE_LINE_CHAIN& aP, const SHAPE_LINE_CHAIN& aN ) const;
[all …]
H A Dpns_utils.cpp35 const SHAPE_LINE_CHAIN OctagonalHull( const VECTOR2I& aP0, const VECTOR2I& aSize, in OctagonalHull()
38 SHAPE_LINE_CHAIN s; in OctagonalHull()
66 const SHAPE_LINE_CHAIN ArcHull( const SHAPE_ARC& aSeg, int aClearance, in ArcHull()
74 SHAPE_LINE_CHAIN s; in ArcHull()
147 SHAPE_LINE_CHAIN s; in SegmentHull()
194 const SHAPE_LINE_CHAIN& vertices = aConvex.Vertices(); in ConvexHull()
220 SHAPE_LINE_CHAIN octagon; in ConvexHull()
275 void HullIntersection( const SHAPE_LINE_CHAIN& hull, const SHAPE_LINE_CHAIN& line, in HullIntersection()
276 SHAPE_LINE_CHAIN::INTERSECTIONS& ips ) in HullIntersection()
278 SHAPE_LINE_CHAIN::INTERSECTIONS ips_raw; in HullIntersection()
[all …]
H A Dpns_solid.cpp40 static const SHAPE_LINE_CHAIN buildHullForPrimitiveShape( const SHAPE* aShape, int aClearance, in buildHullForPrimitiveShape()
93 return SHAPE_LINE_CHAIN(); in buildHullForPrimitiveShape()
97 const SHAPE_LINE_CHAIN SOLID::Hull( int aClearance, int aWalkaroundThickness, int aLayer ) const in Hull()
103 return SHAPE_LINE_CHAIN(); in Hull()
135 const SHAPE_LINE_CHAIN SOLID::HoleHull( int aClearance, int aWalkaroundThickness, int aLayer ) const in HoleHull()
138 return SHAPE_LINE_CHAIN(); in HoleHull()
H A Dpns_meander_placer_base.h129 void cutTunedLine( const SHAPE_LINE_CHAIN& aOrigin, const VECTOR2I& aTuneStart,
130 const VECTOR2I& aCursorPos, SHAPE_LINE_CHAIN& aPre, SHAPE_LINE_CHAIN& aTuned,
131 SHAPE_LINE_CHAIN& aPost );
H A Dpns_meander.h232 const SHAPE_LINE_CHAIN& CLine( int aShape ) const in CLine()
302 void start( SHAPE_LINE_CHAIN* aTarget, const VECTOR2D& aWhere, const VECTOR2D& aDir );
317 SHAPE_LINE_CHAIN makeMiterShape( const VECTOR2D& aP, const VECTOR2D& aDir, bool aSide );
320 SHAPE_LINE_CHAIN genMeanderShape( const VECTOR2D& aP, const VECTOR2D& aDir, bool aSide,
366 SHAPE_LINE_CHAIN m_shapes[2];
378 SHAPE_LINE_CHAIN* m_currentTarget;
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/router/
H A Dpns_line.h82 LINE( const LINE& aBase, const SHAPE_LINE_CHAIN& aLine ) : in LINE()
105 void SetShape( const SHAPE_LINE_CHAIN& aLine ) in SetShape()
118 SHAPE_LINE_CHAIN& Line() in Line()
124 const SHAPE_LINE_CHAIN& CLine() const in CLine()
235 bool Walkaround( SHAPE_LINE_CHAIN aObstacle,
236 SHAPE_LINE_CHAIN& aPre,
237 SHAPE_LINE_CHAIN& aWalk,
238 SHAPE_LINE_CHAIN& aPost,
241 bool Walkaround( const SHAPE_LINE_CHAIN& aObstacle,
242 SHAPE_LINE_CHAIN& aPath,
[all …]
H A Dpns_optimizer.cpp310 const SHAPE_LINE_CHAIN& l = aLine; in Build()
603 SHAPE_LINE_CHAIN path[2]; in mergeStep()
604 SHAPE_LINE_CHAIN* picked = NULL; in mergeStep()
656 SHAPE_LINE_CHAIN l; in circleBreakouts()
681 SHAPE_LINE_CHAIN l; in customBreakouts()
862 SHAPE_LINE_CHAIN v; in smartPadsSingle()
909 SHAPE_LINE_CHAIN l_best; in smartPadsSingle()
1069 … bool aRefIsP, const SHAPE_LINE_CHAIN& aRef, const SHAPE_LINE_CHAIN& aRefBypass, const SHAPE_LINE_… in coupledBypass()
1078 SHAPE_LINE_CHAIN bestBypass; in coupledBypass()
1153 SHAPE_LINE_CHAIN newRef; in mergeDpStep()
[all …]
H A Dpns_diff_pair.h104 void SetEntryLines( const SHAPE_LINE_CHAIN& aEntryP, const SHAPE_LINE_CHAIN& aEntryN ) in SetEntryLines()
111 const SHAPE_LINE_CHAIN& EntryP() const { return m_entryP; } in EntryP()
112 const SHAPE_LINE_CHAIN& EntryN() const { return m_entryN; } in EntryN()
123 SHAPE_LINE_CHAIN m_entryP, m_entryN;
241 SHAPE_LINE_CHAIN p, n;
317 DIFF_PAIR( const SHAPE_LINE_CHAIN &aP, const SHAPE_LINE_CHAIN& aN, int aGap = 0 ):
364 void SetShape( const SHAPE_LINE_CHAIN &aP, const SHAPE_LINE_CHAIN& aN, bool aSwapLanes = false )
477 const SHAPE_LINE_CHAIN& CP() const { return m_p; } in CP()
478 const SHAPE_LINE_CHAIN& CN() const { return m_n; } in CN()
484 int64_t CoupledLength( const SHAPE_LINE_CHAIN& aP, const SHAPE_LINE_CHAIN& aN ) const;
[all …]
H A Dpns_line.cpp158 bool LINE::Walkaround( SHAPE_LINE_CHAIN aObstacle, SHAPE_LINE_CHAIN& aPre, in Walkaround()
159 SHAPE_LINE_CHAIN& aWalk, SHAPE_LINE_CHAIN& aPost, bool aCw ) const in Walkaround()
188 SHAPE_LINE_CHAIN::INTERSECTION is; in Walkaround()
280 bool LINE::Walkaround( const SHAPE_LINE_CHAIN& aObstacle, SHAPE_LINE_CHAIN& aPath, bool aCw ) const in Walkaround()
282 SHAPE_LINE_CHAIN walk, post; in Walkaround()
368 SHAPE_LINE_CHAIN dragCornerInternal( const SHAPE_LINE_CHAIN& aOrigin, const VECTOR2I& aP ) in dragCornerInternal()
370 OPT<SHAPE_LINE_CHAIN> picked; in dragCornerInternal()
388 SHAPE_LINE_CHAIN paths[2]; in dragCornerInternal()
447 SHAPE_LINE_CHAIN path; in dragCorner45()
690 SHAPE_LINE_CHAIN best; in dragSegment45()
[all …]
H A Dpns_meander_placer_base.h137 void cutTunedLine( const SHAPE_LINE_CHAIN& aOrigin,
140 SHAPE_LINE_CHAIN& aPre,
141 SHAPE_LINE_CHAIN& aTuned,
142 SHAPE_LINE_CHAIN& aPost );
H A Dpns_line_placer.cpp99 SHAPE_LINE_CHAIN::INTERSECTIONS ips; in handleSelfIntersections()
100 SHAPE_LINE_CHAIN& head = m_head.Line(); in handleSelfIntersections()
101 SHAPE_LINE_CHAIN& tail = m_tail.Line(); in handleSelfIntersections()
172 SHAPE_LINE_CHAIN& head = m_head.Line(); in handlePullback()
173 SHAPE_LINE_CHAIN& tail = m_tail.Line(); in handlePullback()
231 SHAPE_LINE_CHAIN& head = m_head.Line(); in reduceTail()
232 SHAPE_LINE_CHAIN& tail = m_tail.Line(); in reduceTail()
492 SHAPE_LINE_CHAIN l_cur( l0 ); in reduceToNearestObstacle()
512 SHAPE_LINE_CHAIN l_cur( l0 ); in reduceToNearestObstacle()
1191 SHAPE_LINE_CHAIN ratLine; in updateLeadingRatLine()
[all …]
H A Dpns_utils.cpp33 const SHAPE_LINE_CHAIN OctagonalHull( const VECTOR2I& aP0, const VECTOR2I& aSize, in OctagonalHull()
36 SHAPE_LINE_CHAIN s; in OctagonalHull()
53 const SHAPE_LINE_CHAIN SegmentHull ( const SHAPE_SEGMENT& aSeg, int aClearance, in SegmentHull()
68 SHAPE_LINE_CHAIN s; in SegmentHull()
89 static void MoveDiagonal( SEG& aDiagonal, const SHAPE_LINE_CHAIN& aVertices, int aClearance ) in MoveDiagonal()
101 const SHAPE_LINE_CHAIN ConvexHull( const SHAPE_SIMPLE& aConvex, int aClearance ) in ConvexHull()
115 const SHAPE_LINE_CHAIN& vertices = aConvex.Vertices(); in ConvexHull()
141 SHAPE_LINE_CHAIN octagon; in ConvexHull()
172 SHAPE_LINE_CHAIN l;
189 SHAPE_LINE_CHAIN l;
[all …]
H A Dpns_meander.h241 const SHAPE_LINE_CHAIN& CLine( int aShape ) const in CLine()
326 void start( SHAPE_LINE_CHAIN* aTarget, const VECTOR2D& aWhere, const VECTOR2D& aDir );
337 SHAPE_LINE_CHAIN makeMiterShape( VECTOR2D aP, VECTOR2D aDir, bool aSide );
343SHAPE_LINE_CHAIN genMeanderShape( VECTOR2D aP, VECTOR2D aDir, bool aSide, MEANDER_TYPE aType, int …
378 SHAPE_LINE_CHAIN m_shapes[2];
386 SHAPE_LINE_CHAIN* m_currentTarget;
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/include/geometry/
H A Dshape_line_chain.h49 class SHAPE_LINE_CHAIN : public SHAPE
83 SHAPE_LINE_CHAIN( const SHAPE_LINE_CHAIN& aShape ) in SHAPE_LINE_CHAIN() function
94 SHAPE_LINE_CHAIN( const VECTOR2I& aA, const VECTOR2I& aB ) : in SHAPE_LINE_CHAIN() function
122 SHAPE_LINE_CHAIN( const VECTOR2I* aV, int aCount ) : in SHAPE_LINE_CHAIN() function
133 SHAPE_LINE_CHAIN( const ClipperLib::Path& aPath ) in SHAPE_LINE_CHAIN() function
142 ~SHAPE_LINE_CHAIN() in ~SHAPE_LINE_CHAIN()
363 const SHAPE_LINE_CHAIN Reverse() const;
416 void Append( const SHAPE_LINE_CHAIN& aOtherLine ) in Append()
535 bool Intersects( const SHAPE_LINE_CHAIN& aChain ) const;
621 SHAPE_LINE_CHAIN& Simplify();
[all …]
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/src/geometry/
H A Dshape_line_chain.cpp48 SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN( const std::vector<int>& aV) in SHAPE_LINE_CHAIN() function in SHAPE_LINE_CHAIN
57 SHAPE_LINE_CHAIN::SHAPE_LINE_CHAIN( const ClipperLib::Path& aPath, in SHAPE_LINE_CHAIN() function in SHAPE_LINE_CHAIN
105 SHAPE_LINE_CHAIN input; in convertToClipper()
562 const SHAPE_LINE_CHAIN SHAPE_LINE_CHAIN::Reverse() const in Reverse()
1069 SHAPE_LINE_CHAIN rv; in Slice()
1180 void SHAPE_LINE_CHAIN::Append( const SHAPE_LINE_CHAIN& aOtherLine ) in Append()
1401 int SHAPE_LINE_CHAIN::Intersect( const SHAPE_LINE_CHAIN& aChain, INTERSECTIONS& aIp, in Intersect()
1644 const OPT<SHAPE_LINE_CHAIN::INTERSECTION> SHAPE_LINE_CHAIN::SelfIntersecting() const in SelfIntersecting()
1692 SHAPE_LINE_CHAIN& SHAPE_LINE_CHAIN::Simplify( bool aRemoveColinear ) in Simplify()
1916 bool SHAPE_LINE_CHAIN::CompareGeometry( const SHAPE_LINE_CHAIN & aOther ) const in CompareGeometry()
[all …]
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/include/geometry/
H A Dshape_line_chain.h80 class SHAPE_LINE_CHAIN : public SHAPE_LINE_CHAIN_BASE
126 void AddPolyline( const SHAPE_LINE_CHAIN& aPolyline );
147 SHAPE_LINE_CHAIN() : in SHAPE_LINE_CHAIN() function
153 SHAPE_LINE_CHAIN( const SHAPE_LINE_CHAIN& aShape ) : in SHAPE_LINE_CHAIN() function
163 SHAPE_LINE_CHAIN( const std::vector<int>& aV );
198 SHAPE_LINE_CHAIN( const ClipperLib::Path& aPath,
202 virtual ~SHAPE_LINE_CHAIN() in ~SHAPE_LINE_CHAIN()
235 SHAPE_LINE_CHAIN& operator=( const SHAPE_LINE_CHAIN& ) = default;
470 const SHAPE_LINE_CHAIN Reverse() const;
527 void Append( const SHAPE_LINE_CHAIN& aOtherLine );
[all …]
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/qa/libs/kimath/geometry/
H A Dtest_shape_line_chain.cpp44 SHAPE_LINE_CHAIN chain_insert( { in BOOST_AUTO_TEST_CASE()
77 SHAPE_LINE_CHAIN chain_insert( { in BOOST_AUTO_TEST_CASE()
118 SHAPE_LINE_CHAIN chain; in BOOST_AUTO_TEST_CASE()
146 SHAPE_LINE_CHAIN chain; in BOOST_AUTO_TEST_CASE()
204 SHAPE_LINE_CHAIN chain( { seg1.A, seg1.B } ); in BOOST_AUTO_TEST_CASE()
217 SHAPE_LINE_CHAIN chainCopy = chain; in BOOST_AUTO_TEST_CASE()
225 SHAPE_LINE_CHAIN chainCopy = chain; in BOOST_AUTO_TEST_CASE()
236 SHAPE_LINE_CHAIN chainCopy = chain; in BOOST_AUTO_TEST_CASE()
247 SHAPE_LINE_CHAIN chainCopy = chain; in BOOST_AUTO_TEST_CASE()
258 SHAPE_LINE_CHAIN chainCopy = chain; in BOOST_AUTO_TEST_CASE()
[all …]
H A Dfixtures_geometry.h111 SHAPE_LINE_CHAIN polyLine, hole; in CommonTestData()
152 SHAPE_LINE_CHAIN wrapLine; in CommonTestData()
162 SHAPE_LINE_CHAIN oline0; in CommonTestData()
170 SHAPE_LINE_CHAIN o0h1; in CommonTestData()
177 SHAPE_LINE_CHAIN o0h2; in CommonTestData()
186 SHAPE_LINE_CHAIN oline1; in CommonTestData()
193 SHAPE_LINE_CHAIN o1h1; in CommonTestData()
200 SHAPE_LINE_CHAIN o1h2; in CommonTestData()
207 SHAPE_LINE_CHAIN oline2; in CommonTestData()
214 SHAPE_LINE_CHAIN o2h2; in CommonTestData()
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/include/preview_items/
H A Dpolygon_geom_manager.h161 const SHAPE_LINE_CHAIN& GetLockedInPoints() const in GetLockedInPoints()
172 const SHAPE_LINE_CHAIN& GetLeaderLinePoints() const in GetLeaderLinePoints()
196 SHAPE_LINE_CHAIN m_lockedPoints;
199 SHAPE_LINE_CHAIN m_leaderPts;

12345678