A graph with nodes and connections for creepage calculation. More...

#include <drc_creepage_utils.h>

Classes
struct	GraphNodeEqual

struct	GraphNodeHash

Public Member Functions
	CREEPAGE_GRAPH (BOARD &aBoard)

	~CREEPAGE_GRAPH ()

void	TransformEdgeToCreepShapes ()

void	TransformCreepShapesToNodes (std::vector< CREEP_SHAPE * > &aShapes)

void	RemoveDuplicatedShapes ()

std::shared_ptr< GRAPH_NODE >	AddNode (GRAPH_NODE::TYPE aType, CREEP_SHAPE *aParent=nullptr, const VECTOR2I &aPos=VECTOR2I())

std::shared_ptr< GRAPH_NODE >	AddNodeVirtual ()

std::shared_ptr< GRAPH_CONNECTION >	AddConnection (std::shared_ptr< GRAPH_NODE > &aN1, std::shared_ptr< GRAPH_NODE > &aN2, const PATH_CONNECTION &aPc)

std::shared_ptr< GRAPH_CONNECTION >	AddConnection (std::shared_ptr< GRAPH_NODE > &aN1, std::shared_ptr< GRAPH_NODE > &aN2)

std::shared_ptr< GRAPH_NODE >	FindNode (GRAPH_NODE::TYPE aType, CREEP_SHAPE *aParent, const VECTOR2I &aPos)

void	RemoveConnection (const std::shared_ptr< GRAPH_CONNECTION > &, bool aDelete=false)

void	Trim (double aWeightLimit)

void	Addshape (const SHAPE &aShape, std::shared_ptr< GRAPH_NODE > &aConnectTo, BOARD_ITEM *aParent=nullptr)

double	Solve (std::shared_ptr< GRAPH_NODE > &aFrom, std::shared_ptr< GRAPH_NODE > &aTo, std::vector< std::shared_ptr< GRAPH_CONNECTION > > &aResult)

void	GeneratePaths (double aMaxWeight, PCB_LAYER_ID aLayer, const std::set< int > *aRelevantNets=nullptr)
	Generate creepage paths between graph nodes.

void	TruncateToPrefix (size_t aNodeCount, size_t aConnectionCount)
	Remove every node and connection added after the given prefix sizes, then rebuild the node lookup set from the surviving prefix.

std::shared_ptr< GRAPH_NODE >	AddNetElements (int aNetCode, PCB_LAYER_ID aLayer, int aMaxCreepage)

void	SetTarget (double aTarget)

double	GetTarget ()

Public Attributes
BOARD &	m_board

std::vector< BOARD_ITEM * >	m_boardEdge

std::vector< std::unique_ptr< PCB_SHAPE > >	m_ownedBoardEdges

SHAPE_POLY_SET *	m_boardOutline

std::vector< std::shared_ptr< GRAPH_NODE > >	m_nodes

std::vector< std::shared_ptr< GRAPH_CONNECTION > >	m_connections

std::vector< CREEP_SHAPE * >	m_shapeCollection

std::unordered_set< std::shared_ptr< GRAPH_NODE >, GraphNodeHash, GraphNodeEqual >	m_nodeset

int	m_minGrooveWidth

Private Attributes
double	m_creepageTarget

double	m_creepageTargetSquared

Detailed Description

A graph with nodes and connections for creepage calculation.

Definition at line 800 of file drc_creepage_utils.h.

Constructor & Destructor Documentation

◆ CREEPAGE_GRAPH()

CREEPAGE_GRAPH::CREEPAGE_GRAPH ( BOARD & aBoard )

inline

Definition at line 803 of file drc_creepage_utils.h.

References m_board, m_boardOutline, m_creepageTarget, m_creepageTargetSquared, and m_minGrooveWidth.

◆ ~CREEPAGE_GRAPH()

CREEPAGE_GRAPH::~CREEPAGE_GRAPH ( )

inline

Definition at line 812 of file drc_creepage_utils.h.

References m_connections, m_nodes, and m_shapeCollection.

Member Function Documentation

◆ AddConnection() [1/2]

std::shared_ptr< GRAPH_CONNECTION > CREEPAGE_GRAPH::AddConnection	(	std::shared_ptr< GRAPH_NODE > &	aN1,
		std::shared_ptr< GRAPH_NODE > &	aN2 )

