Closed chshersh closed 6 years ago
Results in PR #66 show next things:
hashNub
ordNub
Text
sortNub = Set.toList . Set.fromList
unstableNub = HashSet.toList . HashSet.fromList
So, all new functions should be added to universum and documented properly with use cases and examples.
universum
@vrom911 Tell me if you have interest in implementing this issue as well :)
I'm interested! :)
Results in PR #66 show next things:
hashNub
is faster thanordNub
when there're not so many different keys.Text
data type thanhashNub
is faster.sortNub = Set.toList . Set.fromList
has better performance thanordNub
but should be used when you also need sorting.unstableNub = HashSet.toList . HashSet.fromList
has better performance thanhashNub
.So, all new functions should be added to
universum
and documented properly with use cases and examples.@vrom911 Tell me if you have interest in implementing this issue as well :)