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: Matrix.h,v 1.26 2007-06-23 15:59:00 opetzold Exp $
madcowswe 0:feb4117d16d8 22 */
madcowswe 0:feb4117d16d8 23
madcowswe 0:feb4117d16d8 24 #ifndef TVMET_XPR_MATRIX_H
madcowswe 0:feb4117d16d8 25 #define TVMET_XPR_MATRIX_H
madcowswe 0:feb4117d16d8 26
madcowswe 0:feb4117d16d8 27 #include <tvmet/meta/Matrix.h>
madcowswe 0:feb4117d16d8 28 #include <tvmet/loop/Matrix.h>
madcowswe 0:feb4117d16d8 29
madcowswe 0:feb4117d16d8 30 namespace tvmet {
madcowswe 0:feb4117d16d8 31
madcowswe 0:feb4117d16d8 32
madcowswe 0:feb4117d16d8 33 /* forwards */
madcowswe 0:feb4117d16d8 34 template <class T, std::size_t Rows, std::size_t Cols> class Matrix;
madcowswe 0:feb4117d16d8 35
madcowswe 0:feb4117d16d8 36 /**
madcowswe 0:feb4117d16d8 37 * \class XprMatrix Matrix.h "tvmet/xpr/Matrix.h"
madcowswe 0:feb4117d16d8 38 * \brief Represents the expression for vectors at any node in the parse tree.
madcowswe 0:feb4117d16d8 39 *
madcowswe 0:feb4117d16d8 40 * Specifically, XprMatrix is the class that wraps the expression, and the
madcowswe 0:feb4117d16d8 41 * expression itself is represented by the template parameter E. The
madcowswe 0:feb4117d16d8 42 * class XprMatrix is known as an anonymizing expression wrapper because
madcowswe 0:feb4117d16d8 43 * it can hold any subexpression of arbitrary complexity, allowing
madcowswe 0:feb4117d16d8 44 * clients to work with any expression by holding on to it via the
madcowswe 0:feb4117d16d8 45 * wrapper, without having to know the name of the type object that
madcowswe 0:feb4117d16d8 46 * actually implements the expression.
madcowswe 0:feb4117d16d8 47 * \note leave the CCtors non-explicit to allow implicit type conversation.
madcowswe 0:feb4117d16d8 48 */
madcowswe 0:feb4117d16d8 49 template<class E, std::size_t NRows, std::size_t NCols>
madcowswe 0:feb4117d16d8 50 class XprMatrix
madcowswe 0:feb4117d16d8 51 : public TvmetBase< XprMatrix<E, NRows, NCols> >
madcowswe 0:feb4117d16d8 52 {
madcowswe 0:feb4117d16d8 53 XprMatrix();
madcowswe 0:feb4117d16d8 54 XprMatrix& operator=(const XprMatrix&);
madcowswe 0:feb4117d16d8 55
madcowswe 0:feb4117d16d8 56 public:
madcowswe 0:feb4117d16d8 57 /** Dimensions. */
madcowswe 0:feb4117d16d8 58 enum {
madcowswe 0:feb4117d16d8 59 Rows = NRows, /**< Number of rows. */
madcowswe 0:feb4117d16d8 60 Cols = NCols, /**< Number of cols. */
madcowswe 0:feb4117d16d8 61 Size = Rows * Cols /**< Complete Size of Matrix. */
madcowswe 0:feb4117d16d8 62 };
madcowswe 0:feb4117d16d8 63
madcowswe 0:feb4117d16d8 64 public:
madcowswe 0:feb4117d16d8 65 /** Complexity counter. */
madcowswe 0:feb4117d16d8 66 enum {
madcowswe 0:feb4117d16d8 67 ops_assign = Rows * Cols,
madcowswe 0:feb4117d16d8 68 ops = E::ops,
madcowswe 0:feb4117d16d8 69 use_meta = ops_assign < TVMET_COMPLEXITY_M_ASSIGN_TRIGGER ? true : false
madcowswe 0:feb4117d16d8 70 };
madcowswe 0:feb4117d16d8 71
madcowswe 0:feb4117d16d8 72 public:
madcowswe 0:feb4117d16d8 73 typedef typename E::value_type value_type;
madcowswe 0:feb4117d16d8 74
madcowswe 0:feb4117d16d8 75 public:
madcowswe 0:feb4117d16d8 76 /** Constructor. */
madcowswe 0:feb4117d16d8 77 explicit XprMatrix(const E& e)
madcowswe 0:feb4117d16d8 78 : m_expr(e)
madcowswe 0:feb4117d16d8 79 { }
madcowswe 0:feb4117d16d8 80
madcowswe 0:feb4117d16d8 81 /** Copy Constructor. Not explicit! */
madcowswe 0:feb4117d16d8 82 #if defined(TVMET_OPTIMIZE_XPR_MANUAL_CCTOR)
madcowswe 0:feb4117d16d8 83 XprMatrix(const XprMatrix& rhs)
madcowswe 0:feb4117d16d8 84 : m_expr(rhs.m_expr)
madcowswe 0:feb4117d16d8 85 { }
madcowswe 0:feb4117d16d8 86 #endif
madcowswe 0:feb4117d16d8 87
madcowswe 0:feb4117d16d8 88 /** access by index. */
madcowswe 0:feb4117d16d8 89 value_type operator()(std::size_t i, std::size_t j) const {
madcowswe 0:feb4117d16d8 90 TVMET_RT_CONDITION((i < Rows) && (j < Cols), "XprMatrix Bounce Violation")
madcowswe 0:feb4117d16d8 91 return m_expr(i, j);
madcowswe 0:feb4117d16d8 92 }
madcowswe 0:feb4117d16d8 93
madcowswe 0:feb4117d16d8 94 private:
madcowswe 0:feb4117d16d8 95 /** Wrapper for meta assign. */
madcowswe 0:feb4117d16d8 96 template<class Dest, class Src, class Assign>
madcowswe 0:feb4117d16d8 97 static inline
madcowswe 0:feb4117d16d8 98 void do_assign(dispatch<true>, Dest& dest, const Src& src, const Assign& assign_fn) {
madcowswe 0:feb4117d16d8 99 meta::Matrix<Rows, Cols, 0, 0>::assign(dest, src, assign_fn);
madcowswe 0:feb4117d16d8 100 }
madcowswe 0:feb4117d16d8 101
madcowswe 0:feb4117d16d8 102 /** Wrapper for loop assign. */
madcowswe 0:feb4117d16d8 103 template<class Dest, class Src, class Assign>
madcowswe 0:feb4117d16d8 104 static inline
madcowswe 0:feb4117d16d8 105 void do_assign(dispatch<false>, Dest& dest, const Src& src, const Assign& assign_fn) {
madcowswe 0:feb4117d16d8 106 loop::Matrix<Rows, Cols>::assign(dest, src, assign_fn);
madcowswe 0:feb4117d16d8 107 }
madcowswe 0:feb4117d16d8 108
madcowswe 0:feb4117d16d8 109 public:
madcowswe 0:feb4117d16d8 110 /** assign this expression to Matrix dest. */
madcowswe 0:feb4117d16d8 111 template<class Dest, class Assign>
madcowswe 0:feb4117d16d8 112 void assign_to(Dest& dest, const Assign& assign_fn) const {
madcowswe 0:feb4117d16d8 113 /* here is a way for caching, since each complex 'Node'
madcowswe 0:feb4117d16d8 114 is of type XprMatrix. */
madcowswe 0:feb4117d16d8 115 do_assign(dispatch<use_meta>(), dest, *this, assign_fn);
madcowswe 0:feb4117d16d8 116 }
madcowswe 0:feb4117d16d8 117
madcowswe 0:feb4117d16d8 118 public: // debugging Xpr parse tree
madcowswe 0:feb4117d16d8 119 void print_xpr(std::ostream& os, std::size_t l=0) const {
madcowswe 0:feb4117d16d8 120 os << IndentLevel(l++)
madcowswe 0:feb4117d16d8 121 << "XprMatrix["
madcowswe 0:feb4117d16d8 122 << (use_meta ? "M" : "L") << ", O=" << ops << "]<"
madcowswe 0:feb4117d16d8 123 << std::endl;
madcowswe 0:feb4117d16d8 124 m_expr.print_xpr(os, l);
madcowswe 0:feb4117d16d8 125 os << IndentLevel(l)
madcowswe 0:feb4117d16d8 126 << "R=" << Rows << ", C=" << Cols << std::endl;
madcowswe 0:feb4117d16d8 127 os << IndentLevel(--l) << ">"
madcowswe 0:feb4117d16d8 128 << ((l != 0) ? "," : "") << std::endl;
madcowswe 0:feb4117d16d8 129 }
madcowswe 0:feb4117d16d8 130
madcowswe 0:feb4117d16d8 131 private:
madcowswe 0:feb4117d16d8 132 const E m_expr;
madcowswe 0:feb4117d16d8 133 };
madcowswe 0:feb4117d16d8 134
madcowswe 0:feb4117d16d8 135
madcowswe 0:feb4117d16d8 136 } // namespace tvmet
madcowswe 0:feb4117d16d8 137
madcowswe 0:feb4117d16d8 138 #include <tvmet/Functional.h>
madcowswe 0:feb4117d16d8 139
madcowswe 0:feb4117d16d8 140 #include <tvmet/xpr/BinOperator.h>
madcowswe 0:feb4117d16d8 141 #include <tvmet/xpr/UnOperator.h>
madcowswe 0:feb4117d16d8 142 #include <tvmet/xpr/Literal.h>
madcowswe 0:feb4117d16d8 143
madcowswe 0:feb4117d16d8 144 #include <tvmet/xpr/Identity.h>
madcowswe 0:feb4117d16d8 145
madcowswe 0:feb4117d16d8 146 #include <tvmet/xpr/MMProduct.h>
madcowswe 0:feb4117d16d8 147 #include <tvmet/xpr/MMProductTransposed.h>
madcowswe 0:feb4117d16d8 148 #include <tvmet/xpr/MMtProduct.h>
madcowswe 0:feb4117d16d8 149 #include <tvmet/xpr/MtMProduct.h>
madcowswe 0:feb4117d16d8 150 #include <tvmet/xpr/MVProduct.h>
madcowswe 0:feb4117d16d8 151 #include <tvmet/xpr/MtVProduct.h>
madcowswe 0:feb4117d16d8 152 #include <tvmet/xpr/MatrixTranspose.h>
madcowswe 0:feb4117d16d8 153
madcowswe 0:feb4117d16d8 154 #include <tvmet/xpr/MatrixFunctions.h>
madcowswe 0:feb4117d16d8 155 #include <tvmet/xpr/MatrixBinaryFunctions.h>
madcowswe 0:feb4117d16d8 156 #include <tvmet/xpr/MatrixUnaryFunctions.h>
madcowswe 0:feb4117d16d8 157 #include <tvmet/xpr/MatrixOperators.h>
madcowswe 0:feb4117d16d8 158 #include <tvmet/xpr/Eval.h>
madcowswe 0:feb4117d16d8 159
madcowswe 0:feb4117d16d8 160 #endif // TVMET_XPR_MATRIX_H
madcowswe 0:feb4117d16d8 161
madcowswe 0:feb4117d16d8 162 // Local Variables:
madcowswe 0:feb4117d16d8 163 // mode:C++
madcowswe 0:feb4117d16d8 164 // tab-width:8
madcowswe 0:feb4117d16d8 165 // End: