Loading pcbnew/ratsnest.cpp +4 −1 Original line number Original line Diff line number Diff line Loading @@ -71,6 +71,9 @@ public: void MIN_SPAN_TREE_PADS::AddTreeToRatsnest( std::vector<RATSNEST_ITEM> &aRatsnestList ) void MIN_SPAN_TREE_PADS::AddTreeToRatsnest( std::vector<RATSNEST_ITEM> &aRatsnestList ) { { std::vector<D_PAD*>& padsBuffer = *m_PadsList; std::vector<D_PAD*>& padsBuffer = *m_PadsList; if( padsBuffer.empty() ) return; int netcode = padsBuffer[0]->GetNet(); int netcode = padsBuffer[0]->GetNet(); // Note: to get edges in minimum spanning tree, // Note: to get edges in minimum spanning tree, // the index value 0 is not used: it is just // the index value 0 is not used: it is just Loading pcbnew/ratsnest_data.cpp +1 −1 Original line number Original line Diff line number Diff line Loading @@ -240,7 +240,7 @@ void RN_NET::compute() return; return; } } else if( boardNodes.size() == 1 ) // This case is even simpler else if( boardNodes.size() == 1 || boardNodes.empty() ) // This case is even simpler { { m_rnEdges.reset( new std::vector<RN_EDGE_PTR>( 0 ) ); m_rnEdges.reset( new std::vector<RN_EDGE_PTR>( 0 ) ); Loading Loading
pcbnew/ratsnest.cpp +4 −1 Original line number Original line Diff line number Diff line Loading @@ -71,6 +71,9 @@ public: void MIN_SPAN_TREE_PADS::AddTreeToRatsnest( std::vector<RATSNEST_ITEM> &aRatsnestList ) void MIN_SPAN_TREE_PADS::AddTreeToRatsnest( std::vector<RATSNEST_ITEM> &aRatsnestList ) { { std::vector<D_PAD*>& padsBuffer = *m_PadsList; std::vector<D_PAD*>& padsBuffer = *m_PadsList; if( padsBuffer.empty() ) return; int netcode = padsBuffer[0]->GetNet(); int netcode = padsBuffer[0]->GetNet(); // Note: to get edges in minimum spanning tree, // Note: to get edges in minimum spanning tree, // the index value 0 is not used: it is just // the index value 0 is not used: it is just Loading
pcbnew/ratsnest_data.cpp +1 −1 Original line number Original line Diff line number Diff line Loading @@ -240,7 +240,7 @@ void RN_NET::compute() return; return; } } else if( boardNodes.size() == 1 ) // This case is even simpler else if( boardNodes.size() == 1 || boardNodes.empty() ) // This case is even simpler { { m_rnEdges.reset( new std::vector<RN_EDGE_PTR>( 0 ) ); m_rnEdges.reset( new std::vector<RN_EDGE_PTR>( 0 ) ); Loading