/external/libcxx/test/std/utilities/function.objects/unord.hash/ |
enum.fail.cpp | 12 // Hashing a struct w/o a defined hash should fail.
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
DIEHash.h | 1 //===-- llvm/CodeGen/DIEHash.h - Dwarf Hashing Framework -------*- C++ -*--===// 10 // This file contains support for DWARF4 hashing of DIEs. 26 /// \brief An object containing the capability of hashing and adding hash 29 // Collection of all attributes used in hashing a particular DIE.
|
/frameworks/wilhelm/tools/hashgen/ |
frag1.c | 17 // This program prepares the input to gperf for hashing IIDs
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/unord.hash/ |
enum.fail.cpp | 12 // Hashing a struct w/o a defined hash should fail.
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/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
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/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/core/include/utils/ |
JenkinsHash.h | 44 /* Helpful utility functions for hashing data in 32 bit chunks */
|
/external/guava/guava/src/com/google/common/hash/ |
HashFunction.java | 32 * ordered byte array. This hashing API accepts an arbitrary sequence of byte and 37 * length (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 38 * 160-bit number, while {@link Hashing#murmur3_32()} yields only 32 bits. Because a 76 * <li><b>cryptographic:</b> certain hash functions such as {@link Hashing#sha512} are 107 * interpreted in <i>little-endian</i> order. That is, hashing the byte array {@code 108 * {0x01, 0x02, 0x03, 0x04}} is equivalent to hashing the {@code int} value {@code 137 * HashFunction hf = Hashing.md5();
|
/external/kernel-headers/original/uapi/linux/ |
if_bonding.h | 40 * - added definitions for various XOR hashing policies 90 /* hashing types */
|
/external/llvm/unittests/ADT/ |
HashingTest.cpp | 10 // Hashing.h unit tests. 15 #include "llvm/ADT/Hashing.h" 41 namespace hashing { namespace in namespace:llvm 45 } // namespace hashing 335 // Hashing a sequence of homogenous types matches range hashing. 347 // Hashing a sequence of heterogeneous types which *happen* to all produce the 348 // same data for hashing produces the same as a range-based hash of the
|
/external/vboot_reference/firmware/lib/cryptolib/include/ |
sha.h | 100 int algorithm; /* Hashing algorithm to use. */ 103 /* Wrappers for message digest algorithms. These are useful when the hashing
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
if_bonding.h | 40 * - added definitions for various XOR hashing policies 86 /* hashing types */
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
if_bonding.h | 40 * - added definitions for various XOR hashing policies 90 /* hashing types */
|
/prebuilts/gdb/darwin-x86/lib/python2.7/unittest/test/ |
support.py | 16 self.fail("Problem hashing %r and %r: %s" % (obj_1, obj_2, e)) 26 self.fail("Problem hashing %s and %s: %s" % (obj_1, obj_2, e))
|
/prebuilts/gdb/linux-x86/lib/python2.7/unittest/test/ |
support.py | 16 self.fail("Problem hashing %r and %r: %s" % (obj_1, obj_2, e)) 26 self.fail("Problem hashing %s and %s: %s" % (obj_1, obj_2, e))
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/unittest/test/ |
support.py | 16 self.fail("Problem hashing %r and %r: %s" % (obj_1, obj_2, e)) 26 self.fail("Problem hashing %s and %s: %s" % (obj_1, obj_2, e))
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/unittest/test/ |
support.py | 16 self.fail("Problem hashing %r and %r: %s" % (obj_1, obj_2, e)) 26 self.fail("Problem hashing %s and %s: %s" % (obj_1, obj_2, e))
|
/toolchain/binutils/binutils-2.25/opcodes/ |
iq2000-opc.h | 33 /* Override disassembly hashing - there are variable bits in the top 38 /* following activates check beyond hashing since some iq2000 and iq10
|
/external/clang/test/Modules/ |
system_version.m | 1 // Test checking that we're hashing a system version file in the
|
/external/e2fsprogs/intl/ |
hash-string.h | 1 /* Description of GNU message catalog format: string hashing function.
|
/external/guava/guava-tests/benchmark/com/google/common/hash/ |
HashFunctionBenchmark.java | 32 * <li>hashFunctionEnum: The {@link HashFunction} to use for hashing.
|
/external/libdrm/ |
xf86drmHash.h | 29 have to change the HashHash hashing
|
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
Hash234.java | 2 * 2-, 3-, and 4-byte hashing
|
/external/skia/include/private/ |
SkChecksum.h | 57 // SkGoodHash should usually be your first choice in hashing data.
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/hash_fn/ |
direct_mask_range_hashing_imp.hpp | 38 * Contains a range-hashing policy implementation
|