xmemory File Reference

#include <xmemory0>

Classes
class	raw_storage_iterator< _OutIt, _Ty >
class	_Temp_iterator< _Ty >
struct	_Temp_iterator< _Ty >::_Bufpar

Macros
#define	_XMEMORY_

Functions
template<class _Ty >
_STD_BEGIN pair< _Ty *, ptrdiff_t >	get_temporary_buffer (ptrdiff_t _Count) _NOEXCEPT
template<class _Ty >
void	return_temporary_buffer (_Ty *_Pbuf)
template<class _InIt , class _FwdIt >
_FwdIt	_Uninitialized_copy_unchecked1 (_InIt _First, _InIt _Last, _FwdIt _Dest, _General_ptr_iterator_tag)
template<class _InIt , class _FwdIt >
_FwdIt	_Uninitialized_copy_unchecked1 (_InIt _First, _InIt _Last, _FwdIt _Dest, _Really_trivial_ptr_iterator_tag)
template<class _InIt , class _FwdIt >
_FwdIt	_Uninitialized_copy_unchecked (_InIt _First, _InIt _Last, _FwdIt _Dest)
template<class _InIt , class _FwdIt >
_FwdIt	_Uninitialized_copy1 (_InIt _First, _InIt _Last, _FwdIt _Dest, input_iterator_tag, forward_iterator_tag)
template<class _InIt , class _FwdIt >
_FwdIt	_Uninitialized_copy1 (_InIt _First, _InIt _Last, _FwdIt _Dest, random_access_iterator_tag, random_access_iterator_tag)
template<class _InIt , class _FwdIt >
_FwdIt	uninitialized_copy (_InIt _First, _InIt _Last, _FwdIt _Dest)
template<class _InIt , class _Diff , class _FwdIt >
_FwdIt	_Uninitialized_copy_n_unchecked1 (_InIt _First, _Diff _Count, _FwdIt _Dest, _General_ptr_iterator_tag)
template<class _InIt , class _Diff , class _FwdIt >
_FwdIt	_Uninitialized_copy_n_unchecked1 (_InIt _First, _Diff _Count, _FwdIt _Dest, _Really_trivial_ptr_iterator_tag)
template<class _InIt , class _Diff , class _FwdIt >
_FwdIt	_Uninitialized_copy_n_unchecked (_InIt _First, _Diff _Count, _FwdIt _Dest)
template<class _InIt , class _Diff , class _FwdIt >
_FwdIt	uninitialized_copy_n (_InIt _First, _Diff _Count, _FwdIt _Dest)
template<class _InIt , class _FwdIt , class _Alloc >
_FwdIt	_Uninitialized_copy_al_unchecked1 (_InIt _First, _InIt _Last, _FwdIt _Dest, _Wrap_alloc< _Alloc > &_Al, _General_ptr_iterator_tag, _Any_tag)
template<class _Ty1 , class _Ty2 , class _Alloc >
_Ty2 *	_Uninitialized_copy_al_unchecked1 (_Ty1 *_First, _Ty1 *_Last, _Ty2 *_Dest, _Wrap_alloc< _Alloc > &, _Really_trivial_ptr_iterator_tag, true_type)
template<class _InIt , class _FwdIt , class _Alloc >
_FwdIt	_Uninitialized_copy_al_unchecked (_InIt _First, _InIt _Last, _FwdIt _Dest, _Wrap_alloc< _Alloc > &_Al)
template<class _InIt , class _FwdIt , class _Alloc >
_FwdIt	_Uninitialized_copy (_InIt _First, _InIt _Last, _FwdIt _Dest, _Wrap_alloc< _Alloc > &_Al)
template<class _InIt , class _FwdIt , class _Alloc >
_FwdIt	_Uninitialized_move_al_unchecked1 (_InIt _First, _InIt _Last, _FwdIt _Dest, _Wrap_alloc< _Alloc > &_Al, _General_ptr_iterator_tag, _Any_tag)
template<class _Ty1 , class _Ty2 , class _Alloc >
_Ty2 *	_Uninitialized_move_al_unchecked1 (_Ty1 *_First, _Ty1 *_Last, _Ty2 *_Dest, _Wrap_alloc< _Alloc > &, _Really_trivial_ptr_iterator_tag, true_type)
template<class _InIt , class _FwdIt , class _Alloc >
_FwdIt	_Uninitialized_move_al_unchecked (_InIt _First, _InIt _Last, _FwdIt _Dest, _Wrap_alloc< _Alloc > &_Al)
template<class _InIt , class _FwdIt , class _Alloc >
_FwdIt	_Uninitialized_move (_InIt _First, _InIt _Last, _FwdIt _Dest, _Wrap_alloc< _Alloc > &_Al)
template<class _FwdIt , class _Tval >
void	_Uninitialized_fill_unchecked1 (_FwdIt _First, _FwdIt _Last, const _Tval &_Val, false_type)
template<class _FwdIt , class _Tval >
void	_Uninitialized_fill_unchecked1 (_FwdIt _First, _FwdIt _Last, const _Tval &_Val, true_type)
template<class _FwdIt , class _Tval >
void	_Uninitialized_fill_unchecked (_FwdIt _First, _FwdIt _Last, const _Tval &_Val)
template<class _FwdIt , class _Tval >
void	uninitialized_fill (_FwdIt _First, _FwdIt _Last, const _Tval &_Val)
template<class _FwdIt , class _Diff , class _Tval >
_FwdIt	_Uninitialized_fill_n_unchecked1 (_FwdIt _First, _Diff _Count, const _Tval &_Val, false_type)
template<class _FwdIt , class _Diff , class _Tval >
_FwdIt	_Uninitialized_fill_n_unchecked1 (_FwdIt _First, _Diff _Count, const _Tval &_Val, true_type)
template<class _FwdIt , class _Diff , class _Tval >
_FwdIt	_Uninitialized_fill_n_unchecked (_FwdIt _First, _Diff _Count, const _Tval &_Val)
template<class _FwdIt , class _Diff , class _Tval >
_FwdIt	uninitialized_fill_n (_FwdIt _First, _Diff _Count, const _Tval &_Val)
template<class _FwdIt , class _Diff , class _Alloc >
void	_Uninit_alloc_fill_n1 (_FwdIt _First, _Diff _Count, const _Iter_value_t< _FwdIt > *_Pval, _Wrap_alloc< _Alloc > &_Al, false_type)
template<class _FwdIt , class _Diff , class _Alloc >
void	_Uninit_alloc_fill_n1 (_FwdIt _First, _Diff _Count, const _Iter_value_t< _FwdIt > *_Pval, _Wrap_alloc< _Alloc > &, true_type)
template<class _FwdIt , class _Diff , class _Alloc >
void	_Uninitialized_fill_n (_FwdIt _First, _Diff _Count, const _Iter_value_t< _FwdIt > *_Pval, _Wrap_alloc< _Alloc > &_Al)
template<class _FwdIt , class _Diff , class _Alloc >
void	_Uninitialized_default_fill_n1 (_FwdIt _First, _Diff _Count, _Wrap_alloc< _Alloc > &_Al, false_type)
template<class _FwdIt , class _Diff , class _Alloc >
void	_Uninitialized_default_fill_n1 (_FwdIt _First, _Diff _Count, _Wrap_alloc< _Alloc > &, true_type)
template<class _FwdIt , class _Diff , class _Alloc >
void	_Uninitialized_default_fill_n (_FwdIt _First, _Diff _Count, _Wrap_alloc< _Alloc > &_Al)

