Units library moved to concepts world

src/include/units/bits/stdconcepts.h

@@ -0,0 +1,44 @@
+// The MIT License (MIT)
+//
+// Copyright (c) 2018 Mateusz Pusz
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in all
+// copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+// SOFTWARE.
+
+#pragma once
+
+#include <ratio>
+#include <type_traits>
+
+namespace mp {
+
+  namespace detail {
+    template<class T, class U>
+    bool concept SameHelper = std::is_same_v<T, U>;
+  }
+
+  template<class T, class U>
+  bool concept Same = detail::SameHelper<T, U> && detail::SameHelper<U, T>;
+
+  template <class From, class To>
+  bool concept ConvertibleTo = std::is_convertible_v<From, To> &&
+      requires(From (&f)()) {
+          static_cast<To>(f());
+      };
+
+}  // namespace mp

src/include/units/bits/tools.h

@@ -22,16 +22,12 @@
 
 #pragma once
 
+#include "stdconcepts.h"
 #include <ratio>
 #include <type_traits>
 
 namespace mp {
 
-  // Requires
-
-  template<bool B>
-  using Requires = std::enable_if_t<B, bool>;
-
   // static_sign
 
   template<std::intmax_t Pn>
@@ -60,6 +56,8 @@ namespace mp {
 
   // is_ratio
 
+  namespace detail {
+
   template<typename T>
   struct is_ratio : std::false_type {
   };
@@ -68,17 +66,22 @@ namespace mp {
   struct is_ratio<std::ratio<Num, Den>> : std::true_type {
   };
 
+  }
+
+  template<typename T>
+  bool concept Ratio = detail::is_ratio<T>::value;
+
   // common_ratio
 
   // todo: simplified
-  template<typename Ratio1, typename Ratio2>
+  template<Ratio Ratio1, Ratio Ratio2>
   struct common_ratio {
     using gcd_num = static_gcd<Ratio1::num, Ratio2::num>;
     using gcd_den = static_gcd<Ratio1::den, Ratio2::den>;
     using type = std::ratio<gcd_num::value, (Ratio1::den / gcd_den::value) * Ratio2::den>;
   };
 
-  template<typename Ratio1, typename Ratio2>
+  template<Ratio Ratio1, Ratio Ratio2>
   using common_ratio_t = typename common_ratio<Ratio1, Ratio2>::type;
 
 }  // namespace mp

src/include/units/bits/type_list.h

@@ -32,9 +32,22 @@ namespace mp {
   template<typename... Types>
   struct type_list;
 
+  namespace detail {
+
+    template<typename T>
+    struct is_type_list : std::false_type {};
+
+    template<typename... Types>
+    struct is_type_list<type_list<Types...>> : std::true_type {};
+
+  }
+
+  template<typename T>
+  bool concept TypeList = detail::is_type_list<T>::value;
+
   // push_front
 
-  template<typename TypeList, typename... Types>
+  template<TypeList List, typename... Types>
   struct type_list_push_front;
 
   template<typename... OldTypes, typename... NewTypes>
@@ -42,12 +55,12 @@ namespace mp {
     using type = type_list<NewTypes..., OldTypes...>;
   };
 
-  template<typename TypeList, typename... Types>
-  using type_list_push_front_t = typename type_list_push_front<TypeList, Types...>::type;
+  template<TypeList List, typename... Types>
+  using type_list_push_front_t = typename type_list_push_front<List, Types...>::type;
 
   // push_back
 
-  template<typename TypeList, typename... Types>
+  template<TypeList List, typename... Types>
   struct type_list_push_back;
 
   template<typename... OldTypes, typename... NewTypes>
@@ -55,8 +68,8 @@ namespace mp {
     using type = type_list<OldTypes..., NewTypes...>;
   };
 
-  template<typename TypeList, typename... Types>
-  using type_list_push_back_t = typename type_list_push_back<TypeList, Types...>::type;
+  template<TypeList List, typename... Types>
+  using type_list_push_back_t = typename type_list_push_back<List, Types...>::type;
 
   // split
 
@@ -76,17 +89,18 @@ namespace mp {
       using base = split_impl<Idx + 1, N, Rest...>;
       using base_first = typename base::first_list;
       using base_second = typename base::second_list;
-      using first_list = std::conditional_t < Idx<N, type_list_push_front_t<base_first, T>, base_first>;
-      using second_list = std::conditional_t < Idx<N, base_second, type_list_push_front_t<base_second, T>>;
+      using first_list = std::conditional_t<Idx<N, type_list_push_front_t<base_first, T>, base_first>;
+      using second_list = std::conditional_t<Idx<N, base_second, type_list_push_front_t<base_second, T>>;
     };
 
   }  // namespace detail
 
-  template<typename T, std::size_t N>
+  template<TypeList List, std::size_t N>
   struct type_list_split;
 
   template<std::size_t N, typename... Types>
   struct type_list_split<type_list<Types...>, N> {
+    static_assert(N <= sizeof...(Types), "Invalid index provided");
     using split = detail::split_impl<0, N, Types...>;
     using first_list = typename split::first_list;
     using second_list = typename split::second_list;
@@ -94,7 +108,7 @@ namespace mp {
 
   // split_half
 
-  template<typename T>
+  template<TypeList List>
   struct type_list_split_half;
 
   template<typename... Types>
@@ -103,11 +117,11 @@ namespace mp {
 
   // merge_sorted
 
-  template<typename T1, typename T2, template<typename, typename> typename Pred>
+  template<TypeList SortedList1, TypeList SortedList2, template<typename, typename> typename Pred>
   struct type_list_merge_sorted;
 
-  template<typename T1, typename T2, template<typename, typename> typename Pred>
-  using type_list_merge_sorted_t = typename type_list_merge_sorted<T1, T2, Pred>::type;
+  template<TypeList SortedList1, TypeList SortedList2, template<typename, typename> typename Pred>
+  using type_list_merge_sorted_t = typename type_list_merge_sorted<SortedList1, SortedList2, Pred>::type;
 
   template<typename... Lhs, template<typename, typename> typename Pred>
   struct type_list_merge_sorted<type_list<Lhs...>, type_list<>, Pred> {
@@ -132,7 +146,7 @@ namespace mp {
 
   // sort
 
-  template<typename T, template<typename, typename> typename Pred>
+  template<TypeList List, template<typename, typename> typename Pred>
   struct type_list_sort;
 
   template<template<typename, typename> typename Pred>
@@ -154,7 +168,7 @@ namespace mp {
     using type = type_list_merge_sorted_t<left, right, Pred>;
   };
 
-  template<typename T, template<typename, typename> typename Pred>
-  using type_list_sort_t = typename type_list_sort<T, Pred>::type;
+  template<TypeList TypeList, template<typename, typename> typename Pred>
+  using type_list_sort_t = typename type_list_sort<TypeList, Pred>::type;
 
 }  // namespace mp