70wxString
FormatRefDesRanges(
const std::vector<wxString>& aReferences,
const wxString& aRefDelimiter,
71 const wxString& aRefRangeDelimiter )
73 std::vector<std::pair<wxString, wxString>> bases;
75 for(
const wxString& reference : aReferences )
76 bases.emplace_back( reference, wxEmptyString );
83 const wxString& aRefDelimiter,
const wxString& aRefRangeDelimiter )
85 std::vector<std::pair<wxString, wxString>> sorted( aBasesAndSuffixes );
88 std::vector<wxString> suffixOrder;
90 for(
const auto& [base, suffix] : sorted )
92 if( std::find( suffixOrder.begin(), suffixOrder.end(), suffix ) == suffixOrder.end() )
93 suffixOrder.push_back( suffix );
96 std::stable_sort( sorted.begin(), sorted.end(),
97 [&](
const auto& a,
const auto& b )
99 return std::find( suffixOrder.begin(), suffixOrder.end(), a.second )
100 < std::find( suffixOrder.begin(), suffixOrder.end(), b.second );
106 return sorted[aIndex].first + sorted[aIndex].second;
112 while( i < sorted.size() )
114 const wxString& reference = sorted[i].first;
115 const wxString& suffix = sorted[i].second;
117 wxString numberText = reference.Mid( prefix.length() );
119 bool hasNumber = numberText.ToLong( &number );
122 while( hasNumber && i + range < sorted.size() )
124 const wxString& nextReference = sorted[i + range].first;
126 wxString nextNumberText = nextReference.Mid( nextPrefix.length() );
129 if( nextPrefix != prefix || sorted[i + range].second != suffix
130 || !nextNumberText.ToLong( &nextNumber ) || nextNumber != number +
static_cast<long>( range ) )
137 if( range == 2 && aRefRangeDelimiter.IsEmpty() )
141 if( !retVal.IsEmpty() )
142 retVal << aRefDelimiter;
146 retVal << composed( i );
148 else if( range == 2 || aRefRangeDelimiter.IsEmpty() )
150 retVal << composed( i );
151 retVal << aRefDelimiter;
152 retVal << composed( i + 1 );
156 retVal << composed( i );
157 retVal << aRefRangeDelimiter;
158 retVal << composed( i + range - 1 );