Home
last modified time | relevance | path

Searched defs:It (Results 1 – 25 of 731) sorted by relevance

12345678910>>...30

/llvm-project/libcxx/test/std/iterators/predef.iterators/move.iterators/move.sentinel/
H A Dconcept_conformance.compile.pass.cpp24 using It = int*; in test() typedef
35 using It = cpp17_input_iterator<int*>; in test() typedef
44 using It = cpp20_input_iterator<int*>; in test() typedef
53 using It = forward_iterator<int*>; in test() typedef
64 using It = bidirectional_iterator<int*>; in test() typedef
75 using It = random_access_iterator<int*>; in test() typedef
86 using It = contiguous_iterator<int*>; in test() typedef
97 using It = three_way_contiguous_iterator<int*>; in test() typedef
/llvm-project/libcxx/test/std/iterators/iterator.primitives/iterator.basic/
H A Diterator.pass.cpp35 typedef std::iterator<std::forward_iterator_tag, T> It; test2() typedef
47 typedef std::iterator<std::bidirectional_iterator_tag, T, short> It; test3() typedef
59 typedef std::iterator<std::random_access_iterator_tag, T, int, const T*> It; test4() typedef
71 typedef std::iterator<std::input_iterator_tag, T, long, const T*, const T&> It; test5() typedef
[all...]
/llvm-project/libcxx/test/std/input.output/filesystems/class.path/path.member/path.construct/
H A Dsource.pass.cpp72 using It = cpp17_input_iterator<const CharT*>; in RunTestCaseImpl() typedef
78 using It = cpp17_input_iterator<const CharT*>; in RunTestCaseImpl() typedef
99 using It = const char* const; in test_sfinae() typedef
103 using It = cpp17_input_iterator<const char*>; in test_sfinae() typedef
114 using It = cpp17_input_iterator<const char*, Traits>; in test_sfinae() typedef
118 using It = cpp17_output_iterator<const char*>; in test_sfinae() typedef
/llvm-project/llvm/include/llvm/ProfileData/
H A DHashKeyMap.h87 auto It = base_type::find(hash_value(Key)); in find() local
94 auto It = base_type::find(hash_value(Key)); in find() local
101 auto It = base_type::find(hash_value(Key)); in lookup() local
112 auto It = find(Ctx); in erase() local
120 iterator erase(const_iterator It) { in erase()
/llvm-project/libcxx/test/std/containers/unord/
H A Diterator_difference_type.pass.cpp22 typedef typename Map::iterator It; in testUnorderedMap() typedef
29 typedef typename Map::const_iterator It; in testUnorderedMap() typedef
36 typedef typename Map::local_iterator It; in testUnorderedMap() typedef
43 typedef typename Map::const_local_iterator It; in testUnorderedMap() typedef
60 typedef typename Set::iterator It; in testUnorderedSet() typedef
68 typedef typename Set::local_iterator It; in testUnorderedSet() typedef
/llvm-project/llvm/tools/llvm-mca/
H A DCodeRegion.cpp50 auto It = ActiveRegions.find(Description); in beginRegion() local
82 auto It = ActiveRegions.begin(); in endRegion() local
96 auto It = ActiveRegions.find(Description); in endRegion() local
126 auto It = ActiveRegions.find(Description); in beginRegion() local
145 auto It = ActiveRegions.find(Description); in endRegion() local
/llvm-project/clang/test/OpenMP/
H A Dfor_codegen.cpp673 struct It { struct
674 It() : p(0) {} in It() argument
680 ~It() {} in ~It() argument
682 It(T *p) : p(p) {} in It() argument
688 It &operator++() { ++p; return *this; } in operator ++() argument
689 It &operator--() { --p; return *this; } in operator --() argument
690 It &operator+=(unsigned n) { p += n; return *this; } in operator +=() argument
691 It &operator-=(unsigned n) { p -= n; return *this; } in operator -=() argument
697 It<T> operator+(It<T> a, typename It<T>::difference_type n) { return a.p + n; } in operator +() argument
/llvm-project/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Dloop-convert-basic.cpp282 for (T::iterator It = Tt.begin(), E = Tt.end(); It != E; ++It) { in f() local
292 for (Q::const_iterator It = Qq.begin(), E = Qq.end(); It != E; ++It) { in f() local
300 for (T::iterator It = Pt->begin(), E = Pt->end(); It != E; ++It) { f() local
308 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { f() local
316 for (S::iterator It = Ps->begin(), E = Ps->end(); It != E; ++It) { f() local
323 for (S::const_iterator It = Ss.cbegin(), E = Ss.cend(); It != E; ++It) { f() local
330 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { f() local
337 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { f() local
344 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { f() local
351 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { f() local
359 for (U::iterator It = Uu.begin(), E = Uu.end(); It != E; ++It) { f() local
366 for (U::iterator It = Uu.begin(), E = Uu.end(); It != E; ++It) { f() local
373 for (U::iterator It = Uu.begin(), E = Uu.end(); It != E; ++It) { f() local
385 for (dependent<int>::iterator It = V.begin(), E = V.end(); f() local
393 for (dependent<int>::iterator It(V.begin()), E = V.end(); f() local
402 for (doublyDependent<int, int>::iterator It = Intmap.begin(), E = Intmap.end(); f() local
462 for (S::iterator It = begin(Ss), E = end(Ss); It != E; ++It) { f() local
469 for (S::iterator It = std::begin(Ss), E = std::end(Ss); It != E; ++It) { f() local
476 for (S::iterator It = begin(*Ps), E = end(*Ps); It != E; ++It) { f() local
483 for (S::iterator It = begin(*Ps); It != end(*Ps); ++It) { f() local
490 for (S::const_iterator It = cbegin(Ss), E = cend(Ss); It != E; ++It) { f() local
504 for (S::const_iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { different_type() local
512 for (S::const_iterator It = Ps->begin(), E = Ps->end(); It != E; ++It) { different_type() local
520 for (dependent<int>::const_iterator It = V.begin(), E = V.end(); different_type() local
528 for (dependent<int>::const_iterator It(V.begin()), E = V.end(); different_type() local
[all...]
H A Dloop-convert-extra.cpp209 for (S::const_iterator It = S_const.begin(); It != S_const.end(); ++It) { in refs_and_vals() local
220 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { in refs_and_vals() local
231 for (S::iterator It = Ss.begin(), E = Ss.end(); It != E; ++It) { in refs_and_vals() local
243 for (dependent<int>::iterator It = Dep.begin(), E = Dep.end(); It != E; ++It) { in refs_and_vals() local
374 for (S::iterator It = MAXs.begin(), E = MAXs.end(); It != E; ++It) { in macroConflict() local
383 for (S::const_iterator It = MAXs.begin(), E = MAXs.end(); It != E; ++It) { in macroConflict() local
393 for (T::iterator It = DEFs.begin(), E = DEFs.end(); It != E; ++It) { in macroConflict() local
406 for (T::iterator It = ints.begin(), E = ints.end(); It != E; ++It) { in keywordConflict() local
414 for (U::iterator It = __FUNCTION__s.begin(), E = __FUNCTION__s.end(); in keywordConflict() local
427 for (T::iterator It = Vals.begin(), E = Vals.end(); It != E; ++It) in typeConflict() local
[all …]
/llvm-project/libcxx/test/std/input.output/filesystems/class.path/path.member/path.assign/
H A Dsource.pass.cpp141 using It = cpp17_input_iterator<const CharT*>; in RunTestCase() typedef
154 using It = cpp17_input_iterator<const CharT*>; in RunTestCase() typedef
165 using It = cpp17_input_iterator<const CharT*>; in RunTestCase() typedef
188 using It = const char* const; in test_sfinae() typedef
193 using It = cpp17_input_iterator<const char*>; in test_sfinae() typedef
205 using It = cpp17_input_iterator<const char*, Traits>; in test_sfinae() typedef
210 using It = cpp17_output_iterator<const char*>; in test_sfinae() typedef
/llvm-project/libcxx/test/std/containers/sequences/vector/vector.cons/
H A Dassign_iter_iter.pass.cpp32 using It = forward_iterator<int*>; in test() typedef
48 using It = cpp17_input_iterator<int*>; in test() typedef
70 typedef forward_iterator<int*> It; test() typedef
[all...]
/llvm-project/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iterator/
H A Dtypes.pass.cpp120 typedef std::move_iterator<T> It; in main() typedef
125 typedef std::move_iterator<T> It; in main() typedef
132 typedef std::move_iterator<T> It; in main() typedef
137 typedef std::move_iterator<T> It; in main() typedef
142 typedef std::move_iterator<T> It; in main() typedef
/llvm-project/libcxx/test/std/ranges/range.utility/range.subrange/
H A Dget.pass.cpp31 using It = int*; in test() typedef
50 using It = int*; in test() typedef
70 using It = cpp20_input_iterator<int*>; in test() typedef
/llvm-project/llvm/unittests/Support/
H A DSuffixTreeTest.cpp26 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
48 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
87 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
116 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
142 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
155 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
185 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
236 for (auto It = ST.begin(); It != ST.end(); It++) in TEST() local
/llvm-project/libcxx/test/std/containers/sequences/list/list.cons/
H A Dinput_iterator.pass.cpp92 using It = random_access_iterator<int*>; in test_emplacable_concept() typedef
110 using It = cpp17_input_iterator<int*>; in test_emplacable_concept() typedef
139 using It = random_access_iterator<int*>; in test_emplacable_concept_with_alloc() typedef
158 using It = cpp17_input_iterator<int*>; in test_emplacable_concept_with_alloc() typedef
186 using It = forward_iterator<int*>; in test_ctor_under_alloc() typedef
198 using It = cpp17_input_iterator<int*>; in test_ctor_under_alloc() typedef
217 using It = forward_iterator<int*>; in test_ctor_under_alloc_with_alloc() typedef
231 using It = cpp17_input_iterator<int*>; in test_ctor_under_alloc_with_alloc() typedef
/llvm-project/libcxx/test/libcxx/containers/sequences/vector.bool/
H A Dtrivial_for_purposes_of_call.pass.cpp42 using It = std::vector<bool>::const_iterator; in test_const_iterator() typedef
47 using It = std::vector<bool>::iterator; in test_non_const_iterator() typedef
/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerDataFlowTrace.h53 auto It = Functions.find(FunctionId); in GetCounter() local
63 auto It = Functions.find(FunctionId); in GetNumberOfBlocks() local
70 auto It = Functions.find(FunctionId); in GetNumberOfCoveredBlocks() local
123 auto It = Traces.find(InputSha1); in Get() local
/llvm-project/clang/lib/AST/Interp/
H A DRecord.cpp
/llvm-project/libcxx/test/std/iterators/predef.iterators/iterators.common/
H A Diter_move.pass.cpp41 using It = int*; in test() typedef
56 using It = const int*; in test() typedef
71 using It = IterMovingIt; in test() typedef
H A Diter_swap.pass.cpp51 using It = int*; in test() typedef
65 using It = const int*; in test() typedef
70 using It = IterSwappingIt<0>; in test() typedef
91 using It = IterSwappingIt<0>; in test() typedef
/llvm-project/llvm/include/llvm/ADT/
H A DCoalescingBitVector.h87 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; ++It) in count() local
108 for (auto It = Other.Intervals.begin(), End = Other.Intervals.end(); in set() local
121 const auto It = Intervals.find(Index); in test() local
136 auto It = Intervals.find(Index); in reset() local
165 for (auto It = RHS.Intervals.begin(), End = RHS.Intervals.end(); variable
201 auto It = Intervals.find(OlapStart); in intersectWithComplement() local
358 auto It = const_iterator(UnderlyingIt); in find() local
378 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; in print() local
H A DAddressRanges.h76 typename Collection::const_iterator It = find(Addr, Addr + 1); in getRangeThatContains() local
100 auto It = in find() local
127 auto It = llvm::upper_bound(Ranges, Range); in insert() local
172 auto It = std::partition_point(Ranges.begin(), Ranges.end(), in insert() local
/llvm-project/libcxx/test/std/ranges/range.adaptors/range.transform/
H A Dend.pass.cpp34 using It = decltype(it); in test() typedef
84 using It = decltype(it); in test() typedef
98 using It = decltype(it); in test() typedef
/llvm-project/libcxx/test/std/ranges/range.adaptors/range.transform/iterator/
H A Dbase.pass.cpp23 using It = decltype(it); in test() typedef
36 using It = decltype(it); in test() typedef
/llvm-project/llvm/include/llvm/XRay/
H A DGraph.h213 auto It = NL.find(A); in begin() local
220 auto It = NL.find(A); in cbegin() local
229 auto It = NL.find(A); in end() local
235 auto It in cend() local
399 auto It = Vertices.find(I); at() local
408 auto It = Vertices.find(I); at() local
418 auto It = Edges.find(I); at() local
427 auto It = Edges.find(I); at() local
[all...]

12345678910>>...30