2019-01-29 10:50:50 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
2021-05-01 22:56:37 +00:00
|
|
|
* Copyright (C) 2019-2021 KiCad Developers, see CHANGELOG.TXT for contributors.
|
2019-01-29 10:50:50 +00:00
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version 2
|
|
|
|
* of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, you may find one here:
|
|
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <refdes_utils.h>
|
|
|
|
|
2021-07-29 09:56:22 +00:00
|
|
|
#include <string_utils.h>
|
2019-01-29 10:50:50 +00:00
|
|
|
|
2019-01-29 11:46:48 +00:00
|
|
|
#include <algorithm>
|
|
|
|
#include <cctype>
|
|
|
|
|
|
|
|
|
2019-01-29 10:50:50 +00:00
|
|
|
namespace UTIL
|
|
|
|
{
|
|
|
|
|
2021-04-17 14:10:59 +00:00
|
|
|
wxString GetRefDesPrefix( const wxString& aRefDes )
|
2019-01-29 10:50:50 +00:00
|
|
|
{
|
2021-04-17 14:10:59 +00:00
|
|
|
// find the first non-digit, non-question-mark character from the back
|
2019-01-29 11:46:48 +00:00
|
|
|
auto res = std::find_if( aRefDes.rbegin(), aRefDes.rend(),
|
2021-04-17 14:10:59 +00:00
|
|
|
[]( wxUniChar aChr )
|
|
|
|
{
|
|
|
|
return aChr != '?' && !std::isdigit( aChr );
|
|
|
|
} );
|
2019-01-29 10:50:50 +00:00
|
|
|
|
2019-01-29 11:46:48 +00:00
|
|
|
return { aRefDes.begin(), res.base() };
|
2019-01-29 10:50:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2021-04-17 14:10:59 +00:00
|
|
|
wxString GetRefDesUnannotated( const wxString& aSource )
|
|
|
|
{
|
|
|
|
return UTIL::GetRefDesPrefix( aSource ) + wxT( "?" );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2021-05-01 22:56:37 +00:00
|
|
|
int GetRefDesNumber( const wxString& aRefDes )
|
|
|
|
{
|
|
|
|
int retval = -1; // negative to indicate not found
|
|
|
|
size_t firstnum = aRefDes.find_first_of( "0123456789" );
|
|
|
|
|
|
|
|
if( firstnum != wxString::npos )
|
|
|
|
{
|
|
|
|
wxString candidateValue = aRefDes.Mid( firstnum );
|
|
|
|
long result;
|
|
|
|
|
|
|
|
if( !candidateValue.ToLong( &result ) )
|
|
|
|
retval = -1;
|
|
|
|
else
|
|
|
|
retval = static_cast<int>( result );
|
|
|
|
}
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-01-29 10:50:50 +00:00
|
|
|
int RefDesStringCompare( const wxString& aFirst, const wxString& aSecond )
|
|
|
|
{
|
|
|
|
// Compare unescaped text
|
|
|
|
wxString strFWord = UnescapeString( aFirst );
|
|
|
|
wxString strSWord = UnescapeString( aSecond );
|
|
|
|
|
|
|
|
// The different sections of the two strings
|
|
|
|
wxString strFWordBeg, strFWordMid, strFWordEnd;
|
|
|
|
wxString strSWordBeg, strSWordMid, strSWordEnd;
|
|
|
|
|
|
|
|
// Split the two strings into separate parts
|
|
|
|
SplitString( strFWord, &strFWordBeg, &strFWordMid, &strFWordEnd );
|
|
|
|
SplitString( strSWord, &strSWordBeg, &strSWordMid, &strSWordEnd );
|
|
|
|
|
|
|
|
// Compare the Beginning section of the strings
|
2020-11-23 01:09:29 +00:00
|
|
|
int isEqual = strFWordBeg.Cmp( strSWordBeg );
|
2019-01-29 10:50:50 +00:00
|
|
|
|
|
|
|
if( isEqual > 0 )
|
|
|
|
return 1;
|
|
|
|
else if( isEqual < 0 )
|
|
|
|
return -1;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// If the first sections are equal compare their digits
|
|
|
|
long lFirstDigit = 0;
|
|
|
|
long lSecondDigit = 0;
|
|
|
|
|
|
|
|
strFWordMid.ToLong( &lFirstDigit );
|
|
|
|
strSWordMid.ToLong( &lSecondDigit );
|
|
|
|
|
|
|
|
if( lFirstDigit > lSecondDigit )
|
|
|
|
return 1;
|
|
|
|
else if( lFirstDigit < lSecondDigit )
|
|
|
|
return -1;
|
|
|
|
// If the first two sections are equal compare the endings
|
|
|
|
else
|
2020-11-23 01:09:29 +00:00
|
|
|
return strFWordEnd.Cmp( strSWordEnd );
|
2019-01-29 10:50:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace UTIL
|