HomeSort by relevance Sort by last modified time
    Searched defs:Entry (Results 226 - 250 of 1665) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/tensorflow/tensorflow/core/platform/cloud/
expiring_lru_cache.h 44 /// Insert `value` with key `key`. This will replace any previous entry with
54 /// Look up the entry with key `key` and copy it to `value` if found. Returns
55 /// true if an entry was found for `key`, and its timestamp is not more than
67 /// Look up the entry with key `key` and copy it to `value` if found. If not
103 struct Entry {
104 /// The timestamp (seconds) at which the entry was added to the cache.
107 /// The entry's value.
110 /// A list iterator pointing to the entry's position in the LRU list.
133 Entry entry{env_->NowSeconds(), value, lru_list_.begin()}
    [all...]
  /external/volley/src/main/java/com/android/volley/
Cache.java 28 * Retrieves an entry from the cache.
30 * @return An {@link Entry} or null in the event of a cache miss
32 Entry get(String key);
35 * Adds or replaces an entry to the cache.
37 * @param entry Data to store and metadata for cache coherency, TTL, etc.
39 void put(String key, Entry entry);
48 * Invalidates an entry in the cache.
50 * @param fullExpire True to fully expire the entry, false to soft expire
55 * Removes an entry from the cache
    [all...]
  /frameworks/base/services/core/java/com/android/server/am/
LaunchTimeTracker.java 30 private final SparseArray<Entry> mWindowingModeLaunchTime = new SparseArray<>();
33 Entry entry = mWindowingModeLaunchTime.get(r.getWindowingMode()); local
34 if (entry == null){
35 entry = new Entry();
36 mWindowingModeLaunchTime.append(r.getWindowingMode(), entry); local
38 entry.setLaunchTime(r);
42 final Entry entry = mWindowingModeLaunchTime.get(windowingMode) local
    [all...]
  /frameworks/base/tools/aapt2/
StringPool.h 72 class Entry;
92 explicit Ref(Entry* entry);
94 Entry* entry_;
117 explicit StyleRef(StyleEntry* entry);
122 class Entry {
188 inline const std::vector<std::unique_ptr<Entry>>& strings() const {
216 std::vector<std::unique_ptr<Entry>> strings_;
218 std::unordered_multimap<android::StringPiece, Entry*> indexed_strings_;
  /frameworks/compile/mclinker/include/mcld/ADT/
HashBase.h 26 * \brief HashBucket is an entry in the hash table.
35 entry_type* Entry;
  /frameworks/compile/mclinker/include/mcld/Target/
ELFDynamic.h 27 * \brief EntryIF provides a common interface for one entry in the dynamic
47 class Entry {};
50 class Entry<32, true> : public EntryIF {
58 inline Entry();
60 inline ~Entry();
62 Entry* clone() const { return new Entry(); }
81 class Entry<64, true> : public EntryIF {
89 inline Entry();
91 inline ~Entry();
    [all...]
  /hardware/libhardware/modules/camera/3_0/
VendorTags.cpp 37 // Describes a single vendor tag entry
38 struct Entry {
47 const Entry* tags;
50 // Entry arrays for each section
51 const Entry DemoWizardry[demo_wizardry_end - demo_wizardry_start] = {
62 const Entry DemoSorcery[demo_sorcery_end - demo_sorcery_start] = {
69 const Entry DemoMagic[demo_magic_end - demo_magic_start] = {
110 // Get a static handle to a specific vendor tag entry
111 const Entry* getEntry(uint32_t tag)
176 const Entry* entry = getEntry(tag) local
186 const Entry* entry = getEntry(tag); local
    [all...]
  /packages/apps/Gallery/src/com/android/camera/gallery/
LruCache.java 28 private final HashMap<K, Entry<K, V>> mWeakMap =
29 new HashMap<K, Entry<K, V>>();
36 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
42 private static class Entry<K, V> extends WeakReference<V> {
45 public Entry(K key, V value, ReferenceQueue<V> queue) {
53 Entry<K, V> entry = (Entry<K, V>) mQueue.poll(); local
54 while (entry != null) {
55 mWeakMap.remove(entry.mKey)
63 Entry<K, V> entry = mWeakMap.put( local
    [all...]
  /packages/apps/Gallery2/gallerycommon/src/com/android/gallery3d/common/
LruCache.java 32 private final HashMap<K, Entry<K, V>> mWeakMap =
33 new HashMap<K, Entry<K, V>>();
40 protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {
46 private static class Entry<K, V> extends WeakReference<V> {
49 public Entry(K key, V value, ReferenceQueue<V> queue) {
57 Entry<K, V> entry = (Entry<K, V>) mQueue.poll(); local
58 while (entry != null) {
59 mWeakMap.remove(entry.mKey)
72 Entry<K, V> entry = mWeakMap.put( local
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/
ConstantHoisting.h 101 BasicBlock &Entry);
115 BasicBlock *Entry;
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/
ConstantHoisting.h 101 BasicBlock &Entry);
115 BasicBlock *Entry;
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/DebugInfo/CodeView/
DebugInlineeLinesSubsection.h 86 struct Entry {
107 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
108 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
114 std::vector<Entry> Entries;
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Scalar/
ConstantHoisting.h 115 BlockFrequencyInfo *BFI, BasicBlock &Entry);
130 BasicBlock *Entry;

Completed in 1123 milliseconds

1 2 3 4 5 6 7 8 91011>>