Dans les préférences de filtre de mots Calckey, je lis: «pour utiliser des expressions régulières (regex), mettez les mots-clés entre barres obliques». Pour donner un exemple, si je mettais les mots expression | régulière dans le filtre, ça veut dire de filtrer expression ou régulière ? Et est-ce que d'autres caractères sont utilisables pour filtrer? #ExpressionsRégulière#Regex
@timbray I wonder how close the match is to #Hyperscan. That’s Intel’s high-perf regex engine, which disallows backreferences, lookarounds and capture groups, much like I-Regex.
I’ve released more GitHub :github: Secret 🔑 Scanning 🔎 custom patterns, which you can use with Advanced Security.
Some are 🔥 (IMHO), some are for auditing only - e.g. my “common passwords” pattern, written to spot some of the most commonly leaked weak passwords - “P@55word123!” etc.
We have DataDog, Sentry, .Net configs, MS SQLServer user creation, and Bearer tokens.
> Hyperscan is a high-performance multiple regex matching library. It follows the regular expression syntax of the commonly-used libpcre library, but is a standalone library with its own C API.
>
> Hyperscan uses hybrid automata techniques to allow simultaneous matching of large numbers (up to tens of thousands) of regular expressions and for the matching of regular expressions across streams of data.
An incredible and must-read blog post explaining the internals of the regex Rust crate. How it has moved from a “monolithic” to a “multi-library” project. It explains in details the problems regex engines have to deal with, the importance of literal optimisations, the NFA data type, and the various regex engines that are implemented (incl. a meta engine, to rule them all).
As a long term professional software developer, I have a healthy scepticism for the capabilities of the new waves of AI systems (if you know how the sausage is made, etc ..)
But if there is one domain they are perfect for - albeit very niche - it's generating regular expression patterns from natural language descriptions of the intended match.
They're explicit, not open to interpretation (unlike, apparently, the explicit laws of cricket) and immediately verifiable.
#ChatGPT even gives a little explanation of the generated expression. Although it could turn down the Sirius Cybernetics Corporation perkiness a bit!
I consider myself an expert in regular expressions, yet finding out that a very simple regex can determine whether a number is prime just exploded my brain. Note that while the regex given in the article matches strings of 1s, that's totally incidental. You can easily modify the regex to use strings of any single repeated character. What's really being tested is whether the length of a string is prime.
Was writing a #regex. Thought this was a perfect time to use one of those newfangled #AI things (#ChatGPT), this kind of well specified problem requiring boring arcane syntax should be right up its alley
It spat it out near instantly, the running example showing exactly what I would expect
Only, the actual regex created and shown in the example isn't even syntactically valid
naive question- which string manipulation plugin do you use, why and how do you install in in # emacs? #regex
I have s.el , but I not clear of any of the 3 parts about it
regsub() on bodies has finally arrived for #opensource Varnish HTTP Cache.
Our #pcre2#regex module https://gitlab.com/uplex/varnish/libvmod-re for #varnishcache now also supports substitutions on bodies. Similar to the recently announced .match_body() method, this feature supports matches across storage segments while avoiding to make copies using PCRE2's partial match feature.
Another big thank you to Philip Hazel and Zoltan Herczeg for their great work on the essential regular expression library.
A bugfix gives me an excuse to mention that, for some time now, vmod_re https://gitlab.com/uplex/varnish/libvmod-re - our #pcre2#regex module for #varnishcache - also supports matches against bodies.
The implementation supports matches across storage segments while avoiding to make copies using PCRE2's partial match feature.
A big think you to Philip Hazel and Zoltan Herczeg for their great work on the essential regular expression library. @slimhazard