/*************************************************************************** * blitz/matltri.h Declarations for LowerTriangular matrices * * $Id: matltri.h,v 1.1.1.1 1999-04-09 17:59:00 ansari Exp $ * * Copyright (C) 1997,1998 Todd Veldhuizen * * This program 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 2 * of the License, or (at your option) any later version. * * This program 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. * * Suggestions: blitz-suggest@cybervision.com * Bugs: blitz-bugs@cybervision.com * * For more information, please see the Blitz++ Home Page: * http://seurat.uwaterloo.ca/blitz/ * *************************************************************************** * $Log: not supported by cvs2svn $ * Revision 1.3 1998/03/14 00:04:47 tveldhui * 0.2-alpha-05 * * Revision 1.2 1997/01/24 14:42:00 tveldhui * Periodic RCS update * * Revision 1.1 1997/01/13 22:19:58 tveldhui * Periodic RCS update * * */ #ifndef BZ_MATLTRI_H #define BZ_MATLTRI_H #ifndef BZ_MSTRUCT_H #error must be included via #endif BZ_NAMESPACE(blitz) // Lower triangular, row major ordering // [ 0 . . . ] // [ 1 2 . . ] // [ 3 4 5 . ] // [ 6 7 8 9 ] class LowerTriangularIterator { public: LowerTriangularIterator(unsigned rows, unsigned cols) { BZPRECONDITION(rows == cols); size_ = rows; good_ = true; offset_ = 0; i_ = 0; j_ = 0; } operator _bz_bool() const { return good_; } void operator++() { BZPRECONDITION(good_); ++offset_; ++j_; if (j_ > i_) { j_ = 0; ++i_; if (i_ == size_) good_ = false; } } unsigned row() const { return i_; } unsigned col() const { return j_; } unsigned offset() const { return offset_; } protected: unsigned size_; _bz_bool good_; unsigned offset_; unsigned i_, j_; }; class LowerTriangular : public MatrixStructure { public: typedef LowerTriangularIterator T_iterator; LowerTriangular() : size_(0) { } LowerTriangular(unsigned size) : size_(size) { } LowerTriangular(unsigned rows, unsigned cols) : size_(rows) { BZPRECONDITION(rows == cols); } unsigned columns() const { return size_; } unsigned coordToOffset(unsigned i, unsigned j) const { BZPRECONDITION(inRange(i,j)); BZPRECONDITION(i >= j); return i*(i+1)/2 + j; } unsigned firstInRow(unsigned i) const { return 0; } template T_numtype get(const T_numtype * _bz_restrict data, unsigned i, unsigned j) const { BZPRECONDITION(inRange(i,j)); if (i >= j) return data[coordToOffset(i,j)]; else return ZeroElement::zero(); } template T_numtype& get(T_numtype * _bz_restrict data, unsigned i, unsigned j) { BZPRECONDITION(inRange(i,j)); if (i >= j) return data[coordToOffset(i,j)]; else return ZeroElement::zero(); } unsigned lastInRow(unsigned i) const { return i; } unsigned firstInCol(unsigned j) const { return j; } unsigned lastInCol(unsigned j) const { return size_ - 1; } _bz_bool inRange(unsigned i, unsigned j) const { return (i < size_) && (j < size_); } unsigned numElements() const { return size_ * (size_ + 1) / 2; } unsigned rows() const { return size_; } void resize(unsigned size) { size_ = size; } void resize(unsigned rows, unsigned cols) { BZPRECONDITION(rows == cols); size_ = rows; } private: unsigned size_; }; BZ_NAMESPACE_END #endif // BZ_MATLTRI_H