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

Document mp_join

Browse Source
This commit is contained in:
Peter Dimov
2021-03-12 06:41:59 +02:00
parent e7f2e7a45d
commit c7dbff81e5
1 changed files with 14 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
doc/mp11/algorithm.adoc
View File

@@ -584,6 +584,20 @@ is `L<L<T...>>`. `mp_split<L<T1..., S, T2..., S, T3...>, S>` is `L<L<T1...>, L<T
The segments may be empty; `mp_split<L<S, X, Y, S, S>, S>` is `L<L<>, L<X, Y>, L<>, L<>>`. The segments may be empty; `mp_split<L<S, X, Y, S, S>, S>` is `L<L<>, L<X, Y>, L<>, L<>>`.
## mp_join<L, S>
template<class L, class S> using mp_join = /*...*/;
`mp_join` is the reverse operation of `mp_split`; it takes a list of segments `L` and joins
them into a single list, inserting the separator `S` between them.
`mp_join<mp_split<L, S>, S>` yields back the original list `L`.
For example, `mp_split<L<X1, X2, S, X3>, S>` gives `L<L<X1, X2>, L<X3>>`, and
`mp_join<L<L<X1, X2>, L<X3>>, S>` results in `L<X1, X2, S, X3>`.
`mp_join<L, S>` is equivalent to (and is implemented as) `mp_apply<mp_append, mp_intersperse<L, mp_list<S>>>`.
## mp_partition<L, P> ## mp_partition<L, P>
template<class L, template<class...> class P> using mp_partition = /*...*/; template<class L, template<class...> class P> using mp_partition = /*...*/;