#include <pns_topology.h>

Classes
struct	CLUSTER

Public Types
typedef std::set< const JOINT * >	JOINT_SET

Public Member Functions
	TOPOLOGY (NODE *aNode)

	~TOPOLOGY ()

bool	SimplifyLine (LINE *aLine)

ITEM *	NearestUnconnectedItem (const JOINT aStart, int aAnchor=nullptr, int aKindMask=ITEM::ANY_T)

bool	NearestUnconnectedAnchorPoint (const LINE aTrack, VECTOR2I &aPoint, PNS_LAYER_RANGE &aLayers, ITEM &aItem)

bool	LeadingRatLine (const LINE *aTrack, SHAPE_LINE_CHAIN &aRatLine)

const JOINT_SET	ConnectedJoints (const JOINT *aStart)

const ITEM_SET	ConnectedItems (const JOINT *aStart, int aKindMask=ITEM::ANY_T)

const ITEM_SET	ConnectedItems (ITEM *aStart, int aKindMask=ITEM::ANY_T)

int64_t	ShortestConnectionLength (ITEM aFrom, ITEM aTo)

const ITEM_SET	AssembleTrivialPath (ITEM aStart, std::pair< const JOINT , const JOINT * > *aTerminalJoints=nullptr, bool aFollowLockedSegments=false)
	Assemble a trivial path between two joints given a starting item.

const ITEM_SET	AssembleTuningPath (ITEM aStart, SOLID aStartPad=nullptr, SOLID *aEndPad=nullptr)
	Like AssembleTrivialPath, but follows the track length algorithm, which discards segments that are fully inside pads, and truncates segments that cross into a pad (adding a straight- line segment from the intersection to the pad anchor).

const DIFF_PAIR	AssembleDiffPair (SEGMENT *aStart)

bool	AssembleDiffPair (ITEM *aStart, DIFF_PAIR &aPair)

const CLUSTER	AssembleCluster (ITEM *aStart, int aLayer, double aAreaExpansionLimit=0.0, NET_HANDLE aExcludedNet=nullptr)

Private Member Functions
bool	followTrivialPath (LINE aLine, bool aLeft, ITEM_SET &aSet, const JOINT *aTerminalJoint=nullptr, bool aFollowLockedSegments=false)

Private Attributes
const int	DP_PARALLELITY_THRESHOLD = 5

NODE *	m_world

Detailed Description

Definition at line 39 of file pns_topology.h.

Member Typedef Documentation

◆ JOINT_SET

typedef std::set<const JOINT*> PNS::TOPOLOGY::JOINT_SET

Definition at line 49 of file pns_topology.h.

Constructor & Destructor Documentation

◆ TOPOLOGY()

PNS::TOPOLOGY::TOPOLOGY ( NODE * aNode )

inline

Definition at line 51 of file pns_topology.h.

◆ ~TOPOLOGY()

PNS::TOPOLOGY::~TOPOLOGY ( )

inline

Definition at line 54 of file pns_topology.h.

Member Function Documentation

◆ AssembleCluster()

const TOPOLOGY::CLUSTER PNS::TOPOLOGY::AssembleCluster	(	ITEM *	aStart,
		int	aLayer,
		double	aAreaExpansionLimit = `0.0`,
		NET_HANDLE	aExcludedNet = `nullptr`
	)

Definition at line 625 of file pns_topology.cpp.

References PNS::ITEM::ARC_T, PNS::NODE::AssembleLine(), SHAPE::BBox(), BOX2< Vec >::GetArea(), PNS::COLLISION_SEARCH_OPTIONS::m_differentNetsOnly, PNS::TOPOLOGY::CLUSTER::m_items, PNS::COLLISION_SEARCH_OPTIONS::m_overrideClearance, m_world, BOX2< Vec >::Merge(), PNS::MK_HEAD, PNS::ITEM::Net(), PNS::ITEM::OfKind(), PNS::NODE::QueryColliding(), PNS::ITEM::SEGMENT_T, and PNS::ITEM::Shape().

Referenced by PNS::SHOVE::onCollidingSolid(), and PNS::WALKAROUND::singleStep().

◆ AssembleDiffPair() [1/2]

bool PNS::TOPOLOGY::AssembleDiffPair	(	ITEM *	aStart,
		DIFF_PAIR &	aPair
	)

Definition at line 474 of file pns_topology.cpp.

References std::abs(), PNS::NODE::AllItemsInNet(), PNS::ITEM::Anchor(), PNS::ITEM::AnchorCount(), SEG::ApproxParallel(), PNS::ITEM::ARC_T, PNS::NODE::AssembleLine(), PNS::ARC::CArc(), SHAPE::Centre(), PNS::commonParallelProjection(), VECTOR2< T >::Cross(), DP_PARALLELITY_THRESHOLD, PNS::RULE_RESOLVER::DpCoupledNet(), PNS::RULE_RESOLVER::DpNetPolarity(), VECTOR2< T >::EuclideanNorm(), PNS::NODE::FindJoint(), SHAPE_ARC::GetCenter(), SHAPE_ARC::GetRadius(), PNS::NODE::GetRuleResolver(), PNS::ITEM::Kind(), PNS::ITEM::Layers(), PNS::JOINT::LinkList(), PNS::LINK_HOLDER::Links(), m_world, PNS::ITEM::Net(), PNS::SEGMENT::Seg(), PNS::ITEM::SEGMENT_T, PNS::DIFF_PAIR::SetGap(), PNS::ITEM::SetLayers(), PNS::DIFF_PAIR::SetWidth(), PNS::ITEM::Shape(), SEG::Square(), SEG::SquaredDistance(), VECTOR2< T >::SquaredEuclideanNorm(), PNS::LINE::Width(), PNS::ARC::Width(), and PNS::SEGMENT::Width().

