Gecko [ c.stage.kornherr.net ]

Name	Size	Permission	Date
algorithmfwd.h	24.17 KB	-rw-r--r--	2025-12-18 20:59
align.h	3.62 KB	-rw-r--r--	2025-12-18 20:59
alloc_traits.h	29.53 KB	-rw-r--r--	2025-12-18 20:59
allocated_ptr.h	3.25 KB	-rw-r--r--	2025-12-18 20:59
allocator.h	8.66 KB	-rw-r--r--	2025-12-18 20:59
atomic_base.h	58.7 KB	-rw-r--r--	2025-12-18 20:59
atomic_futex.h	12.08 KB	-rw-r--r--	2025-12-18 20:59
atomic_lockfree_defines.h	2.3 KB	-rw-r--r--	2025-12-18 20:59
atomic_timed_wait.h	13.18 KB	-rw-r--r--	2025-12-18 20:59
atomic_wait.h	12.41 KB	-rw-r--r--	2025-12-18 20:59
basic_ios.h	15.75 KB	-rw-r--r--	2025-12-18 20:59
basic_ios.tcc	5.67 KB	-rw-r--r--	2025-12-18 20:59
basic_string.h	156.46 KB	-rw-r--r--	2025-12-18 20:59
basic_string.tcc	30.3 KB	-rw-r--r--	2025-12-18 20:59
boost_concept_check.h	29.13 KB	-rw-r--r--	2025-12-18 20:59
c++0x_warning.h	1.44 KB	-rw-r--r--	2025-12-18 20:59
char_traits.h	29.05 KB	-rw-r--r--	2025-12-18 20:59
charconv.h	3.58 KB	-rw-r--r--	2025-12-18 20:59
chrono.h	47.06 KB	-rw-r--r--	2025-12-18 20:59
chrono_io.h	76.97 KB	-rw-r--r--	2025-12-18 20:59
codecvt.h	24.9 KB	-rw-r--r--	2025-12-18 20:59
concept_check.h	3.32 KB	-rw-r--r--	2025-12-18 20:59
cow_string.h	130.97 KB	-rw-r--r--	2025-12-18 20:59
cpp_type_traits.h	14.51 KB	-rw-r--r--	2025-12-18 20:59
cxxabi_forced.h	1.77 KB	-rw-r--r--	2025-12-18 20:59
cxxabi_init_exception.h	2.17 KB	-rw-r--r--	2025-12-18 20:59
deque.tcc	41.38 KB	-rw-r--r--	2025-12-18 20:59
enable_special_members.h	12.16 KB	-rw-r--r--	2025-12-18 20:59
erase_if.h	2.09 KB	-rw-r--r--	2025-12-18 20:59
exception.h	2.41 KB	-rw-r--r--	2025-12-18 20:59
exception_defines.h	1.61 KB	-rw-r--r--	2025-12-18 20:59
exception_ptr.h	8.05 KB	-rw-r--r--	2025-12-18 20:59
forward_list.h	49.92 KB	-rw-r--r--	2025-12-18 20:59
forward_list.tcc	13.71 KB	-rw-r--r--	2025-12-18 20:59
fs_dir.h	17.26 KB	-rw-r--r--	2025-12-18 20:59
fs_fwd.h	10.66 KB	-rw-r--r--	2025-12-18 20:59
fs_ops.h	10.49 KB	-rw-r--r--	2025-12-18 20:59
fs_path.h	41.47 KB	-rw-r--r--	2025-12-18 20:59
fstream.tcc	32.64 KB	-rw-r--r--	2025-12-18 20:59
functexcept.h	4.02 KB	-rw-r--r--	2025-12-18 20:59
functional_hash.h	8.79 KB	-rw-r--r--	2025-12-18 20:59
gslice.h	5.39 KB	-rw-r--r--	2025-12-18 20:59
gslice_array.h	7.71 KB	-rw-r--r--	2025-12-18 20:59
hash_bytes.h	2.1 KB	-rw-r--r--	2025-12-18 20:59
hashtable.h	88.71 KB	-rw-r--r--	2025-12-18 20:59
hashtable_policy.h	63.92 KB	-rw-r--r--	2025-12-18 20:59
indirect_array.h	7.72 KB	-rw-r--r--	2025-12-18 20:59
invoke.h	6.08 KB	-rw-r--r--	2025-12-18 20:59
ios_base.h	31.51 KB	-rw-r--r--	2025-12-18 20:59
istream.tcc	31.79 KB	-rw-r--r--	2025-12-18 20:59
iterator_concepts.h	33.72 KB	-rw-r--r--	2025-12-18 20:59
list.tcc	17.63 KB	-rw-r--r--	2025-12-18 20:59
locale_classes.h	24.79 KB	-rw-r--r--	2025-12-18 20:59
locale_classes.tcc	10.61 KB	-rw-r--r--	2025-12-18 20:59
locale_conv.h	18.74 KB	-rw-r--r--	2025-12-18 20:59
locale_facets.h	91.72 KB	-rw-r--r--	2025-12-18 20:59
locale_facets.tcc	40.42 KB	-rw-r--r--	2025-12-18 20:59
locale_facets_nonio.h	69.1 KB	-rw-r--r--	2025-12-18 20:59
locale_facets_nonio.tcc	55.69 KB	-rw-r--r--	2025-12-18 20:59
localefwd.h	5.8 KB	-rw-r--r--	2025-12-18 20:59
mask_array.h	7.77 KB	-rw-r--r--	2025-12-18 20:59
max_size_type.h	22 KB	-rw-r--r--	2025-12-18 20:59
memory_resource.h	15.73 KB	-rw-r--r--	2025-12-18 20:59
memoryfwd.h	2.47 KB	-rw-r--r--	2025-12-18 20:59
mofunc_impl.h	7.45 KB	-rw-r--r--	2025-12-18 20:59
move.h	6.51 KB	-rw-r--r--	2025-12-18 20:59
move_only_function.h	6.12 KB	-rw-r--r--	2025-12-18 20:59
nested_exception.h	7.51 KB	-rw-r--r--	2025-12-18 20:59
new_allocator.h	7.27 KB	-rw-r--r--	2025-12-18 20:59
node_handle.h	11.08 KB	-rw-r--r--	2025-12-18 20:59
ostream.tcc	11.83 KB	-rw-r--r--	2025-12-18 20:59
ostream_insert.h	3.98 KB	-rw-r--r--	2025-12-18 20:59
parse_numbers.h	7.8 KB	-rw-r--r--	2025-12-18 20:59
postypes.h	7.33 KB	-rw-r--r--	2025-12-18 20:59
predefined_ops.h	9.94 KB	-rw-r--r--	2025-12-18 20:59
ptr_traits.h	8.29 KB	-rw-r--r--	2025-12-18 20:59
quoted_string.h	5.01 KB	-rw-r--r--	2025-12-18 20:59
random.h	178.84 KB	-rw-r--r--	2025-12-18 20:59
random.tcc	103.48 KB	-rw-r--r--	2025-12-18 20:59
range_access.h	11.67 KB	-rw-r--r--	2025-12-18 20:59
ranges_algo.h	128.65 KB	-rw-r--r--	2025-12-18 20:59
ranges_algobase.h	18.37 KB	-rw-r--r--	2025-12-18 20:59
ranges_base.h	28.82 KB	-rw-r--r--	2025-12-18 20:59
ranges_cmp.h	5.9 KB	-rw-r--r--	2025-12-18 20:59
ranges_uninitialized.h	17.71 KB	-rw-r--r--	2025-12-18 20:59
ranges_util.h	24.96 KB	-rw-r--r--	2025-12-18 20:59
refwrap.h	13.27 KB	-rw-r--r--	2025-12-18 20:59
regex.h	104.32 KB	-rw-r--r--	2025-12-18 20:59
regex.tcc	16.1 KB	-rw-r--r--	2025-12-18 20:59
regex_automaton.h	10.55 KB	-rw-r--r--	2025-12-18 20:59
regex_automaton.tcc	7.6 KB	-rw-r--r--	2025-12-18 20:59
regex_compiler.h	15.92 KB	-rw-r--r--	2025-12-18 20:59
regex_compiler.tcc	18.48 KB	-rw-r--r--	2025-12-18 20:59
regex_constants.h	14.54 KB	-rw-r--r--	2025-12-18 20:59
regex_error.h	5.35 KB	-rw-r--r--	2025-12-18 20:59
regex_executor.h	8.81 KB	-rw-r--r--	2025-12-18 20:59
regex_executor.tcc	18.49 KB	-rw-r--r--	2025-12-18 20:59
regex_scanner.h	6.88 KB	-rw-r--r--	2025-12-18 20:59
regex_scanner.tcc	14.59 KB	-rw-r--r--	2025-12-18 20:59
requires_hosted.h	1.36 KB	-rw-r--r--	2025-12-18 20:59
semaphore_base.h	7.7 KB	-rw-r--r--	2025-12-18 20:59
shared_ptr.h	38.14 KB	-rw-r--r--	2025-12-18 20:59
shared_ptr_atomic.h	22.79 KB	-rw-r--r--	2025-12-18 20:59
shared_ptr_base.h	65.18 KB	-rw-r--r--	2025-12-18 20:59
slice_array.h	9.39 KB	-rw-r--r--	2025-12-18 20:59
specfun.h	46.07 KB	-rw-r--r--	2025-12-18 20:59
sstream.tcc	9.91 KB	-rw-r--r--	2025-12-18 20:59
std_abs.h	4.63 KB	-rw-r--r--	2025-12-18 20:59
std_function.h	23.12 KB	-rw-r--r--	2025-12-18 20:59
std_mutex.h	6.69 KB	-rw-r--r--	2025-12-18 20:59
std_thread.h	9.84 KB	-rw-r--r--	2025-12-18 20:59
stl_algo.h	212.39 KB	-rw-r--r--	2025-12-18 20:59
stl_algobase.h	74.97 KB	-rw-r--r--	2025-12-18 20:59
stl_bvector.h	41.58 KB	-rw-r--r--	2025-12-18 20:59
stl_construct.h	8.47 KB	-rw-r--r--	2025-12-18 20:59
stl_deque.h	76.34 KB	-rw-r--r--	2025-12-18 20:59
stl_function.h	43.97 KB	-rw-r--r--	2025-12-18 20:59
stl_heap.h	20.31 KB	-rw-r--r--	2025-12-18 20:59
stl_iterator.h	92.81 KB	-rw-r--r--	2025-12-18 20:59
stl_iterator_base_funcs.h	8.75 KB	-rw-r--r--	2025-12-18 20:59
stl_iterator_base_types.h	9.48 KB	-rw-r--r--	2025-12-18 20:59
stl_list.h	70.62 KB	-rw-r--r--	2025-12-18 20:59
stl_map.h	54.86 KB	-rw-r--r--	2025-12-18 20:59
stl_multimap.h	42.71 KB	-rw-r--r--	2025-12-18 20:59
stl_multiset.h	36.87 KB	-rw-r--r--	2025-12-18 20:59
stl_numeric.h	14.25 KB	-rw-r--r--	2025-12-18 20:59
stl_pair.h	36.43 KB	-rw-r--r--	2025-12-18 20:59
stl_queue.h	28.06 KB	-rw-r--r--	2025-12-18 20:59
stl_raw_storage_iter.h	3.91 KB	-rw-r--r--	2025-12-18 20:59
stl_relops.h	4.47 KB	-rw-r--r--	2025-12-18 20:59
stl_set.h	37.13 KB	-rw-r--r--	2025-12-18 20:59
stl_stack.h	13.71 KB	-rw-r--r--	2025-12-18 20:59
stl_tempbuf.h	8.67 KB	-rw-r--r--	2025-12-18 20:59
stl_tree.h	72.06 KB	-rw-r--r--	2025-12-18 20:59
stl_uninitialized.h	35.63 KB	-rw-r--r--	2025-12-18 20:59
stl_vector.h	68.88 KB	-rw-r--r--	2025-12-18 20:59
stream_iterator.h	8.2 KB	-rw-r--r--	2025-12-18 20:59
streambuf.tcc	4.58 KB	-rw-r--r--	2025-12-18 20:59
streambuf_iterator.h	15.57 KB	-rw-r--r--	2025-12-18 20:59
string_view.tcc	7 KB	-rw-r--r--	2025-12-18 20:59
stringfwd.h	2.56 KB	-rw-r--r--	2025-12-18 20:59
this_thread_sleep.h	3.21 KB	-rw-r--r--	2025-12-18 20:59
uniform_int_dist.h	13 KB	-rw-r--r--	2025-12-18 20:59
unique_lock.h	6.16 KB	-rw-r--r--	2025-12-18 20:59
unique_ptr.h	35.62 KB	-rw-r--r--	2025-12-18 20:59
unordered_map.h	75.11 KB	-rw-r--r--	2025-12-18 20:59
unordered_set.h	61.7 KB	-rw-r--r--	2025-12-18 20:59
uses_allocator.h	6.91 KB	-rw-r--r--	2025-12-18 20:59
uses_allocator_args.h	8.53 KB	-rw-r--r--	2025-12-18 20:59
utility.h	8.12 KB	-rw-r--r--	2025-12-18 20:59
valarray_after.h	22.74 KB	-rw-r--r--	2025-12-18 20:59
valarray_array.h	20.8 KB	-rw-r--r--	2025-12-18 20:59
valarray_array.tcc	7.08 KB	-rw-r--r--	2025-12-18 20:59
valarray_before.h	18.69 KB	-rw-r--r--	2025-12-18 20:59
vector.tcc	31.5 KB	-rw-r--r--	2025-12-18 20:59

