Explore >> Select a destination
|
You are here 
|
hbfs.wordpress.com | ||
| | | | |
coredumped.dev
|
|
| | | | | In this post, we are going to take a deep dive into pointer tagging, where metadata is encoded into a word-sized pointer. Doing so allows us to keep a compact representation that can be passed around in machine registers. This is very common in implementing dynamic programming languages, but can really be used anywhere that additional runtime information is needed about a pointer. We will look at a handful of different ways these pointers can be encoded and see how the compiler can optimize them for diff... | |
| | | | |
moshez.wordpress.com
|
|
| | | | | New post on my blog. | |
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... | |
| | | | |
borretti.me
|
|
| | | A survey of type systems for memory safety. | ||
