Home
last modified time | relevance | path

Searched refs:TKey (Results 1 – 4 of 4) sorted by relevance

/system/core/libutils/include/utils/
DLruCache.h37 template <typename TKey, typename TValue>
47 void setOnEntryRemovedListener(OnEntryRemoved<TKey, TValue>* listener);
49 const TValue& get(const TKey& key);
50 bool put(const TKey& key, const TValue& value);
51 bool remove(const TKey& key);
62 virtual const TKey& getKey() const = 0;
69 TKey key;
74 … Entry(TKey _key, TValue _value) : key(_key), value(_value), parent(nullptr), child(nullptr) { in Entry()
76 const TKey& getKey() const final { return key; } in getKey()
81 const TKey& key;
[all …]
DTypeHelpers.h299 template <typename TKey>
300 hash_t hash_type(const TKey& key);
/system/core/logd/
DLogStatistics.h63 template <typename TKey, typename TEntry>
65 std::unordered_map<TKey, TEntry> map;
94 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator;
96 typename std::unordered_map<TKey, TEntry>::const_iterator const_iterator;
101 void MaxEntries(uid_t uid, pid_t pid, std::array<const TKey*, len>& out_keys, in MaxEntries() argument
132 memmove(&out_keys[index + 1], &out_keys[index], num * sizeof(const TKey*)); in MaxEntries()
142 iterator Add(const TKey& key, const LogStatisticsElement& element) { in Add()
152 iterator Add(const TKey& key) { in Add()
162 void Subtract(const TKey& key, const LogStatisticsElement& element) { in Subtract()
169 void Drop(const TKey& key, const LogStatisticsElement& element) { in Drop()
[all …]
DLogStatistics.cpp390 template <typename TKey, typename TEntry>
391 void LogStatistics::WorstTwoWithThreshold(const LogHashtable<TKey, TEntry>& table, size_t threshold, in WorstTwoWithThreshold() argument
394 std::array<const TKey*, 2> max_keys; in WorstTwoWithThreshold()
767 template <typename TKey, typename TEntry>
768 std::string LogStatistics::FormatTable(const LogHashtable<TKey, TEntry>& table, uid_t uid, in FormatTable() argument
773 std::array<const TKey*, maximum_sorted_entries> sorted_keys; in FormatTable()