KiCad PCB EDA Suite
base_struct.cpp
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) 2015 Jean-Pierre Charras, jaen-pierre.charras@gipsa-lab.inpg.com
5  * Copyright (C) 1992-2019 KiCad Developers, see AUTHORS.txt for contributors.
6  *
7  * This program is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU General Public License
9  * as published by the Free Software Foundation; either version 2
10  * of the License, or (at your option) any later version.
11  *
12  * This program is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15  * GNU General Public License for more details.
16  *
17  * You should have received a copy of the GNU General Public License
18  * along with this program; if not, you may find one here:
19  * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
20  * or you may search the http://www.gnu.org website for the version 2 license,
21  * or you may write to the Free Software Foundation, Inc.,
22  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
23  */
24 
29 #include <deque>
30 
31 #include <fctsys.h>
32 #include <trigo.h>
33 #include <common.h>
34 #include <macros.h>
35 #include <base_screen.h>
36 #include <bitmaps.h>
37 #include <trace_helpers.h>
38 #include <eda_rect.h>
39 
40 
41 static const unsigned char dummy_png[] = {
42  0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52,
43  0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x08, 0x06, 0x00, 0x00, 0x00, 0x1f, 0xf3, 0xff,
44  0x61, 0x00, 0x00, 0x00, 0x5f, 0x49, 0x44, 0x41, 0x54, 0x38, 0xcb, 0x63, 0xf8, 0xff, 0xff, 0x3f,
45  0x03, 0x25, 0x98, 0x61, 0x68, 0x1a, 0x00, 0x04, 0x46, 0x40, 0xfc, 0x02, 0x88, 0x45, 0x41, 0x1c,
46  0x76, 0x20, 0xfe, 0x01, 0xc4, 0xbe, 0x24, 0x18, 0x60, 0x01, 0xc4, 0x20, 0x86, 0x04, 0x88, 0xc3,
47  0x01, 0xe5, 0x04, 0x0c, 0xb8, 0x01, 0x37, 0x81, 0xf8, 0x04, 0x91, 0xf8, 0x0a, 0x54, 0x8f, 0x06,
48  0xb2, 0x01, 0x9b, 0x81, 0x78, 0x02, 0x91, 0x78, 0x05, 0x54, 0x8f, 0xca, 0xe0, 0x08, 0x03, 0x36,
49  0xa8, 0xbf, 0xec, 0xc8, 0x32, 0x80, 0xcc, 0x84, 0x04, 0x0a, 0xbc, 0x1d, 0x40, 0x2c, 0xc8, 0x30,
50  0xf4, 0x33, 0x13, 0x00, 0x6b, 0x1a, 0x46, 0x7b, 0x68, 0xe7, 0x0f, 0x0b, 0x00, 0x00, 0x00, 0x00,
51  0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82,
52 };
53 
54 static const BITMAP_OPAQUE dummy_xpm[1] = {{ dummy_png, sizeof( dummy_png ), "dummy_xpm" }};
55 
56 
57 enum textbox {
59 };
60 
61 
63 {
64  initVars();
65  m_StructType = idType;
66  m_Parent = parent;
67 }
68 
69 
71 {
72  initVars();
73  m_StructType = idType;
74 }
75 
76 
78 {
79  initVars();
80  *this = base;
81 }
82 
83 
85 {
87  m_Parent = NULL; // Linked list: Link (parent struct)
88  m_Flags = 0; // flags for editions and other
89  SetTimeStamp( 0 ); // Time stamp used for logical links
90  m_Status = 0;
91  m_forceVisible = false; // true to override the visibility setting of the item.
92 }
93 
94 
96 {
98 
99  // If this a child object, then the parent modification state also needs to be set.
100  if( m_Parent )
102 }
103 
104 
106 {
107 #if defined(DEBUG)
108  printf( "Missing GetBoundingBox()\n" );
109  Show( 0, std::cout ); // tell me which classes still need GetBoundingBox support
110 #endif
111 
112  // return a zero-sized box per default. derived classes should override
113  // this
114  return EDA_RECT( wxPoint( 0, 0 ), wxSize( 0, 0 ) );
115 }
116 
117 
119 {
120  wxCHECK_MSG( false, NULL, wxT( "Clone not implemented in derived class " ) + GetClass() +
121  wxT( ". Bad programmer!" ) );
122 }
123 
124 
125 // see base_struct.h
126 // many classes inherit this method, be careful:
127 //TODO (snh): Fix this to use std::set instead of C-style vector
128 SEARCH_RESULT EDA_ITEM::Visit( INSPECTOR inspector, void* testData, const KICAD_T scanTypes[] )
129 {
130 #if 0 && defined(DEBUG)
131  std::cout << GetClass().mb_str() << ' ';
132 #endif
133 
134  if( IsType( scanTypes ) )
135  {
136  if( SEARCH_RESULT::QUIT == inspector( this, testData ) )
137  return SEARCH_RESULT::QUIT;
138  }
139 
141 }
142 
143 
144 wxString EDA_ITEM::GetSelectMenuText( EDA_UNITS aUnits ) const
145 {
146  wxFAIL_MSG( wxT( "GetSelectMenuText() was not overridden for schematic item type " ) +
147  GetClass() );
148 
149  return wxString( wxT( "Undefined menu text for " ) + GetClass() );
150 }
151 
152 
153 bool EDA_ITEM::Matches( const wxString& aText, wxFindReplaceData& aSearchData )
154 {
155  wxString text = aText;
156  wxString searchText = aSearchData.GetFindString();
157 
158  // Don't match if searching for replaceable item and the item doesn't support text replace.
159  if( (aSearchData.GetFlags() & FR_SEARCH_REPLACE) && !IsReplaceable() )
160  return false;
161 
162  if( aSearchData.GetFlags() & wxFR_WHOLEWORD )
163  return aText.IsSameAs( searchText, aSearchData.GetFlags() & wxFR_MATCHCASE );
164 
165  if( aSearchData.GetFlags() & FR_MATCH_WILDCARD )
166  {
167  if( aSearchData.GetFlags() & wxFR_MATCHCASE )
168  return text.Matches( searchText );
169 
170  return text.MakeUpper().Matches( searchText.MakeUpper() );
171  }
172 
173  if( aSearchData.GetFlags() & wxFR_MATCHCASE )
174  return aText.Find( searchText ) != wxNOT_FOUND;
175 
176  return text.MakeUpper().Find( searchText.MakeUpper() ) != wxNOT_FOUND;
177 }
178 
179 
180 bool EDA_ITEM::Replace( wxFindReplaceData& aSearchData, wxString& aText )
181 {
182  wxString searchString = (aSearchData.GetFlags() & wxFR_MATCHCASE) ? aText : aText.Upper();
183 
184  int result = searchString.Find( (aSearchData.GetFlags() & wxFR_MATCHCASE) ?
185  aSearchData.GetFindString() :
186  aSearchData.GetFindString().Upper() );
187 
188  if( result == wxNOT_FOUND )
189  return false;
190 
191  wxString prefix = aText.Left( result );
192  wxString suffix;
193 
194  if( aSearchData.GetFindString().length() + result < aText.length() )
195  suffix = aText.Right( aText.length() - ( aSearchData.GetFindString().length() + result ) );
196 
197  wxLogTrace( traceFindReplace, wxT( "Replacing '%s', prefix '%s', replace '%s', suffix '%s'." ),
198  GetChars( aText ), GetChars( prefix ), GetChars( aSearchData.GetReplaceString() ),
199  GetChars( suffix ) );
200 
201  aText = prefix + aSearchData.GetReplaceString() + suffix;
202 
203  return true;
204 }
205 
206 
207 bool EDA_ITEM::operator<( const EDA_ITEM& aItem ) const
208 {
209  wxFAIL_MSG( wxString::Format( wxT( "Less than operator not defined for item type %s." ),
210  GetChars( GetClass() ) ) );
211 
212  return false;
213 }
214 
216 {
217  // do not call initVars()
218 
219  m_StructType = aItem.m_StructType;
220  m_Flags = aItem.m_Flags;
221  m_Status = aItem.m_Status;
222  m_Parent = aItem.m_Parent;
224 
225  // A copy of an item cannot have the same time stamp as the original item.
227 
228  return *this;
229 }
230 
232 {
233  // Basic fallback
234  return BOX2I( VECTOR2I( GetBoundingBox().GetOrigin() ),
235  VECTOR2I( GetBoundingBox().GetSize() ) );
236 }
237 
238 
239 void EDA_ITEM::ViewGetLayers( int aLayers[], int& aCount ) const
240 {
241  // Basic fallback
242  aCount = 1;
243  aLayers[0] = 0;
244 }
245 
247 {
248  return dummy_xpm;
249 }
250 
251 #if defined(DEBUG)
252 
253 void EDA_ITEM::ShowDummy( std::ostream& os ) const
254 {
255  // XML output:
256  wxString s = GetClass();
257 
258  os << '<' << s.Lower().mb_str() << ">"
259  << " Need ::Show() override for this class "
260  << "</" << s.Lower().mb_str() << ">\n";
261 }
262 
263 
264 std::ostream& EDA_ITEM::NestedSpace( int nestLevel, std::ostream& os )
265 {
266  for( int i = 0; i<nestLevel; ++i )
267  os << " ";
268 
269  // number of spaces here controls indent per nest level
270 
271  return os;
272 }
273 
274 #endif
275 
276 
277 /******************/
278 /* Class EDA_RECT */
279 /******************/
280 
282 {
283  if( m_Size.y < 0 )
284  {
285  m_Size.y = -m_Size.y;
286  m_Pos.y -= m_Size.y;
287  }
288 
289  if( m_Size.x < 0 )
290  {
291  m_Size.x = -m_Size.x;
292  m_Pos.x -= m_Size.x;
293  }
294 }
295 
296 
297 void EDA_RECT::Move( const wxPoint& aMoveVector )
298 {
299  m_Pos += aMoveVector;
300 }
301 
302 
303 bool EDA_RECT::Contains( const wxPoint& aPoint ) const
304 {
305  wxPoint rel_pos = aPoint - m_Pos;
306  wxSize size = m_Size;
307 
308  if( size.x < 0 )
309  {
310  size.x = -size.x;
311  rel_pos.x += size.x;
312  }
313 
314  if( size.y < 0 )
315  {
316  size.y = -size.y;
317  rel_pos.y += size.y;
318  }
319 
320  return (rel_pos.x >= 0) && (rel_pos.y >= 0) && ( rel_pos.y <= size.y) && ( rel_pos.x <= size.x);
321 }
322 
323 
324 bool EDA_RECT::Contains( const EDA_RECT& aRect ) const
325 {
326  return Contains( aRect.GetOrigin() ) && Contains( aRect.GetEnd() );
327 }
328 
329 
330 bool EDA_RECT::Intersects( const wxPoint& aPoint1, const wxPoint& aPoint2 ) const
331 {
332  wxPoint point2, point4;
333 
334  if( Contains( aPoint1 ) || Contains( aPoint2 ) )
335  return true;
336 
337  point2.x = GetEnd().x;
338  point2.y = GetOrigin().y;
339  point4.x = GetOrigin().x;
340  point4.y = GetEnd().y;
341 
342  //Only need to test 3 sides since a straight line cant enter and exit on same side
343  if( SegmentIntersectsSegment( aPoint1, aPoint2, GetOrigin() , point2 ) )
344  return true;
345 
346  if( SegmentIntersectsSegment( aPoint1, aPoint2, point2 , GetEnd() ) )
347  return true;
348 
349  if( SegmentIntersectsSegment( aPoint1, aPoint2, GetEnd() , point4 ) )
350  return true;
351 
352  return false;
353 }
354 
355 
356 bool EDA_RECT::Intersects( const EDA_RECT& aRect ) const
357 {
358  if( !m_init )
359  return false;
360 
361  // this logic taken from wxWidgets' geometry.cpp file:
362  bool rc;
363  EDA_RECT me(*this);
364  EDA_RECT rect(aRect);
365  me.Normalize(); // ensure size is >= 0
366  rect.Normalize(); // ensure size is >= 0
367 
368  // calculate the left common area coordinate:
369  int left = std::max( me.m_Pos.x, rect.m_Pos.x );
370  // calculate the right common area coordinate:
371  int right = std::min( me.m_Pos.x + me.m_Size.x, rect.m_Pos.x + rect.m_Size.x );
372  // calculate the upper common area coordinate:
373  int top = std::max( me.m_Pos.y, aRect.m_Pos.y );
374  // calculate the lower common area coordinate:
375  int bottom = std::min( me.m_Pos.y + me.m_Size.y, rect.m_Pos.y + rect.m_Size.y );
376 
377  // if a common area exists, it must have a positive (null accepted) size
378  if( left <= right && top <= bottom )
379  rc = true;
380  else
381  rc = false;
382 
383  return rc;
384 }
385 
386 
387 bool EDA_RECT::Intersects( const EDA_RECT& aRect, double aRot ) const
388 {
389  if( !m_init )
390  return false;
391 
392  /* Most rectangles will be axis aligned.
393  * It is quicker to check for this case and pass the rect
394  * to the simpler intersection test
395  */
396 
397  // Prevent floating point comparison errors
398  static const double ROT_EPS = 0.000000001;
399 
400  static const double ROT_PARALLEL[] = { -3600, -1800, 0, 1800, 3600 };
401  static const double ROT_PERPENDICULAR[] = { -2700, -900, 0, 900, 2700 };
402 
403  NORMALIZE_ANGLE_POS<double>( aRot );
404 
405  // Test for non-rotated rectangle
406  for( int ii = 0; ii < 5; ii++ )
407  {
408  if( std::fabs( aRot - ROT_PARALLEL[ii] ) < ROT_EPS )
409  {
410  return Intersects( aRect );
411  }
412  }
413 
414  // Test for rectangle rotated by multiple of 90 degrees
415  for( int jj = 0; jj < 4; jj++ )
416  {
417  if( std::fabs( aRot - ROT_PERPENDICULAR[jj] ) < ROT_EPS )
418  {
419  EDA_RECT rotRect;
420 
421  // Rotate the supplied rect by 90 degrees
422  rotRect.SetOrigin( aRect.Centre() );
423  rotRect.Inflate( aRect.GetHeight(), aRect.GetWidth() );
424  return Intersects( rotRect );
425  }
426  }
427 
428  /* There is some non-orthogonal rotation.
429  * There are three cases to test:
430  * A) One point of this rect is inside the rotated rect
431  * B) One point of the rotated rect is inside this rect
432  * C) One of the sides of the rotated rect intersect this
433  */
434 
435  wxPoint corners[4];
436 
437  /* Test A : Any corners exist in rotated rect? */
438 
439  corners[0] = m_Pos;
440  corners[1] = m_Pos + wxPoint( m_Size.x, 0 );
441  corners[2] = m_Pos + wxPoint( m_Size.x, m_Size.y );
442  corners[3] = m_Pos + wxPoint( 0, m_Size.y );
443 
444  wxPoint rCentre = aRect.Centre();
445 
446  for( int i = 0; i < 4; i++ )
447  {
448  wxPoint delta = corners[i] - rCentre;
449  RotatePoint( &delta, -aRot );
450  delta += rCentre;
451 
452  if( aRect.Contains( delta ) )
453  {
454  return true;
455  }
456  }
457 
458  /* Test B : Any corners of rotated rect exist in this one? */
459  int w = aRect.GetWidth() / 2;
460  int h = aRect.GetHeight() / 2;
461 
462  // Construct corners around center of shape
463  corners[0] = wxPoint( -w, -h );
464  corners[1] = wxPoint( w, -h );
465  corners[2] = wxPoint( w, h );
466  corners[3] = wxPoint( -w, h );
467 
468  // Rotate and test each corner
469  for( int j=0; j<4; j++ )
470  {
471  RotatePoint( &corners[j], aRot );
472  corners[j] += rCentre;
473 
474  if( Contains( corners[j] ) )
475  {
476  return true;
477  }
478  }
479 
480  /* Test C : Any sides of rotated rect intersect this */
481 
482  if( Intersects( corners[0], corners[1] ) ||
483  Intersects( corners[1], corners[2] ) ||
484  Intersects( corners[2], corners[3] ) ||
485  Intersects( corners[3], corners[0] ) )
486  {
487  return true;
488  }
489 
490 
491  return false;
492 }
493 
494 
495 const wxPoint EDA_RECT::ClosestPointTo( const wxPoint& aPoint ) const
496 {
497  EDA_RECT me( *this );
498 
499  me.Normalize(); // ensure size is >= 0
500 
501  // Determine closest point to the circle centre within this rect
502  int nx = std::max( me.GetLeft(), std::min( aPoint.x, me.GetRight() ) );
503  int ny = std::max( me.GetTop(), std::min( aPoint.y, me.GetBottom() ) );
504 
505  return wxPoint( nx, ny );
506 }
507 
508 
509 const wxPoint EDA_RECT::FarthestPointTo( const wxPoint& aPoint ) const
510 {
511  EDA_RECT me( *this );
512 
513  me.Normalize(); // ensure size is >= 0
514 
515  int fx = std::max( std::abs( aPoint.x - me.GetLeft() ), std::abs( aPoint.x - me.GetRight() ) );
516  int fy = std::max( std::abs( aPoint.y - me.GetTop() ), std::abs( aPoint.y - me.GetBottom() ) );
517 
518  return wxPoint( fx, fy );
519 }
520 
521 
522 bool EDA_RECT::IntersectsCircle( const wxPoint& aCenter, const int aRadius ) const
523 {
524  if( !m_init )
525  return false;
526 
527  wxPoint closest = ClosestPointTo( aCenter );
528 
529  double dx = aCenter.x - closest.x;
530  double dy = aCenter.y - closest.y;
531 
532  double r = (double) aRadius;
533 
534  return ( dx * dx + dy * dy ) <= ( r * r );
535 }
536 
537 
538 bool EDA_RECT::IntersectsCircleEdge( const wxPoint& aCenter, const int aRadius, const int aWidth ) const
539 {
540  if( !m_init )
541  return false;
542 
543  EDA_RECT me( *this );
544  me.Normalize(); // ensure size is >= 0
545 
546  // Test if the circle intersects at all
547  if( !IntersectsCircle( aCenter, aRadius + aWidth / 2 ) )
548  {
549  return false;
550  }
551 
552  wxPoint farpt = FarthestPointTo( aCenter );
553  // Farthest point must be further than the inside of the line
554  double fx = (double) farpt.x;
555  double fy = (double) farpt.y;
556 
557  double r = (double) aRadius - (double) aWidth / 2;
558 
559  return ( fx * fx + fy * fy ) > ( r * r );
560 }
561 
562 
564 {
565  Inflate( aDelta, aDelta );
566  return *this;
567 }
568 
569 
570 EDA_RECT& EDA_RECT::Inflate( wxCoord dx, wxCoord dy )
571 {
572  if( m_Size.x >= 0 )
573  {
574  if( m_Size.x < -2 * dx )
575  {
576  // Don't allow deflate to eat more width than we have,
577  m_Pos.x += m_Size.x / 2;
578  m_Size.x = 0;
579  }
580  else
581  {
582  // The inflate is valid.
583  m_Pos.x -= dx;
584  m_Size.x += 2 * dx;
585  }
586  }
587  else // size.x < 0:
588  {
589  if( m_Size.x > -2 * dx )
590  {
591  // Don't allow deflate to eat more width than we have,
592  m_Pos.x -= m_Size.x / 2;
593  m_Size.x = 0;
594  }
595  else
596  {
597  // The inflate is valid.
598  m_Pos.x += dx;
599  m_Size.x -= 2 * dx; // m_Size.x <0: inflate when dx > 0
600  }
601  }
602 
603  if( m_Size.y >= 0 )
604  {
605  if( m_Size.y < -2 * dy )
606  {
607  // Don't allow deflate to eat more height than we have,
608  m_Pos.y += m_Size.y / 2;
609  m_Size.y = 0;
610  }
611  else
612  {
613  // The inflate is valid.
614  m_Pos.y -= dy;
615  m_Size.y += 2 * dy;
616  }
617  }
618  else // size.y < 0:
619  {
620  if( m_Size.y > 2 * dy )
621  {
622  // Don't allow deflate to eat more height than we have,
623  m_Pos.y -= m_Size.y / 2;
624  m_Size.y = 0;
625  }
626  else
627  {
628  // The inflate is valid.
629  m_Pos.y += dy;
630  m_Size.y -= 2 * dy; // m_Size.y <0: inflate when dy > 0
631  }
632  }
633 
634  return *this;
635 }
636 
637 
638 void EDA_RECT::Merge( const EDA_RECT& aRect )
639 {
640  if( !m_init )
641  {
642  if( aRect.IsValid() )
643  {
644  m_Pos = aRect.GetPosition();
645  m_Size = aRect.GetSize();
646  m_init = true;
647  }
648  return;
649  }
650 
651  Normalize(); // ensure width and height >= 0
652  EDA_RECT rect = aRect;
653  rect.Normalize(); // ensure width and height >= 0
654  wxPoint end = GetEnd();
655  wxPoint rect_end = rect.GetEnd();
656 
657  // Change origin and size in order to contain the given rect
658  m_Pos.x = std::min( m_Pos.x, rect.m_Pos.x );
659  m_Pos.y = std::min( m_Pos.y, rect.m_Pos.y );
660  end.x = std::max( end.x, rect_end.x );
661  end.y = std::max( end.y, rect_end.y );
662  SetEnd( end );
663 }
664 
665 
666 void EDA_RECT::Merge( const wxPoint& aPoint )
667 {
668  if( !m_init )
669  {
670  m_Pos = aPoint;
671  m_Size = wxSize( 0, 0 );
672  return;
673  }
674 
675  Normalize(); // ensure width and height >= 0
676 
677  wxPoint end = GetEnd();
678  // Change origin and size in order to contain the given rect
679  m_Pos.x = std::min( m_Pos.x, aPoint.x );
680  m_Pos.y = std::min( m_Pos.y, aPoint.y );
681  end.x = std::max( end.x, aPoint.x );
682  end.y = std::max( end.y, aPoint.y );
683  SetEnd( end );
684 }
685 
686 
687 double EDA_RECT::GetArea() const
688 {
689  return (double) GetWidth() * (double) GetHeight();
690 }
691 
692 
693 EDA_RECT EDA_RECT::Common( const EDA_RECT& aRect ) const
694 {
695  EDA_RECT r;
696 
697  if( Intersects( aRect ) )
698  {
699  wxPoint originA( std::min( GetOrigin().x, GetEnd().x ),
700  std::min( GetOrigin().y, GetEnd().y ) );
701  wxPoint originB( std::min( aRect.GetOrigin().x, aRect.GetEnd().x ),
702  std::min( aRect.GetOrigin().y, aRect.GetEnd().y ) );
703  wxPoint endA( std::max( GetOrigin().x, GetEnd().x ),
704  std::max( GetOrigin().y, GetEnd().y ) );
705  wxPoint endB( std::max( aRect.GetOrigin().x, aRect.GetEnd().x ),
706  std::max( aRect.GetOrigin().y, aRect.GetEnd().y ) );
707 
708  r.SetOrigin( wxPoint( std::max( originA.x, originB.x ), std::max( originA.y, originB.y ) ) );
709  r.SetEnd ( wxPoint( std::min( endA.x, endB.x ), std::min( endA.y, endB.y ) ) );
710  }
711 
712  return r;
713 }
714 
715 
716 const EDA_RECT EDA_RECT::GetBoundingBoxRotated( wxPoint aRotCenter, double aAngle )
717 {
718  wxPoint corners[4];
719 
720  // Build the corners list
721  corners[0] = GetOrigin();
722  corners[2] = GetEnd();
723  corners[1].x = corners[0].x;
724  corners[1].y = corners[2].y;
725  corners[3].x = corners[2].x;
726  corners[3].y = corners[0].y;
727 
728  // Rotate all corners, to find the bounding box
729  for( int ii = 0; ii < 4; ii ++ )
730  RotatePoint( &corners[ii], aRotCenter, aAngle );
731 
732  // Find the corners bounding box
733  wxPoint start = corners[0];
734  wxPoint end = corners[0];
735 
736  for( int ii = 1; ii < 4; ii ++ )
737  {
738  start.x = std::min( start.x, corners[ii].x);
739  start.y = std::min( start.y, corners[ii].y);
740  end.x = std::max( end.x, corners[ii].x);
741  end.y = std::max( end.y, corners[ii].y);
742  }
743 
744  EDA_RECT bbox;
745  bbox.SetOrigin( start );
746  bbox.SetEnd( end );
747 
748  return bbox;
749 }
EDA_UNITS
Definition: common.h:72
void SetModified()
Definition: base_struct.cpp:95
virtual SEARCH_RESULT Visit(INSPECTOR inspector, void *testData, const KICAD_T scanTypes[])
Function Visit may be re-implemented for each derived class in order to handle all the types given by...
BOX2< VECTOR2I > BOX2I
Definition: box2.h:521
EDA_ITEM * m_Parent
Linked list: Link (parent struct)
Definition: base_struct.h:177
void Move(const wxPoint &aMoveVector)
Function Move moves the rectangle by the aMoveVector.
bool operator<(const EDA_ITEM &aItem) const
Test if another item is less than this object.
const wxChar *const traceFindReplace
Flag to enable find and replace debug tracing.
void Merge(const EDA_RECT &aRect)
Function Merge modifies the position and size of the rectangle in order to contain aRect.
PNG memory record (file in memory).
Definition: bitmap_def.h:29
KICAD_T m_StructType
Run time identification, keep private so it can never be changed after a constructor sets it.
Definition: base_struct.h:172
static bool Replace(wxFindReplaceData &aSearchData, wxString &aText)
Helper function used in search and replace dialog Function Replace performs a text replace on aText u...
int GetTop() const
Definition: eda_rect.h:123
int GetLeft() const
Definition: eda_rect.h:122
int GetWidth() const
Definition: eda_rect.h:119
bool IntersectsCircle(const wxPoint &aCenter, const int aRadius) const
Function IntersectsCircle tests for a common area between a circle and this rectangle.
void SetOrigin(const wxPoint &pos)
Definition: eda_rect.h:131
bool IntersectsCircleEdge(const wxPoint &aCenter, const int aRadius, const int aWidth) const
IntersectsCircleEdge Tests for intersection between this rect and the edge (radius) of a circle.
EDA_RECT Common(const EDA_RECT &aRect) const
Function Common returns the area that is common with another rectangle.
void RotatePoint(int *pX, int *pY, double angle)
Definition: trigo.cpp:208
VECTOR2< int > VECTOR2I
Definition: vector2d.h:594
bool Contains(const wxPoint &aPoint) const
Function Contains.
KICAD_T
Enum KICAD_T is the set of class identification values, stored in EDA_ITEM::m_StructType.
Definition: typeinfo.h:78
virtual EDA_ITEM * Clone() const
Function Clone creates a duplicate of this item with linked list members set to NULL.
This file contains miscellaneous commonly used macros and functions.
int GetBottom() const
Definition: eda_rect.h:124
bool SegmentIntersectsSegment(const wxPoint &a_p1_l1, const wxPoint &a_p2_l1, const wxPoint &a_p1_l2, const wxPoint &a_p2_l2, wxPoint *aIntersectionPoint=nullptr)
Function SegmentIntersectsSegment.
Definition: trigo.cpp:61
const INSPECTOR_FUNC & INSPECTOR
Definition: base_struct.h:108
const wxPoint GetEnd() const
Definition: eda_rect.h:116
timestamp_t GetNewTimeStamp()
Definition: common.cpp:215
#define IS_CHANGED
std::function passed to nested users by ref, avoids copying std::function
Definition: base_struct.h:116
wxSize m_Size
Definition: eda_rect.h:48
void SetFlags(STATUS_FLAGS aMask)
Definition: base_struct.h:255
#define NULL
virtual void ViewGetLayers(int aLayers[], int &aCount) const override
Function ViewGetLayers() Returns the all the layers within the VIEW the object is painted on.
const wxPoint GetOrigin() const
Definition: eda_rect.h:114
void SetEnd(int x, int y)
Definition: eda_rect.h:192
STATUS_FLAGS m_Status
Definition: base_struct.h:173
const wxPoint GetPosition() const
Definition: eda_rect.h:115
const EDA_RECT GetBoundingBoxRotated(wxPoint aRotCenter, double aAngle)
Function GetBoundingBoxRotated.
const wxPoint FarthestPointTo(const wxPoint &aPoint) const
Return the point in this rect that is farthest from the provided point.
int GetRight() const
Definition: eda_rect.h:121
wxLogTrace helper definitions.
virtual bool IsType(const KICAD_T aScanTypes[]) const
Function IsType Checks whether the item is one of the listed types.
Definition: base_struct.h:284
double GetArea() const
Function GetArea returns the area of the rectangle.
EDA_ITEM & operator=(const EDA_ITEM &aItem)
Operator assignment is used to assign the members of aItem to another object.
int GetHeight() const
Definition: eda_rect.h:120
EDA_ITEM(EDA_ITEM *parent, KICAD_T idType)
Definition: base_struct.cpp:62
void Normalize()
Function Normalize ensures that the height ant width are positive.
static const wxChar * GetChars(const wxString &s)
Function GetChars returns a wxChar* to the actual wxChar* data within a wxString, and is helpful for ...
Definition: macros.h:101
virtual wxString GetClass() const =0
Function GetClass returns the class name.
void Format(OUTPUTFORMATTER *out, int aNestLevel, int aCtl, CPTREE &aTree)
Function Format outputs a PTREE into s-expression format via an OUTPUTFORMATTER derivative.
Definition: ptree.cpp:205
bool m_init
Definition: eda_rect.h:49
virtual wxString GetSelectMenuText(EDA_UNITS aUnits) const
Function GetSelectMenuText returns the text to display to be used in the selection clarification cont...
STATUS_FLAGS m_Flags
Flag bits for editing and other uses.
Definition: base_struct.h:184
virtual bool IsReplaceable() const
Function IsReplaceable.
Definition: base_struct.h:515
EDA_RECT handles the component boundary box.
Definition: eda_rect.h:44
wxPoint m_Pos
Definition: eda_rect.h:47
static const BITMAP_OPAQUE dummy_xpm[1]
Definition: base_struct.cpp:54
EDA_ITEM is a base class for most all the KiCad significant classes, used in schematics and boards.
Definition: base_struct.h:163
The common library.
wxPoint Centre() const
Definition: eda_rect.h:62
bool Intersects(const EDA_RECT &aRect) const
Function Intersects tests for a common area between rectangles.
virtual const EDA_RECT GetBoundingBox() const
Function GetBoundingBox returns the orthogonal, bounding box of this object for display purposes.
bool IsValid() const
Definition: eda_rect.h:126
static const unsigned char dummy_png[]
Implementation of EDA_ITEM base class for KiCad.
Definition: base_struct.cpp:41
SEARCH_RESULT
Definition: base_struct.h:54
BASE_SCREEN class implementation.
virtual const BOX2I ViewBBox() const override
Function ViewBBox() returns the bounding box of the item covering all its layers.
bool m_forceVisible
Set to true to override the visibility setting of the item.
Definition: base_struct.h:181
virtual BITMAP_DEF GetMenuImage() const
Function GetMenuImage returns a pointer to an image to be used in menus.
void initVars()
Definition: base_struct.cpp:84
virtual bool Matches(wxFindReplaceData &aSearchData, void *aAuxData)
Function Matches compares the item against the search criteria in aSearchData.
Definition: base_struct.h:471
EDA_RECT & Inflate(wxCoord dx, wxCoord dy)
Function Inflate inflates the rectangle horizontally by dx and vertically by dy.
const wxSize GetSize() const
Definition: eda_rect.h:103
void SetTimeStamp(timestamp_t aNewTimeStamp)
Definition: base_struct.h:212
const wxPoint ClosestPointTo(const wxPoint &aPoint) const
Return the point in this rect that is closest to the provided point.
textbox
Definition: base_struct.cpp:57