| 1 |
use rayon::prelude::*; |
| 2 |
|
| 3 |
fn check<I>(iter: I) |
| 4 |
where |
| 5 |
I: ParallelIterator + Clone, |
| 6 |
I::Item: std::fmt::Debug + PartialEq, |
| 7 |
{ |
| 8 |
let a: Vec<_> = iter.clone().collect(); |
| 9 |
let b: Vec<_> = iter.collect(); |
| 10 |
assert_eq!(a, b); |
| 11 |
} |
| 12 |
|
| 13 |
fn check_count<I>(iter: I) |
| 14 |
where |
| 15 |
I: ParallelIterator + Clone, |
| 16 |
{ |
| 17 |
assert_eq!(iter.clone().count(), iter.count()); |
| 18 |
} |
| 19 |
|
| 20 |
#[test] |
| 21 |
fn clone_binary_heap() { |
| 22 |
use std::collections::BinaryHeap; |
| 23 |
let heap: BinaryHeap<_> = (0..1000).collect(); |
| 24 |
check(heap.par_iter()); |
| 25 |
check(heap.into_par_iter()); |
| 26 |
} |
| 27 |
|
| 28 |
#[test] |
| 29 |
fn clone_btree_map() { |
| 30 |
use std::collections::BTreeMap; |
| 31 |
let map: BTreeMap<_, _> = (0..1000).enumerate().collect(); |
| 32 |
check(map.par_iter()); |
| 33 |
} |
| 34 |
|
| 35 |
#[test] |
| 36 |
fn clone_btree_set() { |
| 37 |
use std::collections::BTreeSet; |
| 38 |
let set: BTreeSet<_> = (0..1000).collect(); |
| 39 |
check(set.par_iter()); |
| 40 |
} |
| 41 |
|
| 42 |
#[test] |
| 43 |
fn clone_hash_map() { |
| 44 |
use std::collections::HashMap; |
| 45 |
let map: HashMap<_, _> = (0..1000).enumerate().collect(); |
| 46 |
check(map.par_iter()); |
| 47 |
} |
| 48 |
|
| 49 |
#[test] |
| 50 |
fn clone_hash_set() { |
| 51 |
use std::collections::HashSet; |
| 52 |
let set: HashSet<_> = (0..1000).collect(); |
| 53 |
check(set.par_iter()); |
| 54 |
} |
| 55 |
|
| 56 |
#[test] |
| 57 |
fn clone_linked_list() { |
| 58 |
use std::collections::LinkedList; |
| 59 |
let list: LinkedList<_> = (0..1000).collect(); |
| 60 |
check(list.par_iter()); |
| 61 |
check(list.into_par_iter()); |
| 62 |
} |
| 63 |
|
| 64 |
#[test] |
| 65 |
fn clone_vec_deque() { |
| 66 |
use std::collections::VecDeque; |
| 67 |
let deque: VecDeque<_> = (0..1000).collect(); |
| 68 |
check(deque.par_iter()); |
| 69 |
check(deque.into_par_iter()); |
| 70 |
} |
| 71 |
|
| 72 |
#[test] |
| 73 |
fn clone_option() { |
| 74 |
let option = Some(0); |
| 75 |
check(option.par_iter()); |
| 76 |
check(option.into_par_iter()); |
| 77 |
} |
| 78 |
|
| 79 |
#[test] |
| 80 |
fn clone_result() { |
| 81 |
let result = Ok::<_, ()>(0); |
| 82 |
check(result.par_iter()); |
| 83 |
check(result.into_par_iter()); |
| 84 |
} |
| 85 |
|
| 86 |
#[test] |
| 87 |
fn clone_range() { |
| 88 |
check((0..1000).into_par_iter()); |
| 89 |
} |
| 90 |
|
| 91 |
#[test] |
| 92 |
fn clone_range_inclusive() { |
| 93 |
check((0..=1000).into_par_iter()); |
| 94 |
} |
| 95 |
|
| 96 |
#[test] |
| 97 |
fn clone_str() { |
| 98 |
let s = include_str!("clones.rs"); |
| 99 |
check(s.par_chars()); |
| 100 |
check(s.par_lines()); |
| 101 |
check(s.par_split('\n')); |
| 102 |
check(s.par_split_inclusive('\n')); |
| 103 |
check(s.par_split_terminator('\n')); |
| 104 |
check(s.par_split_whitespace()); |
| 105 |
check(s.par_split_ascii_whitespace()); |
| 106 |
} |
| 107 |
|
| 108 |
#[test] |
| 109 |
fn clone_vec() { |
| 110 |
let v: Vec<_> = (0..1000).collect(); |
| 111 |
check(v.par_iter()); |
| 112 |
check(v.par_chunk_by(i32::eq)); |
| 113 |
check(v.par_chunks(42)); |
| 114 |
check(v.par_chunks_exact(42)); |
| 115 |
check(v.par_rchunks(42)); |
| 116 |
check(v.par_rchunks_exact(42)); |
| 117 |
check(v.par_windows(42)); |
| 118 |
check(v.par_split(|x| x % 3 == 0)); |
| 119 |
check(v.par_split_inclusive(|x| x % 3 == 0)); |
| 120 |
check(v.into_par_iter()); |
| 121 |
} |
| 122 |
|
| 123 |
#[test] |
| 124 |
fn clone_array() { |
| 125 |
let a = [0i32; 100]; |
| 126 |
check(a.into_par_iter()); |
| 127 |
} |
| 128 |
|
| 129 |
#[test] |
| 130 |
fn clone_adaptors() { |
| 131 |
let v: Vec<_> = (0..1000).map(Some).collect(); |
| 132 |
check(v.par_iter().by_exponential_blocks()); |
| 133 |
check(v.par_iter().by_uniform_blocks(100)); |
| 134 |
check(v.par_iter().chain(&v)); |
| 135 |
check(v.par_iter().cloned()); |
| 136 |
check(v.par_iter().copied()); |
| 137 |
check(v.par_iter().enumerate()); |
| 138 |
check(v.par_iter().filter(|_| true)); |
| 139 |
check(v.par_iter().filter_map(|x| *x)); |
| 140 |
check(v.par_iter().flat_map(|x| *x)); |
| 141 |
check(v.par_iter().flat_map_iter(|x| *x)); |
| 142 |
check(v.par_iter().flatten()); |
| 143 |
check(v.par_iter().flatten_iter()); |
| 144 |
check(v.par_iter().with_max_len(1).fold(|| 0, |x, _| x)); |
| 145 |
check(v.par_iter().with_max_len(1).fold_with(0, |x, _| x)); |
| 146 |
check(v.par_iter().with_max_len(1).fold_chunks(1, || 0, |x, _| x)); |
| 147 |
check( |
| 148 |
v.par_iter() |
| 149 |
.with_max_len(1) |
| 150 |
.fold_chunks_with(1, 0, |x, _| x), |
| 151 |
); |
| 152 |
check(v.par_iter().with_max_len(1).try_fold(|| 0, |_, &x| x)); |
| 153 |
check(v.par_iter().with_max_len(1).try_fold_with(0, |_, &x| x)); |
| 154 |
check(v.par_iter().inspect(|_| ())); |
| 155 |
check(v.par_iter().update(|_| ())); |
| 156 |
check(v.par_iter().interleave(&v)); |
| 157 |
check(v.par_iter().interleave_shortest(&v)); |
| 158 |
check(v.par_iter().intersperse(&None)); |
| 159 |
check(v.par_iter().chunks(3)); |
| 160 |
check(v.par_iter().map(|x| x)); |
| 161 |
check(v.par_iter().map_with(0, |_, x| x)); |
| 162 |
check(v.par_iter().map_init(|| 0, |_, x| x)); |
| 163 |
check(v.par_iter().panic_fuse()); |
| 164 |
check(v.par_iter().positions(|_| true)); |
| 165 |
check(v.par_iter().rev()); |
| 166 |
check(v.par_iter().skip(42)); |
| 167 |
check(v.par_iter().skip_any_while(|_| false)); |
| 168 |
check(v.par_iter().take(42)); |
| 169 |
check(v.par_iter().take_any_while(|_| true)); |
| 170 |
check(v.par_iter().cloned().while_some()); |
| 171 |
check(v.par_iter().with_max_len(1)); |
| 172 |
check(v.par_iter().with_min_len(1)); |
| 173 |
check(v.par_iter().zip(&v)); |
| 174 |
check(v.par_iter().zip_eq(&v)); |
| 175 |
check(v.par_iter().step_by(2)); |
| 176 |
} |
| 177 |
|
| 178 |
#[test] |
| 179 |
fn clone_counted_adaptors() { |
| 180 |
let v: Vec<_> = (0..1000).collect(); |
| 181 |
check_count(v.par_iter().skip_any(42)); |
| 182 |
check_count(v.par_iter().take_any(42)); |
| 183 |
} |
| 184 |
|
| 185 |
#[test] |
| 186 |
fn clone_empty() { |
| 187 |
check(rayon::iter::empty::<i32>()); |
| 188 |
} |
| 189 |
|
| 190 |
#[test] |
| 191 |
fn clone_once() { |
| 192 |
check(rayon::iter::once(10)); |
| 193 |
} |
| 194 |
|
| 195 |
#[test] |
| 196 |
fn clone_repeat() { |
| 197 |
let x: Option<i32> = None; |
| 198 |
check(rayon::iter::repeat(x).while_some()); |
| 199 |
check(rayon::iter::repeatn(x, 1000)); |
| 200 |
} |
| 201 |
|
| 202 |
#[test] |
| 203 |
fn clone_splitter() { |
| 204 |
check(rayon::iter::split(0..1000, |x| (x, None))); |
| 205 |
} |
| 206 |
|
| 207 |
#[test] |
| 208 |
fn clone_multizip() { |
| 209 |
let v: &Vec<_> = &(0..1000).collect(); |
| 210 |
check((v,).into_par_iter()); |
| 211 |
check((v, v).into_par_iter()); |
| 212 |
check((v, v, v).into_par_iter()); |
| 213 |
check((v, v, v, v).into_par_iter()); |
| 214 |
check((v, v, v, v, v).into_par_iter()); |
| 215 |
check((v, v, v, v, v, v).into_par_iter()); |
| 216 |
check((v, v, v, v, v, v, v).into_par_iter()); |
| 217 |
check((v, v, v, v, v, v, v, v).into_par_iter()); |
| 218 |
check((v, v, v, v, v, v, v, v, v).into_par_iter()); |
| 219 |
check((v, v, v, v, v, v, v, v, v, v).into_par_iter()); |
| 220 |
check((v, v, v, v, v, v, v, v, v, v, v).into_par_iter()); |
| 221 |
check((v, v, v, v, v, v, v, v, v, v, v, v).into_par_iter()); |
| 222 |
} |