FM / bits

/usr/include/c++/11/bits

Name	Size	Mode	Actions
algorithmfwd.h	24547	0644	edit dl rm
align.h	3711	0644	edit dl rm
allocated_ptr.h	3329	0644	edit dl rm
allocator.h	9737	0644	edit dl rm
alloc_traits.h	27632	0644	edit dl rm
atomic_base.h	57414	0644	edit dl rm
atomic_futex.h	12394	0644	edit dl rm
atomic_lockfree_defines.h	2353	0644	edit dl rm
atomic_timed_wait.h	13530	0644	edit dl rm
atomic_wait.h	12557	0644	edit dl rm
basic_ios.h	16080	0644	edit dl rm
basic_ios.tcc	6083	0644	edit dl rm
basic_string.h	251944	0644	edit dl rm
basic_string.tcc	54189	0644	edit dl rm
boost_concept_check.h	27182	0644	edit dl rm
c++0x_warning.h	1474	0644	edit dl rm
charconv.h	3435	0644	edit dl rm
char_traits.h	29350	0644	edit dl rm
codecvt.h	25500	0644	edit dl rm
concept_check.h	3423	0644	edit dl rm
cpp_type_traits.h	14003	0644	edit dl rm
cxxabi_forced.h	1811	0644	edit dl rm
cxxabi_init_exception.h	2220	0644	edit dl rm
deque.tcc	42361	0644	edit dl rm
enable_special_members.h	12452	0644	edit dl rm
erase_if.h	2066	0644	edit dl rm
exception.h	2504	0644	edit dl rm
exception_defines.h	1645	0644	edit dl rm
exception_ptr.h	7640	0644	edit dl rm
forward_list.h	50387	0644	edit dl rm
forward_list.tcc	14035	0644	edit dl rm
fstream.tcc	33672	0644	edit dl rm
fs_dir.h	16409	0644	edit dl rm
fs_fwd.h	10771	0644	edit dl rm
fs_ops.h	10739	0644	edit dl rm
fs_path.h	39745	0644	edit dl rm
functexcept.h	3509	0644	edit dl rm
functional_hash.h	8591	0644	edit dl rm
gslice.h	5519	0644	edit dl rm
gslice_array.h	7892	0644	edit dl rm
hashtable.h	84951	0644	edit dl rm
hashtable_policy.h	62156	0644	edit dl rm
hash_bytes.h	2146	0644	edit dl rm
indirect_array.h	7902	0644	edit dl rm
invoke.h	6059	0644	edit dl rm
ios_base.h	31934	0644	edit dl rm
istream.tcc	31595	0644	edit dl rm
iterator_concepts.h	33335	0644	edit dl rm
list.tcc	17201	0644	edit dl rm
localefwd.h	5943	0644	edit dl rm
locale_classes.h	25044	0644	edit dl rm
locale_classes.tcc	8375	0644	edit dl rm
locale_conv.h	18822	0644	edit dl rm
locale_facets.h	93655	0644	edit dl rm
locale_facets.tcc	40463	0644	edit dl rm
locale_facets_nonio.h	69704	0644	edit dl rm
locale_facets_nonio.tcc	47533	0644	edit dl rm
mask_array.h	7716	0644	edit dl rm
max_size_type.h	22715	0644	edit dl rm
memoryfwd.h	2504	0644	edit dl rm
move.h	6798	0644	edit dl rm
nested_exception.h	4887	0644	edit dl rm
node_handle.h	10920	0644	edit dl rm
ostream.tcc	12315	0644	edit dl rm
ostream_insert.h	4038	0644	edit dl rm
parse_numbers.h	7980	0644	edit dl rm
postypes.h	8465	0644	edit dl rm
predefined_ops.h	10177	0644	edit dl rm
ptr_traits.h	6708	0644	edit dl rm
quoted_string.h	5053	0644	edit dl rm
random.h	178359	0644	edit dl rm
random.tcc	105688	0644	edit dl rm
ranges_algo.h	116831	0644	edit dl rm
ranges_algobase.h	18871	0644	edit dl rm
ranges_base.h	24392	0644	edit dl rm
ranges_cmp.h	6017	0644	edit dl rm
ranges_uninitialized.h	18130	0644	edit dl rm
ranges_util.h	20591	0644	edit dl rm
range_access.h	10707	0644	edit dl rm
refwrap.h	13208	0644	edit dl rm
regex.h	103969	0644	edit dl rm
regex.tcc	16492	0644	edit dl rm
regex_automaton.h	10788	0644	edit dl rm
regex_automaton.tcc	7722	0644	edit dl rm
regex_compiler.h	16219	0644	edit dl rm
regex_compiler.tcc	19158	0644	edit dl rm
regex_constants.h	15549	0644	edit dl rm
regex_error.h	5015	0644	edit dl rm
regex_executor.h	8852	0644	edit dl rm
regex_executor.tcc	18837	0644	edit dl rm
regex_scanner.h	7047	0644	edit dl rm
regex_scanner.tcc	15249	0644	edit dl rm
semaphore_base.h	7936	0644	edit dl rm
shared_ptr.h	30981	0644	edit dl rm
shared_ptr_atomic.h	9874	0644	edit dl rm
shared_ptr_base.h	54907	0644	edit dl rm
slice_array.h	9619	0644	edit dl rm
specfun.h	47240	0644	edit dl rm
sstream.tcc	10148	0644	edit dl rm
std_abs.h	3384	0644	edit dl rm
std_function.h	22863	0644	edit dl rm
std_mutex.h	6443	0644	edit dl rm
std_thread.h	8589	0644	edit dl rm
stl_algo.h	214703	0644	edit dl rm
stl_algobase.h	76254	0644	edit dl rm
stl_bvector.h	35574	0644	edit dl rm
stl_construct.h	8800	0644	edit dl rm
stl_deque.h	76970	0644	edit dl rm
stl_function.h	43897	0644	edit dl rm
stl_heap.h	20756	0644	edit dl rm
stl_iterator.h	78851	0644	edit dl rm
stl_iterator_base_funcs.h	8178	0644	edit dl rm
stl_iterator_base_types.h	9662	0644	edit dl rm
stl_list.h	69779	0644	edit dl rm
stl_map.h	54693	0644	edit dl rm
stl_multimap.h	43534	0644	edit dl rm
stl_multiset.h	37675	0644	edit dl rm
stl_numeric.h	14601	0644	edit dl rm
stl_pair.h	20135	0644	edit dl rm
stl_queue.h	25036	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	37939	0644	edit dl rm
stl_stack.h	12684	0644	edit dl rm
stl_tempbuf.h	8655	0644	edit dl rm
stl_tree.h	73922	0644	edit dl rm
stl_uninitialized.h	34013	0644	edit dl rm
stl_vector.h	65919	0644	edit dl rm
streambuf.tcc	4929	0644	edit dl rm
streambuf_iterator.h	15532	0644	edit dl rm
stream_iterator.h	7697	0644	edit dl rm
stringfwd.h	2690	0644	edit dl rm
string_view.tcc	7167	0644	edit dl rm
this_thread_sleep.h	3307	0644	edit dl rm
uniform_int_dist.h	13052	0644	edit dl rm
unique_lock.h	6143	0644	edit dl rm
unique_ptr.h	32537	0644	edit dl rm
unordered_map.h	76669	0644	edit dl rm
unordered_set.h	62934	0644	edit dl rm
uses_allocator.h	6906	0644	edit dl rm
uses_allocator_args.h	7562	0644	edit dl rm
valarray_after.h	23283	0644	edit dl rm
valarray_array.h	21295	0644	edit dl rm
valarray_array.tcc	7254	0644	edit dl rm
valarray_before.h	19142	0644	edit dl rm
vector.tcc	30985	0644	edit dl rm

