KiCad PCB EDA Suite
RN_NET Class Reference

Class RN_NET Describes ratsnest for a single net. More...

#include <ratsnest_data.h>

Classes

class  TRIANGULATOR_STATE
 

Public Member Functions

 RN_NET ()
 

Default constructor.

More...
 
void SetVisible (bool aEnabled)
 Function SetVisible() Sets state of the visibility flag. More...
 
void MarkDirty ()
 Function MarkDirty() Marks ratsnest for given net as 'dirty', i.e. More...
 
bool IsDirty () const
 Function IsDirty() Returns state of the 'dirty' flag, indicating that ratsnest for a given net is invalid and requires an update. More...
 
const std::vector< CN_EDGEGetUnconnected () const
 Function GetUnconnected() Returns pointer to a vector of edges that makes ratsnest for a given net. More...
 
void Update ()
 Function Update() Recomputes ratsnest for a net. More...
 
void Clear ()
 
void AddCluster (std::shared_ptr< CN_CLUSTER > aCluster)
 
unsigned int GetNodeCount () const
 
std::list< CN_ANCHOR_PTRGetNodes (const BOARD_CONNECTED_ITEM *aItem) const
 Function GetNodes() Returns list of nodes that are associated with a given item. More...
 
const std::vector< CN_EDGE > & GetEdges () const
 
void GetAllItems (std::list< BOARD_CONNECTED_ITEM * > &aOutput, const KICAD_T aTypes[]) const
 Function GetAllItems() Adds all stored items to a list. More...
 
const CN_ANCHOR_PTR GetClosestNode (const CN_ANCHOR_PTR &aNode) const
 Function GetClosestNode() Returns a single node that lies in the shortest distance from a specific node. More...
 
bool NearestBicoloredPair (const RN_NET &aOtherNet, CN_ANCHOR_PTR &aNode1, CN_ANCHOR_PTR &aNode2) const
 

Protected Member Functions

void compute ()
 

Recomputes ratsnest from scratch.

More...
 

Protected Attributes

std::vector< CN_ANCHOR_PTRm_nodes
 

Vector of nodes

More...
 
std::vector< CN_EDGEm_boardEdges
 

Vector of edges that make pre-defined connections

More...
 
std::vector< CN_EDGEm_rnEdges
 

Vector of edges that makes ratsnest for a given net.

More...
 
bool m_dirty
 

Flag indicating necessity of recalculation of ratsnest for a net.

More...
 
std::shared_ptr< TRIANGULATOR_STATEm_triangulator
 

Detailed Description

Class RN_NET Describes ratsnest for a single net.

Definition at line 59 of file ratsnest_data.h.

Constructor & Destructor Documentation

RN_NET::RN_NET ( )

Default constructor.

Definition at line 277 of file ratsnest_data.cpp.

References m_triangulator.

277  : m_dirty( true )
278 {
279  m_triangulator.reset( new TRIANGULATOR_STATE );
280 }
bool m_dirty
Flag indicating necessity of recalculation of ratsnest for a net.
std::shared_ptr< TRIANGULATOR_STATE > m_triangulator

Member Function Documentation

void RN_NET::AddCluster ( std::shared_ptr< CN_CLUSTER aCluster)

Definition at line 363 of file ratsnest_data.cpp.

References CN_ITEM::Anchors(), m_boardEdges, and m_nodes.

364 {
365  CN_ANCHOR_PTR firstAnchor;
366 
367  for( auto item : *aCluster )
368  {
369  bool isZone = dynamic_cast<CN_ZONE*>(item) != nullptr;
370  auto& anchors = item->Anchors();
371  unsigned int nAnchors = isZone ? 1 : anchors.size();
372 
373  if( nAnchors > anchors.size() )
374  nAnchors = anchors.size();
375 
376  //printf("item %p anchors : %d\n", item, anchors.size() );
377  //printf("add item %p anchors : %d net : %d\n", item, item->Anchors().size(), item->Parent()->GetNetCode() );
378 
379  for( unsigned int i = 0; i < nAnchors; i++ )
380  {
381  // printf("add anchor %p\n", anchors[i].get() );
382 
383  anchors[i]->SetCluster( aCluster );
384  m_nodes.push_back(anchors[i]);
385 
386  if( firstAnchor )
387  {
388  if( firstAnchor != anchors[i] )
389  {
390  m_boardEdges.emplace_back( firstAnchor, anchors[i], 0 );
391  }
392  }
393  else
394  {
395  firstAnchor = anchors[i];
396  }
397  }
398  }
399 }
CN_ANCHORS & Anchors()
std::vector< CN_ANCHOR_PTR > m_nodes
Vector of nodes
std::vector< CN_EDGE > m_boardEdges
Vector of edges that make pre-defined connections
std::shared_ptr< CN_ANCHOR > CN_ANCHOR_PTR
void RN_NET::Clear ( )

