-
Notifications
You must be signed in to change notification settings - Fork 2
/
lua_rax.c
209 lines (174 loc) · 4.37 KB
/
lua_rax.c
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
#include <stdio.h>
#define LUA_LIB
#include <string.h>
#include <lua.h>
#include <lauxlib.h>
#include "rax.h"
static int
lrax_new(lua_State *L) {
rax *r = raxNew();
lua_pushlightuserdata(L, r);
return 1;
}
static int
lrax_destroy(lua_State *L) {
rax *r = (rax *)lua_touserdata(L, 1);
if (r == NULL) {
return 0;
}
raxFree(r);
return 0;
}
static int
lrax_insert(lua_State *L) {
rax *r = (rax *)lua_touserdata(L, 1);
if (r == NULL) {
return luaL_error(L, "tree is null.");
}
size_t len = 0;
unsigned char *buf = (unsigned char *)lua_tolstring(L, 2, &len);
if (buf == NULL) {
return luaL_error(L, "buf is null.");
}
intptr_t idx = luaL_checkinteger(L, 3);
int ret = raxInsert(r, buf, len, (void *)idx, NULL);
lua_pushboolean(L, ret);
return 1;
}
static int
lrax_find(lua_State *L) {
rax *r = (rax *)lua_touserdata(L, 1);
if (r == NULL) {
return luaL_error(L, "tree is null.");
}
size_t len = 0;
unsigned char *buf = (unsigned char *)lua_tolstring(L, 2, &len);
if (buf == NULL) {
return luaL_error(L, "buf is null.");
}
void *res = raxFind(r, buf, len);
if (res == raxNotFound) {
return 0;
}
intptr_t idx = (intptr_t)res;
lua_pushinteger(L, idx);
return 1;
}
static int
lrax_search(lua_State *L) {
raxIterator *iter = (raxIterator *)lua_touserdata(L, 1);
if (iter == NULL) {
return luaL_error(L, "iter is null.");
}
size_t len = 0;
unsigned char *buf = (unsigned char *)lua_tolstring(L, 2, &len);
if (buf == NULL) {
return luaL_error(L, "buf is null.");
}
int ret = raxSeek(iter, "<=", buf, len);
lua_pushboolean(L, ret);
return 1;
}
static int
lrax_prev(lua_State *L) {
raxIterator *iter = (raxIterator *)lua_touserdata(L, 1);
if (iter == NULL) {
return luaL_error(L, "iter is null.");
}
size_t len = 0;
unsigned char *buf = (unsigned char *)lua_tolstring(L, 2, &len);
if (buf == NULL) {
return luaL_error(L, "buf is null.");
}
int ret;
while (1) {
ret = raxPrev(iter);
if (!ret) {
lua_pushinteger(L, -1);
return 1;
}
//fprintf(stderr, "it key len: %lu buf len: %lu, key: %.*s\n",
// iter->key_len, len, (int)iter->key_len, iter->key);
if (iter->key_len > len || memcmp(buf, iter->key, iter->key_len) != 0) {
continue;
}
break;
}
intptr_t idx = (intptr_t)iter->data;
lua_pushinteger(L, idx);
return 1;
}
static int
lrax_next(lua_State *L) {
raxIterator *iter = (raxIterator *)lua_touserdata(L, 1);
if (iter == NULL) {
return luaL_error(L, "iter is null.");
}
size_t len = 0;
unsigned char *buf = (unsigned char *)lua_tolstring(L, 2, &len);
if (buf == NULL) {
return luaL_error(L, "buf is null.");
}
int ret = raxNext(iter);
if (!ret) {
lua_pushinteger(L, -1);
return 1;
}
if (iter->key_len > len || memcmp(buf, iter->key, iter->key_len != 0)) {
lua_pushinteger(L, -1);
return 1;
}
intptr_t idx = (intptr_t)iter->data;
lua_pushinteger(L, idx);
return 1;
}
static int
lrax_stop(lua_State *L) {
raxIterator *iter = (raxIterator *)lua_touserdata(L, 1);
if (iter == NULL) {
return 0;
}
raxStop(iter);
return 0;
}
static int
lrax_newit(lua_State *L) {
rax *r = (rax *)lua_touserdata(L, 1);
if (r == NULL) {
return luaL_error(L, "tree is null.");
}
raxIterator *iter = (raxIterator *)lua_newuserdata(L, sizeof(raxIterator));
if (iter == NULL) {
return 0;
}
raxStart(iter, r);
return 1;
}
static int
lrax_dump(lua_State *L) {
rax *r = (rax *)lua_touserdata(L, 1);
if (r == NULL) {
return luaL_error(L, "tree is null.");
}
raxShow(r);
return 0;
}
LUAMOD_API int
luaopen_rax_core(lua_State *L) {
luaL_checkversion(L);
luaL_Reg l[] = {
{ "new", lrax_new },
{ "destroy", lrax_destroy },
{ "insert", lrax_insert },
{ "find", lrax_find },
{ "search", lrax_search },
{ "prev", lrax_prev },
{ "next", lrax_next },
{ "stop", lrax_stop },
{ "newit", lrax_newit },
{ "dump", lrax_dump },
{ NULL, NULL },
};
luaL_newlib(L, l);
return 1;
}