[29] | 1 | #ifndef BOOST_SHARED_ARRAY_HPP_INCLUDED |
---|
| 2 | #define BOOST_SHARED_ARRAY_HPP_INCLUDED |
---|
| 3 | |
---|
| 4 | // |
---|
| 5 | // shared_array.hpp |
---|
| 6 | // |
---|
| 7 | // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. |
---|
| 8 | // Copyright (c) 2001, 2002 Peter Dimov |
---|
| 9 | // |
---|
| 10 | // Distributed under the Boost Software License, Version 1.0. (See |
---|
| 11 | // accompanying file LICENSE_1_0.txt or copy at |
---|
| 12 | // http://www.boost.org/LICENSE_1_0.txt) |
---|
| 13 | // |
---|
| 14 | // See http://www.boost.org/libs/smart_ptr/shared_array.htm for documentation. |
---|
| 15 | // |
---|
| 16 | |
---|
| 17 | #include <boost/config.hpp> // for broken compiler workarounds |
---|
| 18 | |
---|
| 19 | #if defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) |
---|
| 20 | #include <boost/detail/shared_array_nmt.hpp> |
---|
| 21 | #else |
---|
| 22 | |
---|
| 23 | #include <memory> // TR1 cyclic inclusion fix |
---|
| 24 | |
---|
| 25 | #include <boost/assert.hpp> |
---|
| 26 | #include <boost/checked_delete.hpp> |
---|
| 27 | |
---|
| 28 | #include <boost/detail/shared_count.hpp> |
---|
| 29 | #include <boost/detail/workaround.hpp> |
---|
| 30 | |
---|
| 31 | #include <cstddef> // for std::ptrdiff_t |
---|
| 32 | #include <algorithm> // for std::swap |
---|
| 33 | #include <functional> // for std::less |
---|
| 34 | |
---|
| 35 | namespace boost |
---|
| 36 | { |
---|
| 37 | |
---|
| 38 | // |
---|
| 39 | // shared_array |
---|
| 40 | // |
---|
| 41 | // shared_array extends shared_ptr to arrays. |
---|
| 42 | // The array pointed to is deleted when the last shared_array pointing to it |
---|
| 43 | // is destroyed or reset. |
---|
| 44 | // |
---|
| 45 | |
---|
| 46 | template<class T> class shared_array |
---|
| 47 | { |
---|
| 48 | private: |
---|
| 49 | |
---|
| 50 | // Borland 5.5.1 specific workarounds |
---|
| 51 | typedef checked_array_deleter<T> deleter; |
---|
| 52 | typedef shared_array<T> this_type; |
---|
| 53 | |
---|
| 54 | public: |
---|
| 55 | |
---|
| 56 | typedef T element_type; |
---|
| 57 | |
---|
| 58 | explicit shared_array(T * p = 0): px(p), pn(p, deleter()) |
---|
| 59 | { |
---|
| 60 | } |
---|
| 61 | |
---|
| 62 | // |
---|
| 63 | // Requirements: D's copy constructor must not throw |
---|
| 64 | // |
---|
| 65 | // shared_array will release p by calling d(p) |
---|
| 66 | // |
---|
| 67 | |
---|
| 68 | template<class D> shared_array(T * p, D d): px(p), pn(p, d) |
---|
| 69 | { |
---|
| 70 | } |
---|
| 71 | |
---|
| 72 | // generated copy constructor, assignment, destructor are fine |
---|
| 73 | |
---|
| 74 | void reset(T * p = 0) |
---|
| 75 | { |
---|
| 76 | BOOST_ASSERT(p == 0 || p != px); |
---|
| 77 | this_type(p).swap(*this); |
---|
| 78 | } |
---|
| 79 | |
---|
| 80 | template <class D> void reset(T * p, D d) |
---|
| 81 | { |
---|
| 82 | this_type(p, d).swap(*this); |
---|
| 83 | } |
---|
| 84 | |
---|
| 85 | T & operator[] (std::ptrdiff_t i) const // never throws |
---|
| 86 | { |
---|
| 87 | BOOST_ASSERT(px != 0); |
---|
| 88 | BOOST_ASSERT(i >= 0); |
---|
| 89 | return px[i]; |
---|
| 90 | } |
---|
| 91 | |
---|
| 92 | T * get() const // never throws |
---|
| 93 | { |
---|
| 94 | return px; |
---|
| 95 | } |
---|
| 96 | |
---|
| 97 | // implicit conversion to "bool" |
---|
| 98 | |
---|
| 99 | #if defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x530) |
---|
| 100 | |
---|
| 101 | operator bool () const |
---|
| 102 | { |
---|
| 103 | return px != 0; |
---|
| 104 | } |
---|
| 105 | |
---|
| 106 | #elif defined(__MWERKS__) && BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) |
---|
| 107 | typedef T * (this_type::*unspecified_bool_type)() const; |
---|
| 108 | |
---|
| 109 | operator unspecified_bool_type() const // never throws |
---|
| 110 | { |
---|
| 111 | return px == 0? 0: &this_type::get; |
---|
| 112 | } |
---|
| 113 | |
---|
| 114 | #else |
---|
| 115 | |
---|
| 116 | typedef T * this_type::*unspecified_bool_type; |
---|
| 117 | |
---|
| 118 | operator unspecified_bool_type() const // never throws |
---|
| 119 | { |
---|
| 120 | return px == 0? 0: &this_type::px; |
---|
| 121 | } |
---|
| 122 | |
---|
| 123 | #endif |
---|
| 124 | |
---|
| 125 | bool operator! () const // never throws |
---|
| 126 | { |
---|
| 127 | return px == 0; |
---|
| 128 | } |
---|
| 129 | |
---|
| 130 | bool unique() const // never throws |
---|
| 131 | { |
---|
| 132 | return pn.unique(); |
---|
| 133 | } |
---|
| 134 | |
---|
| 135 | long use_count() const // never throws |
---|
| 136 | { |
---|
| 137 | return pn.use_count(); |
---|
| 138 | } |
---|
| 139 | |
---|
| 140 | void swap(shared_array<T> & other) // never throws |
---|
| 141 | { |
---|
| 142 | std::swap(px, other.px); |
---|
| 143 | pn.swap(other.pn); |
---|
| 144 | } |
---|
| 145 | |
---|
| 146 | private: |
---|
| 147 | |
---|
| 148 | T * px; // contained pointer |
---|
| 149 | detail::shared_count pn; // reference counter |
---|
| 150 | |
---|
| 151 | }; // shared_array |
---|
| 152 | |
---|
| 153 | template<class T> inline bool operator==(shared_array<T> const & a, shared_array<T> const & b) // never throws |
---|
| 154 | { |
---|
| 155 | return a.get() == b.get(); |
---|
| 156 | } |
---|
| 157 | |
---|
| 158 | template<class T> inline bool operator!=(shared_array<T> const & a, shared_array<T> const & b) // never throws |
---|
| 159 | { |
---|
| 160 | return a.get() != b.get(); |
---|
| 161 | } |
---|
| 162 | |
---|
| 163 | template<class T> inline bool operator<(shared_array<T> const & a, shared_array<T> const & b) // never throws |
---|
| 164 | { |
---|
| 165 | return std::less<T*>()(a.get(), b.get()); |
---|
| 166 | } |
---|
| 167 | |
---|
| 168 | template<class T> void swap(shared_array<T> & a, shared_array<T> & b) // never throws |
---|
| 169 | { |
---|
| 170 | a.swap(b); |
---|
| 171 | } |
---|
| 172 | |
---|
| 173 | } // namespace boost |
---|
| 174 | |
---|
| 175 | #endif // #if defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) |
---|
| 176 | |
---|
| 177 | #endif // #ifndef BOOST_SHARED_ARRAY_HPP_INCLUDED |
---|