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
use super::{ConversionError, Reflection};
use crate::{data_tree::DataTree, size::Size};
use rayon::prelude::*;
use std::{ffi::OsStr, iter::once};
impl<Name, Data> Reflection<Name, Data>
where
Name: Send,
Data: Size + Send,
{
pub fn par_try_into_tree(self) -> Result<DataTree<Name, Data>, ConversionError<Name, Data>> {
let Reflection {
name,
data,
children,
} = self;
let children_sum = children.iter().map(|child| child.data).sum();
if data < children_sum {
return Err(ConversionError::ExcessiveChildren {
path: once(name).collect(),
data,
children,
children_sum,
});
}
let children: Result<Vec<_>, _> = children
.into_par_iter()
.map(Self::par_try_into_tree)
.collect();
let children = match children {
Ok(children) => children,
Err(ConversionError::ExcessiveChildren {
mut path,
data,
children,
children_sum,
}) => {
path.push_front(name);
return Err(ConversionError::ExcessiveChildren {
path,
data,
children,
children_sum,
});
}
};
Ok(DataTree {
name,
data,
children,
})
}
pub fn par_try_map<TargetName, TargetData, Error, Transform>(
self,
transform: Transform,
) -> Result<Reflection<TargetName, TargetData>, Error>
where
TargetName: Send,
TargetData: Size + Send + Sync,
Error: Send,
Transform: Fn(Name, Data) -> Result<(TargetName, TargetData), Error> + Copy + Sync,
{
let Reflection {
name,
data,
children,
} = self;
let children = children
.into_par_iter()
.map(|child| child.par_try_map(transform))
.collect::<Result<Vec<_>, _>>()?;
let (name, data) = transform(name, data)?;
Ok(Reflection {
name,
data,
children,
})
}
pub fn par_convert_names_to_utf8(self) -> Result<Reflection<String, Data>, Name>
where
Name: AsRef<OsStr>,
Data: Sync,
{
self.par_try_map(|name, data| {
name.as_ref()
.to_str()
.map(|name| (name.to_string(), data))
.ok_or(name)
})
}
}