| /external/llvm/include/llvm/IR/ |
| ValueMap.h | 20 // parameters should inherit from ValueMapConfig<KeyT> to get default
37 template<typename KeyT, typename ValueT, typename Config>
40 template<typename DenseMapT, typename KeyT>
42 template<typename DenseMapT, typename KeyT>
48 template<typename KeyT, typename MutexT = sys::Mutex>
63 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {}
65 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {}
76 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
[all...] |
| Module.h | 36 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
|
| /external/llvm/include/llvm/ADT/ |
| MapVector.h | 28 template<typename KeyT, typename ValueT,
29 typename MapType = llvm::DenseMap<KeyT, unsigned>,
30 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
65 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
66 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
67 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
68 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
75 ValueT &operator[](const KeyT &Key) {
76 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
86 ValueT lookup(const KeyT &Key) const
[all...] |
| IntervalMap.h | 12 // KeyT objects are mapped to ValT objects. Intervals of keys that map to the
38 // template <typename KeyT, typename ValT, unsigned N, typename Traits>
41 // typedef KeyT key_type;
51 // KeyT start() const;
52 // KeyT stop() const;
53 // ValT lookup(KeyT x, Value NotFound = Value()) const;
59 // const_iterator find(KeyT x) const;
60 // iterator find(KeyT x);
62 // void insert(KeyT a, KeyT b, ValT y)
[all...] |
| SparseSet.h | 63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
70 /// SparseSetValFunctor<KeyT, KeyT> - Helper class for the common case of
72 template<typename KeyT, typename KeyFunctorT>
73 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
74 unsigned operator()(const KeyT &Key) const {
114 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
125 typedef typename KeyFunctorT::argument_type KeyT;
132 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf
[all...] |
| DenseMap.h | 34 template<typename KeyT, typename ValueT,
35 typename KeyInfoT = DenseMapInfo<KeyT>,
40 typename KeyT, typename ValueT, typename KeyInfoT>
43 typedef std::pair<KeyT, ValueT> BucketT;
47 typedef KeyT key_type;
51 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
52 typedef DenseMapIterator<KeyT, ValueT,
89 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
104 size_type count(const KeyT &Val) const {
109 iterator find(const KeyT &Val)
[all...] |
| ImmutableMap.h | 59 template <typename KeyT, typename ValT,
60 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
215 typedef typename ImmutableMap<KeyT,ValT,ValInfo>::value_type value_type;
216 typedef typename ImmutableMap<KeyT,ValT,ValInfo>::value_type_ref reference;
270 template <typename KeyT, typename ValT,
271 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
298 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X,
299 typename ImmutableMap<KeyT, ValT>::Factory &F)
356 ImmutableMap<KeyT, ValT> asImmutableMap() const {
357 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root))
[all...] |
| SparseMultiSet.h | 72 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
113 typedef typename KeyFunctorT::argument_type KeyT;
119 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
371 iterator find(const KeyT &Key) {
375 const_iterator find(const KeyT &Key) const {
382 size_type count(const KeyT &Key) const {
391 bool contains(const KeyT &Key) const {
396 iterator getHead(const KeyT &Key) { return find(Key); }
397 iterator getTail(const KeyT &Key) {
407 RangePair equal_range(const KeyT &K)
[all...] |
| /frameworks/av/include/camera/ |
| CameraParameters2.h | 116 template <typename KeyT, typename ValueT>
119 ssize_t add(const KeyT& key, const ValueT& value) {
127 const KeyT& keyAt(size_t idx) const {
135 const ValueT& valueFor(const KeyT& key) const {
142 ssize_t indexOfKey(const KeyT& key) const {
153 ssize_t removeItem(const KeyT& key) {
168 ssize_t replaceValueFor(const KeyT& key, const ValueT& value) {
177 Pair(const KeyT& key, const ValueT& value) :
180 KeyT mKey;
|
| /external/llvm/unittests/IR/ |
| ValueMapTest.cpp | 180 template<typename KeyT, typename MutexT>
181 struct LockMutex : ValueMapConfig<KeyT, MutexT> {
187 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) {
191 static void onDelete(const ExtraData &Data, KeyT Old) {
212 template<typename KeyT>
213 struct NoFollow : ValueMapConfig<KeyT> {
234 template<typename KeyT>
235 struct CountOps : ValueMapConfig<KeyT> {
241 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New)
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 54 template<class KeyT, class ValueT>
57 typedef DenseMap<KeyT, size_t> MapTy;
60 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
88 ValueT &operator[](const KeyT &Arg) {
101 insert(const std::pair<KeyT, ValueT> &InsertPair) {
113 iterator find(const KeyT &Key) {
119 const_iterator find(const KeyT &Key) const {
128 void blot(const KeyT &Key) {
131 Vector[It->second].first = KeyT();
[all...] |
| /external/chromium_org/ui/keyboard/resources/elements/ |
| kb-key-codes.js | 104 't': {keyCode: 0x54, keyName: 'KeyT', shiftModifier: false},
105 'T': {keyCode: 0x54, keyName: 'KeyT', shiftModifier: true},
|
| /external/clang/lib/Sema/ |
| SemaExprObjC.cpp | [all...] |