Rename

// Functions used by iterators -*- C++ -*-

// Copyright (C) 2001-2023 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 * Copyright (c) 1996-1998
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 */

/** @file bits/stl_iterator_base_funcs.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{iterator}
 *
 *  This file contains all of the general iterator-related utility
 *  functions, such as distance() and advance().
 */

#ifndef _STL_ITERATOR_BASE_FUNCS_H
#define _STL_ITERATOR_BASE_FUNCS_H 1

#pragma GCC system_header

#include <bits/concept_check.h>
#include <debug/assertions.h>
#include <bits/stl_iterator_base_types.h>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
  // Forward declaration for the overloads of __distance.
  template <typename> struct _List_iterator;
  template <typename> struct _List_const_iterator;
_GLIBCXX_END_NAMESPACE_CONTAINER

template<typename _InputIterator>
    inline _GLIBCXX14_CONSTEXPR
    typename iterator_traits<_InputIterator>::difference_type
    __distance(_InputIterator __first, _InputIterator __last,
               input_iterator_tag)
    {
      // concept requirements
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)

typename iterator_traits<_InputIterator>::difference_type __n = 0;
      while (__first != __last)
	{
	  ++__first;
	  ++__n;
	}
      return __n;
    }

template<typename _RandomAccessIterator>
    __attribute__((__always_inline__))
    inline _GLIBCXX14_CONSTEXPR
    typename iterator_traits<_RandomAccessIterator>::difference_type
    __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
               random_access_iterator_tag)
    {
      // concept requirements
      __glibcxx_function_requires(_RandomAccessIteratorConcept<
				  _RandomAccessIterator>)
      return __last - __first;
    }

