tim::graph_data< NodeT > Class Template Reference

tim::graph instance + current node + head note + sea-level. Sea-level is defined as the node depth after a fork from another graph instance and is only relevant for worker-threads) More...

#include "timemory/storage/graph_data.hpp"

Collaboration diagram for tim::graph_data< NodeT >:

Public Types
using	this_type = graph_data< NodeT >
using	graph_t = tim::graph< NodeT >
using	iterator = typename graph_t::iterator
using	const_iterator = typename graph_t::const_iterator
using	inverse_insert_t = std::vector< std::pair< int64_t, iterator > >
using	pre_order_iterator = typename graph_t::pre_order_iterator
using	sibling_iterator = typename graph_t::sibling_iterator

Public Member Functions
	graph_data (const NodeT &rhs, int64_t _depth, graph_data *_master=nullptr)
	~graph_data ()
	graph_data (this_type &&)=delete
graph_data &	operator= (this_type &&)=delete
	graph_data (const this_type &)=delete
graph_data &	operator= (const this_type &)=delete
bool	has_head () const
auto	dummy_count () const
bool	at_sea_level () const
int64_t &	depth ()
int64_t	depth () const
int64_t &	sea_level ()
int64_t	sea_level () const
graph_t &	graph ()
const graph_t &	graph () const
iterator &	head ()
iterator &	current ()
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
void	sync_sea_level ()
void	clear ()
void	set_master (graph_data *_master)
void	add_dummy ()
void	reset ()
iterator	pop_graph ()
iterator	find (iterator itr) const
int64_t	get_rolling_hash (iterator itr) const
iterator	append_child (const NodeT &node)
iterator	append_child (NodeT &&node)
iterator	append_head (NodeT &node)
iterator	emplace_child (iterator _itr, const NodeT &node)
iterator	emplace_child (iterator _itr, NodeT &&node)
inverse_insert_t	get_inverse_insert () const

Detailed Description

template<typename NodeT>
class tim::graph_data< NodeT >

tim::graph instance + current node + head note + sea-level. Sea-level is defined as the node depth after a fork from another graph instance and is only relevant for worker-threads)

Definition at line 58 of file graph_data.hpp.

Member Typedef Documentation

const_iterator

template<typename NodeT >

using tim::graph_data< NodeT >::const_iterator = typename graph_t::const_iterator

Definition at line 64 of file graph_data.hpp.

graph_t

template<typename NodeT >

using tim::graph_data< NodeT >::graph_t = tim::graph<NodeT>

Definition at line 62 of file graph_data.hpp.

inverse_insert_t

template<typename NodeT >

using tim::graph_data< NodeT >::inverse_insert_t = std::vector<std::pair<int64_t, iterator> >

Definition at line 65 of file graph_data.hpp.

iterator

template<typename NodeT >

using tim::graph_data< NodeT >::iterator = typename graph_t::iterator

Definition at line 63 of file graph_data.hpp.

pre_order_iterator

template<typename NodeT >

using tim::graph_data< NodeT >::pre_order_iterator = typename graph_t::pre_order_iterator

Definition at line 66 of file graph_data.hpp.

sibling_iterator

template<typename NodeT >

using tim::graph_data< NodeT >::sibling_iterator = typename graph_t::sibling_iterator

Definition at line 67 of file graph_data.hpp.

this_type

template<typename NodeT >

using tim::graph_data< NodeT >::this_type = graph_data<NodeT>

Definition at line 61 of file graph_data.hpp.

Constructor & Destructor Documentation

graph_data() [1/3]

template<typename NodeT >

tim::graph_data< NodeT >::graph_data ( const NodeT &  rhs, int64_t  _depth, graph_data< NodeT > *  _master = nullptr  )

inlineexplicit

Definition at line 72 of file graph_data.hpp.

    : m_has_head(true)
    , m_depth(_depth)
    , m_sea_level(_depth)
    , m_master(_master)
    {
        m_head    = m_graph.set_head(rhs);
        m_current = m_head;
        m_dummies.insert({ m_depth, m_current });
    }

References tim::graph< T, AllocatorT >::set_head().

~graph_data()

template<typename NodeT >

tim::graph_data< NodeT >::~graph_data ( )

inline

Definition at line 83 of file graph_data.hpp.

{ m_graph.clear(); }

References tim::graph< T, AllocatorT >::clear().

graph_data() [2/3]

template<typename NodeT >

tim::graph_data< NodeT >::graph_data ( this_type &&  )

delete

graph_data() [3/3]

template<typename NodeT >

tim::graph_data< NodeT >::graph_data ( const this_type &  )

delete

Member Function Documentation

add_dummy()

template<typename NodeT >

void tim::graph_data< NodeT >::add_dummy ( )

inline

