RE2
compile-time-regular-expressions
Our great sponsors
RE2 | compile-time-regular-expressions | |
---|---|---|
49 | 26 | |
8,614 | 3,157 | |
1.1% | - | |
8.9 | 7.5 | |
19 days ago | 3 months ago | |
C++ | C++ | |
BSD 3-clause "New" or "Revised" License | 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.
RE2
-
C Is the Greenest Programming Language
Looking at the benchmark where C++ is worst compared to other languages, it's depending on the library used. I would guess if they used Google's re2 Regex library instead of Boost's, the result would be different.
https://github.com/google/re2
https://github.com/greensoftwarelab/Energy-Languages/blob/ma...
-
what does this + do in the regular expression "(^A-Za-z)+"
That page says it just includes "some of the most common special characters", and following the link to the Examples page in turn includes a link to the full list.
-
On a Great Interview Question
Python uses backtracking, so this probably isn't O(n), especially with the ability to choose the dictionary.
But with there are non-backtracking matchers which would make this O(n). Here's re2 from https://github.com/google/re2 :
>>> import re2
-
RE2 VS hyperscan - a user suggested alternative
2 projects | 17 Mar 2023
-
hyperscan VS RE2 - a user suggested alternative
2 projects | 17 Mar 2023
RE2 is a Google regular expression library
-
Projects ideas to learn C++/OOP
google's regex library: https://github.com/google/re2
-
Regex: is there a difference between * and {0,}, as well as + and {1,}?
I am currently working with Regex, specifically Re2, and was wondering if there is a real difference between the above expressions for repeated sub-regex.
-
First release of SPVM::File::Spec - complex regular expressions, file tests, SPVM::Cwd, inheritance
I ported Google RE2, a regular expression library, to SPVM as Resource::Re2, and created SPVM::Regex, a wrapper for it.
-
SPVM::File::Basename is released. This is the first module of SPVM using regular expressions.
I searched for I found that there is a Perl compatible regular expression called Google RE2. It is written in C++, and with Google RE2, I can use Perl-compatible regular expressions as a library.
-
Ruby 3.2.0 Is from Another Dimension
Yes, but there is an interesting clarification here. RE2 has used the "caching" approach documented in the Ruby bug ticket linked for quite some time (since its birth?): https://github.com/google/re2/blob/954656f47fe8fb505d4818da1...
It is mentioned only briefly in Cox's article on regex matching in the wild. Look for the word "bitstate": https://swtch.com/~rsc/regexp/regexp3.html
I didn't know Perl had implemented this trick too.
The paper[1] cited in the Ruby bug ticket was published very recently. When I first read the Ruby bug ticket, I immediately wondered how they sidestepped the memory use problem. The paper's abstract seems to suggest there is some technique for doing so, as it rebuffs the idea of doing "full" memoization. Alas, I do not have access the paper. (Which is fucking ridiculous.)
[1]: https://ieeexplore.ieee.org/abstract/document/9519427
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?
semver.c - Semantic version in ANSI C
consteval-huffman - Compile-time Huffman coding compression using C++20
Boost.Signals - Boost.org signals2 module
xorstr - heavily vectorized c++17 compile time string encryption.
libevil - The Evil License Manager
neo-fun - Some library components that didn't quite fit anywhere else...
constexpr-8cc - Compile-time C Compiler implemented as C++14 constant expressions
C++ Format - A modern formatting library
Cppcheck - static analysis of C/C++ code
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
stb - stb single-file public domain libraries for C/C++
uninttp - A universal type for non-type template parameters for C++20 or later.