Searched refs:LookupEntry (Results 1 - 10 of 10) sorted by relevance

/external/chromium_org/third_party/skia/src/core/
H A DSkPathHeap.h52 class LookupEntry { class in class:SkPathHeap
54 LookupEntry(const SkPath& path);
59 static bool Less(const LookupEntry& a, const LookupEntry& b) {
69 SkTDArray<LookupEntry> fLookupTable;
71 SkPathHeap::LookupEntry* addIfNotPresent(const SkPath& path);
H A DSkPathHeap.cpp53 SkPathHeap::LookupEntry::LookupEntry(const SkPath& path) function in class:SkPathHeap::LookupEntry
57 SkPathHeap::LookupEntry* SkPathHeap::addIfNotPresent(const SkPath& path) {
58 LookupEntry searchKey(path);
59 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
63 sizeof(LookupEntry));
66 *fLookupTable.insert(index) = LookupEntry(path);
73 SkPathHeap::LookupEntry* entry = this->addIfNotPresent(path);
H A DSkBitmapHeap.h220 struct LookupEntry { struct in class:SkBitmapHeap
221 LookupEntry(const SkBitmap& bm) function in struct:SkBitmapHeap::LookupEntry
235 LookupEntry* fMoreRecentlyUsed;
236 LookupEntry* fLessRecentlyUsed;
241 * Compare two LookupEntry pointers for sorting and searching.
243 static bool Less(const LookupEntry& a, const LookupEntry& b);
253 int removeEntryFromLookupTable(LookupEntry*);
263 int findInLookupTable(const LookupEntry& key, SkBitmapHeapEntry** entry);
265 LookupEntry* findEntryToReplac
[all...]
H A DSkBitmapHeap.cpp47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
48 const SkBitmapHeap::LookupEntry& b) {
127 void SkBitmapHeap::removeFromLRU(SkBitmapHeap::LookupEntry* entry) {
155 void SkBitmapHeap::appendToLRU(SkBitmapHeap::LookupEntry* entry) {
168 SkBitmapHeap::LookupEntry* SkBitmapHeap::findEntryToReplace(const SkBitmap& replacement) {
172 SkBitmapHeap::LookupEntry* iter = fLeastRecentlyUsed;
197 LookupEntry* iter = fLeastRecentlyUsed;
206 LookupEntry* next = iter->fMoreRecentlyUsed;
237 int SkBitmapHeap::findInLookupTable(const LookupEntry
[all...]
/external/skia/src/core/
H A DSkPathHeap.h52 class LookupEntry { class in class:SkPathHeap
54 LookupEntry(const SkPath& path);
59 static bool Less(const LookupEntry& a, const LookupEntry& b) {
69 SkTDArray<LookupEntry> fLookupTable;
71 SkPathHeap::LookupEntry* addIfNotPresent(const SkPath& path);
H A DSkPathHeap.cpp53 SkPathHeap::LookupEntry::LookupEntry(const SkPath& path) function in class:SkPathHeap::LookupEntry
57 SkPathHeap::LookupEntry* SkPathHeap::addIfNotPresent(const SkPath& path) {
58 LookupEntry searchKey(path);
59 int index = SkTSearch<const LookupEntry, LookupEntry::Less>(
63 sizeof(LookupEntry));
66 *fLookupTable.insert(index) = LookupEntry(path);
73 SkPathHeap::LookupEntry* entry = this->addIfNotPresent(path);
H A DSkBitmapHeap.h220 struct LookupEntry { struct in class:SkBitmapHeap
221 LookupEntry(const SkBitmap& bm) function in struct:SkBitmapHeap::LookupEntry
235 LookupEntry* fMoreRecentlyUsed;
236 LookupEntry* fLessRecentlyUsed;
241 * Compare two LookupEntry pointers for sorting and searching.
243 static bool Less(const LookupEntry& a, const LookupEntry& b);
253 int removeEntryFromLookupTable(LookupEntry*);
263 int findInLookupTable(const LookupEntry& key, SkBitmapHeapEntry** entry);
265 LookupEntry* findEntryToReplac
[all...]
H A DSkBitmapHeap.cpp47 bool SkBitmapHeap::LookupEntry::Less(const SkBitmapHeap::LookupEntry& a,
48 const SkBitmapHeap::LookupEntry& b) {
127 void SkBitmapHeap::removeFromLRU(SkBitmapHeap::LookupEntry* entry) {
155 void SkBitmapHeap::appendToLRU(SkBitmapHeap::LookupEntry* entry) {
168 SkBitmapHeap::LookupEntry* SkBitmapHeap::findEntryToReplace(const SkBitmap& replacement) {
172 SkBitmapHeap::LookupEntry* iter = fLeastRecentlyUsed;
197 LookupEntry* iter = fLeastRecentlyUsed;
206 LookupEntry* next = iter->fMoreRecentlyUsed;
237 int SkBitmapHeap::findInLookupTable(const LookupEntry
[all...]
/external/openfst/src/include/fst/
H A Dgeneric-register.h61 const EntryType *entry = LookupEntry(key);
86 const EntryType *entry = this->LookupEntry(key);
98 virtual const EntryType *LookupEntry( function in class:fst::GenericRegister
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dregister.h77 Entry LookupEntry(const string &type) const { function in class:fst::FstRegister
88 Entry entry = LookupEntry(type);
106 return LookupEntry(type);

Completed in 1030 milliseconds