nmr 0.1.2

NMR data tools for Rust
Documentation
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
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
use super::*;

pub(crate) fn checked_product(values: &[usize]) -> Option<usize> {
    values.iter().try_fold(1usize, |a, &b| a.checked_mul(b))
}

pub(crate) fn validate_trace_coordinate(
    shape: &[usize],
    coordinate: &[usize],
) -> Result<(), AccessError> {
    let expected = shape.len().saturating_sub(1);
    if coordinate.len() != expected {
        return Err(AccessError::TraceRankMismatch {
            expected,
            actual: coordinate.len(),
        });
    }
    for (axis, (&index, &points)) in coordinate.iter().zip(shape).enumerate() {
        if index >= points {
            return Err(AccessError::TraceOutOfBounds {
                axis,
                index,
                points,
            });
        }
    }
    Ok(())
}

pub(crate) fn validate_region(
    logical_shape: &[usize],
    start: &[usize],
    shape: &[usize],
) -> Result<(), AccessError> {
    if start.len() != logical_shape.len() || shape.len() != logical_shape.len() {
        return Err(AccessError::RegionRankMismatch {
            expected: logical_shape.len(),
            start_rank: start.len(),
            shape_rank: shape.len(),
        });
    }
    for (axis, &length) in shape.iter().enumerate() {
        if length == 0 {
            return Err(AccessError::EmptyRegion { axis });
        }
    }
    for (axis, ((&start, &length), &points)) in
        start.iter().zip(shape).zip(logical_shape).enumerate()
    {
        if start.checked_add(length).is_none_or(|end| end > points) {
            return Err(AccessError::RegionOutOfBounds {
                axis,
                start,
                length,
                points,
            });
        }
    }
    Ok(())
}

pub(super) fn validate_absolute_region(
    layout: &RawLayout,
    start: &[usize],
    shape: &[usize],
) -> Result<Vec<usize>, ReadError> {
    let logical_shape = layout.logical_shape();
    if start.len() != logical_shape.len() || shape.len() != logical_shape.len() {
        return Err(AccessError::RegionRankMismatch {
            expected: logical_shape.len(),
            start_rank: start.len(),
            shape_rank: shape.len(),
        }
        .into());
    }
    let allocation_bytes = start
        .len()
        .checked_mul(std::mem::size_of::<usize>())
        .ok_or(ReadError::SizeOverflow)?;
    let mut relative = Vec::new();
    relative
        .try_reserve_exact(start.len())
        .map_err(|_| ReadError::allocation(allocation_bytes))?;
    for (axis, ((&start, &length), (&points, &origin))) in start
        .iter()
        .zip(shape)
        .zip(logical_shape.iter().zip(layout.absolute_origin()))
        .enumerate()
    {
        if length == 0 {
            return Err(AccessError::EmptyRegion { axis }.into());
        }
        let axis_end = origin.checked_add(points).ok_or(ReadError::SizeOverflow)?;
        if start < origin
            || start
                .checked_add(length)
                .is_none_or(|region_end| region_end > axis_end)
        {
            return Err(AccessError::RegionOutOfBounds {
                axis,
                start,
                length,
                points: axis_end,
            }
            .into());
        }
        relative.push(start - origin);
    }
    Ok(relative)
}

pub(super) fn unflatten(shape: &[usize], mut index: usize) -> Result<Vec<usize>, ReadError> {
    if index >= checked_product(shape).ok_or(ReadError::SizeOverflow)? {
        return Err(ReadError::corrupt(
            InputSource::memory("normalized raw data"),
            "normalized storage index is out of bounds",
        ));
    }
    let mut coordinate = vec![0; shape.len()];
    for axis in (0..shape.len()).rev() {
        coordinate[axis] = index % shape[axis];
        index /= shape[axis];
    }
    Ok(coordinate)
}

// Inputs have already passed layout/access validation at the caller.
pub(super) fn trace_storage_index(
    shape: &[usize],
    lanes: &[usize],
    logical: &[usize],
    mut component: usize,
    direct_point: usize,
) -> Result<usize, ReadError> {
    let mut stride = 1usize;
    let mut index = 0usize;
    for axis in (0..shape.len()).rev() {
        let lane = component % lanes[axis];
        component /= lanes[axis];
        let point = if axis == shape.len() - 1 {
            direct_point
        } else {
            logical[axis]
        };
        let expanded = point
            .checked_mul(lanes[axis])
            .and_then(|value| value.checked_add(lane))
            .ok_or(ReadError::SizeOverflow)?;
        index = expanded
            .checked_mul(stride)
            .and_then(|value| index.checked_add(value))
            .ok_or(ReadError::SizeOverflow)?;
        stride = stride
            .checked_mul(shape[axis])
            .and_then(|value| value.checked_mul(lanes[axis]))
            .ok_or(ReadError::SizeOverflow)?;
    }
    Ok(index)
}

