[Dune-devel] GSOC2013

[shailesh borkar]

Hello Markus sir,
    This is regarding "Implement Inserter Concept for DUNE's (Sparse)
Matrices".

I think most of the work that we will need at the time of implementing
inserter will be somewhat similar to the random scheme of implementing
CRS.The difference will be the fixed size of row(slot) instead of setting
row size for each row. Searching for elements will always take O(logN) time
for both compressed_base_array_unmanaged and std::map<>.

When i was reading code in "bvector.hh" file, I found this on line number
997

if (&a!=this) // check if this and a are different objects
{
    // copy data
    for (size_type i=0; i<this->n; i++) this->p[i]=a.p[i];
    for (size_type i=0; i<this->n; i++) this->j[i]=a.j[i];
}

cant we reduce it to O(N) instead of O(2N) in single loop
for(size_type i=0; i<this->n;i++)
{
    this->p[i]=a.p[i];
    this->j[i]=a.j[i];
}

And I have some confusion related to iterators, but i am working on it now.
Thanks.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.dune-project.org/pipermail/dune-devel/attachments/20130416/e2c9ec6a/attachment.htm>