1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261
|
++++++++++++++++++++++++++++++++++
|Boost| Pointer Container Library
++++++++++++++++++++++++++++++++++
.. |Boost| image:: boost.png
:Authors: Thorsten Ottosen
:Contact: nesotto@cs.aau.dk or tottosen@dezide.com
:Organizations: `Department of Computer Science`_, Aalborg University, and `Dezide Aps`_
:date: 29th of April 2006
:Copyright: Thorsten Ottosen 2004-2006. Use, modification and distribution is subject to the Boost Software License, Version 1.0 (see LICENSE_1_0.txt__).
__ http://www.boost.org/LICENSE_1_0.txt
.. _`Department of Computer Science`: http://www.cs.aau.dk
.. _`Dezide Aps`: http://www.dezide.com
========
Overview
========
Boost.Pointer Container provides containers for holding heap-allocated
objects in an exception-safe manner and with minimal overhead.
The aim of the library is in particular to make OO programming
easier in C++ by establishing a standard set of classes, methods
and designs for dealing with OO specific problems
* Motivation_
* Tutorial_
* Reference_
* `Usage guidelines`_
* Examples_
* `Library headers`_
* FAQ_
* `Upgrading from Boost v. 1.33.*`_
* Acknowledgements_
* References_
..
- `Conventions <conventions.html>`_
- `The Clonable Concept <reference.html#the-clonable-concept>`_
- `The Clone Allocator Concept <reference.html#the-clone-allocator-concept>`_
- `Pointer container adapters <reference.html#pointer-container-adapters>`_
- `Sequence container classes <reference.html#sequence-containers>`_
- `ptr_vector <ptr_vector.html>`_
- `ptr_deque <ptr_deque.html>`_
- `ptr_list <ptr_list.html>`_
- `ptr_array <ptr_array.html>`_
- `Associative container classes <reference.html#associative-containers>`_
- `ptr_set <ptr_set.html>`_
- `ptr_multiset <ptr_multiset.html>`_
- `ptr_map <ptr_map.html>`_
- `ptr_multimap <ptr_multimap.html>`_
- `Indirected functions <indirect_fun.html>`_
- `Class nullable <reference.html#class-nullable>`_
- `Exception classes <reference.html#exception-classes>`_
.. _Tutorial: tutorial.html
.. _Reference: reference.html
.. _`Usage guidelines`: guidelines.html
.. _Examples: examples.html
.. _`Library headers`: headers.html
.. _FAQ: faq.html
==========
Motivation
==========
Whenever a programmer wants to have a container of pointers to
heap-allocated objects, there is usually only one exception-safe way:
to make a container of smart pointers like `boost::shared_ptr <../../smart_ptr/shared_ptr.htm>`_
This approach is suboptimal if
1. the stored objects are not shared, but owned exclusively, or
..
2. the overhead implied by smart pointers is inappropriate
This library therefore provides standard-like containers that are for storing
heap-allocated or `cloned <reference.html#the-clonable-concept>`_ objects (or in case of a map, the mapped object must be
a heap-allocated or cloned object). For each of the standard
containers there is a pointer container equivalent that takes ownership of
the objects in an exception safe manner. In this respect the library is intended
to solve the so-called
`polymorphic class problem <faq.html#what-is-the-polymorphic-class-problem>`_.
The advantages of pointer containers are
1. Exception-safe pointer storage and manipulation.
..
2. Notational convenience compared to the use of containers of pointers.
..
3. Can be used for types that are neither Assignable nor Copy Constructible.
..
4. No memory-overhead as containers of smart pointers can have (see [11]_ and [12]_).
..
5. Usually faster than using containers of smart pointers (see [11]_ and [12]_).
..
6. The interface is slightly changed towards the domain of pointers
instead of relying on the normal value-based interface. For example,
now it is possible for ``pop_back()`` to return the removed element.
..
7. Propagates constness s.t. one cannot modify the objects via a ``const_iterator``.
..
8. Built-in support for deep-copy semantics via the `The Clobable Concept`__
.. __: reference.html#the-clonable-concept
The disadvantages are
1. Less flexible than containers of smart pointers like `boost::shared_ptr <../../smart_ptr/shared_ptr.htm>`_
When you do need shared semantics, this library is not what you need.
====================================
Upgrading from Boost v. ``1.33.*``
====================================
If you upgrade from one of these versions of Boost, then there has been one
major interface change: map iterators now mimic iterators from ``std::map``.
Previously you may have written ::
for( boost::ptr_map<std::string,T>::iterator i = m.begin(), e = m.end();
i != e; ++i )
{
std::cout << "key:" << i.key();
std::cout << "value:" << *i;
i->foo(); // call T::foo()
}
and this now needs to be converted into ::
for( boost::ptr_map<std::string,T>::iterator i = m.begin(), e = m.end();
i != e; ++i )
{
std::cout << "key:" << i->first;
std::cout << "value:" << *i->second;
i->second->foo(); // call T::foo()
}
Apart from the above change, the library now also introduces
- ``std::auto_ptr<T>`` overloads::
std::auto_ptr<T> p( new T );
container.push_back( p );
- Derived-to-Base conversion in ``transfer()``::
boost::ptr_vector<Base> vec;
boost::ptr_list<Derived> list;
...
vec.transfer( vec.begin(), list ); // now ok
Also note that `Boost.Assign <../../assign/index.html>`_ introduces better support
for pointer containers.
================
Acknowledgements
================
The following people have been very helpful:
- Bjrn D. Rasmussen for unintentionally motivating me to start this library
- Pavel Vozenilek for asking me to make the adapters
- David Abrahams for the ``indirect_fun`` design
- Pavol Droba for being review manager
- Ross Boylan for trying out a prototype for real
- Felipe Magno de Almeida for giving fedback based on using the
library in production code even before the library was part of boost
- Jonathan Turkanis for supplying his ``move_ptr`` framework
which is used internally
- Stefan Slapeta and Howard Hinnant for Metrowerks support
- Russell Hind for help with Borland compatibility
- Jonathan Wakely for his great help with GCC compatibility and bug fixes
- Pavel Chikulaev for comments and bug-fixes
- Andreas Hommel for fixing the nasty Metrowerks bug
==========
References
==========
.. [1] Matt Austern: `"The Standard Librarian: Containers of Pointers"`__ , C/C++ Users Journal Experts Forum.
__ http://www.cuj.com/documents/s=7990/cujcexp1910austern/
.. [2] Bjarne Stroustrup, "The C++ Programming Language", `Appendix E: "Standard-Library Exception Safety"`__
__ http://www.research.att.com/~bs/3rd_safe.pdf
.. [3] Herb Sutter, "Exceptional C++".
.. [4] Herb Sutter, "More Exceptional C++".
.. [5] Kevlin Henney: `"From Mechanism to Method: The Safe Stacking of Cats"`__ , C++ Experts Forum, February 2002.
__ http://www.cuj.com/documents/s=7986/cujcexp2002henney/henney.htm
.. [6] Some of the few earlier attempts of pointer containers I have seen are the rather interesting NTL_ and the
pointainer_.
As of this writing both libraries are not exceptions-safe and can leak.
.. [7] INTERNATIONAL STANDARD, Programming languages --- C++, ISO/IEC 14882, 1998. See section 23 in particular.
.. [8] C++ Standard Library Closed Issues List (Revision 27),
Item 218, `Algorithms do not use binary predicate objects for default comparisons`__.
__ http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-closed.html#218
.. [9] C++ Standard Library Active Issues List (Revision 27),
Item 226, `User supplied specializations or overloads of namespace std function templates`__.
__ http://gcc.gnu.org/onlinedocs/libstdc++/ext/lwg-active.html#226
.. [10] Harald Nowak, "A remove_if for vector", C/C++ Users Journal, July 2001.
.. [11] Boost smart pointer timings__
__ http://www.boost.org/libs/smart_ptr/smarttests.htm
.. [12] NTL_: Array vs std::vector and boost::shared_ptr
.. [13] Kevlin Henney, `Null Object`__, 2002.
__ http://www.two-sdg.demon.co.uk/curbralan/papers/europlop/NullObject.pdf
.. _NTL: http://www.ntllib.org/asp.html
.. _pointainer: http://ootips.org/yonat/4dev/pointainer.h
.. raw:: html
<hr>
:Copyright: Thorsten Ottosen 2004-2006.
|