blob: 5dab6c9e6932846987b1344093daaa5759293ed0 (
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
|
// file : xsde/cxx/serializer/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 <string.h> // strlen
#include <xsde/cxx/string-search.hxx>
#include <xsde/cxx/serializer/validating/string-common.hxx>
namespace xsde
{
namespace cxx
{
namespace serializer
{
namespace validating
{
bool string_common::
validate_facets (const char* s,
const string_facets::facets& f,
context& ctx)
{
if (f.length_set_ ||
f.min_length_set_ ||
f.max_length_set_ ||
f.enum_count_ != 0)
{
return validate_facets (s, strlen (s), f, ctx);
}
return true;
}
bool string_common::
validate_facets (const char* s,
size_t n,
const string_facets::facets& f,
context& ctx)
{
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)
{
if (search (f.enum_, f.enum_count_, s) == f.enum_count_)
{
ctx.schema_error (schema_error::value_not_in_enumeration);
return false;
}
}
return true;
}
}
}
}
}
|
