HomeSort by relevance Sort by last modified time
    Searched refs:PRIMES (Results 1 - 2 of 2) sorted by null

  /frameworks/native/libs/utils/
BasicHashtable.cpp 285 // Table of 31-bit primes where each prime is no less than twice as large
286 // as the previous one. Generated by "primes.py".
287 static size_t PRIMES[] = {
327 while (count > PRIMES[i] && i < NELEM(PRIMES)) {
330 count = PRIMES[i];
  /external/icu4c/common/
uhash.c 60 * PRIMES table, so that when the primeIndex is incremented or
69 /* This is a list of non-consecutive primes chosen such that
70 * PRIMES[i+1] ~ 2*PRIMES[i]. (Currently, the ratio ranges from 1.81
78 static const int32_t PRIMES[] = {
85 #define PRIMES_LENGTH (sizeof(PRIMES) / sizeof(PRIMES[0]))
88 /* These ratios are tuned to the PRIMES array such that a resize
219 hash->length = PRIMES[primeIndex];
551 /* Find the smallest index i for which PRIMES[i] >= size. *
    [all...]

Completed in 488 milliseconds