pub(super) fn region_storage_index(
    source_shape: &[usize],
    lanes: &[usize],
    output_shape: &[usize],
    start: &[usize],
    mut output_index: usize,
) -> Result<usize, ReadError> {
    let mut stride = 1usize;
    let mut index = 0usize;
    for axis in (0..source_shape.len()).rev() {
        let extent = output_shape[axis]
            .checked_mul(lanes[axis])
            .ok_or(ReadError::SizeOverflow)?;
        let expanded = output_index % extent;
        output_index /= extent;
        let coordinate = start[axis]
            .checked_mul(lanes[axis])
            .and_then(|value| value.checked_add(expanded))
            .ok_or(ReadError::SizeOverflow)?;
        index = coordinate
            .checked_mul(stride)
            .and_then(|value| index.checked_add(value))
            .ok_or(ReadError::SizeOverflow)?;
        stride = stride
            .checked_mul(source_shape[axis])
            .and_then(|value| value.checked_mul(lanes[axis]))
            .ok_or(ReadError::SizeOverflow)?;
    }
    Ok(index)
}

pub(crate) fn scatter_trace(
    destination: &mut [Complex64],
    storage_shape: &[usize],
    logical_shape: &[usize],
    component_lanes: &[usize],
    logical_coordinate: &[usize],
    trace: &[Complex64],
) -> Result<(), ReadError> {
    let invalid = || {
        ReadError::corrupt(
            InputSource::memory("normalized raw trace"),
            "trace shape or coordinate does not match the destination",
        )
    };
    let rank = logical_shape.len();
    if rank == 0
        || storage_shape.len() != rank
        || component_lanes.len() != rank
        || logical_coordinate.len() != rank - 1
    {
        return Err(invalid());
    }
    for axis in 0..rank {
        if logical_shape[axis] == 0
            || component_lanes[axis] == 0
            || logical_shape[axis].checked_mul(component_lanes[axis]) != Some(storage_shape[axis])
            || axis < rank - 1 && logical_coordinate[axis] >= logical_shape[axis]
        {
            return Err(invalid());
        }
    }
    let component_count = checked_product(component_lanes).ok_or(ReadError::SizeOverflow)?;
    let direct_points = logical_shape[rank - 1];
    if checked_product(storage_shape).ok_or(ReadError::SizeOverflow)? != destination.len()
        || component_count
            .checked_mul(direct_points)
            .ok_or(ReadError::SizeOverflow)?
            != trace.len()
    {
        return Err(invalid());
    }
    for component in 0..component_count {
        for direct_point in 0..direct_points {
            let target = trace_storage_index(
                logical_shape,
                component_lanes,
                logical_coordinate,
                component,
                direct_point,
            )?;
            destination[target] = trace[component * direct_points + direct_point];
        }
    }
    Ok(())
}

pub(super) fn reserve_complex(length: usize) -> Result<Vec<Complex64>, ReadError> {
    let requested_bytes = length
        .checked_mul(std::mem::size_of::<Complex64>())
        .ok_or(ReadError::SizeOverflow)?;
    let mut samples = Vec::new();
    samples
        .try_reserve_exact(length)
        .map_err(|_| ReadError::allocation(requested_bytes))?;
    Ok(samples)
}

pub(super) fn try_clone_complex(source: &[Complex64]) -> Result<Vec<Complex64>, ReadError> {
    let mut samples = reserve_complex(source.len())?;
    samples.extend_from_slice(source);
    Ok(samples)
}

#[cfg(test)]
mod scatter_tests {
    use super::*;

