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
|
/*
* Baltisot
* Copyright (C) 1999-2005 Nicolas "Pixel" Noble
*
* This program 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/* $Id: LuaRegex.cc,v 1.1 2005-03-31 16:23:05 pixel Exp $ */
#include "LuaRegex.h"
LuaRegex::LuaRegex(Regex * _r) : r(_r) { }
enum Regex_methods_t {
REGEX_MATCH = 0,
};
enum Regex_functions_t {
REGEX_NEWREGEX = 0,
};
struct lua_functypes_t Regex_methods[] = {
{ REGEX_MATCH, "Match", 1, 1, {LUA_STRING} },
{ -1, 0, 0, 0, 0 }
};
struct lua_functypes_t Regex_functions[] = {
{ REGEX_NEWREGEX, "Regex" , 1, 3, {LUA_STRING, LUA_NUMBER, LUA_NUMBER} },
{ -1, 0, 0, 0, 0 }
};
class sLua_Regex : public Base {
public:
DECLARE_METHOD(Regex, REGEX_MATCH);
DECLARE_FUNCTION(Regex, REGEX_NEWREGEX);
private:
static int Regex_proceed(Lua * L, int n, Regex * obj, int caller);
static int Regex_proceed_statics(Lua * L, int n, int caller);
};
void LuaRegex::pushmembers(Lua * L) {
pushme(L, r);
PUSH_METHOD(Regex, REGEX_MATCH);
}
void LuaRegex::pushstatics(Lua * L) throw (GeneralException) {
CHECK_METHODS(Regex);
CHECK_FUNCTIONS(Regex);
PUSH_FUNCTION(Regex, REGEX_NEWREGEX);
L->push("REG_EXTENDED");
L->push((lua_Number) REG_EXTENDED);
L->settable(LUA_GLOBALSINDEX);
L->push("REG_ICASE");
L->push((lua_Number) REG_ICASE);
L->settable(LUA_GLOBALSINDEX);
L->push("REG_NOSUB");
L->push((lua_Number) REG_NOSUB);
L->settable(LUA_GLOBALSINDEX);
L->push("REG_NEWLINE");
L->push((lua_Number) REG_NEWLINE);
L->settable(LUA_GLOBALSINDEX);
L->push("REG_NOTBOL");
L->push((lua_Number) REG_NOTBOL);
L->settable(LUA_GLOBALSINDEX);
L->push("REG_NOTEOL");
L->push((lua_Number) REG_NOTEOL);
L->settable(LUA_GLOBALSINDEX);
}
int sLua_Regex::Regex_proceed(Lua * L, int n, Regex * r, int caller) {
String s;
switch (caller) {
case REGEX_MATCH:
s = L->tostring(2);
L->push(r->Match(s));
break;
}
return 1;
}
int sLua_Regex::Regex_proceed_statics(Lua * L, int n, int caller) {
String s;
int cflags = REG_EXTENDED, eflags = 0;
switch (caller) {
case REGEX_NEWREGEX:
s = L->tostring(1);
if (n >= 2)
cflags = L->tonumber(2);
if (n >= 3)
eflags = L->tonumber(3);
{
LuaRegex c(new Regex(s, cflags, eflags));
c.pushdestruct(L);
}
break;
}
return 1;
}
|
