diff --git a/boost/stacktrace/frame.html b/boost/stacktrace/frame.html new file mode 100644 index 0000000..787f51c --- /dev/null +++ b/boost/stacktrace/frame.html @@ -0,0 +1,51 @@ + +
+ +![]() |
+Home | +Libraries | +People | +FAQ | +More | +
boost::stacktrace::frame
+// In header: <boost/stacktrace.hpp> + + +class frame { +};
| + | + |
![]() |
+Home | +Libraries | +People | +FAQ | +More | +
boost::stacktrace::iterator
+// In header: <boost/stacktrace.hpp> + + +class iterator : public boost::iterator_facade< iterator, frame, boost::random_access_traversal_tag > +{ +public: + // construct/copy/destruct + iterator(const stacktrace *, std::size_t) noexcept; + + // private member functions + frame & dereference() const; + bool equal(const iterator &) const noexcept; + void increment() noexcept; + void decrement() noexcept; + void advance(std::size_t) noexcept; + base_t::difference_type distance_to(const iterator &) const; +};
iterator
+ public
+ construct/copy/destructiterator(const stacktrace * impl, std::size_t frame_no) noexcept;
| + | + |
stacktrace
public
construct/copy/destructstacktrace() noexcept;Stores the current function call sequence inside the class.
Complexity: O(N) where N is call seaquence length, O(1) for noop backend.
+stacktrace() noexcept;Stores the current function call sequence inside the class.
Complexity: O(N) where N is call seaquence length, O(1) for noop backend.
stacktrace(const stacktrace & bt) noexcept;+
stacktrace(const stacktrace & bt) noexcept;Complexity: O(1)
stacktrace & operator=(const stacktrace & bt) noexcept;+
stacktrace & operator=(const stacktrace & bt) noexcept;Complexity: O(1)
~stacktrace();+
~stacktrace();Complexity: O(N) for libunwind, O(1) for other backends.
stacktrace public member functionsstacktrace public member functionsconst_iterator begin() const noexcept;
const_iterator cbegin() const noexcept;
const_iterator end() const noexcept;
const_iterator cend() const noexcept;
const_reverse_iterator rbegin() const noexcept;
const_reverse_iterator crbegin() const noexcept;
const_reverse_iterator rend() const noexcept;
const_reverse_iterator crend() const noexcept;
std::size_t size() const noexcept;+
std::size_t size() const noexcept;
Complexity: O(1)
std::string operator[](std::size_t frame) const;-
+
explicit operator bool() noexcept;Allows to check that stack trace capturing was successful.
-Complexity: Amortized O(1), O(1) for noop backend.
+Complexity: Amortized O(1), O(1) for noop backend. +Complexity: O(1)Parameters: |
-
|
+Returns: |
+Function name in a human readable form. |
||
Returns: |
-Function name in a human readable form. |
+
|
|||
Throws: |
@@ -116,24 +143,13 @@
explicit operator bool() noexcept;Allows to check that stack trace capturing was successful.
-Complexity: O(1)
-Returns: |
-
|
-
bool operator<(const stacktrace & rhs) const noexcept;Compares stacktraces for less, order is platform dependant.
Complexity: Amortized O(1); worst case O(size())
bool operator<(const stacktrace & rhs) const noexcept;Compares stacktraces for less, order is platform dependant.
Complexity: Amortized O(1); worst case O(size())
+bool operator==(const stacktrace & rhs) const noexcept;Compares stacktraces for equality.
Complexity: Amortized O(1); worst case O(size())
bool operator==(const stacktrace & rhs) const noexcept;Compares stacktraces for equality.
Complexity: Amortized O(1); worst case O(size())
-std::size_t hash_code() const noexcept;Returns hashed code of the stacktrace.
Complexity: O(1)
+std::size_t hash_code() const noexcept;Returns hashed code of the stacktrace.
Complexity: O(1)