Class for generating vertex descriptors with a strided pattern.Used by the dynamic graph to add vertices when descriptors are not provided by users.
More...
|
| vdg_strided (size_t start=std::numeric_limits< size_t >::max(), size_t block=10, size_t parts=stapl::get_num_locations(), size_t index=stapl::get_location_id(), bool next=true) |
| Constructor to initialize the strided generator. More...
|
|
vertex_descriptor | next () |
| Generates and returns the next vertex and updates internal version.
|
|
void | free (VD const &) |
| Possibly reclaims descriptors for future use from deleted vertices. Provided for compatibility.
|
|
bool | is_valid (VD const &) |
| Compares the version numbers to see if the iterator is valid. Provided for compatibility with versioning generators.
|
|
void | increment () |
| Manually increment the version number, if needed for some storage. Provided for compatibility with versioning generators.
|
|
void | update (VD const &vd) |
| Integrates the current descriptor into the generated sequence; future invocations of next() should not produce this VD.
|
|
VD | curr_vd () const |
| Returns the current descriptor.
|
|
void | reset () |
| Resets the generator to restart producing descriptors. To be used after clearing the graph.
|
|
template<class VD>
class stapl::vdg_strided< VD >
Class for generating vertex descriptors with a strided pattern.
Used by the dynamic graph to add vertices when descriptors are not provided by users.