PNG  IHDR* pHYs+ IDATx]n#; cdLb Ǚ[at¤_:uP}>!Usă cag޿ ֵNu`ݼTâabO7uL&y^wFٝA"l[|ŲHLN밪4*sG3|Dv}?+y߉{OuOAt4Jj.u]Gz*҉sP'VQKbA1u\`& Af;HWj hsO;ogTu uj7S3/QzUr&wS`M$X_L7r2;aE+ώ%vikDA:dR+%KzƉo>eOth$z%: :{WwaQ:wz%4foɹE[9<]#ERINƻv溂E%P1i01 |Jvҗ&{b?9g=^wζXn/lK::90KwrюO\!ջ3uzuGv^;騢wq<Iatv09:tt~hEG`v;3@MNZD.1]L:{ծI3`L(÷ba")Y.iljCɄae#I"1 `3*Bdz>j<fU40⨬%O$3cGt]j%Fߠ_twJ;ABU8vP3uEԑwQ V:h%))LfraqX-ۿX]v-\9I gl8tzX ]ecm)-cgʒ#Uw=Wlێn(0hPP/ӨtQ“&J35 $=]r1{tLuǮ*i0_;NƝ8;-vݏr8+U-kruȕYr0RnC]*ެ(M:]gE;{]tg(#ZJ9y>utRDRMdr9㪩̞zֹb<ģ&wzJM"iI( .ꮅX)Qw:9,i좜\Ԛi7&N0:asϓc];=ΗOӣ APqz93 y $)A*kVHZwBƺnWNaby>XMN*45~ղM6Nvm;A=jֲ.~1}(9`KJ/V F9[=`~[;sRuk]rєT!)iQO)Y$V ی ۤmzWz5IM Zb )ˆC`6 rRa}qNmUfDsWuˤV{ Pݝ'=Kֳbg,UҘVz2ﴻnjNgBb{? ߮tcsͻQuxVCIY۠:(V뺕 ٥2;t`@Fo{Z9`;]wMzU~%UA蛚dI vGq\r82iu +St`cR.6U/M9IENDB` REDROOM
REDROOM
PHP 5.6.40
Preview: valarray_array.h Size: 21.30 KB
/usr/include/c++/8/bits/valarray_array.h
// 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.h
 *  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_H
#define _VALARRAY_ARRAY_H 1

#pragma GCC system_header

