Lrexlib 2.6

by Reuben Thomas (rrt@sc3d.org)

and Shmuel Zeigerman (shmuz@013net.net) [maintainer]

Lrexlib provides bindings of five regular expression library APIs -(POSIX, PCRE, GNU, TRE and Oniguruma) to Lua 5.1 and Lua 5.2. -The bindings for TRE and Oniguruma are not currently complete.

Lrexlib is copyright Reuben Thomas 2000-2012 and copyright Shmuel -Zeigerman 2004-2012, and is released under the same license as Lua, -the MIT license (otherwise known as the revised BSD license). There -is no warranty.

Please report bugs and make suggestions to the maintainer, or use the -LuaForge trackers and mailing lists.

Thanks to Thatcher Ulrich for bug and warning fixes, and to Nick -Gammon for adding support for PCRE named subpatterns.

Lrexlib

Copyright © Reuben Thomas 2000-2012
Copyright © Shmuel Zeigerman 2004-2012 diff -Nru lua-rexlib-2.6.0/doc/manual.html lua-rexlib-2.7.2/doc/manual.html --- lua-rexlib-2.6.0/doc/manual.html 2012-04-12 17:37:56.000000000 +0000 +++ lua-rexlib-2.7.2/doc/manual.html 1970-01-01 00:00:00.000000000 +0000 @@ -1,1337 +0,0 @@ - - - - - - -Lrexlib 2.6 Reference Manual - - - -

Lrexlib 2.6 Reference Manual

- -

Table of Contents

Notes
Functions and methods common to all bindings
- match
- find
- gmatch
- gsub
- split
- flags
- new
- tfind
- exec
-
PCRE-only functions and methods
- new
- dfa_exec
- maketables
- config
- version
-
GNU-only functions and methods
- new
-
Oniguruma-only functions and methods
- new
- setdefaultsyntax
- version
-
TRE-only functions and methods
- new
- atfind
- aexec
- have_approx
- have_backrefs
- config
- rex_tre.version
-
Incompatibilities with previous versions

Lrexlib builds into shared libraries called by default rex_posix.so, -rex_pcre.so, rex_gnu.so, rex_tre.so and rex_onig.so, which can be used with -require.

Notes

Most functions and methods in Lrexlib have mandatory and optional arguments. -There are no dependencies between arguments in Lrexlib's functions and -methods. Any optional argument can be supplied as nil (or omitted if it -is a trailing argument), the library will then use the default value for that -argument.
-
This document uses the following syntax for optional arguments: they are -bracketed separately, and commas are left outside brackets, e.g.:
-
```
-MyFunc (arg1, arg2, [arg3], [arg4])
-
```
-
Throughout this document (unless it causes ambiguity), the identifier rex -is used in place of either rex_posix, rex_pcre, rex_gnu, rex_onig or -rex_tre, which are the default namespaces for the corresponding libraries.
-
All functions that take a regular expression pattern as an argument will -generate an error if that pattern is found invalid by the regex library.
-
All functions that take a string-type regex argument accept a compiled regex -too. In this case, the cf and larg arguments are ignored (should -be either supplied as nils or omitted).
-

The default value for compilation flags (cf) that Lrexlib uses when -the parameter is not supplied or nil is:

-
-
REG_EXTENDED for POSIX and TRE
-
0 for PCRE
-
ONIG_OPTION_NONE for Oniguruma
-
SYNTAX_POSIX_EXTENDED for GNU
-
-

PCRE, Oniguruma: cf may also be supplied as a string, whose -characters stand for compilation flags. Combinations of the following -characters (case sensitive) are supported:

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

Character
-
PCRE flag
-
Oniguruma flag
-
i
-
PCRE_CASELESS
-
ONIG_OPTION_IGNORECASE
-
m
-
PCRE_MULTILINE
-
ONIG_OPTION_NEGATE_SINGLELINE
-
s
-
PCRE_DOTALL
-
ONIG_OPTION_MULTILINE
-
x
-
PCRE_EXTENDED
-
ONIG_OPTION_EXTEND
-
U
-
PCRE_UNGREEDY
-
n/a
-
X
-
PCRE_EXTRA
-
n/a
-
-

Character -	PCRE flag -	Oniguruma flag -
i -	PCRE_CASELESS -	ONIG_OPTION_IGNORECASE -
m -	PCRE_MULTILINE -	ONIG_OPTION_NEGATE_SINGLELINE -
s -	PCRE_DOTALL -	ONIG_OPTION_MULTILINE -
x -	PCRE_EXTENDED -	ONIG_OPTION_EXTEND -
U -	PCRE_UNGREEDY -	n/a -
X -	PCRE_EXTRA -	n/a -

The default value for execution flags (ef) that Lrexlib uses when -the parameter is not supplied or nil, is:
-
-
- 0 for standard POSIX regex library
- REG_STARTEND for those POSIX regex libraries that support it, -e.g. Spencer's.
- 0 for PCRE, Oniguruma and TRE
-
-

The notation larg... is used to indicate optional library-specific -arguments, which are documented in the new method of each library.

Functions and methods common to all bindings

match

rex.match (subj, patt, [init], [cf], [ef], [larg...])

r:match (subj, [init], [ef])

The function searches for the first match of the regexp patt in the string -subj, starting from offset init, subject to flags cf and ef.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
patt regular expression pattern string -or -userdata n/a
[init] start offset in the subject -(can be negative) number 1
[cf] compilation flags (bitwise OR) number cf
[ef] execution flags (bitwise OR) number ef
[larg...] library-specific arguments
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
patt	regular expression pattern	string -or -userdata	n/a
[init]	start offset in the subject -(can be negative)	number	1
[cf]	compilation flags (bitwise OR)	number	cf
[ef]	execution flags (bitwise OR)	number	ef
[larg...]	library-specific arguments

Returns on success:

All substring matches ("captures"), in the order they appear in the -pattern. false is returned for sub-patterns that did not participate in -the match. If the pattern specified no captures then the whole matched -substring is returned.

Returns on failure:

nil

find

rex.find (subj, patt, [init], [cf], [ef], [larg...])

r:find (subj, [init], [ef])

The function searches for the first match of the regexp patt in the string -subj, starting from offset init, subject to flags cf and ef.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
patt regular expression pattern string -or -userdata n/a
[init] start offset in the subject -(can be negative) number 1
[cf] compilation flags (bitwise OR) number cf
[ef] execution flags (bitwise OR) number ef
[larg...] library-specific arguments
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
patt	regular expression pattern	string -or -userdata	n/a
[init]	start offset in the subject -(can be negative)	number	1
[cf]	compilation flags (bitwise OR)	number	cf
[ef]	execution flags (bitwise OR)	number	ef
[larg...]	library-specific arguments

Returns on success:

The start point of the match (a number).
The end point of the match (a number).
All substring matches ("captures"), in the order they appear in the -pattern. false is returned for sub-patterns that did not participate in -the match.

Returns on failure:

nil

gmatch

rex.gmatch (subj, patt, [cf], [ef], [larg...])

The function is intended for use in the generic for Lua construct. -It returns an iterator for repeated matching of the pattern patt in -the string subj, subject to flags cf and ef.

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

Parameter Description Type Default Value
subj subject string n/a
patt regular expression pattern string -or -userdata n/a
[cf] compilation flags (bitwise OR) number cf
[ef] execution flags (bitwise OR) number ef
[larg...] library-specific arguments
-

Parameter	Description	Type	Default Value
subj	subject	string	n/a
patt	regular expression pattern	string -or -userdata	n/a
[cf]	compilation flags (bitwise OR)	number	cf
[ef]	execution flags (bitwise OR)	number	ef
[larg...]	library-specific arguments

The iterator function is called by Lua. On every iteration (that is, on every -match), it returns all captures in the order they appear in the pattern (or the -entire match if the pattern specified no captures). The iteration will continue -till the subject fails to match.

gsub

rex.gsub (subj, patt, repl, [n], [cf], [ef], [larg...])

This function searches for all matches of the pattern patt in the string -subj and replaces them according to the parameters repl and n (see details -below).

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

Parameter Description Type Default Value
subj subject string n/a
patt regular expression pattern string or userdata n/a
repl substitution source string, function or table n/a
[n] maximum number of matches to search -for, or control function, or nil number or function nil
[cf] compilation flags (bitwise OR) number cf
[ef] execution flags (bitwise OR) number ef
[larg...] library-specific arguments
-

Parameter	Description	Type	Default Value
subj	subject	string	n/a
patt	regular expression pattern	string or userdata	n/a
repl	substitution source	string, function or table	n/a
[n]	maximum number of matches to search -for, or control function, or nil	number or function	`nil`
[cf]	compilation flags (bitwise OR)	number	cf
[ef]	execution flags (bitwise OR)	number	ef
[larg...]	library-specific arguments

Returns:

The subject string with the substitutions made.
Number of matches found.
Number of substitutions made.

Details:

The parameter repl can be either a string, a function or a table. -On each match made, it is converted into a value repl_out that may be used -for the replacement.

repl_out is generated differently depending on the type of repl:

If repl is a string then it is treated as a template for substitution, -where the %X occurences in repl are handled in a special way, depending -on the value of the character X:

-
-
if X represents a digit, then each %X occurence is substituted by the -value of the X-th submatch (capture), with the following cases handled -specially:
-
each %0 is substituted by the entire match
-
if the pattern contains no captures, then each %1 is substituted by the -entire match
-
any other %X where X is greater than the number of captures in the -pattern will generate an error ("invalid capture index")
-
if the pattern does contain a capture with number X but that capture -didn't participate in the match, then %X is substituted by an empty -string
-
-
-
if X is any non-digit character then %X is substituted by X
-
-
All parts of repl other than %X are copied to repl_out verbatim.
-

If repl is a function then it is called on each match with the -submatches passed as parameters (if there are no submatches then the entire -match is passed as the only parameter). repl_out is the return value of -the repl call, and is interpreted as follows:

-
-
if it is a string or a number (coerced to a string), then the replacement -value is that string;
-
if it is a nil or a false, then no replacement is to be done;
-
-

If repl is a table then repl_out is repl [m1], where m1 is the first -submatch (or the entire match if there are no submatches), following the -same rules as for the return value of repl call, described in the above -paragraph.

Note: Under some circumstances, the value of repl_out may be ignored; see -below.

gsub behaves differently depending on the type of n:

If n is a number then it is treated as the maximum number of matches -to search for (an omitted or nil value means an unlimited number of -matches). On each match, the replacement value is the repl_out string -(see above).

-
-
If n is a function, then it is called on each match, after repl_out is -produced (so if repl is a function, it will be called prior to the n -call).
-
n receives 3 arguments and returns 2 values. Its arguments are:
-
-
-
The start offset of the match (a number)
-
The end offset of the match (a number)
-
repl_out
-
-
-
The type of its first return controls the replacement produced by gsub for -the current match:
-
-
-
true -- replace/don't replace, according to repl_out;
-
nil/false -- don't replace;
-
a string (or a number coerced to a string) -- replace by that string;
-
-
-
The type of its second return controls gsub behavior after the current -match is handled:
-
-
-
nil/false -- no changes: n will be called on the next match;
-
true -- search for an unlimited number of matches; n will not be -called again;
-
a number -- maximum number of matches to search for, beginning from the -next match; n will not be called again;
-
-
-
-
-

split

rex.split (subj, sep, [cf], [ef], [larg...])

