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
use std::ops::{Index, IndexMut};
use num_complex::Complex64;
use savvy_ffi::CPLXSXP;
use savvy_ffi::{COMPLEX, SEXP};
use super::{Sexp, impl_common_sexp_ops, impl_common_sexp_ops_owned, utils::assert_len};
use crate::NotAvailableValue;
use crate::protect::{self, local_protect}; // for na()
/// An external SEXP of a complex vector.
pub struct ComplexSexp(pub SEXP);
/// A newly-created SEXP of a complex vector
pub struct OwnedComplexSexp {
inner: SEXP,
token: SEXP,
len: usize,
raw: *mut Complex64,
}
// implement inner(), len(), empty(), and name()
impl_common_sexp_ops!(ComplexSexp);
impl_common_sexp_ops_owned!(OwnedComplexSexp);
impl ComplexSexp {
/// Extracts a slice containing the underlying data of the SEXP.
///
/// # Examples
///
/// ```
/// use savvy::Complex64;
/// # let x = [
/// # Complex64 { re: 1.0, im: 1.0 },
/// # Complex64 { re: 2.0, im: 2.0 },
/// # Complex64 { re: 3.0, im: 3.0 },
/// # ];
/// # let complex_sexp = savvy::OwnedComplexSexp::try_from_slice(x)?.as_read_only();
/// // `complex_sexp` is c(1+1i, 2+2i, 3+3i)
/// assert_eq!(
/// complex_sexp.as_slice(),
/// &[
/// Complex64 { re: 1.0, im: 1.0 },
/// Complex64 { re: 2.0, im: 2.0 },
/// Complex64 { re: 3.0, im: 3.0 },
/// ]
/// );
/// ```
pub fn as_slice(&self) -> &[Complex64] {
if self.is_empty() {
return &[];
}
unsafe { std::slice::from_raw_parts(COMPLEX(self.inner()) as _, self.len()) }
}
/// Returns an iterator over the underlying data of the SEXP.
///
/// # Examples
///
/// ```
/// use savvy::Complex64;
/// # let x = [
/// # Complex64 { re: 1.0, im: 1.0 },
/// # Complex64 { re: 2.0, im: 2.0 },
/// # Complex64 { re: 3.0, im: 3.0 },
/// # ];
/// # let complex_sexp = savvy::OwnedComplexSexp::try_from_slice(x)?.as_read_only();
/// // `complex_sexp` is c(1+1i, 2+2i, 3+3i)
/// let mut iter = complex_sexp.iter();
/// assert_eq!(iter.next(), Some(&Complex64 { re: 1.0, im: 1.0 }));
/// assert_eq!(
/// iter.as_slice(),
/// &[
/// Complex64 { re: 2.0, im: 2.0 },
/// Complex64 { re: 3.0, im: 3.0 },
/// ]
/// );
/// ```
///
/// # Technical Note
///
/// If the input is an ALTREP, this materialize it first, so it might not be
/// most efficient. However, it seems Rust's slice implementation is very
/// fast, so probably being efficient for ALTREP is not worth giving up the
/// benefit.
pub fn iter(&self) -> std::slice::Iter<'_, Complex64> {
self.as_slice().iter()
}
/// Copies the underlying data of the SEXP into a new `Vec`.
pub fn to_vec(&self) -> Vec<Complex64> {
self.as_slice().to_vec()
}
}
impl OwnedComplexSexp {
/// Returns the read-only version of the wrapper. This is mainly for testing
/// purposes.
pub fn as_read_only(&self) -> ComplexSexp {
ComplexSexp(self.inner)
}
pub fn as_slice(&self) -> &[Complex64] {
if self.len == 0 {
return &[];
}
unsafe { std::slice::from_raw_parts(self.raw, self.len) }
}
pub fn as_mut_slice(&mut self) -> &mut [Complex64] {
if self.len == 0 {
return &mut [];
}
unsafe { std::slice::from_raw_parts_mut(self.raw, self.len) }
}
pub fn iter(&self) -> std::slice::Iter<'_, Complex64> {
self.as_slice().iter()
}
pub fn iter_mut(&mut self) -> std::slice::IterMut<'_, Complex64> {
self.as_mut_slice().iter_mut()
}
pub fn to_vec(&self) -> Vec<Complex64> {
self.as_slice().to_vec()
}
/// Set the value of the `i`-th element.
pub fn set_elt(&mut self, i: usize, v: Complex64) -> crate::error::Result<()> {
super::utils::assert_len(self.len, i)?;
unsafe { self.set_elt_unchecked(i, v) };
Ok(())
}
#[inline]
unsafe fn set_elt_unchecked(&mut self, i: usize, v: Complex64) {
unsafe { *(self.raw.add(i)) = v };
}
/// Set the `i`-th element to NA.
pub fn set_na(&mut self, i: usize) -> crate::error::Result<()> {
super::utils::assert_len(self.len, i)?;
unsafe { self.set_elt_unchecked(i, Complex64::na()) };
Ok(())
}
fn new_inner(len: usize, init: bool) -> crate::error::Result<Self> {
let inner = crate::alloc_vector(CPLXSXP, len as _)?;
// Fill the vector with default values
if len > 0 && init {
unsafe {
std::ptr::write_bytes(COMPLEX(inner), 0, len);
}
}
Self::new_from_raw_sexp(inner, len)
}
/// Constructs a new, initialized integer vector.
pub fn new(len: usize) -> crate::error::Result<Self> {
Self::new_inner(len, true)
}
/// # Safety
///
/// As the memory is uninitialized, all elements must be filled values
/// before return.
pub unsafe fn new_without_init(len: usize) -> crate::error::Result<Self> {
Self::new_inner(len, false)
}
fn new_from_raw_sexp(inner: SEXP, len: usize) -> crate::error::Result<Self> {
let token = protect::insert_to_preserved_list(inner);
let raw = unsafe { COMPLEX(inner) };
Ok(Self {
inner,
token,
len,
raw,
})
}
/// Constructs a new complex vector from an iterator.
///
/// Note that, if you already have a slice or vec, [`try_from_slice()`][1]
/// is what you want. `try_from_slice` is more performant than
/// `try_from_iter` because it copies the underlying memory directly.
///
/// [1]: `Self::try_from_slice()`
pub fn try_from_iter<I>(iter: I) -> crate::error::Result<Self>
where
I: IntoIterator<Item = Complex64>,
{
let iter = iter.into_iter();
match iter.size_hint() {
(_, Some(upper)) => {
// If the maximum length is known, use it at frist. But, the
// iterator's length might be shorter than the reported one
// (e.g. `(0..10).filter(|x| x % 2 == 0)`), so it needs to be
// truncated to the actual length at last.
let inner = crate::alloc_vector(CPLXSXP, upper as _)?;
let _inner_guard = local_protect(inner);
let raw = unsafe { COMPLEX(inner) };
let mut last_index = 0;
for (i, v) in iter.enumerate() {
// The upper bound of size_hint() is just for optimization
// and what we should not trust.
assert_len(upper, i)?;
unsafe { *(raw.add(i)) = v };
last_index = i;
}
let new_len = last_index + 1;
if new_len == upper {
// If the length is the same as expected, use it as it is.
Self::new_from_raw_sexp(inner, upper)
} else {
// If the length is shorter than expected, re-allocate a new
// SEXP and copy the values into it.
let mut out = unsafe { Self::new_without_init(new_len)? };
// `raw` is longer than new_len, but the elements over new_len are ignored
let raw_slice = unsafe { std::slice::from_raw_parts(raw, new_len) };
out.as_mut_slice().copy_from_slice(raw_slice);
Ok(out)
}
}
(_, None) => {
// When the length is not known at all, collect() it first.
let v: Vec<I::Item> = iter.collect();
v.try_into()
}
}
}
/// Constructs a new complex vector from a slice or vec.
pub fn try_from_slice<S>(x: S) -> crate::error::Result<Self>
where
S: AsRef<[Complex64]>,
{
let x_slice = x.as_ref();
let mut out = unsafe { Self::new_without_init(x_slice.len())? };
out.as_mut_slice().copy_from_slice(x_slice);
Ok(out)
}
/// Constructs a new integer vector from a scalar value.
pub fn try_from_scalar(value: Complex64) -> crate::error::Result<Self> {
let sexp = unsafe { crate::unwind_protect(|| savvy_ffi::Rf_ScalarComplex(value))? };
Self::new_from_raw_sexp(sexp, 1)
}
}
impl Drop for OwnedComplexSexp {
fn drop(&mut self) {
protect::release_from_preserved_list(self.token);
}
}
// conversions from/to ComplexSexp ***************
impl TryFrom<Sexp> for ComplexSexp {
type Error = crate::error::Error;
fn try_from(value: Sexp) -> crate::error::Result<Self> {
value.assert_complex()?;
Ok(Self(value.0))
}
}
impl From<ComplexSexp> for Sexp {
fn from(value: ComplexSexp) -> Self {
Self(value.inner())
}
}
impl From<ComplexSexp> for crate::error::Result<Sexp> {
fn from(value: ComplexSexp) -> Self {
Ok(<Sexp>::from(value))
}
}
// conversions from/to OwnedComplexSexp ***************
impl TryFrom<&[Complex64]> for OwnedComplexSexp {
type Error = crate::error::Error;
fn try_from(value: &[Complex64]) -> crate::error::Result<Self> {
Self::try_from_slice(value)
}
}
impl TryFrom<Vec<Complex64>> for OwnedComplexSexp {
type Error = crate::error::Error;
fn try_from(value: Vec<Complex64>) -> crate::error::Result<Self> {
Self::try_from_slice(value)
}
}
impl TryFrom<Complex64> for OwnedComplexSexp {
type Error = crate::error::Error;
fn try_from(value: Complex64) -> crate::error::Result<Self> {
Self::try_from_scalar(value)
}
}
impl From<OwnedComplexSexp> for Sexp {
fn from(value: OwnedComplexSexp) -> Self {
Self(value.inner())
}
}
impl From<OwnedComplexSexp> for crate::error::Result<Sexp> {
fn from(value: OwnedComplexSexp) -> Self {
Ok(<Sexp>::from(value))
}
}
macro_rules! impl_try_from_rust_complexes {
($ty: ty) => {
impl TryFrom<$ty> for Sexp {
type Error = crate::error::Error;
fn try_from(value: $ty) -> crate::error::Result<Self> {
<OwnedComplexSexp>::try_from(value).map(|x| x.into())
}
}
};
}
impl_try_from_rust_complexes!(&[Complex64]);
impl_try_from_rust_complexes!(Vec<Complex64>);
impl_try_from_rust_complexes!(Complex64);
// Index for OwnedComplexSexp ***************
impl Index<usize> for OwnedComplexSexp {
type Output = Complex64;
fn index(&self, index: usize) -> &Self::Output {
assert_len(self.len, index).unwrap();
unsafe { &*(self.raw.add(index)) }
}
}
impl IndexMut<usize> for OwnedComplexSexp {
fn index_mut(&mut self, index: usize) -> &mut Self::Output {
assert_len(self.len, index).unwrap();
unsafe { &mut *(self.raw.add(index)) }
}
}