/usr/include/givaro/givmatsparse.h is in libgivaro-dev 4.0.2-5.
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 | // ==========================================================================
// $Source: /var/lib/cvs/Givaro/src/library/matrix/givmatsparse.h,v $
// Copyright(c)'1994-2009 by The Givaro group
// This file is part of Givaro.
// Givaro is governed by the CeCILL-B license under French law
// and abiding by the rules of distribution of free software.
// see the COPYRIGHT file for more details.
// Authors: T. Gautier
// $Id: givmatsparse.h,v 1.4 2011-02-02 16:23:56 briceboyer Exp $
// ==========================================================================
// Description:
// of matrix by blocks.
#error "dead code"
#ifndef _GIV_MATRIX_SPARSE_H_
#define _GIV_MATRIX_SPARSE_H_
#include "givaro/givmatrix.h"
#include "givaro/givvector.h"
#include "givaro/givmatstoragesparse.h"
namespace Givaro {
#pragma message "#warning this file will probably not compile"
// --
// -- Matrix class: dense matrix
// --
template <class Domain>
class MatrixDom<Domain, Sparse>
{
Domain _domain;
public:
typedef Domain Domain_t;
typedef typename Domain::Rep Type_t;
typedef int Indice_t;
typedef Dense StorageTag_t;
typedef typename RetMatrixStorage<Type_t,Sparse>::Storage_t Storage_t;
// -- Representation of Element of the domain
typedef Storage_t Rep;
// -- Self_t
typedef MatrixDom<Domain, Sparse> Self_t;
//-- Dstor:
~MatrixDom() {}
//-- Default cstor:
MatrixDom() : _domain() {}
//-- cstor:
MatrixDom(const Domain& D) : _domain(D) {}
//-- Cstor of recopy: compiler's generated
MatrixDom(const Self_t& M )
: _domain(M._domain) {}
//-- init a new object, memory allocation
void init(Rep& r, Indice_t nr, Indice_t nc) const
{ r.allocate(nr, nc); }
void init(Rep& r) const
{ r.allocate(0,0); }
void init(Rep& A, const Rep& B) const
{ A.copy(B); }
//-- Assignment operator: physical copy
void assign (Rep& r, const Rep& a) const
{ r.copy(a); }
// -- Comparaizon
int areEqual ( const Rep& P, const Rep& Q) const;
int areNEqual( const Rep& P, const Rep& Q) const;
int iszero ( const Rep& P ) const;
//-- Dimension of the matrix space
Indice_t nrow(const Rep& A) const { return A._nrow; }
Indice_t ncol(const Rep& A) const { return A._ncol; }
Domain_t subdomain() const { return _domain; }
// -- arithmetic operator: operands could be aliased
void mulin ( Rep& res, const Type_t& u ) const;
void mul ( Rep& res, const Type_t& u, const Rep& v ) const;
void mul ( Rep& res, const Rep& u, const Type_t& v ) const;
// VD is the vector domain for res and u
void mul ( VectorDom<Domain,Dense>::Rep& res,
const Rep& M,
const VectorDom<Domain,Dense>& VD,
const VectorDom<Domain,Dense>::Rep& u ) const;
void multrans ( typename VectorDom<Domain,Dense>::Rep& res,
const Rep& M,
const VectorDom<Domain,Dense>& VS,
const typename VectorDom<Domain,Dense>::Rep& u ) const;
void negin ( Rep& P ) const
{
size_t sz = P._data.size();
for(size_t i=0; i<sz; ++i) _domain.negin(P._data[i]);
}
void neg ( Rep& res, const Rep& u ) const;
// -- map of a unary operator, with operator()( Type_t& res)
template<class OP>
void map ( Rep& res, OP& op ) const;
// -- map of a unary operator, with operator()( Type_t& res, const Type_t& val)
template<class OP>
void map ( Rep& res, OP& op, const Rep& u ) const;
// -- IO
istream& read ( istream& s );
ostream& write( ostream& s ) const;
istream& read ( istream& s, Rep& r ) const;
ostream& write( ostream& s, const Rep& r ) const;
// -- Compression method to compact a dense matrix to a sparse
// template<class StorageTag>,
void compact( Rep& Ms,
const MatrixDom<Domain, Dense>& MD,
const MatrixDom<Domain, Dense>::Rep& Md);
};
} // Givaro
//#include "givaro/givmatsparseops.inl"
#endif
|