You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

761 lines
23 KiB

4 years ago
  1. /*
  2. * This program source code file is part of KiCad, a free EDA CAD application.
  3. *
  4. * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version 2
  9. * of the License, or (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, you may find one here:
  18. * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
  19. * or you may search the http://www.gnu.org website for the version 2 license,
  20. * or you may write to the Free Software Foundation, Inc.,
  21. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
  22. */
  23. #include <wx/wupdlock.h>
  24. #include <wx/dataview.h>
  25. #include <wx/settings.h>
  26. #include <widgets/ui_common.h>
  27. #include <marker_base.h>
  28. #include <eda_draw_frame.h>
  29. #include <rc_item.h>
  30. #include <rc_json_schema.h>
  31. #include <eda_item.h>
  32. #include <base_units.h>
  33. #define WX_DATAVIEW_WINDOW_PADDING 6
  34. wxString RC_ITEM::GetErrorMessage() const
  35. {
  36. if( m_errorMessage.IsEmpty() )
  37. return GetErrorText();
  38. else
  39. return m_errorMessage;
  40. }
  41. static wxString showCoord( UNITS_PROVIDER* aUnitsProvider, const VECTOR2I& aPos )
  42. {
  43. return wxString::Format( wxT( "@(%s, %s)" ),
  44. aUnitsProvider->MessageTextFromValue( aPos.x ),
  45. aUnitsProvider->MessageTextFromValue( aPos.y ) );
  46. }
  47. void RC_ITEM::AddItem( EDA_ITEM* aItem )
  48. {
  49. m_ids.push_back( aItem->m_Uuid );
  50. }
  51. void RC_ITEM::SetItems( const EDA_ITEM* aItem, const EDA_ITEM* bItem,
  52. const EDA_ITEM* cItem, const EDA_ITEM* dItem )
  53. {
  54. m_ids.clear();
  55. if( aItem )
  56. m_ids.push_back( aItem->m_Uuid );
  57. if( bItem )
  58. m_ids.push_back( bItem->m_Uuid );
  59. if( cItem )
  60. m_ids.push_back( cItem->m_Uuid );
  61. if( dItem )
  62. m_ids.push_back( dItem->m_Uuid );
  63. }
  64. wxString RC_ITEM::getSeverityString( SEVERITY aSeverity )
  65. {
  66. wxString severity;
  67. switch( aSeverity )
  68. {
  69. case RPT_SEVERITY_ERROR: severity = wxS( "error" ); break;
  70. case RPT_SEVERITY_WARNING: severity = wxS( "warning" ); break;
  71. case RPT_SEVERITY_ACTION: severity = wxS( "action" ); break;
  72. case RPT_SEVERITY_INFO: severity = wxS( "info" ); break;
  73. case RPT_SEVERITY_EXCLUSION: severity = wxS( "exclusion" ); break;
  74. case RPT_SEVERITY_DEBUG: severity = wxS( "debug" ); break;
  75. default:;
  76. };
  77. return severity;
  78. }
  79. wxString RC_ITEM::ShowReport( UNITS_PROVIDER* aUnitsProvider, SEVERITY aSeverity,
  80. const std::map<KIID, EDA_ITEM*>& aItemMap ) const
  81. {
  82. wxString severity = getSeverityString( aSeverity );
  83. if( m_parent && m_parent->IsExcluded() )
  84. severity += wxT( " (excluded)" );
  85. EDA_ITEM* mainItem = nullptr;
  86. EDA_ITEM* auxItem = nullptr;
  87. auto ii = aItemMap.find( GetMainItemID() );
  88. if( ii != aItemMap.end() )
  89. mainItem = ii->second;
  90. ii = aItemMap.find( GetAuxItemID() );
  91. if( ii != aItemMap.end() )
  92. auxItem = ii->second;
  93. // Note: some customers machine-process these. So:
  94. // 1) don't translate
  95. // 2) try not to re-order or change syntax
  96. // 3) report settings key (which should be more stable) in addition to message
  97. wxString msg;
  98. if( mainItem && auxItem )
  99. {
  100. msg.Printf( wxT( "[%s]: %s\n %s; %s\n %s: %s\n %s: %s\n" ),
  101. GetSettingsKey(),
  102. GetErrorMessage(),
  103. GetViolatingRuleDesc(),
  104. severity,
  105. showCoord( aUnitsProvider, mainItem->GetPosition()),
  106. mainItem->GetItemDescription( aUnitsProvider, true ),
  107. showCoord( aUnitsProvider, auxItem->GetPosition()),
  108. auxItem->GetItemDescription( aUnitsProvider, true ) );
  109. }
  110. else if( mainItem )
  111. {
  112. msg.Printf( wxT( "[%s]: %s\n %s; %s\n %s: %s\n" ),
  113. GetSettingsKey(),
  114. GetErrorMessage(),
  115. GetViolatingRuleDesc(),
  116. severity,
  117. showCoord( aUnitsProvider, mainItem->GetPosition()),
  118. mainItem->GetItemDescription( aUnitsProvider, true ) );
  119. }
  120. else
  121. {
  122. msg.Printf( wxT( "[%s]: %s\n %s; %s\n" ),
  123. GetSettingsKey(),
  124. GetErrorMessage(),
  125. GetViolatingRuleDesc(),
  126. severity );
  127. }
  128. if( m_parent && m_parent->IsExcluded() && !m_parent->GetComment().IsEmpty() )
  129. msg += wxString::Format( wxS( " %s\n" ), m_parent->GetComment() );
  130. return msg;
  131. }
  132. void RC_ITEM::GetJsonViolation( RC_JSON::VIOLATION& aViolation, UNITS_PROVIDER* aUnitsProvider,
  133. SEVERITY aSeverity,
  134. const std::map<KIID, EDA_ITEM*>& aItemMap ) const
  135. {
  136. wxString severity = getSeverityString( aSeverity );
  137. aViolation.severity = severity;
  138. aViolation.description = GetErrorMessage();
  139. aViolation.type = GetSettingsKey();
  140. aViolation.excluded = ( m_parent && m_parent->IsExcluded() );
  141. EDA_ITEM* mainItem = nullptr;
  142. EDA_ITEM* auxItem = nullptr;
  143. auto ii = aItemMap.find( GetMainItemID() );
  144. if( ii != aItemMap.end() )
  145. mainItem = ii->second;
  146. ii = aItemMap.find( GetAuxItemID() );
  147. if( ii != aItemMap.end() )
  148. auxItem = ii->second;
  149. if( mainItem )
  150. {
  151. RC_JSON::AFFECTED_ITEM item;
  152. item.description = mainItem->GetItemDescription( aUnitsProvider, true );
  153. item.uuid = mainItem->m_Uuid.AsString();
  154. item.pos.x = EDA_UNIT_UTILS::UI::ToUserUnit( aUnitsProvider->GetIuScale(),
  155. aUnitsProvider->GetUserUnits(),
  156. mainItem->GetPosition().x );
  157. item.pos.y = EDA_UNIT_UTILS::UI::ToUserUnit( aUnitsProvider->GetIuScale(),
  158. aUnitsProvider->GetUserUnits(),
  159. mainItem->GetPosition().y );
  160. aViolation.items.emplace_back( item );
  161. }
  162. if( auxItem )
  163. {
  164. RC_JSON::AFFECTED_ITEM item;
  165. item.description = auxItem->GetItemDescription( aUnitsProvider, true );
  166. item.uuid = auxItem->m_Uuid.AsString();
  167. item.pos.x = EDA_UNIT_UTILS::UI::ToUserUnit( aUnitsProvider->GetIuScale(),
  168. aUnitsProvider->GetUserUnits(),
  169. auxItem->GetPosition().x );
  170. item.pos.y = EDA_UNIT_UTILS::UI::ToUserUnit( aUnitsProvider->GetIuScale(),
  171. aUnitsProvider->GetUserUnits(),
  172. auxItem->GetPosition().y );
  173. aViolation.items.emplace_back( item );
  174. }
  175. }
  176. KIID RC_TREE_MODEL::ToUUID( wxDataViewItem aItem )
  177. {
  178. const RC_TREE_NODE* node = RC_TREE_MODEL::ToNode( aItem );
  179. if( node && node->m_RcItem )
  180. {
  181. const std::shared_ptr<RC_ITEM> rc_item = node->m_RcItem;
  182. switch( node->m_Type )
  183. {
  184. case RC_TREE_NODE::MARKER:
  185. case RC_TREE_NODE::COMMENT:
  186. // rc_item->GetParent() can be null, if the parent is not existing
  187. // when a RC item has no corresponding ERC/DRC marker
  188. if( rc_item->GetParent() )
  189. return rc_item->GetParent()->GetUUID();
  190. break;
  191. case RC_TREE_NODE::MAIN_ITEM: return rc_item->GetMainItemID();
  192. case RC_TREE_NODE::AUX_ITEM: return rc_item->GetAuxItemID();
  193. case RC_TREE_NODE::AUX_ITEM2: return rc_item->GetAuxItem2ID();
  194. case RC_TREE_NODE::AUX_ITEM3: return rc_item->GetAuxItem3ID();
  195. }
  196. }
  197. return niluuid;
  198. }
  199. RC_TREE_MODEL::RC_TREE_MODEL( EDA_DRAW_FRAME* aParentFrame, wxDataViewCtrl* aView ) :
  200. m_editFrame( aParentFrame ),
  201. m_view( aView ),
  202. m_severities( 0 ),
  203. m_rcItemsProvider( nullptr )
  204. {
  205. }
  206. RC_TREE_MODEL::~RC_TREE_MODEL()
  207. {
  208. for( RC_TREE_NODE* topLevelNode : m_tree )
  209. delete topLevelNode;
  210. }
  211. void RC_TREE_MODEL::rebuildModel( std::shared_ptr<RC_ITEMS_PROVIDER> aProvider, int aSeverities )
  212. {
  213. wxWindowUpdateLocker updateLock( m_view );
  214. std::shared_ptr<RC_ITEM> selectedRcItem = nullptr;
  215. if( m_view )
  216. {
  217. RC_TREE_NODE* selectedNode = ToNode( m_view->GetSelection() );
  218. selectedRcItem = selectedNode ? selectedNode->m_RcItem : nullptr;
  219. // Even with the updateLock, wxWidgets sometimes ties its knickers in a knot trying
  220. // to run a wxdataview_selection_changed_callback() on a row that has been deleted.
  221. m_view->UnselectAll();
  222. }
  223. BeforeReset();
  224. m_rcItemsProvider = std::move( aProvider );
  225. if( aSeverities != m_severities )
  226. m_severities = aSeverities;
  227. if( m_rcItemsProvider )
  228. m_rcItemsProvider->SetSeverities( m_severities );
  229. for( RC_TREE_NODE* topLevelNode : m_tree )
  230. delete topLevelNode;
  231. m_tree.clear();
  232. // wxDataView::ExpandAll() pukes with large lists
  233. int count = 0;
  234. if( m_rcItemsProvider )
  235. count = std::min( 1000, m_rcItemsProvider->GetCount() );
  236. for( int i = 0; i < count; ++i )
  237. {
  238. std::shared_ptr<RC_ITEM> rcItem = m_rcItemsProvider->GetItem( i );
  239. m_tree.push_back( new RC_TREE_NODE( nullptr, rcItem, RC_TREE_NODE::MARKER ) );
  240. RC_TREE_NODE* n = m_tree.back();
  241. if( rcItem->GetMainItemID() != niluuid )
  242. n->m_Children.push_back( new RC_TREE_NODE( n, rcItem, RC_TREE_NODE::MAIN_ITEM ) );
  243. if( rcItem->GetAuxItemID() != niluuid )
  244. n->m_Children.push_back( new RC_TREE_NODE( n, rcItem, RC_TREE_NODE::AUX_ITEM ) );
  245. if( rcItem->GetAuxItem2ID() != niluuid )
  246. n->m_Children.push_back( new RC_TREE_NODE( n, rcItem, RC_TREE_NODE::AUX_ITEM2 ) );
  247. if( rcItem->GetAuxItem3ID() != niluuid )
  248. n->m_Children.push_back( new RC_TREE_NODE( n, rcItem, RC_TREE_NODE::AUX_ITEM3 ) );
  249. if( MARKER_BASE* marker = rcItem->GetParent() )
  250. {
  251. if( marker->IsExcluded() && !marker->GetComment().IsEmpty() )
  252. n->m_Children.push_back( new RC_TREE_NODE( n, rcItem, RC_TREE_NODE::COMMENT ) );
  253. }
  254. }
  255. // Must be called after a significant change of items to force the
  256. // wxDataViewModel to reread all of them, repopulating itself entirely.
  257. AfterReset();
  258. #ifdef __WXGTK__
  259. // The fastest method to update wxDataViewCtrl is to rebuild from
  260. // scratch by calling Cleared(). Linux requires to reassociate model to
  261. // display data, but Windows will create multiple associations.
  262. // On MacOS, this crashes KiCad. See https://gitlab.com/kicad/code/kicad/-/issues/3666
  263. // and https://gitlab.com/kicad/code/kicad/-/issues/3653
  264. m_view->AssociateModel( this );
  265. #endif
  266. m_view->ClearColumns();
  267. m_view->AppendTextColumn( wxEmptyString, 0, wxDATAVIEW_CELL_INERT, wxCOL_WIDTH_AUTOSIZE );
  268. ExpandAll();
  269. // Most annoyingly wxWidgets won't tell us the scroll position (and no, all the usual
  270. // routines don't work), so we can only restore the scroll position based on a selection.
  271. if( selectedRcItem )
  272. {
  273. for( RC_TREE_NODE* candidate : m_tree )
  274. {
  275. if( candidate->m_RcItem == selectedRcItem )
  276. {
  277. m_view->Select( ToItem( candidate ) );
  278. m_view->EnsureVisible( ToItem( candidate ) );
  279. break;
  280. }
  281. }
  282. }
  283. }
  284. void RC_TREE_MODEL::Update( std::shared_ptr<RC_ITEMS_PROVIDER> aProvider, int aSeverities )
  285. {
  286. rebuildModel( aProvider, aSeverities );
  287. }
  288. void RC_TREE_MODEL::ExpandAll()
  289. {
  290. for( RC_TREE_NODE* topLevelNode : m_tree )
  291. m_view->Expand( ToItem( topLevelNode ) );
  292. }
  293. bool RC_TREE_MODEL::IsContainer( wxDataViewItem const& aItem ) const
  294. {
  295. if( ToNode( aItem ) == nullptr ) // must be tree root...
  296. return true;
  297. else
  298. return ToNode( aItem )->m_Type == RC_TREE_NODE::MARKER;
  299. }
  300. wxDataViewItem RC_TREE_MODEL::GetParent( wxDataViewItem const& aItem ) const
  301. {
  302. return ToItem( ToNode( aItem)->m_Parent );
  303. }
  304. unsigned int RC_TREE_MODEL::GetChildren( wxDataViewItem const& aItem,
  305. wxDataViewItemArray& aChildren ) const
  306. {
  307. const RC_TREE_NODE* node = ToNode( aItem );
  308. const std::vector<RC_TREE_NODE*>& children = node ? node->m_Children : m_tree;
  309. for( const RC_TREE_NODE* child: children )
  310. aChildren.push_back( ToItem( child ) );
  311. return children.size();
  312. }
  313. void RC_TREE_MODEL::GetValue( wxVariant& aVariant,
  314. wxDataViewItem const& aItem,
  315. unsigned int aCol ) const
  316. {
  317. const RC_TREE_NODE* node = ToNode( aItem );
  318. const std::shared_ptr<RC_ITEM> rcItem = node->m_RcItem;
  319. MARKER_BASE* marker = rcItem->GetParent();
  320. EDA_ITEM* item = nullptr;
  321. wxString msg;
  322. switch( node->m_Type )
  323. {
  324. case RC_TREE_NODE::MARKER:
  325. if( marker )
  326. {
  327. SEVERITY severity = marker->GetSeverity();
  328. if( severity == RPT_SEVERITY_EXCLUSION )
  329. {
  330. if( m_editFrame->GetSeverity( rcItem->GetErrorCode() ) == RPT_SEVERITY_WARNING )
  331. msg = _( "Excluded warning: " );
  332. else
  333. msg = _( "Excluded error: " );
  334. }
  335. else if( severity == RPT_SEVERITY_WARNING )
  336. {
  337. msg = _( "Warning: " );
  338. }
  339. else
  340. {
  341. msg = _( "Error: " );
  342. }
  343. }
  344. msg += rcItem->GetErrorMessage();
  345. break;
  346. case RC_TREE_NODE::MAIN_ITEM:
  347. if( marker && marker->GetMarkerType() == MARKER_BASE::MARKER_DRAWING_SHEET )
  348. msg = _( "Drawing Sheet" );
  349. else
  350. item = m_editFrame->GetItem( rcItem->GetMainItemID() );
  351. break;
  352. case RC_TREE_NODE::AUX_ITEM:
  353. item = m_editFrame->GetItem( rcItem->GetAuxItemID() );
  354. break;
  355. case RC_TREE_NODE::AUX_ITEM2:
  356. item = m_editFrame->GetItem( rcItem->GetAuxItem2ID() );
  357. break;
  358. case RC_TREE_NODE::AUX_ITEM3:
  359. item = m_editFrame->GetItem( rcItem->GetAuxItem3ID() );
  360. break;
  361. case RC_TREE_NODE::COMMENT:
  362. if( marker )
  363. msg = marker->GetComment();
  364. break;
  365. }
  366. if( item )
  367. msg += item->GetItemDescription( m_editFrame, true );
  368. msg.Replace( wxS( "\n" ), wxS( " " ) );
  369. aVariant = msg;
  370. }
  371. bool RC_TREE_MODEL::GetAttr( wxDataViewItem const& aItem,
  372. unsigned int aCol,
  373. wxDataViewItemAttr& aAttr ) const
  374. {
  375. const RC_TREE_NODE* node = ToNode( aItem );
  376. wxASSERT( node );
  377. bool ret = false;
  378. bool heading = node->m_Type == RC_TREE_NODE::MARKER;
  379. if( heading )
  380. {
  381. aAttr.SetBold( true );
  382. ret = true;
  383. }
  384. if( node->m_RcItem->GetParent()
  385. && node->m_RcItem->GetParent()->GetSeverity() == RPT_SEVERITY_EXCLUSION )
  386. {
  387. wxColour textColour = wxSystemSettings::GetColour( wxSYS_COLOUR_LISTBOXTEXT );
  388. double brightness = KIGFX::COLOR4D( textColour ).GetBrightness();
  389. if( brightness > 0.5 )
  390. {
  391. int lightness = static_cast<int>( brightness * ( heading ? 50 : 60 ) );
  392. aAttr.SetColour( textColour.ChangeLightness( lightness ) );
  393. }
  394. else
  395. {
  396. aAttr.SetColour( textColour.ChangeLightness( heading ? 170 : 165 ) );
  397. }
  398. aAttr.SetItalic( true ); // Strikethrough would be better, if wxWidgets supported it
  399. ret = true;
  400. }
  401. return ret;
  402. }
  403. void RC_TREE_MODEL::ValueChanged( RC_TREE_NODE* aNode )
  404. {
  405. if( aNode->m_Type != RC_TREE_NODE::MARKER )
  406. {
  407. ValueChanged( aNode->m_Parent );
  408. return;
  409. }
  410. wxDataViewItem markerItem = ToItem( aNode );
  411. wxDataViewModel::ValueChanged( markerItem, 0 );
  412. for( const RC_TREE_NODE* child : aNode->m_Children )
  413. wxDataViewModel::ValueChanged( ToItem( child ), 0 );
  414. // Comment items can come and go depening on exclusion state and comment content.
  415. //
  416. const std::shared_ptr<RC_ITEM> rcItem = aNode->m_RcItem;
  417. MARKER_BASE* marker = rcItem ? rcItem->GetParent() : nullptr;
  418. if( marker )
  419. {
  420. bool needsCommentNode = marker->IsExcluded() && !marker->GetComment().IsEmpty();
  421. RC_TREE_NODE* commentNode = aNode->m_Children.back();
  422. if( commentNode && commentNode->m_Type != RC_TREE_NODE::COMMENT )
  423. commentNode = nullptr;
  424. if( needsCommentNode && !commentNode )
  425. {
  426. commentNode = new RC_TREE_NODE( aNode, rcItem, RC_TREE_NODE::COMMENT );
  427. wxDataViewItemArray newItems;
  428. newItems.push_back( ToItem( commentNode ) );
  429. aNode->m_Children.push_back( commentNode );
  430. ItemsAdded( markerItem, newItems );
  431. }
  432. else if( commentNode && !needsCommentNode )
  433. {
  434. wxDataViewItemArray deletedItems;
  435. deletedItems.push_back( ToItem( commentNode ) );
  436. aNode->m_Children.erase( aNode->m_Children.end() - 1 );
  437. ItemsDeleted( markerItem, deletedItems );
  438. }
  439. }
  440. }
  441. void RC_TREE_MODEL::DeleteCurrentItem( bool aDeep )
  442. {
  443. DeleteItems( true, true, aDeep );
  444. }
  445. void RC_TREE_MODEL::DeleteItems( bool aCurrentOnly, bool aIncludeExclusions, bool aDeep )
  446. {
  447. RC_TREE_NODE* current_node = m_view ? ToNode( m_view->GetCurrentItem() ) : nullptr;
  448. const std::shared_ptr<RC_ITEM> current_item = current_node ? current_node->m_RcItem : nullptr;
  449. /// Keep a vector of elements to free after wxWidgets is definitely done accessing them
  450. std::vector<RC_TREE_NODE*> to_delete;
  451. std::vector<RC_TREE_NODE*> expanded;
  452. if( aCurrentOnly && !current_item )
  453. {
  454. wxBell();
  455. return;
  456. }
  457. // wxWidgets 3.1.x on MacOS (at least) loses the expanded state of the tree when deleting
  458. // items.
  459. if( m_view && aCurrentOnly )
  460. {
  461. for( RC_TREE_NODE* node : m_tree )
  462. {
  463. if( m_view->IsExpanded( ToItem( node ) ) )
  464. expanded.push_back( node );
  465. }
  466. }
  467. int lastGood = -1;
  468. bool itemDeleted = false;
  469. if( m_view )
  470. {
  471. m_view->UnselectAll();
  472. wxSafeYield();
  473. m_view->Freeze();
  474. }
  475. if( !m_rcItemsProvider )
  476. return;
  477. for( int i = m_rcItemsProvider->GetCount() - 1; i >= 0; --i )
  478. {
  479. std::shared_ptr<RC_ITEM> rcItem = m_rcItemsProvider->GetItem( i );
  480. MARKER_BASE* marker = rcItem->GetParent();
  481. bool excluded = false;
  482. if( marker && marker->GetSeverity() == RPT_SEVERITY_EXCLUSION )
  483. excluded = true;
  484. if( aCurrentOnly && itemDeleted && lastGood >= 0 )
  485. break;
  486. if( aCurrentOnly && rcItem != current_item )
  487. {
  488. lastGood = i;
  489. continue;
  490. }
  491. if( excluded && !aIncludeExclusions )
  492. continue;
  493. if( i < (int) m_tree.size() ) // Careful; tree is truncated for large datasets
  494. {
  495. wxDataViewItem markerItem = ToItem( m_tree[i] );
  496. wxDataViewItemArray childItems;
  497. wxDataViewItem parentItem = ToItem( m_tree[i]->m_Parent );
  498. for( RC_TREE_NODE* child : m_tree[i]->m_Children )
  499. {
  500. childItems.push_back( ToItem( child ) );
  501. to_delete.push_back( child );
  502. }
  503. m_tree[i]->m_Children.clear();
  504. ItemsDeleted( markerItem, childItems );
  505. to_delete.push_back( m_tree[i] );
  506. m_tree.erase( m_tree.begin() + i );
  507. ItemDeleted( parentItem, markerItem );
  508. }
  509. // Only deep delete the current item here; others will be done by the caller, which
  510. // can more efficiently delete all markers on the board.
  511. m_rcItemsProvider->DeleteItem( i, aDeep && aCurrentOnly );
  512. if( lastGood > i )
  513. lastGood--;
  514. itemDeleted = true;
  515. }
  516. if( m_view && aCurrentOnly && lastGood >= 0 )
  517. {
  518. for( RC_TREE_NODE* node : expanded )
  519. {
  520. wxDataViewItem item = ToItem( node );
  521. if( item.IsOk() )
  522. m_view->Expand( item );
  523. }
  524. wxDataViewItem selItem = ToItem( m_tree[ lastGood ] );
  525. m_view->Select( selItem );
  526. // wxEVT_COMMAND_DATAVIEW_SELECTION_CHANGED doesn't get propogated from the Select()
  527. // call on (at least) MSW.
  528. wxDataViewEvent selectEvent( wxEVT_COMMAND_DATAVIEW_SELECTION_CHANGED, m_view, selItem );
  529. m_view->GetEventHandler()->ProcessEvent( selectEvent );
  530. }
  531. for( RC_TREE_NODE* item : to_delete )
  532. delete( item );
  533. if( m_view )
  534. m_view->Thaw();
  535. }
  536. void RC_TREE_MODEL::PrevMarker()
  537. {
  538. RC_TREE_NODE* currentNode = ToNode( m_view->GetCurrentItem() );
  539. RC_TREE_NODE* prevMarker = nullptr;
  540. while( currentNode && currentNode->m_Type != RC_TREE_NODE::MARKER )
  541. currentNode = currentNode->m_Parent;
  542. for( RC_TREE_NODE* candidate : m_tree )
  543. {
  544. if( candidate == currentNode )
  545. break;
  546. else
  547. prevMarker = candidate;
  548. }
  549. if( prevMarker )
  550. m_view->Select( ToItem( prevMarker ) );
  551. }
  552. void RC_TREE_MODEL::NextMarker()
  553. {
  554. RC_TREE_NODE* currentNode = ToNode( m_view->GetCurrentItem() );
  555. while( currentNode && currentNode->m_Type != RC_TREE_NODE::MARKER )
  556. currentNode = currentNode->m_Parent;
  557. RC_TREE_NODE* nextMarker = nullptr;
  558. bool trigger = currentNode == nullptr;
  559. for( RC_TREE_NODE* candidate : m_tree )
  560. {
  561. if( candidate == currentNode )
  562. {
  563. trigger = true;
  564. }
  565. else if( trigger )
  566. {
  567. nextMarker = candidate;
  568. break;
  569. }
  570. }
  571. if( nextMarker )
  572. m_view->Select( ToItem( nextMarker ) );
  573. }
  574. void RC_TREE_MODEL::SelectMarker( const MARKER_BASE* aMarker )
  575. {
  576. for( RC_TREE_NODE* candidate : m_tree )
  577. {
  578. if( candidate->m_RcItem->GetParent() == aMarker )
  579. {
  580. m_view->Select( ToItem( candidate ) );
  581. return;
  582. }
  583. }
  584. }
  585. void RC_TREE_MODEL::CenterMarker( const MARKER_BASE* aMarker )
  586. {
  587. for( RC_TREE_NODE* candidate : m_tree )
  588. {
  589. if( candidate->m_RcItem->GetParent() == aMarker )
  590. {
  591. m_view->EnsureVisible( ToItem( candidate ) );
  592. return;
  593. }
  594. }
  595. }