libcruft-util/matrix.ipp

155 lines
4.4 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>
const T*
util::matrix<S,T>::begin (void) const
{
return &(*this)[0][0];
}
//-----------------------------------------------------------------------------
template <size_t S, typename T>
const T*
util::matrix<S,T>::end (void) const
{
return &(*this)[S][0];
}
//-----------------------------------------------------------------------------
template <size_t S, typename T>
const T*
util::matrix<S,T>::cbegin (void) const
{
return begin ();
}
//-----------------------------------------------------------------------------
template <size_t S, typename T>
const T*
util::matrix<S,T>::cend (void) const
{
return end ();
}
//-----------------------------------------------------------------------------
template <size_t S, typename T>
T*
util::matrix<S,T>::begin (void)
{
return &(*this)[0][0];
}
//-----------------------------------------------------------------------------
template <size_t S, typename T>
T*
util::matrix<S,T>::end (void)
{
return &(*this)[S][0];
}
///////////////////////////////////////////////////////////////////////////////
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;
std::copy (cbegin (), cend (), std::begin (out));
return out;
}
2015-02-19 13:24:37 +11:00
2016-08-15 18:53:52 +10:00
///////////////////////////////////////////////////////////////////////////////
#define MATRIX_ELEMENT_OP(OP) \
template <size_t S, typename T> \
constexpr \
util::matrix<S,T> \
util::operator OP ( \
const util::matrix<S,T> &a, \
const util::matrix<S,T> &b) \
{ \
static_assert ( \
a.rows == b.rows && a.cols == b.cols, \
"matrix dimensions must match for elementwise operations" \
); \
\
util::matrix<S,T> res {}; \
\
for (size_t i = 0; i < a.rows; ++i) \
for (size_t j = 0; j < a.cols; ++j) \
res[i][j] = a[i][j] OP b[i][j]; \
\
return res; \
}
MATRIX_ELEMENT_OP(-)
MATRIX_ELEMENT_OP(+)
2016-08-15 18:44:27 +10:00
///////////////////////////////////////////////////////////////////////////////
template <size_t S, typename T>
util::matrix<S,T>
util::abs (const util::matrix<S,T> &src)
{
util::matrix<S,T> dst;
std::transform (std::cbegin (src), std::cend (src), std::begin (dst), util::abs<T>);
return dst;
2015-02-19 13:24:37 +11:00
}
///////////////////////////////////////////////////////////////////////////////
template <size_t S, typename T>
constexpr
T
util::sum (const util::matrix<S,T> &src)
{
return sum (std::cbegin (src), std::cend (src));
}