feedc0de/boost_mp11
1
0
Fork 0
forked from boostorg/mp11
Code Pull Requests Activity

Update documentation

Browse Source
This commit is contained in:
Peter Dimov
2023-12-18 18:29:53 +02:00
parent 4db3374eed
commit 6ffe4c3d75
2 changed files with 5 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/mp11/algorithm.adoc
View File

@@ -19,6 +19,10 @@ http://www.boost.org/LICENSE_1_0.txt
`mp_transform<F, L1<T1...>, L2<T2...>, ..., Ln<Tn...>>` applies `F` to each successive tuple of elements and returns `L1<F<T1, T2, ..., Tn>...>`.
Has limited support of value lists as `L...` under {cpp}17 (for one to three lists.)
In that case, elements are wrapped with `mp_value` before being passed to `F`, and
are unwrapped afterwards. The result is `L1<F<mp_value<T1>, mp_value<T2>, ...>::value...>`.
.Using mp_transform to produce a list of pointers from a list of pointees
```
template<class T> using add_pointer_t =

1
doc/mp11/changelog.adoc
View File

@@ -15,6 +15,7 @@ http://www.boost.org/LICENSE_1_0.txt
* Added `mp_sliding_fold`, a generalization of `mp_pairwise_fold` (contributed by Braden Ganetsky)
* Added `mp_slice` (thanks to Braden Ganetsky)
* Added value list support to `mp_min_element`, `mp_max_element`.
* Added limited value list support to `mp_transform`.
## Changes in 1.83.0