Fabcoin Core  0.16.2
P2P Digital Currency
PolynomialMod2 Member List

This is the complete list of members for PolynomialMod2, including all inherited members.

AllOnes(size_t n)PolynomialMod2static
And(const PolynomialMod2 &b) const PolynomialMod2
BERDecodeAsOctetString(BufferedTransformation &bt, size_t length)PolynomialMod2
BitCount() const PolynomialMod2
ByteCount() const PolynomialMod2
CoefficientCount() const PolynomialMod2inline
Decode(const byte *input, size_t inputLen)PolynomialMod2
Decode(BufferedTransformation &bt, size_t inputLen)PolynomialMod2
Degree() const PolynomialMod2inline
DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const PolynomialMod2
Divide(PolynomialMod2 &r, PolynomialMod2 &q, const PolynomialMod2 &a, const PolynomialMod2 &d)PolynomialMod2static
DividedBy(const PolynomialMod2 &b) const PolynomialMod2
Doubled() const PolynomialMod2inline
Encode(byte *output, size_t outputLen) const PolynomialMod2
Encode(BufferedTransformation &bt, size_t outputLen) const PolynomialMod2
Equals(const PolynomialMod2 &rhs) const PolynomialMod2
Gcd(const PolynomialMod2 &a, const PolynomialMod2 &n)PolynomialMod2static
GetBit(size_t n) const PolynomialMod2inline
GetByte(size_t n) const PolynomialMod2
GetCoefficient(size_t i) const PolynomialMod2inline
GF2NT classPolynomialMod2friend
InverseMod(const PolynomialMod2 &) const PolynomialMod2
IsIrreducible() const PolynomialMod2
IsUnit() const PolynomialMod2inline
IsZero() const PolynomialMod2inline
MinEncodedSize() const PolynomialMod2inline
Minus(const PolynomialMod2 &b) const PolynomialMod2inline
Modulo(const PolynomialMod2 &b) const PolynomialMod2
Monomial(size_t i)PolynomialMod2static
MultiplicativeInverse() const PolynomialMod2inline
One()PolynomialMod2static
operator!() const PolynomialMod2
operator%=(const PolynomialMod2 &t)PolynomialMod2
operator&=(const PolynomialMod2 &t)PolynomialMod2
operator*=(const PolynomialMod2 &t)PolynomialMod2
operator+() const PolynomialMod2inline
operator+=(const PolynomialMod2 &t)PolynomialMod2inline
operator-() const PolynomialMod2inline
operator-=(const PolynomialMod2 &t)PolynomialMod2inline
operator/=(const PolynomialMod2 &t)PolynomialMod2
operator<<(unsigned int n) const PolynomialMod2
operator<<(std::ostream &out, const PolynomialMod2 &a)PolynomialMod2friend
operator<<=(unsigned int)PolynomialMod2
operator=(const PolynomialMod2 &t)PolynomialMod2
operator>>(unsigned int n) const PolynomialMod2
operator>>=(unsigned int)PolynomialMod2
operator[](unsigned int i) const PolynomialMod2inline
operator^=(const PolynomialMod2 &t)PolynomialMod2
Parity() const PolynomialMod2
Pentanomial(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4)PolynomialMod2static
Plus(const PolynomialMod2 &b) const PolynomialMod2inline
PolynomialMod2()PolynomialMod2
PolynomialMod2(const PolynomialMod2 &t)PolynomialMod2
PolynomialMod2(word value, size_t bitLength=WORD_BITS)PolynomialMod2
PolynomialMod2(const byte *encodedPoly, size_t byteCount)PolynomialMod2inline
PolynomialMod2(BufferedTransformation &encodedPoly, size_t byteCount)PolynomialMod2inline
PolynomialMod2(RandomNumberGenerator &rng, size_t bitcount)PolynomialMod2inline
RandomizationParameter typedefPolynomialMod2
Randomize(RandomNumberGenerator &rng, size_t bitcount)PolynomialMod2
regPolynomialMod2private
SetBit(size_t i, int value=1)PolynomialMod2
SetByte(size_t n, byte value)PolynomialMod2
SetCoefficient(size_t i, int value)PolynomialMod2inline
Squared() const PolynomialMod2
swap(PolynomialMod2 &a)PolynomialMod2inline
Times(const PolynomialMod2 &b) const PolynomialMod2
Trinomial(size_t t0, size_t t1, size_t t2)PolynomialMod2static
WordCount() const PolynomialMod2
Xor(const PolynomialMod2 &b) const PolynomialMod2
Zero()PolynomialMod2static