experimental::fundamentals_v2 Namespace Reference

Functions
template<class _Ty , class _Alloc , class _Pr >
void	erase_if (deque< _Ty, _Alloc > &_Cont, _Pr _Pred)
template<class _Ty , class _Alloc , class _Uty >
void	erase (deque< _Ty, _Alloc > &_Cont, const _Uty &_Val)
template<class _Ty , class _Alloc , class _Pr >
void	erase_if (forward_list< _Ty, _Alloc > &_Cont, _Pr _Pred)
template<class _Ty , class _Alloc , class _Uty >
void	erase (forward_list< _Ty, _Alloc > &_Cont, const _Uty &_Val)
template<class _Ty , class _Alloc , class _Pr >
void	erase_if (list< _Ty, _Alloc > &_Cont, _Pr _Pred)
template<class _Ty , class _Alloc , class _Uty >
void	erase (list< _Ty, _Alloc > &_Cont, const _Uty &_Val)
template<class _Kty , class _Ty , class _Keylt , class _Alloc , class _Pr >
void	erase_if (map< _Kty, _Ty, _Keylt, _Alloc > &_Cont, _Pr _Pred)
template<class _Kty , class _Ty , class _Keylt , class _Alloc , class _Pr >
void	erase_if (multimap< _Kty, _Ty, _Keylt, _Alloc > &_Cont, _Pr _Pred)
template<class _Kty , class _Keylt , class _Alloc , class _Pr >
void	erase_if (set< _Kty, _Keylt, _Alloc > &_Cont, _Pr _Pred)
template<class _Kty , class _Keylt , class _Alloc , class _Pr >
void	erase_if (multiset< _Kty, _Keylt, _Alloc > &_Cont, _Pr _Pred)
template<class _Elem , class _Traits , class _Alloc , class _Pr >
void	erase_if (basic_string< _Elem, _Traits, _Alloc > &_Cont, _Pr _Pred)
template<class _Elem , class _Traits , class _Alloc , class _Uty >
void	erase (basic_string< _Elem, _Traits, _Alloc > &_Cont, const _Uty &_Val)
template<class _Kty , class _Ty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >
void	erase_if (unordered_map< _Kty, _Ty, _Hasher, _Keyeq, _Alloc > &_Cont, _Pr _Pred)
template<class _Kty , class _Ty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >
void	erase_if (unordered_multimap< _Kty, _Ty, _Hasher, _Keyeq, _Alloc > &_Cont, _Pr _Pred)
template<class _Kty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >
void	erase_if (unordered_set< _Kty, _Hasher, _Keyeq, _Alloc > &_Cont, _Pr _Pred)
template<class _Kty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >
void	erase_if (unordered_multiset< _Kty, _Hasher, _Keyeq, _Alloc > &_Cont, _Pr _Pred)
template<class _Ty , class _Alloc , class _Pr >
void	erase_if (vector< _Ty, _Alloc > &_Cont, _Pr _Pred)
template<class _Ty , class _Alloc , class _Uty >
void	erase (vector< _Ty, _Alloc > &_Cont, const _Uty &_Val)
template<class _Container , class _Pr >
void	_Erase_nodes_if (_Container &_Cont, _Pr &_Pred)
template<class _Container , class _Pr >
void	_Erase_remove_if (_Container &_Cont, _Pr &_Pred)
template<class _Container , class _Uty >
void	_Erase_remove (_Container &_Cont, const _Uty &_Val)

Function Documentation

template<class _Container , class _Pr >

void experimental::fundamentals_v2::_Erase_nodes_if ( _Container &  _Cont, _Pr &  _Pred  )

inline

    {   // erase each element satisfying _Pred
    auto _First = _Cont.begin();
    auto _Last = _Cont.end();
    _DEBUG_POINTER_IF(_First != _Last, _Pred);
    while (_First != _Last)
        if (_Pred(*_First))
            _First = _Cont.erase(_First);
        else
            ++_First;
    }

template<class _Container , class _Uty >

