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

<<21222324252627282930>>

  /dalvik/libcore/crypto/src/main/java/javax/crypto/spec/
RC2ParameterSpec.java 148 * Returns the hash code of this <code>RC2ParameterSpec</code> instance.
150 * @return the hash code.
RC5ParameterSpec.java 200 * Returns the hash code of this <code>RC5ParameterSpec</code> instance.
202 * @return the hash code.
SecretKeySpec.java 149 * Returns the hash code of this <code>SecretKeySpec</code> object.
151 * @return the hash code.
  /dalvik/libcore/luni/src/main/java/java/util/
PropertyPermission.java 116 * Returns an integer hash code for the receiver. Any two objects which
120 * @return the receiver's hash.
Set.java 105 * Returns the hash code for this set. Two set which are equal must return
108 * @return the hash code of this set.
  /dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/lang/
StackTraceElementTest.java 228 assertEquals("Incorrect value of hash code",
230 assertFalse("Incorrect value of hash code",
  /dalvik/libcore/security/src/main/java/javax/security/cert/
Certificate.java 73 * Returns an integer hash code for the receiver. Any two objects which
77 * @return the receiver's hash
  /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/
CryptoProvider.java 27 * using a Secure Hash Algorithm, SHA-1;
28 * see SECURE HASH STANDARD, FIPS PUB 180-1 (http://www.itl.nist.gov/fipspubs/fip180-1.htm) <BR>
  /dalvik/libcore/security/src/main/java/org/apache/harmony/security/x509/tsp/
TimeStampReq.java 41 * --a hash algorithm OID and the hash value of the data to be
  /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/encodings/
ISO9796d1Encoding.java 12 * should never use it with anything other than a hash (ie. even if the
13 * message is small don't sign the message, sign it's hash) or some "random"
  /dalvik/libcore/security/src/test/java/tests/security/cert/
X509CRLEntryTest.java 182 * hashCode() method testing. Tests that for equal objects hash codes
197 assertTrue("Equal objects should have the same hash codes.",
  /dalvik/libcore/text/src/main/java/java/text/
CollationKey.java 140 * Returns an integer hash code for the receiver. Objects which are equal
143 * @return the receiver's hash.
  /dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/
ParsePositionTest.java 123 assertTrue("hashCode returns non equal hash codes for equal objects.",
126 assertTrue("hashCode returns equal hash codes for non equal objects.",
  /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/
OpenSSLSignature.java 97 // algorithm name as a pair consisting of crypto algorithm and hash
98 // algorithm. For all other (RSA) cases, passing the hash algorithm
SSLv3Constants.java 28 * Client is a sender. Used in hash calculating for finished message.
35 * Server is a sender. Used in hash calculating for finished message.
  /external/apache-http/src/org/apache/http/conn/scheme/
PlainSocketFactory.java 177 * Obtains a hash code for this object.
178 * All instances of this class have the same hash code.
  /external/bluetooth/glib/docs/reference/glib/tmpl/
caches.sgml 55 @hash_key_func: a function to create a hash value from a key.
56 @hash_value_func: a function to create a hash value from a value.
  /external/dropbear/libtomcrypt/src/pk/pkcs1/
pkcs_1_oaep_encode.c 29 @param hash_idx The index of the hash desired
48 /* test valid hash */
  /external/e2fsprogs/intl/
gmo.h 88 /* Size of hash table. */
90 /* Offset of first hash table entry. */
  /external/e2fsprogs/lib/ext2fs/tdb/patches/
static-prototypes 61 -tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, int locktype,
62 +static tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, int locktype,
  /external/elfutils/tests/
Makefile.am 29 show-abbrev hash asm-tst1 asm-tst2 asm-tst3 \
38 run-show-abbrev.sh hash asm-tst1 asm-tst2 \
  /external/emma/core/java12/com/vladium/jcd/cls/
ClassDef.java 460 final byte [] hash = md.digest ();
464 for (int x = 0; x < hash.length; ++ x)
466 System.out.println ("HASH[" + x + "] = " + hash [x]);
470 // final int hash0 = hash [0];
471 // final int hash1 = hash [1];
475 for (int i = Math.min (hash.length, 8) - 1; i >= 0; -- i)
477 result = (result << 8) | (hash [i] & 0xFF);
  /external/emma/core/java12/com/vladium/util/
SoftValueMap.java 36 // entry clearing is needed so that the hash table does not get polluted with
61 * @param initialCapacity initial number of hash buckets in the table
161 // index into the corresponding hash bucket:
232 // index into the corresponding hash bucket:
280 // recompute the hash bucket index:
299 // index into the corresponding hash bucket:
499 // index into the corresponding new hash bucket:
550 // index into the corresponding hash bucket:
  /external/guava/src/com/google/common/collect/
RegularImmutableList.java 210 // not caching hash code since it could change if the elements are mutable
211 // in a way that modifies their hash codes
  /external/iproute2/include/linux/
xfrm.h 301 __u32 sadhcnt; /* current hash bkts */
302 __u32 sadhmcnt; /* max allowed hash bkts */

Completed in 222 milliseconds

<<21222324252627282930>>