The function is intended for use in the generic for Lua construct. -It is used for splitting a subject string subj into parts (sections). -The sep parameter is a regular expression pattern representing -separators between the sections.

The function returns an iterator for repeated matching of the pattern sep in -the string subj, subject to flags cf and ef.

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

Parameter Description Type Default Value
subj subject string n/a
sep separator (regular expression -pattern) string -or -userdata n/a
[cf] compilation flags (bitwise OR) number cf
[ef] execution flags (bitwise OR) number ef
[larg...] library-specific arguments
-

Parameter	Description	Type	Default Value
subj	subject	string	n/a
sep	separator (regular expression -pattern)	string -or -userdata	n/a
[cf]	compilation flags (bitwise OR)	number	cf
[ef]	execution flags (bitwise OR)	number	ef
[larg...]	library-specific arguments

On every iteration pass, the iterator returns:

-
-
A subject section (can be an empty string), followed by
-
All captures in the order they appear in the sep pattern (or the entire -match if the sep pattern specified no captures). If there is no match -(this can occur only in the last iteration), then nothing is returned after -the subject section.
-
-

The iteration will continue till the end of the subject. Unlike gmatch, there -will always be at least one iteration pass, even if there are no matches in the -subject.

flags

rex.flags ([tb])

This function returns a table containing the numeric values of the constants -defined by the used regex library, with the keys being the (string) names of the -constants. If the table argument tb is supplied then it is used as the output -table, otherwise a new table is created.

The constants contained in the returned table can then be used in most functions -and methods where compilation flags or execution flags can be specified. -They can also be used for comparing with return codes of some functions and -methods for determining the reason of failure. For details, see the relevant -regex library's documentation.

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

Parameter Description Type Default Value
[tb] a table for placing results into table nil
-

Parameter	Description	Type	Default Value
[tb]	a table for placing results into	table	`nil`

Returns:

A table filled with the results.

Notes: -The keys in the tb table are formed from the names of the corresponding -constants in the used library. They are formed as follows:

POSIX, TRE: prefix REG_ is omitted, e.g. REG_ICASE becomes "ICASE".
PCRE: prefix PCRE_ is omitted, e.g. PCRE_CASELESS becomes -"CASELESS".
Oniguruma: names of constants are converted to strings with no alteration, -but for ONIG_OPTION_xxx constants, alias strings are created additionally, -e.g., the value of ONIG_OPTION_IGNORECASE constant becomes accessible via -either of two keys: "ONIG_OPTION_IGNORECASE" and "IGNORECASE".
GNU: the GNU library provides the flags not_bol, which stops a -beginning-of-line anchor from matching at the start of a string, not_eol, -which stops an end-of-line anchor from matching at the end of a string, and -backward which causes the search to be performed backwards (that is, the -pattern is matched from positions starting at the end of the string; however, -the matches themselves are still made forwards), as well as the RE_xxx syntax -specifiers (as defined in regex.h), omitting the RE_ prefix. For example, -RE_SYNTAX_GREP becomes SYNTAX_GREP in Lua.

new

rex.new (patt, [cf], [larg...])

The function compiles regular expression patt into a regular expression object -whose internal representation is corresponding to the library used. The returned -result then can be used by the methods, e.g. tfind, exec, etc. Regular -expression objects are automatically garbage collected. See the library-specific -documentation below for details of the library-specific arguments larg..., if -any.

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

Parameter Description Type Default Value
patt regular expression pattern string n/a
[cf] compilation flags (bitwise OR) number cf
[larg...] library-specific arguments
-

Parameter	Description	Type	Default Value
patt	regular expression pattern	string	n/a
[cf]	compilation flags (bitwise OR)	number	cf
[larg...]	library-specific arguments

Returns:

Compiled regular expression (a userdata).

tfind

r:tfind (subj, [init], [ef])

The method searches for the first match of the compiled regexp r in the -string subj, starting from offset init, subject to execution flags ef.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
[init] start offset in the subject -(can be negative) number 1
[ef] execution flags (bitwise OR) number ef
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
[init]	start offset in the subject -(can be negative)	number	1
[ef]	execution flags (bitwise OR)	number	ef

Returns on success:

The start point of the match (a number).
The end point of the match (a number).
Substring matches ("captures" in Lua terminology) are returned as a third -result, in a table. This table contains false in the positions where the -corresponding sub-pattern did not participate in the match.
1. PCRE, Oniguruma: if named subpatterns are used then the table -also contains substring matches keyed by their correspondent subpattern -names (strings).
-

Returns on failure:

nil

exec

r:exec (subj, [init], [ef])

The method searches for the first match of the compiled regexp r in the -string subj, starting from offset init, subject to execution flags ef.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
[init] start offset in the subject -(can be negative) number 1
[ef] execution flags (bitwise OR) number ef
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
[init]	start offset in the subject -(can be negative)	number	1
[ef]	execution flags (bitwise OR)	number	ef

Returns on success:

The start point of the first match (a number).
The end point of the first match (a number).
The offsets of substring matches ("captures" in Lua terminology) are -returned as a third result, in a table. This table contains false in the -positions where the corresponding sub-pattern did not participate in the -match.
1. PCRE, Oniguruma: if named subpatterns are used then the table -also contains substring matches keyed by their correspondent subpattern -names (strings).
-

Returns on failure:

nil

Example:

If the whole match is at offsets 10,20 and substring matches are at offsets -12,14 and 16,19 then the function returns the following: 10, 20, -{ 12,14,16,19 }.

PCRE-only functions and methods

new

rex.new (patt, [cf], [lo])

The locale (lo) can be either a string (e.g., "French_France.1252"), or a -userdata obtained from a call to maketables. The default value, used when the -parameter is not supplied or nil, is the built-in PCRE set of character -tables.

dfa_exec

[PCRE 6.0 and later. See pcre_dfa_exec in the PCRE docs.]

r:dfa_exec (subj, [init], [ef], [ovecsize], [wscount])

The method matches a compiled regular expression r against a given subject -string subj, using a DFA matching algorithm.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
[init] start offset in the subject -(can be negative) number 1
[ef] execution flags (bitwise OR) number ef
[ovecsize] size of the array for result offsets number 100
[wscount] number of elements in the working -space array number 50
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
[init]	start offset in the subject -(can be negative)	number	1
[ef]	execution flags (bitwise OR)	number	ef
[ovecsize]	size of the array for result offsets	number	100
[wscount]	number of elements in the working -space array	number	50

Returns on success (either full or partial match):

The start point of the matches found (a number).
A table containing the end points of the matches found, the longer matches -first.
The return value of the underlying pcre_dfa_exec call (a number).

Returns on failure (no match):

nil

Example:

If there are 3 matches found starting at offset 10 and ending at offsets 15, 20 -and 25 then the function returns the following: 10, { 25,20,15 }, 3.

maketables

[See pcre_maketables in the PCRE docs.]

rex_pcre.maketables ()

Creates a set of character tables corresponding to the current locale and -returns it as a userdata. The returned value can be passed to any Lrexlib -function accepting the locale parameter.

config

[PCRE 4.0 and later. See pcre_config in the PCRE docs.]

rex_pcre.config ([tb])

This function returns a table containing the values of the configuration -parameters used at PCRE library build-time. Those parameters (numbers) are -keyed by their names (strings). If the table argument tb is supplied then it -is used as the output table, else a new table is created.

version

[See pcre_version in the PCRE docs.]

rex_pcre.version ()

This function returns a string containing the version of the used PCRE library -and its release date.

GNU-only functions and methods

new

rex.new (patt, [cf], [tr])

If the compilation flags (cf) are not supplied or nil, the default syntax -is SYNTAX_POSIX_EXTENDED. Note that this is not the same as passing a value -of zero, which is the same as SYNTAX_EMACS.

The translation parameter (tr) is a map of eight-bit character codes (0 to -255 inclusive) to 8-bit characters (strings). If this parameter is given, the -pattern is translated at compilation time, and each string to be matched is -translated when it is being matched.

Oniguruma-only functions and methods

new

rex.new (patt, [cf], [enc], [syn])

The encoding parameter (enc) must be one of the predefined strings that are -formed from the ONIG_ENCODING_xxx identifiers defined in oniguruma.h, by means -of omitting the ONIG_ENCODING_ part. For example, ONIG_ENCODING_UTF8 becomes -"UTF8" on the Lua side. The default value, used when the parameter is not -supplied or nil, is "ASCII".

If the caller-supplied value of this parameter is not one of the predefined -"encoding" string set, an error is raised.

The syntax parameter (syn) must be one of the predefined strings that are -formed from the ONIG_SYNTAX_xxx identifiers defined in oniguruma.h, by means of -omitting the ONIG_SYNTAX_ part. For example, ONIG_SYNTAX_JAVA becomes -"JAVA" on the Lua side. The default value, used when the parameter is not -supplied or nil, is either "RUBY" (at start-up), or the value set by the -last setdefaultsyntax call.

If the caller-supplied value of syntax parameter is not one of the predefined -"syntax" string set, an error is raised.

setdefaultsyntax

rex_onig.setdefaultsyntax (syntax)

This function sets the default syntax for the Oniguruma library, according to the -value of the string syntax. The specified syntax will be further used for -interpreting string regex patterns by all relevant functions, unless the syntax -argument is passed to those functions explicitly.

Returns: nothing

Examples:

-
-
rex_onig.setdefaultsyntax ("ASIS") -- use plain text syntax as the default
-
rex_onig.setdefaultsyntax ("PERL") -- use PERL regex syntax as the default
-
-

version

[See onig_version in the Oniguruma docs.]

rex_onig.version ()

This function returns a string containing the version of the used Oniguruma -library.

TRE-only functions and methods

new

rex.new (patt, [cf])

atfind

r:atfind (subj, params, [init], [ef])

The method searches for the first match of the compiled regexp r in the -string subj, starting from offset init, subject to execution flags ef.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
params Approximate matching parameters. -The values are integers. -The valid string key values are: -cost_ins, cost_del, -cost_subst, max_cost, -max_ins, max_del, -max_subst, max_err table
n/a
-
(Default -value for -a missing -field is 0)
-
[init] start offset in the subject -(can be negative) number 1
[ef] execution flags (bitwise OR) number ef
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
params	Approximate matching parameters. -The values are integers. -The valid string key values are: -`cost_ins`, `cost_del`, -`cost_subst`, `max_cost`, -`max_ins`, `max_del`, -`max_subst`, `max_err`	table	n/a - (Default -value for -a missing -field is 0) -
[init]	start offset in the subject -(can be negative)	number	1
[ef]	execution flags (bitwise OR)	number	ef

Returns on success:

The start point of the match (a number).
The end point of the match (a number).
Substring matches ("captures" in Lua terminology) are returned as a third -result, in the array part of a table. Positions where the corresponding -sub-pattern did not participate in the match contain false. -The hash part of the table contains additional information on the match, -in the following fields: cost, num_ins, num_del and num_subst.

Returns on failure:

nil

aexec

r:aexec (subj, params, [init], [ef])

The method searches for the first match of the compiled regexp r in the -string subj, starting from offset init, subject to execution flags ef.

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

Parameter Description Type Default Value
r regex object produced by new userdata n/a
subj subject string n/a
params Approximate matching parameters. -The values are integers. -The valid string key values are: -cost_ins, cost_del, -cost_subst, max_cost, -max_ins, max_del, -max_subst, max_err table
n/a
-
(Default -value for -a missing -field is 0)
-
[init] start offset in the subject -(can be negative) number 1
[ef] execution flags (bitwise OR) number ef
-