Definition at line 3076 of file drc_creepage_utils.cpp.

References PATH_CONNECTION::a1, PATH_CONNECTION::a2, AddConnection(), and PATH_CONNECTION::weight.

◆ AddConnection() [2/2]

std::shared_ptr< GRAPH_CONNECTION > CREEPAGE_GRAPH::AddConnection	(	std::shared_ptr< GRAPH_NODE > &	aN1,
		std::shared_ptr< GRAPH_NODE > &	aN2,
		const PATH_CONNECTION &	aPc )

Definition at line 3058 of file drc_creepage_utils.cpp.

References m_connections.

Referenced by AddConnection(), Addshape(), BE_SHAPE_ARC::ConnectChildren(), BE_SHAPE_CIRCLE::ConnectChildren(), GeneratePaths(), and BE_SHAPE_CIRCLE::ShortenChildDueToGV().

◆ AddNetElements()

std::shared_ptr< GRAPH_NODE > CREEPAGE_GRAPH::AddNetElements	(	int	aNetCode,
		PCB_LAYER_ID	aLayer,
		int	aMaxCreepage )

Definition at line 3103 of file drc_creepage_utils.cpp.

References AddNodeVirtual(), Addshape(), BOARD_ITEM::GetEffectiveShape(), BOARD_CONNECTED_ITEM::GetNetCode(), BOARD_ITEM::IsOnLayer(), m_board, and pad.

Referenced by CREEPAGE_ENGINE::SolveNetPairWholeBoard(), and DRC_TEST_PROVIDER_CREEPAGE::testCreepage().

◆ AddNode()

std::shared_ptr< GRAPH_NODE > CREEPAGE_GRAPH::AddNode	(	GRAPH_NODE::TYPE	aType,
		CREEP_SHAPE *	aParent = nullptr,
		const VECTOR2I &	aPos = VECTOR2I() )

Definition at line 3033 of file drc_creepage_utils.cpp.

References FindNode(), m_nodes, and m_nodeset.

Referenced by Addshape(), GeneratePaths(), BE_SHAPE_CIRCLE::ShortenChildDueToGV(), and TransformCreepShapesToNodes().

◆ AddNodeVirtual()

std::shared_ptr< GRAPH_NODE > CREEPAGE_GRAPH::AddNodeVirtual ( )

Definition at line 3048 of file drc_creepage_utils.cpp.

References m_nodes, and m_nodeset.

Referenced by AddNetElements().

◆ Addshape()

void CREEPAGE_GRAPH::Addshape	(	const SHAPE &	aShape,
		std::shared_ptr< GRAPH_NODE > &	aConnectTo,
		BOARD_ITEM *	aParent = nullptr )

Definition at line 2374 of file drc_creepage_utils.cpp.

References SEG::A, AddConnection(), AddNode(), Addshape(), GRAPH_NODE::ARC, ARC, SEG::B, EDA_SHAPE::CalcArcAngles(), GRAPH_NODE::CIRCLE, circle(), SHAPE_POLY_SET::CIterateSegmentsWithHoles(), SHAPE_LINE_CHAIN::CLastPoint(), SHAPE_LINE_CHAIN::CPoints(), end, SHAPE_ARC::GetArcMid(), EDA_SHAPE::getCenter(), SHAPE_ARC::GetP0(), SHAPE_ARC::GetP1(), CREEP_SHAPE::GetPos(), SHAPE_RECT::GetPosition(), EDA_SHAPE::GetRadius(), SHAPE_SEGMENT::GetSeg(), SHAPE_RECT::GetSize(), SHAPE_ARC::GetWidth(), SHAPE_SEGMENT::GetWidth(), SHAPE_ARC::IsClockwise(), m_shapeCollection, NO_FILL, SHAPE_LINE_CHAIN::PointCount(), GRAPH_NODE::SEGMENT, EDA_SHAPE::SetArcGeometry(), CREEP_SHAPE::SetParent(), CU_SHAPE_ARC::SetWidth(), SH_ARC, SH_CIRCLE, SH_COMPOUND, SH_LINE_CHAIN, SH_POLY_SET, SH_RECT, SH_SEGMENT, SH_SIMPLE, SHAPE_BASE::Type(), SHAPE_SIMPLE::Vertices(), VECTOR2< T >::x, and VECTOR2< T >::y.

