Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with library
Search options not deleted
user 86928
Code libraries to write programs to accomplish specific tasks. Please use this tag together with one for the associated programming language.
2
votes
0
answers
40
views
Fastest implementation of priority_queue in C++?
I stumbled upon custom implementations of hash tables, which are faster than std::unordered_map for say, int type. (For example ska::flat_hash_map)
For my use case, I don't need to optimize memory, th …
- 21