Developer Guide and Reference



Variadic template class to describe the valid iteration space over an N-dimensional container.
#include <sdlt/n_bounds.h>


template<typename... TypeListT> class n_bounds_t
n_bound_t represents the valid iteration space over a n_container or its accessor as as a sequence of bounds_t for each dimension. The bounds_t of each dimension can be represented by different types. This flexibility allows the same interface to be used to declare n_bounds_t whose dimensions are fully known at compile time with fixed<int NumberT>, or to be only known at runtime with int, or only known at runtime but with a guarantee will be a multiple of an alignment with aligned<int Alignment>. For details see the Number Representation section).
When an n_container is created, its n_bounds_t always start at fixed<0> for the inclusive lower bounds of each dimension, and exclusive upper bounds match the extent of the dimension. Accessors can be translated to different index spaces as well as restrict their iteration space to subsections, which will change the n_bounds_t those accessors provide.
The following table provides information on the template arguments for
Template Argument
typename... TypeListT
Comma separated list of types, where the number of types provided controls how many dimensions there are. Each type in the list identifies how the bounds of the corresponding dimension is to be represented. The order of the dimensions is the same order as C++ subscripts declaring a multi-dimensional array – from leftmost to rightmost.
Requirements: types in the list be bounds_t<LowerT, UpperT>
The following table provides information on the member types of n_bounds_t
Member Types
typedef implementation-defined lower_type
Type of n_index_t<…> returned by method lower()