Eric Niebler

``` c++ #include struct is_positive { template using invoke = meta::bool_ 0)>; }; using list = meta::list< meta::int_, meta::int_, meta::int_, meta::int_ >; using result = meta::all_of; ``` ...results in: ```...

Integrate self-recursive lambdas

2

``` cpp namespace meta_detail { template struct lambda_rec_; template struct lambda_rec_ { template using apply = apply; }; } //////////////////////////////////////////////////////////////////////////////////// // lambda_rec /// For defining a self-recursive lambda. In the...

Careful rethink of what concepts are presented in the docs

7

The docs talk about metafunctions first and foremost, but Meta isn't fundamentally about metafunctions. Rethink how we present the core concepts of Meta. And we _really_ need to discuss `let`,...

Either that or stop claiming to support that compiler.

See [P2325](http://wg21.link/p2325).

add a benchmark for ericniebler/stl2#34

22

Thusly proving that @tomaszkam's "itinerary" example can be implemented efficiently in STL2 with very minor changes, leaving the `CommonReference` requirement intact on `StrictTotallyOrderedWith`. The benchmark, compiled with gcc-8.1 on a...

Required expression `i += n` where `n` is the (signed) difference type. To evaluate, `n` is first converted to unsigned ([conv.integral]): > If the destination type is unsigned, the resulting...