erase_key

<<<<<<< .working For an Associative Sequence seq, returns a Forward Sequence containing all the elements of the original except those with a given key. ======= For an associative] Forward Sequence seq, returns a associative] Forward Sequence containing all the elements of the original except those with a given key. >>>>>>> .merge-right.r57242

template<
    typename Key,
    typename Sequence
    >
typename result_of::erase_key<Sequence const, Key>::type erase_key(Sequence const& seq);

<<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working <<<<<<< .working

Table 1.64. Parameters

=======

Table 1.64. Parameters

=======

Table 1.68. Parameters

=======

Table 1.68. Parameters

=======

Table 1.68. Parameters

=======

Table 1.68. Parameters

=======

Table 1.68. Parameters

>>>>>>> .merge-right.r58559 >>>>>>> .merge-right.r58549 >>>>>>> .merge-right.r58299 >>>>>>> .merge-right.r57337 >>>>>>> .merge-right.r57242

>>>>>>> .merge-right.r57125 <<<<<<< .working

Parameter	Requirement	Description
`seq`	A model of Associative =======	`seq`	A model of Forward Sequence and Associative >>>>>>> .merge-right.r57242 Sequence	Operation's argument
`Key`	Any type	Key to erase

<<<<<<< .working

erase_key<Key>(seq);

Return type: A model of Forward Sequence and Associative Sequence.

Semantics: Returns a new sequence, containing all the elements of seq, except those with key Key.

Constant. Returns a view which is lazily evaluated.

#include <boost/fusion/algorithm/transformation/erase_key.hpp>
#include <boost/fusion/include/erase_key.hpp>

assert(erase_key<int>(make_map<int, long>('a', 'b')) == make_map<long>('b'));