|
typedef std::set< JOINT * > | JOINT_SET |
|
|
| TOPOLOGY (NODE *aNode) |
|
bool | SimplifyLine (LINE *aLine) |
|
ITEM * | NearestUnconnectedItem (JOINT *aStart, int *aAnchor=nullptr, int aKindMask=ITEM::ANY_T) |
|
bool | LeadingRatLine (const LINE *aTrack, SHAPE_LINE_CHAIN &aRatLine) |
|
const JOINT_SET | ConnectedJoints (JOINT *aStart) |
|
const ITEM_SET | ConnectedItems (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< JOINT *, 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 std::set< ITEM * > | AssembleCluster (ITEM *aStart, int aLayer) |
|
◆ AssembleTrivialPath()
const ITEM_SET PNS::TOPOLOGY::AssembleTrivialPath |
( |
ITEM * |
aStart, |
|
|
std::pair< JOINT *, 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.
◆ 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.
The documentation for this class was generated from the following files:
- 3rd_party/router/router/pns_topology.h
- 3rd_party/router/router/pns_topology.cpp