libstdc++
span
Go to the documentation of this file.
1// Components for manipulating non-owning sequences of objects -*- C++ -*-
2
3// Copyright (C) 2019-2025 Free Software Foundation, Inc.
4//
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 3, or (at your option)
9// any later version.
10
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.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/** @file span
26 * This is a Standard C++ Library header.
27 */
28
29//
30// P0122 span library
31// Contributed by ThePhD
32//
33
34#ifndef _GLIBCXX_SPAN
35#define _GLIBCXX_SPAN 1
36
37#ifdef _GLIBCXX_SYSHDR
38#pragma GCC system_header
39#endif
40
41#define __glibcxx_want_span
42#define __glibcxx_want_span_initializer_list
43#include <bits/version.h>
44
45#ifdef __cpp_lib_span // C++ >= 20 && concepts
46#include <array>
47#include <cstddef>
48#include <bits/stl_iterator.h>
49#include <bits/ranges_base.h>
50#ifdef __cpp_lib_span_initializer_list
51# include <initializer_list>
52#endif
53namespace std _GLIBCXX_VISIBILITY(default)
54{
55_GLIBCXX_BEGIN_NAMESPACE_VERSION
56
57 inline constexpr size_t dynamic_extent = static_cast<size_t>(-1);
58
59 template<typename _Type, size_t _Extent>
60 class span;
61
62 namespace __detail
63 {
64 template<typename _Tp>
65 inline constexpr bool __is_span = false;
66
67 template<typename _Tp, size_t _Num>
68 inline constexpr bool __is_span<span<_Tp, _Num>> = true;
69
70 template<typename _Tp>
71 inline constexpr bool __is_std_array = false;
72
73 template<typename _Tp, size_t _Num>
74 inline constexpr bool __is_std_array<std::array<_Tp, _Num>> = true;
75
76 template<size_t _Extent>
77 class __extent_storage
78 {
79 public:
80 // Used for runtime sizes that must satisfy the precondition.
81 constexpr
82 __extent_storage([[maybe_unused]] size_t __n) noexcept
83 { __glibcxx_assert(__n == _Extent); }
84
85 // Used for constant sizes that are already known to be correct.
86 consteval
87 __extent_storage(integral_constant<size_t, _Extent>) noexcept
88 { }
89
90 // "I've made a huge mistake" - George Oscar Bluth II
91 template<size_t _Gob>
92 __extent_storage(integral_constant<size_t, _Gob>) = delete;
93
94 [[__gnu__::__always_inline__]]
95 static constexpr size_t
96 _M_extent() noexcept
97 { return _Extent; }
98 };
99
100 template<>
101 class __extent_storage<dynamic_extent>
102 {
103 public:
104 [[__gnu__::__always_inline__]]
105 constexpr
106 __extent_storage(size_t __extent) noexcept
107 : _M_extent_value(__extent)
108 { }
109
110 [[__gnu__::__always_inline__]]
111 constexpr size_t
112 _M_extent() const noexcept
113 { return this->_M_extent_value; }
114
115 private:
116 size_t _M_extent_value;
117 };
118
119 template<typename _Type> struct __span_ptr { _Type* const _M_ptr; };
120
121 } // namespace __detail
122
123 template<typename _Type, size_t _Extent = dynamic_extent>
124 class span
125 {
126 template<size_t _Offset, size_t _Count>
127 static constexpr size_t
128 _S_subspan_extent()
129 {
130 if constexpr (_Count != dynamic_extent)
131 return _Count;
132 else if constexpr (extent != dynamic_extent)
133 return _Extent - _Offset;
134 else
135 return dynamic_extent;
136 }
137
138 // _GLIBCXX_RESOLVE_LIB_DEFECTS
139 // 3255. span's array constructor is too strict
140 template<typename _Tp, size_t _ArrayExtent>
141 requires (_Extent == dynamic_extent || _ArrayExtent == _Extent)
142 using __is_compatible_array = __is_array_convertible<_Type, _Tp>;
143
144 template<typename _Ref>
145 using __is_compatible_ref
146 = __is_array_convertible<_Type, remove_reference_t<_Ref>>;
147
148 // Nested type so that _Type is not an associated class of iterator.
149 struct __iter_tag;
150
151 template<size_t _Nm>
152 static inline constexpr integral_constant<size_t, _Nm> __v{};
153
154 public:
155 // member types
156 using element_type = _Type;
157 using value_type = remove_cv_t<_Type>;
158 using size_type = size_t;
159 using difference_type = ptrdiff_t;
160 using pointer = _Type*;
161 using const_pointer = const _Type*;
162 using reference = element_type&;
163 using const_reference = const element_type&;
164 using iterator = __gnu_cxx::__normal_iterator<pointer, __iter_tag>;
165 using reverse_iterator = std::reverse_iterator<iterator>;
166#if __cplusplus > 202002L
167 using const_iterator = std::const_iterator<iterator>;
168 using const_reverse_iterator = std::const_iterator<reverse_iterator>;
169#endif
170
171 // member constants
172 static constexpr size_t extent = _Extent;
173
174 // constructors, copy and assignment
175
176 constexpr
177 span() noexcept
178 requires (_Extent == dynamic_extent || _Extent == 0)
179 : _M_ptr(nullptr), _M_extent(__v<0>)
180 { }
181
182 template<contiguous_iterator _It>
183 requires __is_compatible_ref<iter_reference_t<_It>>::value
184 constexpr explicit(extent != dynamic_extent)
185 span(_It __first, size_type __count)
186 noexcept
187 : _M_ptr(std::to_address(__first)), _M_extent(__count)
188 { __glibcxx_requires_valid_range(__first, __first + __count); }
189
190 template<contiguous_iterator _It, sized_sentinel_for<_It> _End>
191 requires __is_compatible_ref<iter_reference_t<_It>>::value
192 && (!is_convertible_v<_End, size_type>)
193 constexpr explicit(extent != dynamic_extent)
194 span(_It __first, _End __last)
195 noexcept(noexcept(__last - __first))
196 : _M_ptr(std::to_address(__first)),
197 _M_extent(static_cast<size_type>(__last - __first))
198 { __glibcxx_requires_valid_range(__first, __last); }
199
200 template<size_t _ArrayExtent>
201 requires (_Extent == dynamic_extent || _ArrayExtent == _Extent)
202 constexpr
203 span(type_identity_t<element_type> (&__arr)[_ArrayExtent]) noexcept
204 : _M_ptr(__arr), _M_extent(__v<_ArrayExtent>)
205 { }
206
207 template<typename _Tp, size_t _ArrayExtent>
208 requires __is_compatible_array<_Tp, _ArrayExtent>::value
209 constexpr
210 span(array<_Tp, _ArrayExtent>& __arr) noexcept
211 : _M_ptr(__arr.data()), _M_extent(__v<_ArrayExtent>)
212 { }
213
214 template<typename _Tp, size_t _ArrayExtent>
215 requires __is_compatible_array<const _Tp, _ArrayExtent>::value
216 constexpr
217 span(const array<_Tp, _ArrayExtent>& __arr) noexcept
218 : _M_ptr(__arr.data()), _M_extent(__v<_ArrayExtent>)
219 { }
220
221 template<typename _Range>
222 requires (!__detail::__is_span<remove_cvref_t<_Range>>)
223 && (!__detail::__is_std_array<remove_cvref_t<_Range>>)
224 && (!is_array_v<remove_cvref_t<_Range>>)
225 && ranges::contiguous_range<_Range> && ranges::sized_range<_Range>
226 && (ranges::borrowed_range<_Range> || is_const_v<element_type>)
227 && __is_compatible_ref<ranges::range_reference_t<_Range>>::value
228 constexpr explicit(extent != dynamic_extent)
229 span(_Range&& __range)
230 noexcept(noexcept(ranges::data(__range))
231 && noexcept(ranges::size(__range)))
232 : _M_ptr(ranges::data(__range)), _M_extent(ranges::size(__range))
233 { }
234
235#if __cpp_lib_span_initializer_list >= 202311L // >= C++26
236#pragma GCC diagnostic push
237#pragma GCC diagnostic ignored "-Winit-list-lifetime"
238 constexpr
239 explicit(extent != dynamic_extent)
240 span(initializer_list<value_type> __il)
241 requires (is_const_v<_Type>)
242 : _M_ptr(__il.begin()), _M_extent(__il.size())
243 { }
244#pragma GCC diagnostic pop
245#endif
246
247 constexpr
248 span(const span&) noexcept = default;
249
250 template<typename _OType, size_t _OExtent>
251 requires (_Extent == dynamic_extent || _OExtent == dynamic_extent
252 || _Extent == _OExtent)
253 && (__is_array_convertible<_Type, _OType>::value)
254 constexpr
255 explicit(extent != dynamic_extent && _OExtent == dynamic_extent)
256 span(const span<_OType, _OExtent>& __s) noexcept
257 : _M_ptr(__s.data()), _M_extent(__s.size())
258 { }
259
260 ~span() noexcept = default;
261
262 constexpr span&
263 operator=(const span&) noexcept = default;
264
265 // observers
266
267 [[nodiscard]]
268 constexpr size_type
269 size() const noexcept
270 { return this->_M_extent._M_extent(); }
271
272 [[nodiscard]]
273 constexpr size_type
274 size_bytes() const noexcept
275 { return this->_M_extent._M_extent() * sizeof(element_type); }
276
277 [[nodiscard]]
278 constexpr bool
279 empty() const noexcept
280 { return size() == 0; }
281
282 // element access
283
284 [[nodiscard]]
285 constexpr reference
286 front() const noexcept
287 {
288 __glibcxx_assert(!empty());
289 return *this->_M_ptr;
290 }
291
292 [[nodiscard]]
293 constexpr reference
294 back() const noexcept
295 {
296 __glibcxx_assert(!empty());
297 return *(this->_M_ptr + (size() - 1));
298 }
299
300 [[nodiscard]]
301 constexpr reference
302 operator[](size_type __idx) const noexcept
303 {
304 __glibcxx_assert(__idx < size());
305 return *(this->_M_ptr + __idx);
306 }
307
308#if __cpp_lib_span >= 202311L // >= C++26
309 [[nodiscard]]
310 constexpr reference
311 at(size_type __idx) const
312 {
313 if (__idx >= size())
314 __throw_out_of_range_fmt(__N("span::at(%zu) out-of-range for span "
315 "of size %zu"), __idx, this->size());
316 return *(this->_M_ptr + __idx);
317 }
318#endif
319
320 [[nodiscard]]
321 constexpr pointer
322 data() const noexcept
323 { return this->_M_ptr; }
324
325 // iterator support
326
327 [[nodiscard]]
328 constexpr iterator
329 begin() const noexcept
330 { return iterator(this->_M_ptr); }
331
332 [[nodiscard]]
333 constexpr iterator
334 end() const noexcept
335 { return iterator(this->_M_ptr + this->size()); }
336
337 [[nodiscard]]
338 constexpr reverse_iterator
339 rbegin() const noexcept
340 { return reverse_iterator(this->end()); }
341
342 [[nodiscard]]
343 constexpr reverse_iterator
344 rend() const noexcept
345 { return reverse_iterator(this->begin()); }
346
347#if __cplusplus > 202002L
348 [[nodiscard]]
349 constexpr const_iterator
350 cbegin() const noexcept
351 { return begin(); }
352
353 [[nodiscard]]
354 constexpr const_iterator
355 cend() const noexcept
356 { return end(); }
357
358 [[nodiscard]]
359 constexpr const_reverse_iterator
360 crbegin() const noexcept
361 { return rbegin(); }
362
363 [[nodiscard]]
364 constexpr const_reverse_iterator
365 crend() const noexcept
366 { return rend(); }
367#endif
368
369 // subviews
370
371 template<size_t _Count>
372 [[nodiscard]]
373 constexpr span<element_type, _Count>
374 first() const noexcept
375 {
376 if constexpr (_Extent == dynamic_extent)
377 __glibcxx_assert(_Count <= size());
378 else
379 static_assert(_Count <= extent);
380 using _Sp = span<element_type, _Count>;
381 return _Sp{ _SizedPtr{this->data()} };
382 }
383
384 [[nodiscard]]
385 constexpr span<element_type, dynamic_extent>
386 first(size_type __count) const noexcept
387 {
388 __glibcxx_assert(__count <= size());
389 return { this->data(), __count };
390 }
391
392 template<size_t _Count>
393 [[nodiscard]]
394 constexpr span<element_type, _Count>
395 last() const noexcept
396 {
397 if constexpr (_Extent == dynamic_extent)
398 __glibcxx_assert(_Count <= size());
399 else
400 static_assert(_Count <= extent);
401 using _Sp = span<element_type, _Count>;
402 return _Sp{ _SizedPtr{this->data() + (this->size() - _Count)} };
403 }
404
405 [[nodiscard]]
406 constexpr span<element_type, dynamic_extent>
407 last(size_type __count) const noexcept
408 {
409 __glibcxx_assert(__count <= size());
410 return { this->data() + (this->size() - __count), __count };
411 }
412
413 template<size_t _Offset, size_t _Count = dynamic_extent>
414 [[nodiscard]]
415 constexpr auto
416 subspan() const noexcept
417 -> span<element_type, _S_subspan_extent<_Offset, _Count>()>
418 {
419 if constexpr (_Extent == dynamic_extent)
420 {
421 __glibcxx_assert(_Offset <= size());
422 }
423 else
424 static_assert(_Offset <= extent);
425
426 using _Sp = span<element_type, _S_subspan_extent<_Offset, _Count>()>;
427
428 if constexpr (_Count == dynamic_extent)
429 return _Sp{ this->data() + _Offset, this->size() - _Offset };
430 else
431 {
432 if constexpr (_Extent == dynamic_extent)
433 {
434 __glibcxx_assert(_Count <= size());
435 __glibcxx_assert(_Count <= (size() - _Offset));
436 }
437 else
438 {
439 static_assert(_Count <= extent);
440 static_assert(_Count <= (extent - _Offset));
441 }
442 return _Sp{ _SizedPtr{this->data() + _Offset} };
443 }
444 }
445
446 [[nodiscard]]
447 constexpr span<element_type, dynamic_extent>
448 subspan(size_type __offset, size_type __count = dynamic_extent) const
449 noexcept
450 {
451 __glibcxx_assert(__offset <= size());
452 if (__count == dynamic_extent)
453 __count = this->size() - __offset;
454 else
455 {
456 __glibcxx_assert(__count <= size());
457 __glibcxx_assert(__offset + __count <= size());
458 }
459 return {this->data() + __offset, __count};
460 }
461
462 private:
463 template<typename, size_t> friend class span;
464
465 // Tag type for pointer that has known extent.
466 using _SizedPtr = __detail::__span_ptr<_Type>;
467
468 // Private constructor with an implied extent.
469 [[__gnu__::__always_inline__]]
470 constexpr explicit
471 span(_SizedPtr __ptr) noexcept
472 requires (extent != dynamic_extent)
473 : _M_ptr(__ptr._M_ptr), _M_extent(__v<extent>)
474 { }
475
476 pointer _M_ptr;
477 [[no_unique_address]] __detail::__extent_storage<extent> _M_extent;
478 };
479
480 // deduction guides
481
482 template<typename _Type, size_t _ArrayExtent>
483 span(_Type(&)[_ArrayExtent]) -> span<_Type, _ArrayExtent>;
484
485 template<typename _Type, size_t _ArrayExtent>
486 span(array<_Type, _ArrayExtent>&) -> span<_Type, _ArrayExtent>;
487
488 template<typename _Type, size_t _ArrayExtent>
489 span(const array<_Type, _ArrayExtent>&)
490 -> span<const _Type, _ArrayExtent>;
491
492 template<contiguous_iterator _Iter, typename _End>
493 span(_Iter, _End)
494 -> span<remove_reference_t<iter_reference_t<_Iter>>>;
495
496 template<ranges::contiguous_range _Range>
497 span(_Range &&)
498 -> span<remove_reference_t<ranges::range_reference_t<_Range&>>>;
499
500 template<typename _Type, size_t _Extent>
501 [[nodiscard]]
502 inline
503 span<const byte, _Extent == dynamic_extent
504 ? dynamic_extent : _Extent * sizeof(_Type)>
505 as_bytes(span<_Type, _Extent> __sp) noexcept
506 {
507 auto data = reinterpret_cast<const byte*>(__sp.data());
508 auto size = __sp.size_bytes();
509 constexpr auto extent = _Extent == dynamic_extent
510 ? dynamic_extent : _Extent * sizeof(_Type);
511 return span<const byte, extent>{data, size};
512 }
513
514 template<typename _Type, size_t _Extent>
515 requires (!is_const_v<_Type>)
516 inline
517 span<byte, _Extent == dynamic_extent
518 ? dynamic_extent : _Extent * sizeof(_Type)>
519 as_writable_bytes [[nodiscard]] (span<_Type, _Extent> __sp) noexcept
520 {
521 auto data = reinterpret_cast<byte*>(__sp.data());
522 auto size = __sp.size_bytes();
523 constexpr auto extent = _Extent == dynamic_extent
524 ? dynamic_extent : _Extent * sizeof(_Type);
525 return span<byte, extent>{data, size};
526 }
527
528 namespace ranges
529 {
530 // Opt-in to borrowed_range concept
531 template<typename _ElementType, size_t _Extent>
532 inline constexpr bool
533 enable_borrowed_range<span<_ElementType, _Extent>> = true;
534
535 // Opt-in to view concept
536 template<typename _ElementType, size_t _Extent>
537 inline constexpr bool
538 enable_view<span<_ElementType, _Extent>> = true;
539 }
540_GLIBCXX_END_NAMESPACE_VERSION
541} // namespace std
542#endif // __cpp_lib_span
543#endif // _GLIBCXX_SPAN
constexpr _Tp * to_address(_Tp *__ptr) noexcept
Obtain address referenced by a pointer to an object.
Definition ptr_traits.h:232
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
Definition valarray:1251
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
Definition valarray:1229
ISO C++ entities toplevel namespace is std.
constexpr auto rbegin(_Container &__cont) noexcept(noexcept(__cont.rbegin())) -> decltype(__cont.rbegin())
Return a reverse iterator pointing to the last element of the container.
constexpr auto cend(const _Container &__cont) noexcept(noexcept(std::end(__cont))) -> decltype(std::end(__cont))
Return an iterator pointing to one past the last element of the const container.
constexpr auto empty(const _Container &__cont) noexcept(noexcept(__cont.empty())) -> decltype(__cont.empty())
Return whether a container is empty.
constexpr auto crbegin(const _Container &__cont) noexcept(noexcept(std::rbegin(__cont))) -> decltype(std::rbegin(__cont))
Return a reverse iterator pointing to the last element of the const container.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
constexpr auto data(_Container &__cont) noexcept(noexcept(__cont.data())) -> decltype(__cont.data())
Return the data pointer of a container.
constexpr auto cbegin(const _Container &__cont) noexcept(noexcept(std::begin(__cont))) -> decltype(std::begin(__cont))
Return an iterator pointing to the first element of the const container.
constexpr auto rend(_Container &__cont) noexcept(noexcept(__cont.rend())) -> decltype(__cont.rend())
Return a reverse iterator pointing one past the first element of the container.
constexpr auto crend(const _Container &__cont) noexcept(noexcept(std::rend(__cont))) -> decltype(std::rend(__cont))
Return a reverse iterator pointing one past the first element of the const container.