victory 0.0.0 → 0.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/.gitignore +5 -0
- data/.rubocop.yml +11 -1
- data/README.md +4 -6
- data/Rakefile +11 -4
- data/USAGE.md +159 -0
- data/ext/algorithms/string/LICENSE.md +21 -0
- data/ext/algorithms/string/extconf.rb +4 -0
- data/ext/algorithms/string/string.c +68 -0
- data/ext/containers/bst/LICENSE.md +21 -0
- data/ext/containers/bst/bst.c +247 -0
- data/ext/containers/bst/extconf.rb +4 -0
- data/ext/containers/deque/LICENSE.md +21 -0
- data/ext/containers/deque/deque.c +247 -0
- data/ext/containers/deque/extconf.rb +4 -0
- data/ext/containers/rbtree_map/LICENSE.md +21 -0
- data/ext/containers/rbtree_map/extconf.rb +4 -0
- data/ext/containers/rbtree_map/rbtree.c +498 -0
- data/ext/containers/splaytree_map/LICENSE.md +21 -0
- data/ext/containers/splaytree_map/extconf.rb +4 -0
- data/ext/containers/splaytree_map/splaytree.c +419 -0
- data/ext/containers/xor_list/extconf.rb +4 -0
- data/ext/containers/xor_list/xor_list.c +122 -0
- data/lib/algorithms/search.rb +104 -0
- data/lib/algorithms/sort.rb +389 -0
- data/lib/algorithms/string.rb +29 -0
- data/lib/containers/deque.rb +193 -0
- data/lib/containers/heap.rb +524 -0
- data/lib/containers/kd_tree.rb +131 -0
- data/lib/containers/list.rb +81 -0
- data/lib/containers/prefix_tree.rb +61 -0
- data/lib/containers/priority_queue.rb +135 -0
- data/lib/containers/queue.rb +89 -0
- data/lib/containers/rb_tree_map.rb +420 -0
- data/lib/containers/splay_tree_map.rb +290 -0
- data/lib/containers/stack.rb +88 -0
- data/lib/containers/suffix_array.rb +92 -0
- data/lib/containers/trie.rb +204 -0
- data/lib/containers/tuple.rb +20 -0
- data/lib/victory/version.rb +1 -1
- data/lib/victory.rb +8 -1
- data/victory.gemspec +12 -3
- metadata +73 -12
- data/.idea/encodings.xml +0 -4
- data/.idea/misc.xml +0 -7
- data/.idea/modules.xml +0 -8
- data/.idea/victory.iml +0 -13
- data/.idea/workspace.xml +0 -233
- data/ext/victory/extconf.rb +0 -3
- data/ext/victory/victory.c +0 -9
- data/ext/victory/victory.h +0 -6
@@ -0,0 +1,247 @@
|
|
1
|
+
#include "ruby.h"
|
2
|
+
|
3
|
+
#define FALSE 0
|
4
|
+
#define TRUE 1
|
5
|
+
|
6
|
+
typedef struct struct_deque_node {
|
7
|
+
VALUE obj;
|
8
|
+
struct struct_deque_node *left;
|
9
|
+
struct struct_deque_node *right;
|
10
|
+
} deque_node;
|
11
|
+
|
12
|
+
typedef struct {
|
13
|
+
unsigned int size;
|
14
|
+
deque_node *front;
|
15
|
+
deque_node *back;
|
16
|
+
} deque;
|
17
|
+
|
18
|
+
void free_nodes(deque_node *node) {
|
19
|
+
deque_node *next;
|
20
|
+
while(node) {
|
21
|
+
next = node->right;
|
22
|
+
xfree(node);
|
23
|
+
node = next;
|
24
|
+
}
|
25
|
+
return;
|
26
|
+
}
|
27
|
+
|
28
|
+
void clear_deque(deque *a_deque) {
|
29
|
+
if(a_deque->front)
|
30
|
+
free_nodes(a_deque->front);
|
31
|
+
a_deque->size = 0;
|
32
|
+
a_deque->front = NULL;
|
33
|
+
a_deque->back = NULL;
|
34
|
+
return;
|
35
|
+
}
|
36
|
+
|
37
|
+
static deque* get_deque_from_self(VALUE self) {
|
38
|
+
deque *a_deque;
|
39
|
+
Data_Get_Struct(self, deque, a_deque);
|
40
|
+
return a_deque;
|
41
|
+
}
|
42
|
+
|
43
|
+
static deque* create_deque() {
|
44
|
+
deque *a_deque = ALLOC(deque);
|
45
|
+
a_deque->size = 0;
|
46
|
+
a_deque->front = NULL;
|
47
|
+
a_deque->back = NULL;
|
48
|
+
return a_deque;
|
49
|
+
}
|
50
|
+
|
51
|
+
static deque_node* create_node(VALUE obj) {
|
52
|
+
deque_node *node = ALLOC(deque_node);
|
53
|
+
node->obj = obj;
|
54
|
+
node->left = NULL;
|
55
|
+
node->right = NULL;
|
56
|
+
return node;
|
57
|
+
}
|
58
|
+
|
59
|
+
static void deque_mark(void *ptr) {
|
60
|
+
if (ptr) {
|
61
|
+
deque *deque = ptr;
|
62
|
+
deque_node *node = deque->front;
|
63
|
+
while(node) {
|
64
|
+
rb_gc_mark(node->obj);
|
65
|
+
node = node->right;
|
66
|
+
}
|
67
|
+
}
|
68
|
+
}
|
69
|
+
|
70
|
+
static void deque_free(void *ptr) {
|
71
|
+
if (ptr) {
|
72
|
+
deque *deque = ptr;
|
73
|
+
free_nodes(deque->front);
|
74
|
+
xfree(deque);
|
75
|
+
}
|
76
|
+
}
|
77
|
+
|
78
|
+
static VALUE deque_alloc(VALUE klass) {
|
79
|
+
deque *deque = create_deque();
|
80
|
+
return Data_Wrap_Struct(klass, deque_mark, deque_free, deque);
|
81
|
+
}
|
82
|
+
|
83
|
+
static VALUE deque_push_front(VALUE self, VALUE obj) {
|
84
|
+
deque *deque = get_deque_from_self(self);
|
85
|
+
deque_node *node = create_node(obj);
|
86
|
+
if(deque->front) {
|
87
|
+
node->right = deque->front;
|
88
|
+
deque->front->left = node;
|
89
|
+
deque->front = node;
|
90
|
+
}
|
91
|
+
else {
|
92
|
+
deque->front = node;
|
93
|
+
deque->back = node;
|
94
|
+
}
|
95
|
+
deque->size++;
|
96
|
+
return obj;
|
97
|
+
}
|
98
|
+
|
99
|
+
static VALUE deque_push_back(VALUE self, VALUE obj) {
|
100
|
+
deque *deque = get_deque_from_self(self);
|
101
|
+
deque_node *node = create_node(obj);
|
102
|
+
if(deque->back) {
|
103
|
+
node->left = deque->back;
|
104
|
+
deque->back->right = node;
|
105
|
+
deque->back = node;
|
106
|
+
}
|
107
|
+
else {
|
108
|
+
deque->front = node;
|
109
|
+
deque->back = node;
|
110
|
+
}
|
111
|
+
deque->size++;
|
112
|
+
return obj;
|
113
|
+
}
|
114
|
+
|
115
|
+
static VALUE deque_pop_front(VALUE self) {
|
116
|
+
deque *deque = get_deque_from_self(self);
|
117
|
+
VALUE obj;
|
118
|
+
if(!deque->front)
|
119
|
+
return Qnil;
|
120
|
+
deque_node *node = deque->front;
|
121
|
+
obj = node->obj;
|
122
|
+
if(deque->size == 1) {
|
123
|
+
clear_deque(deque);
|
124
|
+
return obj;
|
125
|
+
}
|
126
|
+
deque->front->right->left = NULL;
|
127
|
+
deque->front = deque->front->right;
|
128
|
+
deque->size--;
|
129
|
+
return obj;
|
130
|
+
}
|
131
|
+
|
132
|
+
static VALUE deque_front(VALUE self) {
|
133
|
+
deque *deque = get_deque_from_self(self);
|
134
|
+
if(deque->front)
|
135
|
+
return deque->front->obj;
|
136
|
+
|
137
|
+
return Qnil;
|
138
|
+
}
|
139
|
+
|
140
|
+
static VALUE deque_back(VALUE self) {
|
141
|
+
deque *deque = get_deque_from_self(self);
|
142
|
+
if(deque->back)
|
143
|
+
return deque->back->obj;
|
144
|
+
|
145
|
+
return Qnil;
|
146
|
+
}
|
147
|
+
|
148
|
+
static VALUE deque_pop_back(VALUE self) {
|
149
|
+
deque *deque = get_deque_from_self(self);
|
150
|
+
VALUE obj;
|
151
|
+
if(!deque->back)
|
152
|
+
return Qnil;
|
153
|
+
deque_node *node = deque->back;
|
154
|
+
obj = node->obj;
|
155
|
+
if(deque->size == 1) {
|
156
|
+
clear_deque(deque);
|
157
|
+
return obj;
|
158
|
+
}
|
159
|
+
deque->back->left->right = NULL;
|
160
|
+
deque->back = deque->back->left;
|
161
|
+
deque->size--;
|
162
|
+
return obj;
|
163
|
+
}
|
164
|
+
|
165
|
+
static VALUE deque_clear(VALUE self) {
|
166
|
+
deque *deque = get_deque_from_self(self);
|
167
|
+
clear_deque(deque);
|
168
|
+
return Qnil;
|
169
|
+
}
|
170
|
+
|
171
|
+
static VALUE deque_size(VALUE self) {
|
172
|
+
deque *deque = get_deque_from_self(self);
|
173
|
+
return INT2NUM(deque->size);
|
174
|
+
}
|
175
|
+
|
176
|
+
static VALUE deque_is_empty(VALUE self) {
|
177
|
+
deque *deque = get_deque_from_self(self);
|
178
|
+
return (deque->size == 0) ? Qtrue : Qfalse;
|
179
|
+
}
|
180
|
+
|
181
|
+
static VALUE deque_each_forward(VALUE self) {
|
182
|
+
deque *deque = get_deque_from_self(self);
|
183
|
+
deque_node *node = deque->front;
|
184
|
+
while(node) {
|
185
|
+
rb_yield(node->obj);
|
186
|
+
node = node->right;
|
187
|
+
}
|
188
|
+
return self;
|
189
|
+
}
|
190
|
+
|
191
|
+
static VALUE deque_each_backward(VALUE self) {
|
192
|
+
deque *deque = get_deque_from_self(self);
|
193
|
+
deque_node *node = deque->back;
|
194
|
+
while(node) {
|
195
|
+
rb_yield(node->obj);
|
196
|
+
node = node->left;
|
197
|
+
}
|
198
|
+
return self;
|
199
|
+
}
|
200
|
+
|
201
|
+
static VALUE deque_init(int argc, VALUE *argv, VALUE self)
|
202
|
+
{
|
203
|
+
long len, i;
|
204
|
+
VALUE ary;
|
205
|
+
|
206
|
+
if(argc == 0) {
|
207
|
+
return self;
|
208
|
+
}
|
209
|
+
else if(argc > 1) {
|
210
|
+
rb_raise(rb_eArgError, "wrong number of arguments");
|
211
|
+
}
|
212
|
+
else {
|
213
|
+
ary = rb_check_array_type(argv[0]);
|
214
|
+
if(!NIL_P(ary)) {
|
215
|
+
len = RARRAY_LEN(ary);
|
216
|
+
for (i = 0; i < len; i++) {
|
217
|
+
deque_push_back(self, RARRAY_PTR(ary)[i]);
|
218
|
+
}
|
219
|
+
}
|
220
|
+
}
|
221
|
+
return self;
|
222
|
+
}
|
223
|
+
|
224
|
+
static VALUE cDeque;
|
225
|
+
static VALUE mContainers;
|
226
|
+
|
227
|
+
void Init_CDeque() {
|
228
|
+
mContainers = rb_define_module("Containers");
|
229
|
+
cDeque = rb_define_class_under(mContainers, "CDeque", rb_cObject);
|
230
|
+
rb_define_alloc_func(cDeque, deque_alloc);
|
231
|
+
rb_define_method(cDeque, "initialize", deque_init, -1);
|
232
|
+
rb_define_method(cDeque, "push_front", deque_push_front, 1);
|
233
|
+
rb_define_method(cDeque, "push_back", deque_push_back, 1);
|
234
|
+
rb_define_method(cDeque, "clear", deque_clear, 0);
|
235
|
+
rb_define_method(cDeque, "front", deque_front, 0);
|
236
|
+
rb_define_method(cDeque, "back", deque_back, 0);
|
237
|
+
rb_define_method(cDeque, "pop_front", deque_pop_front, 0);
|
238
|
+
rb_define_method(cDeque, "pop_back", deque_pop_back, 0);
|
239
|
+
rb_define_method(cDeque, "size", deque_size, 0);
|
240
|
+
rb_define_alias(cDeque, "length", "size");
|
241
|
+
rb_define_method(cDeque, "empty?", deque_is_empty, 0);
|
242
|
+
rb_define_method(cDeque, "each_forward", deque_each_forward, 0);
|
243
|
+
rb_define_method(cDeque, "each_backward", deque_each_backward, 0);
|
244
|
+
rb_define_alias(cDeque, "each", "each_forward");
|
245
|
+
rb_define_alias(cDeque, "reverse_each", "each_backward");
|
246
|
+
rb_include_module(cDeque, rb_eval_string("Enumerable"));
|
247
|
+
}
|
@@ -0,0 +1,21 @@
|
|
1
|
+
MIT License
|
2
|
+
|
3
|
+
Copyright (c) 2009 Kanwei Li
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
7
|
+
in the Software without restriction, including without limitation the rights
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
10
|
+
furnished to do so, subject to the following conditions:
|
11
|
+
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
13
|
+
copies or substantial portions of the Software.
|
14
|
+
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
21
|
+
SOFTWARE.
|