HomeSort by relevance Sort by last modified time
    Searched defs:Cache (Results 51 - 75 of 327) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
ListFormatter.java 168 return cache.get(locale, style.getName());
306 private static class Cache {
307 private final ICUCache<String, ListFormatter> cache = field in class:ListFormatter.Cache
312 ListFormatter result = cache.get(key);
315 cache.put(key, result);
333 static Cache cache = new Cache(); field in class:ListFormatter
TimeZoneNames.java 133 private static Cache TZNAMES_CACHE = new Cache();
515 * TimeZoneNames cache used by {@link TimeZoneNames#getInstance(ULocale)}
517 private static class Cache extends SoftCache<String, TimeZoneNames, ULocale> {
  /external/javassist/src/main/javassist/
CtMember.java 30 static class Cache extends CtMember {
49 Cache(CtClassType decl) {
  /external/llvm/include/llvm/ADT/
ImmutableList.h 144 CacheTy Cache;
167 // Profile the new list to see if it already exists in our cache.
173 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
176 // The list does not exist in our cache. Create it.
181 // Insert the new list into the cache.
182 Cache.InsertNode(L, InsertPos);
  /external/llvm/lib/Support/
SourceMgr.cpp 40 // Delete the line # cache if allocated.
41 if (LineNoCacheTy *Cache = getCache(LineNoCache))
42 delete Cache;
91 // If we have a line number cache, and if the query is to a later point in the
94 if (LineNoCacheTy *Cache = getCache(LineNoCache))
95 if (Cache->LastQueryBufferID == BufferID &&
96 Cache->LastQuery <= Loc.getPointer()) {
97 Ptr = Cache->LastQuery;
98 LineNo = Cache->LineNoOfQuery;
106 // Allocate the line number cache if it doesn't exist
    [all...]
  /external/lzma/C/
Ppmd7.h 128 Byte Cache;
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
ImmutableList.h 145 CacheTy Cache;
168 // Profile the new list to see if it already exists in our cache.
174 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
177 // The list does not exist in our cache. Create it.
182 // Insert the new list into the cache.
183 Cache.InsertNode(L, InsertPos);
  /external/v8/tools/clang/blink_gc_plugin/
RecordInfo.h 122 RecordInfo(clang::CXXRecordDecl* record, RecordCache* cache);
188 for (Cache::iterator it = cache_.begin(); it != cache_.end(); ++it) {
204 typedef std::map<clang::CXXRecordDecl*, RecordInfo> Cache;
205 Cache cache_;
  /libcore/ojluni/src/main/java/sun/util/locale/
BaseLocale.java 41 private static final Cache CACHE = new Cache();
69 CACHE.put(new Key(language, region), base);
87 BaseLocale baseLocale = CACHE.get(key);
294 private static class Cache extends LocaleObjectCache<Key, BaseLocale> {
296 public Cache() {
  /packages/apps/DocumentsUI/src/com/android/documentsui/
ThumbnailCache.java 38 * An LRU cache that supports finding the thumbnail of the requested uri with a different size than
50 private final Cache mCache;
53 * Creates a thumbnail LRU cache.
55 * @param maxCacheSizeInBytes the maximum size of thumbnails in bytes this cache can hold.
59 mCache = new Cache(maxCacheSizeInBytes);
112 // Cache miss.
117 * Puts a thumbnail for the given uri and size in to the cache.
120 * @param thumbnail the thumbnail to put in cache
143 * Removes all thumbnail cache associated to the given uri.
144 * @param uri the uri which thumbnail cache to remov
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
ImmutableList.h 147 CacheTy Cache;
170 // Profile the new list to see if it already exists in our cache.
176 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
179 // The list does not exist in our cache. Create it.
184 // Insert the new list into the cache.
185 Cache.InsertNode(L, InsertPos);
  /external/ImageMagick/MagickCore/
cache-private.h 16 MagickCore cache private methods.
21 #include "MagickCore/cache.h"
22 #include "MagickCore/distribute-cache.h"
34 *Cache;
116 *cache, member in struct:_NexusInfo
228 extern MagickPrivate Cache
230 ClonePixelCache(const Cache),
231 DestroyPixelCache(Cache),
232 ReferencePixelCache(Cache);
235 GetPixelCacheStorageClass(const Cache);
    [all...]
  /external/llvm/tools/bugpoint/
Miscompilation.cpp     [all...]
  /external/swiftshader/third_party/LLVM/tools/bugpoint/
Miscompilation.cpp     [all...]
  /libcore/ojluni/src/main/java/sun/security/util/
Cache.java 32 * Abstract base class and factory for caches. A cache is a key-value mapping.
52 * the GC automatically size the cache dynamically depending on the
60 * Cache sizing: the memory cache is implemented on top of a LinkedHashMap.
63 * maximum cache size to value that uses those buckets fully. For example,
64 * if a cache with somewhere between 500 and 1000 entries is desired, a
67 * buckets / 4 * 3. As mentioned above, with a SoftReference cache, it is
72 public abstract class Cache<K,V> {
74 protected Cache() {
79 * Return the number of currently valid entries in the cache
    [all...]
  /external/clang/lib/Lex/
PTHLexer.cpp 522 // Get the location of the spelling cache.
531 // Get the number of IdentifierInfos and pre-allocate the identifier cache.
534 // Pre-allocate the persistent ID -> IdentifierInfo* cache. We use calloc()
576 // Store the new IdentifierInfo in the cache.
691 CacheTy Cache;
695 : Cache(FL.getNumBuckets(), FL.getNumEntries(), FL.getBuckets(),
702 CacheTy::iterator I = Cache.find(Path);
705 if (I == Cache.end())
  /external/compiler-rt/lib/scudo/
scudo_allocator.cpp 161 static thread_local AllocatorCache Cache;
169 // quarantine and swallowing the cache.
175 getAllocator().DestroyCache(&Cache);
201 getAllocator().InitCache(&Cache);
206 explicit QuarantineCallback(AllocatorCache *Cache)
207 : Cache_(Cache) {}
243 typedef ScudoQuarantine::Cache QuarantineCache;
341 Ptr = BackendAllocator.Allocate(&Cache, NeededSize, MinAlignment);
419 QuarantineCallback(&Cache), Chunk, Size);
494 QuarantineCallback(&Cache), Chunk, OldSize)
    [all...]
  /external/pdfium/third_party/lcms2-2.6/src/
cmsxform.c 301 // No gamut check, no cache, 16 bits
382 _cmsCACHE Cache;
392 // Get copy of zero cache
393 memcpy(&Cache, &p ->Cache, sizeof(Cache));
399 if (memcmp(wIn, Cache.CacheIn, sizeof(Cache.CacheIn)) == 0) {
401 memcpy(wOut, Cache.CacheOut, sizeof(Cache.CacheOut))
    [all...]

Completed in 1337 milliseconds

1 23 4 5 6 7 8 91011>>