OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:hashing
(Results
1 - 4
of
4
) sorted by null
/external/guava/guava-tests/benchmark/com/google/common/hash/
MessageDigestAlgorithmBenchmark.java
23
import com.google.common.hash.
Hashing
;
37
* <li>hashMethod: how to hash the data (using the
Hashing
API or the MessageDigest API).
64
MD5("MD5",
Hashing
.md5()),
65
SHA_1("SHA-1",
Hashing
.sha1()),
66
SHA_256("SHA-256",
Hashing
.sha256()),
67
SHA_512("SHA-512",
Hashing
.sha512());
97
@Benchmark byte
hashing
(int reps) {
method in class:MessageDigestAlgorithmBenchmark
/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/llvm/include/llvm/ADT/
Hashing.h
1
//===-- llvm/ADT/
Hashing
.h - Utilities for
hashing
--------------*- C++ -*-===//
10
// This file implements the newly proposed standard C++ interfaces for
hashing
18
// data. It is the intended product of
hashing
, and can be used to implement
25
// construction of
hashing
datastructures.
28
// user-defined type which wishes to be used within a
hashing
context. It
37
// Note that 'hash_combine_range' contains very special logic for
hashing
63
/// This object represents the result of
hashing
some entity. It is intended to
64
/// be used to implement hashtables or other
hashing
-based data structures.
125
/// This
hashing
library uses a per-execution seed designed to change on eac
143
namespace
hashing
{
namespace in namespace:llvm
487
namespace
hashing
{
namespace in namespace:llvm
611
namespace
hashing
{
namespace in namespace:llvm
[
all
...]
/ndk/sources/host-tools/make-3.81/
function.c
942
int
hashing
= 0;
992
hashing
= (literals >= 2 && (literals * words) >= 10);
993
if (
hashing
)
1014
else if (
hashing
)
1049
if (
hashing
)
935
int
hashing
= 0;
local
[
all
...]
Completed in 1460 milliseconds