OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:fHash
(Results
1 - 24
of
24
) sorted by null
/external/chromium_org/third_party/skia/include/gpu/
GrKey.h
17
explicit GrKey(Hash hash) :
fHash
(hash) {}
19
intptr_t getHash() const { return
fHash
; }
22
return
fHash
< rh.
fHash
|| (
fHash
== rh.
fHash
&& this->lt(rh));
25
return
fHash
== rh.
fHash
&& this->eq(rh);
33
const Hash
fHash
;
/external/skia/include/gpu/
GrKey.h
17
explicit GrKey(Hash hash) :
fHash
(hash) {}
19
intptr_t getHash() const { return
fHash
; }
22
return
fHash
< rh.
fHash
|| (
fHash
== rh.
fHash
&& this->lt(rh));
25
return
fHash
== rh.
fHash
&& this->eq(rh);
33
const Hash
fHash
;
/external/chromium_org/third_party/skia/src/core/
SkScaledImageCache.h
182
Hash*
fHash
;
SkTDynamicHash.h
35
explicit Iter(SkTDynamicHash* hash) :
fHash
(hash), fCurrentIndex(-1) {
40
SkASSERT(fCurrentIndex <=
fHash
->fCapacity);
41
return fCurrentIndex ==
fHash
->fCapacity;
54
T* current() const { return
fHash
->fArray[fCurrentIndex]; }
56
SkTDynamicHash*
fHash
;
SkScaledImageCache.cpp
67
fHash
= compute_hash(&fGenID, 7);
85
const uint32_t* a = &
fHash
;
86
const uint32_t* b = &other.
fHash
;
95
uint32_t
fHash
;
119
static uint32_t Hash(const Key& key) { return key.
fHash
; }
164
fHash
= new Hash;
166
fHash
= NULL;
313
delete
fHash
;
335
Rec* rec =
fHash
->find(key);
424
SkASSERT(
fHash
);
[
all
...]
SkPictureFlat.h
383
SkASSERT(
fHash
.count() == fIndexedData.count());
384
return
fHash
.count();
426
const SkFlatData* found =
fHash
.find(*toReplace);
439
// findAndReturnMutableFlat already called
fHash
.add(), so we just clean up the old entry.
440
fHash
.remove(*found);
507
SkFlatData* candidate =
fHash
.find(scratch);
513
fHash
.add(detached);
558
// All SkFlatData* stored in fIndexedData and
fHash
are owned by the controller.
567
SkTDynamicHash<SkFlatData, SkFlatData, SkFlatData::HashTraits>
fHash
;
/external/chromium_org/third_party/skia/src/gpu/
GrBinHashKey.h
30
fHash
= 0;
54
fHash
= hash;
59
if (
fHash
!= key.
fHash
) {
84
return
fHash
;
93
uint32_t
fHash
;
GrTMultiMap.h
35
SkASSERT(
fHash
.count() == 0);
39
ValueList* list =
fHash
.find(key);
50
fHash
.add(SkNEW_ARGS(ValueList, (value)));
57
ValueList* list =
fHash
.find(key);
76
fHash
.remove(key);
84
ValueList* list =
fHash
.find(key);
93
ValueList* list =
fHash
.find(key);
106
SkTDynamicHash<ValueList, Key>
fHash
;
GrTHashTable.h
58
void clearHash() { sk_bzero(
fHash
, sizeof(
fHash
)); }
77
mutable T*
fHash
[kHashCount];
127
T* elem =
fHash
[hashIndex];
148
fHash
[hashIndex] = fSorted[index];
167
fHash
[hash2Index(key.getHash())] = elem;
174
if (
fHash
[index] == elem) {
175
fHash
[index] = NULL;
/external/skia/src/core/
SkScaledImageCache.h
182
Hash*
fHash
;
SkTDynamicHash.h
35
explicit Iter(SkTDynamicHash* hash) :
fHash
(hash), fCurrentIndex(-1) {
40
SkASSERT(fCurrentIndex <=
fHash
->fCapacity);
41
return fCurrentIndex ==
fHash
->fCapacity;
54
T* current() const { return
fHash
->fArray[fCurrentIndex]; }
56
SkTDynamicHash*
fHash
;
SkScaledImageCache.cpp
67
fHash
= compute_hash(&fGenID, 7);
85
const uint32_t* a = &
fHash
;
86
const uint32_t* b = &other.
fHash
;
95
uint32_t
fHash
;
119
static uint32_t Hash(const Key& key) { return key.
fHash
; }
164
fHash
= new Hash;
166
fHash
= NULL;
313
delete
fHash
;
335
Rec* rec =
fHash
->find(key);
424
SkASSERT(
fHash
);
[
all
...]
SkPictureFlat.h
383
SkASSERT(
fHash
.count() == fIndexedData.count());
384
return
fHash
.count();
426
const SkFlatData* found =
fHash
.find(*toReplace);
439
// findAndReturnMutableFlat already called
fHash
.add(), so we just clean up the old entry.
440
fHash
.remove(*found);
507
SkFlatData* candidate =
fHash
.find(scratch);
513
fHash
.add(detached);
558
// All SkFlatData* stored in fIndexedData and
fHash
are owned by the controller.
567
SkTDynamicHash<SkFlatData, SkFlatData, SkFlatData::HashTraits>
fHash
;
/external/skia/src/gpu/
GrBinHashKey.h
30
fHash
= 0;
54
fHash
= hash;
59
if (
fHash
!= key.
fHash
) {
84
return
fHash
;
93
uint32_t
fHash
;
GrTMultiMap.h
35
SkASSERT(
fHash
.count() == 0);
39
ValueList* list =
fHash
.find(key);
50
fHash
.add(SkNEW_ARGS(ValueList, (value)));
57
ValueList* list =
fHash
.find(key);
76
fHash
.remove(key);
84
ValueList* list =
fHash
.find(key);
93
ValueList* list =
fHash
.find(key);
106
SkTDynamicHash<ValueList, Key>
fHash
;
GrTHashTable.h
58
void clearHash() { sk_bzero(
fHash
, sizeof(
fHash
)); }
77
mutable T*
fHash
[kHashCount];
127
T* elem =
fHash
[hashIndex];
148
fHash
[hashIndex] = fSorted[index];
167
fHash
[hash2Index(key.getHash())] = elem;
174
if (
fHash
[index] == elem) {
175
fHash
[index] = NULL;
/external/chromium_org/third_party/icu/source/i18n/
uspoof_conf.h
74
UHashtable *
fHash
; // Key: UnicodeString Value: SPUString
zstrfmt.h
113
UHashtable *
fHash
;
/external/icu/icu4c/source/i18n/
uspoof_conf.h
74
UHashtable *
fHash
; // Key: UnicodeString Value: SPUString
tznames_impl.h
64
UHashtable *
fHash
;
/prebuilts/tools/common/eclipse/
org.eclipse.ui.workbench.texteditor_3.6.1.r361_v20100714-0800.jar
/prebuilts/misc/common/icu4j/
icu4j.jar
/external/owasp/sanitizer/tools/findbugs/lib/
findbugs.jar
/prebuilts/tools/common/m2/repository/com/google/code/findbugs/findbugs/2.0.1/
findbugs-2.0.1.jar
Completed in 1262 milliseconds