| /packages/inputmethods/LatinIME/native/jni/src/ |
| defines.h | 385 // Must be smaller than BIGRAM_FILTER_BYTE_SIZE * 8, and preferably prime. 1021 is the largest
386 // prime under 128 * 8.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 400 // 4 factor is coming from the fact that prime number list is almost a
411 * of buckets in the prime numbers would respect the load rule. Otherwise algorithm
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 400 // 4 factor is coming from the fact that prime number list is almost a
411 * of buckets in the prime numbers would respect the load rule. Otherwise algorithm
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 400 // 4 factor is coming from the fact that prime number list is almost a
411 * of buckets in the prime numbers would respect the load rule. Otherwise algorithm
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| riemann_zeta.tcc | 231 * using the product over prime factors.
235 * where @f$ {p_i} @f$ are the prime numbers.
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 400 // 4 factor is coming from the fact that prime number list is almost a
411 * of buckets in the prime numbers would respect the load rule. Otherwise algorithm
|
| /tools/motodev/src/plugins/certmanager/src/com/motorolamobility/studio/android/certmanager/ui/model/ |
| KeyStoreNode.java | 320 final int prime = 31;
local
322 result = (prime * result) + ((keyStoreFile == null) ? 0 : keyStoreFile.hashCode());
|
| /bionic/libc/netbsd/resolv/ |
| res_random.c | 42 * n = prime, g0 = generator to n,
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| KeyTable.java | 186 // initial capacity set to a prime number to improve hash performance
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/digests/ |
| LongDigest.java | 330 * cube roots of the first sixty-four prime numbers)
|
| /external/chromium/chrome/browser/sync/syncable/ |
| directory_backing_store.h | 34 // load all the persisted data to prime a syncable::Directory on startup by
|
| /external/chromium/sdch/open-vcdiff/src/ |
| adler32.c | 11 #define BASE 65521UL /* largest prime smaller than 65536 */
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| asynctcpsocket.cc | 232 // Prime a read event in case data is waiting.
|
| /external/dropbear/libtomcrypt/testprof/ |
| ecc_test.c | 58 DO(mp_read_radix(modulus, ltc_ecc_sets[z].prime, 16));
|
| /external/mesa3d/src/glsl/ |
| link_functions.cpp | 126 * The clone of the parameter list is used to prime the hashtable used
|
| /external/openssl/apps/ |
| gendh.c | 200 BIO_printf(bio_err,"Generating DH parameters, %d bit long safe prime, generator %d\n",num,g);
|
| progs.h | 149 {FUNC_TYPE_GENERAL,"prime",prime_main},
|
| /external/openssl/crypto/dh/ |
| dh.h | 171 /* primes p where (p-1)/2 is prime too are called "safe"; we define
|
| /external/openssl/include/openssl/ |
| dh.h | 171 /* primes p where (p-1)/2 is prime too are called "safe"; we define
|
