dolfin team mailing list archive

[Garth Wells <668862@xxxxxxxxxxxxxxxxxx>]

On 16/11/10 16:07, Johan Hake wrote:
> I suggest two solutions: 1) Change the internal storage of
> dolfin::Set from vector to unordered_set. 2) Remove Set and use
> unordered_set directly.
>
> With 1) we can easily change the decision in the future, even make it
> parameter dependent (maybe not, we are not in Python land...) 2) is
> more clean.
>

For something else, I've just added a

   dolfin/graph/graph_types.h

which has typedefs for graph-like objects, We could use that.

Have you done any Set versus unordered_set performance testing for 
problems with 'Real'?

Garth

-- 
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: Confirmed

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)