Edit: /usr/include/c++/11/bits/valarray_array.tcc (7254B)

// The template and inlines for the -*- C++ -*- internal _Array helper class.

// Copyright (C) 1997-2021 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/>.

/** @file bits/valarray_array.tcc
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{valarray}
 */

// Written by Gabriel Dos Reis <Gabriel.Dos-Reis@DPTMaths.ENS-Cachan.Fr>

#ifndef _VALARRAY_ARRAY_TCC
#define _VALARRAY_ARRAY_TCC 1

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

template<typename _Tp>
    void
    __valarray_fill(_Array<_Tp> __a, size_t __n, _Array<bool> __m,
		    const _Tp& __t)
    {
      _Tp* __p = __a._M_data;
      bool* __ok (__m._M_data);
      for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p)
	{
	  while (!*__ok)
	  {
	    ++__ok;
	    ++__p;
	  }
	  *__p = __t;
	}
    }

// Copy n elements of a into consecutive elements of b.  When m is
  // false, the corresponding element of a is skipped.  m must contain
  // at least n true elements.  a must contain at least n elements and
  // enough elements to match up with m through the nth true element
  // of m.  I.e.  if n is 10, m has 15 elements with 5 false followed
  // by 10 true, a must have 15 elements.
  template<typename _Tp>
    void
    __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b,
		    size_t __n)
    {
      _Tp* __p (__a._M_data);
      bool* __ok (__m._M_data);
      for (_Tp* __q = __b._M_data; __q < __b._M_data + __n;
	   ++__q, ++__ok, ++__p)
	{
	  while (! *__ok)
	    {
	      ++__ok;
	      ++__p;
	    }
	  *__q = *__p;
	}
    }