Definition at line 353 of file ratsnest_data.cpp.

References m_boardEdges, m_dirty, m_nodes, and m_rnEdges.

354 {
355  m_rnEdges.clear();
356  m_boardEdges.clear();
357  m_nodes.clear();
358 
359  m_dirty = true;
360 }
bool m_dirty
Flag indicating necessity of recalculation of ratsnest for a net.
std::vector< CN_EDGE > m_rnEdges
Vector of edges that makes ratsnest for a given net.
std::vector< CN_ANCHOR_PTR > m_nodes
Vector of nodes
std::vector< CN_EDGE > m_boardEdges
Vector of edges that make pre-defined connections
void RN_NET::compute ( )
protected

Recomputes ratsnest from scratch.

Definition at line 283 of file ratsnest_data.cpp.

References CN_EDGE::GetSourceNode(), kruskalMST(), m_boardEdges, m_nodes, m_rnEdges, m_triangulator, and PROF_COUNTER::Show().

Referenced by Update().

284 {
285  // Special cases do not need complicated algorithms (actually, it does not work well with
286  // the Delaunay triangulator)
287  //printf("compute nodes : %d\n", m_nodes.size() );
288  if( m_nodes.size() <= 2 )
289  {
290  m_rnEdges.clear();
291 
292  // Check if the only possible connection exists
293  if( m_boardEdges.size() == 0 && m_nodes.size() == 2 )
294  {
295  auto last = ++m_nodes.begin();
296 
297  // There can be only one possible connection, but it is missing
298  CN_EDGE edge (*m_nodes.begin(), *last );
299  edge.GetSourceNode()->SetTag( 0 );
300  edge.GetTargetNode()->SetTag( 1 );
301 
302  m_rnEdges.push_back( edge );
303  }
304  else
305  {
306  // Set tags to m_nodes as connected
307  for( auto node : m_nodes )
308  node->SetTag( 0 );
309  }
310 
311  return;
312  }
313 
314 
315  m_triangulator->Clear();
316 
317  for( auto n : m_nodes )
318  {
319  m_triangulator->AddNode( n );
320  }
321 
322  #ifdef PROFILE
323  PROF_COUNTER cnt("triangulate");
324  #endif
325  auto triangEdges = m_triangulator->Triangulate();
326  #ifdef PROFILE
327  cnt.Show();
328  #endif
329 
330  for( const auto& e : m_boardEdges )
331  triangEdges.push_back( e );
332 
333 // Get the minimal spanning tree
334 #ifdef PROFILE
335  PROF_COUNTER cnt2("mst");
336 #endif
337  m_rnEdges = kruskalMST( triangEdges, m_nodes );
338 #ifdef PROFILE
339  cnt2.Show();
340 #endif
341 }
std::vector< CN_EDGE > m_rnEdges
Vector of edges that makes ratsnest for a given net.
The class PROF_COUNTER is a small class to help profiling.
Definition: profile.h:45
std::vector< CN_ANCHOR_PTR > m_nodes
Vector of nodes
static const std::vector< CN_EDGE > kruskalMST(std::list< CN_EDGE > &aEdges, std::vector< CN_ANCHOR_PTR > &aNodes)
std::shared_ptr< TRIANGULATOR_STATE > m_triangulator
std::vector< CN_EDGE > m_boardEdges
Vector of edges that make pre-defined connections
CN_ANCHOR_PTR GetSourceNode() const
void RN_NET::GetAllItems ( std::list< BOARD_CONNECTED_ITEM * > &  aOutput,
const KICAD_T  aTypes[] 
) const

Function GetAllItems() Adds all stored items to a list.

Parameters
aOutputis the list that will have items added.
aTypedetermines the type of added items.
const CN_ANCHOR_PTR RN_NET::GetClosestNode ( const CN_ANCHOR_PTR aNode) const

Function GetClosestNode() Returns a single node that lies in the shortest distance from a specific node.

Parameters
aNodeis the node for which the closest node is searched.
const std::vector<CN_EDGE>& RN_NET::GetEdges ( ) const
inline

Definition at line 125 of file ratsnest_data.h.

References m_rnEdges.

Referenced by PCB_BASE_FRAME::DrawGeneralRatsnest().

126  {
127  return m_rnEdges;
128  }
std::vector< CN_EDGE > m_rnEdges
Vector of edges that makes ratsnest for a given net.
unsigned int RN_NET::GetNodeCount ( ) const
inline

Definition at line 112 of file ratsnest_data.h.

References m_nodes.

113  {
114  return m_nodes.size();
115  }
std::vector< CN_ANCHOR_PTR > m_nodes
Vector of nodes
std::list<CN_ANCHOR_PTR> RN_NET::GetNodes ( const BOARD_CONNECTED_ITEM aItem) const

