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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/***************************************************************************
* queryparser.cc
*
* Tue May 6 17:02:37 CEST 2008
* Copyright 2008 Bent Bisballe Nyeng, Lars Bisballe Jensen and Peter Skaarup
* deva@aasimon.org, elsenator@gmail.com and piparum@piparum.dk
****************************************************************************/
/*
* This file is part of Pracro.
*
* Pracro is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* Pracro is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with Pracro; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "queryparser.h"
QueryParser::QueryParser(std::string document)
{
this->document = document;
p = 0;
stack.push_back(&result);
}
void QueryParser::startTag(std::string name, std::map< std::string, std::string> attributes)
{
if(name == "group") {
QueryResult q;
stack.back()->groups[attributes["name"]] = q;
stack.push_back(&stack.back()->groups[attributes["name"]]);
}
if(name == "value") {
stack.back()->values[attributes["name"]] = attributes["value"];
}
}
void QueryParser::endTag(std::string name)
{
if(name == "group") stack.pop_back();
}
// FIXME: This is *not* the optimal way to do this.
int QueryParser::readData(char *data, size_t size)
{
size_t len = document.size() - p < size ? document.size() - p : size;
strncpy(data, document.c_str() + p, len);
p += len;
return len;
}
#ifdef TEST_QUERYPARSER
#include "queryhandler.h"
static std::string loadresultstring(QueryResult &res, std::string group = "")
{
std::string s;
std::map< std::string, std::string >::iterator v = res.values.begin();
while(v != res.values.end()) {
s += group + (*v).first + " = \"" + (*v).second + "\"\n";
v++;
}
std::map< std::string, QueryResult >::iterator g = res.groups.begin();
while(g != res.groups.end()) {
s += group + (*g).first + " = {}\n";
s += loadresultstring((*g).second, group + (*g).first + ".");
g++;
}
return s;
}
int main()
{
TCPSocket s;
s.connect("localhost", 11108);
QueryHandler qh(&s, "2003791613");
Query q1("lensmeter", "lensmeter");
qh.addQuery(q1);
std::string res = qh.exec();
printf("%s\n", res.c_str());
QueryParser e(res);
e.parse();
printf("%s\n", loadresultstring(e.result).c_str());
return 0;
}
#endif
|