#if _GLIBCXX_USE_CXX11_ABI
  // Forward declaration because of the qualified call in distance.
  template<typename _Tp>
    ptrdiff_t
    __distance(_GLIBCXX_STD_C::_List_iterator<_Tp>,
	       _GLIBCXX_STD_C::_List_iterator<_Tp>,
	       input_iterator_tag);

template<typename _Tp>
    ptrdiff_t
    __distance(_GLIBCXX_STD_C::_List_const_iterator<_Tp>,
	       _GLIBCXX_STD_C::_List_const_iterator<_Tp>,
	       input_iterator_tag);
#endif

#if __cplusplus >= 201103L
  // Give better error if std::distance called with a non-Cpp17InputIterator.
  template<typename _OutputIterator>
    void
    __distance(_OutputIterator, _OutputIterator, output_iterator_tag) = delete;
#endif

/**
   *  @brief A generalization of pointer arithmetic.
   *  @param  __first  An input iterator.
   *  @param  __last  An input iterator.
   *  @return  The distance between them.
   *
   *  Returns @c n such that __first + n == __last.  This requires
   *  that @p __last must be reachable from @p __first.  Note that @c
   *  n may be negative.
   *
   *  For random access iterators, this uses their @c + and @c - operations
   *  and are constant time.  For other %iterator classes they are linear time.
  */
  template<typename _InputIterator>
    _GLIBCXX_NODISCARD __attribute__((__always_inline__))
    inline _GLIBCXX17_CONSTEXPR
    typename iterator_traits<_InputIterator>::difference_type
    distance(_InputIterator __first, _InputIterator __last)
    {
      // concept requirements -- taken care of in __distance
      return std::__distance(__first, __last,
			     std::__iterator_category(__first));
    }

template<typename _InputIterator, typename _Distance>
    inline _GLIBCXX14_CONSTEXPR void
    __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
    {
      // concept requirements
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
      __glibcxx_assert(__n >= 0);
      while (__n--)
	++__i;
    }

template<typename _BidirectionalIterator, typename _Distance>
    inline _GLIBCXX14_CONSTEXPR void
    __advance(_BidirectionalIterator& __i, _Distance __n,
	      bidirectional_iterator_tag)
    {
      // concept requirements
      __glibcxx_function_requires(_BidirectionalIteratorConcept<
				  _BidirectionalIterator>)
      if (__n > 0)
        while (__n--)
	  ++__i;
      else
        while (__n++)
	  --__i;
    }

template<typename _RandomAccessIterator, typename _Distance>
    inline _GLIBCXX14_CONSTEXPR void
    __advance(_RandomAccessIterator& __i, _Distance __n,
              random_access_iterator_tag)
    {
      // concept requirements
      __glibcxx_function_requires(_RandomAccessIteratorConcept<
				  _RandomAccessIterator>)
      if (__builtin_constant_p(__n) && __n == 1)
	++__i;
      else if (__builtin_constant_p(__n) && __n == -1)
	--__i;
      else
	__i += __n;
    }

#if __cplusplus >= 201103L
  // Give better error if std::advance called with a non-Cpp17InputIterator.
  template<typename _OutputIterator, typename _Distance>
    void
    __advance(_OutputIterator&, _Distance, output_iterator_tag) = delete;
#endif

/**
   *  @brief A generalization of pointer arithmetic.
   *  @param  __i  An input iterator.
   *  @param  __n  The @a delta by which to change @p __i.
   *  @return  Nothing.
   *
   *  This increments @p i by @p n.  For bidirectional and random access
   *  iterators, @p __n may be negative, in which case @p __i is decremented.
   *
   *  For random access iterators, this uses their @c + and @c - operations
   *  and are constant time.  For other %iterator classes they are linear time.
  */
  template<typename _InputIterator, typename _Distance>
    __attribute__((__always_inline__))
    inline _GLIBCXX17_CONSTEXPR void
    advance(_InputIterator& __i, _Distance __n)
    {
      // concept requirements -- taken care of in __advance
      typename iterator_traits<_InputIterator>::difference_type __d = __n;
      std::__advance(__i, __d, std::__iterator_category(__i));
    }

#if __cplusplus >= 201103L

template<typename _InputIterator>
    _GLIBCXX_NODISCARD [[__gnu__::__always_inline__]]
    inline _GLIBCXX17_CONSTEXPR _InputIterator
    next(_InputIterator __x, typename
	 iterator_traits<_InputIterator>::difference_type __n = 1)
    {
      // concept requirements
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
      std::advance(__x, __n);
      return __x;
    }

template<typename _BidirectionalIterator>
    _GLIBCXX_NODISCARD [[__gnu__::__always_inline__]]
    inline _GLIBCXX17_CONSTEXPR _BidirectionalIterator
    prev(_BidirectionalIterator __x, typename
	 iterator_traits<_BidirectionalIterator>::difference_type __n = 1) 
    {
      // concept requirements
      __glibcxx_function_requires(_BidirectionalIteratorConcept<
				  _BidirectionalIterator>)
      std::advance(__x, -__n);
      return __x;
    }

#endif // C++11

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _STL_ITERATOR_BASE_FUNCS_H */