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
use crate::internal::*;
use tract_ndarray::prelude::*;
#[derive(Debug, Default, Clone, new, Hash)]
pub struct Range;
impl_dyn_hash!(Range);
impl Op for Range {
fn name(&self) -> Cow<str> {
"Range".into()
}
op_hir!();
not_a_typed_op!();
}
impl EvalOp for Range {
fn is_stateless(&self) -> bool {
true
}
fn eval(&self, mut inputs: TVec<Arc<Tensor>>) -> TractResult<TVec<Arc<Tensor>>> {
let (start, limit, delta) = args_3!(inputs);
let dt = start.datum_type();
let start = start.cast_to_scalar::<u64>()?;
let limit = limit.cast_to_scalar::<u64>()?;
let delta = delta.cast_to_scalar::<u64>()?;
let value = Array1::from_shape_fn(((limit - start) / delta) as usize, |ix| {
ix as u64 * delta + start
});
let value = value.into_tensor().cast_to_dt(dt)?.into_owned();
Ok(tvec!(value.into_arc_tensor()))
}
}
impl InferenceRulesOp for Range {
fn rules<'r, 'p: 'r, 's: 'r>(
&'s self,
s: &mut Solver<'r>,
inputs: &'p [TensorProxy],
outputs: &'p [TensorProxy],
) -> InferenceResult {
check_input_arity(&inputs, 3)?;
check_output_arity(&outputs, 1)?;
s.equals(&inputs[0].datum_type, &inputs[1].datum_type)?;
s.equals(&inputs[0].datum_type, &inputs[2].datum_type)?;
s.equals(&inputs[0].datum_type, &outputs[0].datum_type)?;
s.equals(&inputs[0].rank, 0)?;
s.equals(&inputs[1].rank, 0)?;
s.equals(&inputs[2].rank, 0)?;
s.equals(&outputs[0].rank, 1)?;
Ok(())
}
as_op!();
fn to_typed(
&self,
_source: &InferenceModel,
_node: &InferenceNode,
_target: &mut TypedModel,
_mapping: &HashMap<OutletId, OutletId>,
) -> TractResult<TVec<OutletId>> {
bail!("Range input are expected to be constant")
}
}