bloeys/nset
1
0
Fork 0
mirror of https://github.com/bloeys/nset.git synced 2025-12-29 06:28:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1 from mohammed-ali-1/patch-1

Browse Source 
add Benchmarks anchor link
This commit is contained in:
Omar Mahdi
2022-06-10 19:13:20 +04:00
committed by GitHub
parent 888f4f09b0 63b3abb7fc
commit 03e196fdaf
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -20,7 +20,7 @@ get intersections.
Maybe you want a set implementation? Then this is one, but there are other reasons.
If you are using your hash maps/arrays like sets or do a lot of checks to see if items exists in your hash maps then NSet might make sense.
In such cases NSet makes sense because it is both faster and more memory efficient. You can see more about this in the Benchmarks section.
In such cases NSet makes sense because it is both faster and more memory efficient. You can see more about this in the [Benchmarks](#benchmarks) section.
Here are some examples where you might want to consider NSet: