Lines Matching refs:primeTable
30 std::vector<word16> &primeTable = *pPrimeTable;
31 primeTable.reserve(maxPrimeTableSize);
33 primeTable.push_back(2);
40 if (p%primeTable[j] == 0)
44 primeTable.push_back(p);
45 testEntriesEnd = UnsignedMin(54U, primeTable.size());
55 const std::vector<word16> &primeTable = Singleton<std::vector<word16>, NewPrimeTable>().Ref();
56 size = (unsigned int)primeTable.size();
57 return &primeTable[0];
63 const word16 * primeTable = GetPrimeTable(primeTableSize);
65 if (p.IsPositive() && p <= primeTable[primeTableSize-1])
66 return std::binary_search(primeTable, primeTable+primeTableSize, (word16)p.ConvertToLong());
74 const word16 * primeTable = GetPrimeTable(primeTableSize);
76 assert(primeTable[primeTableSize-1] >= bound);
79 for (i = 0; primeTable[i]<bound; i++)
80 if ((p % primeTable[i]) == 0)
83 if (bound == primeTable[i])
92 const word16 * primeTable = GetPrimeTable(primeTableSize);
93 return !TrialDivision(p, primeTable[primeTableSize-1]);
349 const word16 * primeTable = GetPrimeTable(primeTableSize);
360 SieveSingle(m_sieve, primeTable[i], m_first, m_step, (word16)m_step.InverseMod(primeTable[i]));
369 word16 p = primeTable[i];
397 const word16 * primeTable = GetPrimeTable(primeTableSize);
399 if (p <= primeTable[primeTableSize-1])
405 pItr = std::upper_bound(primeTable, primeTable+primeTableSize, (word)p.ConvertToLong());
407 pItr = primeTable;
409 while (pItr < primeTable+primeTableSize && !(*pItr%mod == equiv && (!pSelector || pSelector->IsAcceptable(*pItr))))
412 if (pItr < primeTable+primeTableSize)
418 p = primeTable[primeTableSize-1]+1;
421 assert(p > primeTable[primeTableSize-1]);
458 const word16 * primeTable = GetPrimeTable(primeTableSize);
463 Integer b = a_exp_b_mod_c(primeTable[i], r, p);
516 const word16 * primeTable = GetPrimeTable(primeTableSize);
536 unsigned int trialDivisorBound = (unsigned int)STDMIN((unsigned long)primeTable[primeTableSize-1], (unsigned long)bits*bits/c_opt);