pub fn inline_all_lcs(&mut self) {
        // Only inline when a matrix representing R1CS is needed.
        if !self.should_construct_matrices() {
            return;
        }

        // A dummy closure is used, which means that
        // - it does not modify the inlined LC.
        // - it does not add new witness variables.
        self.transform_lc_map(&mut |_, _, _| (0, None));
    }
/// Naively inlines symbolic linear combinations into the linear
/// combinations that use them.
///
/// Useful for standard pairing-based SNARKs where addition gates are cheap.
/// For example, in the SNARKs such as [\[Groth16\]](https://eprint.iacr.org/2016/260) and
/// [\[Groth-Maller17\]](https://eprint.iacr.org/2017/540), addition gates
/// do not contribute to the size of the multi-scalar multiplication, which
/// is the dominating cost.
Naively inlines symbolic linear combinations into the linear
combinations that use them.

Useful for standard pairing-based SNARKs where addition gates are cheap.
For example, in the SNARKs such as [\[Groth16\]] and
[\[Groth-Maller17\]], addition gates
do not contribute to the size of the multi-scalar multiplication, which
is the dominating cost.
Naively inlines symbolic linear combinations into the linear combinations that use them . Useful for standard pairing - based SNARKs where addition gates are cheap . For example in the SNARKs such as [ \ [ Groth16 \ ]] and [ \ [ Groth - Maller17 \ ]] addition gates do not contribute to the size of the multi - scalar multiplication which is the dominating cost .
pub fn inline_all_lcs(&mut self) {
        // Only inline when a matrix representing R1CS is needed.
        if !self.should_construct_matrices() {
            return;
        }
        // A dummy closure is used, which means that
        // - it does not modify the inlined LC.
        // - it does not add new witness variables.
        self.transform_lc_map(&mut |_, _, _| (0, None));
    }
pub fn inline_all_lcs ( & mut self ) { // Only inline when a matrix representing R1CS is needed. if ! self . should_construct_matrices ( ) { return ; } // A dummy closure is used, which means that // - it does not modify the inlined LC. // - it does not add new witness variables. self . transform_lc_map ( & mut | _ , _ , _ | ( 0 , None ) ) ; }
Naively inlines symbolic linear combinations into the linear
combinations that use them.
Naively inlines symbolic linear combinations into the linear combinations that use them .
&mut self
&mut self