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
use crate::ops::prelude::*;
#[derive(Debug, Clone, new)]
pub struct PermuteAxes {
pub axes: Option<Vec<usize>>,
}
impl PermuteAxes {
fn compute_shape<D: DimLike>(&self, input: &[D]) -> TVec<D> {
if let Some(ref axes) = self.axes {
let mut new_shape = tvec![D::zero(); input.len()];
for (ix, &d) in axes.iter().enumerate() {
new_shape[ix] = input[d];
}
new_shape
} else {
let mut new_shape: TVec<D> = input.iter().cloned().collect();
new_shape.reverse();
new_shape
}
}
fn eval_t<T: Datum>(&self, input: SharedTensor) -> TractResult<TVec<SharedTensor>> {
if let Some(ref axes) = self.axes {
Ok(tvec![input.to_array::<T>()?.permuted_axes(&**axes).into()])
} else {
Ok(tvec![input.to_array::<T>()?.reversed_axes().into()])
}
}
}
impl Op for PermuteAxes {
fn name(&self) -> Cow<str> {
"PermuteAxes".into()
}
}
impl StatelessOp for PermuteAxes {
fn eval(&self, mut inputs: TVec<SharedTensor>) -> TractResult<TVec<SharedTensor>> {
let input = args_1!(inputs);
dispatch_datum!(Self::eval_t(input.datum_type())(self, input))
}
}
impl InferenceRulesOp for PermuteAxes {
fn rules<'r, 'p: 'r, 's: 'r>(
&'s self,
s: &mut Solver<'r>,
inputs: &'p SharedTensorsProxy,
outputs: &'p SharedTensorsProxy,
) -> InferenceResult {
s.equals(&outputs.len, 1)?;
s.equals(&outputs[0].datum_type, &inputs[0].datum_type)?;
s.equals(&outputs[0].rank, &inputs[0].rank)?;
s.given(&inputs[0].shape, move |s, shape| {
let output_shape = self.compute_shape(&shape);
s.equals(&outputs[0].shape, output_shape)
})
}
}