PRIMES (reference) in projects: third_party - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:PRIMES (Results 1 - 3 of 3) sorted by relevance

/third_party/icu/icu4c/source/common/
H A D	uhash.cpp	63 * PRIMES table, so that when the primeIndex is incremented or 73 * PRIMES[i+1] ~ 2PRIMES[i]. (Currently, the ratio ranges from 1.81 81 static const int32_t PRIMES[] = { variable 88 #define PRIMES_LENGTH UPRV_LENGTHOF(PRIMES) 91 / These ratios are tuned to the PRIMES array such that a resize 225 hash->length = PRIMES[primeIndex]; in _uhash_allocate() 557 /* Find the smallest index i for which PRIMES[i] >= size. */ in uhash_openSize() 559 while (i<(PRIMES_LENGTH-1) && PRIMES[i]<size) { in uhash_openSize() 584 // Find the smallest index i for which PRIMES[ in uhash_initSize() [all...]
/third_party/node/deps/icu-small/source/common/
H A D	uhash.cpp	63 * PRIMES table, so that when the primeIndex is incremented or 73 * PRIMES[i+1] ~ 2PRIMES[i]. (Currently, the ratio ranges from 1.81 81 static const int32_t PRIMES[] = { variable 88 #define PRIMES_LENGTH UPRV_LENGTHOF(PRIMES) 91 / These ratios are tuned to the PRIMES array such that a resize 225 hash->length = PRIMES[primeIndex]; in _uhash_allocate() 557 /* Find the smallest index i for which PRIMES[i] >= size. */ in uhash_openSize() 559 while (i<(PRIMES_LENGTH-1) && PRIMES[i]<size) { in uhash_openSize() 584 // Find the smallest index i for which PRIMES[ in uhash_initSize() [all...]
/third_party/skia/third_party/externals/icu/source/common/
H A D	uhash.cpp	63 * PRIMES table, so that when the primeIndex is incremented or 73 * PRIMES[i+1] ~ 2PRIMES[i]. (Currently, the ratio ranges from 1.81 81 static const int32_t PRIMES[] = { variable 88 #define PRIMES_LENGTH UPRV_LENGTHOF(PRIMES) 91 / These ratios are tuned to the PRIMES array such that a resize 225 hash->length = PRIMES[primeIndex]; in _uhash_allocate() 557 /* Find the smallest index i for which PRIMES[i] >= size. */ in uhash_openSize() 559 while (i<(PRIMES_LENGTH-1) && PRIMES[i]<size) { in uhash_openSize() 584 // Find the smallest index i for which PRIMES[ in uhash_initSize() [all...]

Completed in 4 milliseconds