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
I'd love to see some benchmarks to compare this to using a regular map or just using a slice containing a Key and Value.
Key
Value
I'd also love a little section in the README describing the big-O computational complexity of each operation.
This would really differentiate this little library from the others.
Thanks!
The text was updated successfully, but these errors were encountered:
No branches or pull requests
I'd love to see some benchmarks to compare this to using a regular map or just using a slice containing a
Key
andValue
.I'd also love a little section in the README describing the big-O computational complexity of each operation.
This would really differentiate this little library from the others.
Thanks!
The text was updated successfully, but these errors were encountered: