# ext/memory

Go to the documentation of this file.

    00001 // Memory extensions -*- C++ -*-
    00002
    00003 // Copyright (C) 2002, 2004, 2005 Free Software Foundation, Inc.
    00004 //
    00005 // This file is part of the GNU ISO C++ Library.  This library is free
    00006 // software; you can redistribute it and/or modify it under the
    00007 // terms of the GNU General Public License as published by the
    00008 // Free Software Foundation; either version 2, or (at your option)
    00009 // any later version.
    00010
    00011 // This library is distributed in the hope that it will be useful,
    00012 // but WITHOUT ANY WARRANTY; without even the implied warranty of
    00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    00014 // GNU General Public License for more details.
    00015
    00016 // You should have received a copy of the GNU General Public License along
    00017 // with this library; see the file COPYING.  If not, write to the Free
    00018 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
    00019 // USA.
    00020
    00021 // As a special exception, you may use this file as part of a free software
    00022 // library without restriction.  Specifically, if other files instantiate
    00023 // templates or use macros or inline functions from this file, or you compile
    00024 // this file and link it with other files to produce an executable, this
    00025 // file does not by itself cause the resulting executable to be covered by
    00026 // the GNU General Public License.  This exception does not however
    00027 // invalidate any other reasons why the executable file might be covered by
    00028 // the GNU General Public License.
    00029
    00030 /*
    00031  *
    00032  * Copyright (c) 1994
    00033  * Hewlett-Packard Company
    00034  *
    00035  * Permission to use, copy, modify, distribute and sell this software
    00036  * and its documentation for any purpose is hereby granted without fee,
    00037  * provided that the above copyright notice appear in all copies and
    00038  * that both that copyright notice and this permission notice appear
    00039  * in supporting documentation.  Hewlett-Packard Company makes no
    00040  * representations about the suitability of this software for any
    00041  * purpose.  It is provided "as is" without express or implied warranty.
    00042  *
    00043  *
    00044  * Copyright (c) 1996
    00045  * Silicon Graphics Computer Systems, Inc.
    00046  *
    00047  * Permission to use, copy, modify, distribute and sell this software
    00048  * and its documentation for any purpose is hereby granted without fee,
    00049  * provided that the above copyright notice appear in all copies and
    00050  * that both that copyright notice and this permission notice appear
    00051  * in supporting documentation.  Silicon Graphics makes no
    00052  * representations about the suitability of this software for any
    00053  * purpose.  It is provided "as is" without express or implied warranty.
    00054  */
    00055
    00056 /** @file ext/memory
    00057  *  This file is a GNU extension to the Standard C++ Library (possibly
    00058  *  containing extensions from the HP/SGI STL subset).
    00059  */
    00060
    00061 #ifndef _EXT_MEMORY
    00062 #define _EXT_MEMORY 1
    00063
    00064 #pragma GCC system_header
    00065
    00066 #include <memory>
    00067 #include <bits/stl_tempbuf.h>
    00068
    00069 _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
    00070
    00071   using std::ptrdiff_t;
    00072   using std::pair;
    00073   using std::__iterator_category;
    00074   using std::_Temporary_buffer;
    00075
    00076   template<typename _InputIter, typename _Size, typename _ForwardIter>
    00077     pair<_InputIter, _ForwardIter>
    00078     __uninitialized_copy_n(_InputIter __first, _Size __count,
    00079                _ForwardIter __result, std::input_iterator_tag)
    00080     {
    00081       _ForwardIter __cur = __result;
    00082       try
    00083     {
    00084       for (; __count > 0 ; --__count, ++__first, ++__cur)
    00085         std::_Construct(&*__cur, *__first);
    00086       return pair<_InputIter, _ForwardIter>(__first, __cur);
    00087     }
    00088       catch(...)
    00089     {
    00090       std::_Destroy(__result, __cur);
    00091       __throw_exception_again;
    00092     }
    00093     }
    00094
    00095   template<typename _RandomAccessIter, typename _Size, typename _ForwardIter>
    00096     inline pair<_RandomAccessIter, _ForwardIter>
    00097     __uninitialized_copy_n(_RandomAccessIter __first, _Size __count,
    00098                _ForwardIter __result,
    00099                std::random_access_iterator_tag)
    00100     {
    00101       _RandomAccessIter __last = __first + __count;
    00102       return (pair<_RandomAccessIter, _ForwardIter>
    00103           (__last, std::uninitialized_copy(__first, __last, __result)));
    00104     }
    00105
    00106   template<typename _InputIter, typename _Size, typename _ForwardIter>
    00107     inline pair<_InputIter, _ForwardIter>
    00108     __uninitialized_copy_n(_InputIter __first, _Size __count,
    00109              _ForwardIter __result)
    00110     { return __uninitialized_copy_n(__first, __count, __result,
    00111                     __iterator_category(__first)); }
    00112
    00113   /**
    00114    *  @brief Copies the range [first,last) into result.
    00115    *  @param  first  An input iterator.
    00116    *  @param  last   An input iterator.
    00117    *  @param  result An output iterator.
    00118    *  @return   result + (first - last)
    00119    *  @ingroup SGIextensions
    00120    *
    00121    *  Like copy(), but does not require an initialized output range.
    00122   */
    00123   template<typename _InputIter, typename _Size, typename _ForwardIter>
    00124     inline pair<_InputIter, _ForwardIter>
    00125     uninitialized_copy_n(_InputIter __first, _Size __count,
    00126              _ForwardIter __result)
    00127     { return __uninitialized_copy_n(__first, __count, __result,
    00128                     __iterator_category(__first)); }
    00129
    00130
    00131   // An alternative version of uninitialized_copy_n that constructs
    00132   // and destroys objects with a user-provided allocator.
    00133   template<typename _InputIter, typename _Size, typename _ForwardIter,
    00134            typename _Allocator>
    00135     pair<_InputIter, _ForwardIter>
    00136     __uninitialized_copy_n_a(_InputIter __first, _Size __count,
    00137                  _ForwardIter __result,
    00138                  _Allocator __alloc)
    00139     {
    00140       _ForwardIter __cur = __result;
    00141       try
    00142     {
    00143       for (; __count > 0 ; --__count, ++__first, ++__cur)
    00144         __alloc.construct(&*__cur, *__first);
    00145       return pair<_InputIter, _ForwardIter>(__first, __cur);
    00146     }
    00147       catch(...)
    00148     {
    00149       std::_Destroy(__result, __cur, __alloc);
    00150       __throw_exception_again;
    00151     }
    00152     }
    00153
    00154   template<typename _InputIter, typename _Size, typename _ForwardIter,
    00155            typename _Tp>
    00156     inline pair<_InputIter, _ForwardIter>
    00157     __uninitialized_copy_n_a(_InputIter __first, _Size __count,
    00158                  _ForwardIter __result,
    00159                  std::allocator<_Tp>)
    00160     {
    00161       return uninitialized_copy_n(__first, __count, __result);
    00162     }
    00163
    00164   /**
    00165    *  This class provides similar behavior and semantics of the standard
    00166    *  functions get_temporary_buffer() and return_temporary_buffer(), but
    00167    *  encapsulated in a type vaguely resembling a standard container.
    00168    *
    00169    *  By default, a temporary_buffer<Iter> stores space for objects of
    00170    *  whatever type the Iter iterator points to.  It is constructed from a
    00171    *  typical [first,last) range, and provides the begin(), end(), size()
    00172    *  functions, as well as requested_size().  For non-trivial types, copies
    00173    *  of *first will be used to initialize the storage.
    00174    *
    00175    *  @c malloc is used to obtain underlying storage.
    00176    *
    00177    *  Like get_temporary_buffer(), not all the requested memory may be
    00178    *  available.  Ideally, the created buffer will be large enough to hold a
    00179    *  copy of [first,last), but if size() is less than requested_size(),
    00180    *  then this didn't happen.
    00181    *
    00182    *  @ingroup SGIextensions
    00183   */
    00184   template <class _ForwardIterator, class _Tp
    00185         = typename std::iterator_traits<_ForwardIterator>::value_type >
    00186     struct temporary_buffer : public _Temporary_buffer<_ForwardIterator, _Tp>
    00187     {
    00188       /// Requests storage large enough to hold a copy of [first,last).
    00189       temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)
    00190       : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) { }
    00191
    00192       /// Destroys objects and frees storage.
    00193       ~temporary_buffer() { }
    00194     };
    00195
    00196 _GLIBCXX_END_NAMESPACE
    00197
    00198 #endif
    00199