Lines Matching defs:mod
192 mod = (not test and ( (bits >> i) & 1) == 1)
193 self.modules[i // 3][i % 3 + self.moduleCount - 8 - 3] = mod;
196 mod = (not test and ( (bits >> i) & 1) == 1)
197 self.modules[i % 3 + self.moduleCount - 8 - 3][i // 3] = mod;
207 mod = (not test and ( (bits >> i) & 1) == 1)
210 self.modules[i][8] = mod
212 self.modules[i + 1][8] = mod
214 self.modules[self.moduleCount - 15 + i][8] = mod
219 mod = (not test and ( (bits >> i) & 1) == 1);
222 self.modules[8][self.moduleCount - i - 1] = mod
224 self.modules[8][15 - i - 1 + 1] = mod
226 self.modules[8][15 - i - 1] = mod
381 modPoly = rawPoly.mod(rsPoly)
697 def mod(self, e):
713 return QRPolynomial(num, 0).mod(e);