This is the Tiny Vector Matrix Expression Templates library found at http://tvmet.sourceforge.net. It is the fastest and most compact matrix lib out there (for < 10x10 matricies). I have done some minor tweaks to make it compile for mbed. For examples and hints on how to use, see: http://tvmet.sourceforge.net/usage.html

Dependents:   Eurobot_2012_Secondary

Committer:
madcowswe
Date:
Wed Mar 28 15:53:45 2012 +0000
Revision:
0:feb4117d16d8

        

Who changed what in which revision?

UserRevisionLine numberNew contents of line
madcowswe 0:feb4117d16d8 1 /*
madcowswe 0:feb4117d16d8 2 * Tiny Vector Matrix Library
madcowswe 0:feb4117d16d8 3 * Dense Vector Matrix Libary of Tiny size using Expression Templates
madcowswe 0:feb4117d16d8 4 *
madcowswe 0:feb4117d16d8 5 * Copyright (C) 2001 - 2007 Olaf Petzold <opetzold@users.sourceforge.net>
madcowswe 0:feb4117d16d8 6 *
madcowswe 0:feb4117d16d8 7 * This library is free software; you can redistribute it and/or
madcowswe 0:feb4117d16d8 8 * modify it under the terms of the GNU Lesser General Public
madcowswe 0:feb4117d16d8 9 * License as published by the Free Software Foundation; either
madcowswe 0:feb4117d16d8 10 * version 2.1 of the License, or (at your option) any later version.
madcowswe 0:feb4117d16d8 11 *
madcowswe 0:feb4117d16d8 12 * This library is distributed in the hope that it will be useful,
madcowswe 0:feb4117d16d8 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
madcowswe 0:feb4117d16d8 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
madcowswe 0:feb4117d16d8 15 * Lesser General Public License for more details.
madcowswe 0:feb4117d16d8 16 *
madcowswe 0:feb4117d16d8 17 * You should have received a copy of the GNU Lesser General Public
madcowswe 0:feb4117d16d8 18 * License along with this library; if not, write to the Free Software
madcowswe 0:feb4117d16d8 19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
madcowswe 0:feb4117d16d8 20 *
madcowswe 0:feb4117d16d8 21 * $Id: Gemmt.h,v 1.13 2007-06-23 15:58:59 opetzold Exp $
madcowswe 0:feb4117d16d8 22 */
madcowswe 0:feb4117d16d8 23
madcowswe 0:feb4117d16d8 24 #ifndef TVMET_META_GEMMT_H
madcowswe 0:feb4117d16d8 25 #define TVMET_META_GEMMT_H
madcowswe 0:feb4117d16d8 26
madcowswe 0:feb4117d16d8 27 #include <tvmet/xpr/Null.h>
madcowswe 0:feb4117d16d8 28
madcowswe 0:feb4117d16d8 29 namespace tvmet {
madcowswe 0:feb4117d16d8 30
madcowswe 0:feb4117d16d8 31 namespace meta {
madcowswe 0:feb4117d16d8 32
madcowswe 0:feb4117d16d8 33
madcowswe 0:feb4117d16d8 34 /**
madcowswe 0:feb4117d16d8 35 * \class gemmt Gemmt.h "tvmet/meta/Gemmt.h"
madcowswe 0:feb4117d16d8 36 * \brief Meta class for product matrix-transpose(matrix) operations.
madcowswe 0:feb4117d16d8 37 * using formula
madcowswe 0:feb4117d16d8 38 * \f[
madcowswe 0:feb4117d16d8 39 * M_1\,M_2^{T}
madcowswe 0:feb4117d16d8 40 * \f]
madcowswe 0:feb4117d16d8 41 * \note The rows of matrix 2 have to be equal to cols of matrix 1. The result
madcowswe 0:feb4117d16d8 42 * is a rows1 * cols2 matrix.
madcowswe 0:feb4117d16d8 43 */
madcowswe 0:feb4117d16d8 44 template<std::size_t Rows1, std::size_t Cols1,
madcowswe 0:feb4117d16d8 45 std::size_t Cols2,
madcowswe 0:feb4117d16d8 46 std::size_t K>
madcowswe 0:feb4117d16d8 47 class gemmt
madcowswe 0:feb4117d16d8 48 {
madcowswe 0:feb4117d16d8 49 gemmt();
madcowswe 0:feb4117d16d8 50 gemmt(const gemmt&);
madcowswe 0:feb4117d16d8 51 gemmt& operator=(const gemmt&);
madcowswe 0:feb4117d16d8 52
madcowswe 0:feb4117d16d8 53 private:
madcowswe 0:feb4117d16d8 54 enum {
madcowswe 0:feb4117d16d8 55 doIt = (K != Cols2 - 1) /**< recursive counter */
madcowswe 0:feb4117d16d8 56 };
madcowswe 0:feb4117d16d8 57
madcowswe 0:feb4117d16d8 58 public:
madcowswe 0:feb4117d16d8 59 template<class E1, class E2>
madcowswe 0:feb4117d16d8 60 static inline
madcowswe 0:feb4117d16d8 61 typename PromoteTraits<
madcowswe 0:feb4117d16d8 62 typename E1::value_type,
madcowswe 0:feb4117d16d8 63 typename E2::value_type
madcowswe 0:feb4117d16d8 64 >::value_type
madcowswe 0:feb4117d16d8 65 prod(const E1& lhs, const E2& rhs, std::size_t i, std::size_t j) {
madcowswe 0:feb4117d16d8 66 return lhs(i, K) * rhs(j, K)
madcowswe 0:feb4117d16d8 67 + gemmt<Rows1 * doIt, Cols1 * doIt,
madcowswe 0:feb4117d16d8 68 Cols2 * doIt,
madcowswe 0:feb4117d16d8 69 (K+1) * doIt>::prod(lhs, rhs, i, j);
madcowswe 0:feb4117d16d8 70 }
madcowswe 0:feb4117d16d8 71 };
madcowswe 0:feb4117d16d8 72
madcowswe 0:feb4117d16d8 73
madcowswe 0:feb4117d16d8 74 /**
madcowswe 0:feb4117d16d8 75 * \class gemmt<0,0,0,0> Gemmt.h "tvmet/meta/Gemmt.h"
madcowswe 0:feb4117d16d8 76 * \brief gemmt Specialized for recursion.
madcowswe 0:feb4117d16d8 77 */
madcowswe 0:feb4117d16d8 78 template<>
madcowswe 0:feb4117d16d8 79 class gemmt<0,0,0,0>
madcowswe 0:feb4117d16d8 80 {
madcowswe 0:feb4117d16d8 81 gemmt();
madcowswe 0:feb4117d16d8 82 gemmt(const gemmt&);
madcowswe 0:feb4117d16d8 83 gemmt& operator=(const gemmt&);
madcowswe 0:feb4117d16d8 84
madcowswe 0:feb4117d16d8 85 public:
madcowswe 0:feb4117d16d8 86 template<class E1, class E2>
madcowswe 0:feb4117d16d8 87 static inline
madcowswe 0:feb4117d16d8 88 XprNull prod(const E1&, const E2&, std::size_t, std::size_t) {
madcowswe 0:feb4117d16d8 89 return XprNull();
madcowswe 0:feb4117d16d8 90 }
madcowswe 0:feb4117d16d8 91 };
madcowswe 0:feb4117d16d8 92
madcowswe 0:feb4117d16d8 93
madcowswe 0:feb4117d16d8 94 } // namespace meta
madcowswe 0:feb4117d16d8 95
madcowswe 0:feb4117d16d8 96 } // namespace tvmet
madcowswe 0:feb4117d16d8 97
madcowswe 0:feb4117d16d8 98 #endif /* TVMET_META_GEMMT_H */
madcowswe 0:feb4117d16d8 99
madcowswe 0:feb4117d16d8 100 // Local Variables:
madcowswe 0:feb4117d16d8 101 // mode:C++
madcowswe 0:feb4117d16d8 102 // tab-width:8
madcowswe 0:feb4117d16d8 103 // End: