From beb46377c075ccc07a22b45771f8ad993a4e088e Mon Sep 17 00:00:00 2001 From: Adrian Kummerlaender Date: Sun, 8 Feb 2015 20:38:00 +0100 Subject: Implemented higher order `Sort` list operation * _Quicksort_ is the algorithm of choice ** it lends itself quite well to the _TypeAsValue_ approach because of its recursive nature ** this required implementation of a `Drop` counterpart to `Take` * the middle item of a given list is selected as the _pivot_ element * the `List` list contructor had to be expanded to allow `void` arguments inside its variadic parameter pack * added appropriate test cases --- src/list/list.h | 11 +++++++++++ 1 file changed, 11 insertions(+) (limited to 'src/list/list.h') diff --git a/src/list/list.h b/src/list/list.h index 2e335e2..d2a5cb0 100644 --- a/src/list/list.h +++ b/src/list/list.h @@ -21,6 +21,16 @@ struct List { typedef typename Cons::type type; }; +template +struct List { + typedef typename List::type type; +}; + +template +struct List { + typedef typename List::type type; +}; + template < typename Type, Type... Values @@ -40,6 +50,7 @@ using Tail = typename Cdr::type; #include "operation/basic.h" #include "operation/nth.h" #include "operation/take.h" +#include "operation/drop.h" #include "operation/append.h" #include "operation/concatenate.h" -- cgit v1.2.3