1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
#ifndef TextEncodingString_h
#define TextEncodingString_h
/******************************************************************************
*
* Copyright (C) 2002 Hugo PEREIRA <mailto: hugo.pereira@free.fr>
*
* This 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 software 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, see <http://www.gnu.org/licenses/>.
*
*******************************************************************************/
#include <QList>
#include <QRegExp>
#include <QString>
//* model content
class TextEncodingString final
{
public:
//* universal constructor
template<typename... Args>
explicit TextEncodingString(Args&&... args):
value_( std::forward<Args>(args)... )
{ parse(); }
//* accessor
const QString& get() const { return value_; }
//* parse string into two lists of digits and text chunks
void parse()
{
textSegments_.clear();
numSegments_.clear();
int lastPosition = 0;
int position = 0;
QRegExp regExp( "(\\d+)" );
while( ( position = value_.indexOf( regExp, lastPosition ) ) >= 0 )
{
textSegments_.append( value_.left( position ) );
numSegments_.append( regExp.cap(0).toInt() );
lastPosition = position + regExp.matchedLength();
}
textSegments_.append( value_.mid( lastPosition ) );
}
private:
QString value_;
QList<QString> textSegments_;
QList<int> numSegments_;
//* less than operator
friend bool operator < (const TextEncodingString& first, const TextEncodingString& second )
{
int textIndex(0);
int numIndex(0);
while( true )
{
if( textIndex < first.textSegments_.size() && textIndex < second.textSegments_.size() )
{
if( first.textSegments_[textIndex] != second.textSegments_[textIndex] ) return first.textSegments_[textIndex] < second.textSegments_[textIndex];
else textIndex++;
} else return first.textSegments_.size() < second.textSegments_.size();
if( numIndex < first.numSegments_.size() && numIndex < second.numSegments_.size() )
{
if( first.numSegments_[numIndex] != second.numSegments_[numIndex] ) return first.numSegments_[numIndex] < second.numSegments_[numIndex];
else numIndex++;
}
}
return true;
}
};
//* equal to operator
inline bool operator == (const TextEncodingString& first, const TextEncodingString& second)
{ return first.get() == second.get(); }
//* specialized copy constructor
template<> TextEncodingString::TextEncodingString<TextEncodingString&>(TextEncodingString& );
template<> TextEncodingString::TextEncodingString<const TextEncodingString&>(const TextEncodingString& );
#endif
|
