Explore >> Select a destination
|
You are here 
|
oldmoe.blog | ||
| | | | |
beets.io
|
|
| | | | | ||
| | | | |
attractivechaos.wordpress.com
|
|
| | | | | TL;DR: With linear probing, we can delete elements from an open addressing hash table without tombstones. Here are the C and the C++ implementations. Introduction When implementing a hash table based on open addressing, we usually set a tombstone for each deleted element, which indicates a bucket used to have an element. These tombstones maintain... | |
| | | | |
attractivechaos.wordpress.com
|
|
| | | | | As a Perl programmer, I enjoy a lot using hash tables. I keep this habit in C/C++ programming. Then what C/C++ hash libraries are available? How are they compared to each other? In this post, I will give a brief review of hash libraries and present a small benchmark showing their practical performance. Hash table... | |
| | | | |
www.foonathan.net
|
|
| | | Let me share a useful insight with you: constexpr is a platform. Just like you write code that targets Windows or a microcontroller, you write code that targets compile-time execution. In both cases you restrict yourself to the subset of C++ that works on your target platform, use conditional compilation if your code needs to be portable, and execute it on the desired target platform. You can thus view constexpr as another platform you can target; it just so happens to be run by your compiler. This insig... | ||
