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

SCH_REFERENCE_LIST: delete unused code

This commit is contained in:
Mike Williams 2023-08-10 11:11:04 -04:00
parent 5d001d4858
commit 29796fff9e
2 changed files with 0 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
eeschema/sch_reference_list.cpp
View File

@ -155,26 +155,6 @@ bool SCH_REFERENCE_LIST::sortByTimeStamp( const SCH_REFERENCE& item1,
} }
int SCH_REFERENCE_LIST::FindUnit( size_t aIndex, int aUnit, bool aIncludeNew ) const
{
int NumRef = m_flatList[aIndex].m_numRef;
for( size_t ii = 0; ii < m_flatList.size(); ii++ )
{
if( ( aIndex == ii )
|| ( m_flatList[ii].m_isNew && !aIncludeNew )
|| ( m_flatList[ii].m_numRef != NumRef )
|| ( m_flatList[aIndex].CompareRef( m_flatList[ii] ) != 0 ) )
continue;
if( m_flatList[ii].m_unit == aUnit )
return (int) ii;
}
return -1;
}
int SCH_REFERENCE_LIST::FindRefByFullPath( const wxString& aFullPath ) const int SCH_REFERENCE_LIST::FindRefByFullPath( const wxString& aFullPath ) const
{ {
for( size_t i = 0; i < m_flatList.size(); ++i ) for( size_t i = 0; i < m_flatList.size(); ++i )

11
eeschema/sch_reference_list.h
View File

@ -520,17 +520,6 @@ public:
*/ */
int FindRef( const wxString& aPath ) const; int FindRef( const wxString& aPath ) const;
/**
* Search the sorted list of symbols for a another symbol with the same reference and a
* given part unit. Use this method to manage symbols with multiple parts per package.
*
* @param aIndex is the index in aSymbolsList for of given #SCH_REFERENCE item to test.
* @param aUnit is the given unit number to search.
* @param aIncludeNew true to include references with the "new" flag in the search.
* @return index in aSymbolsList if found or -1 if not found.
*/
int FindUnit( size_t aIndex, int aUnit, bool aIncludeNew = false ) const;
/** /**
* Search the list for a symbol with the given KIID path (as string). * Search the list for a symbol with the given KIID path (as string).
* *