-
Notifications
You must be signed in to change notification settings - Fork 84
/
arrayobject.py
363 lines (316 loc) · 11.7 KB
/
arrayobject.py
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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
import copy
from rpython.rlib import jit
from rpython.rlib.listsort import make_timsort_class
from topaz.coerce import Coerce
from topaz.module import ClassDef, check_frozen
from topaz.modules.enumerable import Enumerable
from topaz.objects.objectobject import W_Object
from topaz.utils.packing.pack import RPacker
BaseRubySorter = make_timsort_class()
BaseRubySortBy = make_timsort_class()
class RubySorter(BaseRubySorter):
def __init__(self, space, list, listlength=None, sortblock=None):
BaseRubySorter.__init__(self, list, listlength=listlength)
self.space = space
self.sortblock = sortblock
def lt(self, w_a, w_b):
w_cmp_res = self.space.compare(w_a, w_b, self.sortblock)
return self.space.int_w(w_cmp_res) < 0
class RubySortBy(BaseRubySortBy):
def __init__(self, space, list, listlength=None, sortblock=None):
BaseRubySortBy.__init__(self, list, listlength=listlength)
self.space = space
self.sortblock = sortblock
def lt(self, w_a, w_b):
w_cmp_res = self.space.compare(
self.space.invoke_block(self.sortblock, [w_a]),
self.space.invoke_block(self.sortblock, [w_b])
)
return self.space.int_w(w_cmp_res) < 0
class W_ArrayObject(W_Object):
classdef = ClassDef("Array", W_Object.classdef)
classdef.include_module(Enumerable)
def __init__(self, space, items_w, klass=None):
W_Object.__init__(self, space, klass)
self.items_w = items_w
def __deepcopy__(self, memo):
obj = super(W_ArrayObject, self).__deepcopy__(memo)
obj.items_w = copy.deepcopy(self.items_w, memo)
return obj
def listview(self, space):
return self.items_w
def length(self):
return len(self.items_w)
@classdef.singleton_method("allocate")
def singleton_method_allocate(self, space):
return W_ArrayObject(space, [], self)
@classdef.method("initialize_copy", other_w="array")
@classdef.method("replace", other_w="array")
@check_frozen()
def method_replace(self, space, other_w):
del self.items_w[:]
self.items_w.extend(other_w)
return self
@classdef.method("[]")
@classdef.method("slice")
def method_subscript(self, space, w_idx, w_count=None):
start, end, as_range, nil = space.subscript_access(self.length(), w_idx, w_count=w_count)
if nil:
return space.w_nil
elif as_range:
assert start >= 0
assert end >= 0
return W_ArrayObject(space, self.items_w[start:end], space.getnonsingletonclass(self))
else:
return self.items_w[start]
@classdef.method("[]=")
@check_frozen()
def method_subscript_assign(self, space, w_idx, w_count_or_obj, w_obj=None):
w_count = None
if w_obj:
w_count = w_count_or_obj
else:
w_obj = w_count_or_obj
start, end, as_range, _ = space.subscript_access(self.length(), w_idx, w_count=w_count)
if w_count and end < start:
raise space.error(space.w_IndexError,
"negative length (%d)" % (end - start)
)
elif start < 0:
raise space.error(space.w_IndexError,
"index %d too small for array; minimum: %d" % (
start - self.length(),
-self.length()
)
)
elif start >= self.length():
self.items_w += [space.w_nil] * (start - self.length() + 1)
self.items_w[start] = w_obj
elif as_range:
w_converted = space.convert_type(w_obj, space.w_array, "to_ary", raise_error=False)
if w_converted is space.w_nil:
rep_w = [w_obj]
else:
rep_w = space.listview(w_converted)
self._subscript_assign_range(space, start, end, rep_w)
else:
self.items_w[start] = w_obj
return w_obj
def _subscript_assign_range(self, space, start, end, rep_w):
assert end >= 0
delta = (end - start) - len(rep_w)
if delta < 0:
self.items_w += [None] * -delta
lim = start + len(rep_w)
i = self.length() - 1
while i >= lim:
self.items_w[i] = self.items_w[i + delta]
i -= 1
elif delta > 0:
del self.items_w[start:start + delta]
self.items_w[start:start + len(rep_w)] = rep_w
@classdef.method("slice!")
@check_frozen()
def method_slice_i(self, space, w_idx, w_count=None):
start, end, as_range, nil = space.subscript_access(self.length(), w_idx, w_count=w_count)
if nil:
return space.w_nil
elif as_range:
start = min(max(start, 0), self.length())
end = min(max(end, 0), self.length())
delta = (end - start)
assert delta >= 0
w_items = self.items_w[start:start + delta]
del self.items_w[start:start + delta]
return space.newarray(w_items)
else:
w_item = self.items_w[start]
del self.items_w[start]
return w_item
@classdef.method("size")
@classdef.method("length")
def method_length(self, space):
return space.newint(self.length())
@classdef.method("empty?")
def method_emptyp(self, space):
return space.newbool(self.length() == 0)
@classdef.method("+", other="array")
def method_add(self, space, other):
return space.newarray(self.items_w + other)
@classdef.method("<<")
@check_frozen()
def method_lshift(self, space, w_obj):
self.items_w.append(w_obj)
return self
@classdef.method("concat", other="array")
@check_frozen()
def method_concat(self, space, other):
self.items_w += other
return self
@classdef.method("*")
def method_times(self, space, w_other):
if space.respond_to(w_other, "to_str"):
return space.send(self, "join", [w_other])
n = space.int_w(space.convert_type(w_other, space.w_fixnum, "to_int"))
if n < 0:
raise space.error(space.w_ArgumentError, "Count cannot be negative")
w_res = W_ArrayObject(space, self.items_w * n, space.getnonsingletonclass(self))
space.infect(w_res, self, freeze=False)
return w_res
@classdef.method("push")
@check_frozen()
def method_push(self, space, args_w):
self.items_w.extend(args_w)
return self
@classdef.method("shift")
@check_frozen()
def method_shift(self, space, w_n=None):
if w_n is None:
if self.items_w:
return self.items_w.pop(0)
else:
return space.w_nil
n = space.int_w(space.convert_type(w_n, space.w_fixnum, "to_int"))
if n < 0:
raise space.error(space.w_ArgumentError, "negative array size")
items_w = self.items_w[:n]
del self.items_w[:n]
return space.newarray(items_w)
@classdef.method("unshift")
@check_frozen()
def method_unshift(self, space, args_w):
for w_obj in reversed(args_w):
self.items_w.insert(0, w_obj)
return self
@classdef.method("join")
def method_join(self, space, w_sep=None):
if not self.items_w:
return space.newstr_fromstr("")
if w_sep is None:
separator = ""
elif space.respond_to(w_sep, "to_str"):
separator = space.str_w(space.send(w_sep, "to_str"))
else:
raise space.error(space.w_TypeError,
"can't convert %s into String" % space.getclass(w_sep).name
)
return space.newstr_fromstr(separator.join([
space.str_w(space.send(w_o, "to_s"))
for w_o in self.items_w
]))
@classdef.method("pop")
@check_frozen()
def method_pop(self, space, w_num=None):
if w_num is None:
if self.items_w:
return self.items_w.pop()
else:
return space.w_nil
else:
num = space.int_w(space.convert_type(
w_num, space.w_fixnum, "to_int"
))
if num < 0:
raise space.error(space.w_ArgumentError, "negative array size")
else:
pop_size = max(0, self.length() - num)
res_w = self.items_w[pop_size:]
del self.items_w[pop_size:]
return space.newarray(res_w)
@classdef.method("delete_at", idx="int")
@check_frozen()
def method_delete_at(self, space, idx):
if idx < 0:
idx += self.length()
if idx < 0 or idx >= self.length():
return space.w_nil
else:
return self.items_w.pop(idx)
@classdef.method("last")
def method_last(self, space, w_count=None):
if w_count is not None:
count = Coerce.int(space, w_count)
if count < 0:
raise space.error(space.w_ArgumentError, "negative array size")
start = self.length() - count
if start < 0:
start = 0
return space.newarray(self.items_w[start:])
if self.length() == 0:
return space.w_nil
else:
return self.items_w[self.length() - 1]
@classdef.method("pack")
def method_pack(self, space, w_template):
template = Coerce.str(space, w_template)
result = RPacker(template, space.listview(self)).operate(space)
w_result = space.newstr_fromchars(result)
if space.is_true(space.send(w_template, "tainted?")):
space.send(w_result, "taint")
return w_result
@classdef.method("to_ary")
def method_to_ary(self, space):
return self
@classdef.method("clear")
@check_frozen()
def method_clear(self, space):
del self.items_w[:]
return self
@classdef.method("sort!")
@check_frozen()
def method_sort_i(self, space, block):
RubySorter(space, self.items_w, sortblock=block).sort()
return self
@classdef.method("sort_by!")
@check_frozen()
def method_sort_by_i(self, space, block):
if block is None:
return space.send(self, "enum_for", [space.newsymbol("sort_by!")])
RubySortBy(space, self.items_w, sortblock=block).sort()
return self
@classdef.method("reverse!")
@check_frozen()
def method_reverse_i(self, space):
self.items_w.reverse()
return self
@classdef.method("rotate!", n="int")
@check_frozen()
def method_rotate_i(self, space, n=1):
length = self.length()
if length == 0:
return self
if abs(n) >= length:
n %= length
if n < 0:
n += length
if n == 0:
return self
assert n >= 0
self.items_w.extend(self.items_w[:n])
del self.items_w[:n]
return self
@classdef.method("insert", i="int")
@check_frozen()
@jit.look_inside_iff(lambda self, space, i, args_w: jit.isconstant(len(args_w)))
def method_insert(self, space, i, args_w):
if not args_w:
return self
length = self.length()
if i > length:
self._append_nils(space, i - length)
self.items_w.extend(args_w)
return self
if i < 0:
if i < -length - 1:
raise space.error(space.w_IndexError,
"index %d too small for array; minimum: %d" % (i + 1, -length)
)
i += length + 1
assert i >= 0
for w_e in args_w:
self.items_w.insert(i, w_e)
i += 1
return self
def _append_nils(self, space, num):
for _ in xrange(num):
self.items_w.append(space.w_nil)