|
You are here |
mpark.github.io | ||
| | | | |
www.reedbeta.com
|
|
| | | | | Pixels and polygons and shaders, oh my! | |
| | | | |
eyakubovich.github.io
|
|
| | | | | In the previous post, we developed a logarithmic depth accumulate() function that can be used to emulate a for-loop. In this post, we'll look at how to construct a function that emulates a while-loop with the recursive depth of O(lg(n)) where n is the number of iterations of the while-loop.... | |
| | | | |
bannalia.blogspot.com
|
|
| | | | | In a previous entry we saw how to decouple the logic of a class from the access to its member data so that the latter can be laid out in a... | |
| | | | |
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. | ||