KiCad PCB EDA Suite
LIB_TREE_NODE_ROOT Class Reference

Node type: root. More...

#include <lib_tree_model.h>

Inheritance diagram for LIB_TREE_NODE_ROOT:
LIB_TREE_NODE

Public Types

enum  TYPE {
  ROOT, LIB, LIBID, UNIT,
  INVALID
}
 
typedef std::vector< std::unique_ptr< LIB_TREE_NODE > > PTR_VECTOR
 

Public Member Functions

 LIB_TREE_NODE_ROOT (LIB_TREE_NODE_ROOT const &_)=delete
 The addresses of CMP_TREE_NODEs are used as unique IDs for the wxDataViewModel, so don't let them be copied around. More...
 
void operator= (LIB_TREE_NODE_ROOT const &_)=delete
 
 LIB_TREE_NODE_ROOT ()
 Construct the root node. More...
 
LIB_TREE_NODE_LIBAddLib (wxString const &aName, wxString const &aDesc)
 Construct an empty library node, add it to the root, and return it. More...
 
virtual void UpdateScore (EDA_COMBINED_MATCHER &aMatcher) override
 Update the score for this part. More...
 
void ResetScore ()
 Initialize score to kLowestDefaultScore, recursively. More...
 
void AssignIntrinsicRanks (bool presorted=false)
 Store intrinsic ranks on all children of this node. More...
 
void SortNodes ()
 Sort child nodes quickly and recursively (IntrinsicRanks must have been set). More...
 

Static Public Member Functions

static int Compare (LIB_TREE_NODE const &aNode1, LIB_TREE_NODE const &aNode2)
 Compare two nodes. More...
 

Public Attributes

LIB_TREE_NODEParent
 Parent node or null. More...
 
PTR_VECTOR Children
 List of child nodes. More...
 
enum TYPE Type
 Node type. More...
 
int IntrinsicRank
 The rank of the item before any search terms are applied. More...
 
int Score
 The score of an item resulting from the search algorithm. More...
 
wxString Name
 Actual name of the part. More...
 
wxString Desc
 Description to be displayed. More...
 
wxString MatchName
 Normalized name for matching. More...
 
wxString SearchText
 Descriptive text to search. More...
 
bool Normalized
 Support for lazy normalization. More...
 
LIB_ID LibId
 LIB_ID determined by the parent library nickname and alias name. More...
 
int Unit
 Actual unit, or zero. More...
 
bool IsRoot
 Indicates if the symbol is a root symbol instead of an alias. More...
 

Detailed Description

Node type: root.

Definition at line 263 of file lib_tree_model.h.

Member Typedef Documentation

typedef std::vector<std::unique_ptr<LIB_TREE_NODE> > LIB_TREE_NODE::PTR_VECTOR
inherited

Definition at line 81 of file lib_tree_model.h.

Member Enumeration Documentation

enum LIB_TREE_NODE::TYPE
inherited
Enumerator
ROOT 
LIB 
LIBID 
UNIT 
INVALID 

Definition at line 77 of file lib_tree_model.h.

Constructor & Destructor Documentation

LIB_TREE_NODE_ROOT::LIB_TREE_NODE_ROOT ( LIB_TREE_NODE_ROOT const &  _)
delete

The addresses of CMP_TREE_NODEs are used as unique IDs for the wxDataViewModel, so don't let them be copied around.

LIB_TREE_NODE_ROOT::LIB_TREE_NODE_ROOT ( )

Construct the root node.

Root nodes have no properties.

Definition at line 317 of file lib_tree_model.cpp.

References LIB_TREE_NODE::ROOT, and LIB_TREE_NODE::Type.

318 {
319  Type = ROOT;
320 }
enum TYPE Type
Node type.

Member Function Documentation

LIB_TREE_NODE_LIB & LIB_TREE_NODE_ROOT::AddLib ( wxString const &  aName,
wxString const &  aDesc 
)

Construct an empty library node, add it to the root, and return it.

Definition at line 323 of file lib_tree_model.cpp.

References LIB_TREE_NODE::Children.

Referenced by LIB_TREE_MODEL_ADAPTER::DoAddLibrary(), and SYMBOL_TREE_SYNCHRONIZING_ADAPTER::Sync().

