| 7 |
.B #include <pcreposix.h> |
.B #include <pcreposix.h> |
| 8 |
.PP |
.PP |
| 9 |
.SM |
.SM |
|
.br |
|
| 10 |
.B int regcomp(regex_t *\fIpreg\fP, const char *\fIpattern\fP, |
.B int regcomp(regex_t *\fIpreg\fP, const char *\fIpattern\fP, |
| 11 |
.ti +5n |
.ti +5n |
| 12 |
.B int \fIcflags\fP); |
.B int \fIcflags\fP); |
| 13 |
.PP |
.PP |
|
.br |
|
| 14 |
.B int regexec(regex_t *\fIpreg\fP, const char *\fIstring\fP, |
.B int regexec(regex_t *\fIpreg\fP, const char *\fIstring\fP, |
| 15 |
.ti +5n |
.ti +5n |
| 16 |
.B size_t \fInmatch\fP, regmatch_t \fIpmatch\fP[], int \fIeflags\fP); |
.B size_t \fInmatch\fP, regmatch_t \fIpmatch\fP[], int \fIeflags\fP); |
| 17 |
.PP |
.PP |
|
.br |
|
| 18 |
.B size_t regerror(int \fIerrcode\fP, const regex_t *\fIpreg\fP, |
.B size_t regerror(int \fIerrcode\fP, const regex_t *\fIpreg\fP, |
| 19 |
.ti +5n |
.ti +5n |
| 20 |
.B char *\fIerrbuf\fP, size_t \fIerrbuf_size\fP); |
.B char *\fIerrbuf\fP, size_t \fIerrbuf_size\fP); |
| 21 |
.PP |
.PP |
|
.br |
|
| 22 |
.B void regfree(regex_t *\fIpreg\fP); |
.B void regfree(regex_t *\fIpreg\fP); |
| 23 |
. |
. |
| 24 |
.SH DESCRIPTION |
.SH DESCRIPTION |
| 210 |
.SH AUTHOR |
.SH AUTHOR |
| 211 |
.rs |
.rs |
| 212 |
.sp |
.sp |
| 213 |
|
.nf |
| 214 |
Philip Hazel |
Philip Hazel |
| 215 |
.br |
University Computing Service |
|
University Computing Service, |
|
|
.br |
|
| 216 |
Cambridge CB2 3QH, England. |
Cambridge CB2 3QH, England. |
| 217 |
.P |
.fi |
| 218 |
.in 0 |
. |
| 219 |
Last updated: 16 January 2006 |
. |
| 220 |
.br |
.SH REVISION |
| 221 |
Copyright (c) 1997-2006 University of Cambridge. |
.rs |
| 222 |
|
.sp |
| 223 |
|
.nf |
| 224 |
|
Last updated: 06 March 2007 |
| 225 |
|
Copyright (c) 1997-2007 University of Cambridge. |
| 226 |
|
.fi |