Revamped to use `Cons` as a function and `Pair` as its result

* this is analogous to _Scheme_ where a pair (dot-expression) is returned from a call to `cons`
* `Head` and `Tail` are kept as direct references to the `CAR` and `CDR` values of a pair to match e.g. the math operators

1 files changed, 4 insertions, 6 deletions

diff --git a/src/list/operation/higher/partition.h b/src/list/operation/higher/partition.h
index e42b971..a0ea379 100644
--- a/src/list/operation/higher/partition.h
+++ b/src/list/operation/higher/partition.h
@@ -9,12 +9,10 @@ template <
 	template<typename> class Predicate,
 	typename                 List
 >
-struct Partition {
-	typedef Cons<
-		typename Filter<Predicate, List>::type,
-		typename Remove<Predicate, List>::type
-	> type;
-};
+using Partition = Cons<
+	typename Filter<Predicate, List>::type,
+	typename Remove<Predicate, List>::type
+>;
 
 }