TBB Merge Sort increases the vtkm_cont library size by a significant amount
The TBB merge sort implementation is really great as it offers a really fast sort algorithm. The issue is that it comes with a fairly hefty binary size.
A quick scan shows that the code that the implementation has code that currently is templated but is invariant, and is ripe for refactoring so we generate it only once.