#include <bits/c++config.h>
#include <bits/cpp_type_traits.h>
#include <cstdlib>
#include <new>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

  //
  // Helper functions on raw pointers
  //

  // We get memory by the old fashion way
  inline void*
  __valarray_get_memory(size_t __n)
  { return operator new(__n); }

  template<typename _Tp>
    inline _Tp*__restrict__
    __valarray_get_storage(size_t __n)
    {
      return static_cast<_Tp*__restrict__>
	(std::__valarray_get_memory(__n * sizeof(_Tp)));
    }

  // Return memory to the system
  inline void
  __valarray_release_memory(void* __p)
  { operator delete(__p); }

  // Turn a raw-memory into an array of _Tp filled with _Tp()
  // This is required in 'valarray<T> v(n);'
  template<typename _Tp, bool>
    struct _Array_default_ctor
    {
      // Please note that this isn't exception safe.  But
      // valarrays aren't required to be exception safe.
      inline static void
      _S_do_it(_Tp* __b, _Tp* __e)
      {
	while (__b != __e)
	  new(__b++) _Tp();
      }
    };

  template<typename _Tp>
    struct _Array_default_ctor<_Tp, true>
    {
      // For fundamental types, it suffices to say 'memset()'
      inline static void
      _S_do_it(_Tp* __b, _Tp* __e)
      { __builtin_memset(__b, 0, (__e - __b) * sizeof(_Tp)); }
    };

  template<typename _Tp>
    inline void
    __valarray_default_construct(_Tp* __b, _Tp* __e)
    {
      _Array_default_ctor<_Tp, __is_scalar<_Tp>::__value>::_S_do_it(__b, __e);
    }

  // Turn a raw-memory into an array of _Tp filled with __t
  // This is the required in valarray<T> v(n, t).  Also
  // used in valarray<>::resize().
  template<typename _Tp, bool>
    struct _Array_init_ctor
    {
      // Please note that this isn't exception safe.  But
      // valarrays aren't required to be exception safe.
      inline static void
      _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
      {
	while (__b != __e)
	  new(__b++) _Tp(__t);
      }
    };

  template<typename _Tp>
    struct _Array_init_ctor<_Tp, true>
    {
      inline static void
      _S_do_it(_Tp* __b, _Tp* __e, const _Tp __t)
      {
	while (__b != __e)
	  *__b++ = __t;
      }
    };

  template<typename _Tp>
    inline void
    __valarray_fill_construct(_Tp* __b, _Tp* __e, const _Tp __t)
    {
      _Array_init_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __t);
    }

  //
  // copy-construct raw array [__o, *) from plain array [__b, __e)
  // We can't just say 'memcpy()'
  //
  template<typename _Tp, bool>
    struct _Array_copy_ctor
    {
      // Please note that this isn't exception safe.  But
      // valarrays aren't required to be exception safe.
      inline static void
      _S_do_it(const _Tp* __b, const _Tp* __e, _Tp* __restrict__ __o)
      {
	while (__b != __e)
	  new(__o++) _Tp(*__b++);
      }
    };

  template<typename _Tp>
    struct _Array_copy_ctor<_Tp, true>
    {
      inline static void
      _S_do_it(const _Tp* __b, const _Tp* __e, _Tp* __restrict__ __o)
      {
	if (__b)
	  __builtin_memcpy(__o, __b, (__e - __b) * sizeof(_Tp));
      }
    };

  template<typename _Tp>
    inline void
    __valarray_copy_construct(const _Tp* __b, const _Tp* __e,
			      _Tp* __restrict__ __o)
    {
      _Array_copy_ctor<_Tp, __is_trivial(_Tp)>::_S_do_it(__b, __e, __o);
    }

  // copy-construct raw array [__o, *) from strided array __a[<__n : __s>]
  template<typename _Tp>
    inline void
    __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n,
			       size_t __s, _Tp* __restrict__ __o)
    {
      if (__is_trivial(_Tp))
	while (__n--)
	  {
	    *__o++ = *__a;
	    __a += __s;
	  }
      else
	while (__n--)
	  {
	    new(__o++) _Tp(*__a);
	    __a += __s;
	  }
    }

  // copy-construct raw array [__o, *) from indexed array __a[__i[<__n>]]
  template<typename _Tp>
    inline void
    __valarray_copy_construct (const _Tp* __restrict__ __a,
			       const size_t* __restrict__ __i,
			       _Tp* __restrict__ __o, size_t __n)
    {
      if (__is_trivial(_Tp))
	while (__n--)
	  *__o++ = __a[*__i++];
      else
	while (__n--)
	  new (__o++) _Tp(__a[*__i++]);
    }

  // Do the necessary cleanup when we're done with arrays.
  template<typename _Tp>
    inline void
    __valarray_destroy_elements(_Tp* __b, _Tp* __e)
    {
      if (!__is_trivial(_Tp))
	while (__b != __e)
	  {
	    __b->~_Tp();
	    ++__b;
	  }
    }

  // Fill a plain array __a[<__n>] with __t
  template<typename _Tp>
    inline void
    __valarray_fill(_Tp* __restrict__ __a, size_t __n, const _Tp& __t)
    {
      while (__n--)
	*__a++ = __t;
    }
  
  // fill strided array __a[<__n-1 : __s>] with __t
  template<typename _Tp>
    inline void
    __valarray_fill(_Tp* __restrict__ __a, size_t __n,
		    size_t __s, const _Tp& __t)
    { 
      for (size_t __i = 0; __i < __n; ++__i, __a += __s)
	*__a = __t;
    }

  // fill indirect array __a[__i[<__n>]] with __i
  template<typename _Tp>
    inline void
    __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i,
		    size_t __n, const _Tp& __t)
    {
      for (size_t __j = 0; __j < __n; ++__j, ++__i)
	__a[*__i] = __t;
    }
  
  // copy plain array __a[<__n>] in __b[<__n>]
  // For non-fundamental types, it is wrong to say 'memcpy()'
  template<typename _Tp, bool>
    struct _Array_copier
    {
      inline static void
      _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b)
      {
	while(__n--)
	  *__b++ = *__a++;
      }
    };

  template<typename _Tp>
    struct _Array_copier<_Tp, true>
    {
      inline static void
      _S_do_it(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b)
      {
	if (__n != 0)
	  __builtin_memcpy(__b, __a, __n * sizeof (_Tp));
      }
    };

  // Copy a plain array __a[<__n>] into a play array __b[<>]
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __a, size_t __n,
		    _Tp* __restrict__ __b)
    {
      _Array_copier<_Tp, __is_trivial(_Tp)>::_S_do_it(__a, __n, __b);
    }

  // Copy strided array __a[<__n : __s>] in plain __b[<__n>]
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s,
		    _Tp* __restrict__ __b)
    {
      for (size_t __i = 0; __i < __n; ++__i, ++__b, __a += __s)
	*__b = *__a;
    }

  // Copy a plain array  __a[<__n>] into a strided array __b[<__n : __s>]
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b,
		    size_t __n, size_t __s)
    {
      for (size_t __i = 0; __i < __n; ++__i, ++__a, __b += __s)
	*__b = *__a;
    }

  // Copy strided array __src[<__n : __s1>] into another
  // strided array __dst[< : __s2>].  Their sizes must match.
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __src, size_t __n, size_t __s1,
		    _Tp* __restrict__ __dst, size_t __s2)
    {
      for (size_t __i = 0; __i < __n; ++__i)
	__dst[__i * __s2] = __src[__i * __s1];
    }

  // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>]
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __a,
		    const size_t* __restrict__ __i,
		    _Tp* __restrict__ __b, size_t __n)
    {
      for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i)
	*__b = __a[*__i];
    }

  // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]]
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __a, size_t __n,
		    _Tp* __restrict__ __b, const size_t* __restrict__ __i)
    {
      for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i)
	__b[*__i] = *__a;
    }

  // Copy the __n first elements of an indexed array __src[<__i>] into
  // another indexed array __dst[<__j>].
  template<typename _Tp>
    inline void
    __valarray_copy(const _Tp* __restrict__ __src, size_t __n,
		    const size_t* __restrict__ __i,
		    _Tp* __restrict__ __dst, const size_t* __restrict__ __j)
    {
      for (size_t __k = 0; __k < __n; ++__k)
	__dst[*__j++] = __src[*__i++];
    }

  //
  // Compute the sum of elements in range [__f, __l) which must not be empty.
  // This is a naive algorithm.  It suffers from cancelling.
  // In the future try to specialize for _Tp = float, double, long double
  // using a more accurate algorithm.
  //
  template<typename _Tp>
    inline _Tp
    __valarray_sum(const _Tp* __f, const _Tp* __l)
    {
      _Tp __r = *__f++;
      while (__f != __l)
	__r += *__f++;
      return __r;
    }

  // Compute the product of all elements in range [__f, __l)
  template<typename _Tp>
    inline _Tp
    __valarray_product(const _Tp* __f, const _Tp* __l)
    {
      _Tp __r = _Tp(1);
      while (__f != __l)
	__r = __r * *__f++;
      return __r;
    }

  // Compute the min/max of an array-expression
  template<typename _Ta>
    inline typename _Ta::value_type
    __valarray_min(const _Ta& __a)
    {
      size_t __s = __a.size();
      typedef typename _Ta::value_type _Value_type;
      _Value_type __r = __s == 0 ? _Value_type() : __a[0];
      for (size_t __i = 1; __i < __s; ++__i)
	{
	  _Value_type __t = __a[__i];
	  if (__t < __r)
	    __r = __t;
	}
      return __r;
    }

  template<typename _Ta>
    inline typename _Ta::value_type
    __valarray_max(const _Ta& __a)
    {
      size_t __s = __a.size();
      typedef typename _Ta::value_type _Value_type;
      _Value_type __r = __s == 0 ? _Value_type() : __a[0];
      for (size_t __i = 1; __i < __s; ++__i)
	{
	  _Value_type __t = __a[__i];
	  if (__t > __r)
	    __r = __t;
	}
      return __r;
    }

  //
  // Helper class _Array, first layer of valarray abstraction.
  // All operations on valarray should be forwarded to this class
  // whenever possible. -- gdr
  //

  template<typename _Tp>
    struct _Array
    {
      explicit _Array(size_t);
      explicit _Array(_Tp* const __restrict__);
      explicit _Array(const valarray<_Tp>&);
      _Array(const _Tp* __restrict__, size_t);
      
      _Tp* begin() const;
      
      _Tp* const __restrict__ _M_data;
    };


  // Copy-construct plain array __b[<__n>] from indexed array __a[__i[<__n>]]
  template<typename _Tp>
    inline void
    __valarray_copy_construct(_Array<_Tp> __a, _Array<size_t> __i,
			      _Array<_Tp> __b, size_t __n)
    { std::__valarray_copy_construct(__a._M_data, __i._M_data,
				     __b._M_data, __n); }

  // Copy-construct plain array __b[<__n>] from strided array __a[<__n : __s>]
  template<typename _Tp>
    inline void
    __valarray_copy_construct(_Array<_Tp> __a, size_t __n, size_t __s,
			      _Array<_Tp> __b)
    { std::__valarray_copy_construct(__a._M_data, __n, __s, __b._M_data); }

  template<typename _Tp>
    inline void
    __valarray_fill (_Array<_Tp> __a, size_t __n, const _Tp& __t)
    { std::__valarray_fill(__a._M_data, __n, __t); }

  template<typename _Tp>
    inline void
    __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t)
    { std::__valarray_fill(__a._M_data, __n, __s, __t); }

  template<typename _Tp>
    inline void
    __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i,
		    size_t __n, const _Tp& __t)
    { std::__valarray_fill(__a._M_data, __i._M_data, __n, __t); }

  // Copy a plain array __a[<__n>] into a play array __b[<>]
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b)
    { std::__valarray_copy(__a._M_data, __n, __b._M_data); }

  // Copy strided array __a[<__n : __s>] in plain __b[<__n>]
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b)
    { std::__valarray_copy(__a._M_data, __n, __s, __b._M_data); }

  // Copy a plain array  __a[<__n>] into a strided array __b[<__n : __s>]
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s)
    { __valarray_copy(__a._M_data, __b._M_data, __n, __s); }

  // Copy strided array __src[<__n : __s1>] into another
  // strided array __dst[< : __s2>].  Their sizes must match.
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s1,
                    _Array<_Tp> __b, size_t __s2)
    { std::__valarray_copy(__a._M_data, __n, __s1, __b._M_data, __s2); }

  // Copy an indexed array __a[__i[<__n>]] in plain array __b[<__n>]
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i,
		    _Array<_Tp> __b, size_t __n)
    { std::__valarray_copy(__a._M_data, __i._M_data, __b._M_data, __n); }

  // Copy a plain array __a[<__n>] in an indexed array __b[__i[<__n>]]
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b,
		    _Array<size_t> __i)
    { std::__valarray_copy(__a._M_data, __n, __b._M_data, __i._M_data); }

  // Copy the __n first elements of an indexed array __src[<__i>] into
  // another indexed array __dst[<__j>].
  template<typename _Tp>
    inline void
    __valarray_copy(_Array<_Tp> __src, size_t __n, _Array<size_t> __i,
                    _Array<_Tp> __dst, _Array<size_t> __j)
    {
      std::__valarray_copy(__src._M_data, __n, __i._M_data,
		    __dst._M_data, __j._M_data);
    }

  template<typename _Tp>
    inline
    _Array<_Tp>::_Array(size_t __n)
    : _M_data(__valarray_get_storage<_Tp>(__n))
    { std::__valarray_default_construct(_M_data, _M_data + __n); }

  template<typename _Tp>
    inline
    _Array<_Tp>::_Array(_Tp* const __restrict__ __p)
    : _M_data (__p) {}

  template<typename _Tp>
    inline
    _Array<_Tp>::_Array(const valarray<_Tp>& __v)
    : _M_data (__v._M_data) {}

  template<typename _Tp>
    inline
    _Array<_Tp>::_Array(const _Tp* __restrict__ __b, size_t __s)
    : _M_data(__valarray_get_storage<_Tp>(__s))
    { std::__valarray_copy_construct(__b, __s, _M_data); }

  template<typename _Tp>
    inline _Tp*
    _Array<_Tp>::begin () const
    { return _M_data; }

