Explore >> Select a destination
|
You are here 
|
mcyoung.xyz | ||
| | | | |
www.nayuki.io
|
|
| | | | | [AI summary] The user has provided a comprehensive overview of the x86 architecture, covering topics such as basic arithmetic operations, control flow with jumps and conditionals, memory addressing modes, the stack and calling conventions, advanced instructions like SSE, virtual memory, and differences between x86-32 and x86-64. The user is likely looking for a summary or clarification of the x86 architecture, possibly for learning purposes or to reinforce their understanding. | |
| | | | |
ochagavia.nl
|
|
| | | | | It's time to present the solution to the JIT calculator challenge! If you missed it, here's the original post in which I introduced it. It was a nice excuse to finally learn more about JIT compilation! I wasn't alone in this, many people were nerd-sniped into implementing their own solutions and sent me their submissions. Thanks for participating! I'll discuss them in a third blog post, to keep this one from becoming too long. | |
| | | | |
chadaustin.me
|
|
| | | | | Reference counting is cheap and easy. An integer starts at one, increments on every new reference, and whoever decrements it to zero is responsible for deallocation. | |
| | | | |
bloeys.com
|
|
| | | In 'Thought 2: Regex is Like Assembly' I wondered why we are still doing regex in this kind of hard to understand, symbolic way, when we have already invented high level programming languages. There is no reason regex can't be written as clearly as any other programming language we use today. I thought doing this would be an interesting project, and so I came up with Regexl, a high level language for writing regex, that can be used as a simple library. | ||
