dolfin team mailing list archive

[Johan Hake <668862@xxxxxxxxxxxxxxxxxx>]

> We use a home-made set because std::set is very slow (it's sorted). It
> may be worth trying boost::unordered_set.

By changing the std::vector used in dolfin::Set to boost::unordered set I more 
or less removed the bottle neck :)

Have you tried using unordered_set before?

Changing to unordered_set is something we should consider. I had to comment 
out some random access call to dolfin::Set as unordered_set does not come with 
that feature. It is used in:

  SparsityPattern::str()
  PETScVector::sum(const Array<uint>& rows)

Johan

-- 
Sparsity pattern computation dead slow with 'real' spaces
https://bugs.launchpad.net/bugs/668862
You received this bug notification because you are a member of DOLFIN
Team, which is subscribed to DOLFIN.

Status in DOLFIN: New

Bug description:
The computation of the sparsity pattern is dead slow when real spaces are used, i.e.,

    R = FunctionSpace(mesh, 'R', 0)

To see the problem, compare the neumann-poisson and poisson demos with fine meshes (256x256)