324 {
325  LIB_TREE_NODE_LIB* lib = new LIB_TREE_NODE_LIB( this, aName, aDesc );
326  Children.push_back( std::unique_ptr<LIB_TREE_NODE>( lib ) );
327  return *lib;
328 }
PTR_VECTOR Children
List of child nodes.
Node type: library.
void LIB_TREE_NODE::AssignIntrinsicRanks ( bool  presorted = false)
inherited

Store intrinsic ranks on all children of this node.

See IntrinsicRank member doc for more information.

Definition at line 62 of file lib_tree_model.cpp.

References LIB_TREE_NODE::Children, i, LIB_TREE_NODE::IntrinsicRank, max, LIB_TREE_NODE::Name, and StrNumCmp().

Referenced by FP_TREE_MODEL_ADAPTER::AddLibraries(), SYMBOL_TREE_MODEL_ADAPTER::AddLibraries(), LIB_TREE_MODEL_ADAPTER::AssignIntrinsicRanks(), LIB_TREE_MODEL_ADAPTER::DoAddLibrary(), FP_TREE_SYNCHRONIZING_ADAPTER::Sync(), SYMBOL_TREE_SYNCHRONIZING_ADAPTER::Sync(), SYMBOL_TREE_SYNCHRONIZING_ADAPTER::updateLibrary(), and FP_TREE_SYNCHRONIZING_ADAPTER::updateLibrary().

63 {
64  std::vector<LIB_TREE_NODE*> sort_buf;
65 
66  if( presorted )
67  {
68  int max = Children.size() - 1;
69 
70  for( int i = 0; i <= max; ++i )
71  Children[i]->IntrinsicRank = max - i;
72  }
73  else
74  {
75  for( auto const& node: Children )
76  sort_buf.push_back( &*node );
77 
78  std::sort( sort_buf.begin(), sort_buf.end(),
79  []( LIB_TREE_NODE* a, LIB_TREE_NODE* b ) -> bool
80  { return StrNumCmp( a->Name, b->Name, INT_MAX, true ) > 0; } );
81 
82  for( int i = 0; i < (int) sort_buf.size(); ++i )
83  sort_buf[i]->IntrinsicRank = i;
84  }
85 }
PTR_VECTOR Children
List of child nodes.
Model class in the component selector Model-View-Adapter (mediated MVC) architecture.
wxString Name
Actual name of the part.
#define max(a, b)
Definition: auxiliary.h:86
size_t i
Definition: json11.cpp:597
int IntrinsicRank
The rank of the item before any search terms are applied.
int StrNumCmp(const wxString &aString1, const wxString &aString2, int aLength, bool aIgnoreCase)
Function StrNumCmp is a routine compatible with qsort() to sort by alphabetical order.
Definition: string.cpp:315
int LIB_TREE_NODE::Compare ( LIB_TREE_NODE const &  aNode1,
LIB_TREE_NODE const &  aNode2 
)
staticinherited

Compare two nodes.

Returns negative if aNode1 < aNode2, zero if aNode1 == aNode2, or positive if aNode1 > aNode2.

Definition at line 101 of file lib_tree_model.cpp.

References LIB_TREE_NODE::IntrinsicRank, LIB_TREE_NODE::Parent, LIB_TREE_NODE::Score, and LIB_TREE_NODE::Type.

Referenced by LIB_TREE_NODE::SortNodes().

102 {
103  if( aNode1.Type != aNode2.Type )
104  return 0;
105 
106  if( aNode1.Score != aNode2.Score )
107  return aNode1.Score - aNode2.Score;
108 
109  if( aNode1.Parent != aNode2.Parent )
110  return 0;
111 
112  return aNode1.IntrinsicRank - aNode2.IntrinsicRank;
113 }
void LIB_TREE_NODE_ROOT::operator= ( LIB_TREE_NODE_ROOT const &  _)
delete
void LIB_TREE_NODE::ResetScore ( )
inherited

Initialize score to kLowestDefaultScore, recursively.

Definition at line 53 of file lib_tree_model.cpp.

