[[Imported from SVN: r3363]]

[[Imported from SVN: r3362]]

[[Imported from SVN: r3361]]

[[Imported from SVN: r3360]]

[[Imported from SVN: r3359]]

[[Imported from SVN: r3358]]

[[Imported from SVN: r3357]]

Treat several functors as one.

[[Imported from SVN: r3356]]

[[Imported from SVN: r3355]]

[[Imported from SVN: r3354]]

[[Imported from SVN: r3353]]

[[Imported from SVN: r3352]]

[[Imported from SVN: r3351]]

[[Imported from SVN: r3350]]

[[Imported from SVN: r3349]]

[[Imported from SVN: r3348]]

/usr/include. Parmetis is now found without path.

[[Imported from SVN: r3347]]

[[Imported from SVN: r3346]]

[[Imported from SVN: r3345]]

[[Imported from SVN: r3344]]

[[Imported from SVN: r3343]]

[[Imported from SVN: r3342]]

[[Imported from SVN: r3341]]

- Moved expensive distance function to end candidate selection
  algorithm.
- Now using the matrix initializer without number of nonzeros saving on
  pass over all aggregates for calculating them.
- When setting up the sparsity pattern there is now need to use a set
  to prevent adding a column several times to a row as the
  CreateIterator of BCRS Matrix uses a set itself. Saved it.

[[Imported from SVN: r3340]]

[[Imported from SVN: r3339]]

[[Imported from SVN: r3338]]

[[Imported from SVN: r3337]]

[[Imported from SVN: r3336]]

[[Imported from SVN: r3335]]

[[Imported from SVN: r3334]]

      assert(globalid.id(*e) >= 0);
don't work.

[[Imported from SVN: r3333]]

[[Imported from SVN: r3332]]

[[Imported from SVN: r3331]]

[[Imported from SVN: r3330]]

[[Imported from SVN: r3329]]

[[Imported from SVN: r3328]]

[[Imported from SVN: r3327]]

[[Imported from SVN: r3326]]

[[Imported from SVN: r3325]]

returns just the lowest 32 bits

[[Imported from SVN: r3324]]