STAPL API Reference          
Overview   Containers   Algorithms   Views   Skeletons   Run-Time System
Modules     Classes    
List of all members | Public Member Functions | Public Types
stapl::continuous_domain< T > Class Template Reference

Defines a domain where the indexes are continuous and not numerable (e.g., float, string), but there is an order relation among the indexes (e.g., lexicographical order). More...

Public Member Functions

 continuous_domain (index_type const &first, index_type const &last, bool full_container=false)
 Construct a domain containing the indexes from first to last (included). More...
 
index_type first (void) const
 
index_type last (void) const
 
index_type open_last (void) const
 Returns termination value for comparison. More...
 
bool contains (index_type const &g) const
 
size_type size (void) const
 
bool empty (void) const
 
bool is_same_container_domain (void) const
 
size_type distance (index_type const &, index_type const &) const
 Returns how many positions are needed to advance from the index i to reach the index j. More...
 
bool less_than (index_type const &i0, index_type const &i1) const
 
template<typename ODom >
continuous_domain operator & (ODom const &other) const
 Returns the resulting intersection with the given other domain.
 

Public Types

typedef T index_type
 
typedef index_type gid_type
 
typedef std::size_t size_type
 

Detailed Description

template<typename T>
class stapl::continuous_domain< T >

Defines a domain where the indexes are continuous and not numerable (e.g., float, string), but there is an order relation among the indexes (e.g., lexicographical order).

The domain is defined as a range of indexes between first index and last index (included) $ [first..last]$.

Template Parameters
TIndex type.

Constructor & Destructor Documentation

◆ continuous_domain()

template<typename T >
stapl::continuous_domain< T >::continuous_domain ( index_type const &  first,
index_type const &  last,
bool  full_container = false 
)

Construct a domain containing the indexes from first to last (included).

If full_container is specified as true, the domain will be flagged as a domain that contains all the indexes of a container.

Member Function Documentation

◆ first()

template<typename T >
index_type stapl::continuous_domain< T >::first ( void  ) const

◆ last()

template<typename T >
index_type stapl::continuous_domain< T >::last ( void  ) const

◆ open_last()

template<typename T >
index_type stapl::continuous_domain< T >::open_last ( void  ) const

Returns termination value for comparison.

◆ contains()

template<typename T >
bool stapl::continuous_domain< T >::contains ( index_type const &  g) const

◆ size()

template<typename T >
size_type stapl::continuous_domain< T >::size ( void  ) const

◆ empty()

template<typename T >
bool stapl::continuous_domain< T >::empty ( void  ) const

◆ is_same_container_domain()

template<typename T >
bool stapl::continuous_domain< T >::is_same_container_domain ( void  ) const

◆ distance()

template<typename T >
size_type stapl::continuous_domain< T >::distance ( index_type const &  ,
index_type const &   
) const

Returns how many positions are needed to advance from the index i to reach the index j.

Note
The returned value does not define in which direction advance.

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