From 3c79ed375cd51b642011bc9bd4a0278826a1f4b5 Mon Sep 17 00:00:00 2001
From: Maciej Suminski <maciej.suminski@cern.ch>
Date: Fri, 10 Jan 2014 17:19:33 +0100
Subject: [PATCH] Made two functions immune to empty containers.

---
 pcbnew/ratsnest.cpp      | 5 ++++-
 pcbnew/ratsnest_data.cpp | 2 +-
 2 files changed, 5 insertions(+), 2 deletions(-)

diff --git a/pcbnew/ratsnest.cpp b/pcbnew/ratsnest.cpp
index 00cec1cea0..b5347d3e85 100644
--- a/pcbnew/ratsnest.cpp
+++ b/pcbnew/ratsnest.cpp
@@ -70,7 +70,10 @@ public:
 
 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();
     // Note: to get edges in minimum spanning tree,
     // the index value 0 is not used: it is just
diff --git a/pcbnew/ratsnest_data.cpp b/pcbnew/ratsnest_data.cpp
index e66451b86b..6ed72cfbe0 100644
--- a/pcbnew/ratsnest_data.cpp
+++ b/pcbnew/ratsnest_data.cpp
@@ -240,7 +240,7 @@ void RN_NET::compute()
 
         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 ) );