HomeSort by relevance Sort by last modified time
    Searched refs:rbegin (Results 1 - 25 of 471) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/libcxx/test/std/experimental/string.view/string.view.iterators/
rend.pass.cpp 28 assert( e == s.rbegin());
29 assert(ce1 == cs.rbegin());
30 assert(ce2 == s.rbegin());
34 assert( e != s.rbegin());
35 assert(ce1 != cs.rbegin());
36 assert(ce2 != s.rbegin());
39 assert( e - s.rbegin() == s.size());
40 assert(ce1 - cs.rbegin() == cs.size());
  /external/libcxx/test/std/strings/basic.string/string.iterators/
rend.pass.cpp 29 assert(e == s.rbegin());
30 assert(ce == cs.rbegin());
32 assert(e - s.rbegin() == s.size());
33 assert(ce - cs.rbegin() == cs.size());
rbegin.pass.cpp 12 // reverse_iterator rbegin();
13 // const_reverse_iterator rbegin() const;
25 typename S::reverse_iterator b = s.rbegin();
26 typename S::const_reverse_iterator cb = cs.rbegin();
crbegin.pass.cpp 28 assert(cb == s.rbegin());
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.iterators/
rend.pass.cpp 29 assert(e == s.rbegin());
30 assert(ce == cs.rbegin());
32 assert(e - s.rbegin() == s.size());
33 assert(ce - cs.rbegin() == cs.size());
rbegin.pass.cpp 12 // reverse_iterator rbegin();
13 // const_reverse_iterator rbegin() const;
25 typename S::reverse_iterator b = s.rbegin();
26 typename S::const_reverse_iterator cb = cs.rbegin();
crbegin.pass.cpp 28 assert(cb == s.rbegin());
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/range/
rbegin.hpp 28 rbegin( C& c ) function in namespace:boost
37 rbegin( C& c )
46 rbegin( const C& c )
59 return boost::rbegin( r );
functions.hpp 23 #include <boost/range/rbegin.hpp>
  /external/v8/src/base/
adapters.h 20 typedef decltype(static_cast<T*>(nullptr)->rbegin()) Iterator;
25 Iterator begin() const { return t_.rbegin(); }
  /external/llvm/unittests/ADT/
RangeAdapterTest.cpp 22 // A wrapper around vector which exposes rbegin(), rend().
30 reverse_iterator rbegin() { return Vec.rbegin(); } function in class:__anon18224::ReverseOnlyVector
34 // A wrapper around vector which exposes begin(), end(), rbegin() and rend().
36 // get a linker error if reverse() chooses begin()/end() over rbegin(), rend().
48 reverse_iterator rbegin() { return Vec.rbegin(); } function in class:__anon18224::BidirectionalVector
  /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/
begin_end.pass.cpp 20 // reverse_iterator rbegin() noexcept;
21 // const_reverse_iterator rbegin() const noexcept;
47 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
52 assert ( dyn.size () == std::distance ( dyn.rbegin(), dyn.rend()));
57 assert ( dyn.rbegin () == dyn.crbegin ());
58 assert ( &*dyn.rbegin () == &*dyn.crbegin ());
69 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
74 assert ( dyn.size () == std::distance ( dyn.rbegin(), dyn.rend()));
79 assert ( dyn.rbegin () == dyn.crbegin ());
80 assert ( &*dyn.rbegin () == &*dyn.crbegin ())
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.overview/
begin_end.pass.cpp 20 // reverse_iterator rbegin() noexcept;
21 // const_reverse_iterator rbegin() const noexcept;
47 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
52 assert ( dyn.size () == std::distance ( dyn.rbegin(), dyn.rend()));
57 assert ( dyn.rbegin () == dyn.crbegin ());
58 assert ( &*dyn.rbegin () == &*dyn.crbegin ());
69 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
74 assert ( dyn.size () == std::distance ( dyn.rbegin(), dyn.rend()));
79 assert ( dyn.rbegin () == dyn.crbegin ());
80 assert ( &*dyn.rbegin () == &*dyn.crbegin ())
    [all...]
  /system/core/adb/sysdeps/win32/
stat.cpp 50 while (*path_wide.rbegin() == u'/' || *path_wide.rbegin() == u'\\') {
  /external/llvm/include/llvm/Analysis/
Trace.h 96 reverse_iterator rbegin() { return BasicBlocks.rbegin(); } function in class:llvm::Trace
97 const_reverse_iterator rbegin() const { return BasicBlocks.rbegin(); } function in class:llvm::Trace
  /frameworks/compile/mclinker/include/mcld/LD/
RelocData.h 85 const_reverse_iterator rbegin() const { return m_Relocations.rbegin(); } function in class:mcld::RelocData
86 reverse_iterator rbegin() { return m_Relocations.rbegin(); } function in class:mcld::RelocData
SectionData.h 77 const_reverse_iterator rbegin() const { return m_Fragments.rbegin(); } function in class:mcld::SectionData
78 reverse_iterator rbegin() { return m_Fragments.rbegin(); } function in class:mcld::SectionData
ELFSegment.h 48 reverse_iterator rbegin() { return m_SectionList.rbegin(); } function in class:mcld::ELFSegment
49 const_reverse_iterator rbegin() const { return m_SectionList.rbegin(); } function in class:mcld::ELFSegment
  /ndk/tests/device/test-gnustl-full/unit/
reviter_test.cpp 46 CPPUNIT_ASSERT(r==v.rbegin());
54 r = v.rbegin();
66 list<int>::reverse_iterator r(v.rbegin());
  /ndk/tests/device/test-stlport/unit/
reviter_test.cpp 46 CPPUNIT_ASSERT(r==v.rbegin());
54 r = v.rbegin();
66 list<int>::reverse_iterator r(v.rbegin());
  /external/libcxx/test/std/containers/sequences/array/
iterators.pass.cpp 56 assert ( c.rbegin() == std::rbegin(c));
64 assert ( std::rbegin(c) != std::rend(c));
96 assert ( c.rbegin() == std::rbegin(c));
104 assert ( std::rbegin(c) == std::rend(c));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/array/
iterators.pass.cpp 56 assert ( c.rbegin() == std::rbegin(c));
64 assert ( std::rbegin(c) != std::rend(c));
96 assert ( c.rbegin() == std::rbegin(c));
104 assert ( std::rbegin(c) == std::rend(c));
  /external/llvm/utils/TableGen/
SequenceToOffsetTable.h 44 return std::lexicographical_compare(A.rbegin(), A.rend(),
45 B.rbegin(), B.rend(), L);
61 return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin());
  /external/clang/include/clang/Analysis/Analyses/
PostOrderCFGView.h 84 iterator begin() { return Blocks.rbegin(); }
87 const_iterator begin() const { return Blocks.rbegin(); }
  /external/libchrome/base/containers/
adapters.h 22 using Iterator = decltype(static_cast<T*>(nullptr)->rbegin());
27 // TODO(mdempsky): Once we can use C++14 library features, use std::rbegin
29 Iterator begin() const { return t_.rbegin(); }

Completed in 610 milliseconds

1 2 3 4 5 6 7 8 91011>>