|
1 | 1 | use super::{ParallelExtend, IntoParallelIterator, ParallelIterator};
|
2 | 2 |
|
| 3 | +use std::borrow::Cow; |
3 | 4 | use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet};
|
4 | 5 | use std::hash::{BuildHasher, Hash};
|
5 | 6 | use std::collections::LinkedList;
|
@@ -262,6 +263,36 @@ impl ParallelExtend<String> for String {
|
262 | 263 | }
|
263 | 264 | }
|
264 | 265 |
|
| 266 | +/// Extend a string with string slices from a parallel iterator. |
| 267 | +impl<'a> ParallelExtend<Cow<'a, str>> for String { |
| 268 | + fn par_extend<I>(&mut self, par_iter: I) |
| 269 | + where I: IntoParallelIterator<Item = Cow<'a, str>> |
| 270 | + { |
| 271 | + // This is like `extend`, but `Extend<Cow<'a, str>> for String` |
| 272 | + // wasn't added until Rust 1.19, so we can't use it directly yet. |
| 273 | + let list = par_iter |
| 274 | + .into_par_iter() |
| 275 | + .fold(Vec::new, |mut vec, elem| { |
| 276 | + vec.push(elem); |
| 277 | + vec |
| 278 | + }) |
| 279 | + .map(|vec| { |
| 280 | + let mut list = LinkedList::new(); |
| 281 | + list.push_back(vec); |
| 282 | + list |
| 283 | + }) |
| 284 | + .reduce(LinkedList::new, |mut list1, mut list2| { |
| 285 | + list1.append(&mut list2); |
| 286 | + list1 |
| 287 | + }); |
| 288 | + |
| 289 | + self.reserve(str_len(&list)); |
| 290 | + for vec in list { |
| 291 | + self.extend(vec.iter().map(|cow| &**cow)); |
| 292 | + } |
| 293 | + } |
| 294 | +} |
| 295 | + |
265 | 296 |
|
266 | 297 | /// Extend a deque with items from a parallel iterator.
|
267 | 298 | impl<T> ParallelExtend<T> for VecDeque<T>
|
|
0 commit comments