Na}{

Path: ~//usr/include/c++/11/bits/

File Content: `valarray_array.tcc`

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

Edit Rename Chmod Delete

FILE FOLDER

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

File Content: valarray_array.tcc

File Content: `valarray_array.tcc`