matchAll

matchAll returns a list of matches. The matches are in order and do not overlap. If any match succeeds but has 0 length then this will be the last match in the list.

This is matchAll with the actual subsections of the source instead of just the (offset,length) information.

wrapMatchAll returns the offset and length of each capture. Unused captures have an offset of unusedRegOffset which is (-1) and length of 0.

Using the standard algorithm for regular expression matching only the longest match in the string is retrieved. This function uses a different algorithm so it can retrieve all the possible matches. For more documentation see regexMatchAllFull. A MatchInfo structure, used to get information on the match, is stored in matchInfo if not Nothing. Note that if matchInfo is not Nothing then it is created even if the function returns False, i.e. you must free it regardless if regular expression actually matched. string is not copied and is used in MatchInfo internally. If you use any MatchInfo method (except matchInfoFree) after freeing or modifying string then the behaviour is undefined. Since: 2.14

Using the standard algorithm for regular expression matching only the longest match in the string is retrieved, it is not possible to obtain all the available matches. For instance matching "<a> <b> <c>" against the pattern "<.*>" you get "<a> <b> <c>". This function uses a different algorithm (called DFA, i.e. deterministic finite automaton), so it can retrieve all the possible matches, all starting at the same point in the string. For instance matching "<a> <b> <c>" against the pattern "<.*>;" you would obtain three matches: "<a> <b> <c>", "<a> <b>" and "<a>". The number of matched strings is retrieved using matchInfoGetMatchCount. To obtain the matched strings and their position you can use, respectively, matchInfoFetch and matchInfoFetchPos. Note that the strings are returned in reverse order of length; that is, the longest matching string is given first. Note that the DFA algorithm is slower than the standard one and it is not able to capture substrings, so backreferences do not work. Setting startPosition differs from just passing over a shortened string and setting RegexMatchFlagsNotbol in the case of a pattern that begins with any kind of lookbehind assertion, such as "\b". Unless RegexCompileFlagsRaw is specified in the options, string must be valid UTF-8. A MatchInfo structure, used to get information on the match, is stored in matchInfo if not Nothing. Note that if matchInfo is not Nothing then it is created even if the function returns False, i.e. you must free it regardless if regular expression actually matched. string is not copied and is used in MatchInfo internally. If you use any MatchInfo method (except matchInfoFree) after freeing or modifying string then the behaviour is undefined. Since: 2.14

wrapMatchAll is an improvement over wrapMatch since it only allocates memory with allocaBytes once at the start.

The filter matches all items, filterMatch will alays return True.

The filter matches all items, filterMatch will alays return true