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