blob: 56c1443f08924cf46d2d8d190b8bce3c62470067 (
plain)
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
|
// file : xsde/cxx/parser/validating/boolean.cxx
// copyright : Copyright (c) 2005-2011 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#include <xsde/cxx/parser/validating/boolean.hxx>
namespace xsde
{
namespace cxx
{
namespace parser
{
namespace validating
{
void boolean_pimpl::
_pre ()
{
size_ = 0;
state_ = leading_ws;
}
void boolean_pimpl::
_characters (const ro_string& s)
{
ro_string tmp (s.data (), s.size ());
size_t size = tmp.size ();
switch (state_)
{
case leading_ws:
{
size = trim_left (tmp);
if (size != 0)
state_ = literal;
else
break;
// Fall through.
}
case literal:
{
// If this chunk is too long then it has to be the last so trim
// trailing ws.
//
if ((5 - size_) < size)
{
size = trim_right (tmp);
state_ = trailing_ws; // It either had ws or is too large.
}
if ((5 - size_) >= size)
{
memcpy (str_ + size_, tmp.data (), size);
size_ += size;
}
else
_schema_error (schema_error::invalid_boolean_value);
break;
}
case trailing_ws:
{
if (trim_left (tmp) != 0)
_schema_error (schema_error::invalid_boolean_value);
}
}
}
void boolean_pimpl::
_post ()
{
ro_string tmp (str_, size_);
trim_right (tmp);
if (tmp == "1" || tmp == "true")
value_ = true;
else if (tmp == "0" || tmp == "false")
value_ = false;
else
_schema_error (schema_error::invalid_boolean_value);
}
bool boolean_pimpl::
post_boolean ()
{
return value_;
}
}
}
}
}
|