Searched refs:KeyT (Results 1 - 10 of 10) sorted by relevance

/freebsd-10-stable/contrib/llvm/include/llvm/ADT/
H A DValueMap.h20 // 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>
61 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {}
63 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {}
74 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
[all...]
H A DMapVector.h30 template<typename KeyT, typename ValueT,
31 typename MapType = llvm::DenseMap<KeyT, unsigned>,
32 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
67 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
68 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
69 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
70 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
77 ValueT &operator[](const KeyT &Key) {
78 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
88 ValueT lookup(const KeyT
[all...]
H A DSparseSet.h63 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.
121 typedef typename KeyFunctorT::argument_type KeyT; typedef in class:llvm::SparseSet
127 SparseSetValFunctor<KeyT, Value
[all...]
H A DDenseMap.h34 template<typename KeyT, typename ValueT,
35 typename KeyInfoT = DenseMapInfo<KeyT>,
40 typename KeyT, typename ValueT, typename KeyInfoT>
43 typedef std::pair<KeyT, ValueT> BucketT;
46 typedef KeyT key_type;
50 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
51 typedef DenseMapIterator<KeyT, ValueT,
88 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
103 bool count(const KeyT &Val) const {
108 iterator find(const KeyT
[all...]
H A DIntervalMap.h12 // 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
[all...]
H A DImmutableMap.h59 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, Val
[all...]
H A DSparseMultiSet.h72 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
109 typedef typename KeyFunctorT::argument_type KeyT; typedef in class:llvm::SparseMultiSet
115 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
379 iterator find(const KeyT &Key) {
383 const_iterator find(const KeyT &Key) const {
390 unsigned count(const KeyT &Key) const {
399 bool contains(const KeyT &Key) const {
404 iterator getHead(const KeyT &Key) { return find(Key); }
405 iterator getTail(const KeyT &Key) {
415 RangePair equal_range(const KeyT
[all...]
/freebsd-10-stable/contrib/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp53 template<class KeyT, class ValueT>
56 typedef DenseMap<KeyT, size_t> MapTy;
59 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
87 ValueT &operator[](const KeyT &Arg) {
100 insert(const std::pair<KeyT, ValueT> &InsertPair) {
112 iterator find(const KeyT &Key) {
118 const_iterator find(const KeyT &Key) const {
127 void blot(const KeyT &Key) {
130 Vector[It->second].first = KeyT();
/freebsd-10-stable/contrib/llvm/include/llvm/IR/
H A DModule.h33 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
/freebsd-10-stable/contrib/llvm/tools/clang/lib/Sema/
H A DSemaExprObjC.cpp834 QualType KeyT = Method->param_begin()[1]->getType(); local
835 const PointerType *PtrKey = KeyT->getAs<PointerType>();
862 << 1 << KeyT
887 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); local
895 KeyT);

Completed in 284 milliseconds