X7ROOT File Manager
Current Path:
/usr/include/c++/4.8.2/bits
usr
/
include
/
c++
/
4.8.2
/
bits
/
📁
..
📄
algorithmfwd.h
(20.66 KB)
📄
alloc_traits.h
(17.66 KB)
📄
allocator.h
(6.1 KB)
📄
atomic_base.h
(24.99 KB)
📄
atomic_lockfree_defines.h
(2.2 KB)
📄
basic_ios.h
(14.76 KB)
📄
basic_ios.tcc
(5.89 KB)
📄
basic_string.h
(109.49 KB)
📄
basic_string.tcc
(38.43 KB)
📄
boost_concept_check.h
(26.41 KB)
📄
c++0x_warning.h
(1.47 KB)
📄
char_traits.h
(16.95 KB)
📄
codecvt.h
(16.23 KB)
📄
concept_check.h
(3.26 KB)
📄
cpp_type_traits.h
(9.56 KB)
📄
cxxabi_forced.h
(1.77 KB)
📄
deque.tcc
(31.91 KB)
📄
exception_defines.h
(1.6 KB)
📄
exception_ptr.h
(5.29 KB)
📄
forward_list.h
(46.72 KB)
📄
forward_list.tcc
(15.17 KB)
📄
fstream.tcc
(28.3 KB)
📄
functexcept.h
(3.04 KB)
📄
functional_hash.h
(6.05 KB)
📄
gslice.h
(5.39 KB)
📄
gslice_array.h
(7.59 KB)
📄
hash_bytes.h
(2.1 KB)
📄
hashtable.h
(61.05 KB)
📄
hashtable_policy.h
(52.72 KB)
📄
indirect_array.h
(7.68 KB)
📄
ios_base.h
(27.85 KB)
📄
istream.tcc
(30.36 KB)
📄
list.tcc
(12.2 KB)
📄
locale_classes.h
(22.45 KB)
📄
locale_classes.tcc
(8.18 KB)
📄
locale_facets.h
(88.84 KB)
📄
locale_facets.tcc
(38.02 KB)
📄
locale_facets_nonio.h
(63.51 KB)
📄
locale_facets_nonio.tcc
(40.85 KB)
📄
localefwd.h
(5.1 KB)
📄
mask_array.h
(7.41 KB)
📄
memoryfwd.h
(2.36 KB)
📄
move.h
(5.67 KB)
📄
nested_exception.h
(4.58 KB)
📄
ostream.tcc
(12.03 KB)
📄
ostream_insert.h
(3.91 KB)
📄
postypes.h
(8.02 KB)
📄
ptr_traits.h
(5.17 KB)
📄
random.h
(173.19 KB)
📄
random.tcc
(106.59 KB)
📄
range_access.h
(3.06 KB)
📄
regex.h
(83.49 KB)
📄
regex_compiler.h
(27.68 KB)
📄
regex_constants.h
(10.81 KB)
📄
regex_cursor.h
(2.7 KB)
📄
regex_error.h
(4.5 KB)
📄
regex_grep_matcher.h
(4.23 KB)
📄
regex_grep_matcher.tcc
(5.41 KB)
📄
regex_nfa.h
(10.65 KB)
📄
regex_nfa.tcc
(4.85 KB)
📄
shared_ptr.h
(18.97 KB)
📄
shared_ptr_base.h
(40.65 KB)
📄
slice_array.h
(9.12 KB)
📄
sstream.tcc
(9.27 KB)
📄
stl_algo.h
(212.55 KB)
📄
stl_algobase.h
(41.41 KB)
📄
stl_bvector.h
(28.98 KB)
📄
stl_construct.h
(5.05 KB)
📄
stl_deque.h
(66.41 KB)
📄
stl_function.h
(22.06 KB)
📄
stl_heap.h
(19.99 KB)
📄
stl_iterator.h
(35.77 KB)
📄
stl_iterator_base_funcs.h
(6.8 KB)
📄
stl_iterator_base_types.h
(8.19 KB)
📄
stl_list.h
(52.83 KB)
📄
stl_map.h
(36.78 KB)
📄
stl_multimap.h
(33.94 KB)
📄
stl_multiset.h
(28.37 KB)
📄
stl_numeric.h
(13.5 KB)
📄
stl_pair.h
(9.63 KB)
📄
stl_queue.h
(18.21 KB)
📄
stl_raw_storage_iter.h
(3.37 KB)
📄
stl_relops.h
(4.49 KB)
📄
stl_set.h
(28.61 KB)
📄
stl_stack.h
(9.65 KB)
📄
stl_tempbuf.h
(8.15 KB)
📄
stl_tree.h
(53.56 KB)
📄
stl_uninitialized.h
(19.95 KB)
📄
stl_vector.h
(48.64 KB)
📄
stream_iterator.h
(6.44 KB)
📄
streambuf.tcc
(4.81 KB)
📄
streambuf_iterator.h
(12.33 KB)
📄
stringfwd.h
(2.37 KB)
📄
unique_ptr.h
(17.19 KB)
📄
unordered_map.h
(47.76 KB)
📄
unordered_set.h
(43.25 KB)
📄
uses_allocator.h
(3.49 KB)
📄
valarray_after.h
(22.12 KB)
📄
valarray_array.h
(21.23 KB)
📄
valarray_array.tcc
(7.08 KB)
📄
valarray_before.h
(18.08 KB)
📄
vector.tcc
(25.55 KB)
Editing: unique_ptr.h
// unique_ptr implementation -*- C++ -*- // Copyright (C) 2008-2013 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/debug.h> #include <type_traits> #include <utility> #include <tuple> namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @addtogroup pointer_abstractions * @{ */ #if _GLIBCXX_USE_DEPRECATED template<typename> class auto_ptr; #endif /// Primary template, default_delete. template<typename _Tp> struct default_delete { constexpr default_delete() noexcept = default; template<typename _Up, typename = typename enable_if<is_convertible<_Up*, _Tp*>::value>::type> default_delete(const default_delete<_Up>&) noexcept { } void operator()(_Tp* __ptr) const { 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, default_delete. template<typename _Tp> struct default_delete<_Tp[]> { private: 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: constexpr default_delete() noexcept = default; template<typename _Up, typename = typename enable_if<!__is_derived_Tp<_Up>::value>::type> default_delete(const default_delete<_Up[]>&) noexcept { } void operator()(_Tp* __ptr) const { static_assert(sizeof(_Tp)>0, "can't delete pointer to incomplete type"); delete [] __ptr; } template<typename _Up> typename enable_if<__is_derived_Tp<_Up>::value>::type operator()(_Up*) const = delete; }; /// 20.7.1.2 unique_ptr for single objects. template <typename _Tp, typename _Dp = default_delete<_Tp> > class unique_ptr { // use SFINAE to determine whether _Del::pointer exists class _Pointer { template<typename _Up> static typename _Up::pointer __test(typename _Up::pointer*); template<typename _Up> static _Tp* __test(...); typedef typename remove_reference<_Dp>::type _Del; public: typedef decltype(__test<_Del>(0)) type; }; typedef std::tuple<typename _Pointer::type, _Dp> __tuple_type; __tuple_type _M_t; public: typedef typename _Pointer::type pointer; typedef _Tp element_type; typedef _Dp deleter_type; // Constructors. constexpr unique_ptr() noexcept : _M_t() { static_assert(!is_pointer<deleter_type>::value, "constructed with null function pointer deleter"); } explicit unique_ptr(pointer __p) noexcept : _M_t(__p, deleter_type()) { static_assert(!is_pointer<deleter_type>::value, "constructed with null function pointer deleter"); } unique_ptr(pointer __p, typename conditional<is_reference<deleter_type>::value, deleter_type, const deleter_type&>::type __d) noexcept : _M_t(__p, __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"); } constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { } // Move constructors. unique_ptr(unique_ptr&& __u) noexcept : _M_t(__u.release(), std::forward<deleter_type>(__u.get_deleter())) { } template<typename _Up, typename _Ep, typename = _Require< is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>, __not_<is_array<_Up>>, 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 template<typename _Up, typename = _Require< is_convertible<_Up*, _Tp*>, is_same<_Dp, default_delete<_Tp>>>> unique_ptr(auto_ptr<_Up>&& __u) noexcept; #endif // Destructor. ~unique_ptr() noexcept { auto& __ptr = std::get<0>(_M_t); if (__ptr != nullptr) get_deleter()(__ptr); __ptr = pointer(); } // Assignment. unique_ptr& operator=(unique_ptr&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<deleter_type>(__u.get_deleter()); return *this; } template<typename _Up, typename _Ep> typename enable_if< __and_< is_convertible<typename unique_ptr<_Up, _Ep>::pointer, pointer>, __not_<is_array<_Up>> >::value, unique_ptr&>::type operator=(unique_ptr<_Up, _Ep>&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<_Ep>(__u.get_deleter()); return *this; } unique_ptr& operator=(nullptr_t) noexcept { reset(); return *this; } // Observers. typename add_lvalue_reference<element_type>::type operator*() const { _GLIBCXX_DEBUG_ASSERT(get() != pointer()); return *get(); } pointer operator->() const noexcept { _GLIBCXX_DEBUG_ASSERT(get() != pointer()); return get(); } pointer get() const noexcept { return std::get<0>(_M_t); } deleter_type& get_deleter() noexcept { return std::get<1>(_M_t); } const deleter_type& get_deleter() const noexcept { return std::get<1>(_M_t); } explicit operator bool() const noexcept { return get() == pointer() ? false : true; } // Modifiers. pointer release() noexcept { pointer __p = get(); std::get<0>(_M_t) = pointer(); return __p; } void reset(pointer __p = pointer()) noexcept { using std::swap; swap(std::get<0>(_M_t), __p); if (__p != pointer()) get_deleter()(__p); } void swap(unique_ptr& __u) noexcept { using std::swap; swap(_M_t, __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> { // use SFINAE to determine whether _Del::pointer exists class _Pointer { template<typename _Up> static typename _Up::pointer __test(typename _Up::pointer*); template<typename _Up> static _Tp* __test(...); typedef typename remove_reference<_Dp>::type _Del; public: typedef decltype(__test<_Del>(0)) type; }; typedef std::tuple<typename _Pointer::type, _Dp> __tuple_type; __tuple_type _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>>> >; template<typename _Up, typename _Ep, typename _Tp_pointer = typename _Pointer::type, typename _Up_pointer = typename unique_ptr<_Up, _Ep>::pointer> using __safe_conversion = __and_< is_convertible<_Up_pointer, _Tp_pointer>, is_array<_Up>, __or_<__not_<is_pointer<_Up_pointer>>, __not_<is_pointer<_Tp_pointer>>, __not_<__is_derived_Tp<typename remove_extent<_Up>::type>> > >; public: typedef typename _Pointer::type pointer; typedef _Tp element_type; typedef _Dp deleter_type; // Constructors. constexpr unique_ptr() noexcept : _M_t() { static_assert(!std::is_pointer<deleter_type>::value, "constructed with null function pointer deleter"); } explicit unique_ptr(pointer __p) noexcept : _M_t(__p, deleter_type()) { static_assert(!is_pointer<deleter_type>::value, "constructed with null function pointer deleter"); } template<typename _Up, typename = _Require<is_pointer<pointer>, is_convertible<_Up*, pointer>, __is_derived_Tp<_Up>>> explicit unique_ptr(_Up* __p) = delete; unique_ptr(pointer __p, typename conditional<is_reference<deleter_type>::value, deleter_type, const deleter_type&>::type __d) noexcept : _M_t(__p, __d) { } unique_ptr(pointer __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())) { } constexpr unique_ptr(nullptr_t) noexcept : unique_ptr() { } template<typename _Up, typename _Ep, typename = _Require<__safe_conversion<_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. ~unique_ptr() { auto& __ptr = std::get<0>(_M_t); if (__ptr != nullptr) get_deleter()(__ptr); __ptr = pointer(); } // Assignment. unique_ptr& operator=(unique_ptr&& __u) noexcept { reset(__u.release()); get_deleter() = std::forward<deleter_type>(__u.get_deleter()); return *this; } template<typename _Up, typename _Ep> typename enable_if<__safe_conversion<_Up, _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; } unique_ptr& operator=(nullptr_t) noexcept { reset(); return *this; } // Observers. typename std::add_lvalue_reference<element_type>::type operator[](size_t __i) const { _GLIBCXX_DEBUG_ASSERT(get() != pointer()); return get()[__i]; } pointer get() const noexcept { return std::get<0>(_M_t); } deleter_type& get_deleter() noexcept { return std::get<1>(_M_t); } const deleter_type& get_deleter() const noexcept { return std::get<1>(_M_t); } explicit operator bool() const noexcept { return get() == pointer() ? false : true; } // Modifiers. pointer release() noexcept { pointer __p = get(); std::get<0>(_M_t) = pointer(); return __p; } void reset() noexcept { reset(pointer()); } void reset(pointer __p) noexcept { using std::swap; swap(std::get<0>(_M_t), __p); if (__p != nullptr) get_deleter()(__p); } template<typename _Up, typename = _Require<is_pointer<pointer>, is_convertible<_Up*, pointer>, __is_derived_Tp<_Up>>> void reset(_Up*) = delete; void swap(unique_ptr& __u) noexcept { using std::swap; swap(_M_t, __u._M_t); } // Disable copy from lvalue. unique_ptr(const unique_ptr&) = delete; unique_ptr& operator=(const unique_ptr&) = delete; // Disable construction from convertible pointer types. template<typename _Up, typename = _Require<is_pointer<pointer>, is_convertible<_Up*, pointer>, __is_derived_Tp<_Up>>> unique_ptr(_Up*, typename conditional<is_reference<deleter_type>::value, deleter_type, const deleter_type&>::type) = delete; template<typename _Up, typename = _Require<is_pointer<pointer>, is_convertible<_Up*, pointer>, __is_derived_Tp<_Up>>> unique_ptr(_Up*, typename remove_reference<deleter_type>::type&&) = delete; }; template<typename _Tp, typename _Dp> inline void swap(unique_ptr<_Tp, _Dp>& __x, unique_ptr<_Tp, _Dp>& __y) noexcept { __x.swap(__y); } 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>> { 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()); } }; // @} group pointer_abstractions _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _UNIQUE_PTR_H */
Upload File
Create Folder