blob: 9558e30599dffe14bea9c20eaa4f99ee0ac6af27 (
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
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
|
// file : xsde/cxx/parser/validating/string-common.cxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2005-2010 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#include <xsde/cxx/string-search.hxx>
#include <xsde/cxx/parser/validating/string-common.hxx>
namespace xsde
{
namespace cxx
{
namespace parser
{
namespace validating
{
bool string_common::
validate_facets (
#ifdef XSDE_STL
std::string& str,
#else
string& str,
#endif
const string_facets::facets& f,
context& ctx)
{
#ifdef XSDE_STL
typedef std::string::size_type size_type;
#else
typedef string::size_type size_type;
#endif
if (f.whitespace_ == 2)
{
// Collapse. The left trimming has already been performed.
//
size_type size = str.size ();
size_type j = 0;
bool subs = false;
for (size_type i = 0; i < size; ++i)
{
char c = str[i];
if (c == 0x20 || c == 0x0A || c == 0x0D || c == 0x09)
{
subs = true;
}
else
{
if (subs)
{
subs = false;
str[j++] = 0x20;
}
str[j++] = c;
}
}
#ifdef XSDE_STL
str.resize (j);
#else
str.truncate (j);
#endif
}
else if (f.whitespace_ == 1)
{
// Replace.
//
size_type size = str.size ();
for (size_type i = 0; i < size; ++i)
{
char& c = str[i];
if (c == 0x0A || c == 0x0D || c == 0x09)
c = 0x20;
}
}
#ifdef XSDE_STL
const char* s = str.c_str ();
#else
const char* s = str.data ();
#endif
size_t n = str.size ();
if (f.length_set_ && n != f.length_)
{
ctx.schema_error (schema_error::length_not_equal_prescribed);
return false;
}
if (f.min_length_set_ && n < f.min_length_)
{
ctx.schema_error (schema_error::length_less_than_min);
return false;
}
if (f.max_length_set_ && n > f.max_length_)
{
ctx.schema_error (schema_error::length_greater_than_max);
return false;
}
if (f.enum_count_ != 0)
{
size_t i = search (f.enum_, f.enum_count_, s);
if (i == f.enum_count_)
{
ctx.schema_error (schema_error::value_not_in_enumeration);
return false;
}
}
return true;
}
}
}
}
}
|