- Generated on Fri Apr 1 2022 02:20:07 for timemory by
1.9.2
|
timemory 3.3.0
Modular C++ Toolkit for Performance Analysis and Logging. Profiling API and Tools for C, C++, CUDA, Fortran, and Python. The C++ template API is essentially a framework to creating tools: it is designed to provide a unifying interface for recording various performance measurements alongside data logging and interfaces to other tools.
|
This is the complete list of members for tim::graph< T, AllocatorT >, including all inherited members.
| append_child(IterT position) | tim::graph< T, AllocatorT > | inline |
| append_child(IterT position, const T &x) | tim::graph< T, AllocatorT > | inline |
| append_child(IterT position, T &&x) | tim::graph< T, AllocatorT > | inline |
| append_child(IterT position, IterT other_position) | tim::graph< T, AllocatorT > | inline |
| append_children(IterT position, sibling_iterator from, const sibling_iterator &to) | tim::graph< T, AllocatorT > | inline |
| begin() const | tim::graph< T, AllocatorT > | inline |
| begin(const iterator_base &) | tim::graph< T, AllocatorT > | static |
| child(const iterator_base &position, unsigned int) | tim::graph< T, AllocatorT > | static |
| clear() | tim::graph< T, AllocatorT > | inline |
| const_iterator typedef | tim::graph< T, AllocatorT > | |
| depth(const iterator_base &) | tim::graph< T, AllocatorT > | static |
| depth(const iterator_base &, const iterator_base &) | tim::graph< T, AllocatorT > | static |
| difference_type typedef | tim::graph< T, AllocatorT > | |
| empty() const | tim::graph< T, AllocatorT > | inline |
| end() const | tim::graph< T, AllocatorT > | inline |
| end(const iterator_base &) | tim::graph< T, AllocatorT > | static |
| equal(const IterT &one, const IterT &two, const IterT &three) const | tim::graph< T, AllocatorT > | inline |
| equal(const IterT &one, const IterT &two, const IterT &three, BinaryPredicate) const | tim::graph< T, AllocatorT > | inline |
| equal_subgraph(const IterT &one, const IterT &two) const | tim::graph< T, AllocatorT > | inline |
| equal_subgraph(const IterT &one, const IterT &two, BinaryPredicate) const | tim::graph< T, AllocatorT > | inline |
| erase(IterT) | tim::graph< T, AllocatorT > | inline |
| erase_children(const iterator_base &) | tim::graph< T, AllocatorT > | inline |
| feet | tim::graph< T, AllocatorT > | |
| flatten(IterT position) | tim::graph< T, AllocatorT > | inline |
| graph() | tim::graph< T, AllocatorT > | |
| graph(const T &) | tim::graph< T, AllocatorT > | |
| graph(const iterator_base &) | tim::graph< T, AllocatorT > | |
| graph(const this_type &)=delete | tim::graph< T, AllocatorT > | |
| graph(this_type &&) noexcept=default | tim::graph< T, AllocatorT > | |
| graph_node typedef | tim::graph< T, AllocatorT > | protected |
| head | tim::graph< T, AllocatorT > | |
| index(sibling_iterator it) const | tim::graph< T, AllocatorT > | inline |
| insert(IterT position, const T &x) | tim::graph< T, AllocatorT > | inline |
| insert(IterT position, T &&x) | tim::graph< T, AllocatorT > | inline |
| insert(sibling_iterator position, const T &x) | tim::graph< T, AllocatorT > | inline |
| insert_after(IterT position, const T &x) | tim::graph< T, AllocatorT > | inline |
| insert_after(IterT position, T &&x) | tim::graph< T, AllocatorT > | inline |
| insert_subgraph(IterT position, const iterator_base &subgraph) | tim::graph< T, AllocatorT > | inline |
| insert_subgraph_after(IterT position, const iterator_base &subgraph) | tim::graph< T, AllocatorT > | inline |
| is_head(const iterator_base &) | tim::graph< T, AllocatorT > | static |
| is_in_subgraph(const iterator_base &position, const iterator_base &begin, const iterator_base &end) const | tim::graph< T, AllocatorT > | inline |
| is_valid(const iterator_base &) const | tim::graph< T, AllocatorT > | inline |
| iterator typedef | tim::graph< T, AllocatorT > | |
| max_depth() const | tim::graph< T, AllocatorT > | inline |
| max_depth(const iterator_base &) const | tim::graph< T, AllocatorT > | inline |
| merge(const sibling_iterator &, const sibling_iterator &, sibling_iterator, const sibling_iterator &, bool duplicate_leaves=false, bool first=false) | tim::graph< T, AllocatorT > | inline |
| move_after(IterT target, IterT source) | tim::graph< T, AllocatorT > | inline |
| move_before(IterT target, IterT source) | tim::graph< T, AllocatorT > | inline |
| move_before(sibling_iterator target, sibling_iterator source) | tim::graph< T, AllocatorT > | inline |
| move_in(IterT, graph &) | tim::graph< T, AllocatorT > | inline |
| move_in_as_nth_child(IterT, size_t, graph &) | tim::graph< T, AllocatorT > | inline |
| move_in_below(IterT, graph &) | tim::graph< T, AllocatorT > | inline |
| move_ontop(IterT target, IterT source) | tim::graph< T, AllocatorT > | inline |
| move_out(iterator) | tim::graph< T, AllocatorT > | inline |
| next_sibling(IterT) | tim::graph< T, AllocatorT > | static |
| number_of_children(const iterator_base &) | tim::graph< T, AllocatorT > | static |
| number_of_siblings(const iterator_base &) const | tim::graph< T, AllocatorT > | inline |
| operator=(const graph &)=delete | tim::graph< T, AllocatorT > | |
| operator=(graph &&) noexcept=default | tim::graph< T, AllocatorT > | |
| parent(IterT) | tim::graph< T, AllocatorT > | static |
| prepend_child(IterT position) | tim::graph< T, AllocatorT > | inline |
| prepend_child(IterT position, const T &x) | tim::graph< T, AllocatorT > | inline |
| prepend_child(IterT position, T &&x) | tim::graph< T, AllocatorT > | inline |
| prepend_child(IterT position, IterT other_position) | tim::graph< T, AllocatorT > | inline |
| prepend_children(IterT position, sibling_iterator from, sibling_iterator to) | tim::graph< T, AllocatorT > | inline |
| previous_sibling(IterT) | tim::graph< T, AllocatorT > | static |
| reduce(const sibling_iterator &, const sibling_iterator &, std::set< sibling_iterator > &, ComparePred &&=[](sibling_iterator lhs, sibling_iterator rhs) { return(*lhs== *rhs);}, ReducePred &&=[](sibling_iterator lhs, sibling_iterator rhs) { *lhs+= *rhs;}) | tim::graph< T, AllocatorT > | inline |
| reparent(IterT position, sibling_iterator begin, const sibling_iterator &end) | tim::graph< T, AllocatorT > | inline |
| reparent(IterT position, IterT from) | tim::graph< T, AllocatorT > | inline |
| replace(IterT position, const T &x) | tim::graph< T, AllocatorT > | inline |
| replace(IterT position, T &&x) | tim::graph< T, AllocatorT > | inline |
| replace(IterT position, const iterator_base &from) | tim::graph< T, AllocatorT > | inline |
| replace(sibling_iterator orig_begin, const sibling_iterator &orig_end, sibling_iterator new_begin, const sibling_iterator &new_end) | tim::graph< T, AllocatorT > | inline |
| serialize(Archive &ar, const unsigned int) | tim::graph< T, AllocatorT > | inline |
| set_head(const T &x) | tim::graph< T, AllocatorT > | inline |
| set_head(T &&x) | tim::graph< T, AllocatorT > | inline |
| sibling(const iterator_base &position, unsigned int) const | tim::graph< T, AllocatorT > | inline |
| size() const | tim::graph< T, AllocatorT > | inline |
| steal_resources(this_type &rhs) | tim::graph< T, AllocatorT > | inline |
| subgraph(sibling_iterator from, sibling_iterator to) const | tim::graph< T, AllocatorT > | inline |
| subgraph(graph &, sibling_iterator from, sibling_iterator to) const | tim::graph< T, AllocatorT > | inline |
| swap(sibling_iterator it) | tim::graph< T, AllocatorT > | inline |
| swap(iterator, iterator) | tim::graph< T, AllocatorT > | inline |
| this_type typedef | tim::graph< T, AllocatorT > | protected |
| value_type typedef | tim::graph< T, AllocatorT > | |
| wrap(IterT position, const T &x) | tim::graph< T, AllocatorT > | inline |
| wrap(IterT from, IterT to, const T &x) | tim::graph< T, AllocatorT > | inline |
| ~graph() | tim::graph< T, AllocatorT > |
1.9.2