Macro Definition Documentation

#define _XMEMORY_

Function Documentation

template<class _FwdIt , class _Diff , class _Alloc >

void _Uninit_alloc_fill_n1 ( _FwdIt  _First, _Diff  _Count, const _Iter_value_t< _FwdIt > *  _Pval, _Wrap_alloc< _Alloc > &  _Al, false_type    )

inline

    {   // copy _Count copies of *_Pval to raw _First, using _Al, no special optimization
    _FwdIt _Next = _First;

    _TRY_BEGIN
    for (; 0 < _Count; --_Count, (void)++_First)
        _Al.construct(_Unfancy(_First), *_Pval);
    _CATCH_ALL
    _Destroy_range(_Next, _First, _Al);
    _RERAISE;
    _CATCH_END
    }

template<class _FwdIt , class _Diff , class _Alloc >

void _Uninit_alloc_fill_n1 ( _FwdIt  _First, _Diff  _Count, const _Iter_value_t< _FwdIt > *  _Pval, _Wrap_alloc< _Alloc > &  , true_type    )

inline

    {   // copy _Count copies of *_Pval to raw _First, using default _Alloc construct, memset optimization
    _CSTD memset(_First, *_Pval, _Count);
    }

template<class _InIt , class _FwdIt , class _Alloc >

