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

use super::AsRawSlice;
use core::cmp::Ordering;

/// Index of an element in a jagged array.
#[derive(Default, PartialEq, Debug, Clone)]
pub struct JaggedIndex {
    /// Index of the array containing the element.
    pub f: usize,
    /// Index of the element within the array containing it.
    pub i: usize,
}

impl From<(usize, usize)> for JaggedIndex {
    fn from((f, i): (usize, usize)) -> Self {
        Self::new(f, i)
    }
}

impl From<[usize; 2]> for JaggedIndex {
    fn from([f, i]: [usize; 2]) -> Self {
        Self::new(f, i)
    }
}

impl JaggedIndex {
    /// Creates a new jagged index:
    ///
    /// * `f`: index of the array containing the element.
    /// * `i`: index of the element within the array containing it.
    pub fn new(f: usize, i: usize) -> Self {
        Self { f, i }
    }

    pub(super) fn is_in_exc_bounds_of<T>(&self, slices: &[impl AsRawSlice<T>]) -> bool {
        match slices.is_empty() {
            true => self.f == 0 && self.i == 0,
            false => self.f < slices.len() && self.i <= slices[self.f].length(),
        }
    }
}

impl PartialOrd for JaggedIndex {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        match self.f.partial_cmp(&other.f) {
            Some(Ordering::Equal) => self.i.partial_cmp(&other.i),
            ord => ord,
        }
    }
}