AutoHotkey Community

Details in the script.

Download

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

I've added a link to this great resource from the "related" section of RegExMatch().

Your code is so short I was tempted to put it into the examples section. But I don't understand it well enough to be comfortable with that -- in part due to not fully understanding Grep. So I just linked to this topic, which provides your full examples and makes it easier for you to update it.

Thanks.

I designed them to be as fast as possible which is why some expressions look a bit cryptic. grep which I just updated, returns matches and positions as comma seperated values which is ideal for use in functions since StringSplit facilitates for global/local array creation. RegExMatchAll is better for general use as it supports subpatterns.

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

In version 1.2 I fixed the infinite recursion bug that occurred when UnquotedOutputVar had the same address as Haystack. Performance increased by 20% somehow. Version 1.3 brings a few new options to grep().

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

RegExReplace often provides a simpler alternative (putting all matches in a variable)If you want multi char separators, only the StringTrimRight command needs adaptation.

I use that method for a few things but it has its limitations i.e. it can't get subpatterns or positions, fails with options and complex expressions, can't recurse or backtrack, breaks backreferences and possibly some anchors and atomic groups, matches surrounding whitespace/delimiter chars etc. The lazy wildcard is said to be very slow and is generally discouraged.

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

To do a MATCHALL, there is an (?) easier / FASTER way...

example:




if this is helpful(?)

ie. regexmatch(HAYSTACK, "(?<whole>" ... rest of match block ... ")",Array_Var_Name, PlaceHolder)

the match block is normal except... in place of (?<named>) use "(?<named" . a_index . ">" for each named match.

or:

_________________
Joyce Jamce

That's how grep() works, but instead of using a Loop you get the convenience of a single function and a few extra options.

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

if we de-obscifate your function:



we see your very cool use of the return value (foundposition), but some huge LIMITATIONS with the function:

1) only return one (1) match, not multiple arrayed matches...... [with the simple loop suggested above, can make as many named matches/submatches as desired... ], eg:

2) need a 'pray it isn't in the match result' character to seperate the matches!!!

3) don't return an array....

4) are much slower...

and notably,

as pointed out above in thread, to create a conjoined string with matches, simply use regexreplace to kill everything between matches and insert whatever 'between' string you desire......

_________________
Joyce Jamce

Which could be any one. I'll try see if this limitation can be lifted with a new paradigm.

That's true, I usually escape my commas prior to calling grep. Until real arrays/objects are supported AutoHotkey will always have a problem here.

In most cases this is better. You can transform the string with Sort, parsing loops and not worry about variable scope within functions.

I did a few tests, and I found that it was only ever slightly slower (1-2%). Like I said this function is for convenience, looping is not a new concept. If performance is critical you can write a Dll in ASM and call your exported functions.

In my follow up I listed a few reasons why it's not a practical solution - breaking backreferences is a major worry because I use them a lot.

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

ok...


so easy, even pre-beginner can use !!!



STARTER:

use it like this,


RegexMall( HAYSTACK, NEEDLE)

get back

for *each* (?<named_match>xxxxxx)

ie.. "(?<first>\d+)\D+(?<second>\d*?)\s*(?<third>\w+)" is legal.


matched result contained in named matches, eg:

$named_match1 - 9999

function returns # of matches




also:

$ has full matches

$RegEx1-999 has full match for that match #

$0 also has # of matches...




options:


RegexMall(haystack,Needle, "VARIABLE TO USE", "Spacer to use", Position to start in regexreplace)


spacer applies to TOTAL MATCH return string... eg. "$" (if no variable alternative designated)


RegexMall(hay,needle,"THIS_") ->

returns

THIS_namedmatch1
THIS_namedmatch2

etc..

ie. in place of default "$"




hope this helps!


oh... is about 2-3 times slower than directly doing loop:



(as is doing 2 regex's!!)

but..

regex is FAST...

and larger the haystack, lower the time differential..


"S" option degrades performance...

------------------------------------------

ok and a second, FASTER (3x) version,

works also with unnamed match sections "(xxx)"

but less friendly output style.

$1_match#orid

eg:

$1_1
$1_2

$2_1
$2_2


etc..





for example:

_________________
Joyce Jamce

Your proposals look good. I will try to update my scripts soon, in the mean time users can copy your version.

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

count should also be in local var else the 2nd time u accumulate it, it will always be incremented since u didnt reset the count.

In version 2.0 RegExMatchAll() has been replaced with grepcsv(). Details are in the script.

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

thanks.

_________________
Joyce Jamce