HomeSort by relevance Sort by last modified time
    Searched refs:LookupEntry (Results 1 - 9 of 9) sorted by null

  /external/chromium_org/third_party/skia/src/core/
SkPathHeap.h 52 class LookupEntry {
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);
SkPathHeap.cpp 53 SkPathHeap::LookupEntry::LookupEntry(const SkPath& path)
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);
SkBitmapHeap.h 220 struct LookupEntry {
221 LookupEntry(const SkBitmap& bm)
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* findEntryToReplace(const SkBitmap& replacement)
    [all...]
SkBitmapHeap.cpp 47 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& indexEntry, SkBitmapHeapEntry** entry)
    [all...]
  /external/skia/src/core/
SkPathHeap.h 52 class LookupEntry {
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);
SkPathHeap.cpp 53 SkPathHeap::LookupEntry::LookupEntry(const SkPath& path)
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);
SkBitmapHeap.h 220 struct LookupEntry {
221 LookupEntry(const SkBitmap& bm)
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* findEntryToReplace(const SkBitmap& replacement)
    [all...]
SkBitmapHeap.cpp 47 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& indexEntry, SkBitmapHeapEntry** entry)
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
register.h 77 Entry LookupEntry(const string &type) const {
88 Entry entry = LookupEntry(type);
106 return LookupEntry(type);

Completed in 403 milliseconds