| 67 | } |
| 68 | |
| 69 | void PolynomialMod2::SetBit(size_t n, int value) |
| 70 | { |
| 71 | if (value) |
| 72 | { |
| 73 | reg.CleanGrow(n/WORD_BITS + 1); |
| 74 | reg[n/WORD_BITS] |= (word(1) << (n%WORD_BITS)); |
| 75 | } |
| 76 | else |
| 77 | { |
| 78 | if (n/WORD_BITS < reg.size()) |
| 79 | reg[n/WORD_BITS] &= ~(word(1) << (n%WORD_BITS)); |
| 80 | } |
| 81 | } |
| 82 | |
| 83 | byte PolynomialMod2::GetByte(size_t n) const |
| 84 | { |
no test coverage detected