File Manager

X7ROOT File Manager

Current Path: /usr/include/c++/8/bits

ðŸ“ ..
ðŸ“„ algorithmfwd.h(21.23 KB)
ðŸ“„ alloc_traits.h(19.6 KB)
ðŸ“„ allocated_ptr.h(3.22 KB)
ðŸ“„ allocator.h(7.39 KB)
ðŸ“„ atomic_base.h(23.28 KB)
ðŸ“„ atomic_futex.h(9.35 KB)
ðŸ“„ atomic_lockfree_defines.h(2.2 KB)
ðŸ“„ basic_ios.h(15.7 KB)
ðŸ“„ basic_ios.tcc(5.94 KB)
ðŸ“„ basic_string.h(237.01 KB)
ðŸ“„ basic_string.tcc(52.5 KB)
ðŸ“„ boost_concept_check.h(26.52 KB)
ðŸ“„ c++0x_warning.h(1.44 KB)
ðŸ“„ char_traits.h(20.42 KB)
ðŸ“„ codecvt.h(20.79 KB)
ðŸ“„ concept_check.h(3.34 KB)
ðŸ“„ cpp_type_traits.h(9.56 KB)
ðŸ“„ cxxabi_forced.h(1.77 KB)
ðŸ“„ cxxabi_init_exception.h(2.17 KB)
ðŸ“„ deque.tcc(33.32 KB)
ðŸ“„ enable_special_members.h(12.1 KB)
ðŸ“„ exception.h(2.23 KB)
ðŸ“„ exception_defines.h(1.61 KB)
ðŸ“„ exception_ptr.h(5.84 KB)
ðŸ“„ forward_list.h(47.77 KB)
ðŸ“„ forward_list.tcc(12.86 KB)
ðŸ“„ fs_dir.h(14.38 KB)
ðŸ“„ fs_fwd.h(10.04 KB)
ðŸ“„ fs_ops.h(9.5 KB)
ðŸ“„ fs_path.h(32.12 KB)
ðŸ“„ fstream.tcc(32.03 KB)
ðŸ“„ functexcept.h(3.18 KB)
ðŸ“„ functional_hash.h(8.04 KB)
ðŸ“„ gslice.h(5.39 KB)
ðŸ“„ gslice_array.h(7.59 KB)
ðŸ“„ hash_bytes.h(2.1 KB)
ðŸ“„ hashtable.h(72.06 KB)
ðŸ“„ hashtable_policy.h(66.38 KB)
ðŸ“„ indirect_array.h(7.68 KB)
ðŸ“„ invoke.h(3.57 KB)
ðŸ“„ ios_base.h(30.3 KB)
ðŸ“„ istream.tcc(30.36 KB)
ðŸ“„ list.tcc(15.6 KB)
ðŸ“„ locale_classes.h(24.31 KB)
ðŸ“„ locale_classes.tcc(8.18 KB)
ðŸ“„ locale_conv.h(15.72 KB)
ðŸ“„ locale_facets.h(90.16 KB)
ðŸ“„ locale_facets.tcc(38.62 KB)
ðŸ“„ locale_facets_nonio.h(67.36 KB)
ðŸ“„ locale_facets_nonio.tcc(44.22 KB)
ðŸ“„ localefwd.h(5.51 KB)
ðŸ“„ mask_array.h(7.42 KB)
ðŸ“„ memoryfwd.h(2.4 KB)
ðŸ“„ move.h(6.38 KB)
ðŸ“„ nested_exception.h(4.69 KB)
ðŸ“„ node_handle.h(8.02 KB)
ðŸ“„ ostream.tcc(12.03 KB)
ðŸ“„ ostream_insert.h(3.91 KB)
ðŸ“„ parse_numbers.h(7.76 KB)
ðŸ“„ postypes.h(8.02 KB)
ðŸ“„ predefined_ops.h(8.87 KB)
ðŸ“„ ptr_traits.h(6.47 KB)
ðŸ“„ quoted_string.h(4.93 KB)
ðŸ“„ random.h(171.14 KB)
ðŸ“„ random.tcc(103.12 KB)
ðŸ“„ range_access.h(9.79 KB)
ðŸ“„ refwrap.h(11.61 KB)
ðŸ“„ regex.h(95.12 KB)
ðŸ“„ regex.tcc(16.18 KB)
ðŸ“„ regex_automaton.h(10.47 KB)
ðŸ“„ regex_automaton.tcc(7.65 KB)
ðŸ“„ regex_compiler.h(17.63 KB)
ðŸ“„ regex_compiler.tcc(18.84 KB)
ðŸ“„ regex_constants.h(14.36 KB)
ðŸ“„ regex_error.h(4.79 KB)
ðŸ“„ regex_executor.h(7.31 KB)
ðŸ“„ regex_executor.tcc(18.4 KB)
ðŸ“„ regex_scanner.h(6.92 KB)
ðŸ“„ regex_scanner.tcc(14.66 KB)
ðŸ“„ shared_ptr.h(22.88 KB)
ðŸ“„ shared_ptr_atomic.h(9.54 KB)
ðŸ“„ shared_ptr_base.h(53.01 KB)
ðŸ“„ slice_array.h(9.13 KB)
ðŸ“„ specfun.h(45.95 KB)
ðŸ“„ sstream.tcc(9.9 KB)
ðŸ“„ std_abs.h(3.19 KB)
ðŸ“„ std_function.h(22.71 KB)
ðŸ“„ std_mutex.h(9.08 KB)
ðŸ“„ stl_algo.h(209.27 KB)
ðŸ“„ stl_algobase.h(49.31 KB)
ðŸ“„ stl_bvector.h(32.94 KB)
ðŸ“„ stl_construct.h(7.22 KB)
ðŸ“„ stl_deque.h(76.73 KB)
ðŸ“„ stl_function.h(40.77 KB)
ðŸ“„ stl_heap.h(19.73 KB)
ðŸ“„ stl_iterator.h(41.3 KB)
ðŸ“„ stl_iterator_base_funcs.h(7.99 KB)
ðŸ“„ stl_iterator_base_types.h(8.48 KB)
ðŸ“„ stl_list.h(65.97 KB)
ðŸ“„ stl_map.h(51.55 KB)
ðŸ“„ stl_multimap.h(40.58 KB)
ðŸ“„ stl_multiset.h(34.97 KB)
ðŸ“„ stl_numeric.h(13.51 KB)
ðŸ“„ stl_pair.h(18.21 KB)
ðŸ“„ stl_queue.h(23.51 KB)
ðŸ“„ stl_raw_storage_iter.h(3.74 KB)
ðŸ“„ stl_relops.h(4.49 KB)
ðŸ“„ stl_set.h(35.28 KB)
ðŸ“„ stl_stack.h(11.66 KB)
ðŸ“„ stl_tempbuf.h(8.15 KB)
ðŸ“„ stl_tree.h(73.15 KB)
ðŸ“„ stl_uninitialized.h(27.06 KB)
ðŸ“„ stl_vector.h(59.12 KB)
ðŸ“„ stream_iterator.h(6.5 KB)
ðŸ“„ streambuf.tcc(4.81 KB)
ðŸ“„ streambuf_iterator.h(13.44 KB)
ðŸ“„ string_view.tcc(6.54 KB)
ðŸ“„ stringfwd.h(2.55 KB)
ðŸ“„ uniform_int_dist.h(9.84 KB)
ðŸ“„ unique_ptr.h(25.38 KB)
ðŸ“„ unordered_map.h(73.58 KB)
ðŸ“„ unordered_set.h(57.76 KB)
ðŸ“„ uses_allocator.h(6.37 KB)
ðŸ“„ valarray_after.h(22.12 KB)
ðŸ“„ valarray_array.h(21.3 KB)
ðŸ“„ valarray_array.tcc(7.08 KB)
ðŸ“„ valarray_before.h(18.08 KB)
ðŸ“„ vector.tcc(28.95 KB)

Editing: valarray_array.tcc

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

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

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

X7ROOT File Manager

Editing: valarray_array.tcc

Upload File

Create Folder