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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/***************************************************************************
* luaquerymapper.cc
*
* Mon May 5 15:43:52 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 "luaquerymapper.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;
}
LUAQueryMapper::LUAQueryMapper(QueryResult &res)
{
L = luaL_newstate();
if(L == NULL) {
// throw LUADataParserException("Could not create LUA state.");
}
luaL_openlibs(L);
// FIXME: Insert these variables directly into the LUA stack instead of parsing them.
std::string preload = loadresultstring(res);
int s = luaL_loadbuffer(L, preload.c_str(), preload.size(), "preload");
switch(s) {
case 0: //no errors;
break;
case LUA_ERRSYNTAX: //syntax error during pre-compilation;
case LUA_ERRMEM: //memory allocation error.
case LUA_ERRFILE: //cannot open/read the file.
//throw LUADataParserException(lua_tostring(L, lua_gettop(L)));
break;
default:
//throw LUADataParserException("Unknown return value of luaL_loadfile.");
break;
}
// Run program (init)
lua_pcall(L, 0, LUA_MULTRET, 0);
}
LUAQueryMapper::~LUAQueryMapper()
{
lua_close(L);
}
std::string LUAQueryMapper::map(const std::string &mapper)
{
int s = luaL_loadbuffer(L, mapper.c_str(), mapper.size(), "mapper");
switch(s) {
case 0: //no errors;
break;
case LUA_ERRSYNTAX: //syntax error during pre-compilation;
case LUA_ERRMEM: //memory allocation error.
case LUA_ERRFILE: //cannot open/read the file.
//throw LUADataParserException(lua_tostring(L, lua_gettop(L)));
break;
default:
//throw LUADataParserException("Unknown return value of luaL_loadfile.");
break;
}
// Run the loaded code
lua_pcall(L, 0, LUA_MULTRET, 0);
return lua_tostring(L, lua_gettop(L));
}
#ifdef TEST_LUAQUERYMAPPER
int main()
{
QueryResult res;
QueryResult group1;
group1.values["dims"] = "42";
QueryResult group2;
group2.values["foo"] = "bar";
group2.values["bar"] = "foo";
group2.groups["fnuller"] = group1;
res.values["dims"] = "42";
res.groups["dimmer"] = group2;
LUAQueryMapper mapper(res);
std::string luamap = "return dimmer.fnuller.dims * 2 + dims";
printf("%s\n", mapper.map(luamap).c_str());
luamap = "return math.sin(dimmer.fnuller.dims * 2 + dims)";
printf("%s\n", mapper.map(luamap).c_str());
return 0;
}
#endif/*TEST_LUAQUERYMAPPER*/
|
