fn only_one_index<C, P>(nodes: &[(usize, C, Handle<Sampler<P>>)]) -> bool
where
    P: InterpolationPrimitive,
{
    if nodes.is_empty() {
        true
    } else {
        let first = nodes[0].0;
        nodes.iter().all(|&(ref i, _, _)| *i == first)
    }
}
/// Check if the given animation list is for a single node. If so, we don't need an
/// `AnimationHierarchy`.
Check if the given animation list is for a single node. If so, we don't need an
`AnimationHierarchy`.
Check if the given animation list is for a single node . If so we don ' t need an ` AnimationHierarchy ` .
fn only_one_index<C, P>(nodes: &[(usize, C, Handle<Sampler<P>>)]) -> bool
where
    P: InterpolationPrimitive,
{
    if nodes.is_empty() {
        true
    } else {
        let first = nodes[0].0;
        nodes.iter().all(|&(ref i, _, _)| *i == first)
    }
}
fn only_one_index < C , P > ( nodes : & [ ( usize , C , Handle < Sampler < P > > ) ] ) -> bool where P : InterpolationPrimitive , { if nodes . is_empty ( ) { true } else { let first = nodes [ 0 ] . 0 ; nodes . iter ( ) . all ( | & ( ref i , _ , _ ) | * i == first ) } }
Check if the given animation list is for a single node.
Check if the given animation list is for a single node .
nodes
&[(usize, C, Handle<Sampler<P>>)]
nodes
&[(usize, C, Handle<Sampler<P>>)]