Implemented `Delete` in terms of `Remove`

* analogously to how `Contains` is implemented as a wrapper around `Any`
* added appropriate test case and lessened restrictions on `Contains`'s comparator

1 files changed, 25 insertions, 0 deletions

diff --git a/src/list/operation/delete.h b/src/list/operation/delete.h
new file mode 100644
index 0000000..ad0a4cf
--- /dev/null
+++ b/src/list/operation/delete.h
@@ -0,0 +1,25 @@
+#ifndef TYPEASVALUE_SRC_LIST_OPERATION_DELETE_H_
+#define TYPEASVALUE_SRC_LIST_OPERATION_DELETE_H_
+
+#include "type.h"
+#include "higher/filter.h"
+
+namespace tav {
+
+template <
+	typename Element,
+	typename List
+>
+class Delete {
+	private:
+		template <typename Current>
+		using comparator = EqualValue<Current, Element>;
+
+	public:
+		typedef typename Remove<comparator, List>::type type;
+
+};
+
+}
+
+#endif  // TYPEASVALUE_SRC_LIST_OPERATION_DELETE_H_