References LIB_TREE_NODE::Children, kLowestDefaultScore, and LIB_TREE_NODE::Score.

Referenced by LIB_TREE_MODEL_ADAPTER::UpdateSearchString().

54 {
55  for( auto& child: Children )
56  child->ResetScore();
57 
59 }
PTR_VECTOR Children
List of child nodes.
int Score
The score of an item resulting from the search algorithm.
static const unsigned kLowestDefaultScore
void LIB_TREE_NODE::SortNodes ( )
inherited

Sort child nodes quickly and recursively (IntrinsicRanks must have been set).

Definition at line 88 of file lib_tree_model.cpp.

References LIB_TREE_NODE::Children, and LIB_TREE_NODE::Compare().

Referenced by LIB_TREE_MODEL_ADAPTER::UpdateSearchString().

89 {
90  std::sort( Children.begin(), Children.end(),
91  []( std::unique_ptr<LIB_TREE_NODE> const& a, std::unique_ptr<LIB_TREE_NODE> const& b )
92  { return Compare( *a, *b ) > 0; } );
93 
94  for( auto& node: Children )
95  {
96  node->SortNodes();
97  }
98 }
PTR_VECTOR Children
List of child nodes.
static int Compare(LIB_TREE_NODE const &aNode1, LIB_TREE_NODE const &aNode2)
Compare two nodes.
void LIB_TREE_NODE_ROOT::UpdateScore ( EDA_COMBINED_MATCHER aMatcher)
overridevirtual

Update the score for this part.

This is accumulative - it will be called once per search term.

Parameters
aMatcheran EDA_COMBINED_MATCHER initialized with the search term

Implements LIB_TREE_NODE.

Definition at line 331 of file lib_tree_model.cpp.

References LIB_TREE_NODE::Children.

Referenced by LIB_TREE_MODEL_ADAPTER::UpdateSearchString().

332 {
333  for( auto& child: Children )
334  child->UpdateScore( aMatcher );
335 }
PTR_VECTOR Children
List of child nodes.

Member Data Documentation

wxString LIB_TREE_NODE::Desc
inherited
int LIB_TREE_NODE::IntrinsicRank
inherited

The rank of the item before any search terms are applied.

This is a fairly expensive sort (involving string compares) so it helps to store the result of that sort.

Definition at line 92 of file lib_tree_model.h.

Referenced by LIB_TREE_NODE::AssignIntrinsicRanks(), LIB_TREE_NODE::Compare(), and LIB_TREE_NODE_UNIT::LIB_TREE_NODE_UNIT().

bool LIB_TREE_NODE::IsRoot
inherited

Indicates if the symbol is a root symbol instead of an alias.

Definition at line 106 of file lib_tree_model.h.

Referenced by LIB_TREE_NODE_LIB_ID::LIB_TREE_NODE_LIB_ID(), and LIB_TREE_NODE_LIB_ID::Update().

LIB_ID LIB_TREE_NODE::LibId
inherited
bool LIB_TREE_NODE::Normalized
inherited

Support for lazy normalization.

Definition at line 101 of file lib_tree_model.h.

Referenced by LIB_TREE_NODE_LIB_ID::LIB_TREE_NODE_LIB_ID(), LIB_TREE_NODE_LIB_ID::Update(), and LIB_TREE_NODE_LIB_ID::UpdateScore().

int LIB_TREE_NODE::Score
inherited

The score of an item resulting from the search algorithm.

Definition at line 95 of file lib_tree_model.h.

Referenced by LIB_TREE_NODE::Compare(), LIB_TREE_NODE::ResetScore(), LIB_TREE_MODEL_ADAPTER::ShowResults(), LIB_TREE_NODE_LIB_ID::UpdateScore(), and LIB_TREE_NODE_LIB::UpdateScore().

wxString LIB_TREE_NODE::SearchText
inherited
int LIB_TREE_NODE::Unit
inherited

Actual unit, or zero.

Definition at line 105 of file lib_tree_model.h.

Referenced by LIB_TREE_NODE_UNIT::LIB_TREE_NODE_UNIT(), and LIB_TREE_MODEL_ADAPTER::ShowPreselect().


The documentation for this class was generated from the following files: