pub fn inline_all_lcs(&self) {
        if let Some(cs) = self.inner() {
            cs.borrow_mut().inline_all_lcs()
        }
    }
/// 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(&self) {
        if let Some(cs) = self.inner() {
            cs.borrow_mut().inline_all_lcs()
        }
    }
pub fn inline_all_lcs ( & self ) { if let Some ( cs ) = self . inner ( ) { cs . borrow_mut ( ) . inline_all_lcs ( ) } }
Naively inlines symbolic linear combinations into the linear
combinations that use them.
Naively inlines symbolic linear combinations into the linear combinations that use them .
&self
&self