std::basic_stacktrace<Allocator>::rbegin, std::basic_stacktrace<Allocator>::crbegin
From cppreference.com
< cpp | utility | basic stacktrace
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Diagnostics library
(until C++20*)
(C++17)(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
Exception handling failures
(C++11)
(until C++17*)
(until C++17*)
(until C++17*)
(until C++17*)
(TM TS)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++26)
(C++26)
(C++26)
std::basic_stacktrace
basic_stacktrace::rbeginbasic_stacktrace::crbegin
const_reverse_iterator rbegin() const noexcept;
(1)
(since C++23)
const_reverse_iterator crbegin() const noexcept;
(2)
(since C++23)
Returns a reverse iterator to the first entry of the reversed basic_stacktrace. It corresponds to the last entry of the original basic_stacktrace. If the basic_stacktrace is empty, the returned iterator is equal to rend().
[edit] Parameters
(none)
[edit] Return value
Reverse iterator to the first entry.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <algorithm> #include <iostream> #include <stacktrace> int main() { auto trace = std::stacktrace::current(); auto empty_trace = std::stacktrace {}; // Print stacktrace. std::for_each (trace.rbegin(), trace.rend(), [](const auto& f) { std::cout << f << '\n'; }); if (empty_trace.rbegin() == empty_trace.rend()) std::cout << "stacktrace 'empty_trace' is indeed empty.\n"; }
Possible output:
0x0000000000402A29 in ./prog.exe __libc_start_main in /lib/x86_64-linux-gnu/libc.so.6 0x0000000000402BA5 in ./prog.exe stacktrace 'empty_trace' is indeed empty.