◆ AssembleDiffPair() [2/2]

const DIFF_PAIR PNS::TOPOLOGY::AssembleDiffPair ( SEGMENT * aStart )

Referenced by PNS::DP_MEANDER_PLACER::Start(), and PNS::MEANDER_SKEW_PLACER::Start().

◆ AssembleTrivialPath()

const ITEM_SET PNS::TOPOLOGY::AssembleTrivialPath	(	ITEM *	aStart,
		std::pair< const JOINT , const JOINT > *	aTerminalJoints = `nullptr`,
		bool	aFollowLockedSegments = `false`
	)

Assemble a trivial path between two joints given a starting item.

Parameters

aStart	is the item to assemble from.
aTerminalJoints	will be filled with the start and end points of the assembled path.
aFollowLockedSegments	if true will assemble a path including locked segments

Returns: a set of items in the path.

Definition at line 278 of file pns_topology.cpp.

References PNS::ITEM::ARC_T, PNS::NODE::AssembleLine(), PNS::JOINT::CLinks(), PNS::NODE::FindJoint(), followTrivialPath(), PNS::JOINT::IsNonFanoutVia(), PNS::ITEM::Kind(), m_world, PNS::ITEM::OfKind(), path, PNS::ITEM::SEGMENT_T, via, and PNS::ITEM::VIA_T.

Referenced by AssembleTuningPath(), and PNS::MEANDER_SKEW_PLACER::Start().

◆ AssembleTuningPath()

const ITEM_SET PNS::TOPOLOGY::AssembleTuningPath	(	ITEM *	aStart,
		SOLID **	aStartPad = `nullptr`,
		SOLID **	aEndPad = `nullptr`
	)

Like AssembleTrivialPath, but follows the track length algorithm, which discards segments that are fully inside pads, and truncates segments that cross into a pad (adding a straight- line segment from the intersection to the pad anchor).

Note: When changing this, sync with BOARD::GetTrackLength()

Parameters

aStart	is the item to assemble a path from.
aStartPad	will be filled with the starting pad of the path, if found.
aEndPad	will be filled with the ending pad of the path, if found.

Returns: an item set containing all the items in the path.

Definition at line 334 of file pns_topology.cpp.

References SEG::A, AssembleTrivialPath(), SEG::B, PNS::LINE::CLine(), SHAPE_LINE_CHAIN::CPoint(), SHAPE_LINE_CHAIN::CPoints(), delta, ERROR_INSIDE, SHAPE_LINE_CHAIN::GetPoint(), SHAPE_LINE_CHAIN::Insert(), PNS::ITEM::Layer(), PNS::LINE::Line(), PNS::ITEM::LINE_T, PNS::JOINT::LinkList(), PCB_PAD_T, SHAPE_LINE_CHAIN::PointCount(), PNS::JOINT::Pos(), SHAPE_LINE_CHAIN::Remove(), SHAPE_LINE_CHAIN::Replace(), PNS::ITEM_SET::Size(), PNS::ITEM::SOLID_T, and EDA_ITEM::Type().

Referenced by PNS::DP_MEANDER_PLACER::Start(), PNS::MEANDER_PLACER::Start(), and PNS::MEANDER_SKEW_PLACER::Start().

◆ ConnectedItems() [1/2]

const ITEM_SET PNS::TOPOLOGY::ConnectedItems	(	const JOINT *	aStart,
		int	aKindMask = `ITEM::ANY_T`
	)

Definition at line 459 of file pns_topology.cpp.

◆ ConnectedItems() [2/2]

const ITEM_SET PNS::TOPOLOGY::ConnectedItems	(	ITEM *	aStart,
		int	aKindMask = `ITEM::ANY_T`
	)

Definition at line 465 of file pns_topology.cpp.

◆ ConnectedJoints()

const TOPOLOGY::JOINT_SET PNS::TOPOLOGY::ConnectedJoints ( const JOINT * aStart )

Definition at line 63 of file pns_topology.cpp.

References PNS::NODE::FindJoint(), PNS::JOINT::LinkList(), m_world, next(), and PNS::ITEM::SEGMENT_T.

Referenced by NearestUnconnectedItem().

◆ followTrivialPath()

bool PNS::TOPOLOGY::followTrivialPath	(	LINE *	aLine,
		bool	aLeft,
		ITEM_SET &	aSet,
		const JOINT **	aTerminalJoint = `nullptr`,
		bool	aFollowLockedSegments = `false`
	)