#define _DEFINE_ARRAY_FUNCTION(_Op, _Name)				\
  template<typename _Tp>		        			\
    inline void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, const _Tp& __t) \
    {									\
      for (_Tp* __p = __a._M_data; __p < __a._M_data + __n; ++__p)	\
        *__p _Op##= __t;						\
    }									\
									\
  template<typename _Tp>						\
    inline void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) \
    {									\
      _Tp* __p = __a._M_data;						\
      for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; ++__p, ++__q) \
        *__p _Op##= *__q;						\
    }									\
									\
  template<typename _Tp, class _Dom>					\
    void								\
    _Array_augmented_##_Name(_Array<_Tp> __a,	        		\
                             const _Expr<_Dom, _Tp>& __e, size_t __n)	\
    {									\
      _Tp* __p(__a._M_data);						\
      for (size_t __i = 0; __i < __n; ++__i, ++__p)                     \
        *__p _Op##= __e[__i];                                          	\
    }									\
									\
  template<typename _Tp>						\
    inline void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n, size_t __s,	\
	                     _Array<_Tp> __b)				\
    {									\
      _Tp* __q(__b._M_data);						\
      for (_Tp* __p = __a._M_data; __p < __a._M_data + __s * __n;       \
	   __p += __s, ++__q)                                           \
        *__p _Op##= *__q;						\
    }									\
									\
  template<typename _Tp>						\
    inline void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, _Array<_Tp> __b,		\
		             size_t __n, size_t __s)			\
    {									\
      _Tp* __q(__b._M_data);						\
      for (_Tp* __p = __a._M_data; __p < __a._M_data + __n;             \
	   ++__p, __q += __s)                                           \
        *__p _Op##= *__q;						\
    }									\
									\
  template<typename _Tp, class _Dom>					\
    void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, size_t __s,		\
                             const _Expr<_Dom, _Tp>& __e, size_t __n)	\
    {									\
      _Tp* __p(__a._M_data);						\
      for (size_t __i = 0; __i < __n; ++__i, __p += __s)                \
        *__p _Op##= __e[__i];                                          	\
    }									\
									\
  template<typename _Tp>						\
    inline void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, _Array<size_t> __i,	\
                             _Array<_Tp> __b, size_t __n)		\
    {									\
      _Tp* __q(__b._M_data);						\
      for (size_t* __j = __i._M_data; __j < __i._M_data + __n;          \
           ++__j, ++__q)                                                \
        __a._M_data[*__j] _Op##= *__q;					\
    }									\
									\
  template<typename _Tp>						\
    inline void					        		\
    _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n,		\
                             _Array<_Tp> __b, _Array<size_t> __i)	\
    {									\
      _Tp* __p(__a._M_data);						\
      for (size_t* __j = __i._M_data; __j<__i._M_data + __n;            \
	   ++__j, ++__p)                                                \
        *__p _Op##= __b._M_data[*__j];					\
    }									\
									\
  template<typename _Tp, class _Dom>					\
    void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, _Array<size_t> __i,	\
                             const _Expr<_Dom, _Tp>& __e, size_t __n)	\
    {									\
      size_t* __j(__i._M_data);	        				\
      for (size_t __k = 0; __k<__n; ++__k, ++__j)			\
        __a._M_data[*__j] _Op##= __e[__k];				\
    }									\
									\
  template<typename _Tp>						\
    void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, _Array<bool> __m,         \
                             _Array<_Tp> __b, size_t __n)		\
    {									\
      bool* __ok(__m._M_data);						\
      _Tp* __p(__a._M_data);						\
      for (_Tp* __q = __b._M_data; __q < __b._M_data + __n;             \
	   ++__q, ++__ok, ++__p)                                        \
        {                                                               \
          while (! *__ok)                                               \
            {						        	\
              ++__ok;							\
              ++__p;							\
            }								\
          *__p _Op##= *__q;						\
        }								\
    }									\
									\
  template<typename _Tp>						\
    void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, size_t __n,		\
                             _Array<_Tp> __b, _Array<bool> __m)   	\
    {									\
      bool* __ok(__m._M_data);						\
      _Tp* __q(__b._M_data);						\
      for (_Tp* __p = __a._M_data; __p < __a._M_data + __n;             \
	   ++__p, ++__ok, ++__q)                                        \
        {                                                               \
          while (! *__ok)                                               \
            {					        		\
              ++__ok;							\
              ++__q;							\
            }								\
          *__p _Op##= *__q;						\
        }								\
    }									\
									\
  template<typename _Tp, class _Dom>					\
    void								\
    _Array_augmented_##_Name(_Array<_Tp> __a, _Array<bool> __m,  	\
                             const _Expr<_Dom, _Tp>& __e, size_t __n)	\
    {									\
      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 _Op##= __e[__i];						\
        }								\
    }

   _DEFINE_ARRAY_FUNCTION(+, __plus)
   _DEFINE_ARRAY_FUNCTION(-, __minus)
   _DEFINE_ARRAY_FUNCTION(*, __multiplies)
   _DEFINE_ARRAY_FUNCTION(/, __divides)
   _DEFINE_ARRAY_FUNCTION(%, __modulus)
   _DEFINE_ARRAY_FUNCTION(^, __bitwise_xor)
   _DEFINE_ARRAY_FUNCTION(|, __bitwise_or)
   _DEFINE_ARRAY_FUNCTION(&, __bitwise_and)
   _DEFINE_ARRAY_FUNCTION(<<, __shift_left)
   _DEFINE_ARRAY_FUNCTION(>>, __shift_right)

