Sort/Merge process that removes duplicates
I would like a way to enhance the sort or merge process that allows removing duplicate values from the input.
For example, if my input is: a, b, c, b, a the output would be a, b, c
Currently the Merger constructor is too deep in the Sorter code to easily override the creation process and make my own Merger subclass.
Sounds like a good idea yes.
Not implemented yet, but hoping to do this after 1.0 release.
I probably need something similar to that soon. It would be great if the suppliable Comparator would be more generic and allow for merging/updating/removing the passed-in objects.
@jjYBdx4IL That wouldn't quite work via basic Comparor API would it? Nothing against possibly extending Comparator, taking sub-class. Or perhaps just creating a different interface for API.