Parameter	Description	Type	Default Value
r	regex object produced by new	userdata	n/a
subj	subject	string	n/a
params	Approximate matching parameters. -The values are integers. -The valid string key values are: -`cost_ins`, `cost_del`, -`cost_subst`, `max_cost`, -`max_ins`, `max_del`, -`max_subst`, `max_err`	table	n/a - (Default -value for -a missing -field is 0) -
[init]	start offset in the subject -(can be negative)	number	1
[ef]	execution flags (bitwise OR)	number	ef

Returns on success:

The start point of the first match (a number).
The end point of the first match (a number).
The offsets of substring matches ("captures" in Lua terminology) are -returned as a third result, in the array part of a table. Positions where -the corresponding sub-pattern did not participate in the match contain -false. The hash part of the table contains additional information on -the match, in the following fields: cost, num_ins, num_del and -num_subst.

Returns on failure:

nil

have_approx

r:have_approx ()

The method returns true if the compiled pattern uses approximate matching, -and false if not.

have_backrefs

r:have_backrefs ()

The method returns true if the compiled pattern has back references, -and false if not.

config

[See tre_config in the TRE docs.]

rex_tre.config ([tb])

This function returns a table containing the values of the configuration -parameters used at TRE library build-time. Those parameters are -keyed by their names. If the table argument tb is supplied then it -is used as the output table, else a new table is created.

rex_tre.version

[See tre_version in the TRE docs.]

rex_tre.version ()

This function returns a string containing the version of the used TRE library.

Incompatibilities with previous versions

Incompatibilities between versions 2.6 and 2.5:

-
-
Removed function plainfind.
-
Global variables (e.g. rex_posix, rex_pcre, etc.) are not created -by default. This can be changed at the stage of compilation by adding --DREX_CREATEGLOBALVAR to CFLAGS.
-
-

Incompatibilities between versions 2.2 and 2.1:

-
-
gsub: a special "break" return of repl function is deprecated.
-
(PCRE) gsub, gmatch: after finding an empty match at the current -position, the functions try to find a non-empty match anchored to the same -position.
-
-

Incompatibilities between versions 2.1 and 2.0:

-
-
match, find, tfind, exec, dfa_exec: only one value (a nil) is -returned when the subject does not match the pattern. Any other failure -generates an error.
-
-

Incompatibilities between versions 2.0 and 1.19:

-
-
Lua 5.1 is required
-
Functions newPCRE and newPOSIX renamed to new
-
Functions flagsPCRE and flagsPOSIX renamed to flags
-
Function versionPCRE renamed to version
-
Method match renamed to tfind
-
Method gmatch removed (similar functionality is provided by function -gmatch)
-
Methods tfind and exec: 2 values are returned on failure
-
(PCRE) exec: the returned table may additionally contain named -subpatterns
-
-

