/cts/tools/signature-tools/src/signature/model/impl/ |
SigParameterizedType.java | 66 final int prime = 31; local 68 result = prime * type.getRawType().hashCode(); 69 result = prime * result + type.getTypeArguments().hashCode();
|
SigWildcardType.java | 51 final int prime = 31; local 53 result = prime 56 result = prime * result + type.getUpperBounds().hashCode();
|
/external/chromium/testing/gtest/samples/ |
sample1.cc | 46 // Returns true iff n is a prime number. 62 // If n is divisible by i, n is not prime. 66 // n has no integer factor in the range (1, n), and thus is prime.
|
/external/gtest/samples/ |
sample1.cc | 46 // Returns true iff n is a prime number. 62 // If n is divisible by i, n is not prime. 66 // n has no integer factor in the range (1, n), and thus is prime.
|
/external/protobuf/gtest/samples/ |
sample1.cc | 46 // Returns true iff n is a prime number. 62 // If n is divisible by i, n is not prime. 66 // n has no integer factor in the range (1, n), and thus is prime.
|
/packages/apps/Contacts/src/com/android/contacts/calllog/ |
ContactInfo.java | 47 final int prime = 31; local 49 result = prime * result + ((lookupUri == null) ? 0 : lookupUri.hashCode()); 50 result = prime * result + ((name == null) ? 0 : name.hashCode());
|
/sdk/ddms/libs/ddmlib/src/com/android/ddmlib/testrunner/ |
TestIdentifier.java | 58 final int prime = 31; local 60 result = prime * result + ((mClassName == null) ? 0 : mClassName.hashCode()); 61 result = prime * result + ((mTestName == null) ? 0 : mTestName.hashCode());
|
/sdk/layoutlib_api/src/com/android/ide/common/rendering/api/ |
ResourceReference.java | 67 final int prime = 31; local 69 result = prime * result + (mIsFramework ? 1231 : 1237); 70 result = prime * result + ((mName == null) ? 0 : mName.hashCode());
|
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/spec/ |
RSAOtherPrimeInfoTest.java | 58 * Assertion: NullPointerException if prime is null 100 * Assertion: NullPointerException if prime and crtCoefficient is null 126 * Assertion: returns prime value 138 * Assertion: returns prime exponent value
|
/external/dropbear/libtomcrypt/notes/ |
tech0006.txt | 28 p INTEGER , -- prime modulus 29 q INTEGER , -- order of sub-group (must be prime) 39 p INTEGER , -- prime modulus 40 q INTEGER , -- order of sub-group (must be prime)
|
/external/libvorbis/lib/ |
lpc.h | 26 extern void vorbis_lpc_predict(float *coeff,float *prime,int m,
|
/external/openssl/apps/ |
dh4096.pem | 18 Note that g is not a generator, but this is not a problem since p is a safe prime.
|
/external/openssl/crypto/dh/ |
example | 27 Hi. I've generated a 2047-bit "strong" prime number that I would like to 29 'p' prime, but so is (p-1)/2. 33 However, to increase my confidence that this number really is a strong prime, 44 The generator, g, for this prime is 2.
|
/external/webkit/LayoutTests/fast/dom/Attr/ |
child-nodes-cache.html | 24 nodes[0]; // Prime the child node cache.
|
/external/webkit/LayoutTests/fast/dom/Geolocation/script-tests/ |
permission-denied-already-success.js | 3 // Prime the Geolocation instance by denying permission.
|
/external/wpa_supplicant_6/wpa_supplicant/src/crypto/ |
dh_groups.h | 22 const u8 *prime; member in struct:dh_group
|
/external/wpa_supplicant_8/src/tls/ |
tlsv1_cred.h | 18 u8 *dh_p; /* prime */
|
/libcore/luni/src/test/java/tests/security/spec/ |
RSAOtherPrimeInfoTest.java | 51 * Assertion: NullPointerException if prime is null 93 * Assertion: NullPointerException if prime and crtCoefficient is null 119 * Assertion: returns prime value 131 * Assertion: returns prime exponent value
|
/packages/apps/Calendar/src/com/android/calendar/widget/ |
CalendarAppWidgetModel.java | 123 final int prime = 31; local 125 result = prime * result + (allDay ? 1231 : 1237); 126 result = prime * result + (int) (id ^ (id >>> 32)); 127 result = prime * result + (int) (end ^ (end >>> 32)); 128 result = prime * result + (int) (start ^ (start >>> 32)); 129 result = prime * result + ((title == null) ? 0 : title.hashCode()); 130 result = prime * result + visibTitle; 131 result = prime * result + visibWhen; 132 result = prime * result + visibWhere; 133 result = prime * result + ((when == null) ? 0 : when.hashCode()) 215 final int prime = 31; local [all...] |
/external/dropbear/libtomcrypt/src/math/ |
rand_prime.c | 15 Generate a random prime, Tom St Denis 35 /* allow sizes between 2 and 512 bytes for a prime size */
|
/external/dropbear/libtommath/ |
bn_mp_prime_is_prime.c | 23 * Sets result to 1 if probably prime, 0 otherwise 62 /* set the prime */
|
/external/dropbear/libtommath/etc/ |
drprime.c | 18 printf("Seeking a %d-bit safe prime\n", sizes[x] * DIGIT_BIT); 50 fprintf(out, "%d-bit prime:\np == %s\n\n", mp_count_bits(&a), buf); fflush(out);
|
/libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
DHParameters.java | 24 // Well-known 512 bit prime 41 // Well-Known Group 1: A 768 bit prime rfc 2539 64 // Well-Known Group 2: A 1024 bit prime rfc 2539 94 private static byte[] prime; field in class:DHParameters 97 //TODO set prime depand on some system or security property 98 prime = prime512; 102 * Returns prime bytes 106 return prime;
|
/ndk/sources/host-tools/sed-4.2.1/testsuite/ |
factor.sed | 44 # The quotient of dividing by 11 is a limit to the remaining prime factors 60 # We have a prime factor in CANDIDATE! Print it
|
/packages/inputmethods/LatinIME/java/res/xml/ |
keys_pcqwerty_symbols3.xml | 40 U+2032: "?" PRIME 41 U+2033: "?" DOUBLE PRIME -->
|