1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342
|
/*
//
// Copyright 1997-2009 Torsten Rohlfing
//
// Copyright 2004-2013 SRI International
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit is free software: you can
// redistribute it and/or modify it under the terms of the GNU General Public
// License as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// The Computational Morphometry Toolkit is distributed in the hope that it
// will be useful, but WITHOUT ANY WARRANTY; without even the implied
// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#ifndef __cmtkMatrix_h_included_
#define __cmtkMatrix_h_included_
#include <cmtkconfig.h>
#include <string.h>
#include <vector>
#include <iostream>
#include <System/cmtkSmartPtr.h>
#include <System/cmtkMemory.h>
namespace
cmtk
{
/** \addtogroup Base */
//@{
/// Rekursive matrix template.
template<class TElement,size_t NDim>
class Matrix
{
public:
/// This class.
typedef Matrix<TElement,NDim> Self;
/// Superclass.
typedef Matrix<TElement,NDim-1> Superclass;
/// Public constructor.
Matrix( const size_t (&dims)[NDim] )
: m_SubMatrixArray( dims[0] )
{
}
/// Destructor.
~Matrix() {};
/// Element pointer type.
typedef typename Superclass::ElementPointerType* ElementPointerType;
typename Self::ElementPointerType& operator[]( const size_t idx )
{
return this->m_SubMatrixArray[idx];
}
const typename Self::ElementPointerType& operator[]( const size_t idx ) const
{
return this->m_SubMatrixArray[idx];
}
protected:
/// Recursive constructor.
Matrix() {};
private:
/// Vector of pointers to lower-dimensional sub-matrices.
std::vector<typename Self::ElementPointerType> m_SubMatrixArray;
}; // class Matrix
template<class TElement>
class Matrix<TElement,1>
{
};
/// Two-dimensional matrix template.
template<class T>
class Matrix2D :
/// For access, make this a vector of pointers.
public std::vector<T*>
{
public:
/// Superclass.
typedef std::vector<T*> Superclass;
/// This class.
typedef Matrix2D<T> Self;
/// Smart pointer to this class.
typedef SmartPointer<Self> SmartPtr;
/// Row vector type.
typedef std::vector<T*> RowVectorType;
/// Default constructor.
Matrix2D()
: Superclass( 1 )
{
this->m_NumberOfColumns = 0;
this->m_NumberOfRows = 0;
this->m_NumberOfElements = 0;
(*this)[0] = NULL;
}
/// Constructor: allocate and create cross-references.
Matrix2D( const size_t dims1, const size_t dims0, const T* dataPtr = NULL )
: Superclass( dims1 )
{
this->m_NumberOfColumns = dims0;
this->m_NumberOfRows = dims1;
this->m_NumberOfElements = dims0 * dims1;
(*this)[0] = Memory::ArrayC::Allocate<T>( this->m_NumberOfElements );
for ( size_t i = 1; i < this->m_NumberOfRows; ++i )
(*this)[i] = (*this)[i-1] + this->m_NumberOfColumns;
if ( dataPtr )
memcpy( (*this)[0], dataPtr, this->m_NumberOfElements * sizeof( T ) );
}
/// Copy constructor.
Matrix2D( const Matrix2D<T>& other ) :
Superclass( other.size() )
{
this->m_NumberOfColumns = other.m_NumberOfColumns;
this->m_NumberOfRows = other.m_NumberOfRows;
this->m_NumberOfElements = other.m_NumberOfElements;
(*this)[0] = Memory::ArrayC::Allocate<T>( this->m_NumberOfElements );
for ( size_t i = 1; i < this->m_NumberOfRows; ++i )
(*this)[i] = (*this)[i-1] + this->m_NumberOfColumns;
memcpy( (*this)[0], other[0], this->m_NumberOfElements * sizeof( T ) );
}
/// Destructor: free allocated array.
~Matrix2D()
{
if ( (*this)[0] )
{
Memory::ArrayC::Delete( (*this)[0] );
(*this)[0] = NULL;
}
}
/// Get number of rows.
size_t NumberOfRows() const
{
return this->m_NumberOfRows;
}
/** Get number of columns.
* Get this from underlying Array.
*/
size_t NumberOfColumns() const
{
return this->m_NumberOfColumns;
}
/// Resize the matrix.
void Resize( const size_t numberOfRows, const size_t numberOfColumns )
{
if ( (numberOfColumns != this->m_NumberOfColumns) ||
(numberOfRows != this->m_NumberOfRows) )
{
if ( (*this)[0] )
{
Memory::ArrayC::Delete( (*this)[0] );
(*this)[0] = NULL;
}
this->m_NumberOfColumns = numberOfColumns;
this->m_NumberOfRows = numberOfRows;
this->m_NumberOfElements = numberOfColumns * numberOfRows;
this->Superclass::resize( numberOfRows );
(*this)[0] = Memory::ArrayC::Allocate<T>( this->m_NumberOfElements );
for ( size_t i = 1; i < numberOfRows; ++i )
(*this)[i] = (*this)[i-1] + numberOfColumns;
}
}
/// Reset all values to zero.
void SetAllToZero()
{
memset( (*this)[0], 0, this->m_NumberOfElements * sizeof( T ) );
}
/// Set all values.
void SetAll( const T value)
{
for ( size_t i = 0; i < this->m_NumberOfElements; ++i )
{
(*this)[0][i] = value;
}
}
/// Copy another matrix.
Matrix2D<T>& operator= ( const Matrix2D<T>& other )
{
this->Resize( other.NumberOfColumns(), other.NumberOfRows() );
memcpy( (*this)[0], other[0], this->m_NumberOfElements * sizeof( T ) );
return *this;
}
private:
/// Size of the allocated array.
size_t m_NumberOfElements;
/// Number of rows.
size_t m_NumberOfColumns;
/// Number of rows.
size_t m_NumberOfRows;
};
/// Three-dimensional matrix template.
template<class T>
class Matrix3D :
/// For access, make this a 2-D matrix of pointers.
public Matrix2D<T*>
{
public:
/// This class.
typedef Matrix3D<T> Self;
/// Smart pointer.
typedef SmartPointer<Self> SmartPtr;
/// Superclass.
typedef Matrix2D<T*> Superclass;
/// Constructor: allocate and create cross-references.
Matrix3D<T>
( const size_t dims2, const size_t dims1, const size_t dims0 )
: Matrix2D<T*>( dims2, dims1 )
{
this->m_NumberOfPlanes = dims0;
this->m_NumberOfElements = dims0 * dims1 * dims2;
(*this)[0][0] = Memory::ArrayC::Allocate<T>( this->m_NumberOfElements );
for ( size_t j = 0; j < this->NumberOfRows(); ++j )
for ( size_t i = 0; i < this->NumberOfColumns(); ++i )
if ( i && j )
{
(*this)[i][j] = (*this)[0][0] + this->NumberOfRows() * ( i + this->NumberOfColumns() * j );
}
}
/// Return number of planes
size_t NumberOfPlanes() const
{
return this->m_NumberOfPlanes;
}
/// Resize the matrix.
void Resize( const size_t numberOfRows, const size_t numberOfColumns, const size_t numberOfPlanes )
{
if ( ( numberOfColumns != this->NumberOfColumns() ) ||
( numberOfRows != this->NumberOfRows() ) ||
( numberOfPlanes != this->NumberOfPlanes() ) )
{
if ( (*this)[0][0] )
{
Memory::ArrayC::Delete( (*this)[0][0] );
(*this)[0][0] = NULL;
}
this->m_NumberOfPlanes = numberOfPlanes;
this->m_NumberOfElements = numberOfPlanes * numberOfRows * numberOfColumns;
this->Superclass::Resize( numberOfRows, numberOfColumns );
(*this)[0][0] = Memory::ArrayC::Allocate<T>( this->m_NumberOfElements );
for ( size_t j = 0; j < this->NumberOfRows(); ++j )
for ( size_t i = 0; i < this->NumberOfColumns(); ++i )
if ( i && j )
{
(*this)[i][j] = (*this)[0][0] + this->NumberOfPlanes() * ( i + this->NumberOfColumns() * j );
}
}
}
/// Reset all values to zero.
void SetAllToZero()
{
memset( (*this)[0][0], 0, this->m_NumberOfElements * sizeof( T ) );
}
/// Set all values.
void SetAll( const T value)
{
for ( size_t i = 0; i < this->m_NumberOfElements; ++i )
{
(*this)[0][0][i] = value;
}
}
/// Copy another matrix.
Matrix2D<T>& operator= ( const Matrix2D<T>& other )
{
this->Resize( other.NumberOfColumns(), other.NumberOfRows(), other.NumberOfPlanes() );
memcpy( (*this)[0], other[0], this->m_NumberOfElements * sizeof( T ) );
return *this;
}
private:
/// Planes in the 3D matrix.
size_t m_NumberOfPlanes;
/// Number of matrix elements.
size_t m_NumberOfElements;
};
//@}
} // namespace cmtk
#endif // #ifndef __cmtkMatrix_h_included_
|