Specialize ArrayViewHelper::is_contiguous() for pointers.

diff --git a/include/deal.II/base/array_view.h b/include/deal.II/base/array_view.h
index 33e0e0848473051f0750aa9ddb37db9414b99eb2..04648f3d168cbb076d08d24f15d05f12f0a8744b 100644 (file)
--- a/include/deal.II/base/array_view.h
+++ b/include/deal.II/base/array_view.h
@@ -429,7 +429,12 @@ namespace internal
 {
   namespace ArrayViewHelper
   {
-    template<class Iterator>
+    /**
+     * Return whether the objects one gets by dereferencing the
+     * iterators within the given iterator range form a contiguous
+     * range in memory.
+     */
+    template <class Iterator>
     bool is_contiguous(const Iterator &first, const Iterator &last)
     {
       const auto n = std::distance(first, last);
@@ -438,6 +443,25 @@ namespace internal
           return false;
       return true;
     }
+
+
+    /**
+     * Return whether the objects one gets by dereferencing the
+     * iterators within the given iterator range form a contiguous
+     * range in memory.
+     *
+     * This specialization for (@p const or non-@p const) pointers
+     * returns @p true unconditionally since the fact that objects
+     * pointed to by pointers are contiguous is embedded in the memory
+     * model of C++.
+     */
+    template <class T>
+    constexpr
+    bool is_contiguous(T *,
+                       T *)
+    {
+      return true;
+    }
   }
 }
 #endif