OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:hash
(Results
1051 - 1075
of
2206
) sorted by null
<<
41
42
43
44
45
46
47
48
49
50
>>
/prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/i686-unknown-linux-gnu/lib/ldscripts/
elf_i386.x
12
.
hash
: { *(.
hash
) }
elf_i386.xbn
12
.
hash
: { *(.
hash
) }
elf_i386.xd
12
.
hash
: { *(.
hash
) }
elf_i386.xn
12
.
hash
: { *(.
hash
) }
elf_i386.xs
11
.
hash
: { *(.
hash
) }
/prebuilt/linux-x86/toolchain/i686-unknown-linux-gnu-4.2.1/man/man1/
i686-unknown-linux-gnu-objcopy.1
600
with one symbol pair per line. Line comments may be introduced by the
hash
612
name per line. Line comments may be introduced by the
hash
character.
618
name per line. Line comments may be introduced by the
hash
character.
624
symbol name per line. Line comments may be introduced by the
hash
630
symbol name per line. Line comments may be introduced by the
hash
636
name per line. Line comments may be introduced by the
hash
character.
642
name per line. Line comments may be introduced by the
hash
character.
648
name per line. Line comments may be introduced by the
hash
character.
[
all
...]
/external/webkit/SunSpider/tests/parse-only/
concat-jquery-mootools-prototype.js
[
all
...]
prototype-1.6.0.3.js
183
return object instanceof
Hash
;
423
return match[1].split(separator || '&').inject({ }, function(
hash
, pair) {
429
if (key in
hash
) {
430
if (!Object.isArray(
hash
[key]))
hash
[key] = [
hash
[key]];
431
hash
[key].push(value);
433
else
hash
[key] = value;
435
return
hash
;
994
return new
Hash
(object)
[
all
...]
/external/v8/src/
heap.cc
1701
int
hash
;
local
1721
int
hash
;
local
[
all
...]
/bionic/libc/include/sys/
exec_elf.h
246
#define SHT_HASH 5 /* symbol
hash
table section */
268
#define ELF_HASH ".
hash
" /* symbol
hash
table */
438
#define DT_HASH 4 /* address of symbol
hash
table */
/cts/tools/dasm/src/java_cup/
action_part.java
77
/** Produce a
hash
code. */
production_part.java
75
/** Produce a
hash
code. */
symbol_part.java
80
/** Produce a
hash
code. */
/dalvik/libcore/icu/src/main/java/com/ibm/icu4jni/text/
RuleBasedCollator.java
603
* Returns a
hash
of this collation object
605
* @return
hash
of this collation object
610
// since rules do not change once it is created, we can cache the
hash
703
*
Hash
code for rules
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/internal/net/www/
MimeTable.java
41
* A
hash
table containing the mapping between extensions and mime types.
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/platform/
PlatformAddressFactory.java
41
* Defines the maximum number of probes taken per
hash
, used for looking
/dalvik/libcore/luni-kernel/src/main/java/java/lang/
StackTraceElement.java
195
// all unknown methods
hash
the same
/dalvik/libcore/security/src/main/java/java/security/
CodeSource.java
308
* Returns the
hash
code value for this {@code CodeSource}.
309
* Returns the same
hash
code for {@code CodeSource}s that are
313
* @return the
hash
code value for this {@code CodeSource}.
321
// compute the
hash
?
/dalvik/libcore/security/src/main/java/org/apache/harmony/security/fortress/
Services.java
66
//
Hash
for quick provider access by name
/dalvik/libcore/security/src/test/java/org/apache/harmony/security/tests/java/security/
BasicPermission2Test.java
128
assertTrue("Equal objects should return same
hash
",
/dalvik/libcore/security/src/test/java/tests/api/javax/security/cert/
CertificateTest.java
187
assertTrue("Equal objects should have the same
hash
codes.", tbt_cert
/dalvik/libcore/security/src/test/java/tests/java/security/
BasicPermissionTest.java
109
* equal permissions should have the same
hash
code
/dalvik/libcore/xml/src/main/java/org/apache/xml/serializer/
CharInfo.java
772
* Get the
hash
value of the character.
774
* @return
hash
value of the character.
784
* Get the
hash
value of the character.
786
* @return
hash
value of the character.
/dalvik/libcore/xml/src/main/java/org/xml/sax/
DTDHandler.java
39
* future use (perhaps in a
hash
table or object tree).
/dalvik/libdex/
sha1.c
33
for the shifts being done against it. This caused the
hash
38
larger would be guaranteed to generate the wrong
hash
(e.g.
133
/*
Hash
a single 512-bit block. This is the core of the algorithm. */
278
/* sha1file computes the SHA-1
hash
of the named file and puts
Completed in 415 milliseconds
<<
41
42
43
44
45
46
47
48
49
50
>>