1 // Memory extensions -*- C++ -*-
3 // Copyright (C) 2002, 2004 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
33 * Hewlett-Packard Company
35 * Permission to use, copy, modify, distribute and sell this software
36 * and its documentation for any purpose is hereby granted without fee,
37 * provided that the above copyright notice appear in all copies and
38 * that both that copyright notice and this permission notice appear
39 * in supporting documentation. Hewlett-Packard Company makes no
40 * representations about the suitability of this software for any
41 * purpose. It is provided "as is" without express or implied warranty.
45 * Silicon Graphics Computer Systems, Inc.
47 * Permission to use, copy, modify, distribute and sell this software
48 * and its documentation for any purpose is hereby granted without fee,
49 * provided that the above copyright notice appear in all copies and
50 * that both that copyright notice and this permission notice appear
51 * in supporting documentation. Silicon Graphics makes no
52 * representations about the suitability of this software for any
53 * purpose. It is provided "as is" without express or implied warranty.
57 * This file is a GNU extension to the Standard C++ Library (possibly
58 * containing extensions from the HP/SGI STL subset).
64 #pragma GCC system_header
67 #include <bits/stl_algobase.h>
68 #include <bits/stl_tempbuf.h>
74 using std::__iterator_category;
75 using std::_Temporary_buffer;
77 template<typename _InputIter, typename _Size, typename _ForwardIter>
78 pair<_InputIter, _ForwardIter>
79 __uninitialized_copy_n(_InputIter __first, _Size __count,
80 _ForwardIter __result, std::input_iterator_tag)
82 _ForwardIter __cur = __result;
85 for (; __count > 0 ; --__count, ++__first, ++__cur)
86 std::_Construct(&*__cur, *__first);
87 return pair<_InputIter, _ForwardIter>(__first, __cur);
91 std::_Destroy(__result, __cur);
92 __throw_exception_again;
96 template<typename _RandomAccessIter, typename _Size, typename _ForwardIter>
97 inline pair<_RandomAccessIter, _ForwardIter>
98 __uninitialized_copy_n(_RandomAccessIter __first, _Size __count,
99 _ForwardIter __result,
100 std::random_access_iterator_tag)
102 _RandomAccessIter __last = __first + __count;
103 return (pair<_RandomAccessIter, _ForwardIter>
104 (__last, std::uninitialized_copy(__first, __last, __result)));
107 template<typename _InputIter, typename _Size, typename _ForwardIter>
108 inline pair<_InputIter, _ForwardIter>
109 __uninitialized_copy_n(_InputIter __first, _Size __count,
110 _ForwardIter __result)
111 { return __uninitialized_copy_n(__first, __count, __result,
112 __iterator_category(__first)); }
115 * @brief Copies the range [first,last) into result.
116 * @param first An input iterator.
117 * @param last An input iterator.
118 * @param result An output iterator.
119 * @return result + (first - last)
120 * @ingroup SGIextensions
122 * Like copy(), but does not require an initialized output range.
124 template<typename _InputIter, typename _Size, typename _ForwardIter>
125 inline pair<_InputIter, _ForwardIter>
126 uninitialized_copy_n(_InputIter __first, _Size __count,
127 _ForwardIter __result)
128 { return __uninitialized_copy_n(__first, __count, __result,
129 __iterator_category(__first)); }
132 // An alternative version of uninitialized_copy_n that constructs
133 // and destroys objects with a user-provided allocator.
134 template<typename _InputIter, typename _Size, typename _ForwardIter,
136 pair<_InputIter, _ForwardIter>
137 __uninitialized_copy_n_a(_InputIter __first, _Size __count,
138 _ForwardIter __result,
141 _ForwardIter __cur = __result;
144 for (; __count > 0 ; --__count, ++__first, ++__cur)
145 __alloc.construct(&*__cur, *__first);
146 return pair<_InputIter, _ForwardIter>(__first, __cur);
150 std::_Destroy(__result, __cur, __alloc);
151 __throw_exception_again;
155 template<typename _InputIter, typename _Size, typename _ForwardIter,
157 inline pair<_InputIter, _ForwardIter>
158 __uninitialized_copy_n_a(_InputIter __first, _Size __count,
159 _ForwardIter __result,
162 return uninitialized_copy_n(__first, __count, __result);
166 * This class provides similar behavior and semantics of the standard
167 * functions get_temporary_buffer() and return_temporary_buffer(), but
168 * encapsulated in a type vaguely resembling a standard container.
170 * By default, a temporary_buffer<Iter> stores space for objects of
171 * whatever type the Iter iterator points to. It is constructed from a
172 * typical [first,last) range, and provides the begin(), end(), size()
173 * functions, as well as requested_size(). For non-trivial types, copies
174 * of *first will be used to initialize the storage.
176 * @c malloc is used to obtain underlying storage.
178 * Like get_temporary_buffer(), not all the requested memory may be
179 * available. Ideally, the created buffer will be large enough to hold a
180 * copy of [first,last), but if size() is less than requested_size(),
181 * then this didn't happen.
183 * @ingroup SGIextensions
185 template <class _ForwardIterator, class _Tp
186 = typename std::iterator_traits<_ForwardIterator>::value_type >
187 struct temporary_buffer : public _Temporary_buffer<_ForwardIterator, _Tp>
189 /// Requests storage large enough to hold a copy of [first,last).
190 temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)
191 : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) { }
193 /// Destroys objects and frees storage.
194 ~temporary_buffer() { }
196 } // namespace __gnu_cxx