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 |
/*
* 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 CXXBLAS_LEVEL1EXTENSIONS_TRCOPY_TCC #define CXXBLAS_LEVEL1EXTENSIONS_TRCOPY_TCC 1 #include <algorithm> #include <cassert> #include <cxxblas/cxxblas.h> namespace cxxblas { // // B = A or B = A^T // template <typename IndexType, typename MA, typename MB> void trcopy(StorageOrder order, StorageUpLo upLo, Transpose trans, Diag diag, IndexType m, IndexType n, const MA *A, IndexType ldA, MB *B, IndexType ldB) { CXXBLAS_DEBUG_OUT("trcopy_generic"); using std::min; // TODO: implement complex cases B = conj(A) and B = A^H ASSERT(trans==NoTrans || trans==Trans); if (order==RowMajor) { ASSERT(0); } if (diag==NonUnit) { if (trans==NoTrans) { if (upLo==Upper) { for (IndexType j=0; j<n; ++j) { copy(min(j+1,m), A+j*ldA, IndexType(1), B+j*ldB, IndexType(1)); } } else { for (IndexType j=0; j<min(m,n); ++j) { copy(m-j, A+j*(ldA+1), IndexType(1), B+j*(ldB+1), IndexType(1)); } } } else if (trans==Trans) { if (upLo==Upper) { for (IndexType j=0; j<n; ++j) { copy(min(j+1,m), A+j, ldA, B+j*ldB, IndexType(1)); } } else { for (IndexType j=0; j<min(m,n); ++j) { copy(m-j, A+j*(ldA+1), ldA, B+j*(ldB+1), IndexType(1)); } } } else { // TODO: implement this case ASSERT(0); } } else { if (trans==NoTrans) { if (upLo==Upper) { for (IndexType j=0; j<n; ++j) { copy(min(j,m), A+j*ldA, IndexType(1), B+j*ldB, IndexType(1)); } } else { for (IndexType j=0; j<min(m,n); ++j) { copy(m-j-1, A+j*(ldA+1)+1, IndexType(1), B+j*(ldB+1)+1, IndexType(1)); } } } else { // TODO: implement this case ASSERT(0); } } } } // namespace cxxblas #endif // CXXBLAS_LEVEL1EXTENSIONS_TRCOPY_TCC |