void experimental::fundamentals_v2::_Erase_remove ( _Container &  _Cont, const _Uty &  _Val  )

inline

    {   // erase each element matching _Val
    auto _First = _Cont.begin();
    auto _Last = _Cont.end();
    _Cont.erase(_Rechecked(_First,
        _Remove_unchecked(_Unchecked(_First), _Unchecked(_Last), _Val)), _Last);
    }

template<class _Container , class _Pr >

void experimental::fundamentals_v2::_Erase_remove_if ( _Container &  _Cont, _Pr &  _Pred  )

inline

    {   // erase each element satisfying _Pred
    auto _First = _Cont.begin();
    auto _Last = _Cont.end();
    _Cont.erase(_Rechecked(_First,
        _Remove_if_unchecked(_Unchecked(_First), _Unchecked(_Last), _Pred)), _Last);
    }

template<class _Ty , class _Alloc , class _Uty >

void experimental::fundamentals_v2::erase ( forward_list< _Ty, _Alloc > &  _Cont, const _Uty &  _Val  )

inline

    {   // erase each element matching _Val
    _Cont.remove_if([&](_Ty& _Elem)
        {   // return whether element matches _Val
        return (_Elem == _Val);
        });
    }

template<class _Ty , class _Alloc , class _Uty >

void experimental::fundamentals_v2::erase ( list< _Ty, _Alloc > &  _Cont, const _Uty &  _Val  )

inline

    {   // erase each element matching _Val
    _Cont.remove_if([&](_Ty& _Elem)
        {   // return whether element matches _Val
        return (_Elem == _Val);
        });
    }

template<class _Ty , class _Alloc , class _Uty >

void experimental::fundamentals_v2::erase ( deque< _Ty, _Alloc > &  _Cont, const _Uty &  _Val  )

inline

    {   // erase each element matching _Val
    _Erase_remove(_Cont, _Val);
    }

template<class _Ty , class _Alloc , class _Uty >

void experimental::fundamentals_v2::erase ( vector< _Ty, _Alloc > &  _Cont, const _Uty &  _Val  )

inline

    {   // erase each element matching _Val
    _Erase_remove(_Cont, _Val);
    }

template<class _Elem , class _Traits , class _Alloc , class _Uty >

void experimental::fundamentals_v2::erase ( basic_string< _Elem, _Traits, _Alloc > &  _Cont, const _Uty &  _Val  )

inline

    {   // erase each element matching _Val
    _Erase_remove(_Cont, _Val);
    }

template<class _Ty , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( list< _Ty, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Cont._Remove_if(_Pred);
    }

template<class _Ty , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( forward_list< _Ty, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Cont._Remove_if(_Pred);
    }

template<class _Ty , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( vector< _Ty, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_remove_if(_Cont, _Pred);
    }

template<class _Ty , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( deque< _Ty, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_remove_if(_Cont, _Pred);
    }

template<class _Elem , class _Traits , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( basic_string< _Elem, _Traits, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_remove_if(_Cont, _Pred);
    }

template<class _Kty , class _Keylt , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( set< _Kty, _Keylt, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( unordered_set< _Kty, _Hasher, _Keyeq, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Ty , class _Keylt , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( map< _Kty, _Ty, _Keylt, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Ty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( unordered_map< _Kty, _Ty, _Hasher, _Keyeq, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Keylt , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( multiset< _Kty, _Keylt, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Ty , class _Keylt , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( multimap< _Kty, _Ty, _Keylt, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( unordered_multiset< _Kty, _Hasher, _Keyeq, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }

template<class _Kty , class _Ty , class _Hasher , class _Keyeq , class _Alloc , class _Pr >

void experimental::fundamentals_v2::erase_if ( unordered_multimap< _Kty, _Ty, _Hasher, _Keyeq, _Alloc > &  _Cont, _Pr  _Pred  )

inline

    {   // erase each element satisfying _Pred
    _Erase_nodes_if(_Cont, _Pred);
    }