len(x.limbs) xLimbs := x.limbs[:size] if len(xLimbs) == 0 { return no } one := ctEq(xLimbs[0], 1) for i := 1; i < size; i++ { one &= ctEq(xLimbs[i], 0) } return one } // IsMinusOne returns 1 if x == -1 mod m, and 0 otherwise. // // The length of x must be the same as the modulus. x must already be reduced // modulo m. // //go:norace func (x *Nat) IsMinusOne(m *Modulus) choice { minusOne := m.Nat() minusOne.SubOne(m) return x.Equal(minusOne) } // IsOdd returns 1 if x is odd, and 0 otherwise. func (x *Nat) IsOdd()...

    vocabulary file.
*   Added `index_to_string_table` which returns a lookup table that maps indices
    to strings.
*   Add `string_to_index_table`, which returns a lookup table that matches
    strings to indices.
*   Add a `ParallelForWithWorkerId` function.
*   Add `string_to_index_table`, which returns a lookup table that matches
    strings to indices.