| /external/libcxx/test/std/iterators/iterator.primitives/iterator.traits/ |
| const_pointer.pass.cpp | 29 typedef std::iterator_traits<const A*> It;
30 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), "");
31 static_assert((std::is_same<It::value_type, A>::value), "");
32 static_assert((std::is_same<It::pointer, const A*>::value), "");
33 static_assert((std::is_same<It::reference, const A&>::value), "");
34 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
| const_volatile_pointer.pass.cpp | 22 typedef std::iterator_traits<const volatile A*> It;
23 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), "");
24 static_assert((std::is_same<It::value_type, A>::value), "");
25 static_assert((std::is_same<It::pointer, const volatile A*>::value), "");
26 static_assert((std::is_same<It::reference, const volatile A&>::value), "");
27 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
| pointer.pass.cpp | 29 typedef std::iterator_traits<A*> It;
30 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), "");
31 static_assert((std::is_same<It::value_type, A>::value), "");
32 static_assert((std::is_same<It::pointer, A*>::value), "");
33 static_assert((std::is_same<It::reference, A&>::value), "");
34 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
| volatile_pointer.pass.cpp | 22 typedef std::iterator_traits<volatile A*> It;
23 static_assert((std::is_same<It::difference_type, std::ptrdiff_t>::value), "");
24 static_assert((std::is_same<It::value_type, A>::value), "");
25 static_assert((std::is_same<It::pointer, volatile A*>::value), "");
26 static_assert((std::is_same<It::reference, volatile A&>::value), "");
27 static_assert((std::is_same<It::iterator_category, std::random_access_iterator_tag>::value), "");
|
| empty.pass.cpp | 36 typedef std::iterator_traits<not_an_iterator> It;
37 static_assert(!(has_value_type<It>::value), "");
|
| iterator.pass.cpp | 38 typedef std::iterator_traits<test_iterator> It;
39 static_assert((std::is_same<It::difference_type, int>::value), "");
40 static_assert((std::is_same<It::value_type, A>::value), "");
41 static_assert((std::is_same<It::pointer, A*>::value), "");
42 static_assert((std::is_same<It::reference, A&>::value), "");
43 static_assert((std::is_same<It::iterator_category, std::forward_iterator_tag>::value), "");
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-xray/ |
| xray-registry.cpp | 34 auto It = Commands->find(SC);
35 assert(It != Commands->end() &&
37 return It->second;
|
| func-id-helper.cpp | 27 auto It = FunctionAddresses.find(FuncId);
28 if (It == FunctionAddresses.end()) {
33 if (auto ResOrErr = Symbolizer.symbolizeCode(BinaryInstrMap, It->second)) {
36 F << "@(" << std::hex << It->second << ")";
41 F << "@(" << std::hex << It->second << ")";
50 auto It = FunctionAddresses.find(FuncId);
51 if (It == FunctionAddresses.end())
55 auto ResOrErr = Symbolizer.symbolizeCode(BinaryInstrMap, It->second);
|
| /external/libcxx/test/std/iterators/iterator.primitives/iterator.basic/ |
| iterator.pass.cpp | 32 typedef std::iterator<std::forward_iterator_tag, T> It;
33 static_assert((std::is_same<typename It::value_type, T>::value), "");
34 static_assert((std::is_same<typename It::difference_type, std::ptrdiff_t>::value), "");
35 static_assert((std::is_same<typename It::pointer, T*>::value), "");
36 static_assert((std::is_same<typename It::reference, T&>::value), "");
37 static_assert((std::is_same<typename It::iterator_category, std::forward_iterator_tag>::value), "");
44 typedef std::iterator<std::bidirectional_iterator_tag, T, short> It;
45 static_assert((std::is_same<typename It::value_type, T>::value), "");
46 static_assert((std::is_same<typename It::difference_type, short>::value), "");
47 static_assert((std::is_same<typename It::pointer, T*>::value), "")
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| BreadthFirstIteratorTest.cpp | 26 auto It = BFIter::begin(G);
28 EXPECT_EQ(It.getLevel(), 0U);
29 EXPECT_EQ(*It, G.AccessNode(0));
30 ++It;
31 EXPECT_EQ(It.getLevel(), 1U);
32 EXPECT_EQ(*It, G.AccessNode(1));
33 ++It;
34 EXPECT_EQ(It.getLevel(), 1U);
35 EXPECT_EQ(*It, G.AccessNode(2));
36 ++It;
[all...] |
| /external/libcxx/test/std/containers/associative/ |
| iterator_types.pass.cpp | 23 typedef typename Map::iterator It;
24 static_assert((std::is_same<typename It::value_type, ValueTp>::value), "");
25 static_assert((std::is_same<typename It::reference, ValueTp&>::value), "");
26 static_assert((std::is_same<typename It::pointer, PtrT>::value), "");
27 static_assert((std::is_same<typename It::difference_type, Diff>::value), "");
30 typedef typename Map::const_iterator It;
31 static_assert((std::is_same<typename It::value_type, ValueTp>::value), "");
32 static_assert((std::is_same<typename It::reference, ValueTp const&>::value), "");
33 static_assert((std::is_same<typename It::pointer, CPtrT>::value), "");
34 static_assert((std::is_same<typename It::difference_type, Diff>::value), "")
[all...] |
| /external/libcxx/test/std/containers/unord/ |
| iterator_difference_type.pass.cpp | 23 typedef typename Map::iterator It;
24 static_assert((std::is_same<typename It::value_type, ValueTp>::value), "");
25 static_assert((std::is_same<typename It::reference, ValueTp&>::value), "");
26 static_assert((std::is_same<typename It::pointer, PtrT>::value), "");
27 static_assert((std::is_same<typename It::difference_type, Diff>::value), "");
30 typedef typename Map::const_iterator It;
31 static_assert((std::is_same<typename It::value_type, ValueTp>::value), "");
32 static_assert((std::is_same<typename It::reference, ValueTp const&>::value), "");
33 static_assert((std::is_same<typename It::pointer, CPtrT>::value), "");
34 static_assert((std::is_same<typename It::difference_type, Diff>::value), "")
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| RegisterUsageInfo.cpp | 67 auto It = RegMasks.find(&FP);
68 if (It != RegMasks.end())
69 return makeArrayRef<uint32_t>(It->second);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-mca/ |
| CodeRegion.cpp | 57 const auto It =
62 if (It != Regions.rend())
63 (*It)->addInstruction(std::move(Instruction));
|
| FetchStage.cpp | 36 const InstMap::iterator It =
42 if (It != Instructions.begin())
43 Instructions.erase(Instructions.begin(), It);
|
| /external/clang/test/SemaTemplate/ |
| overload-uneval.cpp | 28 class It
34 inline bool operator!=(const It &o) const { return i !=
40 Wibble<void*>::It a, b;
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iterator/ |
| types.pass.cpp | 41 template <class It>
45 typedef std::move_iterator<It> R;
46 typedef std::iterator_traits<It> T;
47 static_assert((std::is_same<typename R::iterator_type, It>::value), "");
49 static_assert((std::is_same<typename R::pointer, It>::value), "");
69 typedef std::move_iterator<T> It;
70 static_assert(std::is_same<It::reference, int>::value, "");
74 typedef std::move_iterator<T> It;
75 static_assert(std::is_same<It::reference, std::reference_wrapper<int> >::value, "");
78 // Check that move_iterator uses whatever reference type it's give
[all...] |
| /external/libcxx/test/std/strings/basic.string/string.modifiers/string_append/ |
| iterator.pass.cpp | 21 template <class S, class It>
23 test(S s, It first, It last, S expected)
31 template <class S, class It>
33 test_exceptions(S s, It first, It last)
208 typedef forward_iterator<const char*> It;
209 typedef std::move_iterator<It> MoveIt;
212 s.append(MoveIt(It(std::begin(p))), MoveIt(It(std::end(p) - 1)))
[all...] |
| /external/llvm/include/llvm/Support/ |
| Options.h | 112 auto It = Options.find(&detail::OptionKey<ValT, Base, Mem>::ID);
113 assert(It != Options.end() && "Option not in OptionRegistry");
114 return *(cl::opt<ValT> *)It->second;
|
| /external/llvm/lib/Analysis/ |
| ProfileSummaryInfo.cpp | 31 cl::desc("A count is hot if it exceeds the minimum count to"
36 cl::desc("A count is cold if it is below the minimum count"
45 auto It = std::lower_bound(DS.begin(), DS.end(), Percentile, Compare);
48 if (It == DS.end())
50 return It->MinCount;
56 // available in the module and parses it to get the Summary object.
66 // Returns true if the function is a hot function. If it returns false, it
67 // either means it is not hot or it is unknown whether F is hot or not (fo
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstCombineWorklist.h | 36 /// Add - Add the specified instruction to the worklist if it isn't already
37 /// in it.
65 // Remove - remove I from the worklist if it exists.
67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
68 if (It == WorklistMap.end()) return; // Not in worklist.
71 Worklist[It->second] = 0;
73 WorklistMap.erase(It);
95 /// the map if it is large.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/GlobalISel/ |
| GISelWorkList.h | 24 // FIXME: Does it make sense to factor out common code with the instcombinerWorkList?
37 /// Add - Add the specified instruction to the worklist if it isn't already
38 /// in it.
45 /// Remove - remove I from the worklist if it exists.
47 auto It = WorklistMap.find(I);
48 if (It == WorklistMap.end()) return; // Not in worklist.
51 Worklist[It->second] = nullptr;
53 WorklistMap.erase(It);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| Options.h | 112 auto It = Options.find(&detail::OptionKey<ValT, Base, Mem>::ID);
113 assert(It != Options.end() && "Option not in OptionRegistry");
114 return *(cl::opt<ValT> *)It->second;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugLoc.cpp | 60 auto It = std::lower_bound(
63 if (It != Locations.end() && It->Offset == Offset)
64 return &(*It);
192 auto It = std::lower_bound(
195 if (It != Locations.end() && It->Offset == Offset)
196 return &(*It);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/ObjCARC/ |
| BlotMapVector.h | 81 typename MapTy::iterator It = Map.find(Key);
82 if (It == Map.end())
84 return Vector.begin() + It->second;
88 typename MapTy::const_iterator It = Map.find(Key);
89 if (It == Map.end())
91 return Vector.begin() + It->second;
95 /// vector, it just zeros out the key in the vector. This leaves iterators
98 typename MapTy::iterator It = Map.find(Key);
99 if (It == Map.end())
101 Vector[It->second].first = KeyT()
[all...] |
