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) {
    {
      std::data(c)
    };
    {
      std::size(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 701 of file template_constraints.h.