Searched refs:nPrime (Results 1 – 4 of 4) sorted by relevance
137 sal_Int32 nPrime = 1009; in impl_findFreeHandle() local148 nNum = ( nNum * nFactor ) % nPrime; in impl_findFreeHandle()
136 sal_uLong nCount, nPrime; member in Hash357 nPrime = primes[ i ]; in Hash()358 pHashArr = new sal_uLong[ nPrime ]; in Hash()359 memset( pHashArr, 0, nPrime * sizeof( sal_uLong ) ); in Hash()378 sal_uLong* pFound = &pHashArr[ nH % nPrime ]; in CalcHashValue()
321 const sal_Int32 nPrime = 1009; in findFreeHandle() local327 nCheck = ( nCheck * nSeed ) % nPrime; in findFreeHandle()
1262 const sal_uInt32 nPrime = 65521; // a prime number local1263 const sal_uInt32 nPrimeLess2 = nPrime - 2;1269 for (; 1 != nFieldElement; nFieldElement = (nFieldElement * nEngendering) % nPrime)
Completed in 49 milliseconds