Buy the book!
|[ < ]||[ > ]||[ << ]||[ Up ]||[ >> ]||[Top]||[Contents]||[Index]||[ ? ]|
Searching the Berkeley UNIX way means searching in a string
starting at its first character and trying successive positions within
it to find a match. Once you've compiled a pattern using
(see section 7.3.1 BSD Regular Expression Compiling), you can ask Regex
to search for that pattern in a string using:
int re_exec (char *string)
string is the address of the null-terminated string in which you want to search.
re_exec returns either 1 for success or 0 for failure. It
automatically uses a GNU fastmap (see section 7.1.6 Searching with Fastmaps).
|webmaster donations bookstore||delorie software privacy|
|Copyright © 2003 by The Free Software Foundation||Updated Jun 2003|