threadx VS compile-time-regular-expressions

It is not open source. The source code is open but with an evaluation, i.e. proprietary license:

https://github.com/azure-rtos/threadx/blob/master/LICENSE.tx...

License looked alright, until I came across this: https://github.com/azure-rtos/threadx/blob/a8e5d0946c31385ff...

Portability, mainly. Zephyr runs on a wide variety of architectures and 450+ variations of popular boards are already supported upstream (adding more often being pretty easy). In your particular example, your own preferences with regards to building on top of open-source software may play a role too. For example, Azure RTOS is not open source, and its license will, among other things, prevent you to use it in production on other hardware than what's listed herehere. So easily moving from one hardware vendor / SoC to the other might be a problem, should this be a requirement (and it kind of becomes one for a lot of people in these times if silicon shortage)

Honestly as long as you use one of the supported MCU families ThreadX is probably a better choice these days given how much better NetX is over FreeRTOS’ TCP implementation.

Azure RTOS/ThreadX is only free on approved pre-licensed uCs, but with that said, there's a ton of devices covered by it so it's an option for a lot of projects.

I'm interested in something equivalent to tx_byte_pool but for non-embedded usage where I want a custom allocator for defined pools. Do you know if mimalloc can do this? I see it has custom heaps, but I didn't see any functions to create one from raw memory.

source is apparently available but no idea what licensing it uses

CTRE (https://github.com/hanickadot/compile-time-regular-expressions) ranges::views (filter, transform, etc.) (C++20) str.find() + str.substr() freopen to stdin + cin >> extraction Parser libraries

There are suggestions that should be replaced by the high performance ctre implementation: https://github.com/hanickadot/compile-time-regular-expressions

operator"" can be used in a similar way to expression templates (DSLs), where the type of the resulting expression is dependent on the string contents. For example ctre makes use of this to build efficient regular expression parsers, and kumi uses this in conjunction with operator[] to make tuple indexing quite elegant

Check out https://github.com/hanickadot/compile-time-regular-expressions anything is possible 😂

Yes to regex, no to std::regex. Better to use CTRE. Something like "^Hello [0-9]+ how are you" should allow checking if there's a match

You could compare your implementation with https://github.com/hanickadot/compile-time-regular-expressions and see if there are any ideas you can copy.

std::compile_time_regex would be a nice addition. Something similar to ctre https://github.com/hanickadot/compile-time-regular-expressions Simply letting the compiler generate all the regex parsing machinery at compile time.... And benefitting from compiler optimizations, vectorization, etc...

ctre