    #[test]
    fn descriptor_validation_checks_layout_without_rebuilding_it() {
        use crate::acquisition::{DirectSamples, IndirectComponents};
        let axis = |kind| {
            RawAxis::new(
                kind,
                AxisDomain::Time,
                Some(AxisUnit::Second),
                2,
                AxisCoordinates::Uniform {
                    start: 0.0,
                    step: 1.0,
                },
            )
            .unwrap()
        };
        let descriptor = RawDescriptor::new(
            vec![
                axis(RawAxisKind::Indirect(IndirectComponents::Scalar)),
                axis(RawAxisKind::Direct(DirectSamples::Complex)),
            ],
            RawMetadata::default(),
        )
        .unwrap();
        descriptor.validate().unwrap();
        let mut mismatch = descriptor.clone();
        mismatch.layout.logical_shape = vec![2].into();
        assert!(matches!(
            mismatch.validate(),
            Err(ValidationError::DescriptorDataMismatch)
        ));
        let mut mismatch = descriptor.clone();
        mismatch.layout.lane_counts[0] = 2;
        assert!(matches!(
            mismatch.validate(),
            Err(ValidationError::DescriptorDataMismatch)
        ));
        let mut overflow = descriptor.clone();
        overflow.axes[0].points = 1usize << (usize::BITS / 2);
        overflow.axes[1].points = 1usize << (usize::BITS / 2);
        assert!(matches!(
            overflow.validate(),
            Err(ValidationError::SizeOverflow)
        ));
        let mut wrong_order = descriptor;
        wrong_order.axes.swap(0, 1);
        assert!(matches!(
            wrong_order.validate(),
            Err(ValidationError::DirectAxisNotFastest)
        ));
    }

    #[test]
    fn sparse_region_reserves_only_matching_trace_slots() {
        let data = RawData::sparse(
            RawLayout::from_parts(vec![128, 1], vec![1, 1]).unwrap(),
            (0..128)
                .map(|point| {
                    SparseTrace::new(
                        ObservationOrdinal::new(point),
                        SamplingCoordinate::new(vec![point]),
                        vec![Complex64::new(point as f64, 0.0)],
                    )
                })
                .collect(),
        )
        .unwrap();
        let region = data
            .read_region(&crate::raw::Region::new([100, 0], [1, 1]).unwrap(), 16)
            .unwrap();
        let SampleRepresentation::Sparse(traces) = &region.data().representation else {
            panic!("sparse result");
        };
        assert_eq!(traces.capacity(), 1);
        assert_eq!(traces[0].samples(), &[Complex64::new(100.0, 0.0)]);
    }

    #[test]
    fn dense_access_preserves_all_lanes_and_nested_absolute_regions() {
        let data = RawData::dense(
            RawLayout::from_parts(vec![2, 3, 2], vec![2, 2, 2]).unwrap(),
            (0..96)
                .map(|value| Complex64::new(value as f64, 0.0))
                .collect(),
        )
        .unwrap();
        let trace = data.read_trace(&[1, 2]).unwrap();
        let mut expected = Vec::new();
        for slow in 0..2 {
            for middle in 0..2 {
                for fast in 0..2 {
                    for direct in 0..2 {
                        expected.push(Complex64::new(
                            (64 + 24 * slow + 4 * middle + 2 * direct + fast) as f64,
                            0.0,
                        ));
                    }
                }
            }
        }
        assert_eq!(trace.samples(), expected);
        let region = data
            .read_region(
                &crate::raw::Region::new([1, 1, 0], [1, 2, 2]).unwrap(),
                usize::MAX,
            )
            .unwrap();
        let mut expected = Vec::new();
        for slow in 0..2 {
            for middle in 0..4 {
                for fast in 0..4 {
                    expected.push(Complex64::new(
                        ((2 + slow) * 24 + (2 + middle) * 4 + fast) as f64,
                        0.0,
                    ));
                }
            }
        }
        assert_eq!(region.data().dense_samples().unwrap(), expected);
        let inner = crate::raw::Region::new([1, 2, 1], [1, 1, 1]).unwrap();
        let nested = region.data().read_region(&inner, usize::MAX).unwrap();
        let direct = data.read_region(&inner, usize::MAX).unwrap();
        assert_eq!(nested.data(), direct.data());
        assert_eq!(
            nested.data().read_trace(&[1, 2]).unwrap().samples(),
            &[66.0, 67.0, 70.0, 71.0, 90.0, 91.0, 94.0, 95.0]
                .map(|value| Complex64::new(value, 0.0))
        );
    }

