HomeSort by relevance Sort by last modified time
    Searched full:hash (Results 1451 - 1475 of 2206) sorted by null

<<51525354555657585960>>

  /external/icu4c/common/
rbbi.cpp 313 * Compute a hash code for this BreakIterator
314 * @return A hash code
318 int32_t hash = 0; local
320 hash = fData->hashCode();
322 return hash;
    [all...]
  /external/v8/src/ia32/
ic-ia32.cc 120 // Compute the masked index: (hash + i + i * i) & mask.
299 // Load the map of the receiver, compute the keyed lookup cache hash
300 // based on 32 bits of the map pointer and the string hash.
356 // If the hash field contains an array index pick it out. The assert checks
358 // cached in the hash field and the number of bits reserved for it does not
    [all...]
  /external/v8/src/x64/
ic-x64.cc 118 // Compute the masked index: (hash + i + i * i) & mask.
341 // Load the map of the receiver, compute the keyed lookup cache hash
342 // based on 32 bits of the map pointer and the string hash.
394 // If the hash field contains an array index pick it out. The assert checks
396 // cached in the hash field and the number of bits reserved for it does not
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/eap_peer/
eap.c 588 * unfortunately, such implementations exist. Use MD5 hash as
    [all...]
  /external/bluetooth/glib/
ChangeLog.pre-1-2 265 * tests/hash-test.c:
266 Add test where hash function always returns a single value.
281 - Fixed bug that overwrote nodes in hash buckets instead of
282 adding them to the hash bucket node list.
283 Hash tables now work as advertised.
298 * tests/hash-test.c:
709 * tests/hash-test.c, tests/list-test.c, tests/slist-test.c,
    [all...]
  /external/icu4c/i18n/
usearch.cpp 91 inline int hash(uint32_t ce) function
96 // to be discussed on the hash algo.
500 shift[hash(cetable[count])] = temp > 1 ? temp : 1;
502 shift[hash(cetable[cesize])] = 1;
504 shift[hash(0)] = 1;
511 backshift[hash(cetable[count])] = count > expansionsize ?
514 backshift[hash(cetable[0])] = 1;
515 backshift[hash(0)] = 1;
738 int32_t shift = pattern->shift[hash(ce)];
    [all...]
  /external/libpng/
pngrtran.c 322 png_dsortpp hash; local
339 hash = (png_dsortpp)png_calloc(png_ptr, (png_uint_32)(769 *
373 t->next = hash[d];
376 hash[d] = t;
386 if (hash[i] != NULL)
390 for (p = hash[i]; p; p = p->next)
450 if (hash[i] != NULL)
452 png_dsortp p = hash[i];
460 hash[i] = 0;
464 png_free(png_ptr, hash);
    [all...]
  /external/dbus/doc/
dbus-tutorial.xml     [all...]
  /dalvik/libcore/luni/src/main/java/java/io/
File.java 744 * Returns an integer hash code for the receiver. Any two objects for which
745 * {@code equals} returns {@code true} must return the same hash code.
747 * @return this files's hash value.
    [all...]
  /dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/lang/
FloatTest.java 293 assertTrue("Returned invalid hash code for 1908.8786f", f.hashCode() == Float
297 assertTrue("Returned invalid hash code for -1.112", f.hashCode() == Float
301 assertTrue("Returned invalid hash code for 0", f.hashCode() == Float.floatToIntBits(0f));
    [all...]
  /dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/
SimpleDateFormatTest.java 414 assertTrue("clone has not equal hash code", clone.hashCode() == format
417 assertTrue("clone has not equal hash code after format", clone
422 assertFalse("objects has equal hash code", format2.hashCode() == format
    [all...]
  /external/dbus/bus/
connection.c 32 #include <dbus/dbus-hash.h>
115 /* val is NULL is 0 when it isn't in the hash yet */
157 * a hash entry should already exist
    [all...]
  /external/guava/javadoc/com/google/common/collect/
package-use.html 211 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Implementation of <A HREF="../../../../com/google/common/collect/Multimap.html" title="interface in com.google.common.collect"><CODE>Multimap</CODE></A> using hash tables.</TD>
281 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;An immutable, hash-based <A HREF="http://java.sun.com/javase/6/docs/api/java/util/Map.html?is-external=true" title="class or interface in java.util"><CODE>Map</CODE></A> with reliable user-specified iteration
308 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;An immutable hash-based multiset.</TD>
  /external/guava/javadoc/com/google/common/primitives/
Booleans.html 180 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns a hash code for <code>value</code>; equal to the result of invoking
268 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
273 <DT><B>Returns:</B><DD>a hash code for the value</DL>
Doubles.html 179 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns a hash code for <code>value</code>; equal to the result of invoking
286 <DD>Returns a hash code for <code>value</code>; equal to the result of invoking
291 <DT><B>Returns:</B><DD>a hash code for the value</DL>
    [all...]
  /external/guava/src/com/google/common/collect/
AbstractMultimap.java     [all...]
  /external/icu4c/test/intltest/
rbbiapts.cpp 220 bi1->setText((UnicodeString)"Hash code");
221 bi2->setText((UnicodeString)"Hash code");
222 bi3->setText((UnicodeString)"Hash code");
    [all...]
  /external/opencore/doc/oscl_html/
classOSCL__wString.html 46 <tr><td nowrap align=right valign=top>virtual OSCL_IMPORT_REF int8&nbsp;</td><td valign=bottom><a class="el" href="classOSCL__wString.html#a19">hash</a> () const</td></tr>
322 <a name="a19" doxytag="OSCL_wString::hash"></a><p>
328 <td class="md" nowrap valign="top"> virtual OSCL_IMPORT_REF int8 OSCL_wString::hash </td>
    [all...]
  /external/tcpdump/
print-isakmp.c 110 "none", "sa", "p", "t", "ke", "id", "cert", "cr", "hash",
548 { "hash", 7, { NULL, "md5", "sha1", "tiger",
995 "INVALID-CERT-AUTHORITY", "INVALID-HASH-INFORMATION",
    [all...]
  /external/v8/src/arm/
ic-arm.cc 109 // Compute the masked index: (hash + i + i * i) & mask.
113 // the hash in a separate instruction. The value hash + i + i * i is right
  /external/webkit/WebKitTools/android/flex-2.5.4a/
flexdef.h 590 * dhash - dfa state hash value
634 * hshcol - number of hash collisions detected by snstods
645 * hshsave - number of hash collisions saved by checking number of states
    [all...]
  /bionic/libc/bionic/
malloc_debug_common.c 37 * (to fill allocation entry hash table, for example). So, all relevant
sha1.c 121 * Hash a single 512-bit block. This is the core of the algorithm.
  /build/tools/releasetools/
check_target_files_signatures 33 printed as the cert name, otherwise a hash of the cert plus its
  /cts/tests/tests/widget/src/android/widget/cts/
SimpleAdapterTest.java 452 * @return the array list< hash map< string, string>>, Example:if the

Completed in 2262 milliseconds

<<51525354555657585960>>