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

  /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
KeyFactory.java 71 private final static int PRIMES[] = {
204 int hc = (constant != 0) ? constant : PRIMES[(int)(Math.abs(seed) % PRIMES.length)];
205 int hm = (multiplier != 0) ? multiplier : PRIMES[(int)(Math.abs(seed * 13) % PRIMES.length)];
  /external/chromium_org/third_party/icu/source/common/
uhash.c 61 * PRIMES table, so that when the primeIndex is incremented or
70 /* This is a list of non-consecutive primes chosen such that
71 * PRIMES[i+1] ~ 2*PRIMES[i]. (Currently, the ratio ranges from 1.81
79 static const int32_t PRIMES[] = {
86 #define PRIMES_LENGTH (sizeof(PRIMES) / sizeof(PRIMES[0]))
89 /* These ratios are tuned to the PRIMES array such that a resize
220 hash->length = PRIMES[primeIndex];
552 /* Find the smallest index i for which PRIMES[i] >= size. *
    [all...]
  /external/icu/icu4c/source/common/
uhash.c 61 * PRIMES table, so that when the primeIndex is incremented or
70 /* This is a list of non-consecutive primes chosen such that
71 * PRIMES[i+1] ~ 2*PRIMES[i]. (Currently, the ratio ranges from 1.81
79 static const int32_t PRIMES[] = {
86 #define PRIMES_LENGTH (sizeof(PRIMES) / sizeof(PRIMES[0]))
89 /* These ratios are tuned to the PRIMES array such that a resize
220 hash->length = PRIMES[primeIndex];
552 /* Find the smallest index i for which PRIMES[i] >= size. *
    [all...]
  /external/owasp/sanitizer/lib/htmlparser-1.3/
htmlparser-1.3-with-transitions.jar 
htmlparser-1.3.jar 
  /external/dexmaker/lib/
mockito-core-1.9.1-SNAPSHOT.jar 

Completed in 255 milliseconds