/usr/include/linbox/blackbox/sparse.h is in liblinbox-dev 1.3.2-1.1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 | /* linbox/blackbox/sparse.h
* Copyright (C) 1999-2005 William J Turner,
* 2001-2002 Bradford Hovinen
*
* Written by W. J. Turner <wjturner@acm.org>,
* Bradford Hovinen <hovinen@cis.udel.edu>
*
* ------------------------------------
* 2002-08-06 Bradford Hovinen <hovinen@cis.udel.edu>
*
* Renamed to sparse.h from sparse0.h
* ------------------------------------
* Modified by Bradford Hovinen <hovinen@cis.udel.edu>
* Modified by Jean-Guillaume Dumas <Jean-Guillaume.Dumas@imag.fr>
* 28.08.2002 : added back : field()
*
* Refactoring:
* - Eliminated SparseMatrixAux and moved that functionality into Sparse0
* - Made SparseMatrixBase parameterized only on the element type
* - New read/write implementations for SparseMatrixBase, supporting multiple
* formats
* - Eliminated Gaussian elimination code
* - Added iterators, including ColOfRowsIterator, Iterator, and
* IndexIterator
* - Eliminated operator []; added getEntry; changed put_value to setEntry
* ------------------------------------
* Modified by W. J. Turner <wjturner@acm.org>
* 24.06.2005 : Removed using declarations
* ------------------------------------
*
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*.
*/
#ifndef __LINBOX_blackbox_sparse_H
#define __LINBOX_blackbox_sparse_H
#include "linbox/linbox-config.h"
#include "linbox/blackbox/blackbox-interface.h"
#include "linbox/matrix/sparse.h"
#include "linbox/vector/vector-domain.h"
#include "linbox/vector/vector-traits.h"
#include "linbox/vector/stream.h"
#include "linbox/util/field-axpy.h"
#include "linbox/field/hom.h"
#include "linbox/field/rebind.h"
namespace LinBox
{
/** \brief vector of sparse rows.
* This is a generic black box for a sparse matrix. It inherits
* LinBox::SparseMatrixBase, which implements all of the underlying
* accessors and iterators.
* \ingroup blackbox
*/
template <class _Field,
class _Row = typename LinBox::Vector<_Field>::Sparse>
class SparseMatrix : public BlackboxInterface, public SparseMatrixBase<typename _Field::Element, _Row> {
public:
typedef _Field Field;
typedef typename Field::Element Element;
typedef typename SparseMatrixBase<typename Field::Element, _Row>::Row Row;
typedef typename SparseMatrixBase<typename Field::Element, _Row>::Rep Rep;
typedef SparseMatrix<_Field, _Row> Self_t;
#ifdef __LINBOX_PARALLEL
BB_list_list sub_list;
#endif
FileFormatTag Format;
typedef typename SparseMatrixBase<typename Field::Element, _Row>::Iterator Iterator;
typedef typename SparseMatrixBase<typename Field::Element, _Row>::IndexedIterator IndexedIterator;
typedef typename SparseMatrixBase<typename Field::Element, _Row>::ConstIterator ConstIterator;
typedef typename SparseMatrixBase<typename Field::Element, _Row>::ConstIndexedIterator ConstIndexedIterator;
/** Constructor.
* Builds a zero m x n matrix
* Note: the copy constructor and operator= will work as intended
* because of STL's container design
* @param F Field over which entries exist
* @param m Row dimension
* @param n Column dimension
*/
#if 0
SparseMatrix (const Field &F) :
SparseMatrixBase<Element, _Row> (0,0), _field (F), _VD (F), _MD (F), _AT (*this)
{
std::cerr << "default cstor" << std::endl;
}
SparseMatrix (const Field &F, size_t m, size_t n) :
SparseMatrixBase<Element, _Row> (m, n), _field (F), _VD (F), _MD (F), _AT (*this)
{
std::cerr << "default cstor : " << m << "x" << n << std::endl;
}
#endif
SparseMatrix (const Field &F, size_t m=0, size_t n=0) :
SparseMatrixBase<Element, _Row> (m, n), _field (F), _VD (F), _MD (F), _AT (*this)
{ }
/** Constructor from a vector stream
* @param F Field over which entries exist
* @param stream Stream with which to generate row vectors
*/
template<class VectStream>
SparseMatrix (const Field &F, VectStream &stream) :
SparseMatrixBase<Element, _Row> (stream.size (), stream.dim ()),
_field (F), _VD (F), _MD (F), _AT (*this)
{
typename SparseMatrixBase<Element, _Row>::RowIterator i;
for (i = SparseMatrixBase<Element, _Row>::rowBegin (); i != SparseMatrixBase<Element, _Row>::rowEnd (); ++i)
stream >> *i;
}
/** Constructor from a MatrixStream
* @param ms A matrix stream properly initialized
*/
SparseMatrix( MatrixStream<Field>& ms ) :
SparseMatrixBase<Element,_Row>(ms), _field(ms.getField()), _VD(ms.getField()), _MD(ms.getField()), _AT(*this)
{ }
/** Copy constructor
*/
SparseMatrix (const SparseMatrix<Field, Row> &B) :
SparseMatrixBase<Element, _Row> (B), _field (B._field), _VD (B._field), _MD (B._field), _AT (*this)
{ }
/** Row type Converter constructor
*/
template<class VectorType>
SparseMatrix (const SparseMatrix<Field, VectorType> &B) :
SparseMatrixBase<Element, _Row> (B), _field (B._field), _VD (B._field), _MD (B._field), _AT (*this)
{ }
/** Destructor. */
~SparseMatrix () {
#ifdef __LINBOX_PARALLEL
BB_list_list::iterator p;
BB_list::iterator e_p;
for (p = sub_list. begin(); p != sub_list. end(); ++ p)
for (e_p = p -> second. begin();
e_p != p -> second. end(); ++ e_p) {
Thread::terminate_thread (*e_p);
delete (*e_p);
}
#endif
}
/** Matrix-vector product
* \f$y = A x\f$.
* @return reference to output vector y
* @param x input vector
* @param y
*/
template <class OutVector, class InVector>
OutVector &apply (OutVector &y, const InVector &x) const
{
#ifdef __LINBOX_PARALLEL
return BlackboxParallel (y, *this, x, BBBase::Apply);
#else
return _MD.vectorMul (y, *this, x);
#endif
}
/** Transpose matrix-vector product
* \f$ y = A^T x\f$.
* @return reference to output vector y
* @param x input vector
* @param y
*/
template <class OutVector, class InVector>
OutVector &applyTranspose (OutVector& y, const InVector &x) const
{
#ifdef __LINBOX_PARALLEL
return BlackboxParallel (y, *this, x, BBBase::ApplyTranspose);
#else
return _MD.vectorMul (y, _AT, x);
#endif
}
template<typename _Tp1, typename _Rw1 = typename Rebind<_Row, _Tp1>::other>
struct rebind {
typedef SparseMatrix<_Tp1, _Rw1> other;
void operator() (other & Ap, const Self_t& A) {
// Ap = new other(F, A.rowdim(), A.coldim());
typename _Tp1::Element e;
Hom<typename Self_t::Field, _Tp1> hom(A.field(), Ap.field());
for( typename Self_t::ConstIndexedIterator
indices = A.IndexedBegin();
(indices != A.IndexedEnd()) ;
++indices ) {
// hom. image (e, A.getEntry(indices.rowIndex(),indices.colIndex()) );
hom. image (e, indices.value() );
if (!Ap.field().isZero(e))
Ap.setEntry (indices.rowIndex(),
indices.colIndex(), e);
}
}
};
template<typename _Tp1, typename _Rw1>
SparseMatrix (const SparseMatrix<_Tp1, _Rw1> &Mat, const Field& F) :
SparseMatrixBase<Element, _Row> (Mat.rowdim(),Mat.coldim()),
_field (F), _VD (F), _MD (F), _AT (*this) {
typename SparseMatrix<_Tp1,_Rw1>::template rebind<Field,_Row>()(*this, Mat);
}
/** Retreive row dimensions of Sparsemat matrix.
* @return integer number of rows of SparseMatrix0Base matrix.
*/
size_t rowdim () const
{ return SparseMatrixBase<Element, _Row>::_m; }
/** Retreive column dimensions of Sparsemat matrix.
* @return integer number of columns of SparseMatrix0Base matrix.
*/
size_t coldim () const
{ return SparseMatrixBase<Element, _Row>::_n; }
/** Read the matrix from a stream in the given format
* @param is Input stream from which to read the matrix
* @param format Format of input matrix
* @return Reference to input stream
*/
std::istream &read (std::istream &is, FileFormatTag format = FORMAT_DETECT)
{ return SparseMatrixBase<Element, _Row>::read (is, _field, format); }
/** Write the matrix to a stream in the given format
* @param os Output stream to which to write the matrix
* @param format Format of output
* @return Reference to output stream
*/
std::ostream &write (std::ostream &os, FileFormatTag format = FORMAT_PRETTY) const
{ return SparseMatrixBase<Element, _Row>::write (os, _field, format); }
// JGD 28.08.2002
/** Access to the base field
*/
const Field& field () const
{ return _field;}
protected:
const Field _field; // Field used for all arithmetic
VectorDomain<Field> _VD; // Vector domain for matrix operations
MatrixDomain<Field> _MD; // Matrix domain for matrix operations
TransposeMatrix<SparseMatrix<_Field, _Row> > _AT;
template<class F, class R> friend class SparseMatrix;
};
/** Sparse matrix factory
* This class inherits \ref BlackboxFactory and provides a method for using a
* \ref SparseMatrixBase object with integer or rational data type as input to
* the high-level integer and rational solutions functions.
*/
template <class Field,
class BElement = typename Field::Element,
class Row = typename LinBox::Vector<Field>::Sparse,
class BRow = typename LinBox::RawVector<BElement>::Sparse>
class SparseMatrixFactory : public BlackboxFactory<Field,SparseMatrix<Field,Row> > {//otot
const SparseMatrixBase<BElement, BRow> &_matA;
public:
SparseMatrixFactory (const SparseMatrixBase<BElement, BRow> &A) :
_matA (A)
{}
// FIXME: This function assumes basically that the matrix is over the integers
SparseMatrix<Field,Row> *makeBlackbox (const Field &F);
integer &maxNorm (integer &res)
{
typename SparseMatrixBase<BElement, BRow>::ConstIterator i;
res = 0L;
integer tmp;
for (i = _matA.Begin (); i != _matA.End (); ++i) {
tmp = abs (*i);
if (res < tmp)
res = tmp;
}
return res;
}
size_t rowdim ()
{ return _matA.rowdim (); }
size_t coldim ()
{ return _matA.coldim (); }
// A better bound for determinant of an integer sparse matrix, ZW
integer &hadamardBound (integer& res) const
{
return hadamardBound (res, typename VectorTraits<Row>::VectorCategory());
}
integer &hadamardBound (integer& res, VectorCategories::SparseParallelVectorTag) const
{
typedef typename SparseMatrixBase<BElement, BRow>::ConstRowIterator RowIterator;
typedef typename SparseMatrixBase<BElement, BRow>::ConstRow::second_type::const_iterator EltIterator;
res = 1L;
integer tmp;
RowIterator row_p;
EltIterator elt_p;
for (row_p = _matA. rowBegin(); row_p != _matA. rowEnd(); ++ row_p) {
tmp = 0;
for (elt_p = row_p -> second. begin(); elt_p != row_p -> second. end(); ++ elt_p)
tmp += static_cast<integer>(*elt_p) * (*elt_p);
res *=tmp;
}
res = sqrt (res);
return res;
}
integer &hadamardBound (integer& res, VectorCategories::SparseSequenceVectorTag) const{
typedef typename SparseMatrixBase<BElement, BRow>::ConstRowIterator RowIterator;
typedef typename SparseMatrixBase<BElement, BRow>::ConstRow::const_iterator EltIterator;
res = 1L;
integer tmp;
RowIterator row_p;
for ( row_p = _matA. rowBegin(); row_p != _matA. rowEnd(); ++ row_p) {
tmp = 0;
for (EltIterator elt_p = row_p -> begin(); elt_p != row_p -> end(); ++ elt_p)
tmp += static_cast<integer>(elt_p -> second) * (elt_p -> second);
res *=tmp;
}
res = sqrt (res);
return res;
}
integer &hadamardBound (integer& res, VectorCategories::SparseAssociativeVectorTag) const
{
typedef typename SparseMatrixBase<BElement, BRow>::ConstRowIterator RowIterator;
typedef typename SparseMatrixBase<BElement, BRow>::ConstRow::const_iterator EltIterator;
res = 1L;
integer tmp;
RowIterator row_p;
EltIterator elt_p;
for ( row_p = _matA. rowBegin(); row_p != _matA. rowEnd(); ++ row_p) {
tmp = 0;
for (elt_p = row_p -> begin(); elt_p != row_p -> end(); ++ elt_p)
tmp += static_cast<integer>(elt_p -> second) * (elt_p -> second);
res *=tmp;
}
res = sqrt (res);
return res;
}
};
// #if !defined(__INTEL_COMPILER) && !defined(__CUDACC__) && !defined(__clang__)
// template <>
// #endif
template <class Field, class _Row>
struct MatrixTraits< SparseMatrix<Field, _Row> >
{
typedef SparseMatrix<Field, _Row> MatrixType;
typedef MatrixCategories::RowMatrixTag MatrixCategory;
};
template <class Field, class _Row>
struct MatrixTraits< const SparseMatrix<Field, _Row> >
{
typedef const SparseMatrix<Field, _Row> MatrixType;
typedef MatrixCategories::RowMatrixTag MatrixCategory;
};
} // namespace LinBox
#include "linbox/blackbox/sparse.inl"
#endif // __LINBOX_blackbox_sparse_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|