Newer
Older
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* The Apache Software License, Version 1.1
*
* Copyright (c) 2001 The Apache Software Foundation. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Apache Software Foundation (http://www.apache.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Xerces" and "Apache Software Foundation" must
* not be used to endorse or promote products derived from this
* software without prior written permission. For written
* permission, please contact apache\@apache.org.
*
* 5. Products derived from this software may not be called "Apache",
* nor may "Apache" appear in their name, without prior written
* permission of the Apache Software Foundation.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Apache Software Foundation, and was
* originally based on software copyright (c) 2001, International
* Business Machines, Inc., http://www.ibm.com . For more information
* on the Apache Software Foundation, please see
* <http://www.apache.org/>.
*/
/*
* $Id$
* $Log$
* Revision 1.1 2002/02/01 22:22:14 peiyongz
* Initial revision
*
* Revision 1.4 2001/11/14 22:04:03 peiyongz
* Patch to apply check on Year and more rigorous on other fields as well.
*
* Revision 1.3 2001/11/12 20:36:54 peiyongz
* SchemaDateTimeException defined
*
* Revision 1.2 2001/11/09 20:41:45 peiyongz
* Fix: compilation error on Solaris and AIX.
*
* Revision 1.1 2001/11/07 19:16:03 peiyongz
* DateTime Port
*
*
*/
// ---------------------------------------------------------------------------
// Includes
// ---------------------------------------------------------------------------
#include <stdlib.h>
#include <xercesc/util/XMLDateTime.hpp>
#include <xercesc/util/XMLString.hpp>
#include <xercesc/util/XMLUni.hpp>
#include <xercesc/util/Janitor.hpp>
//
// constants used to process raw data (fBuffer)
//
// [-]{CCYY-MM-DD}'T'{HH:MM:SS.MS}['Z']
// [{+|-}hh:mm']
//
static const XMLCh DURATION_STARTER = chLatin_P; // 'P'
static const XMLCh DURATION_Y = chLatin_Y; // 'Y'
static const XMLCh DURATION_M = chLatin_M; // 'M'
static const XMLCh DURATION_D = chLatin_D; // 'D'
static const XMLCh DURATION_H = chLatin_H; // 'H'
static const XMLCh DURATION_S = chLatin_S; // 'S'
static const XMLCh DATE_SEPARATOR = chDash; // '-'
static const XMLCh TIME_SEPARATOR = chColon; // ':'
static const XMLCh TIMEZONE_SEPARATOR = chColon; // ':'
static const XMLCh DATETIME_SEPARATOR = chLatin_T; // 'T'
static const XMLCh MILISECOND_SEPARATOR = chPeriod; // '.'
static const XMLCh UTC_STD_CHAR = chLatin_Z; // 'Z'
static const XMLCh UTC_POS_CHAR = chPlus; // '+'
static const XMLCh UTC_NEG_CHAR = chDash; // '-'
static const XMLCh UTC_SET[] = {UTC_STD_CHAR //"Z+-"
, UTC_POS_CHAR
, UTC_NEG_CHAR
, chNull};
static const int YMD_MIN_SIZE = 10; // CCYY-MM-DD
static const int YMONTH_MIN_SIZE = 7; // CCYY_MM
static const int TIME_MIN_SIZE = 8; // hh:mm:ss
static const int TIMEZONE_SIZE = 5; // hh:mm
static const int DAY_SIZE = 5; // ---DD
static const int MONTH_SIZE = 6; // --MM--
static const int MONTHDAY_SIZE = 7; // --MM-DD
static const int NOT_FOUND = -1;
//define constants to be used in assigning default values for
//all date/time excluding duration
static const int YEAR_DEFAULT = 2000;
static const int MONTH_DEFAULT = 01;
static const int DAY_DEFAULT = 15;
// order-relation on duration is a partial order. The dates below are used to
// for comparison of 2 durations, based on the fact that
// duration x and y is x<=y iff s+x<=s+y
// see 3.2.6 duration W3C schema datatype specs
//
// the dates are in format: {CCYY,MM,DD, H, S, M, MS, timezone}
static const int DATETIMES[][XMLDateTime::TOTAL_SIZE] =
{
{1696, 9, 1, 0, 0, 0, 0, XMLDateTime::UTC_STD},
{1697, 2, 1, 0, 0, 0, 0, XMLDateTime::UTC_STD},
{1903, 3, 1, 0, 0, 0, 0, XMLDateTime::UTC_STD},
{1903, 7, 1, 0, 0, 0, 0, XMLDateTime::UTC_STD}
};
// ---------------------------------------------------------------------------
// local methods
// ---------------------------------------------------------------------------
static inline int fQuotient(int a, int b)
{
div_t div_result = div(a, b);
return div_result.quot;
}
static inline int fQuotient(int temp, int low, int high)
{
return fQuotient(temp - low, high - low);
}
static inline int mod(int a, int b, int quotient)
{
return (a - quotient*b) ;
}
static inline int modulo (int temp, int low, int high)
{
//modulo(a - low, high - low) + low
int a = temp - low;
int b = high - low;
return (mod (a, b, fQuotient(a, b)) + low) ;
}
static inline bool isLeapYear(int year)
{
return((year%4 == 0) && ((year%100 != 0) || (year%400 == 0)));
}
static int maxDayInMonthFor(int year, int month)
{
if ( month == 4 || month == 6 || month == 9 || month == 11 )
{
return 30;
}
else if ( month==2 )
{
if ( isLeapYear(year) )
return 29;
else
return 28;
}
else
{
return 31;
}
}
// ---------------------------------------------------------------------------
// static methods : for duration
// ---------------------------------------------------------------------------
/**
* Compares 2 given durations. (refer to W3C Schema Datatypes "3.2.6 duration")
*
* 3.2.6.2 Order relation on duration
*
* In general, the order-relation on duration is a partial order since there is no
* determinate relationship between certain durations such as one month (P1M) and 30 days (P30D).
* The order-relation of two duration values x and y is x < y iff s+x < s+y for each qualified
* dateTime s in the list below.
*
* These values for s cause the greatest deviations in the addition of dateTimes and durations
*
**/
int XMLDateTime::compare(const XMLDateTime* const pDate1
, const XMLDateTime* const pDate2
, bool strict)
{
//REVISIT: this is unoptimazed vs of comparing 2 durations
// Algorithm is described in 3.2.6.2 W3C Schema Datatype specs
//
int resultA, resultB = INDETERMINATE;
//try and see if the objects are equal
if ( (resultA = compareOrder(pDate1, pDate2)) == EQUAL)
return EQUAL;
//long comparison algorithm is required
XMLDateTime tempA, *pTempA = &tempA;
XMLDateTime tempB, *pTempB = &tempB;
addDuration(pTempA, pDate1, 0);
addDuration(pTempB, pDate2, 0);
resultA = compareOrder(pTempA, pTempB);
if ( resultA == INDETERMINATE )
return INDETERMINATE;
addDuration(pTempA, pDate1, 1);
addDuration(pTempB, pDate2, 1);
resultB = compareOrder(pTempA, pTempB);
resultA = compareResult(resultA, resultB, strict);
if ( resultA == INDETERMINATE )
return INDETERMINATE;
addDuration(pTempA, pDate1, 2);
addDuration(pTempB, pDate2, 2);
resultB = compareOrder(pTempA, pTempB);
resultA = compareResult(resultA, resultB, strict);
if ( resultA == INDETERMINATE )
return INDETERMINATE;
addDuration(pTempA, pDate1, 3);
addDuration(pTempB, pDate2, 3);
resultB = compareOrder(pTempA, pTempB);
resultA = compareResult(resultA, resultB, strict);
return resultA;
}
//
// Form a new XMLDateTime with duration and baseDate array
// Note: C++ Java
// fNewDate duration
// fDuration date
//
void XMLDateTime::addDuration(XMLDateTime* fNewDate
, const XMLDateTime* const fDuration
, int index)
{
//REVISIT: some code could be shared between normalize() and this method,
// however is it worth moving it? The structures are different...
//
fNewDate->reset();
//add months (may be modified additionaly below)
int temp = DATETIMES[index][Month] + fDuration->fValue[Month];
fNewDate->fValue[Month] = modulo(temp, 1, 13);
int carry = fQuotient(temp, 1, 13);
//add years (may be modified additionaly below)
fNewDate->fValue[CentYear] = DATETIMES[index][CentYear] + fDuration->fValue[CentYear] + carry;
//add seconds
temp = DATETIMES[index][Second] + fDuration->fValue[Second];
carry = fQuotient (temp, 60);
fNewDate->fValue[Second] = mod(temp, 60, carry);
//add minutes
temp = DATETIMES[index][Minute] + fDuration->fValue[Minute] + carry;
carry = fQuotient(temp, 60);
fNewDate->fValue[Minute] = mod(temp, 60, carry);
//add hours
temp = DATETIMES[index][Hour] + fDuration->fValue[Hour] + carry;
carry = fQuotient(temp, 24);
fNewDate->fValue[Hour] = mod(temp, 24, carry);
fNewDate->fValue[Day] = DATETIMES[index][Day] + fDuration->fValue[Day] + carry;
while ( true )
{
temp = maxDayInMonthFor(fNewDate->fValue[CentYear], fNewDate->fValue[Month]);
if ( fNewDate->fValue[Day] < 1 )
{ //original fNewDate was negative
fNewDate->fValue[Day] += maxDayInMonthFor(fNewDate->fValue[CentYear], fNewDate->fValue[Month]-1);
carry = -1;
}
else if ( fNewDate->fValue[Day] > temp )
{
fNewDate->fValue[Day] -= temp;
carry = 1;
}
else
{
break;
}
temp = fNewDate->fValue[Month] + carry;
fNewDate->fValue[Month] = modulo(temp, 1, 13);
fNewDate->fValue[CentYear] += fQuotient(temp, 1, 13);
}
//fNewDate->fValue[utc] = UTC_STD_CHAR;
fNewDate->fValue[utc] = UTC_STD;
}
int XMLDateTime::compareResult(short resultA
, short resultB
, bool strict)
{
if ( resultB == INDETERMINATE )
{
return INDETERMINATE;
}
else if ( (resultA != resultB) &&
strict )
{
return INDETERMINATE;
}
else if ( (resultA != resultB) &&
!strict )
{
if ( (resultA != EQUAL) &&
(resultB != EQUAL) )
{
return INDETERMINATE;
}
else
{
return (resultA != EQUAL)? resultA : resultB;
}
}
return resultA;
}
// ---------------------------------------------------------------------------
// static methods : for others
// ---------------------------------------------------------------------------
int XMLDateTime::compare(const XMLDateTime* const pDate1
, const XMLDateTime* const pDate2)
{
if (pDate1->fValue[utc] == pDate2->fValue[utc])
{
return XMLDateTime::compareOrder(pDate1, pDate2);
}
short c1, c2;
if ( pDate1->isNormalized())
{
c1 = compareResult(pDate1, pDate2, false, UTC_POS);
c2 = compareResult(pDate1, pDate2, false, UTC_NEG);
return getRetVal(c1, c2);
}
else if ( pDate2->isNormalized())
{
c1 = compareResult(pDate1, pDate2, true, UTC_POS);
c2 = compareResult(pDate1, pDate2, true, UTC_NEG);
return getRetVal(c1, c2);
}
return INDETERMINATE;
}
int XMLDateTime::compareResult(const XMLDateTime* const pDate1
, const XMLDateTime* const pDate2
, bool set2Left
, int utc_type)
{
XMLDateTime tmpDate = (set2Left ? *pDate1 : *pDate2);
tmpDate.fTimeZone[hh] = 14;
tmpDate.fTimeZone[mm] = 0;
tmpDate.fValue[utc] = utc_type;
tmpDate.normalize();
return (set2Left? XMLDateTime::compareOrder(&tmpDate, pDate2) :
XMLDateTime::compareOrder(pDate1, &tmpDate));
}
int XMLDateTime::compareOrder(const XMLDateTime* const lValue
, const XMLDateTime* const rValue)
{
//
// If any of the them is not normalized() yet,
// we need to do something here.
//
XMLDateTime lTemp = *lValue;
XMLDateTime rTemp = *rValue;
lTemp.normalize();
rTemp.normalize();
for ( int i = 0 ; i < TOTAL_SIZE; i++ )
{
if ( lTemp.fValue[i] < rTemp.fValue[i] )
{
return LESS_THAN;
}
else if ( lTemp.fValue[i] > rTemp.fValue[i] )
{
return GREATER_THAN;
}
}
return EQUAL;
}
// ---------------------------------------------------------------------------
// ctor and dtor
// ---------------------------------------------------------------------------
XMLDateTime::~XMLDateTime()
{
if (fBuffer)
delete[] fBuffer;
}
XMLDateTime::XMLDateTime()
:fBuffer(0)
{
reset();
}
XMLDateTime::XMLDateTime(const XMLCh* const aString)
:fBuffer(0)
{
setBuffer(aString);
}
// -----------------------------------------------------------------------
// Copy ctor and Assignment operators
// -----------------------------------------------------------------------
XMLDateTime::XMLDateTime(const XMLDateTime &toCopy)
:fBuffer(0)
{
copy(toCopy);
}
XMLDateTime& XMLDateTime::operator=(const XMLDateTime& rhs)
{
if (this == &rhs)
return *this;
copy(rhs);
return *this;
}
// -----------------------------------------------------------------------
// Implementation of Abstract Interface
// -----------------------------------------------------------------------
//
// We may simply return the handle to fBuffer, but
// for the sake of consistency, we return a duplicated copy
// and the caller is responsible for the release of the buffer
// just like any other things in the XMLNumber family.
//
XMLCh* XMLDateTime::toString() const
{
assertBuffer();
XMLCh* retBuf = XMLString::replicate(fBuffer);
return retBuf;
}
int XMLDateTime::getSign() const
{
return 0;
}
// ---------------------------------------------------------------------------
// Parsers
// ---------------------------------------------------------------------------
//
// [-]{CCYY-MM-DD}'T'{HH:MM:SS.MS}[TimeZone]
//
void XMLDateTime::parseDateTime()
{
initParser();
getDate();
//fStart is supposed to point to 'T'
if (fBuffer[fStart++] != DATETIME_SEPARATOR)
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dt_missingT
, fBuffer);
getTime();
validateDateTime();
normalize();
}
//
// [-]{CCYY-MM-DD}[TimeZone]
//
void XMLDateTime::parseDate()
{
initParser();
getDate();
parseTimeZone();
validateDateTime();
normalize();
}
void XMLDateTime::parseTime()
{
initParser();
// time initialize to default values
fValue[CentYear]= YEAR_DEFAULT;
fValue[Month] = MONTH_DEFAULT;
fValue[Day] = DAY_DEFAULT;
getTime();
validateDateTime();
normalize();
}
//
// {---DD}[TimeZone]
// 01234
//
void XMLDateTime::parseDay()
{
initParser();
if (fBuffer[0] != DATE_SEPARATOR ||
fBuffer[1] != DATE_SEPARATOR ||
fBuffer[2] != DATE_SEPARATOR )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_gDay_invalid
, fBuffer);
}
//initialize values
fValue[CentYear] = YEAR_DEFAULT;
fValue[Month] = MONTH_DEFAULT;
fValue[Day] = parseInt(fStart+3, fStart+5);
if ( DAY_SIZE < fEnd )
{
int sign = findUTCSign(DAY_SIZE);
if ( sign < 0 )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_gDay_invalid
, fBuffer);
}
else
{
getTimeZone(sign);
}
}
validateDateTime();
normalize();
}
//
// {--MM--}[TimeZone]
// 012345
//
void XMLDateTime::parseMonth()
{
initParser();
if (fBuffer[0] != DATE_SEPARATOR ||
fBuffer[1] != DATE_SEPARATOR ||
fBuffer[4] != DATE_SEPARATOR ||
fBuffer[5] != DATE_SEPARATOR )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_gMth_invalid
, fBuffer);
}
//set constants
fValue[CentYear] = YEAR_DEFAULT;
fValue[Day] = DAY_DEFAULT;
fValue[Month] = parseInt(2, 4);
if ( MONTH_SIZE < fEnd )
{
int sign = findUTCSign(MONTH_SIZE);
if ( sign < 0 )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_gMth_invalid
, fBuffer);
}
else
{
getTimeZone(sign);
}
}
validateDateTime();
normalize();
}
//
//[-]{CCYY}[TimeZone]
// 0 1234
//
void XMLDateTime::parseYear()
{
initParser();
// skip the first '-' and search for timezone
//
int sign = findUTCSign((fBuffer[0] == chDash) ? 1 : 0);
if (sign == NOT_FOUND)
{
fValue[CentYear] = parseIntYear(fEnd);
}
else
{
fValue[CentYear] = parseIntYear(sign);
getTimeZone(sign);
}
//initialize values
fValue[Month] = MONTH_DEFAULT;
fValue[Day] = DAY_DEFAULT; //java is 1
validateDateTime();
normalize();
}
//
//{--MM-DD}[TimeZone]
// 0123456
//
void XMLDateTime::parseMonthDay()
{
initParser();
if (fBuffer[0] != DATE_SEPARATOR ||
fBuffer[1] != DATE_SEPARATOR ||
fBuffer[4] != DATE_SEPARATOR )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_gMthDay_invalid
, fBuffer);
}
//initialize
fValue[CentYear] = YEAR_DEFAULT;
fValue[Month] = parseInt(2, 4);
fValue[Day] = parseInt(5, 7);
if ( MONTHDAY_SIZE < fEnd )
{
int sign = findUTCSign(MONTHDAY_SIZE);
if ( sign<0 )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_gMthDay_invalid
, fBuffer);
}
else
{
getTimeZone(sign);
}
}
validateDateTime();
normalize();
}
void XMLDateTime::parseYearMonth()
{
initParser();
// get date
getYearMonth();
fValue[Day] = DAY_DEFAULT;
parseTimeZone();
validateDateTime();
normalize();
}
//
//PnYn MnDTnH nMnS: -P1Y2M3DT10H30M
//
// [-]{'P'{[n'Y'][n'M'][n'D']['T'][n'H'][n'M'][n'S']}}
//
// Note: the n above shall be >= 0
// if no time element found, 'T' shall be absent
//
void XMLDateTime::parseDuration()
{
initParser();
// must start with '-' or 'P'
//
XMLCh c = fBuffer[fStart++];
if ( (c != DURATION_STARTER) &&
(c != chDash) )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dur_Start_dashP
, fBuffer);
}
// 'P' must ALWAYS be present in either case
if ( (c == chDash) &&
(fBuffer[fStart++]!= DURATION_STARTER ))
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dur_noP
, fBuffer);
}
// java code
//date[utc]=(c=='-')?'-':0;
//fValue[utc] = UTC_STD;
fValue[utc] = (fBuffer[0] == chDash? UTC_NEG : UTC_STD);
int negate = ( fBuffer[0] == chDash ? -1 : 1);
//
// No negative value is allowed after 'P'
//
// eg P-1234, invalid
//
if (indexOf(fStart, fEnd, chDash) != NOT_FOUND)
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dur_DashNotFirst
, fBuffer);
}
//at least one number and designator must be seen after P
bool designator = false;
int endDate = indexOf(fStart, fEnd, DATETIME_SEPARATOR);
if ( endDate == NOT_FOUND )
{
endDate = fEnd; // 'T' absent
}
//find 'Y'
int end = indexOf(fStart, endDate, DURATION_Y);
if ( end != NOT_FOUND )
{
//scan year
fValue[CentYear] = negate * parseInt(fStart, end);
fStart = end+1;
designator = true;
}
end = indexOf(fStart, endDate, DURATION_M);
if ( end != NOT_FOUND )
{
//scan month
fValue[Month] = negate * parseInt(fStart, end);
fStart = end+1;
designator = true;
}
end = indexOf(fStart, endDate, DURATION_D);
if ( end != NOT_FOUND )
{
//scan day
fValue[Day] = negate * parseInt(fStart,end);
fStart = end+1;
designator = true;
}
if ( (fEnd == endDate) && // 'T' absent
(fStart != fEnd) ) // something after Day
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dur_inv_b4T
, fBuffer);
}
if ( fEnd != endDate ) // 'T' present
{
//scan hours, minutes, seconds
//
// skip 'T' first
end = indexOf(++fStart, fEnd, DURATION_H);
if ( end != NOT_FOUND )
{
//scan hours
fValue[Hour] = negate * parseInt(fStart, end);
fStart = end+1;
designator = true;
}
end = indexOf(fStart, fEnd, DURATION_M);
if ( end != NOT_FOUND )
{
//scan min
fValue[Minute] = negate * parseInt(fStart, end);
fStart = end+1;
designator = true;
}
end = indexOf(fStart, fEnd, DURATION_S);
if ( end != NOT_FOUND )
{
//scan seconds
int mlsec = indexOf (fStart, end, MILISECOND_SEPARATOR);
if ( mlsec != NOT_FOUND )
{
fValue[Second] = negate * parseInt(fStart, mlsec);
fValue[MiliSecond] = negate * parseInt(mlsec+1, end);
}
else
{
fValue[Second] = negate * parseInt(fStart,end);
}
fStart = end+1;
designator = true;
}
// no additional data should appear after last item
// P1Y1M1DT is illigal value as well
if ( (fStart != fEnd) ||
fBuffer[--fStart] == DATETIME_SEPARATOR )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dur_NoTimeAfterT
,fBuffer);
}
}
if ( !designator )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_dur_NoElementAtAll
, fBuffer);
}
}
// ---------------------------------------------------------------------------
// Scanners
// ---------------------------------------------------------------------------
//
// [-]{CCYY-MM-DD}
//
// Note: CCYY could be more than 4 digits
// Assuming fStart point to the beginning of the Date Section
// fStart updated to point to the position right AFTER the second 'D'
// Since the lenght of CCYY might be variable, we can't check format upfront
//
void XMLDateTime::getDate()
{
// Ensure enough chars in buffer
if ( (fStart+YMD_MIN_SIZE) > fEnd)
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_date_incomplete
, fBuffer);
getYearMonth(); // Scan YearMonth and
// fStart point to the next '-'
if (fBuffer[fStart++] != DATE_SEPARATOR)
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_date_invalid
, fBuffer);
//("CCYY-MM must be followed by '-' sign");
}
fValue[Day] = parseInt(fStart, fStart+2);
fStart += 2 ; //fStart points right after the Day
return;
}
//
// hh:mm:ss[.msssss]['Z']
// hh:mm:ss[.msssss][['+'|'-']hh:mm]
// 012345678
//
// Note: Assuming fStart point to the beginning of the Time Section
// fStart updated to point to the position right AFTER the second 's'
// or ms if any
//
void XMLDateTime::getTime()
{
// Ensure enough chars in buffer
if ( (fStart+TIME_MIN_SIZE) > fEnd)
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_time_incomplete
, fBuffer);
//"Imcomplete Time Format"
// check (fixed) format first
if ((fBuffer[fStart + 2] != TIME_SEPARATOR) ||
(fBuffer[fStart + 5] != TIME_SEPARATOR) )
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_time_invalid
, fBuffer);
//("Error in parsing time" );
}
//
// get hours, minute and second
//
fValue[Hour] = parseInt(fStart + 0, fStart + 2);
fValue[Minute] = parseInt(fStart + 3, fStart + 5);
fValue[Second] = parseInt(fStart + 6, fStart + 8);
fStart += 8;
// to see if any ms and/or utc part after that
if (fStart >= fEnd)
return;
//find UTC sign if any
int sign = findUTCSign(fStart);
//parse miliseconds
int milisec = (fBuffer[fStart] == MILISECOND_SEPARATOR)? fStart : NOT_FOUND;
if ( milisec != NOT_FOUND )
{
fStart++; // skip the '.'
// make sure we have some thing between the '.' and fEnd
if (fStart >= fEnd)
{
ThrowXML1(SchemaDateTimeException
, XMLExcepts::DateTime_ms_noDigit
, fBuffer);
//("ms shall be present once '.' is present" );
}
if ( sign == NOT_FOUND )
{
fValue[MiliSecond] = parseInt(fStart, fEnd); //get ms between '.' and fEnd
fStart = fEnd;
}
else
{
fValue[MiliSecond] = parseInt(fStart, sign); //get ms between UTC sign and fEnd
}
}
//parse UTC time zone (hh:mm)
if ( sign > 0 ) {
getTimeZone(sign);
}
}
//
// [-]{CCYY-MM}
//
// Note: CCYY could be more than 4 digits
// fStart updated to point AFTER the second 'M' (probably meet the fEnd)
//
void XMLDateTime::getYearMonth()
{
// Ensure enough chars in buffer