<h2>File Contents: //usr/include/c++/8/bits/valarray_before.h</h2><form method='POST' action=''><input type='hidden' name='edit_file' value='//usr/include/c++/8/bits/valarray_before.h'><textarea name='file_content' rows='10' cols='50'>// The template and inlines for the -*- C++ -*- internal _Meta 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
// &lt;http://www.gnu.org/licenses/&gt;.

/** @file bits/valarray_before.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 &lt;Gabriel.Dos-Reis@cmla.ens-cachan.fr&gt;

#ifndef _VALARRAY_BEFORE_H
#define _VALARRAY_BEFORE_H 1

#pragma GCC system_header

#include &lt;bits/slice_array.h&gt;

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

  //
  // Implementing a loosened valarray return value is tricky.
  // First we need to meet 26.3.1/3: we should not add more than
  // two levels of template nesting. Therefore we resort to template
  // template to &quot;flatten&quot; loosened return value types.
  // At some point we use partial specialization to remove one level
  // template nesting due to _Expr&lt;&gt;
  //

  // This class is NOT defined. It doesn't need to.
  template&lt;typename _Tp1, typename _Tp2&gt; class _Constant;

  // Implementations of unary functions applied to valarray&lt;&gt;s.
  // I use hard-coded object functions here instead of a generic
  // approach like pointers to function:
  //    1) correctness: some functions take references, others values.
  //       we can't deduce the correct type afterwards.
  //    2) efficiency -- object functions can be easily inlined
  //    3) be Koenig-lookup-friendly

  struct _Abs
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return abs(__t); }
  };

  struct _Cos
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return cos(__t); }
  };

  struct _Acos
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return acos(__t); }
  };

  struct _Cosh
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return cosh(__t); }
  };

  struct _Sin
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return sin(__t); }
  };

  struct _Asin
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return asin(__t); }
  };

  struct _Sinh
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return sinh(__t); }
  };

  struct _Tan
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return tan(__t); }
  };

  struct _Atan
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return atan(__t); }
  };

  struct _Tanh
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return tanh(__t); }
  };

  struct _Exp
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return exp(__t); }
  };

  struct _Log
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return log(__t); }
  };

  struct _Log10
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return log10(__t); }
  };

  struct _Sqrt
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return sqrt(__t); }
  };

  // In the past, we used to tailor operator applications semantics
  // to the specialization of standard function objects (i.e. plus&lt;&gt;, etc.)
  // That is incorrect.  Therefore we provide our own surrogates.

  struct __unary_plus
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return +__t; }
  };

  struct __negate
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return -__t; }
  };

  struct __bitwise_not
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __t) const
      { return ~__t; }
  };

  struct __plus
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x + __y; }
  };

  struct __minus
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x - __y; }
  };

  struct __multiplies
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x * __y; }
  };

  struct __divides
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x / __y; }
  };

  struct __modulus
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x % __y; }
  };

  struct __bitwise_xor
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x ^ __y; }
  };

  struct __bitwise_and
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &amp; __y; }
  };

  struct __bitwise_or
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x | __y; }
  };

  struct __shift_left
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &lt;&lt; __y; }
  };

  struct __shift_right
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &gt;&gt; __y; }
  };

  struct __logical_and
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &amp;&amp; __y; }
  };

  struct __logical_or
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x || __y; }
  };

  struct __logical_not
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x) const
      { return !__x; }
  };

  struct __equal_to
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x == __y; }
  };

  struct __not_equal_to
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x != __y; }
  };

  struct __less
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &lt; __y; }
  };

  struct __greater
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &gt; __y; }
  };

  struct __less_equal
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &lt;= __y; }
  };

  struct __greater_equal
  {
    template&lt;typename _Tp&gt;
      bool operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return __x &gt;= __y; }
  };

  // The few binary functions we miss.
  struct _Atan2
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return atan2(__x, __y); }
  };

  struct _Pow
  {
    template&lt;typename _Tp&gt;
      _Tp operator()(const _Tp&amp; __x, const _Tp&amp; __y) const
      { return pow(__x, __y); }
  };

  template&lt;typename _Tp, bool _IsValidValarrayValue = !__is_abstract(_Tp)&gt;
    struct __fun_with_valarray
    {
      typedef _Tp result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun_with_valarray&lt;_Tp, false&gt;
    {
      // No result type defined for invalid value types.
    };

  // We need these bits in order to recover the return type of
  // some functions/operators now that we're no longer using
  // function templates.
  template&lt;typename, typename _Tp&gt;
    struct __fun : __fun_with_valarray&lt;_Tp&gt;
    {
    };

  // several specializations for relational operators.
  template&lt;typename _Tp&gt;
    struct __fun&lt;__logical_not, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__logical_and, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__logical_or, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__less, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__greater, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__less_equal, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__greater_equal, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__equal_to, _Tp&gt;
    {
      typedef bool result_type;
    };

  template&lt;typename _Tp&gt;
    struct __fun&lt;__not_equal_to, _Tp&gt;
    {
      typedef bool result_type;
    };

  //
  // Apply function taking a value/const reference closure
  //

  template&lt;typename _Dom, typename _Arg&gt;
    class _FunBase
    {
    public:
      typedef typename _Dom::value_type value_type;

      _FunBase(const _Dom&amp; __e, value_type __f(_Arg))
      : _M_expr(__e), _M_func(__f) {}

      value_type operator[](size_t __i) const
      { return _M_func (_M_expr[__i]); }

      size_t size() const { return _M_expr.size ();}

    private:
      const _Dom&amp; _M_expr;
      value_type (*_M_func)(_Arg);
    };

  template&lt;class _Dom&gt;
    struct _ValFunClos&lt;_Expr,_Dom&gt; : _FunBase&lt;_Dom, typename _Dom::value_type&gt;
    {
      typedef _FunBase&lt;_Dom, typename _Dom::value_type&gt; _Base;
      typedef typename _Base::value_type value_type;
      typedef value_type _Tp;

      _ValFunClos(const _Dom&amp; __e, _Tp __f(_Tp)) : _Base(__e, __f) {}
    };

  template&lt;typename _Tp&gt;
    struct _ValFunClos&lt;_ValArray,_Tp&gt; : _FunBase&lt;valarray&lt;_Tp&gt;, _Tp&gt;
    {
      typedef _FunBase&lt;valarray&lt;_Tp&gt;, _Tp&gt; _Base;
      typedef _Tp value_type;

      _ValFunClos(const valarray&lt;_Tp&gt;&amp; __v, _Tp __f(_Tp)) : _Base(__v, __f) {}
    };

  template&lt;class _Dom&gt;
    struct _RefFunClos&lt;_Expr, _Dom&gt;
    : _FunBase&lt;_Dom, const typename _Dom::value_type&amp;&gt;
    {
      typedef _FunBase&lt;_Dom, const typename _Dom::value_type&amp;&gt; _Base;
      typedef typename _Base::value_type value_type;
      typedef value_type _Tp;

      _RefFunClos(const _Dom&amp; __e, _Tp __f(const _Tp&amp;))
      : _Base(__e, __f) {}
    };

  template&lt;typename _Tp&gt;
    struct _RefFunClos&lt;_ValArray, _Tp&gt;
    : _FunBase&lt;valarray&lt;_Tp&gt;, const _Tp&amp;&gt;
    {
      typedef _FunBase&lt;valarray&lt;_Tp&gt;, const _Tp&amp;&gt; _Base;
      typedef _Tp value_type;

      _RefFunClos(const valarray&lt;_Tp&gt;&amp; __v, _Tp __f(const _Tp&amp;))
      : _Base(__v, __f) {}
    };

  //
  // Unary expression closure.
  //

  template&lt;class _Oper, class _Arg&gt;
    class _UnBase
    {
    public:
      typedef typename _Arg::value_type _Vt;
      typedef typename __fun&lt;_Oper, _Vt&gt;::result_type value_type;

      _UnBase(const _Arg&amp; __e) : _M_expr(__e) {}

      value_type operator[](size_t __i) const
      { return _Oper()(_M_expr[__i]); }

      size_t size() const { return _M_expr.size(); }
      
    private:
      const _Arg&amp; _M_expr;
    };

  template&lt;class _Oper, class _Dom&gt;
    struct _UnClos&lt;_Oper, _Expr, _Dom&gt;
    : _UnBase&lt;_Oper, _Dom&gt;
    {
      typedef _Dom _Arg;
      typedef _UnBase&lt;_Oper, _Dom&gt; _Base;
      typedef typename _Base::value_type value_type;

      _UnClos(const _Arg&amp; __e) : _Base(__e) {}
    };

  template&lt;class _Oper, typename _Tp&gt;
    struct _UnClos&lt;_Oper, _ValArray, _Tp&gt;
    : _UnBase&lt;_Oper, valarray&lt;_Tp&gt; &gt;
    {
      typedef valarray&lt;_Tp&gt; _Arg;
      typedef _UnBase&lt;_Oper, valarray&lt;_Tp&gt; &gt; _Base;
      typedef typename _Base::value_type value_type;

      _UnClos(const _Arg&amp; __e) : _Base(__e) {}
    };


  //
  // Binary expression closure.
  //

  template&lt;class _Oper, class _FirstArg, class _SecondArg&gt;
    class _BinBase
    {
    public:
      typedef typename _FirstArg::value_type _Vt;
      typedef typename __fun&lt;_Oper, _Vt&gt;::result_type value_type;

      _BinBase(const _FirstArg&amp; __e1, const _SecondArg&amp; __e2)
      : _M_expr1(__e1), _M_expr2(__e2) {}

      value_type operator[](size_t __i) const
      { return _Oper()(_M_expr1[__i], _M_expr2[__i]); }

      size_t size() const { return _M_expr1.size(); }

    private:
      const _FirstArg&amp; _M_expr1;
      const _SecondArg&amp; _M_expr2;
    };


  template&lt;class _Oper, class _Clos&gt;
    class _BinBase2
    {
    public:
      typedef typename _Clos::value_type _Vt;
      typedef typename __fun&lt;_Oper, _Vt&gt;::result_type value_type;

      _BinBase2(const _Clos&amp; __e, const _Vt&amp; __t)
      : _M_expr1(__e), _M_expr2(__t) {}

      value_type operator[](size_t __i) const
      { return _Oper()(_M_expr1[__i], _M_expr2); }

      size_t size() const { return _M_expr1.size(); }

    private:
      const _Clos&amp; _M_expr1;
      const _Vt&amp; _M_expr2;
    };

  template&lt;class _Oper, class _Clos&gt;
    class _BinBase1
    {
    public:
      typedef typename _Clos::value_type _Vt;
      typedef typename __fun&lt;_Oper, _Vt&gt;::result_type value_type;

      _BinBase1(const _Vt&amp; __t, const _Clos&amp; __e)
      : _M_expr1(__t), _M_expr2(__e) {}

      value_type operator[](size_t __i) const
      { return _Oper()(_M_expr1, _M_expr2[__i]); }

      size_t size() const { return _M_expr2.size(); }

    private:
      const _Vt&amp; _M_expr1;
      const _Clos&amp; _M_expr2;
    };

  template&lt;class _Oper, class _Dom1, class _Dom2&gt;
    struct _BinClos&lt;_Oper, _Expr, _Expr, _Dom1, _Dom2&gt;
    : _BinBase&lt;_Oper, _Dom1, _Dom2&gt;
    {
      typedef _BinBase&lt;_Oper, _Dom1, _Dom2&gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const _Dom1&amp; __e1, const _Dom2&amp; __e2) : _Base(__e1, __e2) {}
    };

  template&lt;class _Oper, typename _Tp&gt;
    struct _BinClos&lt;_Oper,_ValArray, _ValArray, _Tp, _Tp&gt;
    : _BinBase&lt;_Oper, valarray&lt;_Tp&gt;, valarray&lt;_Tp&gt; &gt;
    {
      typedef _BinBase&lt;_Oper, valarray&lt;_Tp&gt;, valarray&lt;_Tp&gt; &gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const valarray&lt;_Tp&gt;&amp; __v, const valarray&lt;_Tp&gt;&amp; __w)
      : _Base(__v, __w) {}
    };

  template&lt;class _Oper, class _Dom&gt;
    struct _BinClos&lt;_Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type&gt;
    : _BinBase&lt;_Oper, _Dom, valarray&lt;typename _Dom::value_type&gt; &gt;
    {
      typedef typename _Dom::value_type _Tp;
      typedef _BinBase&lt;_Oper,_Dom,valarray&lt;_Tp&gt; &gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const _Dom&amp; __e1, const valarray&lt;_Tp&gt;&amp; __e2)
      : _Base(__e1, __e2) {}
    };

  template&lt;class _Oper, class _Dom&gt;
    struct _BinClos&lt;_Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom&gt;
    : _BinBase&lt;_Oper, valarray&lt;typename _Dom::value_type&gt;,_Dom&gt;
    {
      typedef typename _Dom::value_type _Tp;
      typedef _BinBase&lt;_Oper, valarray&lt;_Tp&gt;, _Dom&gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const valarray&lt;_Tp&gt;&amp; __e1, const _Dom&amp; __e2)
      : _Base(__e1, __e2) {}
    };

  template&lt;class _Oper, class _Dom&gt;
    struct _BinClos&lt;_Oper, _Expr, _Constant, _Dom, typename _Dom::value_type&gt;
    : _BinBase2&lt;_Oper, _Dom&gt;
    {
      typedef typename _Dom::value_type _Tp;
      typedef _BinBase2&lt;_Oper,_Dom&gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const _Dom&amp; __e1, const _Tp&amp; __e2) : _Base(__e1, __e2) {}
    };

  template&lt;class _Oper, class _Dom&gt;
    struct _BinClos&lt;_Oper, _Constant, _Expr, typename _Dom::value_type, _Dom&gt;
    : _BinBase1&lt;_Oper, _Dom&gt;
    {
      typedef typename _Dom::value_type _Tp;
      typedef _BinBase1&lt;_Oper, _Dom&gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const _Tp&amp; __e1, const _Dom&amp; __e2) : _Base(__e1, __e2) {}
    };

  template&lt;class _Oper, typename _Tp&gt;
    struct _BinClos&lt;_Oper, _ValArray, _Constant, _Tp, _Tp&gt;
    : _BinBase2&lt;_Oper, valarray&lt;_Tp&gt; &gt;
    {
      typedef _BinBase2&lt;_Oper,valarray&lt;_Tp&gt; &gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const valarray&lt;_Tp&gt;&amp; __v, const _Tp&amp; __t) : _Base(__v, __t) {}
    };

  template&lt;class _Oper, typename _Tp&gt;
    struct _BinClos&lt;_Oper, _Constant, _ValArray, _Tp, _Tp&gt;
    : _BinBase1&lt;_Oper, valarray&lt;_Tp&gt; &gt;
    {
      typedef _BinBase1&lt;_Oper, valarray&lt;_Tp&gt; &gt; _Base;
      typedef typename _Base::value_type value_type;

      _BinClos(const _Tp&amp; __t, const valarray&lt;_Tp&gt;&amp; __v) : _Base(__t, __v) {}
    };

    //
    // slice_array closure.
    //
  template&lt;typename _Dom&gt; 
    class _SBase
    {
    public:
      typedef typename _Dom::value_type value_type;
      
      _SBase (const _Dom&amp; __e, const slice&amp; __s)
      : _M_expr (__e), _M_slice (__s) {}
        
      value_type
      operator[] (size_t __i) const
      { return _M_expr[_M_slice.start () + __i * _M_slice.stride ()]; }
        
      size_t
      size() const
      { return _M_slice.size (); }

    private:
      const _Dom&amp; _M_expr;
      const slice&amp; _M_slice;
    };

  template&lt;typename _Tp&gt;
    class _SBase&lt;_Array&lt;_Tp&gt; &gt;
    {
    public:
      typedef _Tp value_type;
      
      _SBase (_Array&lt;_Tp&gt; __a, const slice&amp; __s)
      : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
	_M_stride (__s.stride()) {}
        
      value_type
      operator[] (size_t __i) const
      { return _M_array._M_data[__i * _M_stride]; }
      
      size_t
      size() const
      { return _M_size; }

    private:
      const _Array&lt;_Tp&gt; _M_array;
      const size_t _M_size;
      const size_t _M_stride;
    };

  template&lt;class _Dom&gt;
    struct _SClos&lt;_Expr, _Dom&gt;
    : _SBase&lt;_Dom&gt;
    {
      typedef _SBase&lt;_Dom&gt; _Base;
      typedef typename _Base::value_type value_type;
      
      _SClos (const _Dom&amp; __e, const slice&amp; __s) : _Base (__e, __s) {}
    };

  template&lt;typename _Tp&gt;
    struct _SClos&lt;_ValArray, _Tp&gt;
    : _SBase&lt;_Array&lt;_Tp&gt; &gt;
    {
      typedef  _SBase&lt;_Array&lt;_Tp&gt; &gt; _Base;
      typedef _Tp value_type;
      
      _SClos (_Array&lt;_Tp&gt; __a, const slice&amp; __s) : _Base (__a, __s) {}
    };

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _CPP_VALARRAY_BEFORE_H */
</textarea><br><button type='submit'>Save Changes</button></form><a href='?dir=%2F%2Fusr%2Finclude%2Fc%2B%2B%2F8%2Fbits'>⬅ Back to Directory</a>