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
      42
      43
      44
      45
      46
      47
      48
      49
      50
      51
      52
      53
      54
      55
      56
      57
      58
      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
      85
      86
      87
      88
      89
      90
      91
      92
      93
      94
      95
      96
      97
      98
      99
     100
     101
     102
     103
     104
     105
     106
     107
     108
     109
     110
     111
     112
     113
     114
     115
     116
     117
     118
     119
     120
     121
     122
     123
     124
     125
     126
     127
     128
     129
     130
     131
     132
     133
     134
     135
     136
     137
     138
     139
     140
     141
     142
     143
     144
     145
     146
     147
     148
     149
     150
     151
     152
     153
     154
     155
     156
     157
     158
     159
     160
     161
     162
/*
 *   Copyright (c) 2010, 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_BLAS_CLOSURES_PRUNEMATRIXCLOSURE_TCC
#define FLENS_BLAS_CLOSURES_PRUNEMATRIXCLOSURE_TCC 1

#include <flens/auxiliary/auxiliary.h>
#include <flens/blas/closures/auxiliary/prunematrixclosure.h>
#include <flens/typedefs.h>

namespace flens {

//-- General definition --------------------------------------------------------

template <typename Matrix>
template <typename ALPHA>
const ALPHA &
PruneMatrixClosure<Matrix>::updateScalingFactor(const ALPHA &alpha,
                                                const Matrix &)
{
    return alpha;
}

template <typename Matrix>
Transpose
PruneMatrixClosure<Matrix>::updateTranspose(Transpose trans)
{
    return trans;
}

template <typename Matrix>
typename ConstRef<typename PruneMatrixClosure<Matrix>::Remainder>::Type
PruneMatrixClosure<Matrix>::remainder(const Matrix &matrix)
{
    return matrix;
}

//-- Specialization for particular closures ------------------------------------
//-- Closure from alpha*A
template <typename L, typename R>
struct PruneMatrixClosure<MatrixClosure<OpMult, ScalarValue<L>, R> >
{
    typedef MatrixClosure<OpMult, ScalarValue<L>, R>  MC;

    typedef typename PruneMatrixClosure<R>::ScalingFactor  _ScalingFactor;
    typedef typename Promotion<L, _ScalingFactor>::Type    ScalingFactor;
    typedef typename PruneMatrixClosure<R>::Remainder      Remainder;

    template <typename ALPHA>
    static const typename Promotion<ALPHA, ScalingFactor>::Type
    updateScalingFactor(const ALPHA &alpha, const MC &mc)
    {
        typedef PruneMatrixClosure<R> PMC;
        return PMC::updateScalingFactor(alpha*mc.left().value(), mc.right());
    }

    static Transpose
    updateTranspose(Transpose trans)
    {
        return PruneMatrixClosure<R>::updateTranspose(trans);
    }

    static typename ConstRef<Remainder>::Type
    remainder(const MC &mc)
    {
        return PruneMatrixClosure<R>::remainder(mc.right());
    }
};

//-- Closure from transpose(A)
template <typename R>
struct PruneMatrixClosure<MatrixClosure<OpTrans, R, R> >
{
    typedef MatrixClosure<OpTrans, R, R>  MC;

    typedef typename PruneMatrixClosure<R>::ScalingFactor  ScalingFactor;
    typedef typename PruneMatrixClosure<R>::Remainder      Remainder;

    template <typename ALPHA>
    static const typename Promotion<ALPHA, ScalingFactor>::Type
    updateScalingFactor(const ALPHA &alpha, const MC &mc)
    {
        return PruneMatrixClosure<R>::updateScalingFactor(alpha, mc.right());
    }

    static Transpose
    updateTranspose(Transpose trans)
    {
        trans = PruneMatrixClosure<R>::updateTranspose(trans);
        return Transpose(trans^Trans);
    }

    static typename ConstRef<Remainder>::Type
    remainder(const MC &mc)
    {
        return PruneMatrixClosure<R>::remainder(mc.right());
    }
};

//-- Closure from conjugate(A)
template <typename R>
struct PruneMatrixClosure<MatrixClosure<OpConj, R, R> >
{
    typedef MatrixClosure<OpConj, R, R>  MC;

    typedef typename PruneMatrixClosure<R>::ScalingFactor  ScalingFactor;
    typedef typename PruneMatrixClosure<R>::Remainder      Remainder;

    template <typename ALPHA>
    static const typename Promotion<ALPHA, ScalingFactor>::Type
    updateScalingFactor(const ALPHA &alpha, const MC &mc)
    {
        return PruneMatrixClosure<R>::updateScalingFactor(alpha, mc.right());
    }

    static Transpose
    updateTranspose(Transpose trans)
    {
        trans = PruneMatrixClosure<R>::updateTranspose(trans);
        return Transpose(trans^Conj);
    }

    static typename ConstRef<Remainder>::Type
    remainder(const MC &mc)
    {
        return PruneMatrixClosure<R>::remainder(mc.right());
    }
};

// namespace flens

#endif // FLENS_BLAS_CLOSURES_PRUNEMATRIXCLOSURE_TCC