libcruft-util/matrix.ipp

123 lines
3.1 KiB
Plaintext
Raw Normal View History

2015-02-19 13:24:37 +11:00
/*
2015-04-13 18:05:28 +10:00
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
2015-02-19 13:24:37 +11:00
*
2015-04-13 18:05:28 +10:00
* http://www.apache.org/licenses/LICENSE-2.0
2015-02-19 13:24:37 +11:00
*
2015-04-13 18:05:28 +10:00
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
2015-02-19 13:24:37 +11:00
*
2015-10-30 23:40:13 +11:00
* Copyright 2011-2015 Danny Robson <danny@nerdcruft.net>
2015-02-19 13:24:37 +11:00
*/
#ifdef __UTIL_MATRIX_IPP
#error
#endif
#define __UTIL_MATRIX_IPP
///////////////////////////////////////////////////////////////////////////////
template <size_t S, typename T>
T*
util::matrix<S,T>::operator[] (size_t idx)
{
return this->values[idx];
}
//-----------------------------------------------------------------------------
template <size_t S, typename T>
const T*
util::matrix<S,T>::operator[] (size_t idx) const
{
return this->values[idx];
}
///////////////////////////////////////////////////////////////////////////////
//template <size_t S, typename T>
//vector<3,T>
//matrix<S,T>::operator* (vector<3,T> v) const
//{
// return (
// *this * v.template homog<S> ()
// ).template redim<3> ();
//}
//
//
////-----------------------------------------------------------------------------
//template <size_t S, typename T>
//point<3,T>
//matrix<S,T>::operator* (point<3,T> p) const
//{
// return (*this * p.template homog<S> ()).template redim<3> ();
//}
//
///////////////////////////////////////////////////////////////////////////////
2015-10-30 23:40:13 +11:00
template <size_t S, typename T>
2015-02-19 13:24:37 +11:00
template <typename U>
2015-10-30 23:40:13 +11:00
util::matrix<S,U>
util::matrix<S,T>::cast (void) const
2015-02-19 13:24:37 +11:00
{
2015-10-30 23:40:13 +11:00
util::matrix<S,U> out;
2015-02-19 13:24:37 +11:00
for (size_t i = 0; i < rows; ++i)
for (size_t j = 0; j < cols; ++j)
out.values[i][j] = values[i][j];
return out;
}
/////////////////////////////////////////////////////////////////////////////////
//template <size_t S, typename T>
//T
//util::matrix<S,T>::determinant (void) const
//{
// return util::determinant (*this);
//}
//
//
////-----------------------------------------------------------------------------
//template <size_t S, typename T>
//util::matrix<S,T>
//util::matrix<S,T>::inverse (void) const
//{
// return util::inverse (*this);
//}
///////////////////////////////////////////////////////////////////////////////
//template <size_t S, typename T>
//util::matrix<S,T>
//util::matrix<S,T>::operator/ (T t) const
//{
// auto out = *this;
//
// for (auto &i: out.values)
// for (auto &j: i)
// j /= t;
//
// return out;
//}
//
//
/////////////////////////////////////////////////////////////////////////////////
//template <size_t S, typename T>
//bool
//util::matrix<S,T>::operator== (const matrix<S,T> &m) const
//{
// for (size_t i = 0; i < S; ++i)
// for (size_t j = 0; j < S; ++j)
// if (!exactly_equal (values[i][j], m[i][j]))
// return false;
// return true;
//}