Teuchos: TimeMonitor: Added test for new timer enable / disable feature.

This affects the new feature I added in the following commit:
75ade174a336a2dfc89d641851391ebf87479409

Build/Test Cases Summary
Enabled Packages: Teuchos
0) MPI_DEBUG => Test case MPI_DEBUG was not run! => Does not affect push readiness! (-1.00 min)
1) SERIAL_RELEASE => Test case SERIAL_RELEASE was not run! => Does not affect push readiness! (-1.00 min)
2) MPI_DEBUG_SS => passed: passed=103,notpassed=0 (0.83 min)
3) SERIAL_RELEASE_SS => passed: passed=100,notpassed=0 (0.64 min)
Ifpack2: Fixed a type conversion bug in the applyTempl() method in
the Diagonal preconditioner that showed up when building in mixed
precision with Tramonto.

Build/Test Cases Summary
Enabled Packages: Ifpack2
Enabled all Forward Packages
0) MPI_DEBUG => passed: passed=21,notpassed=0 (14.28 min)
1) SERIAL_RELEASE => passed: passed=17,notpassed=0 (4.59 min)
MueLu: change default weight in Zoltan2 to 0
MueLu: a new approach to Zoltan2 partitioning

The old approach was to try to present the number of partitions as a
product of three numbers. It did not work so well. For instance, if we
had a 1172 parts, we would get 2x2x293, which produced very stretched
subdomains. These kind of subdomains are bad particularly if we use
uncoupled aggregation, as the boundary to inner node ratio is high.

It turns out that pqJagged algorithm in Zoltan2 also supports the
recursive "bisection" somewhat similar to Zoltan. So the only problem is
to come up with a series of small numbers for these recursion. I
achieved that by tweaking the number of processors slightly (less than
15%) so that the final number is of form 2^k*3^m. And now we use the
recursive form of pqJagged.

But the depth of recursion also matters, as performance of Zoltan2
deteriorates with deep recursion (more than 6, really). Therefore, there
are some algorithms in place to aggregate factors. The current
implementation is way too complex for what it does, and might be a bit
finicky, but should work.
Galeri: another compilation fix for Helmholtz
MueLu: fixing the correct situation

One of the unit tests constructs a stupid map for the partitioner, where
one process does not own any data. This does not happen now that
subcommunicators are in place, but we need a check for the situation
where we don't use them.
another char -> const char
replaced deprecated .count() by .total_count()
MueLu: fixed signed/unsigned comparisons warning
Small change to avoid integer overflow for "Goldilocks" problems.
Added comments documenting known issue with metrics when weights are used.
Refer to Bug 5891
Merge branch 'master' of software.sandia.gov:/space/git/Trilinos
MueLu: fixing future problems

At some point it might happen that GlobalOrdinal is unsigned. Then
number of partitions in some cases would be set to (unsigned)(-1), which
is definitely something we don't want.
Merge branch 'master' of software.sandia.gov:/space/git/Trilinos
Tpetra: CrsGraph: Disabled certain unit tests in a release build.

Some of my most recent changes to Tpetra disable expensive checks for
invalid user input in a release build.  These checks only run now in a
debug build.  Tpetra had unit tests exercising these checks which would
only do something interesting in an MPI_RELEASE build, which I wasn't
testing in my last few test runs (typical practice is MPI_DEBUG and
SERIAL_RELEASE, though I do run MPI_RELEASE and SERIAL_DEBUG now and
then).

This commit protects the relevant unit tests in an
run in a debug build.

Build/Test Cases Summary
Enabled Packages: Tpetra
0) MPI_DEBUG => passed: passed=53,notpassed=0 (5.61 min)
1) SERIAL_RELEASE => passed: passed=41,notpassed=0 (9.02 min)
Added a hack to print part results to a file and exit rather than perform migration.
Hack assumes that initial distribution is INITIAL_LINEAR; otherwise, one cannot tell which
GID corresponds to the listed part.
Added a comment explaining the hack and its assumptions.
To enable the hack, grep for KDDKDD_OUTPUT_PARTITION_AND_SKIP_MIGREATION_AND_END
in dr_loadbal.c and #define it.
Merge branch 'master' of software.sandia.gov:/space/git/Trilinos
MueLu: Hierarchy Setup cleanup

I like to believe that I have simplified the Setup. We no longer
request for both Smoother and CoarseSolver, for instance.
Tpetra: Directory: Corrected public documentation.

My recent commits to Tpetra added a new implementation of Directory
for distributed contiguous uniform Maps.  I updated the documentation
to reflect this change.