-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Hi,
I was thinking it might be useful to get all of the matches for a repeated
subexpression.
eg
(\w)(?:\s(\w)+)+
used to match a word list
will return the following sub expression matches...
Paren 0 = used to match a word list
Paren 1 = used
Paren 2 = list
I think it would be possible to add the ability to provide the entire set of matches
This could be added with a compiler flag or runtime flag to enable disable this
feature.
This would allow the following matches to be pulled out of the re...
Paren 0 = user to match a word list
Paren 1 = used
Paren 1 set = { "to", "match", "a", "word", "list" }
Paren 2 = list
Anyone else think this might be useful.
I would only add this if it would not impact and the efficiency when it was not
enabled.
Michael
-----BEGIN PGP SIGNATURE-----
Version: N/A
iQA/AwUBOoJz8bPjWznw9K1HEQJzNQCg53061QXoj1sRh6n3n/7NjS9XuegAn1ht
5p4fd1nWc1uyqHrdFbRE1gnC
=0JGM
-----END PGP SIGNATURE-----
--- BEGIN GEEK CODE BLOCK ---
Version 3.12
GCS d+(-) s:- a-- C++(+++)$ UL++++(H)(S)$ P+++$ L+++$>++++
E--- W++ N++ o++ K? !w() O? !M V? PS+ PE+++ Y+ t+ 5++ X++
R(+) !tv b++(++++) D++ G>++ e++> h--()(*) r+ y+()
--- END GEEK CODE BLOCK ---
