Lines Matching +full:re +full:-

42 regcomp, regexec, regerror, regfree \- regular-expression library
62 These routines implement POSIX 1003.2 regular expressions (``RE''s);
66 compiles an RE written as a string into an internal form,
70 transforms error codes from either into human-readable messages,
73 frees any dynamically-allocated storage used by the internal form
74 of an RE.
110 so the ``RE'' is a literal string.
126 Compile for newline-sensitive matching.
146 This flag permits inclusion of NULs in the RE;
164 contains the number of parenthesized subexpressions within the RE
169 fails, it returns a non-zero error code;
173 matches the compiled RE pointed to by
183 The RE must have been compiled by a previous invocation of
187 so a single compiled RE can be used simultaneously by multiple threads.
190 the NUL-terminated string pointed to by
223 Note that a non-zero \fIrm_so\fR does not imply REG_NOTBOL;
229 for a discussion of what is matched in situations where an RE or a
235 returns 0 for success and the non-zero code REG_NOMATCH for failure.
236 Other non-zero error codes may be returned in exceptional situations;
239 If REG_NOSUB was specified in the compilation of the RE,
276 was matched by the entire RE.
278 subexpressions within the RE;
284 parentheses in the RE, left to right.
287 exist in the RE (that is, \fIi\fR\ > \fIpreg\fR\->\fIre_nsub\fR)\(emhave both
291 set to \-1.
294 (Note, as an example in particular, that when the RE `(b*)+' matches `bbb',
318 maps a non-zero
324 to a human-readable, printable message.
327 is non-NULL,
344 places the NUL-terminated message into the buffer pointed to by
373 shall be non-NULL and the
390 frees any dynamically-allocated storage associated with the compiled RE
395 is no longer a valid compiled RE
408 forbidden by the RE grammar.
413 for a discussion of the definition of case-independent matching.
417 Memory usage is approximately linear in RE size, and largely insensitive
418 to RE complexity, except for bounded repetitions.
419 See BUGS for one short RE using them
428 Equivalence classes cannot begin or end bracket-expression ranges.
442 An empty string is not a legal RE.
457 Non-zero error codes from
480 REG_INVARG	invalid argument, e.g. negative-length string
494 The back-reference code is subtle and doubts linger about its correctness
505 is largely insensitive to RE complexity \fIexcept\fR that back
508 for keeping RE length under about 30 characters,
515 An RE like, say,
535 The implementation of word-boundary matching is a bit of a kludge,
536 and bugs may lurk in combinations of word-boundary matching and anchoring.