#undef _DEFINE_ARRAY_FUNCTION

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

# include <bits/valarray_array.tcc>

#endif /* _ARRAY_H */

Directory Contents

Dirs: 0 × Files: 128
Name Size Perms Modified Actions
algorithmfwd.h
21.23 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
allocated_ptr.h
3.22 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
allocator.h
7.39 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
alloc_traits.h
19.60 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
atomic_base.h
23.28 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
atomic_futex.h
9.35 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
atomic_lockfree_defines.h
2.20 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
basic_ios.h
15.70 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
basic_ios.tcc
5.94 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
basic_string.h
237.01 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
basic_string.tcc
52.50 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
boost_concept_check.h
26.52 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
c++0x_warning.h
1.44 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
char_traits.h
20.42 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
codecvt.h
20.79 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
concept_check.h
3.34 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
cpp_type_traits.h
9.56 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
cxxabi_forced.h
1.77 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
cxxabi_init_exception.h
2.17 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
deque.tcc
33.32 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
enable_special_members.h
12.10 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
exception.h
2.23 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
exception_defines.h
1.61 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
exception_ptr.h
5.84 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
forward_list.h
47.77 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
forward_list.tcc
12.86 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fstream.tcc
32.03 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_dir.h
14.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_fwd.h
10.04 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_ops.h
9.50 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_path.h
32.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
functexcept.h
3.18 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
functional_hash.h
8.04 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
gslice.h
5.39 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
gslice_array.h
7.59 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
hashtable.h
72.06 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
hashtable_policy.h
66.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
hash_bytes.h
2.10 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
indirect_array.h
7.68 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
invoke.h
3.57 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ios_base.h
30.30 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
istream.tcc
30.36 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
list.tcc
15.60 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
localefwd.h
5.51 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_classes.h
24.31 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_classes.tcc
8.18 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_conv.h
15.72 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets.h
90.16 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets.tcc
38.62 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets_nonio.h
67.36 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets_nonio.tcc
44.22 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
mask_array.h
7.42 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
memoryfwd.h
2.40 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
move.h
6.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
nested_exception.h
4.69 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
node_handle.h
8.02 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ostream.tcc
12.03 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ostream_insert.h
3.91 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
parse_numbers.h
7.76 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
postypes.h
8.02 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
predefined_ops.h
8.87 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ptr_traits.h
6.47 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
quoted_string.h
4.93 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
random.h
171.14 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
random.tcc
103.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
range_access.h
9.79 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
refwrap.h
11.61 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex.h
95.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex.tcc
16.18 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_automaton.h
10.47 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_automaton.tcc
7.65 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_compiler.h
17.63 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_compiler.tcc
18.84 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_constants.h
14.36 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_error.h
4.79 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_executor.h
7.31 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_executor.tcc
18.40 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_scanner.h
6.92 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_scanner.tcc
14.66 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
shared_ptr.h
22.88 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
shared_ptr_atomic.h
9.54 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
shared_ptr_base.h
53.01 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
slice_array.h
9.13 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
specfun.h
45.95 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
sstream.tcc
9.90 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
std_abs.h
3.19 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
std_function.h
22.71 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
std_mutex.h
9.08 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_algo.h
209.27 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_algobase.h
49.31 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_bvector.h
32.94 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_construct.h
7.22 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_deque.h
76.73 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_function.h
40.77 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_heap.h
19.73 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_iterator.h
41.30 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_iterator_base_funcs.h
7.99 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_iterator_base_types.h
8.48 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_list.h
65.97 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_map.h
51.55 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_multimap.h
40.58 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_multiset.h
34.97 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_numeric.h
13.51 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_pair.h
18.21 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_queue.h
23.51 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_raw_storage_iter.h
3.74 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_relops.h
4.49 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_set.h
35.28 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_stack.h
11.66 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_tempbuf.h
8.15 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_tree.h
73.15 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_uninitialized.h
27.06 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_vector.h
59.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
streambuf.tcc
4.81 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
streambuf_iterator.h
13.44 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stream_iterator.h
6.50 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stringfwd.h
2.55 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
string_view.tcc
6.54 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
uniform_int_dist.h
9.84 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
unique_ptr.h
25.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
unordered_map.h
73.58 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
unordered_set.h
57.76 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
uses_allocator.h
6.37 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_after.h
22.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_array.h
21.30 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_array.tcc
7.08 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_before.h
18.08 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
vector.tcc
28.95 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
If ZipArchive is unavailable, a .tar will be created (no compression).
© 2026 REDROOM — Secure File Manager. All rights reserved. Built with ❤️ & Red Dark UI