No doc-test

This commit is contained in:
wborgeaud 2022-03-25 08:24:32 +01:00
parent 19cbbd4d12
commit 283c9350a7

View File

@ -21,13 +21,11 @@ pub(crate) struct SelectorsInfo {
/// `|G| + max_{g in G} g.degree() <= max_degree`. These groups are constructed greedily from
/// the list of gates sorted by degree.
/// We build a selector polynomial `S_i` for each group `G_i`, with
/// ```
/// S_i[j] =
/// if j-th row gate=g_k in G_i
/// k
/// else
/// UNUSED_SELECTOR
/// ```
pub(crate) fn selector_polynomials<F: RichField + Extendable<D>, const D: usize>(
gates: &[GateRef<F, D>],
instances: &[GateInstance<F, D>],