// Copy n consecutive elements from a into elements of b.  Elements
  // of b are skipped if the corresponding element of m is false.  m
  // must contain at least n true elements.  b must have at least as
  // many elements as the index of the nth true element of m.  I.e. if
  // m has 15 elements with 5 false followed by 10 true, b must have
  // at least 15 elements.
  template<typename _Tp>
    void
    __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,
		    _Array<bool> __m)
    {
      _Tp* __q (__b._M_data);
      bool* __ok (__m._M_data);
      for (_Tp* __p = __a._M_data; __p < __a._M_data+__n;
	   ++__p, ++__ok, ++__q)
	{
	  while (! *__ok)
	    {
	      ++__ok;
	      ++__q;
	    }
	  *__q = *__p;
	}
    }

// Copy n elements from a into elements of b.  Elements of a are
  // skipped if the corresponding element of m is false.  Elements of
  // b are skipped if the corresponding element of k is false.  m and
  // k must contain at least n true elements.  a and b must have at
  // least as many elements as the index of the nth true element of m.
  template<typename _Tp>
    void
    __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, size_t __n,
		    _Array<_Tp> __b, _Array<bool> __k)
    {
      _Tp* __p (__a._M_data);
      _Tp* __q (__b._M_data);
      bool* __srcok (__m._M_data);
      bool* __dstok (__k._M_data);
      for (size_t __i = 0; __i < __n;
	   ++__srcok, ++__p, ++__dstok, ++__q, ++__i)
	{
	  while (! *__srcok)
	    {
	      ++__srcok;
	      ++__p;
	    }
	  while (! *__dstok) 
	    {
	      ++__dstok;
	      ++__q;
	    }
	  *__q = *__p;
	}
    }

// Copy n consecutive elements of e into consecutive elements of a.
  // I.e. a[i] = e[i].
  template<typename _Tp, class _Dom>
    void
    __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a)
    {
      _Tp* __p (__a._M_data);
      for (size_t __i = 0; __i < __n; ++__i, ++__p)
	*__p = __e[__i];
    }

// Copy n consecutive elements of e into elements of a using stride
  // s.  I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2].
  template<typename _Tp, class _Dom>
    void
    __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,
		     _Array<_Tp> __a, size_t __s)
    {
      _Tp* __p (__a._M_data);
      for (size_t __i = 0; __i < __n; ++__i, __p += __s)
	*__p = __e[__i];
    }

// Copy n consecutive elements of e into elements of a indexed by
  // contents of i.  I.e., a[i[0]] = e[0].
  template<typename _Tp, class _Dom>
    void
    __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,
		    _Array<_Tp> __a, _Array<size_t> __i)
    {
      size_t* __j (__i._M_data);
      for (size_t __k = 0; __k < __n; ++__k, ++__j)
	__a._M_data[*__j] = __e[__k];
    }

// Copy n elements of e indexed by contents of f into elements of a
  // indexed by contents of i.  I.e., a[i[0]] = e[f[0]].
  template<typename _Tp>
    void
    __valarray_copy(_Array<_Tp> __e, _Array<size_t> __f,
		    size_t __n, 
		    _Array<_Tp> __a, _Array<size_t> __i)
    {
      size_t* __g (__f._M_data);
      size_t* __j (__i._M_data);
      for (size_t __k = 0; __k < __n; ++__k, ++__j, ++__g) 
	__a._M_data[*__j] = __e._M_data[*__g];
    }

// Copy n consecutive elements of e into elements of a.  Elements of
  // a are skipped if the corresponding element of m is false.  m must
  // have at least n true elements and a must have at least as many
  // elements as the index of the nth true element of m.  I.e. if m
  // has 5 false followed by 10 true elements and n == 10, a must have
  // at least 15 elements.
  template<typename _Tp, class _Dom>
    void
    __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n,
		    _Array<_Tp> __a, _Array<bool> __m)
    {
      bool* __ok (__m._M_data);
      _Tp* __p (__a._M_data);
      for (size_t __i = 0; __i < __n; ++__i, ++__ok, ++__p)
	{
	  while (! *__ok)
	    {
	      ++__ok;
	      ++__p;
	    }
	  *__p = __e[__i];
	}
    }

template<typename _Tp, class _Dom>
    void
    __valarray_copy_construct(const _Expr<_Dom, _Tp>& __e, size_t __n,
			      _Array<_Tp> __a)
    {
      _Tp* __p (__a._M_data);
      for (size_t __i = 0; __i < __n; ++__i, ++__p)
	new (__p) _Tp(__e[__i]);
    }

template<typename _Tp>
    void
    __valarray_copy_construct(_Array<_Tp> __a, _Array<bool> __m,
			      _Array<_Tp> __b, size_t __n)
    {
      _Tp* __p (__a._M_data);
      bool* __ok (__m._M_data);
      for (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p)
	{
	  while (! *__ok)
	    {
	      ++__ok;
	      ++__p;
	    }
	  new (__q) _Tp(*__p);
	}
    }

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _VALARRAY_ARRAY_TCC */

cmd: