FM / bits

/usr/include/c++/8/bits

Name	Size	Mode	Actions
algorithmfwd.h	21736	0644	edit dl rm
allocated_ptr.h	3293	0644	edit dl rm
allocator.h	7569	0644	edit dl rm
alloc_traits.h	20066	0644	edit dl rm
atomic_base.h	23842	0644	edit dl rm
atomic_futex.h	9576	0644	edit dl rm
atomic_lockfree_defines.h	2253	0644	edit dl rm
basic_ios.h	16074	0644	edit dl rm
basic_ios.tcc	6083	0644	edit dl rm
basic_string.h	242697	0644	edit dl rm
basic_string.tcc	53755	0644	edit dl rm
boost_concept_check.h	27161	0644	edit dl rm
c++0x_warning.h	1474	0644	edit dl rm
char_traits.h	20915	0644	edit dl rm
codecvt.h	21289	0644	edit dl rm
concept_check.h	3423	0644	edit dl rm
cpp_type_traits.h	9789	0644	edit dl rm
cxxabi_forced.h	1811	0644	edit dl rm
cxxabi_init_exception.h	2220	0644	edit dl rm
deque.tcc	34122	0644	edit dl rm
enable_special_members.h	12387	0644	edit dl rm
exception.h	2280	0644	edit dl rm
exception_defines.h	1645	0644	edit dl rm
exception_ptr.h	5981	0644	edit dl rm
forward_list.h	48919	0644	edit dl rm
forward_list.tcc	13169	0644	edit dl rm
fstream.tcc	32799	0644	edit dl rm
fs_dir.h	14724	0644	edit dl rm
fs_fwd.h	10279	0644	edit dl rm
fs_ops.h	9730	0644	edit dl rm
fs_path.h	32894	0644	edit dl rm
functexcept.h	3254	0644	edit dl rm
functional_hash.h	8238	0644	edit dl rm
gslice.h	5518	0644	edit dl rm
gslice_array.h	7769	0644	edit dl rm
hashtable.h	73785	0644	edit dl rm
hashtable_policy.h	67971	0644	edit dl rm
hash_bytes.h	2146	0644	edit dl rm
indirect_array.h	7861	0644	edit dl rm
invoke.h	3657	0644	edit dl rm
ios_base.h	31023	0644	edit dl rm
istream.tcc	31093	0644	edit dl rm
list.tcc	15976	0644	edit dl rm
localefwd.h	5646	0644	edit dl rm
locale_classes.h	24897	0644	edit dl rm
locale_classes.tcc	8375	0644	edit dl rm
locale_conv.h	16097	0644	edit dl rm
locale_facets.h	92328	0644	edit dl rm
locale_facets.tcc	39548	0644	edit dl rm
locale_facets_nonio.h	68980	0644	edit dl rm
locale_facets_nonio.tcc	45280	0644	edit dl rm
mask_array.h	7595	0644	edit dl rm
memoryfwd.h	2453	0644	edit dl rm
move.h	6529	0644	edit dl rm
nested_exception.h	4802	0644	edit dl rm
node_handle.h	8216	0644	edit dl rm
ostream.tcc	12315	0644	edit dl rm
ostream_insert.h	4002	0644	edit dl rm
parse_numbers.h	7944	0644	edit dl rm
postypes.h	8208	0644	edit dl rm
predefined_ops.h	9083	0644	edit dl rm
ptr_traits.h	6626	0644	edit dl rm
quoted_string.h	5053	0644	edit dl rm
random.h	175250	0644	edit dl rm
random.tcc	105590	0644	edit dl rm
range_access.h	10030	0644	edit dl rm
refwrap.h	11884	0644	edit dl rm
regex.h	97402	0644	edit dl rm
regex.tcc	16565	0644	edit dl rm
regex_automaton.h	10722	0644	edit dl rm
regex_automaton.tcc	7838	0644	edit dl rm
regex_compiler.h	18050	0644	edit dl rm
regex_compiler.tcc	19288	0644	edit dl rm
regex_constants.h	14708	0644	edit dl rm
regex_error.h	4904	0644	edit dl rm
regex_executor.h	7488	0644	edit dl rm
regex_executor.tcc	18841	0644	edit dl rm
regex_scanner.h	7088	0644	edit dl rm
regex_scanner.tcc	15009	0644	edit dl rm
shared_ptr.h	23433	0644	edit dl rm
shared_ptr_atomic.h	9769	0644	edit dl rm
shared_ptr_base.h	54286	0644	edit dl rm
slice_array.h	9348	0644	edit dl rm
specfun.h	47051	0644	edit dl rm
sstream.tcc	10142	0644	edit dl rm
std_abs.h	3266	0644	edit dl rm
std_function.h	23260	0644	edit dl rm
std_mutex.h	9298	0644	edit dl rm
stl_algo.h	214294	0644	edit dl rm
stl_algobase.h	50494	0644	edit dl rm
stl_bvector.h	33728	0644	edit dl rm
stl_construct.h	7397	0644	edit dl rm
stl_deque.h	78575	0644	edit dl rm
stl_function.h	41745	0644	edit dl rm
stl_heap.h	20206	0644	edit dl rm
stl_iterator.h	42291	0644	edit dl rm
stl_iterator_base_funcs.h	8178	0644	edit dl rm
stl_iterator_base_types.h	8680	0644	edit dl rm
stl_list.h	67558	0644	edit dl rm
stl_map.h	52791	0644	edit dl rm
stl_multimap.h	41557	0644	edit dl rm
stl_multiset.h	35809	0644	edit dl rm
stl_numeric.h	13832	0644	edit dl rm
stl_pair.h	18642	0644	edit dl rm
stl_queue.h	24073	0644	edit dl rm
stl_raw_storage_iter.h	3830	0644	edit dl rm
stl_relops.h	4594	0644	edit dl rm
stl_set.h	36125	0644	edit dl rm
stl_stack.h	11938	0644	edit dl rm
stl_tempbuf.h	8344	0644	edit dl rm
stl_tree.h	74904	0644	edit dl rm
stl_uninitialized.h	27709	0644	edit dl rm
stl_vector.h	60534	0644	edit dl rm
streambuf.tcc	4929	0644	edit dl rm
streambuf_iterator.h	13758	0644	edit dl rm
stream_iterator.h	6654	0644	edit dl rm
stringfwd.h	2607	0644	edit dl rm
string_view.tcc	6698	0644	edit dl rm
uniform_int_dist.h	10081	0644	edit dl rm
unique_ptr.h	25984	0644	edit dl rm
unordered_map.h	75341	0644	edit dl rm
unordered_set.h	59148	0644	edit dl rm
uses_allocator.h	6525	0644	edit dl rm
valarray_after.h	22655	0644	edit dl rm
valarray_array.h	21807	0644	edit dl rm
valarray_array.tcc	7254	0644	edit dl rm
valarray_before.h	18513	0644	edit dl rm
vector.tcc	29644	0644	edit dl rm

Edit: /usr/include/c++/8/bits/stl_iterator_base_funcs.h (8178B)

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

// Copyright (C) 2001-2018 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>

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>
    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

/**
   *  @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>
    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;
    }

/**
   *  @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>
    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>
    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>
    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 */

cmd: