| Cboost::mpl11::always< x > | Returns a constant metafunction class returning x regardless of the arguments it is invoked with |
| Cboost::mpl11::apply< f, x > | Invokes a metafunction class with the given arguments |
| ►Cboost::mpl11::apply< f, x, y > | |
| Cboost::mpl11::infix< x, f, y > | Applies a metafunction class in infix notation |
| ►Cboost::mpl11::apply< foldl< lift< partial >, f, structure > > | |
| Cboost::mpl11::unpack< f, structure > | Invokes a metafunction class with the contents of a structure |
| Cboost::mpl11::apply< unpack< into< list >, cons< x, xs > >::type > | |
| Cboost::mpl11::arg< n > | Returns the nth of its arguments |
| Cboost::mpl11::argmap< f, g > | Invokes f with the result of mapping g on each argument |
| Cboost::mpl11::at< index, iter > | Returns the element of an iterable at the given index |
| ►Cboost::mpl11::at< size_t< index >, iter > | |
| Cboost::mpl11::at_c< index, iter > | Equivalent to at<size_t<index>, iter> |
| Cboost::mpl11::bind< f, fs > | Invokes f with the result of invoking each fs... with the arguments |
| Cboost::mpl11::box< x > | Boxes its argument |
| Cboost::mpl11::cast_to< To > | Metafunction class converting an object to the To datatype |
| Cboost::mpl11::compl_< x > | Bitwise complement (~) |
| Cboost::mpl11::compose< f, fs > | Returns the composition of several metafunction classes |
| Cboost::mpl11::cons< x, xs > | A List created by prepending an element to an Iterable |
| Cboost::mpl11::cons< head< xs >, take_impl< n-1, tail< xs > > > | |
| ►Cboost::mpl11::cons< x, iterate< f, f::type::template apply< x > > > | |
| Cboost::mpl11::iterate< f, x > | Returns an infinite List of repeated applications of f to x |
| ►Cboost::mpl11::cons< x, repeat< x > > | |
| Cboost::mpl11::repeat< x > | Returns an infinite List containing copies of x |
| Cboost::mpl11::curry< n, f > | Returns a curried metafunction class |
| Cboost::mpl11::datatype< ctor > | Returns the datatype of the given data constructor |
| Cboost::mpl11::detail::dependent<> | Turns a value or a type into a dependent entity |
| Cboost::mpl11::div< x, y > | Integer division of x by y |
| Cboost::mpl11::drop< n, iter > | Drops the first n elements from an iterable and return the rest |
| ►Cboost::mpl11::drop< size_t< n >, iter > | |
| Cboost::mpl11::drop_c< n, iter > | Equivalent to drop<size_t<n>, iter>; provided for convenience |
| Cboost::mpl11::drop_while< predicate, iter > | Drops elements from an iterable up to, but not including, the first element for which the predicate returns false |
| ►Cboost::mpl11::drop_while< compose< lift< not_ >, predicate >, iter > | |
| Cboost::mpl11::drop_until< predicate, iter > | Equivalent to drop_while with a negated predicate |
| Cboost::mpl11::else_< Else > | Transparent alias to its argument; provided for use with if_ |
| Cboost::mpl11::flip< f > | Returns a metafunction class invoking f with its two first arguments in reverse order |
| Cboost::mpl11::fmap< f, structure > | Returns the result of mapping a metafunction class over a Functor |
| Cboost::mpl11::fmap< f, xs > | |
| Cboost::mpl11::foldl< f, state, structure > | Left-associative fold of a structure using a binary operation |
| Cboost::mpl11::foldl1< f, structure > | Variant of foldl that has no base case, and thus may only be applied to non-empty structures |
| ►Cboost::mpl11::foldl< flip< lift< cons > >, list<>, xs > | |
| Cboost::mpl11::reverse< xs > | Returns a List with its elements in reverse order |
| Cboost::mpl11::foldr< f, state, structure > | Right-associative fold of a structure using a binary operation |
| Cboost::mpl11::foldr1< f, structure > | Variant of foldr that has no base case, and thus may only be applied to non-empty structures |
| ►Cboost::mpl11::foldr1< bind< lift< if_ >, predicate, arg< 1 >, arg< 2 > >, structure > | |
| Cboost::mpl11::minimum_by< predicate, structure > | The least element of a non-empty structure with respect to the given predicate |
| ►Cboost::mpl11::foldr1< bind< lift< if_ >, predicate, arg< 2 >, arg< 1 > >, structure > | |
| Cboost::mpl11::maximum_by< predicate, structure > | The largest element of a non-empty structure with respect to the given predicate |
| ►Cboost::mpl11::foldr1< lift< max >, structure > | |
| Cboost::mpl11::maximum< structure > | Returns the largest element of a non-empty structure |
| ►Cboost::mpl11::foldr1< lift< min >, structure > | |
| Cboost::mpl11::minimum< structure > | Returns the least element of a non-empty structure |
| ►Cboost::mpl11::foldr< compose< lift< and_ >, compose< lift< not_ >, lift< id > > >, true_, structure > | |
| ►Cboost::mpl11::all< compose< lift< not_ >, lift< id > >, structure > | |
| ►Cboost::mpl11::none< lift< id >, structure > | |
| Cboost::mpl11::none_of< structure > | Equivalent to none<lift<id>, structure> |
| ►Cboost::mpl11::foldr< compose< lift< and_ >, compose< lift< not_ >, predicate > >, true_, structure > | |
| ►Cboost::mpl11::all< compose< lift< not_ >, predicate >, structure > | |
| Cboost::mpl11::none< predicate, structure > | Returns whether none of the elements of the structure satisfy the predicate |
| ►Cboost::mpl11::foldr< compose< lift< and_ >, lift< id > >, true_, structure > | |
| ►Cboost::mpl11::all< lift< id >, structure > | |
| Cboost::mpl11::all_of< structure > | Equivalent to all<lift<id>, structure> |
| ►Cboost::mpl11::foldr< compose< lift< and_ >, predicate >, true_, structure > | |
| Cboost::mpl11::all< predicate, structure > | Returns whether all the elements of the structure satisfy the predicate |
| ►Cboost::mpl11::foldr< lift< concat >, list<>, list< xs...> > | |
| Cboost::mpl11::concat< lists > | Concatenate several lists |
| ►Cboost::mpl11::foldr< lift< cons >, list< x >, xs > | |
| Cboost::mpl11::snoc< xs, x > | A List created by appending an element to an Iterable |
| Cboost::mpl11::foldr< lift< cons >, ys, xs > | |
| ►Cboost::mpl11::foldr< lift< mult >, one< Integer >, structure > | |
| Cboost::mpl11::product< structure > | Compute the product of the elements of a structure |
| ►Cboost::mpl11::foldr< lift< plus >, zero< Integer >, structure > | |
| Cboost::mpl11::sum< structure > | Compute the sum of the elements of a structure |
| ►Cboost::mpl11::foldr< list_detail::filter_op< predicate >, list<>, xs > | |
| Cboost::mpl11::filter< predicate, xs > | Returns a List containing only the elements satisfying predicate |
| ►Cboost::mpl11::foldr< list_detail::take_while_op< compose< lift< not_ >, predicate > >, list<>, xs > | |
| ►Cboost::mpl11::take_while< compose< lift< not_ >, predicate >, xs > | |
| Cboost::mpl11::take_until< predicate, xs > | Equivalent to take_while with a negated predicate |
| ►Cboost::mpl11::foldr< list_detail::take_while_op< predicate >, list<>, xs > | |
| Cboost::mpl11::take_while< predicate, xs > | Returns the longest prefix of a List in which all elements satisfy the predicate |
| Cboost::mpl11::head< iter > | Returns the first element of a non-empty iterable |
| Cboost::mpl11::head< box< xs > > | |
| Cboost::mpl11::id< x > | The identity metafunction - returns its argument unchanged |
| ►Cboost::mpl11::if_< Condition, Then, Else > | Evaluates one of two branches based on a condition |
| Cboost::mpl11::else_if< Condition, Then, Else > | Equivalent to if_; provided for use with if_ |
| ►Cboost::mpl11::if_< or_< is_empty< lists >...>, list<>, cons< f::type::template apply< head< lists >...>, zip_with< f, tail< lists >...> > > | |
| Cboost::mpl11::zip_with< f, lists > | Returns a list of applications of f to the elements of the zipped lists, in lockstep |
| ►Cboost::mpl11::if_< or_< is_empty< lists >...>, list<>, cons< lift< list >::type::template apply< head< lists >...>, zip_with< lift< list >, tail< lists >...> > > | |
| ►Cboost::mpl11::zip_with< lift< list >, lists...> | |
| Cboost::mpl11::zip< lists > | Equivalent to zip_with<lift<list>, lists...> |
| ►Cboost::mpl11::if_c< Condition, Then, Else > | Equivalent to if_<bool_<Condition>, Then, Else> |
| Cboost::mpl11::else_if_c< Condition, Then, Else > | Equivalent to else_if<bool_<Condition>, Then, Else> |
| ►Cboost::mpl11::if_c< detail::std_is_same< From, To >::value, lift< box >, core_detail::invalid_cast< From, To > > | |
| Cboost::mpl11::cast< From, To > | Metafunction class converting an object of the From datatype to an object of the To datatype |
| ►Cboost::mpl11::if_c< is_empty< tail< xs > >::value, list<>, cons< head< xs >, init< tail< xs > > > > | |
| Cboost::mpl11::init< xs > | Returns the elements before the last one of a non-empty list |
| ►Cboost::mpl11::if_c< is_empty< xs >::value, list< state >, cons< state, scanl< f, apply< f, state, head< xs > >, tail< xs > > > > | |
| Cboost::mpl11::scanl< f, state, xs > | scanl is similar to foldl, but returns a List of successive reduced values from the left |
| ►Cboost::mpl11::if_c< or_< is_empty< xs >, is_empty< tail< xs > > >::value, xs, list_detail::sort_by_impl< pred, xs > > | |
| Cboost::mpl11::sort_by< predicate, xs > | Returns a list sorted with the predicate |
| Cboost::mpl11::detail::index_pair< index, value > | Empty struct (not a mpl::pair) |
| Cboost::mpl11::detail::index_pair< indices, xs > | |
| Cboost::mpl11::infix_< x, f, y > | Equivalent to infix<x, lift<f>, y>; provided for convenience |
| Cboost::mpl11::detail::inherit< xs > | Type multiply inheriting from each of the xs... |
| Cboost::mpl11::instantiate< Typeclass > | Holds default methods of typeclasses |
| ►Cboost::mpl11::integer_c< T, v > | Integer holding the specified value |
| Cboost::mpl11::integral_c< T, v > | Alias to integer_c<T, v>; provided for backward compatibility |
| ►Cboost::mpl11::integer_c< bool, B > | |
| Cboost::mpl11::bool_< (bool) if_c<(bool) x::type::value, x, y >::type::value > | |
| Cboost::mpl11::bool_< (bool) if_c<(bool) x::type::value, y, x >::type::value > | |
| Cboost::mpl11::bool_< b > | |
| ►Cboost::mpl11::bool_< false > | |
| Cboost::mpl11::false_ | Alias to bool_<false>; provided for convenience |
| Cboost::mpl11::bool_< sizeof...(xs)==0 > | |
| ►Cboost::mpl11::bool_< true > | |
| Cboost::mpl11::true_ | Alias to bool_<true>; provided for convenience |
| Cboost::mpl11::bool_< xs_done &&!ys_done > | |
| Cboost::mpl11::bool_< xs_done &&ys_done > | |
| Cboost::mpl11::bool_<!detail::logical_or::strict< bool_<!v >...>::value > | |
| ►Cboost::mpl11::bool_<!none< lift< id >, structure >::type::value > | |
| ►Cboost::mpl11::not_< none< lift< id >, structure > > | |
| ►Cboost::mpl11::any< lift< id >, structure > | |
| Cboost::mpl11::any_of< structure > | Equivalent to any<lift<id>, structure> |
| ►Cboost::mpl11::bool_<!none< predicate, structure >::type::value > | |
| ►Cboost::mpl11::not_< none< predicate, structure > > | |
| Cboost::mpl11::any< predicate, structure > | Returns whether any element of the structure satisfies the predicate |
| ►Cboost::mpl11::bool_<!x::type::value > | |
| Cboost::mpl11::not_< x > | Returns the logical negation (!) of its argument |
| Cboost::mpl11::bool_< B > | Alias to integer_c<bool, B>; provided for convenience |
| ►Cboost::mpl11::integer_c< char, C > | |
| Cboost::mpl11::char_< C > | Alias to integer_c<char, C>; provided for convenience |
| ►Cboost::mpl11::integer_c< detail::std_size_t, N > | |
| Cboost::mpl11::size_t< N > | Alias to integer_c<std::size_t, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< int, N > | |
| Cboost::mpl11::int_< N > | Alias to integer_c<int, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< long long, N > | |
| Cboost::mpl11::llong< N > | Alias to integer_c<long long, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< long, N > | |
| Cboost::mpl11::long_< N > | Alias to integer_c<long, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< short, N > | |
| Cboost::mpl11::short_< N > | Alias to integer_c<short, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< unsigned int, N > | |
| Cboost::mpl11::uint< N > | Alias to integer_c<unsigned int, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< unsigned long long, N > | |
| Cboost::mpl11::ullong< N > | Alias to integer_c<unsigned long long, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< unsigned long, N > | |
| Cboost::mpl11::ulong< N > | Alias to integer_c<unsigned long, N>; provided for convenience |
| ►Cboost::mpl11::integer_c< unsigned short, N > | |
| Cboost::mpl11::ushort< N > | Alias to integer_c<unsigned short, N>; provided for convenience |
| Cboost::mpl11::into< tp > | Returns a specialization of the given template with the provided arguments |
| Cboost::mpl11::is_empty< iter > | Returns whether the iterable is empty |
| Cboost::mpl11::join< monad > | Remove one level of monadic structure, projecting its argument into the outer level |
| Cboost::mpl11::just< x > | Creates an optional value containing x |
| Cboost::mpl11::last< iter > | Returns the last element of a non-empty iterable |
| Cboost::mpl11::length< iter > | Returns the number of elements in a finite iterable |
| Cboost::mpl11::lift< f > | Lifts a metafunction |
| Cboost::mpl11::lift< box > | |
| Cboost::mpl11::list< xs > | A List containing the given elements |
| ►Cboost::mpl11::list< box< xs >...> | |
| Cboost::mpl11::list_< xs > | Constructor equivalent to list, except it takes unboxed arguments |
| Cboost::mpl11::list< xs...> | |
| Cboost::mpl11::list<> | |
| Cboost::mpl11::detail::make_std_index_sequence< n > | Create an std_index_sequence with indices from 0 to n |
| Cboost::mpl11::maybe< def, f, m > | Applies a metafunction class to a Maybe, with a fallback result |
| ►Cboost::mpl11::maybe< def, lift< id >, m > | |
| Cboost::mpl11::from_maybe< def, m > | If m is nothing, returns def |
| ►Cboost::mpl11::maybe< false_, always< true_ >, m > | |
| Cboost::mpl11::is_just< m > | Returns whether a Maybe is a just |
| ►Cboost::mpl11::maybe< maybe_detail::err_from_just<>, lift< id >, m > | |
| Cboost::mpl11::from_just< m > | Extracts the value out of a just, and triggers a hard compile-time error if the argument is nothing |
| ►Cboost::mpl11::maybe< true_, always< false_ >, m > | |
| Cboost::mpl11::is_nothing< m > | Returns whether a Maybe is a nothing |
| Cminimal_iterable< xs > | Minimal iterable for testing purposes |
| Cminimal_iterable< xs...> | |
| Cboost::mpl11::minus< x, y > | Equivalent to plus<x, negate<y>> |
| Cboost::mpl11::mod< x, y > | Remainder of the integer division of x by y |
| Cboost::mpl11::detail::at_key::multiple_inheritance2< key, pairs > | Key-based lookup into a parameter pack using multiple inheritance |
| Cboost::mpl11::negate< x > | Returns the inverse of x |
| Cboost::mpl11::not_equal< x, y > | Returns whether the given objects are unequal |
| Cboost::mpl11::nothing | Creates an empty optional value |
| Cboost::mpl11::on< f, fs > | Invokes f with the result of invoking fs... on each corresponding argument |
| Cboost::mpl11::one< Datatype > | Multiplicative identity for the given Datatype |
| Cboost::mpl11::detail::pair< key, value > | Empty struct (not a mpl::pair) |
| ►Cboost::mpl11::partial< f, x > | Returns a partially applied metafunction class |
| Cboost::mpl11::lsect< x, f > | Returns the left section of f with x |
| ►Cboost::mpl11::partial< f, fix< f > > | |
| Cboost::mpl11::fix< f > | Returns a metafunction class computing the least fixed point of f |
| ►Cboost::mpl11::partial< flip< f >, y > | |
| Cboost::mpl11::rsect< f, y > | Returns the right section of f with y |
| ►Cboost::mpl11::partial< flip< lift< f > >, y > | |
| ►Cboost::mpl11::rsect< lift< f >, y > | |
| Cboost::mpl11::rsect_< f, y > | Equivalent to rsect<lift<f>, y>; provided for convenience |
| ►Cboost::mpl11::partial< lift< f >, x > | |
| ►Cboost::mpl11::lsect< x, lift< f > > | |
| Cboost::mpl11::lsect_< x, f > | Equivalent to lsect<x, lift<f>>; provided for convenience |
| Cboost::mpl11::iterable_detail::plus_one | |
| Cboost::mpl11::pred< e > | Returns the predecessor of the given object |
| Cboost::mpl11::quot< x, y > | Multiplication of x by the multiplicative inverse of y |
| Cboost::mpl11::recip< x > | Multiplicative inverse of x |
| Cboost::mpl11::shift_left< x, n > | Bitwise left shift (<<) |
| ►Cboost::mpl11::shift_left< x, size_t< n > > | |
| Cboost::mpl11::shift_left_c< x, n > | Equivalent to shift_left<x, size_t<n>> |
| Cboost::mpl11::shift_right< x, n > | Bitwise right shift (>>) |
| ►Cboost::mpl11::shift_right< x, size_t< n > > | |
| Cboost::mpl11::shift_right_c< x, n > | Equivalent to shift_right<x, size_t<n>> |
| Cstatic_assert_< boolean_expression > | Returns the given boolean expression and statically asserts that its value is true |
| Cstatic_assert_< is_empty< iter > > | |
| Cboost::mpl11::detail::std_conditional< Cond, Then, Else > | Equivalent to std::conditional |
| Cboost::mpl11::detail::std_index_sequence< I > | A simple sequence of integers |
| Cboost::mpl11::detail::std_is_same< T, U > | Equivalent to std::is_same; except it only has a nested ::value and a nested ::type |
| Cboost::mpl11::succ< e > | Returns the successor of the given object |
| Cboost::mpl11::tail< iter > | Extract the elements after the head of a non-empty iterable |
| Cboost::mpl11::take< n, xs > | Returns the first n elements of a List |
| ►Cboost::mpl11::take< size_t< n >, drop< from, xs > > | |
| ►Cboost::mpl11::take_c< to::type::value-from::type::value, drop< from, xs > > | |
| Cboost::mpl11::slice< xs, start, stop > | Returns a subrange of a list |
| ►Cboost::mpl11::slice< xs, size_t< start >, size_t< stop > > | |
| Cboost::mpl11::slice_c< xs, start, stop > | Equivalent to slice<xs, size_t<start>, size_t<stop>> |
| ►Cboost::mpl11::take< size_t< n >, xs > | |
| Cboost::mpl11::take_c< n, xs > | Equivalent to take<size_t<n>, xs> |
| Ctests | |
| Cboost::mpl11::uncurry< n, f > | Returns a uncurried metafunction class |
| Cboost::mpl11::undefined | Represents the bottom value of most functional programming languages |
| Cboost::mpl11::unit< MonadType, x > | Lift a value into a monadic structure |
| Cboost::mpl11::detail::right_folds::until_naive< predicate, f, state, xs, bool > | Naive right fold stopping whenever the predicate returns true |
| Cboost::mpl11::detail::left_folds::until_naive< predicate, f, state, xs, bool > | Naive left fold stopping whenever the predicate returns true |
| Cboost::mpl11::detail::left_folds::until_naive< p, f, f< state, head< xs > >, tail< xs > > | |
| ►Cboost::mpl11::detail::left_folds::variadic_aliased< f, state, xs > | Recursive alias-based variadic left fold |
| Cboost::mpl11::apply_curried< f, xs > | Invokes a curried metafunction class with the given arguments |
| Cboost::mpl11::bitand_< x1, x2, xn > | Bitwise and (&&) |
| Cboost::mpl11::bitor_< x1, x2, xn > | Bitwise or (||) |
| Cboost::mpl11::bitxor< x1, x2, xn > | Bitwise xor (^) |
| Cboost::mpl11::max< x1, x2, xs > | Returns the largest of its arguments according to the ordering induced by less |
| Cboost::mpl11::min< x1, x2, xs > | Returns the smallest of its arguments according to the ordering induced by less |
| Cboost::mpl11::mult< x1, x2, xn > | Ring operation |
| Cboost::mpl11::plus< x1, x2, xn > | Associative operation on a Monoid |
| Cboost::mpl11::detail::right_folds::variadic_naive< f, state, xs > | Naive right fold for parameter packs |
| Cboost::mpl11::detail::left_folds::variadic_naive< f, state, xs > | Naive left fold for parameter packs |
| Cboost::mpl11::detail::left_folds::variadic_naive< f, f< state, x >, xs...> | |
| Cboost::mpl11::detail::left_folds::variadic_unrolled< f, state, xs > | Left fold over a parameter pack with loop unrolling |
| ►Cboost::mpl11::detail::right_folds::variadic_unrolled< f, state, xs > | Right fold over a parameter pack with loop unrolling |
| Cboost::mpl11::and_< equal< head< box< xs > >, head< box< ys > > >, equal_impl< tail< box< xs > >::type, tail< box< ys > >::type > > | |
| ►Cboost::mpl11::and_< equal< x1, x2 >, equal< x2, xs...> > | |
| Cboost::mpl11::equal< x1, x2, xs > | Returns whether the given objects are equal |
| ►Cboost::mpl11::and_< greater< x1, x2 >, greater< x2, xs...> > | |
| Cboost::mpl11::greater< x1, x2, xs > | Returns whether the given objects are ordered according to the > ordering |
| ►Cboost::mpl11::and_< greater_equal< x1, x2 >, greater_equal< x2, xs...> > | |
| Cboost::mpl11::greater_equal< x1, x2, xs > | Returns whether the given objects are ordered according to the >= ordering |
| ►Cboost::mpl11::and_< less< x1, x2 >, less< x2, xs...> > | |
| Cboost::mpl11::less< x1, x2, xs > | Returns whether the given objects are ordered according to the < ordering |
| ►Cboost::mpl11::and_< less_equal< x1, x2 >, less_equal< x2, xs...> > | |
| Cboost::mpl11::less_equal< x1, x2, xs > | Returns whether the given objects are ordered according to the <= ordering |
| Cboost::mpl11::and_< xs > | Returns the result of short-circuit logical and (&&) on its arguments |
| Cboost::mpl11::or_< xs > | Returns the result of short-circuit logical or (||) on its arguments |
| Cboost::mpl11::or_< less< head< box< xs > >, head< box< ys > > >, and_< not_< less< head< box< ys > >, head< box< xs > > > >, less_impl< tail< box< xs > >::type, tail< box< ys > >::type > > > | |
| Cboost::mpl11::detail::left_folds::variadic_unrolled< f, f< f< f< f< f< f< state, x0 >, x1 >, x2 >, x3 >, x4 >, x5 >, xs... > | |
| Cboost::mpl11::zero< Datatype > | Additive identity for the given Datatype |
1.8.7
