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: Random.h,v 1.7 2007-06-23 15:58:59 opetzold Exp $
madcowswe 0:feb4117d16d8 22 */
madcowswe 0:feb4117d16d8 23
madcowswe 0:feb4117d16d8 24 #ifndef TVMET_UTIL_RANDOM_H
madcowswe 0:feb4117d16d8 25 #define TVMET_UTIL_RANDOM_H
madcowswe 0:feb4117d16d8 26
madcowswe 0:feb4117d16d8 27 #include <tvmet/CompileTimeError.h>
madcowswe 0:feb4117d16d8 28
madcowswe 0:feb4117d16d8 29 namespace tvmet {
madcowswe 0:feb4117d16d8 30
madcowswe 0:feb4117d16d8 31 namespace util {
madcowswe 0:feb4117d16d8 32
madcowswe 0:feb4117d16d8 33
madcowswe 0:feb4117d16d8 34 /**
madcowswe 0:feb4117d16d8 35 * \class Random Random.h "tvmet/util/Random.h"
madcowswe 0:feb4117d16d8 36 * \brief A simple random class.
madcowswe 0:feb4117d16d8 37 * On each access this class returns a new random number using
madcowswe 0:feb4117d16d8 38 * std::rand(). The range generated is templated by MIN and
madcowswe 0:feb4117d16d8 39 * MAX.
madcowswe 0:feb4117d16d8 40 * \ingroup _util_function
madcowswe 0:feb4117d16d8 41 *
madcowswe 0:feb4117d16d8 42 * \par Example:
madcowswe 0:feb4117d16d8 43 * \code
madcowswe 0:feb4117d16d8 44 * #include <algorithm>
madcowswe 0:feb4117d16d8 45 *
madcowswe 0:feb4117d16d8 46 * tvmet::Random<int, 0, 100> random;
madcowswe 0:feb4117d16d8 47 *
madcowswe 0:feb4117d16d8 48 * std::generate(m1.begin(), m1.end(), random());
madcowswe 0:feb4117d16d8 49 * \endcode
madcowswe 0:feb4117d16d8 50 */
madcowswe 0:feb4117d16d8 51 template<class T, int MIN=0, int MAX=100>
madcowswe 0:feb4117d16d8 52 class Random {
madcowswe 0:feb4117d16d8 53 static unsigned int s_seed;
madcowswe 0:feb4117d16d8 54 public:
madcowswe 0:feb4117d16d8 55 typedef T value_type;
madcowswe 0:feb4117d16d8 56 Random() { TVMET_CT_CONDITION(MIN<MAX, wrong_random_range) }
madcowswe 0:feb4117d16d8 57 value_type operator()() {
madcowswe 0:feb4117d16d8 58 s_seed += (unsigned)std::time(0);
madcowswe 0:feb4117d16d8 59 std::srand(s_seed);
madcowswe 0:feb4117d16d8 60 return MIN + int(double(MAX) * std::rand()/(double(RAND_MAX)+1.0));
madcowswe 0:feb4117d16d8 61 }
madcowswe 0:feb4117d16d8 62 };
madcowswe 0:feb4117d16d8 63 // instance
madcowswe 0:feb4117d16d8 64 template<class T, int MIN, int MAX>
madcowswe 0:feb4117d16d8 65 unsigned int Random<T, MIN, MAX>::s_seed;
madcowswe 0:feb4117d16d8 66
madcowswe 0:feb4117d16d8 67
madcowswe 0:feb4117d16d8 68 #if defined(TVMET_HAVE_COMPLEX)
madcowswe 0:feb4117d16d8 69 /**
madcowswe 0:feb4117d16d8 70 * \class Random< std::complex<T> > Random.h "tvmet/util/Random.h"
madcowswe 0:feb4117d16d8 71 * \brief Specialized Random class.
madcowswe 0:feb4117d16d8 72 * \ingroup _util_function
madcowswe 0:feb4117d16d8 73 */
madcowswe 0:feb4117d16d8 74 template<class T, int MIN=0, int MAX=100>
madcowswe 0:feb4117d16d8 75 class Random {
madcowswe 0:feb4117d16d8 76 static unsigned int s_seed;
madcowswe 0:feb4117d16d8 77 public:
madcowswe 0:feb4117d16d8 78 typedef std::complex<T> value_type;
madcowswe 0:feb4117d16d8 79 Random() { TVMET_CT_CONDITION(MIN<MAX, wrong_random_range) }
madcowswe 0:feb4117d16d8 80 value_type operator()() {
madcowswe 0:feb4117d16d8 81 s_seed += (unsigned)std::time(0);
madcowswe 0:feb4117d16d8 82 std::srand(s_seed);
madcowswe 0:feb4117d16d8 83 return MIN + int(double(MAX) * std::rand()/(double(RAND_MAX)+1.0));
madcowswe 0:feb4117d16d8 84 }
madcowswe 0:feb4117d16d8 85 };
madcowswe 0:feb4117d16d8 86 // instance
madcowswe 0:feb4117d16d8 87 template<class T, int MIN, int MAX>
madcowswe 0:feb4117d16d8 88 unsigned int Random<std::complex<T>, MIN, MAX>::s_seed;
madcowswe 0:feb4117d16d8 89 #endif // defined(TVMET_HAVE_COMPLEX)
madcowswe 0:feb4117d16d8 90
madcowswe 0:feb4117d16d8 91
madcowswe 0:feb4117d16d8 92 } // namespace util
madcowswe 0:feb4117d16d8 93
madcowswe 0:feb4117d16d8 94 } // namespace tvmet
madcowswe 0:feb4117d16d8 95
madcowswe 0:feb4117d16d8 96 #endif // TVMET_UTIL_RANDOM_H
madcowswe 0:feb4117d16d8 97
madcowswe 0:feb4117d16d8 98 // Local Variables:
madcowswe 0:feb4117d16d8 99 // mode:C++
madcowswe 0:feb4117d16d8 100 // tab-width:8
madcowswe 0:feb4117d16d8 101 // End: