- avoid potential ambiguities in naming of mesh faces/edges
  vs. block faces/edges

- additional methods characterizing the number of faces
  (internal, boundary, total) associated with a blockDescriptor

- cellLabel() accessor and checkIndex() methods

- restore demand-driven behaviour of block, cache the calculated cells
  and refactor generation of block boundary faces to improve potential
  reuse.

- can be useful for diagnosing mesh internals and the locations of
  decomposed cells.

- already available from the FixedList inheritance, but provide
  explicitly in edge to allow future adjustment of the inheritance
  (#1205)

- construct from MinMax, optional start index for identity factory
  method to match Foam::identity()

- use GREAT instead of VGREAT in inverted scalarRange.
  Consistent with boundBox - to reduce the potential of overflow
  if calculating the span.

- add min()/max() methods to labelRange

- seems to have slipped into an earlier commit

- adapted from the 'foamGet' utility authored by Chris Greenshields

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- Note: mpich now builds libmpi.so instead of libmpich.so

- define both -DMPICH_SKIP_MPICXX and -DOMPI_SKIP_MPICXX regardless of
  using openmpi or mpich. This simplifies the files and does not harm.

- a leftover from the change from class to namespace

- the Tools::Vertices() method for creating a vtkPolyData with the
  given points and a corresponding Verts for the points.

- previously just removed duplicate literals, but now remove any
  duplicates.

- Replace previous wordHashSet implementation with a linear search
  instead. The lists are normally fairly small and mostly just have
  unique entries anyhow. This reduces the overall overhead.

- simplifies their use when reordering lists etc.
  (word, fileName, keyType, wordRe)

- "unfriend" IO operators for string types. They require no internal access

- add compile/uncompile methods to keyType for symmetry with wordRe

- when outputting keyType/wordRe, be more explicit about them using
  writeQuoted()

- reduced clutter when iterating over containers

- reduced clutter when iterating over containers

- delay dereferencing of optional subRegion entries until an
  objectRegistry is required.

  This improves usabilty when reference objects do not yet exist
  at the time of construction.

- complete any pending initialisation on write().
  Allows lazier evaluation until when surfaces are actually available.

- complete any pending initialisation on write().
  Allows lazier evaluation until when the surfaces are actually needed.

- includes initial relocation of low-level vtu handling.
  Extracted, refactored from the Catalyst function object.