HomeSort by relevance Sort by last modified time
    Searched full:prime (Results 301 - 325 of 687) sorted by null

<<11121314151617181920>>

  /frameworks/base/core/java/android/widget/
ActivityChooserModel.java 817 final int prime = 31; local
819 result = prime * result + ((activity == null) ? 0 : activity.hashCode());
820 result = prime * result + (int) (time ^ (time >>> 32));
821 result = prime * result + Float.floatToIntBits(weight);
    [all...]
  /frameworks/native/libs/utils/
BasicHashtable.cpp 285 // Table of 31-bit primes where each prime is no less than twice as large
  /packages/apps/Contacts/src/com/android/contacts/
ContactPhotoManager.java 1191 final int prime = 31; local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/libexec/gcc/i686-linux/4.6.x-google/
liblto_plugin.so 
liblto_plugin.so.0 
liblto_plugin.so.0.0.0 
  /external/zlib/src/doc/
rfc1950.txt 496 checksum. That 65521 is prime is important to avoid a possible
498 (The Fletcher checksum uses 255, which is not prime and which also
536 #define BASE 65521 /* largest prime smaller than 65536 */
  /packages/apps/Calendar/src/com/android/calendar/widget/
CalendarAppWidgetService.java 350 long prime = 31;
352 result = prime * result + (int) (eventInfo.id ^ (eventInfo.id >>> 32));
353 result = prime * result + (int) (eventInfo.start ^ (eventInfo.start >>> 32));
  /system/core/sh/
init.c 260 #define CMDTABLESIZE 31 /* should be prime */
552 #define CMDTABLESIZE 31 /* should be prime */
840 #define CMDTABLESIZE 31 /* should be prime */
  /frameworks/base/core/java/android/nfc/
NdefRecord.java 974 final int prime = 31; local
    [all...]
  /external/dropbear/libtommath/pre_gen/
mpi.c     [all...]
  /external/bison/lib/
hash.c 433 /* Return true if CANDIDATE is a prime number. CANDIDATE should be an odd
452 /* Round a given CANDIDATE number up to the nearest prime, and return that
453 prime. Primes lower than 10 are merely skipped. */
  /external/chromium/chrome/browser/visitedlink/
visitedlink_master.cc 47 // table in NewTableSizeForCount (prime number).
795 // These table sizes are selected to be the maximum prime number less than
815 // Find the closest prime.
    [all...]
  /external/qemu/distrib/libpng-1.2.19/
pngvcrd.c     [all...]
  /external/chromium/chrome/browser/history/
history_database.cc 108 // Prime the cache.
  /external/chromium/testing/gtest/samples/
sample6_unittest.cc 61 // The ctor calls the factory function to create a prime table
  /external/elfutils/lib/
dynamicsizehash.c 203 /* We need the size to be a prime. */
  /external/emma/core/java12/com/vladium/util/
IntIntMap.java 286 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
IntObjectMap.java 244 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
IntSet.java 216 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
ObjectIntMap.java 282 // TODO: it is possible to run this method twice, first time using the 2*k+1 prime sequencer for newBucketCount
  /external/gtest/samples/
sample6_unittest.cc 61 // The ctor calls the factory function to create a prime table
  /external/guava/guava/src/com/google/common/hash/
Hashing.java 61 hashFunctions[i] = murmur3_128(i * 1500450271 /* a prime; shouldn't matter */);
  /external/guava/guava-tests/test/com/google/common/math/
MathTesting.java 113 // Add values up to 64. This covers cases like "square of a prime" and such.
  /external/icu4c/i18n/
sortkey.cpp 370 // previous hash value by a prime number and add the new character in,

Completed in 1037 milliseconds

<<11121314151617181920>>