    #[test]
    fn sparse_validation_accepts_unordered_unique_ordinals_but_rejects_duplicates() {
        for ordinals in [vec![0, 1, 2], vec![2, 0, 1], vec![usize::MAX, 1, 0]] {
            let data = RawData::sparse(
                RawLayout::from_parts(vec![3, 1], vec![1, 1]).unwrap(),
                ordinals
                    .iter()
                    .enumerate()
                    .map(|(coordinate, &ordinal)| {
                        SparseTrace::new(
                            ObservationOrdinal::new(ordinal),
                            SamplingCoordinate::new(vec![coordinate]),
                            vec![Complex64::new(coordinate as f64, 0.0)],
                        )
                    })
                    .collect(),
            )
            .unwrap();
            data.validate().unwrap();
            assert_eq!(
                data.sparse_traces()
                    .unwrap()
                    .iter()
                    .map(|trace| trace.ordinal().get())
                    .collect::<Vec<_>>(),
                ordinals,
            );
        }
        let duplicate = RawData::sparse(
            RawLayout::from_parts(vec![3, 1], vec![1, 1]).unwrap(),
            [2, 0, 2]
                .into_iter()
                .enumerate()
                .map(|(coordinate, ordinal)| {
                    SparseTrace::new(
                        ObservationOrdinal::new(ordinal),
                        SamplingCoordinate::new(vec![coordinate]),
                        vec![Complex64::new(0.0, 0.0)],
                    )
                })
                .collect(),
        );
        assert_eq!(
            duplicate.unwrap_err(),
            ValidationError::DuplicateObservationOrdinal
        );
    }

    #[test]
    fn schedule_caches_uniqueness_without_reordering_observations() {
        for (grid, coordinates, repeated, complete) in [
            (
                vec![2, 2],
                vec![vec![1, 1], vec![0, 1], vec![1, 0], vec![0, 0]],
                false,
                true,
            ),
            (
                vec![2, 2],
                vec![vec![1, 1], vec![0, 1], vec![1, 1], vec![0, 0]],
                true,
                false,
            ),
            (vec![2, 2], vec![vec![1, 1], vec![0, 1]], false, false),
            (vec![], vec![vec![]], false, true),
            (vec![], vec![vec![], vec![]], true, false),
        ] {
            let coordinates: Vec<_> = coordinates
                .into_iter()
                .map(SamplingCoordinate::new)
                .collect();
            let schedule = SamplingSchedule::new(grid, coordinates.clone()).unwrap();
            assert_eq!(schedule.coordinates(), coordinates);
            for _ in 0..3 {
                assert_eq!(schedule.has_repeated_coordinates(), repeated);
                assert_eq!(schedule.is_complete_unique().unwrap(), complete);
            }
            assert_eq!(schedule.clone(), schedule);
        }
        let error: ReadError = ValidationError::Allocation {
            requested_bytes: 128,
        }
        .into();
        assert_eq!(error.kind(), crate::ReadErrorKind::Allocation);
        assert!(matches!(
            error.reason(),
            ReadErrorReason::Allocation {
                requested_bytes: 128
            }
        ));
    }

    #[test]
    fn scatter_matches_expanded_three_axis_component_order() {
        let sentinel = Complex64::new(-1.0, 0.0);
        let mut actual = vec![sentinel; 96];
        let trace: Vec<_> = (0..16)
            .map(|index| Complex64::new(index as f64, 0.0))
            .collect();
        scatter_trace(
            &mut actual,
            &[4, 6, 4],
            &[2, 3, 2],
            &[2, 2, 2],
            &[1, 2],
            &trace,
        )
        .unwrap();
        let mut expected = vec![sentinel; 96];
        for slow in 0..2 {
            for middle in 0..2 {
                for fast in 0..2 {
                    for direct in 0..2 {
                        expected[64 + 24 * slow + 4 * middle + 2 * direct + fast] =
                            Complex64::new((8 * slow + 4 * middle + 2 * fast + direct) as f64, 0.0);
                    }
                }
            }
        }
        assert_eq!(actual, expected);
        assert!(
            scatter_trace(
                &mut actual,
                &[4, 6, 4],
                &[2, 3, 2],
                &[2, 2, 2],
                &[2, 2],
                &trace
            )
            .is_err()
        );
        assert!(
            scatter_trace(
                &mut actual,
                &[4, 6, 4],
                &[2, 3, 2],
                &[2, 2, 2],
                &[1, 2],
                &trace[..15]
            )
            .is_err()
        );
        assert!(scatter_trace(&mut [], &[], &[], &[], &[], &[]).is_err());
        assert!(
            scatter_trace(
                &mut [],
                &[usize::MAX, 2],
                &[usize::MAX, 2],
                &[1, 1],
                &[0],
                &[]
            )
            .is_err()
        );
    }
}