strf
RE2
Our great sponsors
strf | RE2 | |
---|---|---|
9 | 49 | |
68 | 8,607 | |
- | 1.0% | |
9.0 | 8.9 | |
11 days ago | 16 days ago | |
C++ | C++ | |
Boost Software License 1.0 | BSD 3-clause "New" or "Revised" License |
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.
strf
-
issue with libfmt and locale: Alignment is not correct.
You might get interested in trying strf library instead:
-
std::format, UTF-8-literals and Unicode escape sequence is a mess
If you want a formatting library that supports well char8_t and UTF, you might get interested in the one I'm developing: Strf.
-
How many people use printf() in their C++ code ?
You might like the strf formatting library then
-
How to get unicode of special characters in c++
You can also use https://github.com/robhz786/strf to convert utf-8 to utf-32 ( as demonstrated here).
-
Root cause of log4j: format string is a historical mistake. fast_io is the future.
Format strings enable the use of tools like gettex. However, with the strf formatting library, It is possible to use them without a format string.
-
State of the art for CPOs (customization points) in C++?
So it is a formatting library (strf), and if one wants to make a type xyz printable, one can either specialize a template or overload tag_invoke function, like below:
-
std::locale portability
The Strf formatting library may solve your problem:
-
Converting int to char*
There is the strf formatting library. Its current version (0.14) is not working well in CUDA, but I'm working to fix this into the next release, which should come soon. The usage would be:
-
Do you use cout or printf
strf
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
What are some alternatives?
C++ Format - A modern formatting library
compile-time-regular-expressions - Compile Time Regular Expression in C++
American Fuzzy Lop - american fuzzy lop - a security-oriented fuzzer
semver.c - Semantic version in ANSI C
libssh2 - the SSH library
Boost.Signals - Boost.org signals2 module
c-smart-pointers - Smart pointers for the (GNU) C programming language
libevil - The Evil License Manager
SDS - Simple Dynamic Strings library for C
constexpr-8cc - Compile-time C Compiler implemented as C++14 constant expressions
Experimental Boost.MSM-lite - Boost.SML (formerly called Boost.MSM-lite)
Cppcheck - static analysis of C/C++ code