Implemented `Remove` and `Partition` higher order list functions

* `Remove` is a basic `Filter` alias that negates its predicate
* `Partition` builds on both `Remove` and `Filter` to return both the elements satisfying a predicate and those which don't

1 files changed, 18 insertions, 4 deletions

diff --git a/src/list/operation/higher/filter.h b/src/list/operation/higher/filter.h
index 8788aed..d91735e 100644
--- a/src/list/operation/higher/filter.h
+++ b/src/list/operation/higher/filter.h
@@ -7,7 +7,7 @@
 namespace tav {
 
 template <
-	template<typename> class Function,
+	template<typename> class Predicate,
 	typename                 List
 >
 class Filter {
@@ -16,16 +16,30 @@ class Filter {
 			typename Current,
 			typename Previous
 		>
-		struct function_wrapper {
+		struct predicate_wrapper {
 			typedef If<
-				Function<Current>::type::value,
+				Predicate<Current>::type::value,
 				Cons<Current, Previous>,
 				Previous
 			> type;
 		};
 
 	public:
-		typedef typename Fold<function_wrapper, void, List>::type type;
+		typedef typename Fold<predicate_wrapper, void, List>::type type;
+
+};
+
+template <
+	template<typename> class Predicate,
+	typename                 List
+>
+class Remove {
+	private:
+		template <typename Element>
+		using predicate_negator = Not<Predicate<Element>>;
+
+	public:
+		typedef typename Filter<predicate_negator, List>::type type;
 
 };