KiCad PCB EDA Suite
connectivity_data.h
Go to the documentation of this file.
1 /*
2  * This program source code file is part of KICAD, a free EDA CAD application.
3  *
4  * Copyright (C) 2013-2017 CERN
5  * @author Maciej Suminski <maciej.suminski@cern.ch>
6  * @author Tomasz Wlostowski <tomasz.wlostowski@cern.ch>
7  *
8  * This program is free software; you can redistribute it and/or
9  * modify it under the terms of the GNU General Public License
10  * as published by the Free Software Foundation; either version 2
11  * of the License, or (at your option) any later version.
12  *
13  * This program is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  * GNU General Public License for more details.
17  *
18  * You should have received a copy of the GNU General Public License
19  * along with this program; if not, you may find one here:
20  * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
21  * or you may search the http://www.gnu.org website for the version 2 license,
22  * or you may write to the Free Software Foundation, Inc.,
23  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
24  */
25 
26 #ifndef __CONNECTIVITY_DATA_H
27 #define __CONNECTIVITY_DATA_H
28 
29 #include <core/typeinfo.h>
30 #include <core/lockable.h>
31 
32 #include <wx/string.h>
33 #include <vector>
34 #include <memory>
35 
36 #include <math/vector2d.h>
38 #include <class_zone.h>
39 
40 class CN_CLUSTER;
42 class CN_EDGE;
43 class BOARD;
45 class BOARD_ITEM;
46 class ZONE_CONTAINER;
47 class RN_DATA;
48 class RN_NET;
49 class TRACK;
50 class D_PAD;
51 class PROGRESS_REPORTER;
52 
54 {
55  int net;
58 };
59 
61 {
63  m_zone( aZone ),
64  m_lastPolys( aZone->GetFilledPolysList() )
65  {}
66 
69  std::vector<int> m_islands;
70 };
71 
73 {
74  int netCode;
76 };
77 
78 // a wrapper class encompassing the connectivity computation algorithm and the
80 {
81 public:
84 
85 
90  void Build( BOARD* aBoard );
91 
96  void Build( const std::vector<BOARD_ITEM*>& aItems );
97 
104  bool Add( BOARD_ITEM* aItem );
105 
112  bool Remove( BOARD_ITEM* aItem );
113 
120  bool Update( BOARD_ITEM* aItem );
121 
126  void Clear();
127 
132  int GetNetCount() const;
133 
138  RN_NET* GetRatsnestForNet( int aNet );
139 
144  void PropagateNets();
145 
146  bool CheckConnectivity( std::vector<CN_DISJOINT_NET_ENTRY>& aReport );
147 
154  void FindIsolatedCopperIslands( ZONE_CONTAINER* aZone, std::vector<int>& aIslands );
155  void FindIsolatedCopperIslands( std::vector<CN_ZONE_ISOLATED_ISLAND_LIST>& aZones );
156 
161  void RecalculateRatsnest();
162 
167  unsigned int GetUnconnectedCount() const;
168 
169  unsigned int GetNodeCount( int aNet = -1 ) const;
170 
171  unsigned int GetPadCount( int aNet = -1 ) const;
172 
173  const std::vector<TRACK*> GetConnectedTracks( const BOARD_CONNECTED_ITEM* aItem ) const;
174 
175  const std::vector<D_PAD*> GetConnectedPads( const BOARD_CONNECTED_ITEM* aItem ) const;
176 
177  const std::vector<BOARD_CONNECTED_ITEM*> GetConnectedItems( const BOARD_CONNECTED_ITEM* aItem, const VECTOR2I& aAnchor, KICAD_T aTypes[] );
178 
179  void GetUnconnectedEdges( std::vector<CN_EDGE>& aEdges ) const;
180 
186  void ClearDynamicRatsnest();
187 
191  void HideDynamicRatsnest();
192 
198  void ComputeDynamicRatsnest( const std::vector<BOARD_ITEM*>& aItems );
199 
200  const std::vector<RN_DYNAMIC_LINE>& GetDynamicRatsnest() const
201  {
202  return m_dynamicRatsnest;
203  }
204 
211  const std::vector<BOARD_CONNECTED_ITEM*> GetConnectedItems( const BOARD_CONNECTED_ITEM* aItem,
212  const KICAD_T aTypes[] ) const;
213 
220  const std::vector<BOARD_CONNECTED_ITEM*> GetNetItems( int aNetCode,
221  const KICAD_T aTypes[] ) const;
222 
223  const std::vector<VECTOR2I> NearestUnconnectedTargets( const BOARD_CONNECTED_ITEM* aRef,
224  const VECTOR2I& aPos,
225  int aMaxCount = -1 );
226 
227  void BlockRatsnestItems( const std::vector<BOARD_ITEM*>& aItems );
228 
229  std::shared_ptr<CN_CONNECTIVITY_ALGO> GetConnectivityAlgo() const
230  {
231  return m_connAlgo;
232  }
233 
234  void MarkItemNetAsDirty( BOARD_ITEM* aItem );
235 
236  void SetProgressReporter( PROGRESS_REPORTER* aReporter );
237 
238 private:
239 
240  void updateRatsnest();
241  void addRatsnestCluster( const std::shared_ptr<CN_CLUSTER>& aCluster );
242 
243  std::unique_ptr<CONNECTIVITY_DATA> m_dynamicConnectivity;
244  std::shared_ptr<CN_CONNECTIVITY_ALGO> m_connAlgo;
245 
246  std::vector<RN_DYNAMIC_LINE> m_dynamicRatsnest;
247  std::vector<RN_NET*> m_nets;
248 
250 };
251 
252 #endif
Class ZONE_CONTAINER handles a list of polygons defining a copper zone.
Definition: class_zone.h:60
std::shared_ptr< CN_CONNECTIVITY_ALGO > GetConnectivityAlgo() const
Class BOARD_ITEM is a base class for any item which can be embedded within the BOARD container class...
A progress reporter for use in multi-threaded environments.
std::shared_ptr< CN_CONNECTIVITY_ALGO > m_connAlgo
PROGRESS_REPORTER * m_progressReporter
Classes to handle copper zones.
const SHAPE_POLY_SET m_lastPolys
BOARD_CONNECTED_ITEM * b
Class BOARD_CONNECTED_ITEM is a base class derived from BOARD_ITEM for items that can be connected an...
std::vector< RN_DYNAMIC_LINE > m_dynamicRatsnest
VECTOR2I anchorB
KICAD_T
Enum KICAD_T is the set of class identification values, stored in EDA_ITEM::m_StructType.
Definition: typeinfo.h:78
const std::vector< RN_DYNAMIC_LINE > & GetDynamicRatsnest() const
VECTOR2I anchorA
Class SHAPE_POLY_SET.
CN_ZONE_ISOLATED_ISLAND_LIST(ZONE_CONTAINER *aZone)
std::unique_ptr< CONNECTIVITY_DATA > m_dynamicConnectivity
std::vector< RN_NET * > m_nets
BOARD_CONNECTED_ITEM * a
Class BOARD holds information pertinent to a Pcbnew printed circuit board.
Definition: class_board.h:169
int net
Class RN_NET Describes ratsnest for a single net.
Definition: ratsnest_data.h:59