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
|
/* -*- c-basic-offset: 2 -*- */
/*
Copyright(C) 2015 Brazil
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License version 2.1 as published by the Free Software Foundation.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "../grn_ctx_impl.h"
#ifdef GRN_WITH_MRUBY
#include <mruby.h>
#include <mruby/class.h>
#include <mruby/data.h>
#include <mruby/hash.h>
#include <mruby/array.h>
#include <mruby/string.h>
#include "mrb_ctx.h"
#include "mrb_table_sort_key.h"
static void
mrb_grn_table_sort_key_free(mrb_state *mrb, void *data)
{
grn_ctx *ctx = (grn_ctx *)mrb->ud;
grn_table_sort_key *sort_key = data;
if (!sort_key) {
return;
}
if (sort_key->key) {
grn_obj_unlink(ctx, sort_key->key);
}
mrb_free(mrb, sort_key);
}
static struct mrb_data_type mrb_grn_table_sort_key_type = {
"Groonga::TableSortKey",
mrb_grn_table_sort_key_free
};
static mrb_value
mrb_grn_table_sort_key_initialize(mrb_state *mrb, mrb_value self)
{
grn_table_sort_key *result;
DATA_TYPE(self) = &mrb_grn_table_sort_key_type;
result = mrb_calloc(mrb, 1, sizeof(grn_table_sort_key));
DATA_PTR(self) = result;
return self;
}
static mrb_value
mrb_grn_table_sort_key_close(mrb_state *mrb, mrb_value self)
{
grn_table_sort_key *sort_key;
sort_key = DATA_PTR(self);
if (sort_key) {
mrb_grn_table_sort_key_free(mrb, sort_key);
DATA_PTR(self) = NULL;
}
return mrb_nil_value();
}
static mrb_value
mrb_grn_table_sort_key_set_key(mrb_state *mrb, mrb_value self)
{
grn_ctx *ctx = (grn_ctx *)mrb->ud;
grn_table_sort_key *sort_key;
mrb_value mrb_key;
sort_key = DATA_PTR(self);
mrb_get_args(mrb, "o", &mrb_key);
if (sort_key->key) {
grn_obj_unlink(ctx, sort_key->key);
}
if (mrb_nil_p(mrb_key)) {
sort_key->key = NULL;
} else {
sort_key->key = DATA_PTR(mrb_key);
}
return mrb_nil_value();
}
static mrb_value
mrb_grn_table_sort_key_set_flags(mrb_state *mrb, mrb_value self)
{
grn_table_sort_key *sort_key;
mrb_int flags;
sort_key = DATA_PTR(self);
mrb_get_args(mrb, "i", &flags);
sort_key->flags = flags;
return mrb_nil_value();
}
static mrb_value
mrb_grn_table_sort_key_set_offset(mrb_state *mrb, mrb_value self)
{
grn_table_sort_key *sort_key;
mrb_int offset;
sort_key = DATA_PTR(self);
mrb_get_args(mrb, "i", &offset);
sort_key->offset = offset;
return mrb_nil_value();
}
void
grn_mrb_table_sort_key_init(grn_ctx *ctx)
{
grn_mrb_data *data = &(ctx->impl->mrb);
mrb_state *mrb = data->state;
struct RClass *module = data->module;
struct RClass *klass;
klass = mrb_define_class_under(mrb, module, "TableSortKey",
mrb->object_class);
MRB_SET_INSTANCE_TT(klass, MRB_TT_DATA);
mrb_define_method(mrb, klass, "initialize",
mrb_grn_table_sort_key_initialize, MRB_ARGS_NONE());
mrb_define_method(mrb, klass, "close",
mrb_grn_table_sort_key_close, MRB_ARGS_NONE());
mrb_define_method(mrb, klass, "key=",
mrb_grn_table_sort_key_set_key, MRB_ARGS_REQ(1));
mrb_define_method(mrb, klass, "flags=",
mrb_grn_table_sort_key_set_flags, MRB_ARGS_REQ(1));
mrb_define_method(mrb, klass, "offset=",
mrb_grn_table_sort_key_set_offset, MRB_ARGS_REQ(1));
}
#endif
|
