Home
last modified time | relevance | path

Searched refs:rbegin (Results 1 – 25 of 313) sorted by relevance

12345678910>>...13

/llvm-project-15.0.7/libcxx/test/std/ranges/range.access/
H A Drbegin.pass.cpp88 char*& rbegin(); in testReturnTypes()
89 short*& rbegin() const; in testReturnTypes()
114 int rbegin() const;
119 const void *rbegin() const;
125 iterator rbegin() const;
131 constexpr int* rbegin() { return &x; } in rbegin() function
158 assert(std::ranges::rbegin(a) == &a.x); in testRBeginMember()
164 assert(std::ranges::rbegin(b) == &b.x); in testRBeginMember()
236 int rbegin; member
244 const int *rbegin() const;
[all …]
H A Drend.pass.cpp44 const int* rbegin() const;
73 char* rbegin(); in testReturnTypes()
75 short* rbegin() const; in testReturnTypes()
102 int rbegin() const;
108 const void *rbegin() const;
117 PtrConvertible rbegin() const;
154 Empty rbegin() const;
439 int* rbegin() const;
484 ThrowingIterator<int> rbegin() const;
491 ThrowingIterator<int> rbegin() const;
[all …]
/llvm-project-15.0.7/libcxx/include/__ranges/
H A Drbegin.h39 { _LIBCPP_AUTO_CAST(__t.rbegin()) } -> input_or_output_iterator; in requires()
42 void rbegin(auto&) = delete;
43 void rbegin(const auto&) = delete;
51 { _LIBCPP_AUTO_CAST(rbegin(__t)) } -> input_or_output_iterator;
68 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.rbegin()))) in operator()
70 return _LIBCPP_AUTO_CAST(__t.rbegin()); in operator()
76 noexcept(noexcept(_LIBCPP_AUTO_CAST(rbegin(__t)))) in operator()
78 return _LIBCPP_AUTO_CAST(rbegin(__t)); in operator()
94 inline constexpr auto rbegin = __rbegin::__fn{};
115 noexcept(noexcept(ranges::rbegin(static_cast<const _Tp&&>(__t))))
[all …]
H A Drend.h40 ranges::rbegin(__t); in requires()
41 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires()
53 ranges::rbegin(__t);
54 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DIListIteratorTest.cpp44 EXPECT_EQ(L.rbegin(), L.rend()); in TEST()
55 EXPECT_NE(RI, L.rbegin()); in TEST()
66 EXPECT_EQ(&A, &*L.rbegin()); in TEST()
74 EXPECT_EQ(L.rend(), ++L.rbegin()); in TEST()
75 EXPECT_EQ(L.rbegin(), --L.rend()); in TEST()
78 EXPECT_EQ(L.rbegin(), L.begin().getReverse()); in TEST()
92 EXPECT_EQ(&B, &*L.rbegin()); in TEST()
93 EXPECT_EQ(&A, &*++L.rbegin()); in TEST()
94 EXPECT_EQ(L.rend(), ++++L.rbegin()); in TEST()
125 auto RI = L.rbegin(); in TEST()
[all …]
H A DRangeAdapterTest.cpp30 reverse_iterator rbegin() { return Vec.rbegin(); } in rbegin() function in __anon8c75fdf20111::ReverseOnlyVector
32 const_reverse_iterator rbegin() const { return Vec.rbegin(); } in rbegin() function in __anon8c75fdf20111::ReverseOnlyVector
50 reverse_iterator rbegin() const { return Vec.rbegin(); } in rbegin() function in __anon8c75fdf20111::BidirectionalVector
71 reverse_iterator rbegin() { return Vec.rbegin(); } in rbegin() function in __anon8c75fdf20111::BidirectionalVectorConsts
73 const_reverse_iterator rbegin() const { return Vec.rbegin(); } in rbegin() function in __anon8c75fdf20111::BidirectionalVectorConsts
117 reverse_iterator rbegin() const { return reverse_iterator(V.end()); } in rbegin() function in __anon8c75fdf20111::CustomIteratorVector
162 decltype(static_cast<TypeParam *>(nullptr)->rbegin())>::value, in TYPED_TEST()
167 decltype(static_cast<const TypeParam *>(nullptr)->rbegin())>::value, in TYPED_TEST()
/llvm-project-15.0.7/libcxx/include/__iterator/
H A Dreverse_access.h28 reverse_iterator<_Tp*> rbegin(_Tp (&__array)[_Np]) in rbegin() function
42 reverse_iterator<const _Ep*> rbegin(initializer_list<_Ep> __il) in rbegin() function
56 auto rbegin(_Cp& __c) -> decltype(__c.rbegin())
58 return __c.rbegin();
63 auto rbegin(const _Cp& __c) -> decltype(__c.rbegin())
65 return __c.rbegin();
84 auto crbegin(const _Cp& __c) -> decltype(_VSTD::rbegin(__c))
86 return _VSTD::rbegin(__c);
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/modernize/
H A Duse-auto-iterator.cpp12 std::array<int, 5>::reverse_iterator ArrayI2 = C.rbegin(); in f_array()
21 std::array<int, 5>::const_reverse_iterator ArrayI4 = D.rbegin(); in f_array()
32 std::deque<int>::reverse_iterator DequeI2 = C.rbegin(); in f_deque()
41 std::deque<int>::const_reverse_iterator DequeI4 = D.rbegin(); in f_deque()
63 std::list<int>::reverse_iterator ListI2 = C.rbegin(); in f_list()
71 std::list<int>::const_reverse_iterator ListI4 = D.rbegin(); in f_list()
82 std::vector<int>::reverse_iterator VecI2 = C.rbegin(); in f_vector()
102 std::map<int, int>::reverse_iterator MapI2 = C.rbegin(); in f_map()
142 std::set<int>::reverse_iterator SetI2 = C.rbegin(); in f_set()
151 std::set<int>::const_reverse_iterator SetI4 = D.rbegin(); in f_set()
[all …]
H A Dloop-convert-reverse.cpp50 iterator rbegin();
55 const_iterator rbegin() const;
70 for (auto I = Numbers.rbegin(), E = Numbers.rend(); I != E; ++I) { in constContainer()
89 for (auto I = Numbers.rbegin(), E = Numbers.end(); I != E; ++I) { in constContainer()
98 for (auto I = Numbers.rbegin(), E = Numbers.rend(); I != E; ++I) { in nonConstContainer()
/llvm-project-15.0.7/libcxx/test/std/strings/string.view/string.view.iterators/
H A Drend.pass.cpp32 assert( e == s.rbegin()); in test()
33 assert(ce1 == cs.rbegin()); in test()
34 assert(ce2 == s.rbegin()); in test()
38 assert( e != s.rbegin()); in test()
39 assert(ce1 != cs.rbegin()); in test()
40 assert(ce2 != s.rbegin()); in test()
43 assert(static_cast<std::size_t>( e - s.rbegin()) == s.size()); in test()
44 assert(static_cast<std::size_t>(ce1 - cs.rbegin()) == cs.size()); in test()
H A Drbegin.pass.cpp25 typename S::reverse_iterator b = s.rbegin(); in test()
26 typename S::const_reverse_iterator cb1 = cs.rbegin(); in test()
81 static_assert ( *sv.rbegin() == sv[2], "" ); in main()
83 static_assert ( *u8sv.rbegin() == u8sv[2], "" ); in main()
85 static_assert ( *u16sv.rbegin() == u16sv[2], "" ); in main()
86 static_assert ( *u32sv.rbegin() == u32sv[2], "" ); in main()
98 static_assert ( *wsv.rbegin() == wsv[2], "" ); in main()
/llvm-project-15.0.7/libcxx/test/std/iterators/iterator.range/
H A Dbegin-end.pass.cpp108 assert(std::rbegin(a).base() == a + 3); in test_arrays_and_initializer_lists_backward()
118 assert(std::rbegin(ca).base() == a + 3); in test_arrays_and_initializer_lists_backward()
129 assert(std::rbegin(il).base() == il.end()); in test_arrays_and_initializer_lists_backward()
139 assert(std::rbegin(cil).base() == il.end()); in test_arrays_and_initializer_lists_backward()
164 assert(std::rbegin(c).base() == c.end()); in test_container()
184 assert(std::rbegin(cc).base() == c.end()); in test_container()
206 constexpr int *rbegin() const { return a_; } in rbegin() function
216 friend constexpr int rbegin(ContainerHijacker&) { return 42; } in rbegin() function
218 friend constexpr int rbegin(const ContainerHijacker&) { return 42; } in rbegin() function
237 assert(std::rbegin(a).base() == a + 3); in test_adl_proofing()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/vector/
H A Dreverse_iterators.pass.cpp28 assert(vec.rbegin() == vec.rend()); in check_vector_reverse_iterators()
48 assert(cvec.rbegin() == vec.crbegin()); in check_vector_reverse_iterators()
54 for (typename Vector::reverse_iterator it = vec.rbegin(); it != vec.rend(); ++it) { in check_vector_reverse_iterators()
63 assert(std::distance(vec.rbegin(), vec.rend()) == n); in check_vector_reverse_iterators()
64 assert(std::distance(cvec.rbegin(), cvec.rend()) == n); in check_vector_reverse_iterators()
/llvm-project-15.0.7/libcxx/test/std/containers/views/views.span/span.iterators/
H A Drend.pass.cpp28 ret = ret && (e == s.rbegin()); in testConstexprSpan()
32 ret = ret && (e != s.rbegin()); in testConstexprSpan()
35 ret = ret && (static_cast<size_t>(e - s.rbegin()) == s.size()); in testConstexprSpan()
45 assert(e == s.rbegin()); in testRuntimeSpan()
49 assert(e != s.rbegin()); in testRuntimeSpan()
52 assert(static_cast<size_t>(e - s.rbegin()) == s.size()); in testRuntimeSpan()
/llvm-project-15.0.7/libcxx/test/std/strings/basic.string/string.iterators/
H A Drend.pass.cpp30 assert(e == s.rbegin()); in test()
31 assert(ce == cs.rbegin()); in test()
33 assert(static_cast<std::size_t>(e - s.rbegin()) == s.size()); in test()
34 assert(static_cast<std::size_t>(ce - cs.rbegin()) == cs.size()); in test()
H A Drbegin.pass.cpp25 typename S::reverse_iterator b = s.rbegin(); in test()
26 typename S::const_reverse_iterator cb = cs.rbegin(); in test()
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/array/
H A Diterators.pass.cpp42 ASSERT_NOEXCEPT(c.rbegin()); in check_noexcept()
50 ASSERT_NOEXCEPT(cc.rbegin()); in check_noexcept()
140 assert(c.rbegin() == std::rbegin(c)); in tests()
148 assert(std::rbegin(c) != std::rend(c)); in tests()
181 assert(c.rbegin() == std::rbegin(c)); in tests()
189 assert(std::rbegin(c) == std::rend(c)); in tests()
/llvm-project-15.0.7/llvm/unittests/CodeGen/
H A DMachineInstrBundleIteratorTest.cpp162 auto rbegin = [&]() -> reverse_iterator { return L.rbegin(); }; in TEST() local
166 auto crbegin = [&]() -> const_reverse_iterator { return CL.rbegin(); }; in TEST()
171 EXPECT_EQ(++begin(), iterator(++rbegin())); in TEST()
172 EXPECT_EQ(end(), iterator(rbegin())); in TEST()
173 EXPECT_EQ(rbegin(), reverse_iterator(end())); in TEST()
174 EXPECT_EQ(++rbegin(), reverse_iterator(++begin())); in TEST()
/llvm-project-15.0.7/llvm/unittests/Transforms/Utils/
H A DCallPromotionUtilsTest.cpp61 Inst = &*++F->front().rbegin(); in TEST()
118 Instruction *Inst = &*++F->front().rbegin(); in TEST()
153 Instruction *Inst = &*++F->front().rbegin(); in TEST()
195 Inst = &*++F->front().rbegin(); in TEST()
237 Inst = &*++F->front().rbegin(); in TEST()
296 Inst = &*++F->front().rbegin(); in TEST()
314 Inst = &*++F->front().rbegin(); in TEST()
364 Inst = &*++F->front().rbegin(); in TEST()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DTrace.h90 reverse_iterator rbegin() { return BasicBlocks.rbegin(); } in rbegin() function
91 const_reverse_iterator rbegin() const { return BasicBlocks.rbegin(); } in rbegin() function
/llvm-project-15.0.7/clang/include/clang/Analysis/
H A DCFG.h602 iterator begin() { return Impl.rbegin(); } in begin()
604 const_iterator begin() const { return Impl.rbegin(); } in begin()
606 reverse_iterator rbegin() { return Impl.begin(); } in rbegin() function
730 return E.Parent->size() - (E.Pos - E.Parent->rbegin()) - 1; in getIndexInBlock()
881 reverse_iterator rbegin() { return Elements.rbegin(); } in rbegin() function
883 const_reverse_iterator rbegin() const { return Elements.rbegin(); } in rbegin() function
906 reverse_ref_iterator rref_begin() { return {this, rbegin()}; } in rref_begin()
1320 reverse_iterator rbegin() { return Blocks.rbegin(); } in rbegin() function
1322 const_reverse_iterator rbegin() const { return Blocks.rbegin(); } in rbegin() function
1326 return {rbegin(), rend()}; in reverse_nodes()
[all …]
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h98 return std::lexicographical_compare(A.rbegin(), A.rend(), in operator()
99 B.rbegin(), B.rend(), L); in operator()
115 return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin()); in isSuffix()
/llvm-project-15.0.7/libcxx/test/support/
H A Dnasty_containers.h58 reverse_iterator rbegin() TEST_NOEXCEPT { return v_.rbegin(); } in rbegin() function
59 const_reverse_iterator rbegin() const TEST_NOEXCEPT { return v_.rbegin(); } in rbegin() function
186 reverse_iterator rbegin() TEST_NOEXCEPT { return l_.rbegin(); } in rbegin() function
187 const_reverse_iterator rbegin() const TEST_NOEXCEPT { return l_.rbegin(); } in rbegin() function
/llvm-project-15.0.7/libcxx/test/std/containers/associative/set/
H A Diterator.pass.cpp68 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
114 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
159 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
205 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multiset/
H A Diterator.pass.cpp68 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
116 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
163 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()
211 assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size()); in main()

12345678910>>...13