1 /*
2 Copyright 2011 Jared Krinke.
3
4 Permission is hereby granted, free of charge, to any person obtaining a copy
5 of this software and associated documentation files (the "Software"), to deal
6 in the Software without restriction, including without limitation the rights
7 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8 copies of the Software, and to permit persons to whom the Software is
9 furnished to do so, subject to the following conditions:
10
11 The above copyright notice and this permission notice shall be included in
12 all copies or substantial portions of the Software.
13
14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20 THE SOFTWARE.
21 */
22
23 #include <lua.h>
24 #include <lauxlib.h>
25 #include <stdlib.h>
26
27 #include "r_assert.h"
28 #include "r_element.h"
29 #include "r_element_list.h"
30 #include "r_script.h"
31
32 r_object_ref_t r_element_list_ref_new = { R_OBJECT_REF_INVALID, { NULL } };
33 r_object_ref_t r_element_list_ref_add = { R_OBJECT_REF_INVALID, { NULL } };
34 r_object_ref_t r_element_list_ref_for_each = { R_OBJECT_REF_INVALID, { NULL } };
35 r_object_ref_t r_element_list_ref_remove = { R_OBJECT_REF_INVALID, { NULL } };
36 r_object_ref_t r_element_list_ref_clear = { R_OBJECT_REF_INVALID, { NULL } };
37
38 /* TODO: Ensure const is used on these and everywhere else that it makes sense (e.g. object fields) */
r_element_compare(r_object_t * a,r_object_t * b)39 static int r_element_compare(r_object_t *a, r_object_t *b)
40 {
41 r_element_t *element_a = (r_element_t*)a;
42 r_element_t *element_b = (r_element_t*)b;
43
44 return (element_a->z == element_b->z) ? 0 : ((element_a->z > element_b->z) ? 1 : -1);
45 }
46
r_element_list_init(r_state_t * rs,r_object_t * object)47 static r_status_t r_element_list_init(r_state_t *rs, r_object_t *object)
48 {
49 return r_zlist_init(rs, object, R_OBJECT_TYPE_ELEMENT_LIST, R_OBJECT_TYPE_ELEMENT, r_element_compare);
50 }
51
r_element_list_cleanup(r_state_t * rs,r_object_t * object)52 static r_status_t r_element_list_cleanup(r_state_t *rs, r_object_t *object)
53 {
54 return r_zlist_cleanup(rs, object, R_OBJECT_TYPE_ELEMENT_LIST);
55 }
56
l_ElementList_add(lua_State * ls)57 static int l_ElementList_add(lua_State *ls)
58 {
59 return l_ZList_add(ls, R_OBJECT_TYPE_ELEMENT_LIST);
60 }
61
l_ElementList_forEach(lua_State * ls)62 static int l_ElementList_forEach(lua_State *ls)
63 {
64 return l_ZList_forEach(ls, R_OBJECT_TYPE_ELEMENT_LIST, R_OBJECT_TYPE_ELEMENT);
65 }
66
l_ElementList_remove(lua_State * ls)67 static int l_ElementList_remove(lua_State *ls)
68 {
69 return l_ZList_remove(ls, R_OBJECT_TYPE_ELEMENT_LIST, R_OBJECT_TYPE_ELEMENT);
70 }
71
l_ElementList_clear(lua_State * ls)72 static int l_ElementList_clear(lua_State *ls)
73 {
74 return l_ZList_clear(ls, R_OBJECT_TYPE_ELEMENT_LIST);
75 }
76
77 r_object_field_t r_element_list_fields[] = {
78 { "add", LUA_TFUNCTION, 0, 0, R_FALSE, R_OBJECT_INIT_EXCLUDED, NULL, r_object_ref_field_read_global, &r_element_list_ref_add, NULL },
79 { "forEach", LUA_TFUNCTION, 0, 0, R_FALSE, R_OBJECT_INIT_EXCLUDED, NULL, r_object_ref_field_read_global, &r_element_list_ref_for_each, NULL },
80 { "remove", LUA_TFUNCTION, 0, 0, R_FALSE, R_OBJECT_INIT_EXCLUDED, NULL, r_object_ref_field_read_global, &r_element_list_ref_remove, NULL },
81 { "clear", LUA_TFUNCTION, 0, 0, R_FALSE, R_OBJECT_INIT_EXCLUDED, NULL, r_object_ref_field_read_global, &r_element_list_ref_clear, NULL },
82 { NULL, LUA_TNIL, 0, 0, R_FALSE, 0, NULL, NULL, NULL, NULL }
83 };
84
85 r_object_header_t r_element_list_header = { R_OBJECT_TYPE_ELEMENT_LIST, sizeof(r_element_list_t), R_FALSE, r_element_list_fields, r_element_list_init, r_zlist_process_arguments, r_element_list_cleanup };
86
l_ElementList_new(lua_State * ls)87 static int l_ElementList_new(lua_State *ls)
88 {
89 return l_Object_new(ls, &r_element_list_header);
90 }
91
r_element_list_remove_index(r_state_t * rs,r_object_t * parent,r_element_list_t * element_list,unsigned int item)92 r_status_t r_element_list_remove_index(r_state_t *rs, r_object_t *parent, r_element_list_t *element_list, unsigned int item)
93 {
94 return r_zlist_remove_index(rs, parent, element_list, item);
95 }
96
r_element_list_setup(r_state_t * rs)97 r_status_t r_element_list_setup(r_state_t *rs)
98 {
99 r_status_t status = (rs != NULL && rs->script_state != NULL) ? R_SUCCESS : R_F_INVALID_POINTER;
100 R_ASSERT(R_SUCCEEDED(status));
101
102 if (R_SUCCEEDED(status))
103 {
104 r_script_node_t element_list_nodes[] = { { "new", R_SCRIPT_NODE_TYPE_FUNCTION, NULL, l_ElementList_new }, { NULL } };
105
106 r_script_node_root_t roots[] = {
107 { 0, &r_element_list_ref_new, { "", R_SCRIPT_NODE_TYPE_FUNCTION, NULL, l_ElementList_new } },
108 { 0, &r_element_list_ref_add, { "", R_SCRIPT_NODE_TYPE_FUNCTION, NULL, l_ElementList_add } },
109 { 0, &r_element_list_ref_for_each, { "", R_SCRIPT_NODE_TYPE_FUNCTION, NULL, l_ElementList_forEach } },
110 { 0, &r_element_list_ref_remove, { "", R_SCRIPT_NODE_TYPE_FUNCTION, NULL, l_ElementList_remove } },
111 { 0, &r_element_list_ref_clear, { "", R_SCRIPT_NODE_TYPE_FUNCTION, NULL, l_ElementList_clear } },
112 { LUA_GLOBALSINDEX, NULL, { "ElementList", R_SCRIPT_NODE_TYPE_TABLE, element_list_nodes } },
113 { 0, NULL, { NULL, R_SCRIPT_NODE_TYPE_MAX, NULL, NULL } }
114 };
115
116 status = r_script_register_nodes(rs, roots);
117 }
118
119 return status;
120 }
121
r_element_list_field_init(r_state_t * rs,r_object_t * object,const r_object_field_t * field,void * value)122 r_status_t r_element_list_field_init(r_state_t *rs, r_object_t *object, const r_object_field_t *field, void *value)
123 {
124 return r_object_field_object_init_new(rs, object, value, R_OBJECT_TYPE_ELEMENT_LIST, &r_element_list_ref_new);
125 }
126