_FwdIt _Uninitialized_copy ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Wrap_alloc< _Alloc > &  _Al  )

inline

    {   // copy [_First, _Last) to raw _Dest, using _Al
        // note: only called internally from elsewhere in the STL, debug checks
        // and deprecation warnings omitted
    return (_Rechecked(_Dest,
        _Uninitialized_copy_al_unchecked(_Unchecked(_First), _Unchecked(_Last),
            _Unchecked(_Dest), _Al)));
    }

template<class _InIt , class _FwdIt >

_FwdIt _Uninitialized_copy1 ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, input_iterator_tag  , forward_iterator_tag    )

inline

    {   // copy [_First, _Last) to raw [_Dest, ...), arbitrary iterators
    return (_Rechecked(_Dest,
        _Uninitialized_copy_unchecked(_First, _Last, _Unchecked_idl0(_Dest))));
    }

template<class _InIt , class _FwdIt >

_FwdIt _Uninitialized_copy1 ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, random_access_iterator_tag  , random_access_iterator_tag    )

inline

    {   // copy [_First, _Last) to raw [_Dest, ...), random-access iterators
    _CHECK_RANIT_RANGE(_First, _Last, _Dest);
    return (_Rechecked(_Dest,
        _Uninitialized_copy_unchecked(_First, _Last, _Unchecked(_Dest))));
    }

template<class _InIt , class _FwdIt , class _Alloc >

_FwdIt _Uninitialized_copy_al_unchecked ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Wrap_alloc< _Alloc > &  _Al  )

inline

    {   // copy [_First, _Last) to raw _Dest, using _Al, choose optimization
    return (_Uninitialized_copy_al_unchecked1(_First, _Last, _Dest, _Al,
        _Ptr_copy_cat(_First, _Dest),
        _Uses_default_construct_t<_Alloc, decltype(_Unfancy(_Dest)), decltype(*_First)>()));
    }

template<class _InIt , class _FwdIt , class _Alloc >

_FwdIt _Uninitialized_copy_al_unchecked1 ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Wrap_alloc< _Alloc > &  _Al, _General_ptr_iterator_tag  , _Any_tag    )

inline

    {   // copy [_First, _Last) to raw _Dest, using _Al, no special optimization
    _FwdIt _Next = _Dest;

    _TRY_BEGIN
    for (; _First != _Last; ++_Dest, (void)++_First)
        _Al.construct(_Unfancy(_Dest), *_First);
    _CATCH_ALL
    _Destroy_range(_Next, _Dest, _Al);
    _RERAISE;
    _CATCH_END

    return (_Dest);
    }

template<class _Ty1 , class _Ty2 , class _Alloc >

_Ty2* _Uninitialized_copy_al_unchecked1 ( _Ty1 *  _First, _Ty1 *  _Last, _Ty2 *  _Dest, _Wrap_alloc< _Alloc > &  , _Really_trivial_ptr_iterator_tag  , true_type    )

inline

    {   // copy [_First, _Last) to raw _Dest, using default _Alloc construct, memmove optimization
    return (_Copy_memmove(_First, _Last, _Dest));
    }

template<class _InIt , class _Diff , class _FwdIt >

_FwdIt _Uninitialized_copy_n_unchecked ( _InIt  _First, _Diff  _Count, _FwdIt  _Dest  )

inline

    {   // copy [_First, _First + _Count) to [_Dest, ...), choose optimization
    return (_Uninitialized_copy_n_unchecked1(_First, _Count,
        _Dest, _Ptr_copy_cat(_First, _Dest)));
    }

template<class _InIt , class _Diff , class _FwdIt >

_FwdIt _Uninitialized_copy_n_unchecked1 ( _InIt  _First, _Diff  _Count, _FwdIt  _Dest, _General_ptr_iterator_tag    )

inline

    {   // copy [_First, _First + _Count) to [_Dest, ...), no special optimization
    _FwdIt _Next = _Dest;

    _TRY_BEGIN
    for (; 0 < _Count; --_Count, (void)++_Dest, ++_First)
        _Construct(_Unfancy(_Dest), *_First);
    _CATCH_ALL
    _Destroy_range(_Next, _Dest);
    _RERAISE;
    _CATCH_END

    return (_Dest);
    }

template<class _InIt , class _Diff , class _FwdIt >

_FwdIt _Uninitialized_copy_n_unchecked1 ( _InIt  _First, _Diff  _Count, _FwdIt  _Dest, _Really_trivial_ptr_iterator_tag    )

inline

    {   // copy [_First, _First + _Count) to [_Dest, ...), memmove optimization
    if (0 < _Count)
        return (_Copy_memmove(_First, _First + _Count, _Dest));
    return (_Dest);
    }

template<class _InIt , class _FwdIt >

_FwdIt _Uninitialized_copy_unchecked ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest  )

inline

    {   // copy [_First, _Last) to raw [_Dest, ...), choose optimization
    return (_Uninitialized_copy_unchecked1(_First, _Last,
        _Dest, _Ptr_copy_cat(_First, _Dest)));
    }

template<class _InIt , class _FwdIt >

_FwdIt _Uninitialized_copy_unchecked1 ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _General_ptr_iterator_tag    )

inline

    {   // copy [_First, _Last) to raw [_Dest, ...), no special optimization
    _FwdIt _Next = _Dest;

    _TRY_BEGIN
    for (; _First != _Last; ++_Dest, (void)++_First)
        _Construct(_Unfancy(_Dest), *_First);
    _CATCH_ALL
    _Destroy_range(_Next, _Dest);
    _RERAISE;
    _CATCH_END

    return (_Dest);
    }

template<class _InIt , class _FwdIt >

_FwdIt _Uninitialized_copy_unchecked1 ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Really_trivial_ptr_iterator_tag    )

inline

    {   // copy [_First, _Last) to raw [_Dest, ...), memmove optimization
    return (_Copy_memmove(_First, _Last, _Dest));
    }

template<class _FwdIt , class _Diff , class _Alloc >

void _Uninitialized_default_fill_n ( _FwdIt  _First, _Diff  _Count, _Wrap_alloc< _Alloc > &  _Al  )

inline

    {   // value-initialize _Count objects to raw _First, using _Al
    typedef _Iter_value_t<_FwdIt> _Ty;
    _Uninitialized_default_fill_n1(_First, _Count, _Al,
        typename conjunction<
            is_pointer<_FwdIt>,
            is_scalar<_Ty>,
            negation<is_volatile<_Ty>>,
            negation<is_member_pointer<_Ty>>,
            _Uses_default_construct<_Alloc, decltype(_Unfancy(_First))>>::type());
    }

template<class _FwdIt , class _Diff , class _Alloc >

void _Uninitialized_default_fill_n1 ( _FwdIt  _First, _Diff  _Count, _Wrap_alloc< _Alloc > &  _Al, false_type    )

inline

    {   // value-initialize _Count objects to raw _First, using _Al, no special optimization
    _FwdIt _Next = _First;

    _TRY_BEGIN
    for (; 0 < _Count; --_Count, (void)++_First)
        _Al.construct(_Unfancy(_First));
    _CATCH_ALL
    _Destroy_range(_Next, _First, _Al);
    _RERAISE;
    _CATCH_END
    }

template<class _FwdIt , class _Diff , class _Alloc >

void _Uninitialized_default_fill_n1 ( _FwdIt  _First, _Diff  _Count, _Wrap_alloc< _Alloc > &  , true_type    )

inline

    {   // value-initialize _Count objects to raw _First, using default _Alloc construct, all-bits-zero type
    _CSTD memset(_First, 0, _Count * sizeof(_Iter_value_t<_FwdIt>));
    }

template<class _FwdIt , class _Diff , class _Alloc >

void _Uninitialized_fill_n ( _FwdIt  _First, _Diff  _Count, const _Iter_value_t< _FwdIt > *  _Pval, _Wrap_alloc< _Alloc > &  _Al  )