- -/* Allow the use in C++ code. */ -#ifdef __cplusplus -extern "C" { -#endif - -/* Define __USE_GNU_REGEX to declare GNU extensions that violate the - POSIX name space rules. */ -#undef __USE_GNU_REGEX -#if (defined _GNU_SOURCE \ - || (!defined _POSIX_C_SOURCE && !defined _POSIX_SOURCE \ - && !defined _XOPEN_SOURCE)) -# define __USE_GNU_REGEX 1 -#endif - -#ifdef _REGEX_LARGE_OFFSETS - -/* Use types and values that are wide enough to represent signed and - unsigned byte offsets in memory. This currently works only when - the regex code is used outside of the GNU C library; it is not yet - supported within glibc itself, and glibc users should not define - _REGEX_LARGE_OFFSETS. */ - -/* The type of the offset of a byte within a string. - For historical reasons POSIX 1003.1-2004 requires that regoff_t be - at least as wide as off_t. However, many common POSIX platforms set - regoff_t to the more-sensible ssize_t and the Open Group has - signalled its intention to change the requirement to be that - regoff_t be at least as wide as ptrdiff_t and ssize_t; see XBD ERN - 60 (2005-08-25). We don't know of any hosts where ssize_t or - ptrdiff_t is wider than ssize_t, so ssize_t is safe. */ -typedef ssize_t regoff_t; - -/* The type of nonnegative object indexes. Traditionally, GNU regex - uses 'int' for these. Code that uses __re_idx_t should work - regardless of whether the type is signed. */ -typedef size_t __re_idx_t; - -/* The type of object sizes. */ -typedef size_t __re_size_t; - -/* The type of object sizes, in places where the traditional code - uses unsigned long int. */ -typedef size_t __re_long_size_t; - -#else - -/* Use types that are binary-compatible with the traditional GNU regex - implementation, which mishandles strings longer than INT_MAX. */ - -typedef int regoff_t; -typedef int __re_idx_t; -typedef unsigned int __re_size_t; -typedef unsigned long int __re_long_size_t; - -#endif - -/* The following two types have to be signed and unsigned integer type - wide enough to hold a value of a pointer. For most ANSI compilers - ptrdiff_t and size_t should be likely OK. Still size of these two - types is 2 for Microsoft C. Ugh... */ -typedef long int s_reg_t; -typedef unsigned long int active_reg_t; - -/* The following bits are used to determine the regexp syntax we - recognize. The set/not-set meanings are chosen so that Emacs syntax - remains the value 0. The bits are given in alphabetical order, and - the definitions shifted by one from the previous bit; thus, when we - add or remove a bit, only one other definition need change. */ -typedef unsigned long int reg_syntax_t; - -#ifdef __USE_GNU_REGEX - -/* If this bit is not set, then \ inside a bracket expression is literal. - If set, then such a \ quotes the following character. */ -# define RE_BACKSLASH_ESCAPE_IN_LISTS ((unsigned long int) 1) - -/* If this bit is not set, then + and ? are operators, and \+ and \? are - literals. - If set, then \+ and \? are operators and + and ? are literals. */ -# define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1) - -/* If this bit is set, then character classes are supported. They are: - [:alpha:], [:upper:], [:lower:], [:digit:], [:alnum:], [:xdigit:], - [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:]. - If not set, then character classes are not supported. */ -# define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1) - -/* If this bit is set, then ^ and $ are always anchors (outside bracket - expressions, of course). - If this bit is not set, then it depends: - ^ is an anchor if it is at the beginning of a regular - expression or after an open-group or an alternation operator; - $ is an anchor if it is at the end of a regular expression, or - before a close-group or an alternation operator. - - This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because - POSIX draft 11.2 says that * etc. in leading positions is undefined. - We already implemented a previous draft which made those constructs - invalid, though, so we haven't changed the code back. */ -# define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1) - -/* If this bit is set, then special characters are always special - regardless of where they are in the pattern. - If this bit is not set, then special characters are special only in - some contexts; otherwise they are ordinary. Specifically, - * + ? and intervals are only special when not after the beginning, - open-group, or alternation operator. */ -# define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1) - -/* If this bit is set, then *, +, ?, and { cannot be first in an re or - immediately after an alternation or begin-group operator. */ -# define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1) - -/* If this bit is set, then . matches newline. - If not set, then it doesn't. */ -# define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1) - -/* If this bit is set, then . doesn't match NUL. - If not set, then it does. */ -# define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1) - -/* If this bit is set, nonmatching lists [^...] do not match newline. - If not set, they do. */ -# define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1) - -/* If this bit is set, either \{...\} or {...} defines an - interval, depending on RE_NO_BK_BRACES. - If not set, \{, \}, {, and } are literals. */ -# define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1) - -/* If this bit is set, +, ? and | aren't recognized as operators. - If not set, they are. */ -# define RE_LIMITED_OPS (RE_INTERVALS << 1) - -/* If this bit is set, newline is an alternation operator. - If not set, newline is literal. */ -# define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1) - -/* If this bit is set, then `{...}' defines an interval, and \{ and \} - are literals. - If not set, then `\{...\}' defines an interval. */ -# define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1) - -/* If this bit is set, (...) defines a group, and $ and $ are literals. - If not set, $...$ defines a group, and ( and ) are literals. */ -# define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1) - -/* If this bit is set, then \ matches . - If not set, then \ is a back-reference. */ -# define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1) - -/* If this bit is set, then | is an alternation operator, and \| is literal. - If not set, then \| is an alternation operator, and | is literal. */ -# define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1) - -/* If this bit is set, then an ending range point collating higher - than the starting range point, as in [z-a], is invalid. - If not set, then when ending range point collates higher than the - starting range point, the range is ignored. */ -# define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1) - -/* If this bit is set, then an unmatched ) is ordinary. - If not set, then an unmatched ) is invalid. */ -# define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1) - -/* If this bit is set, succeed as soon as we match the whole pattern, - without further backtracking. */ -# define RE_NO_POSIX_BACKTRACKING (RE_UNMATCHED_RIGHT_PAREN_ORD << 1) - -/* If this bit is set, do not process the GNU regex operators. - If not set, then the GNU regex operators are recognized. */ -# define RE_NO_GNU_OPS (RE_NO_POSIX_BACKTRACKING << 1) - -/* If this bit is set, turn on internal regex debugging. - If not set, and debugging was on, turn it off. - This only works if regex.c is compiled -DDEBUG. - We define this bit always, so that all that's needed to turn on - debugging is to recompile regex.c; the calling code can always have - this bit set, and it won't affect anything in the normal case. */ -# define RE_DEBUG (RE_NO_GNU_OPS << 1) - -/* If this bit is set, a syntactically invalid interval is treated as - a string of ordinary characters. For example, the ERE 'a{1' is - treated as 'a\{1'. */ -# define RE_INVALID_INTERVAL_ORD (RE_DEBUG << 1) - -/* If this bit is set, then ignore case when matching. - If not set, then case is significant. */ -# define RE_ICASE (RE_INVALID_INTERVAL_ORD << 1) - -/* This bit is used internally like RE_CONTEXT_INDEP_ANCHORS but only - for ^, because it is difficult to scan the regex backwards to find - whether ^ should be special. */ -# define RE_CARET_ANCHORS_HERE (RE_ICASE << 1) - -/* If this bit is set, then \{ cannot be first in a regex or - immediately after an alternation, open-group or \} operator. */ -# define RE_CONTEXT_INVALID_DUP (RE_CARET_ANCHORS_HERE << 1) - -/* If this bit is set, then no_sub will be set to 1 during - re_compile_pattern. */ -# define RE_NO_SUB (RE_CONTEXT_INVALID_DUP << 1) - -/* If this bit is set, then all special characters are ignored - by re_compile_pattern. */ -# define RE_PLAIN (RE_NO_SUB << 1) - -#endif /* defined __USE_GNU_REGEX */ - -/* This global variable defines the particular regexp syntax to use (for - some interfaces). When a regexp is compiled, the syntax used is - stored in the pattern buffer, so changing this does not affect - already-compiled regexps. */ -extern reg_syntax_t re_syntax_options; - -#ifdef __USE_GNU_REGEX -/* Define combinations of the above bits for the standard possibilities. - (The [[[ comments delimit what gets put into the Texinfo file, so - don't delete them!) */ -/* [[[begin syntaxes]]] */ -# define RE_SYNTAX_EMACS 0 - -# define RE_SYNTAX_AWK \ - (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL \ - | RE_NO_BK_PARENS | RE_NO_BK_REFS \ - | RE_NO_BK_VBAR | RE_NO_EMPTY_RANGES \ - | RE_DOT_NEWLINE | RE_CONTEXT_INDEP_ANCHORS \ - | RE_UNMATCHED_RIGHT_PAREN_ORD | RE_NO_GNU_OPS) - -# define RE_SYNTAX_GNU_AWK \ - ((RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DEBUG) \ - & ~(RE_DOT_NOT_NULL | RE_INTERVALS | RE_CONTEXT_INDEP_OPS \ - | RE_CONTEXT_INVALID_OPS )) - -# define RE_SYNTAX_POSIX_AWK \ - (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS \ - | RE_INTERVALS | RE_NO_GNU_OPS) - -# define RE_SYNTAX_GREP \ - (RE_BK_PLUS_QM | RE_CHAR_CLASSES \ - | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS \ - | RE_NEWLINE_ALT) - -# define RE_SYNTAX_EGREP \ - (RE_CHAR_CLASSES | RE_CONTEXT_INDEP_ANCHORS \ - | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE \ - | RE_NEWLINE_ALT | RE_NO_BK_PARENS \ - | RE_NO_BK_VBAR) - -# define RE_SYNTAX_POSIX_EGREP \ - (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES \ - | RE_INVALID_INTERVAL_ORD) - -/* P1003.2/D11.2, section 4.20.7.1, lines 5078ff. */ -# define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC - -# define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC - -/* Syntax bits common to both basic and extended POSIX regex syntax. */ -# define _RE_SYNTAX_POSIX_COMMON \ - (RE_CHAR_CLASSES | RE_DOT_NEWLINE | RE_DOT_NOT_NULL \ - | RE_INTERVALS | RE_NO_EMPTY_RANGES) - -# define RE_SYNTAX_POSIX_BASIC \ - (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM | RE_CONTEXT_INVALID_DUP) - -/* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes - RE_LIMITED_OPS, i.e., \? \+ \| are not recognized. Actually, this - isn't minimal, since other operators, such as \`, aren't disabled. */ -# define RE_SYNTAX_POSIX_MINIMAL_BASIC \ - (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS) - -# define RE_SYNTAX_POSIX_EXTENDED \ - (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ - | RE_CONTEXT_INDEP_OPS | RE_NO_BK_BRACES \ - | RE_NO_BK_PARENS | RE_NO_BK_VBAR \ - | RE_CONTEXT_INVALID_OPS | RE_UNMATCHED_RIGHT_PAREN_ORD) - -/* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INDEP_OPS is - removed and RE_NO_BK_REFS is added. */ -# define RE_SYNTAX_POSIX_MINIMAL_EXTENDED \ - (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS \ - | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES \ - | RE_NO_BK_PARENS | RE_NO_BK_REFS \ - | RE_NO_BK_VBAR | RE_UNMATCHED_RIGHT_PAREN_ORD) -/* [[[end syntaxes]]] */ - -#endif /* defined __USE_GNU_REGEX */ - -#ifdef __USE_GNU_REGEX - -/* Maximum number of duplicates an interval can allow. POSIX-conforming - systems might define this in , but we want our - value, so remove any previous define. */ -# ifdef RE_DUP_MAX -# undef RE_DUP_MAX -# endif - -/* RE_DUP_MAX is 2**15 - 1 because an earlier implementation stored - the counter as a 2-byte signed integer. This is no longer true, so - RE_DUP_MAX could be increased to (INT_MAX / 10 - 1), or to - ((SIZE_MAX - 2) / 10 - 1) if _REGEX_LARGE_OFFSETS is defined. - However, there would be a huge performance problem if someone - actually used a pattern like a\{214748363\}, so RE_DUP_MAX retains - its historical value. */ -# define RE_DUP_MAX (0x7fff) - -#endif /* defined __USE_GNU_REGEX */ - - -/* POSIX `cflags' bits (i.e., information for `regcomp'). */ - -/* If this bit is set, then use extended regular expression syntax. - If not set, then use basic regular expression syntax. */ -#define REG_EXTENDED 1 - -/* If this bit is set, then ignore case when matching. - If not set, then case is significant. */ -#define REG_ICASE (1 << 1) - -/* If this bit is set, then anchors do not match at newline - characters in the string. - If not set, then anchors do match at newlines. */ -#define REG_NEWLINE (1 << 2) - -/* If this bit is set, then report only success or fail in regexec. - If not set, then returns differ between not matching and errors. */ -#define REG_NOSUB (1 << 3) - - -/* POSIX `eflags' bits (i.e., information for regexec). */ - -/* If this bit is set, then the beginning-of-line operator doesn't match - the beginning of the string (presumably because it's not the - beginning of a line). - If not set, then the beginning-of-line operator does match the - beginning of the string. */ -#define REG_NOTBOL 1 - -/* Like REG_NOTBOL, except for the end-of-line. */ -#define REG_NOTEOL (1 << 1) - -/* Use PMATCH[0] to delimit the start and end of the search in the - buffer. */ -#define REG_STARTEND (1 << 2) - - -/* If any error codes are removed, changed, or added, update the - `__re_error_msgid' table in regcomp.c. */ - -typedef enum -{ - _REG_ENOSYS = -1, /* This will never happen for this implementation. */ - _REG_NOERROR = 0, /* Success. */ - _REG_NOMATCH, /* Didn't find a match (for regexec). */ - - /* POSIX regcomp return error codes. (In the order listed in the - standard.) */ - _REG_BADPAT, /* Invalid pattern. */ - _REG_ECOLLATE, /* Invalid collating element. */ - _REG_ECTYPE, /* Invalid character class name. */ - _REG_EESCAPE, /* Trailing backslash. */ - _REG_ESUBREG, /* Invalid back reference. */ - _REG_EBRACK, /* Unmatched left bracket. */ - _REG_EPAREN, /* Parenthesis imbalance. */ - _REG_EBRACE, /* Unmatched \{. */ - _REG_BADBR, /* Invalid contents of \{\}. */ - _REG_ERANGE, /* Invalid range end. */ - _REG_ESPACE, /* Ran out of memory. */ - _REG_BADRPT, /* No preceding re for repetition op. */ - - /* Error codes we've added. */ - _REG_EEND, /* Premature end. */ - _REG_ESIZE, /* Compiled pattern bigger than 2^16 bytes. */ - _REG_ERPAREN /* Unmatched ) or \); not returned from regcomp. */ -} reg_errcode_t; - -#ifdef _XOPEN_SOURCE -# define REG_ENOSYS _REG_ENOSYS -#endif -#define REG_NOERROR _REG_NOERROR -#define REG_NOMATCH _REG_NOMATCH -#define REG_BADPAT _REG_BADPAT -#define REG_ECOLLATE _REG_ECOLLATE -#define REG_ECTYPE _REG_ECTYPE -#define REG_EESCAPE _REG_EESCAPE -#define REG_ESUBREG _REG_ESUBREG -#define REG_EBRACK _REG_EBRACK -#define REG_EPAREN _REG_EPAREN -#define REG_EBRACE _REG_EBRACE -#define REG_BADBR _REG_BADBR -#define REG_ERANGE _REG_ERANGE -#define REG_ESPACE _REG_ESPACE -#define REG_BADRPT _REG_BADRPT -#define REG_EEND _REG_EEND -#define REG_ESIZE _REG_ESIZE -#define REG_ERPAREN _REG_ERPAREN - -/* struct re_pattern_buffer normally uses member names like `buffer' - that POSIX does not allow. In POSIX mode these members have names - with leading `re_' (e.g., `re_buffer'). */ -#ifdef __USE_GNU_REGEX -# define _REG_RE_NAME(id) id -# define _REG_RM_NAME(id) id -#else -# define _REG_RE_NAME(id) re_##id -# define _REG_RM_NAME(id) rm_##id -#endif - -/* The user can specify the type of the re_translate member by - defining the macro RE_TRANSLATE_TYPE, which defaults to unsigned - char *. This pollutes the POSIX name space, so in POSIX mode just - use unsigned char *. */ -#ifdef __USE_GNU_REGEX -# ifndef RE_TRANSLATE_TYPE -# define RE_TRANSLATE_TYPE unsigned char * -# endif -# define REG_TRANSLATE_TYPE RE_TRANSLATE_TYPE -#else -# define REG_TRANSLATE_TYPE unsigned char * -#endif - -/* This data structure represents a compiled pattern. Before calling - the pattern compiler, the fields `buffer', `allocated', `fastmap', - `translate', and `no_sub' can be set. After the pattern has been - compiled, the `re_nsub' field is available. All other fields are - private to the regex routines. */ - -struct re_pattern_buffer -{ - /* Space that holds the compiled pattern. It is declared as - `unsigned char *' because its elements are sometimes used as - array indexes. */ - unsigned char *_REG_RE_NAME (buffer); - - /* Number of bytes to which `buffer' points. */ - __re_long_size_t _REG_RE_NAME (allocated); - - /* Number of bytes actually used in `buffer'. */ - __re_long_size_t _REG_RE_NAME (used); - - /* Syntax setting with which the pattern was compiled. */ - reg_syntax_t _REG_RE_NAME (syntax); - - /* Pointer to a fastmap, if any, otherwise zero. re_search uses the - fastmap, if there is one, to skip over impossible starting points - for matches. */ - char *_REG_RE_NAME (fastmap); - - /* Either a translate table to apply to all characters before - comparing them, or zero for no translation. The translation is - applied to a pattern when it is compiled and to a string when it - is matched. */ - REG_TRANSLATE_TYPE _REG_RE_NAME (translate); - - /* Number of subexpressions found by the compiler. */ - size_t re_nsub; - - /* Zero if this pattern cannot match the empty string, one else. - Well, in truth it's used only in `re_search_2', to see whether or - not we should use the fastmap, so we don't set this absolutely - perfectly; see `re_compile_fastmap' (the `duplicate' case). */ - unsigned int _REG_RE_NAME (can_be_null) : 1; - - /* If REGS_UNALLOCATED, allocate space in the `regs' structure - for `max (RE_NREGS, re_nsub + 1)' groups. - If REGS_REALLOCATE, reallocate space if necessary. - If REGS_FIXED, use what's there. */ -#ifdef __USE_GNU_REGEX -# define REGS_UNALLOCATED 0 -# define REGS_REALLOCATE 1 -# define REGS_FIXED 2 -#endif - unsigned int _REG_RE_NAME (regs_allocated) : 2; - - /* Set to zero when `re_compile_pattern' compiles a pattern; set to - one by `re_compile_fastmap' if it updates the fastmap. */ - unsigned int _REG_RE_NAME (fastmap_accurate) : 1; - - /* If set, `re_match_2' does not return information about - subexpressions. */ - unsigned int _REG_RE_NAME (no_sub) : 1; - - /* If set, a beginning-of-line anchor doesn't match at the beginning - of the string. */ - unsigned int _REG_RE_NAME (not_bol) : 1; - - /* Similarly for an end-of-line anchor. */ - unsigned int _REG_RE_NAME (not_eol) : 1; - - /* If true, an anchor at a newline matches. */ - unsigned int _REG_RE_NAME (newline_anchor) : 1; - -/* [[[end pattern_buffer]]] */ -}; - -typedef struct re_pattern_buffer regex_t; - -/* This is the structure we store register match data in. See - regex.texinfo for a full description of what registers match. */ -struct re_registers -{ - __re_size_t _REG_RM_NAME (num_regs); - regoff_t *_REG_RM_NAME (start); - regoff_t *_REG_RM_NAME (end); -}; - - -/* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer, - `re_match_2' returns information about at least this many registers - the first time a `regs' structure is passed. */ -#if !defined RE_NREGS && defined __USE_GNU_REGEX -# define RE_NREGS 30 -#endif - - -/* POSIX specification for registers. Aside from the different names than - `re_registers', POSIX uses an array of structures, instead of a - structure of arrays. */ -typedef struct -{ - regoff_t rm_so; /* Byte offset from string's start to substring's start. */ - regoff_t rm_eo; /* Byte offset from string's start to substring's end. */ -} regmatch_t; - -/* Declarations for routines. */ - -/* Sets the current default syntax to SYNTAX, and return the old syntax. - You can also simply assign to the `re_syntax_options' variable. */ -extern reg_syntax_t re_set_syntax (reg_syntax_t __syntax); - -/* Compile the regular expression PATTERN, with length LENGTH - and syntax given by the global `re_syntax_options', into the buffer - BUFFER. Return NULL if successful, and an error string if not. */ -extern const char *re_compile_pattern (const char *__pattern, size_t __length, - struct re_pattern_buffer *__buffer); - - -/* Compile a fastmap for the compiled pattern in BUFFER; used to - accelerate searches. Return 0 if successful and -2 if was an - internal error. */ -extern int re_compile_fastmap (struct re_pattern_buffer *__buffer); - - -/* Search in the string STRING (with length LENGTH) for the pattern - compiled into BUFFER. Start searching at position START, for RANGE - characters. Return the starting position of the match, -1 for no - match, or -2 for an internal error. Also return register - information in REGS (if REGS and BUFFER->no_sub are nonzero). */ -extern regoff_t re_search (struct re_pattern_buffer *__buffer, - const char *__string, __re_idx_t __length, - __re_idx_t __start, regoff_t __range, - struct re_registers *__regs); - - -/* Like `re_search', but search in the concatenation of STRING1 and - STRING2. Also, stop searching at index START + STOP. */ -extern regoff_t re_search_2 (struct re_pattern_buffer *__buffer, - const char *__string1, __re_idx_t __length1, - const char *__string2, __re_idx_t __length2, - __re_idx_t __start, regoff_t __range, - struct re_registers *__regs, - __re_idx_t __stop); - - -/* Like `re_search', but return how many characters in STRING the regexp - in BUFFER matched, starting at position START. */ -extern regoff_t re_match (struct re_pattern_buffer *__buffer, - const char *__string, __re_idx_t __length, - __re_idx_t __start, struct re_registers *__regs); - - -/* Relates to `re_match' as `re_search_2' relates to `re_search'. */ -extern regoff_t re_match_2 (struct re_pattern_buffer *__buffer, - const char *__string1, __re_idx_t __length1, - const char *__string2, __re_idx_t __length2, - __re_idx_t __start, struct re_registers *__regs, - __re_idx_t __stop); - - -/* Set REGS to hold NUM_REGS registers, storing them in STARTS and - ENDS. Subsequent matches using BUFFER and REGS will use this memory - for recording register information. STARTS and ENDS must be - allocated with malloc, and must each be at least `NUM_REGS * sizeof - (regoff_t)' bytes long. - - If NUM_REGS == 0, then subsequent matches should allocate their own - register data. - - Unless this function is called, the first search or match using - BUFFER will allocate its own register data, without freeing the old - data. */ -extern void re_set_registers (struct re_pattern_buffer *__buffer, - struct re_registers *__regs, - __re_size_t __num_regs, - regoff_t *__starts, regoff_t *__ends); - -#if defined _REGEX_RE_COMP || defined _LIBC -# ifndef _CRAY -/* 4.2 bsd compatibility. */ -extern char *re_comp (const char *); -extern int re_exec (const char *); -# endif -#endif - -/* GCC 2.95 and later have "__restrict"; C99 compilers have - "restrict", and "configure" may have defined "restrict". - Other compilers use __restrict, __restrict__, and _Restrict, and - 'configure' might #define 'restrict' to those words, so pick a - different name. */ -#ifndef _Restrict_ -# if 199901L <= __STDC_VERSION__ -# define _Restrict_ restrict -# elif 2 < __GNUC__ || (2 == __GNUC__ && 95 <= __GNUC_MINOR__) -# define _Restrict_ __restrict -# else -# define _Restrict_ -# endif -#endif -/* gcc 3.1 and up support the [restrict] syntax. Don't trust - sys/cdefs.h's definition of __restrict_arr, though, as it - mishandles gcc -ansi -pedantic. */ -#ifndef _Restrict_arr_ -# if ((199901L <= __STDC_VERSION__ \ - || ((3 < __GNUC__ || (3 == __GNUC__ && 1 <= __GNUC_MINOR__)) \ - && !__STRICT_ANSI__)) \ - && !defined __GNUG__) -# define _Restrict_arr_ _Restrict_ -# else -# define _Restrict_arr_ -# endif -#endif - -/* POSIX compatibility. */ -extern int regcomp (regex_t *_Restrict_ __preg, - const char *_Restrict_ __pattern, - int __cflags); - -extern int regexec (const regex_t *_Restrict_ __preg, - const char *_Restrict_ __string, size_t __nmatch, - regmatch_t __pmatch[_Restrict_arr_], - int __eflags); - -extern size_t regerror (int __errcode, const regex_t *_Restrict_ __preg, - char *_Restrict_ __errbuf, size_t __errbuf_size); - -extern void regfree (regex_t *__preg); - - -#ifdef __cplusplus -} -#endif /* C++ */ - -#endif /* regex.h */ diff -Nru lua-rexlib-2.6.0/src/oniguruma/Makefile lua-rexlib-2.7.2/src/oniguruma/Makefile --- lua-rexlib-2.6.0/src/oniguruma/Makefile 2010-10-03 17:38:27.000000000 +0000 +++ lua-rexlib-2.7.2/src/oniguruma/Makefile 1970-01-01 00:00:00.000000000 +0000 @@ -1,38 +0,0 @@ -# makefile for rex_onig library - -include ../defaults.mak - -# === USER SETTINGS === -# =========================================================================== - -# These are default values. -INC = -LIB = -lonig - -# If the default settings don't work for your system, -# try to uncomment and edit the settings below. -#INC = -#LIB = -lonig - -# Target name -REGNAME = onig - -# =========================================================================== -# === END OF USER SETTINGS === - -OBJ = lonig.o lonig_f.o ../common.o - -include ../common.mak - -# static Oniguruma regexp library binding -ar_onig: $(TRG_AR) - -# dynamic Oniguruma regexp library binding -so_onig: $(TRG_SO) - -# Dependencies -lonig.o: lonig.c ../common.h ../algo.h -lonig_f.o: lonig_f.c ../common.h -../common.o: ../common.c ../common.h - -# (End of Makefile) diff -Nru lua-rexlib-2.6.0/src/oniguruma/lonig.c lua-rexlib-2.7.2/src/oniguruma/lonig.c --- lua-rexlib-2.6.0/src/oniguruma/lonig.c 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/src/oniguruma/lonig.c 2013-01-08 19:41:59.000000000 +0000 @@ -46,7 +46,7 @@ lua_pushlstring (L, (text) + ALG_SUBBEG(ud,n), ALG_SUBLEN(ud,n)) #define ALG_PUSHSUB_OR_FALSE(L,ud,text,n) \ - (ALG_SUBVALID(ud,n) ? ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) + (ALG_SUBVALID(ud,n) ? (void) ALG_PUSHSUB (L,ud,text,n) : lua_pushboolean (L,0)) #define ALG_PUSHSTART(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBBEG(ud,n) + 1) #define ALG_PUSHEND(L,ud,offs,n) lua_pushinteger(L, (offs) + ALG_SUBEND(ud,n)) diff -Nru lua-rexlib-2.6.0/src/pcre/Makefile lua-rexlib-2.7.2/src/pcre/Makefile --- lua-rexlib-2.6.0/src/pcre/Makefile 2010-10-03 17:38:27.000000000 +0000 +++ lua-rexlib-2.7.2/src/pcre/Makefile 1970-01-01 00:00:00.000000000 +0000 @@ -1,38 +0,0 @@ -# makefile for rex_pcre library - -include ../defaults.mak - -# === USER SETTINGS === -# =========================================================================== - -# These are default values. -INC = -LIB = -lpcre - -# If the default settings don't work for your system, -# try to uncomment and edit the settings below. -#INC = -#LIB = -lpcre - -# Target name -REGNAME = pcre - -# =========================================================================== -# === END OF USER SETTINGS === - -OBJ = lpcre.o lpcre_f.o ../common.o - -include ../common.mak - -# static PCRE regexp library binding -ar_pcre: $(TRG_AR) - -# dynamic PCRE regexp library binding -so_pcre: $(TRG_SO) - -# Dependencies -lpcre.o: lpcre.c ../common.h ../algo.h -lpcre_f.o: lpcre_f.c ../common.h -../common.o: ../common.c ../common.h - -# (End of Makefile) diff -Nru lua-rexlib-2.6.0/src/pcre/lpcre.c lua-rexlib-2.7.2/src/pcre/lpcre.c --- lua-rexlib-2.6.0/src/pcre/lpcre.c 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/src/pcre/lpcre.c 2013-01-08 19:41:59.000000000 +0000 @@ -221,6 +221,8 @@ pcre_fullinfo (ud->pr, ud->extra, PCRE_INFO_CAPTURECOUNT, &ud->ncapt); /* need (2 ints per capture, plus one for substring match) * 3/2 */ ud->match = (int *) Lmalloc (L, (ALG_NSUB(ud) + 1) * 3 * sizeof (int)); + if (!ud->match) + luaL_error (L, "malloc failed"); if (pud) *pud = ud; return 1; @@ -258,9 +260,13 @@ TPcre *ud; int res; int *buf, *ovector, *wspace; + size_t bufsize; checkarg_dfa_exec (L, &argE, &ud); - buf = (int*) Lmalloc (L, (argE.ovecsize + argE.wscount) * sizeof(int)); + bufsize = (argE.ovecsize + argE.wscount) * sizeof(int); + buf = (int*) Lmalloc (L, bufsize); + if (!buf) + luaL_error (L, "malloc failed"); ovector = buf; wspace = buf + argE.ovecsize; @@ -277,11 +283,11 @@ lua_rawseti (L, -2, i+1); } lua_pushinteger (L, res); /* 3-rd return value */ - free (buf); + Lfree (L, buf, bufsize); return 3; } else { - free (buf); + Lfree (L, buf, bufsize); if (ALG_NOMATCH (res)) return lua_pushnil (L), 1; else @@ -337,7 +343,7 @@ if (ud->pr) pcre_free (ud->pr); if (ud->extra) pcre_free (ud->extra); if (ud->tables) pcre_free ((void *)ud->tables); - free (ud->match); + Lfree (L, ud->match, (ALG_NSUB(ud) + 1) * 3 * sizeof (int)); } return 0; } diff -Nru lua-rexlib-2.6.0/src/posix/Makefile lua-rexlib-2.7.2/src/posix/Makefile --- lua-rexlib-2.6.0/src/posix/Makefile 2010-10-03 17:38:27.000000000 +0000 +++ lua-rexlib-2.7.2/src/posix/Makefile 1970-01-01 00:00:00.000000000 +0000 @@ -1,48 +0,0 @@ -# makefile for rex_posix library - -include ../defaults.mak - -# === USER SETTINGS === -# =========================================================================== - -# These are default values. -INC = -LIB = - -# If the default settings don't work for your system, -# try to uncomment and edit the settings below. -#INC = -#LIB = -lc - -# WARNING: -# If you want to use a POSIX regex library that is not the system -# default, make sure you set both the INC and LIB variables correctly, -# as if a header file and library are used which do not match, you may -# well get segmentation faults (or worse). - -# The following lines work for the rxspencer library, when installed -# under /usr (note the above warning!) -#INC = -I/usr/include/rxspencer -#LIB = -lrxspencer - -# Target name -REGNAME = posix - -# =========================================================================== -# === END OF USER SETTINGS === - -OBJ = lposix.o ../common.o - -include ../common.mak - -# static POSIX regexp library binding -ar_posix: $(TRG_AR) - -# dynamic POSIX regexp library binding -so_posix: $(TRG_SO) - -# Dependencies -lposix.o: lposix.c ../common.h ../algo.h -../common.o: ../common.c ../common.h - -# (End of Makefile) diff -Nru lua-rexlib-2.6.0/src/posix/lposix.c lua-rexlib-2.7.2/src/posix/lposix.c --- lua-rexlib-2.6.0/src/posix/lposix.c 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/src/posix/lposix.c 2013-01-08 19:41:59.000000000 +0000 @@ -26,10 +26,11 @@ #define REX_TYPENAME REX_LIBNAME"_regex" -/* Test if regex.h corresponds to the extended POSIX library, i.e. H.Spencer's. +/* Test if regex.h corresponds to the extended POSIX library, i.e. H. Spencer's. This test may not work as intended if regex.h introduced REG_BASIC, etc. via enum rather than #define. If that's the case, add -DREX_POSIX_EXT in the makefile/command line. + The same applies to REG_STARTEND. */ #ifndef REX_POSIX_EXT # if defined(REG_BASIC) && defined(REG_STARTEND) @@ -38,7 +39,7 @@ #endif #define ALG_CFLAGS_DFLT REG_EXTENDED -#ifdef REX_POSIX_EXT +#ifdef REG_STARTEND # define ALG_EFLAGS_DFLT REG_STARTEND #else # define ALG_EFLAGS_DFLT 0 @@ -109,6 +110,8 @@ if (argC->cflags & REG_NOSUB) ud->r.re_nsub = 0; ud->match = (regmatch_t *) Lmalloc (L, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); + if (!ud->match) + luaL_error (L, "malloc failed"); lua_pushvalue (L, ALG_ENVIRONINDEX); lua_setmetatable (L, -2); @@ -116,23 +119,11 @@ return 1; } -#ifdef REX_POSIX_EXT -static void CheckStartEnd (TArgExec *argE, TPosix *ud) { - if (argE->eflags & REG_STARTEND) { - ud->match[0].rm_so = argE->startoffset; - ud->match[0].rm_eo = argE->textlen; - argE->startoffset = 0; - } - else - argE->text += argE->startoffset; -} -#endif - static int gmatch_exec (TUserdata *ud, TArgExec *argE) { if (argE->startoffset > 0) argE->eflags |= REG_NOTBOL; -#ifdef REX_POSIX_EXT +#ifdef REG_STARTEND if (argE->eflags & REG_STARTEND) { ALG_SUBBEG(ud,0) = 0; ALG_SUBEND(ud,0) = argE->textlen - argE->startoffset; @@ -144,27 +135,29 @@ } static void gmatch_pushsubject (lua_State *L, TArgExec *argE) { -#ifdef REX_POSIX_EXT +#ifdef REG_STARTEND if (argE->eflags & REG_STARTEND) lua_pushlstring (L, argE->text, argE->textlen); else - lua_pushlstring (L, argE->text, strlen (argE->text)); -#else - lua_pushlstring (L, argE->text, strlen (argE->text)); #endif + lua_pushstring (L, argE->text); } static int findmatch_exec (TPosix *ud, TArgExec *argE) { -#ifdef REX_POSIX_EXT - CheckStartEnd (argE, ud); -#else - argE->text += argE->startoffset; +#ifdef REG_STARTEND + if (argE->eflags & REG_STARTEND) { + ud->match[0].rm_so = argE->startoffset; + ud->match[0].rm_eo = argE->textlen; + argE->startoffset = 0; + } + else #endif + argE->text += argE->startoffset; return regexec (&ud->r, argE->text, ALG_NSUB(ud) + 1, ud->match, argE->eflags); } static int gsub_exec (TPosix *ud, TArgExec *argE, int st) { -#ifdef REX_POSIX_EXT +#ifdef REG_STARTEND if(argE->eflags & REG_STARTEND) { ALG_SUBBEG(ud,0) = 0; ALG_SUBEND(ud,0) = argE->textlen - st; @@ -176,7 +169,7 @@ } static int split_exec (TPosix *ud, TArgExec *argE, int offset) { -#ifdef REX_POSIX_EXT +#ifdef REG_STARTEND if (argE->eflags & REG_STARTEND) { ALG_SUBBEG(ud,0) = 0; ALG_SUBEND(ud,0) = argE->textlen - offset; @@ -193,7 +186,7 @@ if (ud->freed == 0) { /* precaution against "manual" __gc calling */ ud->freed = 1; regfree (&ud->r); - free (ud->match); + Lfree (L, ud->match, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); } return 0; } @@ -213,6 +206,8 @@ { "BASIC", REG_BASIC }, { "NOSPEC", REG_NOSPEC }, { "PEND", REG_PEND }, +#endif +#ifdef REG_STARTEND { "STARTEND", REG_STARTEND }, #endif { "EXTENDED", REG_EXTENDED }, diff -Nru lua-rexlib-2.6.0/src/tre/Makefile lua-rexlib-2.7.2/src/tre/Makefile --- lua-rexlib-2.6.0/src/tre/Makefile 2012-04-12 17:43:34.000000000 +0000 +++ lua-rexlib-2.7.2/src/tre/Makefile 1970-01-01 00:00:00.000000000 +0000 @@ -1,43 +0,0 @@ -# makefile for rex_tre library - -include ../defaults.mak - -# === USER SETTINGS === -# =========================================================================== - -# These are default values. -INC = -LIB = -ltre - -# If the default settings don't work for your system, -# try to uncomment and edit the settings below. -#INC = -I/usr/include -#LIB = -lc - -# WARNING: -# Make sure you set both the INC and LIB variables correctly, as -# otherwise you risk using a header file and library that do not -# match, and you may well get segmentation faults (or worse). - -# Target name -REGNAME = tre - -# =========================================================================== -# === END OF USER SETTINGS === - -OBJ = ltre.o ../common.o # ltre_w.o - -include ../common.mak - -# static TRE regexp library binding -ar_tre: $(TRG_AR) - -# dynamic TRE regexp library binding -so_tre: $(TRG_SO) - -# Dependencies -ltre.o: ltre.c ../common.h ../algo.h -ltre_w.o: ltre_w.c ../common.h ../algo.h -../common.o: ../common.c ../common.h - -# (End of Makefile) diff -Nru lua-rexlib-2.6.0/src/tre/ltre.c lua-rexlib-2.7.2/src/tre/ltre.c --- lua-rexlib-2.6.0/src/tre/ltre.c 2012-04-12 17:24:49.000000000 +0000 +++ lua-rexlib-2.7.2/src/tre/ltre.c 2013-01-08 19:41:59.000000000 +0000 @@ -108,6 +108,8 @@ if (argC->cflags & REG_NOSUB) ud->r.re_nsub = 0; ud->match = (regmatch_t *) Lmalloc (L, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); + if (!ud->match) + luaL_error (L, "malloc failed"); lua_pushvalue (L, ALG_ENVIRONINDEX); lua_setmetatable (L, -2); @@ -209,7 +211,7 @@ if (ud->freed == 0) { /* precaution against "manual" __gc calling */ ud->freed = 1; tre_regfree (&ud->r); - free (ud->match); + Lfree (L, ud->match, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); } return 0; } diff -Nru lua-rexlib-2.6.0/src/tre/ltre_w.c lua-rexlib-2.7.2/src/tre/ltre_w.c --- lua-rexlib-2.6.0/src/tre/ltre_w.c 2012-04-12 17:24:49.000000000 +0000 +++ lua-rexlib-2.7.2/src/tre/ltre_w.c 2013-01-08 19:41:59.000000000 +0000 @@ -111,6 +111,8 @@ if (argC->cflags & REG_NOSUB) ud->r.re_nsub = 0; ud->match = (regmatch_t *) Lmalloc (L, (ALG_NSUB(ud) + 1) * sizeof (regmatch_t)); + if (!ud->match) + luaL_error (L, "malloc failed"); lua_pushvalue (L, ALG_ENVIRONINDEX); lua_setmetatable (L, -2); diff -Nru lua-rexlib-2.6.0/test/luatest.lua lua-rexlib-2.7.2/test/luatest.lua --- lua-rexlib-2.6.0/test/luatest.lua 2012-02-14 19:06:48.000000000 +0000 +++ lua-rexlib-2.7.2/test/luatest.lua 2013-01-08 19:41:59.000000000 +0000 @@ -73,6 +73,22 @@ if t[1] then table.remove (t, 1) res = t + if alien then + local subject = test[1][1] + local buf = alien.buffer (#subject) + if #subject > 0 then + alien.memmove (buf:topointer (), subject, #subject) + end + test[1][1] = buf + local t = packNT (pcall (func, unpackNT (test[1]))) + if t[1] then + table.remove (t, 1) + res = t + else + print "alien test failed" + res = t[2] --> error_message + end + end else res = t[2] --> error_message end @@ -87,6 +103,7 @@ -- 3) test results table or error_message local function test_method (test, constructor, name) local res1, res2 + local subject = test[2][1] local ok, r = pcall (constructor, unpackNT (test[1])) if ok then local t = packNT (pcall (r[name], r, unpackNT (test[2]))) diff -Nru lua-rexlib-2.6.0/test/onig_sets.lua lua-rexlib-2.7.2/test/onig_sets.lua --- lua-rexlib-2.6.0/test/onig_sets.lua 2010-10-03 17:38:27.000000000 +0000 +++ lua-rexlib-2.7.2/test/onig_sets.lua 1970-01-01 00:00:00.000000000 +0000 @@ -1,147 +0,0 @@ --- See Copyright Notice in the file LICENSE - -local luatest = require "luatest" -local N = luatest.NT - -local function norm(a) return a==nil and N or a end - -local function fill (n, m) - local t = {} - for i = n, m, -1 do table.insert (t, i) end - return t -end - -local function set_named_subpatterns (lib, flg) - return { - Name = "Named Subpatterns", - Func = function (methodname, subj, patt, name1, name2) - local r = lib.new (patt) - local _,_,caps = r[methodname] (r, subj) - return norm(caps[name1]), norm(caps[name2]) - end, - --{} - { {"tfind", "abcd", "(?.)b.(?d)", "dog", "cat"}, {"a","d"} }, - { {"exec", "abcd", "(?.)b.(?d)", "dog", "cat"}, {"a","d"} }, - } -end - -local function set_f_find (lib, flg) - local cp1251 = - "��Ũ��" - local loc = "CP1251" - return { - Name = "Function find", - Func = lib.find, - --{subj, patt, st,cf,ef,lo}, { results } - { {"abcd", ".+", 5}, { N } }, -- failing st - { {"abcd", ".*?"}, { 1,0 } }, -- non-greedy - { {"abc", "aBC", N,flg.IGNORECASE}, { 1,3 } }, -- cf - { {"abc", "aBC", N,"i" }, { 1,3 } }, -- cf - { {cp1251, "[[:upper:]]+", N,N,N, loc}, { 1,33} }, -- locale - { {cp1251, "[[:lower:]]+", N,N,N, loc}, {34,66} }, -- locale - { {cp1251, "\\w+", N,N,N, loc}, {1, 66} }, -- locale -} -end - -local function set_f_match (lib, flg) - return { - Name = "Function match", - Func = lib.match, - --{subj, patt, st,cf,ef,lo}, { results } - { {"abcd", ".+", 5}, { N }}, -- failing st - { {"abcd", ".*?"}, { "" }}, -- non-greedy - { {"abc", "aBC", N,flg.IGNORECASE}, {"abc" }}, -- cf - { {"abc", "aBC", N,"i" }, {"abc" }}, -- cf -} -end - -local function set_f_gmatch (lib, flg) - -- gmatch (s, p, [cf], [ef]) - local pCSV = "(^[^,]*)|,([^,]*)" - local F = false - local function test_gmatch (subj, patt) - local out, guard = {}, 10 - for a, b in lib.gmatch (subj, patt) do - table.insert (out, { norm(a), norm(b) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function gmatch", - Func = test_gmatch, - --{ subj patt results } - { {"a\0c", "." }, {{"a",N},{"\0",N},{"c",N}} },--nuls in subj - { {"", pCSV}, {{"",F}} }, - { {"12", pCSV}, {{"12",F}} }, - ----{ {",", pCSV}, {{"", F},{F,""}} }, - { {"12,,45", pCSV}, {{"12",F},{F,""},{F,"45"}} }, - ----{ {",,12,45,,ab,", pCSV}, {{"",F},{F,""},{F,"12"},{F,"45"},{F,""},{F,"ab"},{F,""}} }, - } -end - -local function set_f_split (lib, flg) - -- split (s, p, [cf], [ef]) - local function test_split (subj, patt) - local out, guard = {}, 10 - for a, b, c in lib.split (subj, patt) do - table.insert (out, { norm(a), norm(b), norm(c) }) - guard = guard - 1 - if guard == 0 then break end - end - return unpack (out) - end - return { - Name = "Function split", - Func = test_split, - --{ subj patt results } - { {"a,\0,c", ","}, {{"a",",",N},{"\0",",",N},{"c",N,N}, } },--nuls in subj - { {"ab", "$"}, {{"ab","",N}, {"",N,N}, } }, - { {"ab", "^|$"}, {{"", "", N}, {"ab","",N}, {"",N,N}, } }, - { {"ab45ab","(?<=ab).*?"}, {{"ab","",N}, {"45ab","",N},{"",N,N}, } }, - { {"ab", "\\b"}, {{"", "", N}, {"ab","",N}, {"",N,N}, } }, - } -end - -local function set_m_exec (lib, flg) - return { - Name = "Method exec", - Method = "exec", ---{patt,cf,lo}, {subj,st,ef} { results } - { {".+"}, {"abcd",5}, { N } }, -- failing st - { {".*?"}, {"abcd"}, {1,0,{}} }, -- non-greedy - { {"aBC",flg.IGNORECASE}, {"abc"}, {1,3,{}} }, -- cf - { {"aBC","i" }, {"abc"}, {1,3,{}} }, -- cf -} -end - -local function set_m_tfind (lib, flg) - return { - Name = "Method tfind", - Method = "tfind", ---{patt,cf,lo}, {subj,st,ef} { results } - { {".+"}, {"abcd",5}, { N } }, -- failing st - { {".*?"}, {"abcd"}, {1,0,{}} }, -- non-greedy - { {"aBC",flg.IGNORECASE}, {"abc"}, {1,3,{}} }, -- cf - { {"aBC","i" }, {"abc"}, {1,3,{}} }, -- cf -} -end - -return function (libname) - local lib = require (libname) - local flags = lib.flags () - local sets = { - set_f_match (lib, flags), - set_f_find (lib, flags), - set_f_gmatch (lib, flags), - set_f_split (lib, flags), - set_m_exec (lib, flags), - set_m_tfind (lib, flags), - } - local MAJOR = tonumber(lib.version():match("%d+")) - if MAJOR >= 0 then - table.insert (sets, set_named_subpatterns (lib, flags)) - end - return sets -end diff -Nru lua-rexlib-2.6.0/test/oniguruma_sets.lua lua-rexlib-2.7.2/test/oniguruma_sets.lua --- lua-rexlib-2.6.0/test/oniguruma_sets.lua 1970-01-01 00:00:00.000000000 +0000 +++ lua-rexlib-2.7.2/test/oniguruma_sets.lua 2013-01-08 19:41:59.000000000 +0000 @@ -0,0 +1,147 @@ +-- See Copyright Notice in the file LICENSE + +local luatest = require "luatest" +local N = luatest.NT + +local function norm(a) return a==nil and N or a end + +local function fill (n, m) + local t = {} + for i = n, m, -1 do table.insert (t, i) end + return t +end + +local function set_named_subpatterns (lib, flg) + return { + Name = "Named Subpatterns", + Func = function (subj, methodname, patt, name1, name2) + local r = lib.new (patt) + local _,_,caps = r[methodname] (r, subj) + return norm(caps[name1]), norm(caps[name2]) + end, + --{} N.B. subject is always first element + { {"abcd", "tfind", "(?.)b.(?d)", "dog", "cat"}, {"a","d"} }, + { {"abcd", "exec", "(?.)b.(?d)", "dog", "cat"}, {"a","d"} }, + } +end + +local function set_f_find (lib, flg) + local cp1251 = + "��Ũ��" + local loc = "CP1251" + return { + Name = "Function find", + Func = lib.find, + --{subj, patt, st,cf,ef,lo}, { results } + { {"abcd", ".+", 5}, { N } }, -- failing st + { {"abcd", ".*?"}, { 1,0 } }, -- non-greedy + { {"abc", "aBC", N,flg.IGNORECASE}, { 1,3 } }, -- cf + { {"abc", "aBC", N,"i" }, { 1,3 } }, -- cf + { {cp1251, "[[:upper:]]+", N,N,N, loc}, { 1,33} }, -- locale + { {cp1251, "[[:lower:]]+", N,N,N, loc}, {34,66} }, -- locale + { {cp1251, "\\w+", N,N,N, loc}, {1, 66} }, -- locale +} +end + +local function set_f_match (lib, flg) + return { + Name = "Function match", + Func = lib.match, + --{subj, patt, st,cf,ef,lo}, { results } + { {"abcd", ".+", 5}, { N }}, -- failing st + { {"abcd", ".*?"}, { "" }}, -- non-greedy + { {"abc", "aBC", N,flg.IGNORECASE}, {"abc" }}, -- cf + { {"abc", "aBC", N,"i" }, {"abc" }}, -- cf +} +end + +local function set_f_gmatch (lib, flg) + -- gmatch (s, p, [cf], [ef]) + local pCSV = "(^[^,]*)|,([^,]*)" + local F = false + local function test_gmatch (subj, patt) + local out, guard = {}, 10 + for a, b in lib.gmatch (subj, patt) do + table.insert (out, { norm(a), norm(b) }) + guard = guard - 1 + if guard == 0 then break end + end + return unpack (out) + end + return { + Name = "Function gmatch", + Func = test_gmatch, + --{ subj patt results } + { {"a\0c", "." }, {{"a",N},{"\0",N},{"c",N}} },--nuls in subj + { {"", pCSV}, {{"",F}} }, + { {"12", pCSV}, {{"12",F}} }, + ----{ {",", pCSV}, {{"", F},{F,""}} }, + { {"12,,45", pCSV}, {{"12",F},{F,""},{F,"45"}} }, + ----{ {",,12,45,,ab,", pCSV}, {{"",F},{F,""},{F,"12"},{F,"45"},{F,""},{F,"ab"},{F,""}} }, + } +end + +local function set_f_split (lib, flg) + -- split (s, p, [cf], [ef]) + local function test_split (subj, patt) + local out, guard = {}, 10 + for a, b, c in lib.split (subj, patt) do + table.insert (out, { norm(a), norm(b), norm(c) }) + guard = guard - 1 + if guard == 0 then break end + end + return unpack (out) + end + return { + Name = "Function split", + Func = test_split, + --{ subj patt results } + { {"a,\0,c", ","}, {{"a",",",N},{"\0",",",N},{"c",N,N}, } },--nuls in subj + { {"ab", "$"}, {{"ab","",N}, {"",N,N}, } }, + { {"ab", "^|$"}, {{"", "", N}, {"ab","",N}, {"",N,N}, } }, + { {"ab45ab","(?<=ab).*?"}, {{"ab","",N}, {"45ab","",N},{"",N,N}, } }, + { {"ab", "\\b"}, {{"", "", N}, {"ab","",N}, {"",N,N}, } }, + } +end + +local function set_m_exec (lib, flg) + return { + Name = "Method exec", + Method = "exec", +--{patt,cf,lo}, {subj,st,ef} { results } + { {".+"}, {"abcd",5}, { N } }, -- failing st + { {".*?"}, {"abcd"}, {1,0,{}} }, -- non-greedy + { {"aBC",flg.IGNORECASE}, {"abc"}, {1,3,{}} }, -- cf + { {"aBC","i" }, {"abc"}, {1,3,{}} }, -- cf +} +end + +local function set_m_tfind (lib, flg) + return { + Name = "Method tfind", + Method = "tfind", +--{patt,cf,lo}, {subj,st,ef} { results } + { {".+"}, {"abcd",5}, { N } }, -- failing st + { {".*?"}, {"abcd"}, {1,0,{}} }, -- non-greedy + { {"aBC",flg.IGNORECASE}, {"abc"}, {1,3,{}} }, -- cf + { {"aBC","i" }, {"abc"}, {1,3,{}} }, -- cf +} +end + +return function (libname) + local lib = require (libname) + local flags = lib.flags () + local sets = { + set_f_match (lib, flags), + set_f_find (lib, flags), + set_f_gmatch (lib, flags), + set_f_split (lib, flags), + set_m_exec (lib, flags), + set_m_tfind (lib, flags), + } + local MAJOR = tonumber(lib.version():match("%d+")) + if MAJOR >= 0 then + table.insert (sets, set_named_subpatterns (lib, flags)) + end + return sets +end diff -Nru lua-rexlib-2.6.0/test/pcre_sets.lua lua-rexlib-2.7.2/test/pcre_sets.lua --- lua-rexlib-2.6.0/test/pcre_sets.lua 2010-10-03 17:38:27.000000000 +0000 +++ lua-rexlib-2.7.2/test/pcre_sets.lua 2013-01-08 19:41:59.000000000 +0000 @@ -14,14 +14,14 @@ local function set_named_subpatterns (lib, flg) return { Name = "Named Subpatterns", - Func = function (methodname, subj, patt, name1, name2) + Func = function (subj, methodname, patt, name1, name2) local r = lib.new (patt) local _,_,caps = r[methodname] (r, subj) return norm(caps[name1]), norm(caps[name2]) end, - --{} - { {"tfind", "abcd", "(?P.)b.(?Pd)", "dog", "cat"}, {"a","d"} }, - { {"exec", "abcd", "(?P.)b.(?Pd)", "dog", "cat"}, {"a","d"} }, + --{} N.B. subject is always first element + { {"abcd", "tfind", "(?P.)b.(?Pd)", "dog", "cat"}, {"a","d"} }, + { {"abcd", "exec", "(?P.)b.(?Pd)", "dog", "cat"}, {"a","d"} }, } end diff -Nru lua-rexlib-2.6.0/test/runtest.lua lua-rexlib-2.7.2/test/runtest.lua --- lua-rexlib-2.6.0/test/runtest.lua 2012-04-12 17:24:49.000000000 +0000 +++ lua-rexlib-2.7.2/test/runtest.lua 2013-01-08 19:41:59.000000000 +0000 @@ -1,5 +1,13 @@ -- See Copyright Notice in the file LICENSE +-- See if we have alien, so we can do tests with buffer subjects +local ok +ok, alien = pcall (require, "alien") +if not ok then + io.stderr:write ("Warning: alien not found, so cannot run tests with buffer subjects\n") + alien = nil +end + do local path = "./?.lua;" if package.path:sub(1, #path) ~= path then @@ -16,6 +24,13 @@ local lib = require (libname) local f = require (setfile) local sets = f (libname) + + local realalien = alien + if libname == "rex_posix" and not lib.flags ().STARTEND and alien then + alien = nil + io.stderr:write ("Cannot run posix tests with alien without REG_STARTEND\n") + end + local n = 0 -- number of failures for _, set in ipairs (sets) do if verbose then @@ -33,15 +48,17 @@ if verbose then print "" end + alien = realalien return n end local avail_tests = { - gnu = { lib = "rex_gnu", "common_sets", "emacs_sets", "gnu_sets" }, - onig = { lib = "rex_onig", "common_sets", "onig_sets", }, - pcre = { lib = "rex_pcre", "common_sets", "pcre_sets", "pcre_sets2", }, - spencer = { lib = "rex_spencer", "common_sets", "posix_sets", "spencer_sets" }, - tre = { lib = "rex_tre", "common_sets", "posix_sets", "spencer_sets", --[["tre_sets"]] }, + posix = { lib = "rex_posix", "common_sets", "posix_sets" }, + gnu = { lib = "rex_gnu", "common_sets", "emacs_sets", "gnu_sets" }, + oniguruma = { lib = "rex_onig", "common_sets", "oniguruma_sets", }, + pcre = { lib = "rex_pcre", "common_sets", "pcre_sets", "pcre_sets2", }, + spencer = { lib = "rex_spencer", "common_sets", "posix_sets", "spencer_sets" }, + tre = { lib = "rex_tre", "common_sets", "posix_sets", "spencer_sets", --[["tre_sets"]] }, } do diff -Nru lua-rexlib-2.6.0/test/scite.properties lua-rexlib-2.7.2/test/scite.properties --- lua-rexlib-2.6.0/test/scite.properties 1970-01-01 00:00:00.000000000 +0000 +++ lua-rexlib-2.7.2/test/scite.properties 2013-01-08 19:41:59.000000000 +0000 @@ -0,0 +1,2 @@ +eol.mode=LF + diff -Nru lua-rexlib-2.6.0/windows/mingw/Makefile lua-rexlib-2.7.2/windows/mingw/Makefile --- lua-rexlib-2.6.0/windows/mingw/Makefile 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/Makefile 1970-01-01 00:00:00.000000000 +0000 @@ -1,26 +0,0 @@ -# Makefile for lrexlib - -MKFILES = \ - rex_gnu.mak \ - rex_onig.mak \ - rex_pcre.mak \ - rex_spencer.mak \ - rex_tre.mak - -LOOP = @for %%d in ($(MKFILES)) do $(MAKE) -f %%d - -all: build test - -build: - $(LOOP) - -test: - $(LOOP) test - -install: - $(LOOP) install - -clean: - del *.o *.def *.dll - -.PHONY: all build test install clean diff -Nru lua-rexlib-2.6.0/windows/mingw/_mingw.mak lua-rexlib-2.7.2/windows/mingw/_mingw.mak --- lua-rexlib-2.6.0/windows/mingw/_mingw.mak 2012-04-12 17:24:49.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/_mingw.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,64 +0,0 @@ -# Use with GNU Make. - -# User Settings ------------------------------------------------------------ - -# Target Lua version (51 for Lua 5.1; 52 for Lua 5.2). -LUAVERSION = 51 - -# INSTALLPATH : Path to install the built DLL. -# LUADLL : Name of Lua DLL to link to (.dll should be omitted). -# LUAEXE : Name of Lua interpreter. -# LUAINC : Path of Lua include files. - -ifeq ($(LUAVERSION),51) - INSTALLPATH = s:\exe\lib32\lua51 - LUADLL = lua5.1 - LUAEXE = lua.exe - LUAINC = s:\progr\work\system\include\lua51 - MYCFLAGS += -DREX_CREATEGLOBALVAR -else - INSTALLPATH = s:\exe\lib32\lua52 - LUADLL = lua52 - LUAEXE = lua52.exe - LUAINC = s:\progr\work\system\include\lua52 -# MYCFLAGS += -DREX_CREATEGLOBALVAR -endif - -# -------------------------------------------------------------------------- - -BIN = $(PROJECT).dll -BININSTALL = $(INSTALLPATH)\$(BIN) -CC = gcc -CFLAGS = -W -Wall -O2 $(INCS) -DREX_OPENLIB=luaopen_$(PROJECT) \ - -DREX_LIBNAME=\"$(PROJECT)\" $(MYCFLAGS) -DEFFILE = $(PROJECT).def -EXPORTED = luaopen_$(PROJECT) -INCS = -I$(LUAINC) $(MYINCS) -LIBS = -l$(LUADLL) $(MYLIBS) -s -SRCPATH = ..\..\src -TESTPATH = ..\..\test - -.PHONY: all install test clean - -vpath %.c $(SRCPATH);$(SRCPATH)\$(PROJDIR) -vpath %.h $(SRCPATH);$(SRCPATH)\$(PROJDIR) - -all: $(BIN) - -clean: - del $(OBJ) $(BIN) $(DEFFILE) - -install: $(BININSTALL) - -test: - cd $(TESTPATH) && $(LUAEXE) runtest.lua $(TESTNAME) -d$(CURDIR) - -$(BIN): $(OBJ) $(DEFFILE) - $(CC) $(DEFFILE) $(OBJ) $(LIBS) -o $@ -shared - -$(DEFFILE): - echo EXPORTS > $@ - for %%d in ($(EXPORTED)) do echo %%d>> $@ - -$(BININSTALL): $(BIN) - copy /Y $< $@ diff -Nru lua-rexlib-2.6.0/windows/mingw/docs.mak lua-rexlib-2.7.2/windows/mingw/docs.mak --- lua-rexlib-2.6.0/windows/mingw/docs.mak 2012-02-14 19:06:48.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/docs.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,13 +0,0 @@ -# Documentation Makefile - -APP = rst2html.py -CP = "copy /y" -RM = del -IDX = ..\README.rst - -ALLVAR = APP=$(APP) CP=$(CP) RM=$(RM) IDX=$(IDX) - -.PHONY: all clean - -all clean: - cd ..\..\doc && $(MAKE) $(ALLVAR) $@ diff -Nru lua-rexlib-2.6.0/windows/mingw/rex_gnu.mak lua-rexlib-2.7.2/windows/mingw/rex_gnu.mak --- lua-rexlib-2.6.0/windows/mingw/rex_gnu.mak 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/rex_gnu.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,18 +0,0 @@ -# Project: rex_gnu - -# User Settings ------------------------------------------------------------ -# path of GNU include files -REGEXINC = s:\progr\work\system\include\gnuregex -# -------------------------------------------------------------------------- - -PROJECT = rex_gnu -MYINCS = -I$(REGEXINC) -MYLIBS = -lregex2 -OBJ = lgnu.o common.o -PROJDIR = gnu -TESTNAME = gnu - -include _mingw.mak - -lgnu.o : common.h algo.h -common.o : common.h diff -Nru lua-rexlib-2.6.0/windows/mingw/rex_onig.mak lua-rexlib-2.7.2/windows/mingw/rex_onig.mak --- lua-rexlib-2.6.0/windows/mingw/rex_onig.mak 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/rex_onig.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,19 +0,0 @@ -# Project: rex_onig - -# User Settings ------------------------------------------------------------ -# path of Oniguruma include files -REGEXINC = s:\progr\work\system\include -# -------------------------------------------------------------------------- - -PROJECT = rex_onig -MYINCS = -I$(REGEXINC) -MYLIBS = -lonig -Wl,--enable-auto-import -OBJ = lonig.o lonig_f.o common.o -PROJDIR = oniguruma -TESTNAME = onig - -include _mingw.mak - -lonig.o : common.h algo.h -lonig_f.o : common.h -common.o : common.h diff -Nru lua-rexlib-2.6.0/windows/mingw/rex_pcre.mak lua-rexlib-2.7.2/windows/mingw/rex_pcre.mak --- lua-rexlib-2.6.0/windows/mingw/rex_pcre.mak 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/rex_pcre.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,19 +0,0 @@ -# Project: rex_pcre - -# User Settings ------------------------------------------------------------ -# path of PCRE include files -REGEXINC = s:\progr\work\system\include -# -------------------------------------------------------------------------- - -PROJECT = rex_pcre -MYINCS = -I$(REGEXINC) -MYLIBS = -lpcre -OBJ = lpcre.o lpcre_f.o common.o -PROJDIR = pcre -TESTNAME = pcre - -include _mingw.mak - -lpcre.o : common.h algo.h -lpcre_f.o : common.h -common.o : common.h diff -Nru lua-rexlib-2.6.0/windows/mingw/rex_spencer.mak lua-rexlib-2.7.2/windows/mingw/rex_spencer.mak --- lua-rexlib-2.6.0/windows/mingw/rex_spencer.mak 2012-04-05 12:35:46.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/rex_spencer.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,18 +0,0 @@ -# Project: rex_spencer - -# User Settings ------------------------------------------------------------ -# path of Spencer's include files -REGEXINC = s:\progr\work\system\include\rxspencer -# -------------------------------------------------------------------------- - -PROJECT = rex_spencer -MYINCS = -I$(REGEXINC) -MYLIBS = -lrxspencer -OBJ = lposix.o common.o -PROJDIR = posix -TESTNAME = spencer - -include _mingw.mak - -lposix.o : common.h algo.h -common.o : common.h diff -Nru lua-rexlib-2.6.0/windows/mingw/rex_tre.mak lua-rexlib-2.7.2/windows/mingw/rex_tre.mak --- lua-rexlib-2.6.0/windows/mingw/rex_tre.mak 2012-04-12 17:24:49.000000000 +0000 +++ lua-rexlib-2.7.2/windows/mingw/rex_tre.mak 1970-01-01 00:00:00.000000000 +0000 @@ -1,26 +0,0 @@ -# Project: rex_tre - -# User Settings ------------------------------------------------------------ -# path of TRE include files -REGEXINC = s:\progr\work\system\include -# -------------------------------------------------------------------------- - -PROJECT = rex_tre -MYINCS = -I$(REGEXINC) -MYLIBS = -ltre -OBJ = ltre.o common.o -PROJDIR = tre -TESTNAME = tre - -# Uncomment the following line to add wide-character functions (in alpha state). -# ADDWIDECHARFUNCS = 1 -ifdef ADDWIDECHARFUNCS - OBJ += ltre_w.o - MYCFLAGS += -DREX_ADDWIDECHARFUNCS -endif - -include _mingw.mak - -ltre.o : common.h algo.h -ltre_w.o : common.h algo.h -common.o : common.h

Lrexlib 2.6

Links

Lrexlib 2.6

Lrexlib

Lrexlib 2.6 Reference Manual