|
| 1 | +//! Contains a set of compile failure doctests. |
| 2 | +
|
| 3 | +// ----------------------------------------------------------------------------- |
| 4 | +// Ensures non-send data cannot be moved into a join. |
| 5 | + |
| 6 | +/** ```compile_fail,E0277 |
| 7 | +
|
| 8 | +use std::rc::Rc; |
| 9 | +use forte::ThreadPool; |
| 10 | +
|
| 11 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 12 | +
|
| 13 | +let r = Rc::new(22); |
| 14 | +THREAD_POOL.join(|_| r.clone(), |_| r.clone()); |
| 15 | +//~^ ERROR |
| 16 | +
|
| 17 | +``` */ |
| 18 | +mod nonsend_input {} |
| 19 | + |
| 20 | +// ----------------------------------------------------------------------------- |
| 21 | +// Ensures non-send data cannot be returned by join. |
| 22 | + |
| 23 | +/** ```compile_fail,E0277 |
| 24 | +
|
| 25 | +use std::rc::Rc; |
| 26 | +use forte::ThreadPool; |
| 27 | +
|
| 28 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 29 | +
|
| 30 | +THREAD_POOL.join(|_| Rc::new(22), |_| ()); //~ ERROR |
| 31 | +
|
| 32 | +THREAD_POOL.depopulate(); |
| 33 | +
|
| 34 | +``` */ |
| 35 | +mod nonsend_left_join {} |
| 36 | + |
| 37 | +/** ```compile_fail,E0277 |
| 38 | +
|
| 39 | +use std::rc::Rc; |
| 40 | +use forte::ThreadPool; |
| 41 | +
|
| 42 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 43 | +
|
| 44 | +THREAD_POOL.join(|_| (), |_| Rc::new(23)); //~ ERROR |
| 45 | +
|
| 46 | +THREAD_POOL.depopulate(); |
| 47 | +
|
| 48 | +``` */ |
| 49 | +mod nonsend_right_join {} |
| 50 | + |
| 51 | +// ----------------------------------------------------------------------------- |
| 52 | +// Ensures scopes can not borrow data spawned within the closure. |
| 53 | + |
| 54 | +/** ```compile_fail,E0373 |
| 55 | +
|
| 56 | +use forte::ThreadPool; |
| 57 | +use forte::Worker; |
| 58 | +
|
| 59 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 60 | +
|
| 61 | +fn bad_scope<F>(f: F) |
| 62 | + where F: FnOnce(&i32) + Send, |
| 63 | +{ |
| 64 | + THREAD_POOL.scope(|scope| { |
| 65 | + let x = 22; |
| 66 | + scope.spawn(|_: &Worker| f(&x)); //~ ERROR `x` does not live long enough |
| 67 | + }); |
| 68 | +} |
| 69 | +
|
| 70 | +fn good_scope<F>(f: F) |
| 71 | + where F: FnOnce(&i32) + Send, |
| 72 | +{ |
| 73 | + let x = 22; |
| 74 | + THREAD_POOL.scope(|scope| { |
| 75 | + scope.spawn(|_: &Worker| f(&x)); |
| 76 | + }); |
| 77 | +} |
| 78 | +
|
| 79 | +fn main() { } |
| 80 | +
|
| 81 | +``` */ |
| 82 | +mod scope_join_bad {} |
| 83 | + |
| 84 | +// ----------------------------------------------------------------------------- |
| 85 | +// Ensures the two branches of a join mutably borrow the same data. |
| 86 | + |
| 87 | +/** ```compile_fail,E0524 |
| 88 | +
|
| 89 | +use forte::ThreadPool; |
| 90 | +use forte::Worker; |
| 91 | +
|
| 92 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 93 | +
|
| 94 | +fn quick_sort<T:PartialOrd+Send>(v: &mut [T]) { |
| 95 | + if v.len() <= 1 { |
| 96 | + return; |
| 97 | + } |
| 98 | +
|
| 99 | + let mid = partition(v); |
| 100 | + let (lo, _hi) = v.split_at_mut(mid); |
| 101 | + THREAD_POOL.join(|_| quick_sort(lo), |_| quick_sort(lo)); //~ ERROR |
| 102 | +} |
| 103 | +
|
| 104 | +fn partition<T:PartialOrd+Send>(v: &mut [T]) -> usize { |
| 105 | + let pivot = v.len() - 1; |
| 106 | + let mut i = 0; |
| 107 | + for j in 0..pivot { |
| 108 | + if v[j] <= v[pivot] { |
| 109 | + v.swap(i, j); |
| 110 | + i += 1; |
| 111 | + } |
| 112 | + } |
| 113 | + v.swap(i, pivot); |
| 114 | + i |
| 115 | +} |
| 116 | +
|
| 117 | +fn main() { } |
| 118 | +
|
| 119 | +``` */ |
| 120 | +mod quicksort_race_1 {} |
| 121 | + |
| 122 | +/** ```compile_fail,E0500 |
| 123 | +
|
| 124 | +use forte::ThreadPool; |
| 125 | +use forte::Worker; |
| 126 | +
|
| 127 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 128 | +
|
| 129 | +fn quick_sort<T:PartialOrd+Send>(v: &mut [T]) { |
| 130 | + if v.len() <= 1 { |
| 131 | + return; |
| 132 | + } |
| 133 | +
|
| 134 | + let mid = partition(v); |
| 135 | + let (lo, _hi) = v.split_at_mut(mid); |
| 136 | + THREAD_POOL.join(|_| quick_sort(lo), |_| quick_sort(v)); //~ ERROR |
| 137 | +} |
| 138 | +
|
| 139 | +fn partition<T:PartialOrd+Send>(v: &mut [T]) -> usize { |
| 140 | + let pivot = v.len() - 1; |
| 141 | + let mut i = 0; |
| 142 | + for j in 0..pivot { |
| 143 | + if v[j] <= v[pivot] { |
| 144 | + v.swap(i, j); |
| 145 | + i += 1; |
| 146 | + } |
| 147 | + } |
| 148 | + v.swap(i, pivot); |
| 149 | + i |
| 150 | +} |
| 151 | +
|
| 152 | +fn main() { } |
| 153 | +
|
| 154 | +``` */ |
| 155 | +mod quicksort_race_2 {} |
| 156 | + |
| 157 | +/** ```compile_fail,E0524 |
| 158 | +
|
| 159 | +use forte::ThreadPool; |
| 160 | +use forte::Worker; |
| 161 | +
|
| 162 | +static THREAD_POOL: ThreadPool = ThreadPool::new(); |
| 163 | +
|
| 164 | +fn quick_sort<T:PartialOrd+Send>(v: &mut [T]) { |
| 165 | + if v.len() <= 1 { |
| 166 | + return; |
| 167 | + } |
| 168 | +
|
| 169 | + let mid = partition(v); |
| 170 | + let (_lo, hi) = v.split_at_mut(mid); |
| 171 | + THREAD_POOL.join(|_| quick_sort(hi), |_| quick_sort(hi)); //~ ERROR |
| 172 | +} |
| 173 | +
|
| 174 | +fn partition<T:PartialOrd+Send>(v: &mut [T]) -> usize { |
| 175 | + let pivot = v.len() - 1; |
| 176 | + let mut i = 0; |
| 177 | + for j in 0..pivot { |
| 178 | + if v[j] <= v[pivot] { |
| 179 | + v.swap(i, j); |
| 180 | + i += 1; |
| 181 | + } |
| 182 | + } |
| 183 | + v.swap(i, pivot); |
| 184 | + i |
| 185 | +} |
| 186 | +
|
| 187 | +fn main() { } |
| 188 | +
|
| 189 | +``` */ |
| 190 | +mod quicksort_race_3 {} |
0 commit comments