How would you combine the boost::mpl::partition and boost::mpl::unique algorithms such that an element that is not placed into the first inserter (for unique elements) is placed into the second inserter (for non-unique elements)?