| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| toy.ml | 20 (* Prime the first token. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| toy.ml | 21 (* Prime the first token. *)
|
| /external/openssh/ |
| dh.h | 51 * Specifies the internal structure of the prime modulus.
|
| /external/openssl/ |
| Apps.mk | 37 apps/prime.c \
|
| /external/openssl/patches/ |
| progs.patch | 19 {FUNC_TYPE_GENERAL,"prime",prime_main},
|
| /external/v8/test/mjsunit/regress/ |
| regress-create-exception.js | 43 // garbage collector. 93 is chosen to be a prime number to avoid the
|
| /external/valgrind/main/drd/tests/ |
| omp_prime.c | 102 printf("Number of prime numbers between 2 and %d: %d\n",
|
| /libcore/luni/src/main/java/java/math/ |
| BigInteger.java | 31 * cryptography, such as the generation of large prime numbers and computation
149 * pow(2, bitLength)-1]} which is probably prime. The probability that the
150 * returned {@code BigInteger} is prime is beyond
[all...] |
| /libcore/luni/src/main/java/libcore/icu/ |
| CollationKeyICU.java | 88 * hash value by a prime number and add the new byte in, like a linear
|
| /packages/apps/Calendar/src/com/android/calendar/ |
| TimezoneAdapter.java | 131 final int prime = 31; local
133 result = prime * result + ((mDisplayName == null) ? 0 : mDisplayName.hashCode());
134 result = prime * result + ((mId == null) ? 0 : mId.hashCode());
135 result = prime * result + mOffset;
|
| /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/internal/repository/packages/ |
| AddonPackage.java | 83 final int prime = 31; local
85 result = prime * result + ((mDescription == null) ? 0 : mDescription.hashCode());
86 result = prime * result + ((mName == null) ? 0 : mName.hashCode());
626 final int prime = 31; local
628 result = prime * result + ((mLayoutlibVersion == null) ? 0 : mLayoutlibVersion.hashCode());
629 result = prime * result + Arrays.hashCode(mLibs);
630 result = prime * result + ((mDisplayName == null) ? 0 : mDisplayName.hashCode());
631 result = prime * result + ((mVendorDisplay == null) ? 0 : mVendorDisplay.hashCode());
632 result = prime * result + ((mVersion == null) ? 0 : mVersion.hashCode());
|
| PlatformPackage.java | 309 final int prime = 31; local
311 result = prime * result +
313 result = prime * result + ((mVersion == null) ? 0 : mVersion.hashCode());
314 result = prime * result + ((mVersionName == null) ? 0 : mVersionName.hashCode());
|
| FullRevisionPackage.java | 109 final int prime = 31; local
111 result = prime * result + ((mPreviewVersion == null) ? 0 : mPreviewVersion.hashCode());
|
| /external/icu4c/common/ |
| uhash.c | 28 * prime. The easiest way to achieve this is to have the length of
29 * the array be prime, and the increment be any value from
75 * These prime numbers were also chosen so that they are the largest
76 * prime number while being less than a power of two.
199 * prime index. If the index is out of range it is pinned into range.
325 * The size of the table should be prime for this algorithm to work;
327 * hash) is relatively prime to the table length.
359 /* The jump value must be relatively prime to the table
360 * length. As long as the length is prime, then any value
361 * 1..length-1 will be relatively prime to it
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| HTMLEntities.properties | 192 prime=8242
193 Prime=8243
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_import.c | 21 Import an RSAPublicKey or RSAPrivateKey [two-prime only, only support >= 1024-bit keys, defined in PKCS #1 v2.1]
119 /* we don't support multi-prime RSA */
|
| rsa_make_key.c | 56 /* make prime "p" */
63 /* make prime "q" */
|
| /external/dropbear/libtommath/ |
| poster.tex | 25 $\vert \vert a \vert \vert$ & {\tt mp\_unsigned\_bin\_size(\&a)} & $res$ = 1 if $a$ prime to $t$ rounds? & {\tt mp\_prime\_is\_prime(\&a, t, \&res)} \\
26 $buf \leftarrow a$ & {\tt mp\_to\_unsigned\_bin(\&a, buf)} & Next prime after $a$ to $t$ rounds. & {\tt mp\_prime\_next\_prime(\&a, t, bbs\_style)} \\
|
| /external/icu4c/test/perf/unisetperf/draft/ |
| bitset.cpp | 35 const int32_t prime=1301; // Less than 2k. member in struct:BMPBitHash
64 hash=(hash+prime)&0x7ff;
|
| /external/openssl/crypto/rsa/ |
| rsa_chk.c | 77 /* p prime? */
87 /* q prime? */
|
| /hardware/samsung_slsi/exynos5/libkeymaster/ |
| tlTeeKeymaster_Api.h | 174 uint32_t lenp; /**< Prime p length */
175 uint32_t lenq; /**< Prime q length */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
| key_prot.x | 61 * MODULUS should be chosen as a prime of the form: MODULUS == 2*p + 1,
62 * where p is also prime.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| key_prot.x | 61 * MODULUS should be chosen as a prime of the form: MODULUS == 2*p + 1,
62 * where p is also prime.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| key_prot.x | 61 * MODULUS should be chosen as a prime of the form: MODULUS == 2*p + 1,
62 * where p is also prime.
|
| /sdk/sdkmanager/libs/sdklib/tests/src/com/android/sdklib/internal/repository/packages/ |
| MockEmptyPackage.java | 152 final int prime = 31;
154 result = prime * result + ((mTestHandle == null) ? 0 : mTestHandle.hashCode());
|