Function GetNodes() Returns list of nodes that are associated with a given item.

Parameters
aItemis an item for which the list is generated.
Returns
List of associated nodes.
const std::vector<CN_EDGE> RN_NET::GetUnconnected ( ) const
inline

Function GetUnconnected() Returns pointer to a vector of edges that makes ratsnest for a given net.

Returns
Pointer to a vector of edges that makes ratsnest for a given net.

Definition at line 98 of file ratsnest_data.h.

References m_rnEdges.

Referenced by KIGFX::RATSNEST_VIEWITEM::ViewDraw().

99  {
100  return m_rnEdges;
101  }
std::vector< CN_EDGE > m_rnEdges
Vector of edges that makes ratsnest for a given net.
bool RN_NET::IsDirty ( ) const
inline

Function IsDirty() Returns state of the 'dirty' flag, indicating that ratsnest for a given net is invalid and requires an update.

Returns
True if ratsnest requires recomputation, false otherwise.

Definition at line 88 of file ratsnest_data.h.

References m_dirty.

89  {
90  return m_dirty;
91  }
bool m_dirty
Flag indicating necessity of recalculation of ratsnest for a net.
void RN_NET::MarkDirty ( )
inline

Function MarkDirty() Marks ratsnest for given net as 'dirty', i.e.

requiring recomputation.

Definition at line 77 of file ratsnest_data.h.

References m_dirty.

78  {
79  m_dirty = true;
80  }
bool m_dirty
Flag indicating necessity of recalculation of ratsnest for a net.
bool RN_NET::NearestBicoloredPair ( const RN_NET aOtherNet,
CN_ANCHOR_PTR aNode1,
CN_ANCHOR_PTR aNode2 
) const

Definition at line 402 of file ratsnest_data.cpp.

References VECTOR2_TRAITS< int >::ECOORD_MAX, and m_nodes.

404 {
405  bool rv = false;
406 
408 
409  for( auto nodeA : m_nodes )
410  {
411  for( auto nodeB : aOtherNet.m_nodes )
412  {
413  if( !nodeA->GetNoLine() )
414  {
415  auto squaredDist = (nodeA->Pos() - nodeB->Pos() ).SquaredEuclideanNorm();
416 
417  if( squaredDist < distMax )
418  {
419  rv = true;
420  distMax = squaredDist;
421  aNode1 = nodeA;
422  aNode2 = nodeB;
423  }
424  }
425  }
426  }
427 
428  return rv;
429 }
VECTOR2_TRAITS< int >::extended_type extended_type
Definition: vector2d.h:81
std::vector< CN_ANCHOR_PTR > m_nodes
Vector of nodes
static const extended_type ECOORD_MAX
Definition: vector2d.h:59
void RN_NET::SetVisible ( bool  aEnabled)

Function SetVisible() Sets state of the visibility flag.

Parameters
aEnabledis new state. True if ratsnest for a given net is meant to be displayed, false otherwise.

Definition at line 432 of file ratsnest_data.cpp.

References m_rnEdges.

433 {
434  for( auto& edge : m_rnEdges )
435  edge.SetVisible( aEnabled );
436 }
std::vector< CN_EDGE > m_rnEdges
Vector of edges that makes ratsnest for a given net.
void RN_NET::Update ( )

Function Update() Recomputes ratsnest for a net.

Definition at line 345 of file ratsnest_data.cpp.

References compute(), and m_dirty.

346 {
347  compute();
348 
349  m_dirty = false;
350 }
bool m_dirty
Flag indicating necessity of recalculation of ratsnest for a net.
void compute()
Recomputes ratsnest from scratch.

Member Data Documentation

std::vector<CN_EDGE> RN_NET::m_boardEdges
protected

Vector of edges that make pre-defined connections

Definition at line 155 of file ratsnest_data.h.

Referenced by AddCluster(), Clear(), and compute().

bool RN_NET::m_dirty
protected

Flag indicating necessity of recalculation of ratsnest for a net.

Definition at line 161 of file ratsnest_data.h.

Referenced by Clear(), IsDirty(), MarkDirty(), and Update().

std::vector<CN_ANCHOR_PTR> RN_NET::m_nodes
protected

Vector of nodes

Definition at line 152 of file ratsnest_data.h.

Referenced by AddCluster(), Clear(), compute(), GetNodeCount(), and NearestBicoloredPair().

std::vector<CN_EDGE> RN_NET::m_rnEdges
protected

Vector of edges that makes ratsnest for a given net.

Definition at line 158 of file ratsnest_data.h.

Referenced by Clear(), compute(), GetEdges(), GetUnconnected(), and SetVisible().

std::shared_ptr<TRIANGULATOR_STATE> RN_NET::m_triangulator
protected

Definition at line 163 of file ratsnest_data.h.

Referenced by compute(), and RN_NET().


The documentation for this class was generated from the following files: