Linux premium71.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
Server IP : 198.187.29.8 & Your IP : 3.145.50.27
Domains :
Cant Read [ /etc/named.conf ]
User : cleahvkv
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
c++ /
8 /
bits /
Delete
Unzip
Name
Size
Permission
Date
Action
algorithmfwd.h
21.23
KB
-rw-r--r--
2025-03-31 10:36
alloc_traits.h
19.6
KB
-rw-r--r--
2025-03-31 10:36
allocated_ptr.h
3.22
KB
-rw-r--r--
2025-03-31 10:36
allocator.h
7.39
KB
-rw-r--r--
2025-03-31 10:36
atomic_base.h
23.28
KB
-rw-r--r--
2025-03-31 10:36
atomic_futex.h
9.35
KB
-rw-r--r--
2025-03-31 10:36
atomic_lockfree_defines.h
2.2
KB
-rw-r--r--
2025-03-31 10:36
basic_ios.h
15.7
KB
-rw-r--r--
2025-03-31 10:36
basic_ios.tcc
5.94
KB
-rw-r--r--
2025-03-31 10:36
basic_string.h
237.01
KB
-rw-r--r--
2025-03-31 10:36
basic_string.tcc
52.5
KB
-rw-r--r--
2025-03-31 10:36
boost_concept_check.h
26.52
KB
-rw-r--r--
2025-03-31 10:36
c++0x_warning.h
1.44
KB
-rw-r--r--
2025-03-31 10:36
char_traits.h
20.42
KB
-rw-r--r--
2025-03-31 10:36
codecvt.h
20.79
KB
-rw-r--r--
2025-03-31 10:36
concept_check.h
3.34
KB
-rw-r--r--
2025-03-31 10:36
cpp_type_traits.h
9.56
KB
-rw-r--r--
2025-03-31 10:36
cxxabi_forced.h
1.77
KB
-rw-r--r--
2025-03-31 10:36
cxxabi_init_exception.h
2.17
KB
-rw-r--r--
2025-03-31 10:36
deque.tcc
33.32
KB
-rw-r--r--
2025-03-31 10:36
enable_special_members.h
12.1
KB
-rw-r--r--
2025-03-31 10:36
exception.h
2.23
KB
-rw-r--r--
2025-03-31 10:36
exception_defines.h
1.61
KB
-rw-r--r--
2025-03-31 10:36
exception_ptr.h
5.84
KB
-rw-r--r--
2025-03-31 10:36
forward_list.h
47.77
KB
-rw-r--r--
2025-03-31 10:36
forward_list.tcc
12.86
KB
-rw-r--r--
2025-03-31 10:36
fs_dir.h
14.38
KB
-rw-r--r--
2025-03-31 10:36
fs_fwd.h
10.04
KB
-rw-r--r--
2025-03-31 10:36
fs_ops.h
9.5
KB
-rw-r--r--
2025-03-31 10:36
fs_path.h
32.12
KB
-rw-r--r--
2025-03-31 10:36
fstream.tcc
32.03
KB
-rw-r--r--
2025-03-31 10:36
functexcept.h
3.18
KB
-rw-r--r--
2025-03-31 10:36
functional_hash.h
8.04
KB
-rw-r--r--
2025-03-31 10:36
gslice.h
5.39
KB
-rw-r--r--
2025-03-31 10:36
gslice_array.h
7.59
KB
-rw-r--r--
2025-03-31 10:36
hash_bytes.h
2.1
KB
-rw-r--r--
2025-03-31 10:36
hashtable.h
72.06
KB
-rw-r--r--
2025-03-31 10:36
hashtable_policy.h
66.38
KB
-rw-r--r--
2025-03-31 10:36
indirect_array.h
7.68
KB
-rw-r--r--
2025-03-31 10:36
invoke.h
3.57
KB
-rw-r--r--
2025-03-31 10:36
ios_base.h
30.3
KB
-rw-r--r--
2025-03-31 10:36
istream.tcc
30.36
KB
-rw-r--r--
2025-03-31 10:36
list.tcc
15.6
KB
-rw-r--r--
2025-03-31 10:36
locale_classes.h
24.31
KB
-rw-r--r--
2025-03-31 10:36
locale_classes.tcc
8.18
KB
-rw-r--r--
2025-03-31 10:36
locale_conv.h
15.72
KB
-rw-r--r--
2025-03-31 10:36
locale_facets.h
90.16
KB
-rw-r--r--
2025-03-31 10:36
locale_facets.tcc
38.62
KB
-rw-r--r--
2025-03-31 10:36
locale_facets_nonio.h
67.36
KB
-rw-r--r--
2025-03-31 10:36
locale_facets_nonio.tcc
44.22
KB
-rw-r--r--
2025-03-31 10:36
localefwd.h
5.51
KB
-rw-r--r--
2025-03-31 10:36
mask_array.h
7.42
KB
-rw-r--r--
2025-03-31 10:36
memoryfwd.h
2.4
KB
-rw-r--r--
2025-03-31 10:36
move.h
6.38
KB
-rw-r--r--
2025-03-31 10:36
nested_exception.h
4.69
KB
-rw-r--r--
2025-03-31 10:36
node_handle.h
8.02
KB
-rw-r--r--
2025-03-31 10:36
ostream.tcc
12.03
KB
-rw-r--r--
2025-03-31 10:36
ostream_insert.h
3.91
KB
-rw-r--r--
2025-03-31 10:36
parse_numbers.h
7.76
KB
-rw-r--r--
2025-03-31 10:36
postypes.h
8.02
KB
-rw-r--r--
2025-03-31 10:36
predefined_ops.h
8.87
KB
-rw-r--r--
2025-03-31 10:36
ptr_traits.h
6.47
KB
-rw-r--r--
2025-03-31 10:36
quoted_string.h
4.93
KB
-rw-r--r--
2025-03-31 10:36
random.h
171.14
KB
-rw-r--r--
2025-03-31 10:36
random.tcc
103.12
KB
-rw-r--r--
2025-03-31 10:36
range_access.h
9.79
KB
-rw-r--r--
2025-03-31 10:36
refwrap.h
11.61
KB
-rw-r--r--
2025-03-31 10:36
regex.h
95.12
KB
-rw-r--r--
2025-03-31 10:36
regex.tcc
16.18
KB
-rw-r--r--
2025-03-31 10:36
regex_automaton.h
10.47
KB
-rw-r--r--
2025-03-31 10:36
regex_automaton.tcc
7.65
KB
-rw-r--r--
2025-03-31 10:36
regex_compiler.h
17.63
KB
-rw-r--r--
2025-03-31 10:36
regex_compiler.tcc
18.84
KB
-rw-r--r--
2025-03-31 10:36
regex_constants.h
14.36
KB
-rw-r--r--
2025-03-31 10:36
regex_error.h
4.79
KB
-rw-r--r--
2025-03-31 10:36
regex_executor.h
7.31
KB
-rw-r--r--
2025-03-31 10:36
regex_executor.tcc
18.4
KB
-rw-r--r--
2025-03-31 10:36
regex_scanner.h
6.92
KB
-rw-r--r--
2025-03-31 10:36
regex_scanner.tcc
14.66
KB
-rw-r--r--
2025-03-31 10:36
shared_ptr.h
22.88
KB
-rw-r--r--
2025-03-31 10:36
shared_ptr_atomic.h
9.54
KB
-rw-r--r--
2025-03-31 10:36
shared_ptr_base.h
53.01
KB
-rw-r--r--
2025-03-31 10:36
slice_array.h
9.13
KB
-rw-r--r--
2025-03-31 10:36
specfun.h
45.95
KB
-rw-r--r--
2025-03-31 10:36
sstream.tcc
9.9
KB
-rw-r--r--
2025-03-31 10:36
std_abs.h
3.19
KB
-rw-r--r--
2025-03-31 10:36
std_function.h
22.71
KB
-rw-r--r--
2025-03-31 10:36
std_mutex.h
9.08
KB
-rw-r--r--
2025-03-31 10:36
stl_algo.h
209.27
KB
-rw-r--r--
2025-03-31 10:36
stl_algobase.h
49.31
KB
-rw-r--r--
2025-03-31 10:36
stl_bvector.h
32.94
KB
-rw-r--r--
2025-03-31 10:36
stl_construct.h
7.22
KB
-rw-r--r--
2025-03-31 10:36
stl_deque.h
76.73
KB
-rw-r--r--
2025-03-31 10:36
stl_function.h
40.77
KB
-rw-r--r--
2025-03-31 10:36
stl_heap.h
19.73
KB
-rw-r--r--
2025-03-31 10:36
stl_iterator.h
41.3
KB
-rw-r--r--
2025-03-31 10:36
stl_iterator_base_funcs.h
7.99
KB
-rw-r--r--
2025-03-31 10:36
stl_iterator_base_types.h
8.48
KB
-rw-r--r--
2025-03-31 10:36
stl_list.h
65.97
KB
-rw-r--r--
2025-03-31 10:36
stl_map.h
51.55
KB
-rw-r--r--
2025-03-31 10:36
stl_multimap.h
40.58
KB
-rw-r--r--
2025-03-31 10:36
stl_multiset.h
34.97
KB
-rw-r--r--
2025-03-31 10:36
stl_numeric.h
13.51
KB
-rw-r--r--
2025-03-31 10:36
stl_pair.h
18.21
KB
-rw-r--r--
2025-03-31 10:36
stl_queue.h
23.51
KB
-rw-r--r--
2025-03-31 10:36
stl_raw_storage_iter.h
3.74
KB
-rw-r--r--
2025-03-31 10:36
stl_relops.h
4.49
KB
-rw-r--r--
2025-03-31 10:36
stl_set.h
35.28
KB
-rw-r--r--
2025-03-31 10:36
stl_stack.h
11.66
KB
-rw-r--r--
2025-03-31 10:36
stl_tempbuf.h
8.15
KB
-rw-r--r--
2025-03-31 10:36
stl_tree.h
73.15
KB
-rw-r--r--
2025-03-31 10:36
stl_uninitialized.h
27.06
KB
-rw-r--r--
2025-03-31 10:36
stl_vector.h
59.12
KB
-rw-r--r--
2025-03-31 10:36
stream_iterator.h
6.5
KB
-rw-r--r--
2025-03-31 10:36
streambuf.tcc
4.81
KB
-rw-r--r--
2025-03-31 10:36
streambuf_iterator.h
13.44
KB
-rw-r--r--
2025-03-31 10:36
string_view.tcc
6.54
KB
-rw-r--r--
2025-03-31 10:36
stringfwd.h
2.55
KB
-rw-r--r--
2025-03-31 10:36
uniform_int_dist.h
9.84
KB
-rw-r--r--
2025-03-31 10:36
unique_ptr.h
25.38
KB
-rw-r--r--
2025-03-31 10:36
unordered_map.h
73.58
KB
-rw-r--r--
2025-03-31 10:36
unordered_set.h
57.76
KB
-rw-r--r--
2025-03-31 10:36
uses_allocator.h
6.37
KB
-rw-r--r--
2025-03-31 10:36
valarray_after.h
22.12
KB
-rw-r--r--
2025-03-31 10:36
valarray_array.h
21.3
KB
-rw-r--r--
2025-03-31 10:36
valarray_array.tcc
7.08
KB
-rw-r--r--
2025-03-31 10:36
valarray_before.h
18.08
KB
-rw-r--r--
2025-03-31 10:36
vector.tcc
28.95
KB
-rw-r--r--
2025-03-31 10:36
Save
Rename
// unique_ptr implementation -*- C++ -*- // Copyright (C) 2008-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/>. /** @file bits/unique_ptr.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{memory} */ #ifndef _UNIQUE_PTR_H #define _UNIQUE_PTR_H 1 #include <bits/c++config.h> #include <debug/assertions.h> #include <type_traits> #include <utility> #include <tuple> #include <bits/stl_function.h> #include <bits/functional_hash.h> namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @addtogroup pointer_abstractions * @{ */ #if _GLIBCXX_USE_DEPRECATED #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wdeprecated-declarations" template<typename> class auto_ptr; #pragma GCC diagnostic pop #endif /// Primary template of default_delete, used by unique_ptr template<typename _Tp> struct default_delete { /// Default constructor constexpr default_delete() noexcept = default; /** @brief Converting constructor. * * Allows conversion from a deleter for arrays of another type, @p _Up, * only if @p _Up* is convertible to @p _Tp*. */ template<typename _Up, typename = typename enable_if<is_convertible<_Up*, _Tp*>::value>::type> default_delete(const default_delete<_Up>&) noexcept { } /// Calls @c delete @p __ptr void operator()(_Tp* __ptr) const { static_assert(!is_void<_Tp>::value, "can't delete pointer to incomplete type"); static_assert(sizeof(_Tp)>0, "can't delete pointer to incomplete type"); delete __ptr; } }; // _GLIBCXX_RESOLVE_LIB_DEFECTS // DR 740 - omit specialization for array objects with a compile time length /// Specialization for arrays, default_delete. template<typename _Tp> struct default_delete<_Tp[]> { public: /// Default constructor constexpr default_delete() noexcept = default; /** @brief Converting constructor. * * Allows conversion from a deleter for arrays of another type, such as * a const-qualified version of @p _Tp. * * Conversions from types derived from @c _Tp are not allowed because * it is unsafe to @c delete[] an array of derived types through a * pointer to the base type. */ template<typename _Up, typename = typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type> default_delete(const default_delete<_Up[]>&) noexcept { } /// Calls @c delete[] @p __ptr template<typename _Up> typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type operator()(_Up* __ptr) const { static_assert(sizeof(_Tp)>0, "can't delete pointer to incomplete type"); delete [] __ptr; } }; template <typename _Tp, typename _Dp> class __uniq_ptr_impl { template <typename _Up, typename _Ep, typename = void> struct _Ptr { using type = _Up*; }; template <typename _Up, typename _Ep> struct _Ptr<_Up, _Ep, __void_t<typename remove_reference<_Ep>::type::pointer>> { using type = typename remove_reference<_Ep>::type::pointer; }; public: using _DeleterConstraint = enable_if< __and_<__not_<is_pointer<_Dp>>, is_default_constructible<_Dp>>::value>; using pointer = typename _Ptr<_Tp, _Dp>::type; __uniq_ptr_impl() = default; __uniq_ptr_impl(pointer __p) : _M_t() { _M_ptr() = __p; } template<typename _Del> __uniq_ptr_impl(pointer __p, _Del&& __d) : _M_t(__p, std::forward<_Del>(__d)) { } pointer& _M_ptr() { return std::get<0>(_M_t); } pointer _M_ptr() const { return std::get<0>(_M_t); } _Dp& _M_deleter() { return std::get<1>(_M_t); } const _Dp& _M_deleter() const { return std::get<1>(_M_t); } void swap(__uniq_ptr_impl& __rhs) noexcept { using std::swap; swap(this->_M_ptr(), __rhs._M_ptr()); swap(this->_M_deleter(), __rhs._M_deleter()); } private: tuple<pointer, _Dp> _M_t; }; /// 20.7.1.2 unique_ptr for single objects. template <typename _Tp, typename _Dp = default_delete<_Tp>> class unique_ptr { template <class _Up> using _DeleterConstraint = typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type; __uniq_ptr_impl<_Tp, _Dp> _M_t; public: using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer; using element_type = _Tp; using deleter_type = _Dp; // helper template for detecting a safe conversion from another // unique_ptr template<typename _Up, typename _Ep> using __safe_conversion_up = __and_< is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>, __not_<is_array<_Up>> >; // Constructors. /// Default constructor, creates a unique_ptr that owns nothing. template <typename _Up = _Dp, typename = _DeleterConstraint<_Up>> constexpr unique_ptr() noexcept : _M_t() { } /** Takes ownership of a pointer. * * @param __p A pointer to an object of @c element_type * * The deleter will be value-initialized. */ template <typename _Up = _Dp, typename = _DeleterConstraint<_Up>> explicit unique_ptr(pointer __p) noexcept : _M_t(__p) { } /** Takes ownership of a pointer. * * @param __p A pointer to an object of @c element_type * @param __d A reference to a deleter. * * The deleter will be initialized with @p __d */ unique_ptr(pointer __p, typename conditional<is_reference<deleter_type>::value, deleter_type, const deleter_type&>::type __d) noexcept : _M_t(__p, __d) { } /** Takes ownership of a pointer. * * @param __p A pointer to an object of @c element_type * @param __d An rvalue reference to a deleter. * * The deleter will be initialized with @p std::move(__d) */ unique_ptr(pointer __p, typename remove_reference<deleter_type>::type&& __d) noexcept : _M_t(std::move(__p), std::move(__d)) { static_assert(!std::is_reference<deleter_type>::value, "rvalue deleter bound to reference"); } /// Creates a unique_ptr that owns nothing. template <typename _Up = _Dp, typename = _DeleterConstraint<_Up>> constexpr unique_ptr(nullptr_t) noexcept : _M_t() { } // Move constructors. /// Move constructor. unique_ptr(unique_ptr&& __u) noexcept : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } /** @brief Converting constructor from another type * * Requires that the pointer owned by @p __u is convertible to the * type of pointer owned by this object, @p __u does not own an array, * and @p __u has a compatible deleter type. */ template<typename _Up, typename _Ep, typename = _Require< __safe_conversion_up<_Up, _Ep>, typename conditional<is_reference<_Dp>::value, is_same<_Ep, _Dp>, is_convertible<_Ep, _Dp>>::type>> unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter())) { } #if _GLIBCXX_USE_DEPRECATED #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wdeprecated-declarations" /// Converting constructor from @c auto_ptr template<typename _Up, typename = _Require< is_convertible<_Up*, _Tp*>, is_same<_Dp, default_delete<_Tp>>>> unique_ptr(auto_ptr<_Up>&& __u) noexcept; #pragma GCC diagnostic pop #endif /// Destructor, invokes the deleter if the stored pointer is not null. ~unique_ptr() noexcept { auto& __ptr = _M_t._M_ptr(); if (__ptr != nullptr) get_deleter()(__ptr); __ptr = pointer(); } // Assignment. /** @brief Move assignment operator. * * @param __u The object to transfer ownership from. * * Invokes the deleter first if this object owns a pointer. */ unique_ptr& operator=(unique_ptr&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<deleter_type>(__u.get_deleter()); return *this; } /** @brief Assignment from another type. * * @param __u The object to transfer ownership from, which owns a * convertible pointer to a non-array object. * * Invokes the deleter first if this object owns a pointer. */ template<typename _Up, typename _Ep> typename enable_if< __and_< __safe_conversion_up<_Up, _Ep>, is_assignable<deleter_type&, _Ep&&> >::value, unique_ptr&>::type operator=(unique_ptr<_Up, _Ep>&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<_Ep>(__u.get_deleter()); return *this; } /// Reset the %unique_ptr to empty, invoking the deleter if necessary. unique_ptr& operator=(nullptr_t) noexcept { reset(); return *this; } // Observers. /// Dereference the stored pointer. typename add_lvalue_reference<element_type>::type operator*() const { __glibcxx_assert(get() != pointer()); return *get(); } /// Return the stored pointer. pointer operator->() const noexcept { _GLIBCXX_DEBUG_PEDASSERT(get() != pointer()); return get(); } /// Return the stored pointer. pointer get() const noexcept { return _M_t._M_ptr(); } /// Return a reference to the stored deleter. deleter_type& get_deleter() noexcept { return _M_t._M_deleter(); } /// Return a reference to the stored deleter. const deleter_type& get_deleter() const noexcept { return _M_t._M_deleter(); } /// Return @c true if the stored pointer is not null. explicit operator bool() const noexcept { return get() == pointer() ? false : true; } // Modifiers. /// Release ownership of any stored pointer. pointer release() noexcept { pointer __p = get(); _M_t._M_ptr() = pointer(); return __p; } /** @brief Replace the stored pointer. * * @param __p The new pointer to store. * * The deleter will be invoked if a pointer is already owned. */ void reset(pointer __p = pointer()) noexcept { using std::swap; swap(_M_t._M_ptr(), __p); if (__p != pointer()) get_deleter()(__p); } /// Exchange the pointer and deleter with another object. void swap(unique_ptr& __u) noexcept { static_assert(__is_swappable<_Dp>::value, "deleter must be swappable"); _M_t.swap(__u._M_t); } // Disable copy from lvalue. unique_ptr(const unique_ptr&) = delete; unique_ptr& operator=(const unique_ptr&) = delete; }; /// 20.7.1.3 unique_ptr for array objects with a runtime length // [unique.ptr.runtime] // _GLIBCXX_RESOLVE_LIB_DEFECTS // DR 740 - omit specialization for array objects with a compile time length template<typename _Tp, typename _Dp> class unique_ptr<_Tp[], _Dp> { template <typename _Up> using _DeleterConstraint = typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type; __uniq_ptr_impl<_Tp, _Dp> _M_t; template<typename _Up> using __remove_cv = typename remove_cv<_Up>::type; // like is_base_of<_Tp, _Up> but false if unqualified types are the same template<typename _Up> using __is_derived_Tp = __and_< is_base_of<_Tp, _Up>, __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >; public: using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer; using element_type = _Tp; using deleter_type = _Dp; // helper template for detecting a safe conversion from another // unique_ptr template<typename _Up, typename _Ep, typename _UPtr = unique_ptr<_Up, _Ep>, typename _UP_pointer = typename _UPtr::pointer, typename _UP_element_type = typename _UPtr::element_type> using __safe_conversion_up = __and_< is_array<_Up>, is_same<pointer, element_type*>, is_same<_UP_pointer, _UP_element_type*>, is_convertible<_UP_element_type(*)[], element_type(*)[]> >; // helper template for detecting a safe conversion from a raw pointer template<typename _Up> using __safe_conversion_raw = __and_< __or_<__or_<is_same<_Up, pointer>, is_same<_Up, nullptr_t>>, __and_<is_pointer<_Up>, is_same<pointer, element_type*>, is_convertible< typename remove_pointer<_Up>::type(*)[], element_type(*)[]> > > >; // Constructors. /// Default constructor, creates a unique_ptr that owns nothing. template <typename _Up = _Dp, typename = _DeleterConstraint<_Up>> constexpr unique_ptr() noexcept : _M_t() { } /** Takes ownership of a pointer. * * @param __p A pointer to an array of a type safely convertible * to an array of @c element_type * * The deleter will be value-initialized. */ template<typename _Up, typename _Vp = _Dp, typename = _DeleterConstraint<_Vp>, typename = typename enable_if< __safe_conversion_raw<_Up>::value, bool>::type> explicit unique_ptr(_Up __p) noexcept : _M_t(__p) { } /** Takes ownership of a pointer. * * @param __p A pointer to an array of a type safely convertible * to an array of @c element_type * @param __d A reference to a deleter. * * The deleter will be initialized with @p __d */ template<typename _Up, typename = typename enable_if< __safe_conversion_raw<_Up>::value, bool>::type> unique_ptr(_Up __p, typename conditional<is_reference<deleter_type>::value, deleter_type, const deleter_type&>::type __d) noexcept : _M_t(__p, __d) { } /** Takes ownership of a pointer. * * @param __p A pointer to an array of a type safely convertible * to an array of @c element_type * @param __d A reference to a deleter. * * The deleter will be initialized with @p std::move(__d) */ template<typename _Up, typename = typename enable_if< __safe_conversion_raw<_Up>::value, bool>::type> unique_ptr(_Up __p, typename remove_reference<deleter_type>::type&& __d) noexcept : _M_t(std::move(__p), std::move(__d)) { static_assert(!is_reference<deleter_type>::value, "rvalue deleter bound to reference"); } /// Move constructor. unique_ptr(unique_ptr&& __u) noexcept : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } /// Creates a unique_ptr that owns nothing. template <typename _Up = _Dp, typename = _DeleterConstraint<_Up>> constexpr unique_ptr(nullptr_t) noexcept : _M_t() { } template<typename _Up, typename _Ep, typename = _Require< __safe_conversion_up<_Up, _Ep>, typename conditional<is_reference<_Dp>::value, is_same<_Ep, _Dp>, is_convertible<_Ep, _Dp>>::type>> unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept : _M_t(__u.release(), std::forward<_Ep>(__u.get_deleter())) { } /// Destructor, invokes the deleter if the stored pointer is not null. ~unique_ptr() { auto& __ptr = _M_t._M_ptr(); if (__ptr != nullptr) get_deleter()(__ptr); __ptr = pointer(); } // Assignment. /** @brief Move assignment operator. * * @param __u The object to transfer ownership from. * * Invokes the deleter first if this object owns a pointer. */ unique_ptr& operator=(unique_ptr&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<deleter_type>(__u.get_deleter()); return *this; } /** @brief Assignment from another type. * * @param __u The object to transfer ownership from, which owns a * convertible pointer to an array object. * * Invokes the deleter first if this object owns a pointer. */ template<typename _Up, typename _Ep> typename enable_if<__and_<__safe_conversion_up<_Up, _Ep>, is_assignable<deleter_type&, _Ep&&> >::value, unique_ptr&>::type operator=(unique_ptr<_Up, _Ep>&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<_Ep>(__u.get_deleter()); return *this; } /// Reset the %unique_ptr to empty, invoking the deleter if necessary. unique_ptr& operator=(nullptr_t) noexcept { reset(); return *this; } // Observers. /// Access an element of owned array. typename std::add_lvalue_reference<element_type>::type operator[](size_t __i) const { __glibcxx_assert(get() != pointer()); return get()[__i]; } /// Return the stored pointer. pointer get() const noexcept { return _M_t._M_ptr(); } /// Return a reference to the stored deleter. deleter_type& get_deleter() noexcept { return _M_t._M_deleter(); } /// Return a reference to the stored deleter. const deleter_type& get_deleter() const noexcept { return _M_t._M_deleter(); } /// Return @c true if the stored pointer is not null. explicit operator bool() const noexcept { return get() == pointer() ? false : true; } // Modifiers. /// Release ownership of any stored pointer. pointer release() noexcept { pointer __p = get(); _M_t._M_ptr() = pointer(); return __p; } /** @brief Replace the stored pointer. * * @param __p The new pointer to store. * * The deleter will be invoked if a pointer is already owned. */ template <typename _Up, typename = _Require< __or_<is_same<_Up, pointer>, __and_<is_same<pointer, element_type*>, is_pointer<_Up>, is_convertible< typename remove_pointer<_Up>::type(*)[], element_type(*)[] > > > >> void reset(_Up __p) noexcept { pointer __ptr = __p; using std::swap; swap(_M_t._M_ptr(), __ptr); if (__ptr != nullptr) get_deleter()(__ptr); } void reset(nullptr_t = nullptr) noexcept { reset(pointer()); } /// Exchange the pointer and deleter with another object. void swap(unique_ptr& __u) noexcept { static_assert(__is_swappable<_Dp>::value, "deleter must be swappable"); _M_t.swap(__u._M_t); } // Disable copy from lvalue. unique_ptr(const unique_ptr&) = delete; unique_ptr& operator=(const unique_ptr&) = delete; }; template<typename _Tp, typename _Dp> inline #if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11 // Constrained free swap overload, see p0185r1 typename enable_if<__is_swappable<_Dp>::value>::type #else void #endif swap(unique_ptr<_Tp, _Dp>& __x, unique_ptr<_Tp, _Dp>& __y) noexcept { __x.swap(__y); } #if __cplusplus > 201402L || !defined(__STRICT_ANSI__) // c++1z or gnu++11 template<typename _Tp, typename _Dp> typename enable_if<!__is_swappable<_Dp>::value>::type swap(unique_ptr<_Tp, _Dp>&, unique_ptr<_Tp, _Dp>&) = delete; #endif template<typename _Tp, typename _Dp, typename _Up, typename _Ep> inline bool operator==(const unique_ptr<_Tp, _Dp>& __x, const unique_ptr<_Up, _Ep>& __y) { return __x.get() == __y.get(); } template<typename _Tp, typename _Dp> inline bool operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept { return !__x; } template<typename _Tp, typename _Dp> inline bool operator==(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept { return !__x; } template<typename _Tp, typename _Dp, typename _Up, typename _Ep> inline bool operator!=(const unique_ptr<_Tp, _Dp>& __x, const unique_ptr<_Up, _Ep>& __y) { return __x.get() != __y.get(); } template<typename _Tp, typename _Dp> inline bool operator!=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept { return (bool)__x; } template<typename _Tp, typename _Dp> inline bool operator!=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept { return (bool)__x; } template<typename _Tp, typename _Dp, typename _Up, typename _Ep> inline bool operator<(const unique_ptr<_Tp, _Dp>& __x, const unique_ptr<_Up, _Ep>& __y) { typedef typename std::common_type<typename unique_ptr<_Tp, _Dp>::pointer, typename unique_ptr<_Up, _Ep>::pointer>::type _CT; return std::less<_CT>()(__x.get(), __y.get()); } template<typename _Tp, typename _Dp> inline bool operator<(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(), nullptr); } template<typename _Tp, typename _Dp> inline bool operator<(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr, __x.get()); } template<typename _Tp, typename _Dp, typename _Up, typename _Ep> inline bool operator<=(const unique_ptr<_Tp, _Dp>& __x, const unique_ptr<_Up, _Ep>& __y) { return !(__y < __x); } template<typename _Tp, typename _Dp> inline bool operator<=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) { return !(nullptr < __x); } template<typename _Tp, typename _Dp> inline bool operator<=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) { return !(__x < nullptr); } template<typename _Tp, typename _Dp, typename _Up, typename _Ep> inline bool operator>(const unique_ptr<_Tp, _Dp>& __x, const unique_ptr<_Up, _Ep>& __y) { return (__y < __x); } template<typename _Tp, typename _Dp> inline bool operator>(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(nullptr, __x.get()); } template<typename _Tp, typename _Dp> inline bool operator>(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) { return std::less<typename unique_ptr<_Tp, _Dp>::pointer>()(__x.get(), nullptr); } template<typename _Tp, typename _Dp, typename _Up, typename _Ep> inline bool operator>=(const unique_ptr<_Tp, _Dp>& __x, const unique_ptr<_Up, _Ep>& __y) { return !(__x < __y); } template<typename _Tp, typename _Dp> inline bool operator>=(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) { return !(__x < nullptr); } template<typename _Tp, typename _Dp> inline bool operator>=(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) { return !(nullptr < __x); } /// std::hash specialization for unique_ptr. template<typename _Tp, typename _Dp> struct hash<unique_ptr<_Tp, _Dp>> : public __hash_base<size_t, unique_ptr<_Tp, _Dp>>, private __poison_hash<typename unique_ptr<_Tp, _Dp>::pointer> { size_t operator()(const unique_ptr<_Tp, _Dp>& __u) const noexcept { typedef unique_ptr<_Tp, _Dp> _UP; return std::hash<typename _UP::pointer>()(__u.get()); } }; #if __cplusplus > 201103L #define __cpp_lib_make_unique 201304 template<typename _Tp> struct _MakeUniq { typedef unique_ptr<_Tp> __single_object; }; template<typename _Tp> struct _MakeUniq<_Tp[]> { typedef unique_ptr<_Tp[]> __array; }; template<typename _Tp, size_t _Bound> struct _MakeUniq<_Tp[_Bound]> { struct __invalid_type { }; }; /// std::make_unique for single objects template<typename _Tp, typename... _Args> inline typename _MakeUniq<_Tp>::__single_object make_unique(_Args&&... __args) { return unique_ptr<_Tp>(new _Tp(std::forward<_Args>(__args)...)); } /// std::make_unique for arrays of unknown bound template<typename _Tp> inline typename _MakeUniq<_Tp>::__array make_unique(size_t __num) { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); } /// Disable std::make_unique for arrays of known bound template<typename _Tp, typename... _Args> inline typename _MakeUniq<_Tp>::__invalid_type make_unique(_Args&&...) = delete; #endif // @} group pointer_abstractions _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _UNIQUE_PTR_H */