| /external/llvm/include/llvm/IR/ |
| ValueMap.h | 20 // parameters should inherit from ValueMapConfig<KeyT> to get default
40 template<typename KeyT, typename ValueT, typename Config>
43 template<typename DenseMapT, typename KeyT>
45 template<typename DenseMapT, typename KeyT>
51 template<typename KeyT, typename MutexT = sys::Mutex>
66 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {}
68 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {}
79 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
[all...] |
| /external/llvm/include/llvm/ADT/ |
| MapVector.h | 29 template<typename KeyT, typename ValueT,
30 typename MapType = llvm::DenseMap<KeyT, unsigned>,
31 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
60 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
61 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
62 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
63 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...] |
| DenseMap.h | 38 template <typename KeyT, typename ValueT>
39 struct DenseMapPair : public std::pair<KeyT, ValueT> {
40 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; }
41 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; }
42 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; }
43 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; }
48 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
[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...] |
| DenseSet.h | 26 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
27 KeyT key;
30 KeyT &getFirst() { return key; }
31 const KeyT &getFirst() const { return key; }
133 /// getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key type
|
| 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...] |
| ImmutableMap.h | 59 template <typename KeyT, typename ValT,
60 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
251 template <typename KeyT, typename ValT,
252 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
279 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X,
280 typename ImmutableMap<KeyT, ValT>::Factory &F)
337 ImmutableMap<KeyT, ValT> asImmutableMap() const {
338 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root));
|
| /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/lib/Transforms/ObjCARC/ |
| BlotMapVector.h | 17 template <class KeyT, class ValueT> class BlotMapVector {
19 typedef DenseMap<KeyT, size_t> MapTy;
22 typedef std::vector<std::pair<KeyT, ValueT>> VectorTy;
49 ValueT &operator[](const KeyT &Arg) {
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) {
73 iterator find(const KeyT &Key) {
80 const_iterator find(const KeyT &Key) const {
90 void blot(const KeyT &Key) {
94 Vector[It->second].first = KeyT();
|
| /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) {
213 template<typename KeyT>
214 struct NoFollow : ValueMapConfig<KeyT> {
235 template<typename KeyT>
236 struct CountOps : ValueMapConfig<KeyT> {
242 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New)
[all...] |
| /external/llvm/tools/dsymutil/ |
| DwarfLinker.cpp | 55 template <typename KeyT, typename ValT>
57 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
58 IntervalMapHalfOpenInfo<KeyT>>;
[all...] |
| /external/clang/lib/Sema/ |
| SemaExprObjC.cpp | [all...] |
