Re: [boost] ublas iterator [uBLAS vs MTL for sparse matrices]

From: Joerg Walter (jhr.walter_at_[hidden])
Date: 2002-05-06 03:37:32

----- Original Message -----
From: "Peter Schmitteckert (boost)" <boost_at_[hidden]>
To: <boost_at_[hidden]>
Sent: Sunday, May 05, 2002 9:38 PM
Subject: Re: [boost] ublas iterator [uBLAS vs MTL for sparse matrices]

> Salut,
>
> On Friday 03 May 2002 21:29, Joerg Walter wrote:
> > We recently discussed, that this could be achieved by accessing the
> > internal representation of a sparse_matrix. In the meantime we
(hopefully
> > ;-) added all necessary members to allow for something like
> >
> >     for (numerics::sparse_matrix<double>::array_type::const_iterator itm
=
> > m.data().begin ();
> >         itm != m.data ().end ();
> >             ++ itm) {
> >                 std::cout << (*itm).first << " " << (*itm).second <<
> > std::endl;
> >     }
> >
> > Is this ok for you?
>
> If it works for dense and hermitean matrices, yes.

Yes, this already should work for all matrices, which map to an underlying
rank 1 storage array.

> I'm, sorry, but I'm not using the ublas sparse matrices.

Now I understand, why we don't get problem reports w.r.t. sparse matrices
;-)

Regards

Joerg