forked from RustPython/RustPython
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsliceable.rs
479 lines (431 loc) · 14.3 KB
/
sliceable.rs
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
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
// export through sliceable module, not slice.
use crate::{
builtins::{int::PyInt, slice::PySlice},
PyObject, PyResult, VirtualMachine,
};
use malachite_bigint::BigInt;
use num_traits::{Signed, ToPrimitive};
use std::ops::Range;
pub trait SliceableSequenceMutOp
where
Self: AsRef<[Self::Item]>,
{
type Item: Clone;
fn do_set(&mut self, index: usize, value: Self::Item);
fn do_delete(&mut self, index: usize);
/// as CPython, length of range and items could be different, function must act like Vec::splice()
fn do_set_range(&mut self, range: Range<usize>, items: &[Self::Item]);
fn do_delete_range(&mut self, range: Range<usize>);
fn do_set_indexes<I>(&mut self, indexes: I, items: &[Self::Item])
where
I: Iterator<Item = usize>;
/// indexes must be positive order
fn do_delete_indexes<I>(&mut self, range: Range<usize>, indexes: I)
where
I: Iterator<Item = usize>;
fn setitem_by_index(
&mut self,
vm: &VirtualMachine,
index: isize,
value: Self::Item,
) -> PyResult<()> {
let pos = self
.as_ref()
.wrap_index(index)
.ok_or_else(|| vm.new_index_error("assignment index out of range".to_owned()))?;
self.do_set(pos, value);
Ok(())
}
fn setitem_by_slice_no_resize(
&mut self,
vm: &VirtualMachine,
slice: SaturatedSlice,
items: &[Self::Item],
) -> PyResult<()> {
let (range, step, slice_len) = slice.adjust_indices(self.as_ref().len());
if slice_len != items.len() {
Err(vm
.new_buffer_error("Existing exports of data: object cannot be re-sized".to_owned()))
} else if step == 1 {
self.do_set_range(range, items);
Ok(())
} else {
self.do_set_indexes(
SaturatedSliceIter::from_adjust_indices(range, step, slice_len),
items,
);
Ok(())
}
}
fn setitem_by_slice(
&mut self,
vm: &VirtualMachine,
slice: SaturatedSlice,
items: &[Self::Item],
) -> PyResult<()> {
let (range, step, slice_len) = slice.adjust_indices(self.as_ref().len());
if step == 1 {
self.do_set_range(range, items);
Ok(())
} else if slice_len == items.len() {
self.do_set_indexes(
SaturatedSliceIter::from_adjust_indices(range, step, slice_len),
items,
);
Ok(())
} else {
Err(vm.new_value_error(format!(
"attempt to assign sequence of size {} to extended slice of size {}",
items.len(),
slice_len
)))
}
}
fn delitem_by_index(&mut self, vm: &VirtualMachine, index: isize) -> PyResult<()> {
let pos = self
.as_ref()
.wrap_index(index)
.ok_or_else(|| vm.new_index_error("assignment index out of range".to_owned()))?;
self.do_delete(pos);
Ok(())
}
fn delitem_by_slice(&mut self, _vm: &VirtualMachine, slice: SaturatedSlice) -> PyResult<()> {
let (range, step, slice_len) = slice.adjust_indices(self.as_ref().len());
if slice_len == 0 {
Ok(())
} else if step == 1 || step == -1 {
self.do_set_range(range, &[]);
Ok(())
} else {
self.do_delete_indexes(
range.clone(),
SaturatedSliceIter::from_adjust_indices(range, step, slice_len).positive_order(),
);
Ok(())
}
}
}
impl<T: Clone> SliceableSequenceMutOp for Vec<T> {
type Item = T;
fn do_set(&mut self, index: usize, value: Self::Item) {
self[index] = value;
}
fn do_delete(&mut self, index: usize) {
self.remove(index);
}
fn do_set_range(&mut self, range: Range<usize>, items: &[Self::Item]) {
self.splice(range, items.to_vec());
}
fn do_delete_range(&mut self, range: Range<usize>) {
self.drain(range);
}
fn do_set_indexes<I>(&mut self, indexes: I, items: &[Self::Item])
where
I: Iterator<Item = usize>,
{
for (i, item) in indexes.zip(items) {
self.do_set(i, item.clone());
}
}
fn do_delete_indexes<I>(&mut self, range: Range<usize>, indexes: I)
where
I: Iterator<Item = usize>,
{
let mut indexes = indexes.peekable();
let mut deleted = 0;
// passing whole range, swap or overlap
for i in range.clone() {
if indexes.peek() == Some(&i) {
indexes.next();
deleted += 1;
} else {
self.swap(i - deleted, i);
}
}
// then drain (the values to delete should now be contiguous at the end of the range)
self.drain((range.end - deleted)..range.end);
}
}
#[allow(clippy::len_without_is_empty)]
pub trait SliceableSequenceOp {
type Item;
type Sliced;
fn do_get(&self, index: usize) -> Self::Item;
fn do_slice(&self, range: Range<usize>) -> Self::Sliced;
fn do_slice_reverse(&self, range: Range<usize>) -> Self::Sliced;
fn do_stepped_slice(&self, range: Range<usize>, step: usize) -> Self::Sliced;
fn do_stepped_slice_reverse(&self, range: Range<usize>, step: usize) -> Self::Sliced;
fn empty() -> Self::Sliced;
fn len(&self) -> usize;
fn wrap_index(&self, p: isize) -> Option<usize> {
p.wrapped_at(self.len())
}
fn saturate_index(&self, p: isize) -> usize {
p.saturated_at(self.len())
}
fn getitem_by_slice(
&self,
_vm: &VirtualMachine,
slice: SaturatedSlice,
) -> PyResult<Self::Sliced> {
let (range, step, slice_len) = slice.adjust_indices(self.len());
let sliced = if slice_len == 0 {
Self::empty()
} else if step == 1 {
self.do_slice(range)
} else if step == -1 {
self.do_slice_reverse(range)
} else if step.is_positive() {
self.do_stepped_slice(range, step.unsigned_abs())
} else {
self.do_stepped_slice_reverse(range, step.unsigned_abs())
};
Ok(sliced)
}
fn getitem_by_index(&self, vm: &VirtualMachine, index: isize) -> PyResult<Self::Item> {
let pos = self
.wrap_index(index)
.ok_or_else(|| vm.new_index_error("index out of range".to_owned()))?;
Ok(self.do_get(pos))
}
}
impl<T: Clone> SliceableSequenceOp for [T] {
type Item = T;
type Sliced = Vec<T>;
#[inline]
fn do_get(&self, index: usize) -> Self::Item {
self[index].clone()
}
#[inline]
fn do_slice(&self, range: Range<usize>) -> Self::Sliced {
self[range].to_vec()
}
#[inline]
fn do_slice_reverse(&self, range: Range<usize>) -> Self::Sliced {
let mut slice = self[range].to_vec();
slice.reverse();
slice
}
#[inline]
fn do_stepped_slice(&self, range: Range<usize>, step: usize) -> Self::Sliced {
self[range].iter().step_by(step).cloned().collect()
}
#[inline]
fn do_stepped_slice_reverse(&self, range: Range<usize>, step: usize) -> Self::Sliced {
self[range].iter().rev().step_by(step).cloned().collect()
}
#[inline(always)]
fn empty() -> Self::Sliced {
Vec::new()
}
#[inline(always)]
fn len(&self) -> usize {
self.len()
}
}
pub enum SequenceIndex {
Int(isize),
Slice(SaturatedSlice),
}
impl SequenceIndex {
pub fn try_from_borrowed_object(
vm: &VirtualMachine,
obj: &PyObject,
type_name: &str,
) -> PyResult<Self> {
if let Some(i) = obj.payload::<PyInt>() {
// TODO: number protocol
i.try_to_primitive(vm)
.map_err(|_| {
vm.new_index_error("cannot fit 'int' into an index-sized integer".to_owned())
})
.map(Self::Int)
} else if let Some(slice) = obj.payload::<PySlice>() {
slice.to_saturated(vm).map(Self::Slice)
} else if let Some(i) = obj.try_index_opt(vm) {
// TODO: __index__ for indices is no more supported?
i?.try_to_primitive(vm)
.map_err(|_| {
vm.new_index_error("cannot fit 'int' into an index-sized integer".to_owned())
})
.map(Self::Int)
} else {
Err(vm.new_type_error(format!(
"{} indices must be integers or slices or classes that override __index__ operator, not '{}'",
type_name,
obj.class()
)))
}
}
}
pub trait SequenceIndexOp {
// Saturate p in range [0, len] inclusive
fn saturated_at(&self, len: usize) -> usize;
// Use PySliceableSequence::wrap_index for implementors
fn wrapped_at(&self, len: usize) -> Option<usize>;
}
impl SequenceIndexOp for isize {
fn saturated_at(&self, len: usize) -> usize {
let len = len.to_isize().unwrap_or(Self::MAX);
let mut p = *self;
if p < 0 {
p += len;
}
p.clamp(0, len) as usize
}
fn wrapped_at(&self, len: usize) -> Option<usize> {
let mut p = *self;
if p < 0 {
// casting to isize is ok because it is used by wrapping_add
p = p.wrapping_add(len as isize);
}
if p < 0 || (p as usize) >= len {
None
} else {
Some(p as usize)
}
}
}
impl SequenceIndexOp for BigInt {
fn saturated_at(&self, len: usize) -> usize {
if self.is_negative() {
self.abs()
.try_into()
.map_or(0, |abs| len.saturating_sub(abs))
} else {
self.try_into().unwrap_or(len)
}
}
fn wrapped_at(&self, _len: usize) -> Option<usize> {
unimplemented!("please add one once we need it")
}
}
/// A saturated slice with values ranging in [isize::MIN, isize::MAX]. Used for
/// sliceable sequences that require indices in the aforementioned range.
///
/// Invokes `__index__` on the PySliceRef during construction so as to separate the
/// transformation from PyObject into isize and the adjusting of the slice to a given
/// sequence length. The reason this is important is due to the fact that an objects
/// `__index__` might get a lock on the sequence and cause a deadlock.
#[derive(Copy, Clone, Debug)]
pub struct SaturatedSlice {
start: isize,
stop: isize,
step: isize,
}
impl SaturatedSlice {
// Equivalent to PySlice_Unpack.
pub fn with_slice(slice: &PySlice, vm: &VirtualMachine) -> PyResult<Self> {
let step = to_isize_index(vm, slice.step_ref(vm))?.unwrap_or(1);
if step == 0 {
return Err(vm.new_value_error("slice step cannot be zero".to_owned()));
}
let start = to_isize_index(vm, slice.start_ref(vm))?.unwrap_or_else(|| {
if step.is_negative() {
isize::MAX
} else {
0
}
});
let stop = to_isize_index(vm, &slice.stop(vm))?.unwrap_or_else(|| {
if step.is_negative() {
isize::MIN
} else {
isize::MAX
}
});
Ok(Self { start, stop, step })
}
// Equivalent to PySlice_AdjustIndices
/// Convert for usage in indexing the underlying rust collections. Called *after*
/// __index__ has been called on the Slice which might mutate the collection.
pub fn adjust_indices(&self, len: usize) -> (Range<usize>, isize, usize) {
if len == 0 {
return (0..0, self.step, 0);
}
let range = if self.step.is_negative() {
let stop = if self.stop == -1 {
len
} else {
self.stop.saturating_add(1).saturated_at(len)
};
let start = if self.start == -1 {
len
} else {
self.start.saturating_add(1).saturated_at(len)
};
stop..start
} else {
self.start.saturated_at(len)..self.stop.saturated_at(len)
};
let (range, slice_len) = if range.start >= range.end {
(range.start..range.start, 0)
} else {
let slice_len = (range.end - range.start - 1) / self.step.unsigned_abs() + 1;
(range, slice_len)
};
(range, self.step, slice_len)
}
pub fn iter(&self, len: usize) -> SaturatedSliceIter {
SaturatedSliceIter::new(self, len)
}
}
pub struct SaturatedSliceIter {
index: isize,
step: isize,
len: usize,
}
impl SaturatedSliceIter {
pub fn new(slice: &SaturatedSlice, seq_len: usize) -> Self {
let (range, step, len) = slice.adjust_indices(seq_len);
Self::from_adjust_indices(range, step, len)
}
pub fn from_adjust_indices(range: Range<usize>, step: isize, len: usize) -> Self {
let index = if step.is_negative() {
range.end as isize - 1
} else {
range.start as isize
};
Self { index, step, len }
}
pub fn positive_order(mut self) -> Self {
if self.step.is_negative() {
self.index += self.step * self.len.saturating_sub(1) as isize;
self.step = self.step.saturating_abs()
}
self
}
}
impl Iterator for SaturatedSliceIter {
type Item = usize;
fn next(&mut self) -> Option<Self::Item> {
if self.len == 0 {
return None;
}
self.len -= 1;
let ret = self.index as usize;
// SAFETY: if index is overflowed, len should be zero
self.index = self.index.wrapping_add(self.step);
Some(ret)
}
}
// Go from PyObjectRef to isize w/o overflow error, out of range values are substituted by
// isize::MIN or isize::MAX depending on type and value of step.
// Equivalent to PyEval_SliceIndex.
fn to_isize_index(vm: &VirtualMachine, obj: &PyObject) -> PyResult<Option<isize>> {
if vm.is_none(obj) {
return Ok(None);
}
let result = obj.try_index_opt(vm).unwrap_or_else(|| {
Err(vm.new_type_error(
"slice indices must be integers or None or have an __index__ method".to_owned(),
))
})?;
let value = result.as_bigint();
let is_negative = value.is_negative();
Ok(Some(value.to_isize().unwrap_or(if is_negative {
isize::MIN
} else {
isize::MAX
})))
}