pub fn into_subexpr(mut self, child:Id) -> Self {
        assert!(self.nodes.len() > child.into());
        self.nodes.truncate(usize::from(child)+1);
        self
    }
/// Consumes an expr and returns a subexpr.
/// Importantly all Id indexing should be preserved just fine since this is implemented through truncating the underlying vector.
Consumes an expr and returns a subexpr.
Importantly all Id indexing should be preserved just fine since this is implemented through truncating the underlying vector.
Consumes an expr and returns a subexpr . Importantly all Id indexing should be preserved just fine since this is implemented through truncating the underlying vector .
pub fn into_subexpr(mut self, child:Id) -> Self {
        assert!(self.nodes.len() > child.into());
        self.nodes.truncate(usize::from(child)+1);
        self
    }
pub fn into_subexpr ( mut self , child : Id ) -> Self { assert ! ( self nodes len ( ) child into ( ) ) ; self . nodes . truncate ( usize :: from ( child ) + 1 ) ; self }
Consumes an expr and returns a subexpr.
Consumes an expr and returns a subexpr .
mut self
child
Id
mut self
child
Id