| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 38 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
40 typedef DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
41 detail::DenseSetPair<ValueT>> MapTy;
42 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT),
46 typedef ValueT key_type;
47 typedef ValueT value_type;
65 size_type count(const ValueT &V) const {
69 bool erase(const ValueT &V) {
84 typedef ValueT value_type
[all...] |
| SparseSet.h | 34 /// directly compares ValueT, only their indices, so it can map keys to
50 /// For best results, ValueT should not require a destructor.
52 template<typename ValueT>
54 static unsigned getValIndex(const ValueT &Val) {
60 /// generic implementation handles ValueT classes which either provide
63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
65 unsigned operator()(const ValueT &Val) const {
66 return SparseSetValTraits<ValueT>::getValIndex(Val);
113 /// @tparam ValueT The type of objects in the set.
117 template<typename ValueT,
[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>,
49 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false
[all...] |
| MapVector.h | 29 template<typename KeyT, typename ValueT,
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) {
80 Vector.push_back(std::make_pair(Key, ValueT()));
86 ValueT lookup(const KeyT &Key) const {
88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second
[all...] |
| SparseMultiSet.h | 71 /// @tparam ValueT The type of objects in the set.
75 template<typename ValueT,
92 ValueT Data;
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
119 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
127 unsigned sparseIndex(const ValueT &Val) const {
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
183 typedef ValueT value_type;
184 typedef ValueT &reference;
185 typedef const ValueT &const_reference
[all...] |
| Hashing.h | 446 template <typename ValueT>
447 typename std::enable_if<is_hashable_data<ValueT>::value, hash_code>::type
448 hash_combine_range_impl(ValueT *first, ValueT *last) {
|
| StringMap.h | 23 template<typename ValueT>
25 template<typename ValueT>
|
| /frameworks/av/include/camera/ |
| CameraParameters2.h | 116 template <typename KeyT, typename ValueT>
119 ssize_t add(const KeyT& key, const ValueT& value) {
131 const ValueT& valueAt(size_t idx) const {
135 const ValueT& valueFor(const KeyT& key) const {
168 ssize_t replaceValueFor(const KeyT& key, const ValueT& value) {
177 Pair(const KeyT& key, const ValueT& value) :
181 ValueT mValue;
|
| /external/llvm/include/llvm/IR/ |
| ValueMap.h | 40 template<typename KeyT, typename ValueT, typename Config>
79 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
81 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
82 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
83 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH> > MapT;
93 typedef ValueT mapped_type;
94 typedef std::pair<KeyT, ValueT> value_type;
141 ValueT lookup(const KeyT &Val) const {
143 return I != Map.end() ? I->second : ValueT();
149 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| CostAllocator.h | 28 template <typename ValueT>
31 typedef std::shared_ptr<const ValueT> PoolRef;
41 const ValueT& getValue() const { return Value; }
44 ValueT Value;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| BlotMapVector.h | 17 template <class KeyT, class ValueT> class BlotMapVector {
22 typedef std::vector<std::pair<KeyT, ValueT>> VectorTy;
49 ValueT &operator[](const KeyT &Arg) {
55 Vector.push_back(std::make_pair(Arg, ValueT()));
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) {
|
| /external/llvm/include/llvm/Support/ |
| YAMLParser.h | 271 /// BaseT must have a ValueT* member named CurrentEntry and a member function
273 template <class BaseT, class ValueT>
275 : public std::iterator<std::forward_iterator_tag, ValueT> {
280 ValueT *operator->() const {
285 ValueT &operator*() const {
291 operator ValueT *() const {
|
| /external/llvm/unittests/ADT/ |
| TinyPtrVectorTest.cpp | 39 typedef typename std::remove_pointer<PtrT>::type ValueT;
44 ValueT TestValues[1024];
|
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | [all...] |
| ASTMatchers.h | [all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| concept_check.hpp | 529 BOOST_concept(OutputIterator,(TT)(ValueT))
540 ValueT t;
|
| /external/clang/lib/Sema/ |
| SemaExprObjC.cpp | [all...] |
| /external/clang/include/clang/Sema/ |
| Sema.h | 58 template <typename ValueT> struct DenseMapInfo;
59 template <typename ValueT, typename ValueInfoT> class DenseSet;
[all...] |
