List

A sequence of types. More...

Classes
struct	boost::mpl11::list< xs >
	A List containing the given elements. More...
struct	boost::mpl11::list_< xs >
	Constructor equivalent to list, except it takes unboxed arguments. More...
struct	boost::mpl11::cons< x, xs >
	A List created by prepending an element to an Iterable. More...
struct	boost::mpl11::snoc< xs, x >
	A List created by appending an element to an Iterable. More...
struct	boost::mpl11::iterate< f, x >
	Returns an infinite List of repeated applications of f to x. More...
struct	boost::mpl11::repeat< x >
	Returns an infinite List containing copies of x. More...
struct	boost::mpl11::take< n, xs >
	Returns the first n elements of a List. More...
struct	boost::mpl11::take_c< n, xs >
	Equivalent to take<size_t<n>, xs>. More...
struct	boost::mpl11::take_while< predicate, xs >
	Returns the longest prefix of a List in which all elements satisfy the predicate. More...
struct	boost::mpl11::take_until< predicate, xs >
	Equivalent to take_while with a negated predicate. More...
struct	boost::mpl11::reverse< xs >
	Returns a List with its elements in reverse order. More...
struct	boost::mpl11::filter< predicate, xs >
	Returns a List containing only the elements satisfying predicate. More...
struct	boost::mpl11::scanl< f, state, xs >
	scanl is similar to foldl, but returns a List of successive reduced values from the left. More...
struct	boost::mpl11::zip_with< f, lists >
	Returns a list of applications of f to the elements of the zipped lists, in lockstep. More...
struct	boost::mpl11::zip< lists >
	Equivalent to zip_with<lift<list>, lists...>. More...
struct	boost::mpl11::concat< lists >
	Concatenate several lists. More...
struct	boost::mpl11::slice< xs, start, stop >
	Returns a subrange of a list. More...
struct	boost::mpl11::slice_c< xs, start, stop >
	Equivalent to slice<xs, size_t<start>, size_t<stop>>. More...
struct	boost::mpl11::sort_by< predicate, xs >
	Returns a list sorted with the predicate. More...
struct	boost::mpl11::init< xs >
	Returns the elements before the last one of a non-empty list. More...

Detailed Description

A sequence of types.

Instance of

Iterable, Functor

Todo:

• Find out how to minimize the number of instantiations. In the current implementation, the whole list has to be re-indexed each time we modify it.
• Use rewrite rules for repeat and take.
• If the iterable is infinite, snoc and init could be id.