/art/runtime/base/ |
D | hash_map.h | 30 template <class Key, class Value> 31 size_t operator()(const std::pair<Key, Value>& pair) const { in operator() 34 template <class Key> 35 size_t operator()(const Key& key) const { in operator() 38 template <class Key, class Value> 39 bool operator()(const std::pair<Key, Value>& a, const std::pair<Key, Value>& b) const { in operator() 42 template <class Key, class Value, class Element> 43 bool operator()(const std::pair<Key, Value>& a, const Element& element) const { in operator() 51 template <class Key, class Value, class EmptyFn, 52 class HashFn = std::hash<Key>, class Pred = std::equal_to<Key>, [all …]
|
D | allocator.h | 159 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>> 161 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>>; 163 template<class Key, AllocatorTag kTag, class Compare = std::less<Key>> 164 using AllocationTrackingSet = std::set<Key, Compare, TrackingAllocator<Key, kTag>>; 166 template<class Key, 169 class Hash = std::hash<Key>, 170 class Pred = std::equal_to<Key>> 172 Key, T, Hash, Pred, TrackingAllocator<std::pair<const Key, T>, kTag>>; 174 template<class Key, 178 class Hash = std::hash<Key>, [all …]
|
D | arena_containers.h | 77 template <typename Key, 79 typename EmptyFn = DefaultEmptyFn<std::pair<Key, Value>>, 80 typename HashFn = std::hash<Key>, 81 typename Pred = std::equal_to<Key>> 82 using ArenaHashMap = HashMap<Key, 87 ArenaAllocatorAdapter<std::pair<Key, Value>>>; 89 template <typename Key, 91 typename Hash = std::hash<Key>, 93 using ArenaUnorderedMap = std::unordered_map<Key, 97 ArenaAllocatorAdapter<std::pair<const Key, Value>>>;
|
D | variant_map_test.cc | 37 using Key = FruitMapKey<TValue>; typedef 39 static const Key<int> Apple; 40 static const Key<double> Orange; 41 static const Key<std::string> Label; 44 const FruitMap::Key<int> FruitMap::Apple; 45 const FruitMap::Key<double> FruitMap::Orange; 46 const FruitMap::Key<std::string> FruitMap::Label;
|
D | variant_map.h | 215 using Key = TKey<TValue>; member
|
/art/compiler/utils/ |
D | dedupe_set-inl.h | 65 DCHECK(key.Key() != nullptr); 66 alloc_.Destroy(key.Key()); 75 DCHECK(it->Key() != nullptr); 76 return it->Key(); 122 const T* Key() const { 127 return Key() == nullptr; 160 DCHECK(lhs.Key() != nullptr); 161 DCHECK(rhs.Key() != nullptr); 163 return lhs.Key() == rhs.Key(); 168 DCHECK(lhs.Key() != nullptr); [all …]
|
/art/runtime/ |
D | runtime_options.h | 45 #define DECLARE_KEY(Type, Name) static const Key<Type> Name 72 using Key = RuntimeArgumentMapKey<TValue>; member 75 #define RUNTIME_OPTIONS_KEY(Type, Name, ...) static const Key<Type> (Name);
|
D | runtime_options.cc | 33 #define RUNTIME_OPTIONS_KEY(Type, Name, ...) const RuntimeArgumentMap::Key<Type> RuntimeArgumentMap…
|
D | safe_map.h | 170 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>> 172 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>> {
|
D | parsed_options.h | 46 using RuntimeParser = CmdlineParser<RuntimeArgumentMap, RuntimeArgumentMap::Key>;
|
D | runtime_options.def | 27 // <<Type>> <<Key Name>> <<Default Value>>
|
D | parsed_options.cc | 54 using RuntimeParser = CmdlineParser<RuntimeArgumentMap, RuntimeArgumentMap::Key>;
|
/art/tools/ahat/src/heapdump/ |
D | Diff.java | 79 private static class Key { class in Diff 99 private Key(AhatInstance inst) { in Key() method in Diff.Key 112 public static Key keyFor(AhatInstance inst) { in keyFor() 113 return new Key(inst); in keyFor() 118 if (!(other instanceof Key)) { in equals() 121 Key o = (Key)other; in equals() 192 Map<Key, InstanceListPair> byKey = new HashMap<Key, InstanceListPair>(); in instances() 194 Key key = Key.keyFor(inst); in instances() 203 Key key = Key.keyFor(inst); in instances()
|
/art/cmdline/ |
D | README.md | 28 static const Key<int> Apple; 29 static const Key<double> Orange; 30 static const Key<bool> Help; 35 using FruitParser = CmdlineParser<FruitVariantMap, FruitVariantMap::Key>;
|