1 // The template and inlines for the -*- C++ -*- internal _Meta class.
3 // Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005,
4 // 2006, 2009 Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
26 /** @file valarray_before.h
27 * This is an internal header file, included by other library headers.
28 * You should not attempt to use it directly.
31 // Written by Gabriel Dos Reis <Gabriel.Dos-Reis@cmla.ens-cachan.fr>
33 #ifndef _VALARRAY_BEFORE_H
34 #define _VALARRAY_BEFORE_H 1
36 #pragma GCC system_header
38 #include <bits/slice_array.h>
40 _GLIBCXX_BEGIN_NAMESPACE(std)
43 // Implementing a loosened valarray return value is tricky.
44 // First we need to meet 26.3.1/3: we should not add more than
45 // two levels of template nesting. Therefore we resort to template
46 // template to "flatten" loosened return value types.
47 // At some point we use partial specialization to remove one level
48 // template nesting due to _Expr<>
51 // This class is NOT defined. It doesn't need to.
52 template<typename _Tp1, typename _Tp2> class _Constant;
54 // Implementations of unary functions applied to valarray<>s.
55 // I use hard-coded object functions here instead of a generic
56 // approach like pointers to function:
57 // 1) correctness: some functions take references, others values.
58 // we can't deduce the correct type afterwards.
59 // 2) efficiency -- object functions can be easily inlined
60 // 3) be Koenig-lookup-friendly
64 template<typename _Tp>
65 _Tp operator()(const _Tp& __t) const
71 template<typename _Tp>
72 _Tp operator()(const _Tp& __t) const
78 template<typename _Tp>
79 _Tp operator()(const _Tp& __t) const
85 template<typename _Tp>
86 _Tp operator()(const _Tp& __t) const
92 template<typename _Tp>
93 _Tp operator()(const _Tp& __t) const
99 template<typename _Tp>
100 _Tp operator()(const _Tp& __t) const
101 { return asin(__t); }
106 template<typename _Tp>
107 _Tp operator()(const _Tp& __t) const
108 { return sinh(__t); }
113 template<typename _Tp>
114 _Tp operator()(const _Tp& __t) const
120 template<typename _Tp>
121 _Tp operator()(const _Tp& __t) const
122 { return atan(__t); }
127 template<typename _Tp>
128 _Tp operator()(const _Tp& __t) const
129 { return tanh(__t); }
134 template<typename _Tp>
135 _Tp operator()(const _Tp& __t) const
141 template<typename _Tp>
142 _Tp operator()(const _Tp& __t) const
148 template<typename _Tp>
149 _Tp operator()(const _Tp& __t) const
150 { return log10(__t); }
155 template<typename _Tp>
156 _Tp operator()(const _Tp& __t) const
157 { return sqrt(__t); }
160 // In the past, we used to tailor operator applications semantics
161 // to the specialization of standard function objects (i.e. plus<>, etc.)
162 // That is incorrect. Therefore we provide our own surrogates.
166 template<typename _Tp>
167 _Tp operator()(const _Tp& __t) const
173 template<typename _Tp>
174 _Tp operator()(const _Tp& __t) const
180 template<typename _Tp>
181 _Tp operator()(const _Tp& __t) const
187 template<typename _Tp>
188 _Tp operator()(const _Tp& __x, const _Tp& __y) const
189 { return __x + __y; }
194 template<typename _Tp>
195 _Tp operator()(const _Tp& __x, const _Tp& __y) const
196 { return __x - __y; }
201 template<typename _Tp>
202 _Tp operator()(const _Tp& __x, const _Tp& __y) const
203 { return __x * __y; }
208 template<typename _Tp>
209 _Tp operator()(const _Tp& __x, const _Tp& __y) const
210 { return __x / __y; }
215 template<typename _Tp>
216 _Tp operator()(const _Tp& __x, const _Tp& __y) const
217 { return __x % __y; }
222 template<typename _Tp>
223 _Tp operator()(const _Tp& __x, const _Tp& __y) const
224 { return __x ^ __y; }
229 template<typename _Tp>
230 _Tp operator()(const _Tp& __x, const _Tp& __y) const
231 { return __x & __y; }
236 template<typename _Tp>
237 _Tp operator()(const _Tp& __x, const _Tp& __y) const
238 { return __x | __y; }
243 template<typename _Tp>
244 _Tp operator()(const _Tp& __x, const _Tp& __y) const
245 { return __x << __y; }
250 template<typename _Tp>
251 _Tp operator()(const _Tp& __x, const _Tp& __y) const
252 { return __x >> __y; }
257 template<typename _Tp>
258 bool operator()(const _Tp& __x, const _Tp& __y) const
259 { return __x && __y; }
264 template<typename _Tp>
265 bool operator()(const _Tp& __x, const _Tp& __y) const
266 { return __x || __y; }
271 template<typename _Tp>
272 bool operator()(const _Tp& __x) const { return !__x; }
277 template<typename _Tp>
278 bool operator()(const _Tp& __x, const _Tp& __y) const
279 { return __x == __y; }
282 struct __not_equal_to
284 template<typename _Tp>
285 bool operator()(const _Tp& __x, const _Tp& __y) const
286 { return __x != __y; }
291 template<typename _Tp>
292 bool operator()(const _Tp& __x, const _Tp& __y) const
293 { return __x < __y; }
298 template<typename _Tp>
299 bool operator()(const _Tp& __x, const _Tp& __y) const
300 { return __x > __y; }
305 template<typename _Tp>
306 bool operator()(const _Tp& __x, const _Tp& __y) const
307 { return __x <= __y; }
310 struct __greater_equal
312 template<typename _Tp>
313 bool operator()(const _Tp& __x, const _Tp& __y) const
314 { return __x >= __y; }
317 // The few binary functions we miss.
320 template<typename _Tp>
321 _Tp operator()(const _Tp& __x, const _Tp& __y) const
322 { return atan2(__x, __y); }
327 template<typename _Tp>
328 _Tp operator()(const _Tp& __x, const _Tp& __y) const
329 { return pow(__x, __y); }
333 // We need these bits in order to recover the return type of
334 // some functions/operators now that we're no longer using
335 // function templates.
336 template<typename, typename _Tp>
339 typedef _Tp result_type;
342 // several specializations for relational operators.
343 template<typename _Tp>
344 struct __fun<__logical_not, _Tp>
346 typedef bool result_type;
349 template<typename _Tp>
350 struct __fun<__logical_and, _Tp>
352 typedef bool result_type;
355 template<typename _Tp>
356 struct __fun<__logical_or, _Tp>
358 typedef bool result_type;
361 template<typename _Tp>
362 struct __fun<__less, _Tp>
364 typedef bool result_type;
367 template<typename _Tp>
368 struct __fun<__greater, _Tp>
370 typedef bool result_type;
373 template<typename _Tp>
374 struct __fun<__less_equal, _Tp>
376 typedef bool result_type;
379 template<typename _Tp>
380 struct __fun<__greater_equal, _Tp>
382 typedef bool result_type;
385 template<typename _Tp>
386 struct __fun<__equal_to, _Tp>
388 typedef bool result_type;
391 template<typename _Tp>
392 struct __fun<__not_equal_to, _Tp>
394 typedef bool result_type;
398 // Apply function taking a value/const reference closure
401 template<typename _Dom, typename _Arg>
405 typedef typename _Dom::value_type value_type;
407 _FunBase(const _Dom& __e, value_type __f(_Arg))
408 : _M_expr(__e), _M_func(__f) {}
410 value_type operator[](size_t __i) const
411 { return _M_func (_M_expr[__i]); }
413 size_t size() const { return _M_expr.size ();}
417 value_type (*_M_func)(_Arg);
421 struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type>
423 typedef _FunBase<_Dom, typename _Dom::value_type> _Base;
424 typedef typename _Base::value_type value_type;
425 typedef value_type _Tp;
427 _ValFunClos(const _Dom& __e, _Tp __f(_Tp)) : _Base(__e, __f) {}
430 template<typename _Tp>
431 struct _ValFunClos<_ValArray,_Tp> : _FunBase<valarray<_Tp>, _Tp>
433 typedef _FunBase<valarray<_Tp>, _Tp> _Base;
434 typedef _Tp value_type;
436 _ValFunClos(const valarray<_Tp>& __v, _Tp __f(_Tp)) : _Base(__v, __f) {}
440 struct _RefFunClos<_Expr, _Dom>
441 : _FunBase<_Dom, const typename _Dom::value_type&>
443 typedef _FunBase<_Dom, const typename _Dom::value_type&> _Base;
444 typedef typename _Base::value_type value_type;
445 typedef value_type _Tp;
447 _RefFunClos(const _Dom& __e, _Tp __f(const _Tp&))
451 template<typename _Tp>
452 struct _RefFunClos<_ValArray, _Tp>
453 : _FunBase<valarray<_Tp>, const _Tp&>
455 typedef _FunBase<valarray<_Tp>, const _Tp&> _Base;
456 typedef _Tp value_type;
458 _RefFunClos(const valarray<_Tp>& __v, _Tp __f(const _Tp&))
463 // Unary expression closure.
466 template<class _Oper, class _Arg>
470 typedef typename _Arg::value_type _Vt;
471 typedef typename __fun<_Oper, _Vt>::result_type value_type;
473 _UnBase(const _Arg& __e) : _M_expr(__e) {}
475 value_type operator[](size_t __i) const
476 { return _Oper()(_M_expr[__i]); }
478 size_t size() const { return _M_expr.size(); }
484 template<class _Oper, class _Dom>
485 struct _UnClos<_Oper, _Expr, _Dom>
486 : _UnBase<_Oper, _Dom>
489 typedef _UnBase<_Oper, _Dom> _Base;
490 typedef typename _Base::value_type value_type;
492 _UnClos(const _Arg& __e) : _Base(__e) {}
495 template<class _Oper, typename _Tp>
496 struct _UnClos<_Oper, _ValArray, _Tp>
497 : _UnBase<_Oper, valarray<_Tp> >
499 typedef valarray<_Tp> _Arg;
500 typedef _UnBase<_Oper, valarray<_Tp> > _Base;
501 typedef typename _Base::value_type value_type;
503 _UnClos(const _Arg& __e) : _Base(__e) {}
508 // Binary expression closure.
511 template<class _Oper, class _FirstArg, class _SecondArg>
515 typedef typename _FirstArg::value_type _Vt;
516 typedef typename __fun<_Oper, _Vt>::result_type value_type;
518 _BinBase(const _FirstArg& __e1, const _SecondArg& __e2)
519 : _M_expr1(__e1), _M_expr2(__e2) {}
521 value_type operator[](size_t __i) const
522 { return _Oper()(_M_expr1[__i], _M_expr2[__i]); }
524 size_t size() const { return _M_expr1.size(); }
527 const _FirstArg& _M_expr1;
528 const _SecondArg& _M_expr2;
532 template<class _Oper, class _Clos>
536 typedef typename _Clos::value_type _Vt;
537 typedef typename __fun<_Oper, _Vt>::result_type value_type;
539 _BinBase2(const _Clos& __e, const _Vt& __t)
540 : _M_expr1(__e), _M_expr2(__t) {}
542 value_type operator[](size_t __i) const
543 { return _Oper()(_M_expr1[__i], _M_expr2); }
545 size_t size() const { return _M_expr1.size(); }
548 const _Clos& _M_expr1;
552 template<class _Oper, class _Clos>
556 typedef typename _Clos::value_type _Vt;
557 typedef typename __fun<_Oper, _Vt>::result_type value_type;
559 _BinBase1(const _Vt& __t, const _Clos& __e)
560 : _M_expr1(__t), _M_expr2(__e) {}
562 value_type operator[](size_t __i) const
563 { return _Oper()(_M_expr1, _M_expr2[__i]); }
565 size_t size() const { return _M_expr2.size(); }
569 const _Clos& _M_expr2;
572 template<class _Oper, class _Dom1, class _Dom2>
573 struct _BinClos<_Oper, _Expr, _Expr, _Dom1, _Dom2>
574 : _BinBase<_Oper, _Dom1, _Dom2>
576 typedef _BinBase<_Oper, _Dom1, _Dom2> _Base;
577 typedef typename _Base::value_type value_type;
579 _BinClos(const _Dom1& __e1, const _Dom2& __e2) : _Base(__e1, __e2) {}
582 template<class _Oper, typename _Tp>
583 struct _BinClos<_Oper,_ValArray, _ValArray, _Tp, _Tp>
584 : _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> >
586 typedef _BinBase<_Oper, valarray<_Tp>, valarray<_Tp> > _Base;
587 typedef typename _Base::value_type value_type;
589 _BinClos(const valarray<_Tp>& __v, const valarray<_Tp>& __w)
593 template<class _Oper, class _Dom>
594 struct _BinClos<_Oper, _Expr, _ValArray, _Dom, typename _Dom::value_type>
595 : _BinBase<_Oper, _Dom, valarray<typename _Dom::value_type> >
597 typedef typename _Dom::value_type _Tp;
598 typedef _BinBase<_Oper,_Dom,valarray<_Tp> > _Base;
599 typedef typename _Base::value_type value_type;
601 _BinClos(const _Dom& __e1, const valarray<_Tp>& __e2)
602 : _Base(__e1, __e2) {}
605 template<class _Oper, class _Dom>
606 struct _BinClos<_Oper, _ValArray, _Expr, typename _Dom::value_type, _Dom>
607 : _BinBase<_Oper, valarray<typename _Dom::value_type>,_Dom>
609 typedef typename _Dom::value_type _Tp;
610 typedef _BinBase<_Oper, valarray<_Tp>, _Dom> _Base;
611 typedef typename _Base::value_type value_type;
613 _BinClos(const valarray<_Tp>& __e1, const _Dom& __e2)
614 : _Base(__e1, __e2) {}
617 template<class _Oper, class _Dom>
618 struct _BinClos<_Oper, _Expr, _Constant, _Dom, typename _Dom::value_type>
619 : _BinBase2<_Oper, _Dom>
621 typedef typename _Dom::value_type _Tp;
622 typedef _BinBase2<_Oper,_Dom> _Base;
623 typedef typename _Base::value_type value_type;
625 _BinClos(const _Dom& __e1, const _Tp& __e2) : _Base(__e1, __e2) {}
628 template<class _Oper, class _Dom>
629 struct _BinClos<_Oper, _Constant, _Expr, typename _Dom::value_type, _Dom>
630 : _BinBase1<_Oper, _Dom>
632 typedef typename _Dom::value_type _Tp;
633 typedef _BinBase1<_Oper, _Dom> _Base;
634 typedef typename _Base::value_type value_type;
636 _BinClos(const _Tp& __e1, const _Dom& __e2) : _Base(__e1, __e2) {}
639 template<class _Oper, typename _Tp>
640 struct _BinClos<_Oper, _ValArray, _Constant, _Tp, _Tp>
641 : _BinBase2<_Oper, valarray<_Tp> >
643 typedef _BinBase2<_Oper,valarray<_Tp> > _Base;
644 typedef typename _Base::value_type value_type;
646 _BinClos(const valarray<_Tp>& __v, const _Tp& __t) : _Base(__v, __t) {}
649 template<class _Oper, typename _Tp>
650 struct _BinClos<_Oper, _Constant, _ValArray, _Tp, _Tp>
651 : _BinBase1<_Oper, valarray<_Tp> >
653 typedef _BinBase1<_Oper, valarray<_Tp> > _Base;
654 typedef typename _Base::value_type value_type;
656 _BinClos(const _Tp& __t, const valarray<_Tp>& __v) : _Base(__t, __v) {}
660 // slice_array closure.
662 template<typename _Dom>
666 typedef typename _Dom::value_type value_type;
668 _SBase (const _Dom& __e, const slice& __s)
669 : _M_expr (__e), _M_slice (__s) {}
672 operator[] (size_t __i) const
673 { return _M_expr[_M_slice.start () + __i * _M_slice.stride ()]; }
677 { return _M_slice.size (); }
681 const slice& _M_slice;
684 template<typename _Tp>
685 class _SBase<_Array<_Tp> >
688 typedef _Tp value_type;
690 _SBase (_Array<_Tp> __a, const slice& __s)
691 : _M_array (__a._M_data+__s.start()), _M_size (__s.size()),
692 _M_stride (__s.stride()) {}
695 operator[] (size_t __i) const
696 { return _M_array._M_data[__i * _M_stride]; }
703 const _Array<_Tp> _M_array;
704 const size_t _M_size;
705 const size_t _M_stride;
709 struct _SClos<_Expr, _Dom>
712 typedef _SBase<_Dom> _Base;
713 typedef typename _Base::value_type value_type;
715 _SClos (const _Dom& __e, const slice& __s) : _Base (__e, __s) {}
718 template<typename _Tp>
719 struct _SClos<_ValArray, _Tp>
720 : _SBase<_Array<_Tp> >
722 typedef _SBase<_Array<_Tp> > _Base;
723 typedef _Tp value_type;
725 _SClos (_Array<_Tp> __a, const slice& __s) : _Base (__a, __s) {}
728 _GLIBCXX_END_NAMESPACE
730 #endif /* _CPP_VALARRAY_BEFORE_H */