Classes | |
struct | pipe_base_forward_t |
Public Types | |
typedef uint64_t | id_t |
typedef node * | val_t |
typedef std::map< id_t, val_t > | map_t |
typedef map_t::const_iterator | mapit |
typedef std::multimap< id_t, std::pair< id_t, node_relation > > | relmap_t |
typedef relmap_t::const_iterator | relmapit |
typedef std::unordered_map < std::string, std::pair < memory_size_type, any_noncopyable > > | datastructuremap_t |
typedef boost::optional < any_noncopyable & > | maybeany_t |
typedef std::unordered_map < std::string, any_noncopyable > | forwardmap_t |
typedef boost::intrusive_ptr < node_map > | ptr |
typedef std::unique_ptr< node > | owned_ptr |
Public Member Functions | |
id_t | add_token (val_t token) |
void | set_token (id_t id, val_t token) |
void | link (ptr target) |
void | union_set (ptr target) |
val_t | get (id_t id) const |
mapit | begin () const |
mapit | end () const |
size_t | size () const |
void | no_forward_through (id_t id) |
ptr | find_authority () |
void | add_relation (id_t from, id_t to, node_relation rel) |
const relmap_t & | get_relations () const |
const datastructuremap_t & | get_datastructures () const |
datastructuremap_t & | get_datastructures () |
size_t | in_degree (id_t from, node_relation rel) const |
size_t | out_degree (id_t from, node_relation rel) const |
size_t | out_degree (id_t from) const |
void | assert_authoritative () const |
void | dump (std::ostream &os=std::cout) const |
void | get_successors (id_t from, std::vector< id_t > &successors, memory_size_type k, bool forward_only=false) |
Compute the set of nodes within k distance of the given node in the item flow graph. More... | |
void | forward (std::string key, any_noncopyable value) |
maybeany_t | fetch_maybe (std::string key) |
void | forward_from_pipe_base (id_t from, std::string key, any_noncopyable value) |
void | forward_pipe_base_forwards () |
void | increment_pipeline_ref () |
void | decrement_pipeline_ref () |
void | add_owned_node (owned_ptr p) |
Static Public Member Functions | |
static ptr | create () |
Friends | |
void | intrusive_ptr_add_ref (node_map *m) |
void | intrusive_ptr_release (node_map *m) |
void tpie::pipelining::bits::node_map::get_successors | ( | id_t | from, |
std::vector< id_t > & | successors, | ||
memory_size_type | k, | ||
bool | forward_only = false |
||
) |
Compute the set of nodes within k distance of the given node in the item flow graph.