haskal
/
kicad
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Ensure irreflexive property in LIB_TREE_NODE

This commit is contained in:
Seth Hillbrand 2024-05-05 07:32:34 -07:00
parent 0e0432d194
commit 0476b6c72d
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
common/lib_tree_model.cpp
View File

@ -92,10 +92,13 @@ bool LIB_TREE_NODE::Compare( LIB_TREE_NODE const& aNode1, LIB_TREE_NODE const& a
if( aNode2.m_Name.StartsWith( wxT( "-- " ) ) ) if( aNode2.m_Name.StartsWith( wxT( "-- " ) ) )
{ {
// Make sure -- Recently Used is always at the top // Make sure -- Recently Used is always at the top
if( aNode1.m_Name.StartsWith( wxT( "-- Recently Used" ) ) ) // Start by checking the name of aNode2, because we
return true; // want to satisfy the irreflexive property of the
else if( aNode2.m_Name.StartsWith( wxT( "-- Recently Used" ) ) ) // strict weak ordering.
if( aNode2.m_Name.StartsWith( wxT( "-- Recently Used" ) ) )
return false; return false;
else if( aNode1.m_Name.StartsWith( wxT( "-- Recently Used" ) ) )
return true;
return aNode1.m_IntrinsicRank > aNode2.m_IntrinsicRank; return aNode1.m_IntrinsicRank > aNode2.m_IntrinsicRank;
} }