orx-concurrent-iter 3.3.0

A thread-safe and ergonomic concurrent iterator trait and efficient lock-free implementations.
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

use super::raw_jagged_ref::RawJaggedRef;
use crate::implementations::jagged_arrays::{JaggedIndex, JaggedIndexer, Slices};

/// A slice of a jagged array which might be empty, a slice of a single vector,
/// or a series of slices of subsequent arrays of the jagged array.
pub struct RawJaggedSlice<'a, T, S, X>
where
    X: JaggedIndexer,
    S: Slices<'a, T>,
{
    jagged: RawJaggedRef<'a, T, S, X>,
    begin: JaggedIndex,
    end: JaggedIndex,
    len: usize,
    num_slices: usize,
}

impl<'a, T, S, X> Default for RawJaggedSlice<'a, T, S, X>
where
    X: JaggedIndexer,
    S: Slices<'a, T>,
{
    fn default() -> Self {
        Self {
            jagged: Default::default(),
            begin: Default::default(),
            end: Default::default(),
            len: Default::default(),
            num_slices: Default::default(),
        }
    }
}

impl<'a, T, S, X> RawJaggedSlice<'a, T, S, X>
where
    X: JaggedIndexer,
    S: Slices<'a, T>,
{
    pub(super) fn new(
        jagged: RawJaggedRef<'a, T, S, X>,
        begin: JaggedIndex,
        end: JaggedIndex,
        len: usize,
    ) -> Self {
        // TODO: debug assert bounds
        // debug_assert!(begin.is_in_exc_bounds_of(&arrays));
        // debug_assert!(end.is_in_exc_bounds_of(&arrays));
        debug_assert!(begin <= end);

        let num_slices = match begin.f == end.f {
            true => match begin.i < end.i {
                true => 1,
                false => 0,
            },
            false => {
                const FIRST: usize = 1;
                let last = match end.i > 0 {
                    true => 1,
                    false => 0,
                };
                let middle = end.f - begin.f - 1;
                FIRST + last + middle
            }
        };

        Self {
            jagged,
            begin,
            end,
            len,
            num_slices,
        }
    }

    /// Returns total number of elements within the jagged arrays slice (`O(1)`).
    pub(super) fn len(&self) -> usize {
        self.len
    }

    pub(super) fn num_slices(&self) -> usize {
        self.jagged.num_slices()
    }

    pub(super) fn get_slice(&self, s: usize) -> Option<&'a [T]> {
        let f = self.begin.f + s;
        match self.jagged.len_of(f) {
            Some(arr_len) => {
                let begin_i = match s == 0 {
                    true => self.begin.i,
                    false => 0,
                };

                let end_exc = match s == self.num_slices - 1 {
                    false => arr_len,
                    true => match self.end.i {
                        0 => arr_len,
                        end => end,
                    },
                };

                let len = end_exc - begin_i;
                debug_assert!(len > 0);

                self.jagged.slice(f, begin_i, len)
            }
            None => None,
        }
    }
}