Explore >> Select a destination
|
You are here 
|
lapinozz.github.io | ||
| | | | |
lapinozz.github.io
|
|
| | | | | My goodbye to template metaprogramming. One last tribute; computing A Star pathfinding algorithm at compile-time | |
| | | | |
aradaelli.com
|
|
| | | | | ||
| | | | |
rodusek.com
|
|
| | | | | Getting the name of a type in C++ is a hassle. For something that should be trivially known by the compiler at compile-time, the closest thing we have to getting the type in a cross-platform way is to use std::type_info::name which is neither at compile-time, nor is it guaranteed to be human-readable. In fact, both GCC and Clang actually return the compiler's mangled name rather than the human-readable name we are used to. Let's try to make something better using the modern utilities from c++17 and a little creative problem solving! | |
| | | | |
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. | ||
