fn mark_as_candidate<N>(&mut self, n: N) -> N
    where
        N: for<'aa> FoldWith<Analyzer<'aa>>,
    {
        tracing::debug!("mark_as_candidate");

        // Analyzer never change `in_data_fn` to false, so all identifiers in `n` will
        // be marked as referenced from a data function.
        let mut v = Analyzer {
            state: &mut self.state,
            in_lhs_of_var: false,
            in_data_fn: true,
        };

        let n = n.fold_with(&mut v);
        self.state.should_run_again = true;
        n
    }
/// Mark identifiers in `n` as a candidate for removal.
Mark identifiers in `n` as a candidate for removal.
Mark identifiers in ` n ` as a candidate for removal .
fn mark_as_candidate<N>(&mut self, n: N) -> N
    where
        N: for<'aa> FoldWith<Analyzer<'aa>>,
    {
        tracing::debug!("mark_as_candidate");
        // Analyzer never change `in_data_fn` to false, so all identifiers in `n` will
        // be marked as referenced from a data function.
        let mut v = Analyzer {
            state: &mut self.state,
            in_lhs_of_var: false,
            in_data_fn: true,
        };
        let n = n.fold_with(&mut v);
        self.state.should_run_again = true;
        n
    }
fn mark_as_candidate < N > ( & mut self , n : N ) -> N where N : for < ' aa > FoldWith < Analyzer < ' aa > > , { tracing :: debug ! ( " " ) ; // Analyzer never change `in_data_fn` to false, so all identifiers in `n` will // be marked as referenced from a data function. let mut v = Analyzer { state : & mut self . state , in_lhs_of_var : false , in_data_fn : true , } ; let n = n . fold_with ( & mut v ) ; self . state . should_run_again = true ; n }
Mark identifiers in `n` as a candidate for removal.
Mark identifiers in ` n ` as a candidate for removal .
&mut self
n
N
&mut self
n
N