draft: introduce concepts to pattern/forall.hpp

include/RAJA/index/IndexSet.hpp

@@ -22,9 +22,6 @@
 
 #include "RAJA/config.hpp"
 
-#include "RAJA/index/ListSegment.hpp"
-#include "RAJA/index/RangeSegment.hpp"
-
 #include "RAJA/internal/Iterators.hpp"
 #include "RAJA/internal/RAJAVec.hpp"
 
@@ -802,6 +799,15 @@ struct is_indexset_policy
 {};
 }  // namespace type_traits
 
+template<typename T>
+concept IndexSetType =
+    static_cast<bool>(RAJA::type_traits::is_index_set<T>::value);
+
+
+template<typename T>
+concept IndexSetPolicy =
+    static_cast<bool>(type_traits::is_indexset_policy<T>::value);
+
 }  // namespace RAJA
 
 #endif  // closing endif for header file include guard

include/RAJA/index/RangeSegment.hpp

@@ -615,7 +615,6 @@ DefineTypeTraitFromConcept(is_range_constructible,
 
 DefineTypeTraitFromConcept(is_range_stride_constructible,
                            RAJA::concepts::RangeStrideConstructible);
-
 }  // namespace type_traits
 
 }  // namespace RAJA

include/RAJA/pattern/detail/TypeTraits.hpp

@@ -21,6 +21,7 @@
 #ifndef RAJA_TYPETRAITS_HPP
 #define RAJA_TYPETRAITS_HPP
 
+#include "RAJA/policy/PolicyBase.hpp"
 #include <type_traits>
 #include <camp/camp.hpp>
 
@@ -96,6 +97,16 @@ struct tuple_contains_Reducers<camp::tuple<Params...>>
 {};
 
 }  // namespace expt
+
+namespace type_traits
+{
+template<typename Policy>
+consteval bool is_policy_forall()
+{
+  return std::is_base_of_v<PolicyBase, Policy> &&
+         Policy {}.pattern == RAJA::Pattern::forall;
+}
+}  // namespace type_traits
 }  // namespace RAJA
 
 #endif  //  RAJA_TYPETRAITS_HPP

include/RAJA/pattern/forall-concepts.hpp

@@ -0,0 +1,47 @@
+#ifndef RAJA_forall_concepts_HPP
+#define RAJA_forall_concepts_HPP
+
+#include "RAJA/config.hpp"
+
+#include "RAJA/pattern/detail/TypeTraits.hpp"
+#include "RAJA/index/IndexSet.hpp"
+#include "RAJA/index/RangeSegment.hpp"
+#include "RAJA/policy/MultiPolicy.hpp"
+#include "detail/TypeTraits.hpp"
+
+namespace RAJA
+{
+// TODO: Several of these are based on camp type_traits, which themselves are
+// automatically generated by camp's pseudo-concept interface.  We wish to
+// simplify this chain of requirements, potentially moving the concepts
+// themselves into camp
+
+// The Range concept is derived from camp.  This concept is satisfied by any
+// type with a begin() and end() iterator.
+template<typename T>
+concept Range = static_cast<bool>(type_traits::is_range<camp::decay<T>>::value);
+
+// RandomAccessRange is also derived from camp, and is satisfied by any type
+// with begin/end iterators and random access.
+template<typename T>
+concept RandomAccessRange = Range<T> && static_cast<bool>(
+    type_traits::is_random_access_range<camp::decay<T>>::value);
+
+template<typename T>
+concept MultiPolicyConcept = static_cast<bool>(
+    RAJA::type_traits::is_multi_policy<camp::decay<T>>::value);
+
+template<typename T>
+concept Integer =
+    static_cast<bool>(type_traits::is_integral<camp::decay<T>>::value);
+
+template<typename Pol>
+concept ForallPolicy = RAJA::type_traits::is_policy_forall<Pol>();
+
+template<typename T>
+concept ForallParameterPack =
+    RAJA::expt::type_traits::is_ForallParamPack<camp::decay<T>>::value;
+
+}  // namespace RAJA
+
+#endif