STAPL API Reference          
Overview   Containers   Algorithms   Views   Skeletons   Run-Time System
Modules     Classes    
Classes | Modules
Edge Container
+ Collaboration diagram for Edge Container:

Classes

class  stapl::detail::hash_buckets< Bucket, Traits >
 Holds bucket count and array of buckets for hashtable used in edge_storage (and eventually by edge_container). Encapsulated here to properly manage lifetime, so that buckets are destroyed after the Boost.Intrusive unordered_set they serve. More...
 
class  stapl::detail::edge_storage
 Manages storage of edges of the edge_container. More...
 
class  stapl::edge_container
 The edge container maintains a distributed representation of the dependence (edges) for the PARAGRAPH and the various data flows they represent. It is the primary container for the PARAGRAPH infrastructure which is traversed during PARAGRAPH execution as tasks complete execution and notify the edge_container of their return value (if any), triggering data flow to all specified successors in the system. More...
 
struct  stapl::proxy_holder< Proxy >
 Custom PARAGRAPH edge storage a proxy. More...
 
struct  stapl::proxy_pair_holder< Proxy1, Proxy2 >
 Custom PARAGRAPH edge storage for pairs of proxies. More...
 
struct  stapl::df_stored_type< T >
 Type metafunction computing the actual type that will be stored for a requested edge type.Internally, it is useful to modify the type for some special cases outlined below in the various partial specializations of the class. More...
 
struct  stapl::df_stored_type< void >
 Specialization for void edge types (i.e., signals).Internally pass an int to simplify code paths that expect to receive a parameter (can't pass void). More...
 
struct  stapl::df_stored_type< proxy< T, A > >
 Specialization for proxy edge types.Proxies' assignment operators are overloaded to behave like a real reference (i.e., redirect to reference object). We use a proxy_holder to give us a proper assignment operator to use. More...
 
struct  stapl::df_stored_type< std::pair< proxy< T1, A1 >, proxy< T2, A2 > > >
 Specialization for pairs of proxies.Some algorithms use pairs of proxies to denote ranges and transmit these through the edge container. Use a proxy_pair_holder for the same reason discussed in simple proxy specialization of df_stored_type. More...
 
struct  stapl::detail::df_null_functor< T >
 Filtering function object associated internally in the edge_container implementation for edges representing only a SIGNAL (i.e., an explicit predecessor passed to paragraph_view::add_task.To unify the implementation, the function operand returns full value passed to it, but this is not made available to the predecessor task. More...
 
struct  stapl::detail::df_identity< T >
 Filtering function object associated internally in the edge_container implementation for edges representing FULL consumption a producer task's value by the successor. Hence it is an identity filter, returning the full value passed to it. More...
 
struct  stapl::detail::compute_edge_request_type< Functor >
 Template metafunction reflecting edge_request_type value associated with the specified filter type. More...
 
struct  stapl::detail::compute_edge_request_type< df_null_functor< T > >
 Specialization for df_null_functor<T>. Reflect SIGNAL request type. More...
 
struct  stapl::detail::compute_edge_request_type< df_identity< T > >
 Specialization for df_identity<T>. Reflect FULL request type. More...
 
struct  stapl::detail::compare_req
 Unary functor to compare the return value of any object's request method with a given edge_request_type variable.Used to search versions list in edge_entry. More...
 

Modules

 Edge Container Entry and Supporting Code
 
 Edge Notifiers
 
 Edge Container Views
 

Detailed Description