Reference documentation for deal.II version GIT relicensing-1125-gadd8e16ae6 2024-07-19 10:00:01+00:00
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
No Matches
concepts::is_contiguous_container Concept Reference

#include <deal.II/base/template_constraints.h>

Concept definition

template<typename C>
concept concepts::is_contiguous_container = requires(C &c) {

Detailed Description

A concept that identifies whether a template argument C represents a contiguous container. A contiguous container is a container object (such as std::vector, std::array, or boost::container::small_vector that stores its elements in one contiguous array in which we access all elements via a pointer to the first element plus an offset. In contrast, linked lists, maps, and similar objects are typically not stored as contiguous containers.

Definition at line 700 of file template_constraints.h.