Definition at line 141 of file graph_data.hpp.

    {
        if(!m_master)
            return;
 
        if(depth() == m_master->depth())
            return;
 
        DEBUG_PRINT_HERE("[%s][%i]> Adding dummy for depth = %i, master depth = %i",
                         demangle<NodeT>().c_str(), (int) threading::get_id(),
                         (int) depth(), (int) m_master->depth());
 
        auto _current = m_master->current();
        auto _id      = _current->id();
        auto _depth   = _current->depth();
 
        NodeT node(_id, NodeT::get_dummy(), _depth, threading::get_id(),
                   process::get_id(), true);
        m_depth     = _depth;
        m_sea_level = _depth;
        m_current   = m_graph.insert_after(m_head, std::move(node));
 
        m_dummies.insert({ m_depth, m_current });
    }

References tim::graph_data< NodeT >::current(), DEBUG_PRINT_HERE, tim::graph_data< NodeT >::depth(), and tim::graph< T, AllocatorT >::insert_after().

Referenced by tim::graph_data< NodeT >::sync_sea_level().

append_child() [1/2]

template<typename NodeT >

iterator tim::graph_data< NodeT >::append_child ( const NodeT &  node )

inline

Definition at line 226 of file graph_data.hpp.

    {
        ++m_depth;
        return (m_current = m_graph.append_child(m_current, node));
    }

References tim::graph< T, AllocatorT >::append_child().

append_child() [2/2]

template<typename NodeT >

iterator tim::graph_data< NodeT >::append_child ( NodeT &&  node )

inline

Definition at line 232 of file graph_data.hpp.

    {
        ++m_depth;
        return (m_current = m_graph.append_child(m_current, std::move(node)));
    }

References tim::graph< T, AllocatorT >::append_child().

append_head()

template<typename NodeT >

iterator tim::graph_data< NodeT >::append_head ( NodeT &  node )

inline

Definition at line 238 of file graph_data.hpp.

    {
        return m_graph.append_child(m_head, node);
    }

References tim::graph< T, AllocatorT >::append_child().

at_sea_level()

template<typename NodeT >

bool tim::graph_data< NodeT >::at_sea_level ( ) const

inline

Definition at line 95 of file graph_data.hpp.

{ return (m_depth == m_sea_level); }

begin() [1/2]

template<typename NodeT >

iterator tim::graph_data< NodeT >::begin ( )

inline

Definition at line 108 of file graph_data.hpp.

{ return m_graph.begin(); }

References tim::graph< T, AllocatorT >::begin().

Referenced by tim::graph_data< NodeT >::find().

begin() [2/2]

template<typename NodeT >

const_iterator tim::graph_data< NodeT >::begin ( ) const

inline

Definition at line 110 of file graph_data.hpp.

{ return m_graph.begin(); }

References tim::graph< T, AllocatorT >::begin().

clear()

template<typename NodeT >

void tim::graph_data< NodeT >::clear ( )

inline

Definition at line 125 of file graph_data.hpp.

    {
        m_graph.clear();
        m_has_head  = false;
        m_depth     = 0;
        m_sea_level = 0;
        m_current   = nullptr;
        m_dummies.clear();
    }

References tim::graph< T, AllocatorT >::clear().

current()

template<typename NodeT >

iterator & tim::graph_data< NodeT >::current ( )

inline

Definition at line 106 of file graph_data.hpp.

{ return m_current; }

Referenced by tim::graph_data< NodeT >::add_dummy().

depth() [1/2]

template<typename NodeT >

int64_t & tim::graph_data< NodeT >::depth ( )

inline

Definition at line 97 of file graph_data.hpp.

{ return m_depth; }

Referenced by tim::graph_data< NodeT >::add_dummy(), and tim::graph_data< NodeT >::sync_sea_level().

depth() [2/2]

template<typename NodeT >

int64_t tim::graph_data< NodeT >::depth ( ) const

inline

Definition at line 98 of file graph_data.hpp.

{ return m_depth; }

dummy_count()

template<typename NodeT >

auto tim::graph_data< NodeT >::dummy_count ( ) const

inline

Definition at line 94 of file graph_data.hpp.

{ return m_dummies.size(); }

emplace_child() [1/2]

template<typename NodeT >

iterator tim::graph_data< NodeT >::emplace_child ( iterator  _itr, const NodeT &  node  )

inline

Definition at line 243 of file graph_data.hpp.

    {
        return m_graph.append_child(_itr, node);
    }

References tim::graph< T, AllocatorT >::append_child().

emplace_child() [2/2]

template<typename NodeT >

iterator tim::graph_data< NodeT >::emplace_child ( iterator  _itr, NodeT &&  node  )

inline

Definition at line 248 of file graph_data.hpp.

    {
        return m_graph.append_child(_itr, std::move(node));
    }

References tim::graph< T, AllocatorT >::append_child().

end() [1/2]

template<typename NodeT >

iterator tim::graph_data< NodeT >::end ( )

inline

Definition at line 109 of file graph_data.hpp.

{ return m_graph.end(); }

References tim::graph< T, AllocatorT >::end().

Referenced by tim::graph_data< NodeT >::find().

end() [2/2]

template<typename NodeT >

const_iterator tim::graph_data< NodeT >::end ( ) const

inline

Definition at line 111 of file graph_data.hpp.

{ return m_graph.end(); }

References tim::graph< T, AllocatorT >::end().

find()

template<typename NodeT >

iterator tim::graph_data< NodeT >::find ( iterator  itr ) const

inline

Definition at line 189 of file graph_data.hpp.

    {
        if(!itr)
            return end();
 
        for(pre_order_iterator fitr = begin(); fitr != end(); ++fitr)
        {
            if(fitr && *itr == *fitr && get_rolling_hash(itr) == get_rolling_hash(fitr))
                return fitr;
            sibling_iterator entry = fitr;
            for(auto sitr = entry.begin(); sitr != entry.end(); ++sitr)
            {
                if(sitr && *itr == *sitr &&
                   get_rolling_hash(itr) == get_rolling_hash(sitr))
                    return sitr;
            }
        }
        return end();
    }

References tim::graph_data< NodeT >::begin(), tim::graph_data< NodeT >::end(), and tim::graph_data< NodeT >::get_rolling_hash().

get_inverse_insert()

template<typename NodeT >

inverse_insert_t tim::graph_data< NodeT >::get_inverse_insert ( ) const

inline

Definition at line 253 of file graph_data.hpp.

    {
        inverse_insert_t ret;
        for(const auto& itr : m_dummies)
            ret.push_back({ itr.first, itr.second });
        std::reverse(ret.begin(), ret.end());
        return ret;
    }

get_rolling_hash()

template<typename NodeT >

int64_t tim::graph_data< NodeT >::get_rolling_hash ( iterator  itr ) const

inline

Definition at line 209 of file graph_data.hpp.

    {
        int64_t _accum = 0;
        if(itr)
            return _accum;
        _accum += itr->id();
        auto _parent = graph_t::parent(itr);
        while(_parent)
        {
            _accum += _parent->id();
            _parent = graph_t::parent(_parent);
            if(!_parent)
                break;
        }
        return _accum;
    }

References tim::graph< NodeT >::parent().

Referenced by tim::graph_data< NodeT >::find().

graph() [1/2]

template<typename NodeT >

graph_t & tim::graph_data< NodeT >::graph ( )

inline

Definition at line 102 of file graph_data.hpp.

{ return m_graph; }

graph() [2/2]

template<typename NodeT >

const graph_t & tim::graph_data< NodeT >::graph ( ) const

inline

Definition at line 103 of file graph_data.hpp.

{ return m_graph; }

has_head()

template<typename NodeT >

bool tim::graph_data< NodeT >::has_head ( ) const

inline

Definition at line 93 of file graph_data.hpp.

{ return m_has_head; }

head()

template<typename NodeT >

iterator & tim::graph_data< NodeT >::head ( )

inline

Definition at line 105 of file graph_data.hpp.

{ return m_head; }

operator=() [1/2]

template<typename NodeT >

graph_data & tim::graph_data< NodeT >::operator= ( const this_type &  )

delete

operator=() [2/2]

template<typename NodeT >

graph_data & tim::graph_data< NodeT >::operator= ( this_type &&  )

delete

pop_graph()

template<typename NodeT >

iterator tim::graph_data< NodeT >::pop_graph ( )

inline

Definition at line 175 of file graph_data.hpp.

    {
        if(m_depth > 0 && !m_graph.is_head(m_current))
        {
            --m_depth;
            m_current = graph_t::parent(m_current);
        }
        else if(m_depth == 0)
        {
            m_current = m_head;
        }
        return m_current;
    }

References tim::graph< T, AllocatorT >::is_head(), and tim::graph< NodeT >::parent().

reset()

template<typename NodeT >

void tim::graph_data< NodeT >::reset ( )

inline

Definition at line 166 of file graph_data.hpp.

    {
        // for(auto& itr : m_dummies)
        //    m_graph.erase(itr.second);
        m_graph.erase_children(m_head);
        m_depth   = 0;
        m_current = m_head;
    }

References tim::graph< T, AllocatorT >::erase_children().

sea_level() [1/2]

template<typename NodeT >

int64_t & tim::graph_data< NodeT >::sea_level ( )

inline

Definition at line 99 of file graph_data.hpp.

{ return m_sea_level; }

sea_level() [2/2]

template<typename NodeT >

int64_t tim::graph_data< NodeT >::sea_level ( ) const

inline

Definition at line 100 of file graph_data.hpp.

{ return m_sea_level; }

set_master()

template<typename NodeT >

void tim::graph_data< NodeT >::set_master ( graph_data< NodeT > *  _master )

inline

Definition at line 135 of file graph_data.hpp.

    {
        if(_master != this)
            m_master = _master;
    }

sync_sea_level()

template<typename NodeT >

void tim::graph_data< NodeT >::sync_sea_level ( )

inline

Definition at line 113 of file graph_data.hpp.

    {
        if(m_master)
        {
            DEBUG_PRINT_HERE("[%s][%i]> synchronizing sea-level for depth = %i, master "
                             "depth = %i",
                             demangle<NodeT>().c_str(), (int) threading::get_id(),
                             (int) depth(), (int) m_master->depth());
            add_dummy();
        }
    }

References tim::graph_data< NodeT >::add_dummy(), DEBUG_PRINT_HERE, and tim::graph_data< NodeT >::depth().

---

The documentation for this class was generated from the following file:

• timemory/storage/graph_data.hpp