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
use std::ops::Range;

use crate::{
    Consumer, Executor, ExecutorCallback, IndexedParallelIterator, IndexedProducer,
    IndexedProducerCallback, IntoParallelIterator, ParallelIterator, Producer, ProducerCallback,
    Reducer, WithIndexedProducer, WithProducer, WithSetup,
};

/// Parallel iterator over a range, implemented for all integer types.
///
/// **Note:** The `zip` operation requires `IndexedParallelIterator`
/// which is not implemented for `u64`, `i64`, `u128`, or `i128`.
///
/// ```
/// use asparit::*;
///
/// let p = (0..25usize)
///     .into_par_iter()
///     .zip(0..25usize)
///     .filter(|&(x, y)| x % 5 == 0 || y % 5 == 0)
///     .map(|(x, y)| x * y)
///     .sum::<usize>()
///     .exec();
///
/// let s = (0..25usize)
///     .zip(0..25)
///     .filter(|&(x, y)| x % 5 == 0 || y % 5 == 0)
///     .map(|(x, y)| x * y)
///     .sum();
///
/// assert_eq!(p, s);
/// ```
#[derive(Debug, Clone)]
pub struct Iter<T> {
    range: Range<T>,
}

struct IterProducer<T> {
    range: Range<T>,
}

trait RangeLen<L> {
    fn length(&self) -> L;
}

impl<'a, T> IntoParallelIterator<'a> for Range<T>
where
    Iter<T>: ParallelIterator<'a>,
{
    type Item = <Iter<T> as ParallelIterator<'a>>::Item;
    type Iter = Iter<T>;

    fn into_par_iter(self) -> Self::Iter {
        Iter { range: self }
    }
}

impl<T> IntoIterator for IterProducer<T>
where
    Range<T>: Iterator,
{
    type Item = <Range<T> as Iterator>::Item;
    type IntoIter = Range<T>;

    fn into_iter(self) -> Self::IntoIter {
        self.range
    }
}

macro_rules! range_len_impl {
    ( $t:ty, $len_t:ty ) => {
        impl RangeLen<$len_t> for Range<$t> {
            fn length(&self) -> $len_t {
                if self.start < self.end {
                    self.end.wrapping_sub(self.start) as $len_t
                } else {
                    0
                }
            }
        }
    };
}

macro_rules! unindexed_parallel_iterator_impl {
    ( $t:ty, $len_t:ty ) => {
        range_len_impl!($t, $len_t);

        impl<'a> ParallelIterator<'a> for Iter<$t> {
            type Item = $t;

            fn drive<E, C, D, R>(self, executor: E, consumer: C) -> E::Result
            where
                E: Executor<'a, D>,
                C: Consumer<Self::Item, Result = D, Reducer = R> + 'a,
                D: Send + 'a,
                R: Reducer<D> + Send + 'a,
            {
                if let Some(len) = self.len_hint_opt() {
                    let start = self.range.start;
                    (0..len)
                        .into_par_iter()
                        .map(move |i| start.wrapping_add(i as $t))
                        .drive_indexed(executor, consumer)
                } else {
                    self.with_producer(ExecutorCallback::new(executor, consumer))
                }
            }

            fn len_hint_opt(&self) -> Option<usize> {
                let len = self.range.length();

                if len <= usize::MAX as $len_t {
                    Some(len as usize)
                } else {
                    None
                }
            }
        }

        impl<'a> WithProducer<'a> for Iter<$t> {
            type Item = $t;

            fn with_producer<CB>(self, callback: CB) -> CB::Output
            where
                CB: ProducerCallback<'a, Self::Item>,
            {
                callback.callback(IterProducer { range: self.range })
            }
        }

        impl WithSetup for IterProducer<$t> {}

        impl Producer for IterProducer<$t> {
            type Item = $t;
            type IntoIter = Range<$t>;

            fn into_iter(self) -> Self::IntoIter {
                self.range
            }

            fn split(mut self) -> (Self, Option<Self>) {
                let index = self.range.length() / 2;

                if index > 0 {
                    let mid = self.range.start.wrapping_add(index as $t);
                    let right = mid..self.range.end;

                    self.range.end = mid;

                    (self, Some(IterProducer { range: right }))
                } else {
                    (self, None)
                }
            }
        }
    };
}

macro_rules! indexed_parallel_iterator_impl {
    ( $t:ty, $len_t:ty ) => {
        unindexed_parallel_iterator_impl!($t, $len_t);

        impl<'a> IndexedParallelIterator<'a> for Iter<$t> {
            fn drive_indexed<E, C, D, R>(self, executor: E, consumer: C) -> E::Result
            where
                E: Executor<'a, D>,
                C: Consumer<Self::Item, Result = D, Reducer = R> + 'a,
                D: Send + 'a,
                R: Reducer<D> + Send + 'a,
            {
                self.with_indexed_producer(ExecutorCallback::new(executor, consumer))
            }

            fn len_hint(&self) -> usize {
                self.range.length() as usize
            }
        }

        impl<'a> WithIndexedProducer<'a> for Iter<$t> {
            type Item = $t;

            fn with_indexed_producer<CB>(self, callback: CB) -> CB::Output
            where
                CB: IndexedProducerCallback<'a, Self::Item>,
            {
                callback.callback(IterProducer { range: self.range })
            }
        }

        impl IndexedProducer for IterProducer<$t> {
            type Item = $t;
            type IntoIter = Range<$t>;

            fn into_iter(self) -> Self::IntoIter {
                self.range
            }

            fn len(&self) -> usize {
                self.range.length() as usize
            }

            fn split_at(self, index: usize) -> (Self, Self) {
                assert!(index <= self.range.length() as usize);

                let mid = self.range.start.wrapping_add(index as $t);
                let left = self.range.start..mid;
                let right = mid..self.range.end;

                (IterProducer { range: left }, IterProducer { range: right })
            }
        }
    };
}

indexed_parallel_iterator_impl!(u8, u8);
indexed_parallel_iterator_impl!(i8, u8);
indexed_parallel_iterator_impl!(u16, u16);
indexed_parallel_iterator_impl!(i16, u16);
indexed_parallel_iterator_impl!(u32, u32);
indexed_parallel_iterator_impl!(i32, u32);
indexed_parallel_iterator_impl!(usize, usize);
indexed_parallel_iterator_impl!(isize, usize);

unindexed_parallel_iterator_impl!(u64, u64);
unindexed_parallel_iterator_impl!(i64, u64);
unindexed_parallel_iterator_impl!(u128, u128);
unindexed_parallel_iterator_impl!(i128, u128);