Referenced by AddNetElements(), and Addshape().

◆ FindNode()

std::shared_ptr< GRAPH_NODE > CREEPAGE_GRAPH::FindNode	(	GRAPH_NODE::TYPE	aType,
		CREEP_SHAPE *	aParent,
		const VECTOR2I &	aPos )

Definition at line 3091 of file drc_creepage_utils.cpp.

References m_nodeset.

Referenced by AddNode().

◆ GeneratePaths()

void CREEPAGE_GRAPH::GeneratePaths	(	double	aMaxWeight,
		PCB_LAYER_ID	aLayer,
		const std::set< int > *	aRelevantNets = nullptr )

Generate creepage paths between graph nodes.

When aRelevantNets is non-null, paths between two conductors that both belong to non-relevant nets are skipped: such an edge can never lie on a shortest path that starts or ends on a relevant net (a third net's copper is an obstacle, not a routing medium). Board edges are never conductors, so board-edge paths are always generated. Passing nullptr generates every pair (the batch / whole-board behaviour).

Definition at line 2552 of file drc_creepage_utils.cpp.

References KIRTREE::PACKED_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, FANOUT >::Builder::Add(), AddConnection(), AddNode(), KIRTREE::PACKED_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, FANOUT >::Builder::Build(), Edge_Cuts, empty(), BOX2< Vec >::GetBottom(), EDA_ITEM::GetBoundingBox(), GetKiCadThreadPool(), BOX2< Vec >::GetLeft(), CREEP_SHAPE::GetParent(), GetPaths(), BOX2< Vec >::GetRight(), BOX2< Vec >::GetTop(), CREEP_SHAPE::GetType(), BOX2< Vec >::GetX(), BOX2< Vec >::GetY(), CREEPAGE_TRACK_ENTRY::halfWidth, CREEP_SHAPE::IsConductive(), CREEPAGE_TRACK_ENTRY::layer, m_board, m_boardEdge, m_boardOutline, m_minGrooveWidth, m_nodes, PCB_TRACE_T, GRAPH_NODE::POINT, CREEPAGE_TRACK_ENTRY::segment, SH_SEGMENT, tp, and CREEPAGE_TRACK_ENTRY::track.

Referenced by CREEPAGE_ENGINE::SolveNetPairWholeBoard(), DRC_TEST_PROVIDER_CREEPAGE::testCreepage(), and DRC_TEST_PROVIDER_CREEPAGE::testCreepage().

◆ GetTarget()

double CREEPAGE_GRAPH::GetTarget ( )

inline

Definition at line 892 of file drc_creepage_utils.h.

References m_creepageTarget.

Referenced by BE_SHAPE_ARC::ConnectChildren(), and BE_SHAPE_CIRCLE::ConnectChildren().

◆ RemoveConnection()

void CREEPAGE_GRAPH::RemoveConnection	(	const std::shared_ptr< GRAPH_CONNECTION > &	aGc,
		bool	aDelete = false )

Definition at line 2975 of file drc_creepage_utils.cpp.

References m_connections, m_nodes, and m_nodeset.

Referenced by Trim(), and TruncateToPrefix().

◆ RemoveDuplicatedShapes()

void CREEPAGE_GRAPH::RemoveDuplicatedShapes ( )

Definition at line 634 of file drc_creepage_utils.cpp.

References areEquivalent(), compareShapes(), and m_shapeCollection.

Referenced by CREEPAGE_ENGINE::populateBoardEdgeGraph(), and DRC_TEST_PROVIDER_CREEPAGE::testCreepage().

◆ SetTarget()

void CREEPAGE_GRAPH::SetTarget ( double aTarget )

Definition at line 1009 of file drc_creepage_utils.cpp.

References m_creepageTarget, and m_creepageTargetSquared.

Referenced by CREEPAGE_ENGINE::SolveNetPairWholeBoard(), and DRC_TEST_PROVIDER_CREEPAGE::testCreepage().

◆ Solve()

double CREEPAGE_GRAPH::Solve	(	std::shared_ptr< GRAPH_NODE > &	aFrom,
		std::shared_ptr< GRAPH_NODE > &	aTo,
		std::vector< std::shared_ptr< GRAPH_CONNECTION > > &	aResult )