3rdParty/boost/1.78.0/libs/mpl/doc/refmanual/front-inserter.html
| Prev Next | Back Along | Up Home | Full TOC | Front Page / Algorithms / Inserters / front_inserter |
template<
typename Seq
>
struct[front\_inserter](./front-inserter.html){
//_unspecified_//_..._};
Inserts elements at the beginning of the sequence.
#include <[boost/mpl/front\_inserter.hpp](../../../../boost/mpl/front_inserter.hpp)>
| Parameter | Requirement | Description |
|---|---|---|
| Seq | Front Extensible Sequence | A sequence to bind the inserter to. |
The semantics of an expression are defined only where they differ from, or are not defined in Inserter.
For any Front Extensible Sequence s:
| Expression | Semantics |
|---|---|
| front_inserter<s> |
An Inserter in, equivalent to
struct in :[inserter](./inserter-class.html)<s,[push\_front](./push-front.html)<[\_1](./placeholders.html),[\_2](./placeholders.html)> > {};
|
Amortized constant time.
typedef[reverse\_copy](./reverse-copy.html)<[range\_c](./range-c.html)<int,0,5>
,[front\_inserter](./front-inserter.html)<[vector\_c](./vector-c.html)<int,5,6,7,8,9> >
>::type range;[BOOST\_MPL\_ASSERT](./assert.html)(([equal](./equal.html)< range,[range\_c](./range-c.html)<int,0,10> > ));
Algorithms, Inserter, Reversible Algorithm, inserter (class), back_inserter, push_front
| Prev Next | Back Along | Up Home | Full TOC |
Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) |