Home Browse Files
      1
      2
      3
      4
      5
      6
      7
      8
      9
     10
     11
     12
     13
     14
     15
     16
     17
     18
     19
     20
     21
     22
     23
     24
     25
     26
     27
     28
     29
     30
     31
     32
     33
     34
     35
     36
     37
     38
     39
     40
     41
<doc 42
     43
     44
     45
     46
     47
     48
     49
     50
     51
     52
<doc 53
     54
     55
<doc 56
     57
     58
<doc 59
     60
     61
     62
     63
     64
     65
     66
     67
     68
     69
     70
     71
     72
     73
     74
     75
     76
     77
     78
     79
     80
     81
     82
     83
     84
/*
 *   Copyright (c) 2007, Michael Lehn
 *
 *   All rights reserved.
 *
 *   Redistribution and use in source and binary forms, with or without
 *   modification, are permitted provided that the following conditions
 *   are met:
 *
 *   1) Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *   2) Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in
 *      the documentation and/or other materials provided with the
 *      distribution.
 *   3) Neither the name of the FLENS development group nor the names of
 *      its contributors may be used to endorse or promote products derived
 *      from this software without specific prior written permission.
 *
 *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef FLENS_MATRIXTYPES_IMPL_MATRIXCLOSURE_H
#define FLENS_MATRIXTYPES_IMPL_MATRIXCLOSURE_H 1

#include <flens/auxiliary/constref.h>
#include <flens/auxiliary/promotion.h>
#include <flens/matrixtypes/matrix.h>

namespace flens {

template <typename Op, typename L, typename R>
class MatrixClosure
    : public Matrix<MatrixClosure<Op, L, R> >
{
    public:
        typedef L  Left;
        typedef R  Right;

        typedef typename Promotion<typename L::ElementType,
                                   typename R::ElementType>::Type  ElementType;

        MatrixClosure(typename ConstRef<L>::Type l,
                      typename ConstRef<R>::Type r);

        typename ConstRef<L>::Type
        left() const;

        typename ConstRef<R>::Type
        right() const;

    private:
        typename ConstRef<L>::Type left_;
        typename ConstRef<R>::Type right_;
        // L left_;
        // R right_;
};

//
//  If an operand is a closure we need to keep a copy.  Otherwise we can not
//  do things like in the implementation of conjTrans, i.e. creating nested
//  closures inside on a function stack and then return it for later usage.
//

#ifndef GCC_HACK
    template <typename Op, typename L, typename R>
    struct ConstRef<MatrixClosure<Op, L, R> >
    {
        typedef MatrixClosure<Op,L,R> Type;
    };
#endif
} // namespace flens

#endif // FLENS_MATRIXTYPES_IMPL_MATRIXCLOSURE_H





































































































Home