sparsey 0.13.3

Entity Component System based on sparse sets
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

mod dense_par_iter;
mod sparse_par_iter;

pub use self::dense_par_iter::*;
pub use self::sparse_par_iter::*;

use crate::query::Query;
use rayon::iter::plumbing::UnindexedConsumer;
use rayon::iter::ParallelIterator;

/// Sparse or dense parallel iterator over all items that match the query.
#[must_use]
pub enum ParIter<'a, G, I, E>
where
    G: Query,
    I: Query,
    E: Query,
{
    /// Sparse iterator.
    Sparse(SparseParIter<'a, G, I, E>),
    /// Dense iterator. Extremely fast.
    Dense(DenseParIter<'a, G>),
}

impl<'a, G, I, E> ParIter<'a, G, I, E>
where
    G: Query,
    I: Query,
    E: Query,
{
    /// Returns whether the iterator is sparse.
    #[must_use]
    pub const fn is_sparse(&self) -> bool {
        matches!(self, Self::Sparse(_))
    }

    /// Returns whether the iterator is dense.
    #[must_use]
    pub const fn is_dense(&self) -> bool {
        matches!(self, Self::Dense(_))
    }
}

impl<'a, G, I, E> ParallelIterator for ParIter<'a, G, I, E>
where
    G: Query,
    I: Query,
    E: Query,
{
    type Item = G::Item<'a>;

    fn drive_unindexed<C>(self, consumer: C) -> C::Result
    where
        C: UnindexedConsumer<Self::Item>,
    {
        match self {
            Self::Sparse(iter) => iter.drive_unindexed(consumer),
            Self::Dense(iter) => iter.drive_unindexed(consumer),
        }
    }

    fn opt_len(&self) -> Option<usize> {
        match self {
            Self::Sparse(iter) => iter.opt_len(),
            Self::Dense(iter) => iter.opt_len(),
        }
    }
}

impl<'a, G, I, E> From<SparseParIter<'a, G, I, E>> for ParIter<'a, G, I, E>
where
    G: Query,
    I: Query,
    E: Query,
{
    fn from(iter: SparseParIter<'a, G, I, E>) -> Self {
        Self::Sparse(iter)
    }
}

impl<'a, G, I, E> From<DenseParIter<'a, G>> for ParIter<'a, G, I, E>
where
    G: Query,
    I: Query,
    E: Query,
{
    fn from(iter: DenseParIter<'a, G>) -> Self {
        Self::Dense(iter)
    }
}