inline

    {   // copy _Count copies of *_Pval to raw _First, using _Al
    _Uninit_alloc_fill_n1(_First, _Count, _Pval, _Al,
        typename conjunction<decltype(_Fill_memset_is_safe(_First, *_Pval)),
            _Uses_default_construct<_Alloc, decltype(_Unfancy(_First)), decltype(*_Pval)>>::type());
    }

template<class _FwdIt , class _Diff , class _Tval >

_FwdIt _Uninitialized_fill_n_unchecked ( _FwdIt  _First, _Diff  _Count, const _Tval &  _Val  )

inline

    {   // copy _Count copies of _Val to raw _First, choose optimization
    return (_Uninitialized_fill_n_unchecked1(_First, _Count, _Val, _Fill_memset_is_safe(_First, _Val)));
    }

template<class _FwdIt , class _Diff , class _Tval >

_FwdIt _Uninitialized_fill_n_unchecked1 ( _FwdIt  _First, _Diff  _Count, const _Tval &  _Val, false_type    )

inline

    {   // copy _Count copies of _Val to raw _First, no special optimization
    _FwdIt _Next = _First;

    _TRY_BEGIN
    for (; 0 < _Count; --_Count, (void)++_First)
        _Construct(_Unfancy(_First), _Val);
    _CATCH_ALL
    _Destroy_range(_Next, _First);
    _RERAISE;
    _CATCH_END

    return (_First);
    }

template<class _FwdIt , class _Diff , class _Tval >

_FwdIt _Uninitialized_fill_n_unchecked1 ( _FwdIt  _First, _Diff  _Count, const _Tval &  _Val, true_type    )

inline

    {   // copy _Count copies of _Val to raw _First, memset optimization
    if (0 < _Count)
        {
        _CSTD memset(_First, _Val, _Count);
        return (_First + _Count);
        }

    return (_First);
    }

template<class _FwdIt , class _Tval >

void _Uninitialized_fill_unchecked ( _FwdIt  _First, _FwdIt  _Last, const _Tval &  _Val  )

inline

    {   // copy _Val throughout raw [_First, _Last), choose optimization
    _Uninitialized_fill_unchecked1(_First, _Last, _Val, _Fill_memset_is_safe(_First, _Val));
    }

template<class _FwdIt , class _Tval >

void _Uninitialized_fill_unchecked1 ( _FwdIt  _First, _FwdIt  _Last, const _Tval &  _Val, false_type    )

inline

    {   // copy _Val throughout raw [_First, _Last), no special optimization
    _FwdIt _Next = _First;

    _TRY_BEGIN
    for (; _First != _Last; ++_First)
        _Construct(_Unfancy(_First), _Val);
    _CATCH_ALL
    _Destroy_range(_Next, _First);
    _RERAISE;
    _CATCH_END
    }

template<class _FwdIt , class _Tval >

void _Uninitialized_fill_unchecked1 ( _FwdIt  _First, _FwdIt  _Last, const _Tval &  _Val, true_type    )

inline

    {   // copy _Val throughout raw [_First, _Last), memset optimization
    _CSTD memset(_First, _Val, _Last - _First);
    }

template<class _InIt , class _FwdIt , class _Alloc >

_FwdIt _Uninitialized_move ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Wrap_alloc< _Alloc > &  _Al  )

inline

    {   // move [_First, _Last) to raw _Dest, using _Al
        // note: only called internally from elsewhere in the STL, debug checks
        // and deprecation warnings omitted
    return (_Rechecked(_Dest,
        _Uninitialized_move_al_unchecked(_Unchecked(_First), _Unchecked(_Last),
            _Unchecked(_Dest), _Al)));
    }

template<class _InIt , class _FwdIt , class _Alloc >

_FwdIt _Uninitialized_move_al_unchecked ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Wrap_alloc< _Alloc > &  _Al  )

inline

    {   // move [_First, _Last) to raw _Dest, using _Al, choose optimization
    typedef decltype(_STD move(*_First)) _Src_type; // TRANSITION MODULES VSO#222794
    return (_Uninitialized_move_al_unchecked1(_First, _Last, _Dest, _Al,
        _Ptr_move_cat(_First, _Dest),
        _Uses_default_construct_t<_Alloc, decltype(_Unfancy(_Dest)), _Src_type>()));
    }

