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
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
This file is part of KAddressbook.
Copyright (c) 2003 Tobias Koenig <tokoe@kde.org>
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, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, permission is given to link this program
with any edition of TQt, and distribute the resulting executable,
without including the source code for TQt in the source distribution.
*/
#include <tqdatetime.h>
#include "dateparser.h"
DateParser::DateParser( const TQString &pattern )
: mPattern( pattern )
{
}
DateParser::~DateParser()
{
}
TQDate DateParser::parse( const TQString &dateStr ) const
{
int year, month, day;
year = month = day = 0;
uint currPos = 0;
for ( uint i = 0; i < mPattern.length(); ++i ) {
if ( mPattern[ i ] == 'y' ) { // 19YY
if ( currPos + 1 < dateStr.length() ) {
year = 1900 + dateStr.mid( currPos, 2 ).toInt();
currPos += 2;
} else
return TQDate();
} else if ( mPattern[ i ] == 'Y' ) { // YYYY
if ( currPos + 3 < dateStr.length() ) {
year = dateStr.mid( currPos, 4 ).toInt();
currPos += 4;
} else
return TQDate();
} else if ( mPattern[ i ] == 'm' ) { // M or MM
if ( currPos + 1 < dateStr.length() ) {
if ( dateStr[ currPos ].isDigit() ) {
if ( dateStr[ currPos + 1 ].isDigit() ) {
month = dateStr.mid( currPos, 2 ).toInt();
currPos += 2;
continue;
}
}
}
if ( currPos < dateStr.length() ) {
if ( dateStr[ currPos ].isDigit() ) {
month = dateStr.mid( currPos, 1 ).toInt();
currPos++;
continue;
}
}
return TQDate();
} else if ( mPattern[ i ] == 'M' ) { // 0M or MM
if ( currPos + 1 < dateStr.length() ) {
month = dateStr.mid( currPos, 2 ).toInt();
currPos += 2;
} else
return TQDate();
} else if ( mPattern[ i ] == 'd' ) { // D or DD
if ( currPos + 1 < dateStr.length() ) {
if ( dateStr[ currPos ].isDigit() ) {
if ( dateStr[ currPos + 1 ].isDigit() ) {
day = dateStr.mid( currPos, 2 ).toInt();
currPos += 2;
continue;
}
}
}
if ( currPos < dateStr.length() ) {
if ( dateStr[ currPos ].isDigit() ) {
day = dateStr.mid( currPos, 1 ).toInt();
currPos++;
continue;
}
}
return TQDate();
} else if ( mPattern[ i ] == 'D' ) { // 0D or DD
if ( currPos + 1 < dateStr.length() ) {
day = dateStr.mid( currPos, 2 ).toInt();
currPos += 2;
} else
return TQDate();
} else {
currPos++;
}
}
return TQDate( year, month, day );
}
|
