aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--README.md8
-rw-r--r--test.cc2
2 files changed, 6 insertions, 4 deletions
diff --git a/README.md b/README.md
index f7f0b5d..50d6dff 100644
--- a/README.md
+++ b/README.md
@@ -2,7 +2,7 @@
…is a template metaprogramming library intended for compile time computation written in C++. As its name implies it follows the overall concept of viewing types as values and templates as functions manipulating those values.
-This library is currently primarily a reimplementation of my previous attempt at this problem: [ConstList](https://github.com/KnairdA/ConstList). As detailed in the appropriate [blog article](http://blog.kummerlaender.eu/article/a_look_at_compile_time_computation_in_cpp/) the mixed approach between generic lambda expressions, `constexpr` marked functions and template metaprogramming doesn't offer sufficient flexibility which led me to approach compile time computation in a slightly different manner via this new library.
+This library is a expanded reimplementation of my previous attempt at this problem: [ConstList](https://github.com/KnairdA/ConstList). As detailed in the appropriate [blog article](http://blog.kummerlaender.eu/article/a_look_at_compile_time_computation_in_cpp/) the mixed approach between generic lambda expressions, `constexpr` marked functions and template metaprogramming doesn't offer sufficient flexibility which led me to approach compile time computation in a slightly different manner via this new library. As one might notice this boils down to using _Scheme_ as a metaphor for C++ template metaprogramming. In fact all test cases and examples are documented by representing their logic in _Scheme_.
## Example
@@ -23,16 +23,18 @@ const std::size_t count = tav::Length<
* guaranteed evaluation during compile time
* basic math and logic operations
* conditionals
-* `Cons` structure
-* `List` function as helper for `Cons` construction
+* `Cons` constructor for `Pair` type
+* `List` function as helper for `Pair` based list construction
* basic list operators such as `Nth`, `Length`, `Take` and `Append`
* list generators such as `Iota` and `MakeList`
* higher order list operation `Fold`
* higher order list operations such as `Map` and `Filter` expressed in terms of `Fold`
* higher order list queries such as `Find`, `Any`, `All` and `None`
* higher order list generators such as `ListTabulate`
+* higher order list operations such as `TakeWhile`, `Partition` and `Sort`
* basic partial function application support using `Apply`
* `static_assert` based test cases for all of the above
+* MIT license
## Requirements
diff --git a/test.cc b/test.cc
index 3b35cd3..8a5c499 100644
--- a/test.cc
+++ b/test.cc
@@ -602,7 +602,7 @@ static_assert(
tav::Pair<
tav::List<tav::Int<1>, tav::Int<3>>::type,
tav::List<tav::Int<2>>::type
- >::type,
+ >,
tav::Partition<
tav::Odd,
tav::List<tav::Int<1>, tav::Int<2>, tav::Int<3>>::type