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
meta/Vector.h@0:feb4117d16d8, 2012-03-28 (annotated)
- Committer:
- madcowswe
- Date:
- Wed Mar 28 15:53:45 2012 +0000
- Revision:
- 0:feb4117d16d8
Who changed what in which revision?
User | Revision | Line number | New 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: Vector.h,v 1.24 2007-06-23 15:58:59 opetzold Exp $ |
madcowswe | 0:feb4117d16d8 | 22 | */ |
madcowswe | 0:feb4117d16d8 | 23 | |
madcowswe | 0:feb4117d16d8 | 24 | #ifndef TVMET_META_VECTOR_H |
madcowswe | 0:feb4117d16d8 | 25 | #define TVMET_META_VECTOR_H |
madcowswe | 0:feb4117d16d8 | 26 | |
madcowswe | 0:feb4117d16d8 | 27 | #include <tvmet/NumericTraits.h> |
madcowswe | 0:feb4117d16d8 | 28 | #include <tvmet/xpr/Null.h> |
madcowswe | 0:feb4117d16d8 | 29 | |
madcowswe | 0:feb4117d16d8 | 30 | namespace tvmet { |
madcowswe | 0:feb4117d16d8 | 31 | |
madcowswe | 0:feb4117d16d8 | 32 | /* forwards */ |
madcowswe | 0:feb4117d16d8 | 33 | template<class T, std::size_t Sz> class Vector; |
madcowswe | 0:feb4117d16d8 | 34 | |
madcowswe | 0:feb4117d16d8 | 35 | |
madcowswe | 0:feb4117d16d8 | 36 | namespace meta { |
madcowswe | 0:feb4117d16d8 | 37 | |
madcowswe | 0:feb4117d16d8 | 38 | |
madcowswe | 0:feb4117d16d8 | 39 | /** |
madcowswe | 0:feb4117d16d8 | 40 | * \class Vector Vector.h "tvmet/meta/Vector.h" |
madcowswe | 0:feb4117d16d8 | 41 | * \brief Meta %Vector class using expression templates |
madcowswe | 0:feb4117d16d8 | 42 | */ |
madcowswe | 0:feb4117d16d8 | 43 | template<std::size_t Sz, std::size_t K=0> |
madcowswe | 0:feb4117d16d8 | 44 | class Vector |
madcowswe | 0:feb4117d16d8 | 45 | { |
madcowswe | 0:feb4117d16d8 | 46 | Vector(); |
madcowswe | 0:feb4117d16d8 | 47 | Vector(const Vector&); |
madcowswe | 0:feb4117d16d8 | 48 | Vector& operator=(const Vector&); |
madcowswe | 0:feb4117d16d8 | 49 | |
madcowswe | 0:feb4117d16d8 | 50 | private: |
madcowswe | 0:feb4117d16d8 | 51 | enum { |
madcowswe | 0:feb4117d16d8 | 52 | doIt = (K < (Sz-1)) ? 1 : 0 /**< recursive counter */ |
madcowswe | 0:feb4117d16d8 | 53 | }; |
madcowswe | 0:feb4117d16d8 | 54 | |
madcowswe | 0:feb4117d16d8 | 55 | public: |
madcowswe | 0:feb4117d16d8 | 56 | /** assign an expression expr using the functional assign_fn. */ |
madcowswe | 0:feb4117d16d8 | 57 | template <class Dest, class Src, class Assign> |
madcowswe | 0:feb4117d16d8 | 58 | static inline |
madcowswe | 0:feb4117d16d8 | 59 | void assign(Dest& lhs, const Src& rhs, const Assign& assign_fn) { |
madcowswe | 0:feb4117d16d8 | 60 | assign_fn.apply_on(lhs(K), rhs(K)); |
madcowswe | 0:feb4117d16d8 | 61 | meta::Vector<Sz * doIt, (K+1) * doIt>::assign(lhs, rhs, assign_fn); |
madcowswe | 0:feb4117d16d8 | 62 | } |
madcowswe | 0:feb4117d16d8 | 63 | |
madcowswe | 0:feb4117d16d8 | 64 | /** build the sum of the vector. */ |
madcowswe | 0:feb4117d16d8 | 65 | template<class E> |
madcowswe | 0:feb4117d16d8 | 66 | static inline |
madcowswe | 0:feb4117d16d8 | 67 | typename E::value_type |
madcowswe | 0:feb4117d16d8 | 68 | sum(const E& e) { |
madcowswe | 0:feb4117d16d8 | 69 | return e(K) + meta::Vector<Sz * doIt, (K+1) * doIt>::sum(e); |
madcowswe | 0:feb4117d16d8 | 70 | } |
madcowswe | 0:feb4117d16d8 | 71 | |
madcowswe | 0:feb4117d16d8 | 72 | /** build the product of the vector. */ |
madcowswe | 0:feb4117d16d8 | 73 | template<class E> |
madcowswe | 0:feb4117d16d8 | 74 | static inline |
madcowswe | 0:feb4117d16d8 | 75 | typename NumericTraits< |
madcowswe | 0:feb4117d16d8 | 76 | typename E::value_type |
madcowswe | 0:feb4117d16d8 | 77 | >::sum_type |
madcowswe | 0:feb4117d16d8 | 78 | product(const E& e) { |
madcowswe | 0:feb4117d16d8 | 79 | return e(K) * meta::Vector<Sz * doIt, (K+1) * doIt>::product(e); |
madcowswe | 0:feb4117d16d8 | 80 | } |
madcowswe | 0:feb4117d16d8 | 81 | |
madcowswe | 0:feb4117d16d8 | 82 | /** build the dot product of the vector. */ |
madcowswe | 0:feb4117d16d8 | 83 | template<class Dest, class Src> |
madcowswe | 0:feb4117d16d8 | 84 | static inline |
madcowswe | 0:feb4117d16d8 | 85 | typename PromoteTraits< |
madcowswe | 0:feb4117d16d8 | 86 | typename Dest::value_type, |
madcowswe | 0:feb4117d16d8 | 87 | typename Src::value_type |
madcowswe | 0:feb4117d16d8 | 88 | >::value_type |
madcowswe | 0:feb4117d16d8 | 89 | dot(const Dest& lhs, const Src& rhs) { |
madcowswe | 0:feb4117d16d8 | 90 | return lhs(K) * rhs(K) |
madcowswe | 0:feb4117d16d8 | 91 | + meta::Vector<Sz * doIt, (K+1) * doIt>::dot(lhs, rhs); |
madcowswe | 0:feb4117d16d8 | 92 | } |
madcowswe | 0:feb4117d16d8 | 93 | |
madcowswe | 0:feb4117d16d8 | 94 | /** check for all elements */ |
madcowswe | 0:feb4117d16d8 | 95 | template<class E> |
madcowswe | 0:feb4117d16d8 | 96 | static inline |
madcowswe | 0:feb4117d16d8 | 97 | bool |
madcowswe | 0:feb4117d16d8 | 98 | all_elements(const E& e) { |
madcowswe | 0:feb4117d16d8 | 99 | if(!e(K)) return false; |
madcowswe | 0:feb4117d16d8 | 100 | return meta::Vector<Sz * doIt, (K+1) * doIt>::all_elements(e); |
madcowswe | 0:feb4117d16d8 | 101 | } |
madcowswe | 0:feb4117d16d8 | 102 | |
madcowswe | 0:feb4117d16d8 | 103 | /** check for any elements */ |
madcowswe | 0:feb4117d16d8 | 104 | template<class E> |
madcowswe | 0:feb4117d16d8 | 105 | static inline |
madcowswe | 0:feb4117d16d8 | 106 | bool |
madcowswe | 0:feb4117d16d8 | 107 | any_elements(const E& e) { |
madcowswe | 0:feb4117d16d8 | 108 | if(e(K)) return true; |
madcowswe | 0:feb4117d16d8 | 109 | return meta::Vector<Sz * doIt, (K+1) * doIt>::any_elements(e); |
madcowswe | 0:feb4117d16d8 | 110 | } |
madcowswe | 0:feb4117d16d8 | 111 | }; |
madcowswe | 0:feb4117d16d8 | 112 | |
madcowswe | 0:feb4117d16d8 | 113 | |
madcowswe | 0:feb4117d16d8 | 114 | /** |
madcowswe | 0:feb4117d16d8 | 115 | * \class Vector<0,0> Vector.h "tvmet/meta/Vector.h" |
madcowswe | 0:feb4117d16d8 | 116 | * \brief Meta %Vector Specialized for recursion |
madcowswe | 0:feb4117d16d8 | 117 | */ |
madcowswe | 0:feb4117d16d8 | 118 | template<> |
madcowswe | 0:feb4117d16d8 | 119 | class Vector<0,0> |
madcowswe | 0:feb4117d16d8 | 120 | { |
madcowswe | 0:feb4117d16d8 | 121 | Vector(); |
madcowswe | 0:feb4117d16d8 | 122 | Vector(const Vector&); |
madcowswe | 0:feb4117d16d8 | 123 | Vector& operator=(const Vector&); |
madcowswe | 0:feb4117d16d8 | 124 | |
madcowswe | 0:feb4117d16d8 | 125 | public: |
madcowswe | 0:feb4117d16d8 | 126 | template <class Dest, class Src, class Assign> |
madcowswe | 0:feb4117d16d8 | 127 | static inline void assign(Dest&, const Src&, const Assign&) { } |
madcowswe | 0:feb4117d16d8 | 128 | |
madcowswe | 0:feb4117d16d8 | 129 | template<class E> |
madcowswe | 0:feb4117d16d8 | 130 | static inline XprNull sum(const E&) { return XprNull(); } |
madcowswe | 0:feb4117d16d8 | 131 | |
madcowswe | 0:feb4117d16d8 | 132 | template<class E> |
madcowswe | 0:feb4117d16d8 | 133 | static inline XprNull product(const E&) { return XprNull(); } |
madcowswe | 0:feb4117d16d8 | 134 | |
madcowswe | 0:feb4117d16d8 | 135 | template<class Dest, class Src> |
madcowswe | 0:feb4117d16d8 | 136 | static inline XprNull dot(const Dest&, const Src&) { return XprNull(); } |
madcowswe | 0:feb4117d16d8 | 137 | |
madcowswe | 0:feb4117d16d8 | 138 | template<class E> |
madcowswe | 0:feb4117d16d8 | 139 | static inline bool all_elements(const E&) { return true; } |
madcowswe | 0:feb4117d16d8 | 140 | |
madcowswe | 0:feb4117d16d8 | 141 | template<class E> |
madcowswe | 0:feb4117d16d8 | 142 | static inline bool any_elements(const E&) { return false; } |
madcowswe | 0:feb4117d16d8 | 143 | }; |
madcowswe | 0:feb4117d16d8 | 144 | |
madcowswe | 0:feb4117d16d8 | 145 | |
madcowswe | 0:feb4117d16d8 | 146 | } // namespace meta |
madcowswe | 0:feb4117d16d8 | 147 | |
madcowswe | 0:feb4117d16d8 | 148 | } // namespace tvmet |
madcowswe | 0:feb4117d16d8 | 149 | |
madcowswe | 0:feb4117d16d8 | 150 | #endif /* TVMET_META_VECTOR_H */ |
madcowswe | 0:feb4117d16d8 | 151 | |
madcowswe | 0:feb4117d16d8 | 152 | // Local Variables: |
madcowswe | 0:feb4117d16d8 | 153 | // mode:C++ |
madcowswe | 0:feb4117d16d8 | 154 | // tab-width:8 |
madcowswe | 0:feb4117d16d8 | 155 | // End: |