HomeSort by relevance Sort by last modified time
    Searched refs:hashcode (Results 1 - 25 of 50) sorted by null

1 2

  /external/apache-http/src/org/apache/http/util/
LangUtils.java 36 * {@link Object#equals equals} and {@link Object#hashCode hashCode} methods.
51 public static int hashCode(final int seed, final int hashcode) {
52 return seed * HASH_OFFSET + hashcode;
55 public static int hashCode(final int seed, final boolean b) {
56 return hashCode(seed, b ? 1 : 0);
59 public static int hashCode(final int seed, final Object obj) {
60 return hashCode(seed, obj != null ? obj.hashCode() : 0)
    [all...]
  /frameworks/base/tools/aapt/
ResourceIdCache.cpp 65 const uint32_t hashcode = hash(hashedName); local
66 map<uint32_t, CacheEntry>::iterator item = mIdMap.find(hashcode);
81 mIdMap.erase(hashcode);
93 const uint32_t hashcode = hash(hashedName); local
94 mIdMap[hashcode] = CacheEntry(hashedName, resId);
  /external/chromium_org/third_party/icu/source/common/
uhash.c 22 * (when two unequal keys have the same hashcode) we resolve this by
25 * hashcode. This increment is added to the initial hash value to
35 * then when we computed hashcode % length, we could get a negative
39 * empty or deleted slots with a negative hashcode.
42 * slot matching the given key and hashcode. If one is found, it
102 Invariants for hashcode values:
110 hashcodes; adjust these constants for other hashcode sizes.
141 int32_t hashcode,
172 e->hashcode = hashcode;
471 int32_t hashcode; local
    [all...]
uhash.h 55 * hashcode. During iteration an element may be deleted by calling
99 int32_t hashcode; member in struct:UHashElement
582 /* Used by UnicodeString to compute its hashcode - Not public API. */
  /external/icu4c/common/
uhash.c 23 * (when two unequal keys have the same hashcode) we resolve this by
26 * hashcode. This increment is added to the initial hash value to
36 * then when we computed hashcode % length, we could get a negative
40 * empty or deleted slots with a negative hashcode.
43 * slot matching the given key and hashcode. If one is found, it
103 Invariants for hashcode values:
111 hashcodes; adjust these constants for other hashcode sizes.
142 int32_t hashcode,
173 e->hashcode = hashcode;
472 int32_t hashcode; local
    [all...]
uhash.h 57 * hashcode. During iteration an element may be deleted by calling
92 int32_t hashcode; member in struct:UHashElement
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-ssa-sccvn.h 33 and hashcode is stored to avoid having to calculate it
42 hashval_t hashcode; member in struct:vn_nary_op_s
51 number of the operation, and hashcode is stored to avoid having to
59 hashval_t hashcode; member in struct:vn_phi_s
93 the resulting value number, and the hashcode. */
99 hashval_t hashcode; member in struct:vn_reference_s
111 hashval_t hashcode; member in struct:vn_constant_s
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-ssa-sccvn.h 33 and hashcode is stored to avoid having to calculate it
42 hashval_t hashcode; member in struct:vn_nary_op_s
51 number of the operation, and hashcode is stored to avoid having to
59 hashval_t hashcode; member in struct:vn_phi_s
93 the resulting value number, and the hashcode. */
99 hashval_t hashcode; member in struct:vn_reference_s
111 hashval_t hashcode; member in struct:vn_constant_s
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
tree-ssa-sccvn.h 33 and hashcode is stored to avoid having to calculate it
42 hashval_t hashcode; member in struct:vn_nary_op_s
51 number of the operation, and hashcode is stored to avoid having to
59 hashval_t hashcode; member in struct:vn_phi_s
93 the resulting value number, and the hashcode. */
99 hashval_t hashcode; member in struct:vn_reference_s
111 hashval_t hashcode; member in struct:vn_constant_s
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
tree-ssa-sccvn.h 33 and hashcode is stored to avoid having to calculate it
42 hashval_t hashcode; member in struct:vn_nary_op_s
51 number of the operation, and hashcode is stored to avoid having to
59 hashval_t hashcode; member in struct:vn_phi_s
93 the resulting value number, and the hashcode. */
99 hashval_t hashcode; member in struct:vn_reference_s
111 hashval_t hashcode; member in struct:vn_constant_s
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
SemanticContext.java 159 public int hashCode() {
168 return predicateAST.getText().hashCode();
305 protected int hashcode; field in class:SemanticContext.CommutativePredicate
322 hashcode = calculateHashCode();
335 hashcode = calculateHashCode();
412 public int hashCode(){
413 return hashcode;
485 int hashcode = 0; local
487 hashcode = hashcode ^ context.hashCode()
533 int hashcode = 0; local
    [all...]
  /external/smack/src/org/xbill/DNS/
Name.java 32 /* Precomputed hashcode. */
33 private int hashcode; field in class:Name
760 if (d.hashcode == 0)
761 d.hashCode();
762 if (hashcode == 0)
763 hashCode();
764 if (d.hashcode != hashcode)
772 * Computes a hashcode based on the value
775 hashCode() {
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/include/python2.7/
datetime.h 37 long hashcode; /* -1 when unknown */ member in struct:__anon63151
54 long hashcode; \
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_mutants.py 87 # An artificial hashcode is selected at random so that we don't
90 # hash vector (based on hashcode).
91 self.hashcode = random.randrange(1000000000)
95 return self.hashcode
test_descr.py     [all...]
  /prebuilts/python/linux-x86/2.7.5/include/python2.7/
datetime.h 37 long hashcode; /* -1 when unknown */ member in struct:__anon63274
54 long hashcode; \
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_mutants.py 87 # An artificial hashcode is selected at random so that we don't
90 # hash vector (based on hashcode).
91 self.hashcode = random.randrange(1000000000)
95 return self.hashcode
test_descr.py     [all...]
  /cts/tests/tests/content/src/android/content/cts/
ContentValuesTest.java 152 assertEquals(0, mContentValues.hashCode());
156 assertTrue(0 != mContentValues.hashCode());
158 int hashcode = mContentValues.hashCode(); local
160 assertTrue(hashcode != mContentValues.hashCode());
163 assertTrue(hashcode == mContentValues.hashCode());
166 assertEquals(0, mContentValues.hashCode());
  /packages/apps/UnifiedEmail/src/com/android/mail/photomanager/
PhotoManager.java 57 * Generate a hashcode unique to each request.
232 * A map from ImageCanvas hashcode to the corresponding photo ID or uri,
280 final int hashCode = request.hashCode();
286 mPendingRequests.remove(hashCode);
287 } else if (mPendingRequests.containsKey(hashCode)) {
291 loadPhoto(hashCode, request);
296 private void loadPhoto(int hashCode, Request request) {
314 mPendingRequests.put(hashCode, request);
326 public void removePhoto(int hashcode) {
474 final int hashcode = msg.arg1; local
    [all...]
  /external/robolectric/lib/main/
httpcore-4.0.1.jar 
  /external/smack/asmack-master/lib/
httpcore-4.1.4.jar 
  /prebuilts/devtools/tools/lib/
httpcore-4.1.jar 
osgi-4.0.0.jar 
  /prebuilts/tools/common/http-client/
httpcore-4.1.jar 

Completed in 482 milliseconds

1 2