template<class _InIt , class _FwdIt , class _Alloc >

_FwdIt _Uninitialized_move_al_unchecked1 ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest, _Wrap_alloc< _Alloc > &  _Al, _General_ptr_iterator_tag  , _Any_tag    )

inline

    {   // move [_First, _Last) to raw _Dest, using _Al, no special optimization
    _FwdIt _Next = _Dest;

    _TRY_BEGIN
    for (; _First != _Last; ++_Dest, (void)++_First)
        _Al.construct(_Unfancy(_Dest), _STD move(*_First));
    _CATCH_ALL
    _Destroy_range(_Next, _Dest, _Al);
    _RERAISE;
    _CATCH_END

    return (_Dest);
    }

template<class _Ty1 , class _Ty2 , class _Alloc >

_Ty2* _Uninitialized_move_al_unchecked1 ( _Ty1 *  _First, _Ty1 *  _Last, _Ty2 *  _Dest, _Wrap_alloc< _Alloc > &  , _Really_trivial_ptr_iterator_tag  , true_type    )

inline

    {   // move [_First, _Last) to raw _Dest, using default _Alloc construct, memmove optimization
    return (_Copy_memmove(_First, _Last, _Dest));
    }

template<class _Ty >

_STD_BEGIN pair<_Ty *, ptrdiff_t> get_temporary_buffer ( ptrdiff_t  _Count )

inline

    {   // get raw temporary buffer of up to _Count elements
    _Ty *_Pbuf;

    if (_Count < 0)
        _Count = 0;
    else if (((size_t)(-1) / sizeof (_Ty) < _Count))
        _Xbad_alloc();  // report no memory
    for (_Pbuf = 0; 0 < _Count; _Count /= 2)
        if ((_Pbuf = (_Ty *)operator new(
            (size_t)_Count * sizeof (_Ty), nothrow)) != 0)
            break;

    return (pair<_Ty *, ptrdiff_t>(_Pbuf, _Count));
    }

template<class _Ty >

void return_temporary_buffer ( _Ty *  _Pbuf )

inline

    {   // delete raw temporary buffer
    operator delete(_Pbuf);
    }

template<class _InIt , class _FwdIt >

_FwdIt uninitialized_copy ( _InIt  _First, _InIt  _Last, _FwdIt  _Dest  )

inline

    {   // copy [_First, _Last) to raw [_Dest, ...)
    _DEPRECATE_UNCHECKED(uninitialized_copy, _Dest);
    _DEBUG_RANGE_PTR(_First, _Last, _Dest);
    return (_Uninitialized_copy1(_Unchecked(_First), _Unchecked(_Last),
        _Dest, _Iter_cat_t<_InIt>(), _Iter_cat_t<_FwdIt>()));
    }

template<class _InIt , class _Diff , class _FwdIt >

_FwdIt uninitialized_copy_n ( _InIt  _First, _Diff  _Count, _FwdIt  _Dest  )

inline

    {   // copy [_First, _First + _Count) to [_Dest, ...)
        // Note that we _DEPRECATE_UNCHECKED _Dest because _Count logically goes with _First
    _DEPRECATE_UNCHECKED(uninitialized_copy_n, _Dest);
    return (_Rechecked(_Dest,
        _Uninitialized_copy_n_unchecked(_Unchecked_n(_First, _Count), _Count, _Unchecked_n(_Dest, _Count))));
    }

template<class _FwdIt , class _Tval >

void uninitialized_fill ( _FwdIt  _First, _FwdIt  _Last, const _Tval &  _Val  )

inline

    {   // copy _Val throughout raw [_First, _Last)
    _DEBUG_RANGE(_First, _Last);
    _Uninitialized_fill_unchecked(_Unchecked(_First), _Unchecked(_Last), _Val);
    }

template<class _FwdIt , class _Diff , class _Tval >

_FwdIt uninitialized_fill_n ( _FwdIt  _First, _Diff  _Count, const _Tval &  _Val  )

inline

    {   // copy _Count copies of _Val to raw _First
    return (_Rechecked(_First,
        _Uninitialized_fill_n_unchecked(_Unchecked_n(_First, _Count), _Count, _Val)));
    }