introspective
compile-time-regular-expressions
| introspective | compile-time-regular-expressions | |
|---|---|---|
| 2 | 26 | |
| 25 | 3,163 | |
| - | - | |
| 0.0 | 7.0 | |
| over 2 years ago | 9 days ago | |
| C++ | C++ | |
| GNU Lesser General Public License v3.0 only | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
introspective
compile-time-regular-expressions
-
Why are strings and IO so complicated?
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
- Compile time regular expression in C++
-
What are thoughts on removing regular expression from the standard library?
There are suggestions that should be replaced by the high performance ctre implementation: https://github.com/hanickadot/compile-time-regular-expressions
-
What's the most hilarious use of operator overloading you've seen?
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
-
It's easy, I swear! Once you learn a bit about it, you'll be amazed!
Check out https://github.com/hanickadot/compile-time-regular-expressions anything is possible 😂
-
Verify all characters are same except a few
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
-
Constexpr regex parser!
You could compare your implementation with https://github.com/hanickadot/compile-time-regular-expressions and see if there are any ideas you can copy.
- Regex is comically slow. High performance alternatives? (Pattern matching for validation)
-
Regex shootout updated - hyperscan 1st, Rust 2nd, std::regex dead last
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...
-
What are some cool modern libraries you enjoy using?
ctre
What are some alternatives?
SpeciaLUT - Runtime choosing of template specializations using compile-time lookup-tables. Compile all states of a template function, but execute the optimal one at runtime.
RE2 - RE2 is a fast, safe, thread-friendly alternative to backtracking regular expression engines like those used in PCRE, Perl, and Python. It is a C++ library.
lambda-tuple - An implementation of `std::tuple` based on variadic lambda capture
consteval-huffman - Compile-time Huffman coding compression using C++20
uninttp - A universal type for non-type template parameters for C++20 or later.
xorstr - heavily vectorized c++17 compile time string encryption.
CTAsm - Compile time assembler with nasm syntax
neo-fun - Some library components that didn't quite fit anywhere else...
mlib - mlib is a fast, simple c++ meta-programming library that uses c++20.
C++ Format - A modern formatting library
entt - Gaming meets modern C++ - a fast and reliable entity component system (ECS) and much more
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.