We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
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 :)
The text was updated successfully, but these errors were encountered:
I'm interested! :)
Sorry, something went wrong.
Merge pull request #72 from vrom911/master
f72eb1a
Create `Nub` module (#68)
No branches or pull requests
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 :)
The text was updated successfully, but these errors were encountered: