This class abstracts the semantics of a reverse k-ary tree by exposing only the necessary information in its representation. More...
Public Types | |
using | skeleton_tag_type = tags::reverse_tree< Arity > |
using | base_type = decltype(skeletons::repeat< Flows >(skeletons::elem< Span >(std::declval< PD >()), log_lazysize< Arity >())) |
This class abstracts the semantics of a reverse k-ary tree by exposing only the necessary information in its representation.
A k-ary reverse tree expands in size by k starting from 1 as the levels are increased.
This skeleton is used in several composed skeletons such as broadcast
skeleton.
This abstractions not only makes the reconstruction of a a k-ary skeleton easier, but also reduces the symbol size for a k-ary tree skeleton, hence, reducing the total compilation time.
PD | the underlying parametric dependency used in each level of the reverse tree. |
Arity | the arity of the reverse tree. |
Flows | the flow between the levels of the k-ary reverse tree. |
Span | the iteration space for the elements in each level. |