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
|
/*=============================================================================
Copyright (c) 2011-2013 Daniel James
Use, modification and distribution is subject to the Boost Software
License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#include "document_state_impl.hpp"
#include "utils.hpp"
#include <boost/range/algorithm.hpp>
namespace quickbook
{
namespace
{
char const* id_attributes_[] =
{
"id",
"linkend",
"linkends",
"arearefs"
};
}
xml_processor::xml_processor()
{
static int const n_id_attributes = sizeof(id_attributes_)/sizeof(char const*);
for (int i = 0; i != n_id_attributes; ++i)
{
id_attributes.push_back(id_attributes_[i]);
}
boost::sort(id_attributes);
}
template <typename Iterator>
bool read(Iterator& it, Iterator end, char const* text)
{
for(Iterator it2 = it;; ++it2, ++text) {
if (!*text) {
it = it2;
return true;
}
if (it2 == end || *it2 != *text)
return false;
}
}
template <typename Iterator>
void read_past(Iterator& it, Iterator end, char const* text)
{
while (it != end && !read(it, end, text)) ++it;
}
bool find_char(char const* text, char c)
{
for(;*text; ++text)
if (c == *text) return true;
return false;
}
template <typename Iterator>
void read_some_of(Iterator& it, Iterator end, char const* text)
{
while(it != end && find_char(text, *it)) ++it;
}
template <typename Iterator>
void read_to_one_of(Iterator& it, Iterator end, char const* text)
{
while(it != end && !find_char(text, *it)) ++it;
}
void xml_processor::parse(boost::string_ref source, callback& c)
{
typedef boost::string_ref::const_iterator iterator;
c.start(source);
iterator it = source.begin(), end = source.end();
for(;;)
{
read_past(it, end, "<");
if (it == end) break;
if (read(it, end, "!--quickbook-escape-prefix-->"))
{
read_past(it, end, "<!--quickbook-escape-postfix-->");
continue;
}
switch(*it)
{
case '?':
++it;
read_past(it, end, "?>");
break;
case '!':
if (read(it, end, "!--"))
read_past(it, end, "-->");
else
read_past(it, end, ">");
break;
default:
if ((*it >= 'a' && *it <= 'z') ||
(*it >= 'A' && *it <= 'Z') ||
*it == '_' || *it == ':')
{
read_to_one_of(it, end, " \t\n\r>");
for (;;) {
read_some_of(it, end, " \t\n\r");
iterator name_start = it;
read_to_one_of(it, end, "= \t\n\r>");
if (it == end || *it == '>') break;
boost::string_ref name(name_start, it - name_start);
++it;
read_some_of(it, end, "= \t\n\r");
if (it == end || (*it != '"' && *it != '\'')) break;
char delim = *it;
++it;
iterator value_start = it;
it = std::find(it, end, delim);
if (it == end) break;
boost::string_ref value(value_start, it - value_start);
++it;
if (boost::find(id_attributes, detail::to_s(name))
!= id_attributes.end())
{
c.id_value(value);
}
}
}
else
{
read_past(it, end, ">");
}
}
}
c.finish(source);
}
}
|
