| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 25 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
27 typedef DenseMap<ValueT, char, ValueInfoT> MapTy;
30 typedef ValueT key_type;
31 typedef ValueT value_type;
49 size_type count(const ValueT &V) const {
53 bool erase(const ValueT &V) {
68 typedef ValueT value_type;
75 ValueT& operator*() { return I->first; }
76 ValueT* operator->() { return &I->first;
[all...] |
| MapVector.h | 28 template<typename KeyT, typename ValueT,
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) {
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...] |
| DenseMap.h | 34 template<typename KeyT, typename ValueT,
40 typename KeyT, typename ValueT, typename KeyInfoT>
43 typedef std::pair<KeyT, ValueT> BucketT;
48 typedef ValueT mapped_type;
51 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
52 typedef DenseMapIterator<KeyT, ValueT,
93 P->second.~ValueT();
144 ValueT lookup(const KeyT &Val) const {
148 return ValueT();
154 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[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...] |
| 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...] |
| StringMap.h | 23 template<typename ValueT>
25 template<typename ValueT>
|
| Hashing.h | 452 template <typename ValueT>
453 typename std::enable_if<is_hashable_data<ValueT>::value, hash_code>::type
454 hash_combine_range_impl(ValueT *first, ValueT *last) {
|
| /external/llvm/include/llvm/IR/ |
| ValueMap.h | 37 template<typename KeyT, typename ValueT, typename Config>
76 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
78 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
79 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
80 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH> > MapT;
88 typedef ValueT mapped_type;
89 typedef std::pair<KeyT, ValueT> value_type;
128 ValueT lookup(const KeyT &Val) const {
130 return I != Map.end() ? I->second : ValueT();
136 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| Module.h | 36 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
|
| /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/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| addressmap_unittest.cc | 62 typedef pair<int, size_t> ValueT;
70 size_t SizeFunc(const ValueT& v) { return v.second; }
72 static void SetCheckCallback(const void* ptr, ValueT* val,
95 AddressMap<ValueT> map(malloc, free);
96 const ValueT* result;
119 ValueT removed;
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| addressmap_unittest.cc | 62 typedef pair<int, size_t> ValueT;
70 size_t SizeFunc(const ValueT& v) { return v.second; }
72 static void SetCheckCallback(const void* ptr, ValueT* val,
95 AddressMap<ValueT> map(malloc, free);
96 const ValueT* result;
119 ValueT removed;
|
| /external/llvm/include/llvm/Support/ |
| YAMLParser.h | 273 /// BaseT must have a ValueT* member named CurrentEntry and a member function
275 template <class BaseT, class ValueT>
277 : public std::iterator<std::forward_iterator_tag, ValueT> {
282 ValueT *operator->() const {
287 ValueT &operator*() const {
293 operator ValueT *() const {
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAGInstrs.h | 64 /// compares ValueT's, only unsigned keys. This allows the set to be cleared
65 /// between scheduling regions in constant time as long as ValueT does not
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/tests/ |
| v8-raytrace.html | [all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
| prototype-1.6.0.3.js | [all...] |
| concat-jquery-mootools-prototype.js | [all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/ |
| prototype-1.7.js | [all...] |
| /external/llvm/unittests/ADT/ |
| TinyPtrVectorTest.cpp | 39 typedef typename std::remove_pointer<PtrT>::type ValueT;
44 ValueT TestValues[1024];
|
| /external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA2/ |
| SDL_main.cpp | 618 const TInt valuet = gEpocEnv->iAppSrv->RequestValue(aService); local
619 gEpocEnv->iAppSrv->HandleObserverValue(aService, valuet, EFalse);
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| concept_check.hpp | 529 BOOST_concept(OutputIterator,(TT)(ValueT))
540 ValueT t;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 54 template<class KeyT, class ValueT>
60 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
88 ValueT &operator[](const KeyT &Arg) {
94 Vector.push_back(std::make_pair(Arg, ValueT()));
101 insert(const std::pair<KeyT, ValueT> &InsertPair) {
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | [all...] |
| ASTMatchers.h | [all...] |
| /external/clang/lib/Sema/ |
| SemaExprObjC.cpp | [all...] |
