KiCad PCB EDA Suite
Loading...
Searching...
No Matches
lib_tree_model.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) 2017 Chris Pavlina <[email protected]>
5 * Copyright (C) 2014 Henner Zeller <[email protected]>
6 * Copyright (C) 2023 CERN
7 * Copyright (C) 2014-2023 KiCad Developers, see AUTHORS.txt for contributors.
8 *
9 * This program is free software: you can redistribute it and/or modify it
10 * under the terms of the GNU General Public License as published by the
11 * Free Software Foundation, either version 3 of the License, or (at your
12 * option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful, but
15 * WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License along
20 * with this program. If not, see <http://www.gnu.org/licenses/>.
21 */
22
23#include <lib_tree_model.h>
24
25#include <algorithm>
26#include <eda_pattern_match.h>
27#include <lib_tree_item.h>
28#include <pgm_base.h>
29#include <string_utils.h>
30
31
32
34{
35 for( std::unique_ptr<LIB_TREE_NODE>& child: m_Children )
36 child->ResetScore();
37
38 m_Score = 0;
39}
40
41
43{
44 std::vector<LIB_TREE_NODE*> sort_buf;
45
46 if( presorted )
47 {
48 int max = m_Children.size() - 1;
49
50 for( int i = 0; i <= max; ++i )
51 m_Children[i]->m_IntrinsicRank = max - i;
52 }
53 else
54 {
55 for( std::unique_ptr<LIB_TREE_NODE>& child: m_Children )
56 sort_buf.push_back( child.get() );
57
58 std::sort( sort_buf.begin(), sort_buf.end(),
59 []( LIB_TREE_NODE* a, LIB_TREE_NODE* b ) -> bool
60 {
61 return StrNumCmp( a->m_Name, b->m_Name, true ) > 0;
62 } );
63
64 for( int i = 0; i < (int) sort_buf.size(); ++i )
65 sort_buf[i]->m_IntrinsicRank = i;
66 }
67}
68
69
70void LIB_TREE_NODE::SortNodes( bool aUseScores )
71{
72 std::sort( m_Children.begin(), m_Children.end(),
73 [&]( std::unique_ptr<LIB_TREE_NODE>& a, std::unique_ptr<LIB_TREE_NODE>& b )
74 {
75 return Compare( *a, *b, aUseScores );
76 } );
77
78 for( std::unique_ptr<LIB_TREE_NODE>& node: m_Children )
79 node->SortNodes( aUseScores );
80}
81
82
83bool LIB_TREE_NODE::Compare( LIB_TREE_NODE const& aNode1, LIB_TREE_NODE const& aNode2,
84 bool aUseScores )
85{
86 if( aNode1.m_Type != aNode2.m_Type )
87 return aNode1.m_Type < aNode2.m_Type;
88
89 // Recently used sorts at top
90 if( aNode1.m_Name.StartsWith( wxT( "-- " ) ) )
91 {
92 if( aNode2.m_Name.StartsWith( wxT( "-- " ) ) )
93 {
94 return aNode1.m_IntrinsicRank > aNode2.m_IntrinsicRank;
95 }
96 else
97 {
98 return true;
99 }
100 }
101 else if( aNode2.m_Name.StartsWith( wxT( "-- " ) ) )
102 {
103 return false;
104 }
105
106 // Pinned nodes go next
107 if( aNode1.m_Pinned && !aNode2.m_Pinned )
108 return true;
109 else if( aNode2.m_Pinned && !aNode1.m_Pinned )
110 return false;
111
112 if( aUseScores && aNode1.m_Score != aNode2.m_Score )
113 return aNode1.m_Score > aNode2.m_Score;
114
115 if( aNode1.m_IntrinsicRank != aNode2.m_IntrinsicRank )
116 return aNode1.m_IntrinsicRank > aNode2.m_IntrinsicRank;
117
118 return reinterpret_cast<const void*>( &aNode1 ) < reinterpret_cast<const void*>( &aNode2 );
119}
120
121
123 : m_Parent( nullptr ),
124 m_Type( INVALID ),
125 m_IntrinsicRank( 0 ),
126 m_Score( 0 ),
127 m_Pinned( false ),
128 m_Unit( 0 ),
129 m_IsRoot( false )
130{}
131
132
134{
135 static void* locale = nullptr;
136 static wxString namePrefix;
137
138 // Fetching translations can take a surprising amount of time when loading libraries,
139 // so only do it when necessary.
140 if( Pgm().GetLocale() != locale )
141 {
142 namePrefix = _( "Unit" );
143 locale = Pgm().GetLocale();
144 }
145
146 m_Parent = aParent;
147 m_Type = UNIT;
148
149 m_Unit = aUnit;
150 m_LibId = aParent->m_LibId;
151
152 m_Name = namePrefix + " " + aItem->GetUnitReference( aUnit );
153
154 if( aItem->HasUnitDisplayName( aUnit ) )
155 m_Desc = aItem->GetUnitDisplayName( aUnit );
156 else
157 m_Desc = wxEmptyString;
158
159 m_IntrinsicRank = -aUnit;
160}
161
162
163void LIB_TREE_NODE_UNIT::UpdateScore( EDA_COMBINED_MATCHER* aMatcher, const wxString& aLib,
164 std::function<bool( LIB_TREE_NODE& aNode )>* aFilter )
165{
166 // aMatcher test results are inherited from parent
167 if( aMatcher )
169
170 // aFilter test is subtractive
171 if( aFilter && !(*aFilter)(*this) )
172 m_Score = 0;
173
174 // show all nodes if no search/filter/etc. criteria are given
175 if( !aMatcher && aLib.IsEmpty() && ( !aFilter || (*aFilter)(*this) ) )
176 m_Score = 1;
177}
178
179
181{
182 m_Type = ITEM;
183 m_Parent = aParent;
184
186 m_LibId.SetLibItemName( aItem->GetName() );
187
188 m_Name = aItem->GetName();
189 m_Desc = aItem->GetDescription();
190 m_Footprint = aItem->GetFootprint();
191 m_PinCount = aItem->GetPinCount();
192
193 aItem->GetChooserFields( m_Fields );
194
195 m_SearchTerms = aItem->GetSearchTerms();
196
197 m_IsRoot = aItem->IsRoot();
198
199 if( aItem->GetUnitCount() > 1 )
200 {
201 for( int u = 1; u <= aItem->GetUnitCount(); ++u )
202 AddUnit( aItem, u );
203 }
204}
205
206
208{
209 LIB_TREE_NODE_UNIT* unit = new LIB_TREE_NODE_UNIT( this, aItem, aUnit );
210 m_Children.push_back( std::unique_ptr<LIB_TREE_NODE>( unit ) );
211 return *unit;
212}
213
214
216{
218 m_LibId.SetLibItemName( aItem->GetName() );
219
220 m_Name = aItem->GetName();
221 m_Desc = aItem->GetDescription();
222
223 aItem->GetChooserFields( m_Fields );
224
225 m_SearchTerms = aItem->GetSearchTerms();
226
227 m_IsRoot = aItem->IsRoot();
228 m_Children.clear();
229
230 for( int u = 1; u <= aItem->GetUnitCount(); ++u )
231 AddUnit( aItem, u );
232}
233
234
235void LIB_TREE_NODE_ITEM::UpdateScore( EDA_COMBINED_MATCHER* aMatcher, const wxString& aLib,
236 std::function<bool( LIB_TREE_NODE& aNode )>* aFilter )
237{
238 // aMatcher test is additive
239 if( aMatcher )
240 m_Score += aMatcher->ScoreTerms( m_SearchTerms );
241
242 // aLib test is additive
243 if( !aLib.IsEmpty() && m_Parent->m_Name.Lower() == aLib )
244 m_Score += 1;
245
246 // aFilter test is subtractive
247 if( aFilter && !(*aFilter)(*this) )
248 m_Score = 0;
249
250 // show all nodes if no search/filter/etc. criteria are given
251 if( !aMatcher && aLib.IsEmpty() && ( !aFilter || (*aFilter)(*this) ) )
252 m_Score = 1;
253
254 for( std::unique_ptr<LIB_TREE_NODE>& child: m_Children )
255 child->UpdateScore( aMatcher, aLib, aFilter );
256}
257
258
260 wxString const& aDesc )
261{
262 m_Type = LIBRARY;
263 m_Name = aName;
264 m_Desc = aDesc;
265 m_Parent = aParent;
266 m_LibId.SetLibNickname( aName );
267
268 m_SearchTerms.emplace_back( SEARCH_TERM( aName, 8 ) );
269}
270
271
273{
274 LIB_TREE_NODE_ITEM* item = new LIB_TREE_NODE_ITEM( this, aItem );
275 m_Children.push_back( std::unique_ptr<LIB_TREE_NODE>( item ) );
276 return *item;
277}
278
279
280void LIB_TREE_NODE_LIBRARY::UpdateScore( EDA_COMBINED_MATCHER* aMatcher, const wxString& aLib,
281 std::function<bool( LIB_TREE_NODE& aNode )>* aFilter )
282{
283 for( std::unique_ptr<LIB_TREE_NODE>& child: m_Children )
284 {
285 child->UpdateScore( aMatcher, aLib, aFilter );
286 m_Score = std::max( m_Score, child->m_Score );
287 }
288
289 // aLib test is additive
290 if( !aLib.IsEmpty() && m_Name.Lower() == aLib )
291 m_Score += 1;
292
293 // aMatcher test is additive
294 if( aMatcher )
295 m_Score += aMatcher->ScoreTerms( m_SearchTerms );
296
297 // show all nodes if no search/filter/etc. criteria are given
298 if( m_Children.empty() && !aMatcher && aLib.IsEmpty() && ( !aFilter || (*aFilter)(*this) ) )
299 m_Score = 1;
300}
301
302
304{
305 m_Type = ROOT;
306}
307
308
309LIB_TREE_NODE_LIBRARY& LIB_TREE_NODE_ROOT::AddLib( wxString const& aName, wxString const& aDesc )
310{
311 LIB_TREE_NODE_LIBRARY* lib = new LIB_TREE_NODE_LIBRARY( this, aName, aDesc );
312 m_Children.push_back( std::unique_ptr<LIB_TREE_NODE>( lib ) );
313 return *lib;
314}
315
316
317void LIB_TREE_NODE_ROOT::UpdateScore( EDA_COMBINED_MATCHER* aMatcher, const wxString& aLib,
318 std::function<bool( LIB_TREE_NODE& aNode )>* aFilter )
319{
320 for( std::unique_ptr<LIB_TREE_NODE>& child: m_Children )
321 child->UpdateScore( aMatcher, aLib, aFilter );
322}
323
int ScoreTerms(std::vector< SEARCH_TERM > &aWeightedTerms)
int SetLibItemName(const UTF8 &aLibItemName)
Override the library item name portion of the LIB_ID to aLibItemName.
Definition: lib_id.cpp:110
int SetLibNickname(const UTF8 &aNickname)
Override the logical library name portion of the LIB_ID to aNickname.
Definition: lib_id.cpp:99
const UTF8 & GetLibNickname() const
Return the logical library name portion of a LIB_ID.
Definition: lib_id.h:87
A mix-in to provide polymorphism between items stored in libraries (symbols, aliases and footprints).
Definition: lib_tree_item.h:41
virtual wxString GetUnitReference(int aUnit)
For items with units, return an identifier for unit x.
Definition: lib_tree_item.h:84
virtual wxString GetLibNickname() const =0
virtual std::vector< SEARCH_TERM > GetSearchTerms()
Definition: lib_tree_item.h:59
virtual bool HasUnitDisplayName(int aUnit)
For items with units, return true if a display name is set for x.
Definition: lib_tree_item.h:94
virtual wxString GetFootprint()
For items with footprint fields.
Definition: lib_tree_item.h:69
virtual bool IsRoot() const
For items having aliases, IsRoot() indicates the principal item.
Definition: lib_tree_item.h:64
virtual wxString GetName() const =0
virtual wxString GetDescription()=0
virtual LIB_ID GetLibId() const =0
virtual int GetUnitCount() const
For items with units, return the number of units.
Definition: lib_tree_item.h:79
virtual int GetPinCount()
The pin count for symbols or the unique pad count for footprints.
Definition: lib_tree_item.h:74
virtual wxString GetUnitDisplayName(int aUnit)
For items with units, return a display name for unit x.
Definition: lib_tree_item.h:89
virtual void GetChooserFields(std::map< wxString, wxString > &aColumnMap)
Retrieves a key/value map of the fields on this item that should be exposed to the library browser/ch...
Definition: lib_tree_item.h:57
Node type: LIB_ID.
void UpdateScore(EDA_COMBINED_MATCHER *aMatcher, const wxString &aLib, std::function< bool(LIB_TREE_NODE &aNode)> *aFilter) override
Perform the actual search.
LIB_TREE_NODE_ITEM(LIB_TREE_NODE_ITEM const &_)=delete
The addresses of CMP_TREE_NODEs are used as unique IDs for the wxDataViewModel, so don't let them be ...
LIB_TREE_NODE_UNIT & AddUnit(LIB_TREE_ITEM *aItem, int aUnit)
Add a new unit to the component and return it.
void Update(LIB_TREE_ITEM *aItem)
Update the node using data from a LIB_ALIAS object.
Node type: library.
LIB_TREE_NODE_LIBRARY(LIB_TREE_NODE_LIBRARY const &_)=delete
The addresses of CMP_TREE_NODEs are used as unique IDs for the wxDataViewModel, so don't let them be ...
LIB_TREE_NODE_ITEM & AddItem(LIB_TREE_ITEM *aItem)
Construct a new alias node, add it to this library, and return it.
void UpdateScore(EDA_COMBINED_MATCHER *aMatcher, const wxString &aLib, std::function< bool(LIB_TREE_NODE &aNode)> *aFilter) override
Update the score for this part.
LIB_TREE_NODE_LIBRARY & AddLib(wxString const &aName, wxString const &aDesc)
Construct an empty library node, add it to the root, and return it.
void UpdateScore(EDA_COMBINED_MATCHER *aMatcher, const wxString &aLib, std::function< bool(LIB_TREE_NODE &aNode)> *aFilter) override
Update the score for this part.
LIB_TREE_NODE_ROOT()
Construct the root node.
Node type: unit of component.
LIB_TREE_NODE_UNIT(LIB_TREE_NODE_UNIT const &_)=delete
The addresses of CMP_TREE_NODEs are used as unique IDs for the wxDataViewModel, so don't let them be ...
void UpdateScore(EDA_COMBINED_MATCHER *aMatcher, const wxString &aLib, std::function< bool(LIB_TREE_NODE &aNode)> *aFilter) override
Update the score for this part.
Model class in the component selector Model-View-Adapter (mediated MVC) architecture.
void SortNodes(bool aUseScores)
Sort child nodes quickly and recursively (IntrinsicRanks must have been set).
static bool Compare(LIB_TREE_NODE const &aNode1, LIB_TREE_NODE const &aNode2, bool aUseScores)
Compare two nodes.
enum TYPE m_Type
std::vector< SEARCH_TERM > m_SearchTerms
std::map< wxString, wxString > m_Fields
List of weighted search terms.
PTR_VECTOR m_Children
wxString m_Footprint
LIB_TREE_NODE * m_Parent
virtual void ResetScore()
Initialize scores recursively.
int m_IntrinsicRank
The rank of the item before any search terms are applied.
void AssignIntrinsicRanks(bool presorted=false)
Store intrinsic ranks on all children of this node.
#define _(s)
Abstract pattern-matching tool and implementations.
@ INVALID
Definition: kiface_ids.h:32
see class PGM_BASE
KIWAY Kiway & Pgm(), KFCTL_STANDALONE
The global Program "get" accessor.
Definition: single_top.cpp:119