OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:hashing
(Results
1 - 25
of
166
) sorted by null
1
2
3
4
5
6
7
/external/bluetooth/glib/glib/
gchecksum.h
1
/* gchecksum.h - data
hashing
functions
34
* @G_CHECKSUM_MD5: Use the MD5
hashing
algorithm
35
* @G_CHECKSUM_SHA1: Use the SHA-1
hashing
algorithm
36
* @G_CHECKSUM_SHA256: Use the SHA-256
hashing
algorithm
38
* The
hashing
algorithm to be used by #GChecksum when performing the
42
* date to include new
hashing
algorithm types.
/external/oprofile/daemon/
opd_anon.h
24
* Shift useful bits into play for VMA
hashing
.
/external/guava/src/com/google/common/collect/
Hashing.java
29
final class
Hashing
{
30
private
Hashing
() {}
RegularImmutableSet.java
49
for (int i =
Hashing
.smear(target.hashCode()); true; i++) {
RegularImmutableMap.java
47
int tableSize =
Hashing
.chooseTableSize(immutableEntries.length);
56
for (int i =
Hashing
.smear(keyHashCode); true; i++) {
77
for (int i =
Hashing
.smear(key.hashCode()); true; i++) {
/external/elfutils/lib/
fixedsizehash.h
31
HASHFCT name of the
hashing
function to use
32
HASHTYPE type used for the
hashing
value
80
/* Constructor for the
hashing
table. */
85
/* We choose a size for the
hashing
table 150% over the number of
95
/* Adjust the size to be used for the
hashing
table. */
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/hash_fn/
sample_range_hashing.hpp
38
* Contains a range
hashing
policy.
44
// A sample range-
hashing
functor.
direct_mask_range_hashing_imp.hpp
38
* Contains a range-
hashing
policy implementation
direct_mod_range_hashing_imp.hpp
38
* Contains a range-
hashing
policy implementation
mask_based_range_hashing.hpp
38
* Contains a range
hashing
policy base.
mod_based_range_hashing.hpp
38
* Contains a range
hashing
policy base.
/external/iptables/extensions/
libipt_CLUSTERIP.man
11
Specify the
hashing
mode. Has to be one of
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/
search.h
82
functions all work on a signle internal
hashing
table. */
90
/* Create a new
hashing
table which will at most contain NEL elements. */
93
/* Destroy current internal
hashing
table. */
105
/* Reentrant versions which can handle multiple
hashing
tables at the
/system/media/opensles/tools/hashgen/
frag1.c
17
// This program prepares the input to gperf for
hashing
IIDs
/external/bouncycastle/src/main/java/org/bouncycastle/crypto/digests/
OpenSSLDigest.java
28
* Holds the standard name of the
hashing
algorithm, e.g. "SHA-1";
33
* Holds the OpenSSL name of the
hashing
algorithm, e.g. "sha1";
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
if_bonding.h
40
* - added definitions for various XOR
hashing
policies
86
/*
hashing
types */
/external/e2fsprogs/intl/
hash-string.h
1
/* Description of GNU message catalog format: string
hashing
function.
/external/bison/lib/
hash.h
1
/* hash -
hashing
table processing.
/external/bluetooth/glib/docs/reference/glib/tmpl/
checksum.sgml
10
sequence of arbitrary bytes, using various
hashing
algorithms like MD5,
/external/elfutils/libelf/
dl-hash.h
22
/* This is the
hashing
function specified by the ELF ABI. In the
/external/srec/portable/include/
phashtable.h
41
* Default hash function used for
hashing
keys. The default function assumes
47
* Default compare function used for
hashing
keys. The default function
74
* Signature for
hashing
functions.
109
*
Hashing
function used to compute the hashcode of a key.
/external/webkit/WebKitTools/wx/build/
waf_extensions.py
67
# Better performing h_file to keep
hashing
from consuming lots of time
/external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/
PBE.java
180
* key size is chosen according the MAC size, or the
hashing
algorithm,
259
* key size is chosen according the MAC size, or the
hashing
algorithm,
/external/dbus/test/data/sha-1/
Readme.txt
11
Since it is possible for an implementation to correctly handle the
hashing
of byte-oriented
27
is supplied. These can be used to verify the
hashing
of longer message lengths. For bit oriented
/external/dropbear/
random.c
45
* and a counter. We feed more data in by
hashing
the current pool and new
137
*
hashing
an undefined buffer */
Completed in 766 milliseconds
1
2
3
4
5
6
7