Commit | Line | Data |
---|---|---|
b8d4c8d0 GM |
1 | @c -*-texinfo-*- |
2 | @c This is part of the GNU Emacs Lisp Reference Manual. | |
3 | @c Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1998, 1999, 2001, | |
5df4f04c | 4 | @c 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 |
d24880de | 5 | @c Free Software Foundation, Inc. |
b8d4c8d0 | 6 | @c See the file elisp.texi for copying conditions. |
6336d8c3 | 7 | @setfilename ../../info/searching |
b8d4c8d0 GM |
8 | @node Searching and Matching, Syntax Tables, Non-ASCII Characters, Top |
9 | @chapter Searching and Matching | |
10 | @cindex searching | |
11 | ||
12 | GNU Emacs provides two ways to search through a buffer for specified | |
13 | text: exact string searches and regular expression searches. After a | |
14 | regular expression search, you can examine the @dfn{match data} to | |
15 | determine which text matched the whole regular expression or various | |
16 | portions of it. | |
17 | ||
18 | @menu | |
19 | * String Search:: Search for an exact match. | |
20 | * Searching and Case:: Case-independent or case-significant searching. | |
21 | * Regular Expressions:: Describing classes of strings. | |
22 | * Regexp Search:: Searching for a match for a regexp. | |
23 | * POSIX Regexps:: Searching POSIX-style for the longest match. | |
24 | * Match Data:: Finding out which part of the text matched, | |
25 | after a string or regexp search. | |
d24880de | 26 | * Search and Replace:: Commands that loop, searching and replacing. |
b8d4c8d0 GM |
27 | * Standard Regexps:: Useful regexps for finding sentences, pages,... |
28 | @end menu | |
29 | ||
30 | The @samp{skip-chars@dots{}} functions also perform a kind of searching. | |
31 | @xref{Skipping Characters}. To search for changes in character | |
32 | properties, see @ref{Property Search}. | |
33 | ||
34 | @node String Search | |
35 | @section Searching for Strings | |
36 | @cindex string search | |
37 | ||
38 | These are the primitive functions for searching through the text in a | |
39 | buffer. They are meant for use in programs, but you may call them | |
40 | interactively. If you do so, they prompt for the search string; the | |
41 | arguments @var{limit} and @var{noerror} are @code{nil}, and @var{repeat} | |
42 | is 1. | |
43 | ||
44 | These search functions convert the search string to multibyte if the | |
45 | buffer is multibyte; they convert the search string to unibyte if the | |
46 | buffer is unibyte. @xref{Text Representations}. | |
47 | ||
48 | @deffn Command search-forward string &optional limit noerror repeat | |
49 | This function searches forward from point for an exact match for | |
50 | @var{string}. If successful, it sets point to the end of the occurrence | |
51 | found, and returns the new value of point. If no match is found, the | |
52 | value and side effects depend on @var{noerror} (see below). | |
53 | @c Emacs 19 feature | |
54 | ||
55 | In the following example, point is initially at the beginning of the | |
56 | line. Then @code{(search-forward "fox")} moves point after the last | |
57 | letter of @samp{fox}: | |
58 | ||
59 | @example | |
60 | @group | |
61 | ---------- Buffer: foo ---------- | |
62 | @point{}The quick brown fox jumped over the lazy dog. | |
63 | ---------- Buffer: foo ---------- | |
64 | @end group | |
65 | ||
66 | @group | |
67 | (search-forward "fox") | |
68 | @result{} 20 | |
69 | ||
70 | ---------- Buffer: foo ---------- | |
71 | The quick brown fox@point{} jumped over the lazy dog. | |
72 | ---------- Buffer: foo ---------- | |
73 | @end group | |
74 | @end example | |
75 | ||
76 | The argument @var{limit} specifies the upper bound to the search. (It | |
77 | must be a position in the current buffer.) No match extending after | |
78 | that position is accepted. If @var{limit} is omitted or @code{nil}, it | |
79 | defaults to the end of the accessible portion of the buffer. | |
80 | ||
81 | @kindex search-failed | |
82 | What happens when the search fails depends on the value of | |
83 | @var{noerror}. If @var{noerror} is @code{nil}, a @code{search-failed} | |
84 | error is signaled. If @var{noerror} is @code{t}, @code{search-forward} | |
85 | returns @code{nil} and does nothing. If @var{noerror} is neither | |
86 | @code{nil} nor @code{t}, then @code{search-forward} moves point to the | |
87 | upper bound and returns @code{nil}. (It would be more consistent now to | |
88 | return the new position of point in that case, but some existing | |
89 | programs may depend on a value of @code{nil}.) | |
90 | ||
91 | The argument @var{noerror} only affects valid searches which fail to | |
92 | find a match. Invalid arguments cause errors regardless of | |
93 | @var{noerror}. | |
94 | ||
95 | If @var{repeat} is supplied (it must be a positive number), then the | |
96 | search is repeated that many times (each time starting at the end of the | |
97 | previous time's match). If these successive searches succeed, the | |
98 | function succeeds, moving point and returning its new value. Otherwise | |
99 | the search fails, with results depending on the value of | |
100 | @var{noerror}, as described above. | |
101 | @end deffn | |
102 | ||
103 | @deffn Command search-backward string &optional limit noerror repeat | |
104 | This function searches backward from point for @var{string}. It is | |
105 | just like @code{search-forward} except that it searches backwards and | |
106 | leaves point at the beginning of the match. | |
107 | @end deffn | |
108 | ||
109 | @deffn Command word-search-forward string &optional limit noerror repeat | |
b8d4c8d0 GM |
110 | This function searches forward from point for a ``word'' match for |
111 | @var{string}. If it finds a match, it sets point to the end of the | |
112 | match found, and returns the new value of point. | |
b8d4c8d0 GM |
113 | |
114 | Word matching regards @var{string} as a sequence of words, disregarding | |
115 | punctuation that separates them. It searches the buffer for the same | |
116 | sequence of words. Each word must be distinct in the buffer (searching | |
117 | for the word @samp{ball} does not match the word @samp{balls}), but the | |
118 | details of punctuation and spacing are ignored (searching for @samp{ball | |
119 | boy} does match @samp{ball. Boy!}). | |
120 | ||
121 | In this example, point is initially at the beginning of the buffer; the | |
122 | search leaves it between the @samp{y} and the @samp{!}. | |
123 | ||
124 | @example | |
125 | @group | |
126 | ---------- Buffer: foo ---------- | |
127 | @point{}He said "Please! Find | |
128 | the ball boy!" | |
129 | ---------- Buffer: foo ---------- | |
130 | @end group | |
131 | ||
132 | @group | |
133 | (word-search-forward "Please find the ball, boy.") | |
134 | @result{} 35 | |
135 | ||
136 | ---------- Buffer: foo ---------- | |
137 | He said "Please! Find | |
138 | the ball boy@point{}!" | |
139 | ---------- Buffer: foo ---------- | |
140 | @end group | |
141 | @end example | |
142 | ||
143 | If @var{limit} is non-@code{nil}, it must be a position in the current | |
144 | buffer; it specifies the upper bound to the search. The match found | |
145 | must not extend after that position. | |
146 | ||
147 | If @var{noerror} is @code{nil}, then @code{word-search-forward} signals | |
148 | an error if the search fails. If @var{noerror} is @code{t}, then it | |
149 | returns @code{nil} instead of signaling an error. If @var{noerror} is | |
150 | neither @code{nil} nor @code{t}, it moves point to @var{limit} (or the | |
151 | end of the accessible portion of the buffer) and returns @code{nil}. | |
152 | ||
153 | If @var{repeat} is non-@code{nil}, then the search is repeated that many | |
154 | times. Point is positioned at the end of the last match. | |
155 | @end deffn | |
156 | ||
fca4ec76 CY |
157 | @deffn Command word-search-forward-lax string &optional limit noerror repeat |
158 | This command is identical to @code{word-search-forward}, except that | |
159 | the end of @code{string} need not match a word boundary unless it ends | |
160 | in whitespace. For instance, searching for @samp{ball boy} matches | |
161 | @samp{ball boyee}, but does not match @samp{aball boy}. | |
162 | @end deffn | |
163 | ||
b8d4c8d0 GM |
164 | @deffn Command word-search-backward string &optional limit noerror repeat |
165 | This function searches backward from point for a word match to | |
166 | @var{string}. This function is just like @code{word-search-forward} | |
167 | except that it searches backward and normally leaves point at the | |
168 | beginning of the match. | |
169 | @end deffn | |
170 | ||
fca4ec76 CY |
171 | @deffn Command word-search-backward-lax string &optional limit noerror repeat |
172 | This command is identical to @code{word-search-backward}, except that | |
173 | the end of @code{string} need not match a word boundary unless it ends | |
174 | in whitespace. | |
175 | @end deffn | |
176 | ||
b8d4c8d0 GM |
177 | @node Searching and Case |
178 | @section Searching and Case | |
179 | @cindex searching and case | |
180 | ||
181 | By default, searches in Emacs ignore the case of the text they are | |
182 | searching through; if you specify searching for @samp{FOO}, then | |
183 | @samp{Foo} or @samp{foo} is also considered a match. This applies to | |
184 | regular expressions, too; thus, @samp{[aB]} would match @samp{a} or | |
185 | @samp{A} or @samp{b} or @samp{B}. | |
186 | ||
187 | If you do not want this feature, set the variable | |
188 | @code{case-fold-search} to @code{nil}. Then all letters must match | |
189 | exactly, including case. This is a buffer-local variable; altering the | |
190 | variable affects only the current buffer. (@xref{Intro to | |
4e3b4528 SM |
191 | Buffer-Local}.) Alternatively, you may change the default value of |
192 | @code{case-fold-search}. | |
b8d4c8d0 GM |
193 | |
194 | Note that the user-level incremental search feature handles case | |
fca4ec76 CY |
195 | distinctions differently. When the search string contains only lower |
196 | case letters, the search ignores case, but when the search string | |
197 | contains one or more upper case letters, the search becomes | |
198 | case-sensitive. But this has nothing to do with the searching | |
199 | functions used in Lisp code. | |
b8d4c8d0 GM |
200 | |
201 | @defopt case-fold-search | |
202 | This buffer-local variable determines whether searches should ignore | |
203 | case. If the variable is @code{nil} they do not ignore case; otherwise | |
204 | they do ignore case. | |
205 | @end defopt | |
206 | ||
fca4ec76 CY |
207 | @defopt case-replace |
208 | This variable determines whether the higher level replacement | |
209 | functions should preserve case. If the variable is @code{nil}, that | |
210 | means to use the replacement text verbatim. A non-@code{nil} value | |
211 | means to convert the case of the replacement text according to the | |
212 | text being replaced. | |
213 | ||
214 | This variable is used by passing it as an argument to the function | |
215 | @code{replace-match}. @xref{Replacing Match}. | |
216 | @end defopt | |
217 | ||
b8d4c8d0 GM |
218 | @node Regular Expressions |
219 | @section Regular Expressions | |
220 | @cindex regular expression | |
221 | @cindex regexp | |
222 | ||
fca4ec76 | 223 | A @dfn{regular expression}, or @dfn{regexp} for short, is a pattern that |
b8d4c8d0 GM |
224 | denotes a (possibly infinite) set of strings. Searching for matches for |
225 | a regexp is a very powerful operation. This section explains how to write | |
226 | regexps; the following section says how to search for them. | |
227 | ||
228 | @findex re-builder | |
229 | @cindex regular expressions, developing | |
230 | For convenient interactive development of regular expressions, you | |
231 | can use the @kbd{M-x re-builder} command. It provides a convenient | |
232 | interface for creating regular expressions, by giving immediate visual | |
233 | feedback in a separate buffer. As you edit the regexp, all its | |
234 | matches in the target buffer are highlighted. Each parenthesized | |
235 | sub-expression of the regexp is shown in a distinct face, which makes | |
236 | it easier to verify even very complex regexps. | |
237 | ||
238 | @menu | |
239 | * Syntax of Regexps:: Rules for writing regular expressions. | |
240 | * Regexp Example:: Illustrates regular expression syntax. | |
241 | * Regexp Functions:: Functions for operating on regular expressions. | |
242 | @end menu | |
243 | ||
244 | @node Syntax of Regexps | |
245 | @subsection Syntax of Regular Expressions | |
246 | ||
247 | Regular expressions have a syntax in which a few characters are | |
248 | special constructs and the rest are @dfn{ordinary}. An ordinary | |
249 | character is a simple regular expression that matches that character | |
250 | and nothing else. The special characters are @samp{.}, @samp{*}, | |
251 | @samp{+}, @samp{?}, @samp{[}, @samp{^}, @samp{$}, and @samp{\}; no new | |
252 | special characters will be defined in the future. The character | |
253 | @samp{]} is special if it ends a character alternative (see later). | |
254 | The character @samp{-} is special inside a character alternative. A | |
255 | @samp{[:} and balancing @samp{:]} enclose a character class inside a | |
256 | character alternative. Any other character appearing in a regular | |
257 | expression is ordinary, unless a @samp{\} precedes it. | |
258 | ||
259 | For example, @samp{f} is not a special character, so it is ordinary, and | |
260 | therefore @samp{f} is a regular expression that matches the string | |
261 | @samp{f} and no other string. (It does @emph{not} match the string | |
262 | @samp{fg}, but it does match a @emph{part} of that string.) Likewise, | |
263 | @samp{o} is a regular expression that matches only @samp{o}.@refill | |
264 | ||
265 | Any two regular expressions @var{a} and @var{b} can be concatenated. The | |
266 | result is a regular expression that matches a string if @var{a} matches | |
267 | some amount of the beginning of that string and @var{b} matches the rest of | |
268 | the string.@refill | |
269 | ||
270 | As a simple example, we can concatenate the regular expressions @samp{f} | |
271 | and @samp{o} to get the regular expression @samp{fo}, which matches only | |
272 | the string @samp{fo}. Still trivial. To do something more powerful, you | |
273 | need to use one of the special regular expression constructs. | |
274 | ||
275 | @menu | |
276 | * Regexp Special:: Special characters in regular expressions. | |
277 | * Char Classes:: Character classes used in regular expressions. | |
278 | * Regexp Backslash:: Backslash-sequences in regular expressions. | |
279 | @end menu | |
280 | ||
281 | @node Regexp Special | |
282 | @subsubsection Special Characters in Regular Expressions | |
283 | ||
284 | Here is a list of the characters that are special in a regular | |
285 | expression. | |
286 | ||
287 | @need 800 | |
288 | @table @asis | |
289 | @item @samp{.}@: @r{(Period)} | |
290 | @cindex @samp{.} in regexp | |
291 | is a special character that matches any single character except a newline. | |
292 | Using concatenation, we can make regular expressions like @samp{a.b}, which | |
293 | matches any three-character string that begins with @samp{a} and ends with | |
294 | @samp{b}.@refill | |
295 | ||
296 | @item @samp{*} | |
297 | @cindex @samp{*} in regexp | |
298 | is not a construct by itself; it is a postfix operator that means to | |
299 | match the preceding regular expression repetitively as many times as | |
300 | possible. Thus, @samp{o*} matches any number of @samp{o}s (including no | |
301 | @samp{o}s). | |
302 | ||
303 | @samp{*} always applies to the @emph{smallest} possible preceding | |
304 | expression. Thus, @samp{fo*} has a repeating @samp{o}, not a repeating | |
305 | @samp{fo}. It matches @samp{f}, @samp{fo}, @samp{foo}, and so on. | |
306 | ||
307 | The matcher processes a @samp{*} construct by matching, immediately, as | |
308 | many repetitions as can be found. Then it continues with the rest of | |
309 | the pattern. If that fails, backtracking occurs, discarding some of the | |
310 | matches of the @samp{*}-modified construct in the hope that that will | |
311 | make it possible to match the rest of the pattern. For example, in | |
312 | matching @samp{ca*ar} against the string @samp{caaar}, the @samp{a*} | |
313 | first tries to match all three @samp{a}s; but the rest of the pattern is | |
314 | @samp{ar} and there is only @samp{r} left to match, so this try fails. | |
315 | The next alternative is for @samp{a*} to match only two @samp{a}s. With | |
316 | this choice, the rest of the regexp matches successfully. | |
317 | ||
318 | @strong{Warning:} Nested repetition operators can run for an | |
319 | indefinitely long time, if they lead to ambiguous matching. For | |
320 | example, trying to match the regular expression @samp{\(x+y*\)*a} | |
321 | against the string @samp{xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxz} could | |
322 | take hours before it ultimately fails. Emacs must try each way of | |
323 | grouping the @samp{x}s before concluding that none of them can work. | |
324 | Even worse, @samp{\(x*\)*} can match the null string in infinitely | |
325 | many ways, so it causes an infinite loop. To avoid these problems, | |
326 | check nested repetitions carefully, to make sure that they do not | |
327 | cause combinatorial explosions in backtracking. | |
328 | ||
329 | @item @samp{+} | |
330 | @cindex @samp{+} in regexp | |
331 | is a postfix operator, similar to @samp{*} except that it must match | |
332 | the preceding expression at least once. So, for example, @samp{ca+r} | |
333 | matches the strings @samp{car} and @samp{caaaar} but not the string | |
334 | @samp{cr}, whereas @samp{ca*r} matches all three strings. | |
335 | ||
336 | @item @samp{?} | |
337 | @cindex @samp{?} in regexp | |
338 | is a postfix operator, similar to @samp{*} except that it must match the | |
339 | preceding expression either once or not at all. For example, | |
340 | @samp{ca?r} matches @samp{car} or @samp{cr}; nothing else. | |
341 | ||
342 | @item @samp{*?}, @samp{+?}, @samp{??} | |
3645358a | 343 | @cindex non-greedy repetition characters in regexp |
b8d4c8d0 GM |
344 | These are ``non-greedy'' variants of the operators @samp{*}, @samp{+} |
345 | and @samp{?}. Where those operators match the largest possible | |
346 | substring (consistent with matching the entire containing expression), | |
347 | the non-greedy variants match the smallest possible substring | |
348 | (consistent with matching the entire containing expression). | |
349 | ||
350 | For example, the regular expression @samp{c[ad]*a} when applied to the | |
351 | string @samp{cdaaada} matches the whole string; but the regular | |
352 | expression @samp{c[ad]*?a}, applied to that same string, matches just | |
353 | @samp{cda}. (The smallest possible match here for @samp{[ad]*?} that | |
354 | permits the whole expression to match is @samp{d}.) | |
355 | ||
356 | @item @samp{[ @dots{} ]} | |
357 | @cindex character alternative (in regexp) | |
358 | @cindex @samp{[} in regexp | |
359 | @cindex @samp{]} in regexp | |
360 | is a @dfn{character alternative}, which begins with @samp{[} and is | |
361 | terminated by @samp{]}. In the simplest case, the characters between | |
362 | the two brackets are what this character alternative can match. | |
363 | ||
364 | Thus, @samp{[ad]} matches either one @samp{a} or one @samp{d}, and | |
365 | @samp{[ad]*} matches any string composed of just @samp{a}s and @samp{d}s | |
ba3bf1d9 | 366 | (including the empty string). It follows that @samp{c[ad]*r} |
b8d4c8d0 GM |
367 | matches @samp{cr}, @samp{car}, @samp{cdr}, @samp{caddaar}, etc. |
368 | ||
369 | You can also include character ranges in a character alternative, by | |
370 | writing the starting and ending characters with a @samp{-} between them. | |
371 | Thus, @samp{[a-z]} matches any lower-case @acronym{ASCII} letter. | |
372 | Ranges may be intermixed freely with individual characters, as in | |
373 | @samp{[a-z$%.]}, which matches any lower case @acronym{ASCII} letter | |
374 | or @samp{$}, @samp{%} or period. | |
375 | ||
376 | Note that the usual regexp special characters are not special inside a | |
377 | character alternative. A completely different set of characters is | |
378 | special inside character alternatives: @samp{]}, @samp{-} and @samp{^}. | |
379 | ||
380 | To include a @samp{]} in a character alternative, you must make it the | |
381 | first character. For example, @samp{[]a]} matches @samp{]} or @samp{a}. | |
382 | To include a @samp{-}, write @samp{-} as the first or last character of | |
383 | the character alternative, or put it after a range. Thus, @samp{[]-]} | |
384 | matches both @samp{]} and @samp{-}. | |
385 | ||
386 | To include @samp{^} in a character alternative, put it anywhere but at | |
387 | the beginning. | |
388 | ||
389 | The beginning and end of a range of multibyte characters must be in | |
390 | the same character set (@pxref{Character Sets}). Thus, | |
391 | @code{"[\x8e0-\x97c]"} is invalid because character 0x8e0 (@samp{a} | |
392 | with grave accent) is in the Emacs character set for Latin-1 but the | |
393 | character 0x97c (@samp{u} with diaeresis) is in the Emacs character | |
394 | set for Latin-2. (We use Lisp string syntax to write that example, | |
395 | and a few others in the next few paragraphs, in order to include hex | |
396 | escape sequences in them.) | |
397 | ||
398 | If a range starts with a unibyte character @var{c} and ends with a | |
399 | multibyte character @var{c2}, the range is divided into two parts: one | |
400 | is @samp{@var{c}..?\377}, the other is @samp{@var{c1}..@var{c2}}, where | |
401 | @var{c1} is the first character of the charset to which @var{c2} | |
402 | belongs. | |
403 | ||
ba3bf1d9 CY |
404 | A character alternative can also specify named character classes |
405 | (@pxref{Char Classes}). This is a POSIX feature whose syntax is | |
406 | @samp{[:@var{class}:]}. Using a character class is equivalent to | |
407 | mentioning each of the characters in that class; but the latter is not | |
408 | feasible in practice, since some classes include thousands of | |
b8d4c8d0 GM |
409 | different characters. |
410 | ||
411 | @item @samp{[^ @dots{} ]} | |
412 | @cindex @samp{^} in regexp | |
413 | @samp{[^} begins a @dfn{complemented character alternative}. This | |
414 | matches any character except the ones specified. Thus, | |
415 | @samp{[^a-z0-9A-Z]} matches all characters @emph{except} letters and | |
416 | digits. | |
417 | ||
418 | @samp{^} is not special in a character alternative unless it is the first | |
419 | character. The character following the @samp{^} is treated as if it | |
420 | were first (in other words, @samp{-} and @samp{]} are not special there). | |
421 | ||
422 | A complemented character alternative can match a newline, unless newline is | |
423 | mentioned as one of the characters not to match. This is in contrast to | |
424 | the handling of regexps in programs such as @code{grep}. | |
425 | ||
ba3bf1d9 CY |
426 | You can specify named character classes, just like in character |
427 | alternatives. For instance, @samp{[^[:ascii:]]} matches any | |
428 | non-@acronym{ASCII} character. @xref{Char Classes}. | |
429 | ||
b8d4c8d0 GM |
430 | @item @samp{^} |
431 | @cindex beginning of line in regexp | |
432 | When matching a buffer, @samp{^} matches the empty string, but only at the | |
433 | beginning of a line in the text being matched (or the beginning of the | |
434 | accessible portion of the buffer). Otherwise it fails to match | |
435 | anything. Thus, @samp{^foo} matches a @samp{foo} that occurs at the | |
436 | beginning of a line. | |
437 | ||
438 | When matching a string instead of a buffer, @samp{^} matches at the | |
439 | beginning of the string or after a newline character. | |
440 | ||
441 | For historical compatibility reasons, @samp{^} can be used only at the | |
442 | beginning of the regular expression, or after @samp{\(}, @samp{\(?:} | |
443 | or @samp{\|}. | |
444 | ||
445 | @item @samp{$} | |
446 | @cindex @samp{$} in regexp | |
447 | @cindex end of line in regexp | |
448 | is similar to @samp{^} but matches only at the end of a line (or the | |
449 | end of the accessible portion of the buffer). Thus, @samp{x+$} | |
450 | matches a string of one @samp{x} or more at the end of a line. | |
451 | ||
452 | When matching a string instead of a buffer, @samp{$} matches at the end | |
453 | of the string or before a newline character. | |
454 | ||
455 | For historical compatibility reasons, @samp{$} can be used only at the | |
456 | end of the regular expression, or before @samp{\)} or @samp{\|}. | |
457 | ||
458 | @item @samp{\} | |
459 | @cindex @samp{\} in regexp | |
460 | has two functions: it quotes the special characters (including | |
461 | @samp{\}), and it introduces additional special constructs. | |
462 | ||
463 | Because @samp{\} quotes special characters, @samp{\$} is a regular | |
464 | expression that matches only @samp{$}, and @samp{\[} is a regular | |
465 | expression that matches only @samp{[}, and so on. | |
466 | ||
467 | Note that @samp{\} also has special meaning in the read syntax of Lisp | |
468 | strings (@pxref{String Type}), and must be quoted with @samp{\}. For | |
469 | example, the regular expression that matches the @samp{\} character is | |
470 | @samp{\\}. To write a Lisp string that contains the characters | |
471 | @samp{\\}, Lisp syntax requires you to quote each @samp{\} with another | |
472 | @samp{\}. Therefore, the read syntax for a regular expression matching | |
473 | @samp{\} is @code{"\\\\"}.@refill | |
474 | @end table | |
475 | ||
476 | @strong{Please note:} For historical compatibility, special characters | |
477 | are treated as ordinary ones if they are in contexts where their special | |
478 | meanings make no sense. For example, @samp{*foo} treats @samp{*} as | |
479 | ordinary since there is no preceding expression on which the @samp{*} | |
480 | can act. It is poor practice to depend on this behavior; quote the | |
481 | special character anyway, regardless of where it appears.@refill | |
482 | ||
483 | As a @samp{\} is not special inside a character alternative, it can | |
484 | never remove the special meaning of @samp{-} or @samp{]}. So you | |
485 | should not quote these characters when they have no special meaning | |
486 | either. This would not clarify anything, since backslashes can | |
487 | legitimately precede these characters where they @emph{have} special | |
488 | meaning, as in @samp{[^\]} (@code{"[^\\]"} for Lisp string syntax), | |
489 | which matches any single character except a backslash. | |
490 | ||
491 | In practice, most @samp{]} that occur in regular expressions close a | |
492 | character alternative and hence are special. However, occasionally a | |
493 | regular expression may try to match a complex pattern of literal | |
494 | @samp{[} and @samp{]}. In such situations, it sometimes may be | |
495 | necessary to carefully parse the regexp from the start to determine | |
496 | which square brackets enclose a character alternative. For example, | |
497 | @samp{[^][]]} consists of the complemented character alternative | |
498 | @samp{[^][]} (which matches any single character that is not a square | |
499 | bracket), followed by a literal @samp{]}. | |
500 | ||
501 | The exact rules are that at the beginning of a regexp, @samp{[} is | |
502 | special and @samp{]} not. This lasts until the first unquoted | |
503 | @samp{[}, after which we are in a character alternative; @samp{[} is | |
504 | no longer special (except when it starts a character class) but @samp{]} | |
505 | is special, unless it immediately follows the special @samp{[} or that | |
506 | @samp{[} followed by a @samp{^}. This lasts until the next special | |
507 | @samp{]} that does not end a character class. This ends the character | |
508 | alternative and restores the ordinary syntax of regular expressions; | |
509 | an unquoted @samp{[} is special again and a @samp{]} not. | |
510 | ||
511 | @node Char Classes | |
512 | @subsubsection Character Classes | |
513 | @cindex character classes in regexp | |
514 | ||
515 | Here is a table of the classes you can use in a character alternative, | |
516 | and what they mean: | |
517 | ||
518 | @table @samp | |
519 | @item [:ascii:] | |
520 | This matches any @acronym{ASCII} character (codes 0--127). | |
521 | @item [:alnum:] | |
522 | This matches any letter or digit. (At present, for multibyte | |
523 | characters, it matches anything that has word syntax.) | |
524 | @item [:alpha:] | |
525 | This matches any letter. (At present, for multibyte characters, it | |
526 | matches anything that has word syntax.) | |
527 | @item [:blank:] | |
528 | This matches space and tab only. | |
529 | @item [:cntrl:] | |
530 | This matches any @acronym{ASCII} control character. | |
531 | @item [:digit:] | |
532 | This matches @samp{0} through @samp{9}. Thus, @samp{[-+[:digit:]]} | |
533 | matches any digit, as well as @samp{+} and @samp{-}. | |
534 | @item [:graph:] | |
535 | This matches graphic characters---everything except @acronym{ASCII} control | |
536 | characters, space, and the delete character. | |
537 | @item [:lower:] | |
4359a806 CY |
538 | This matches any lower-case letter, as determined by the current case |
539 | table (@pxref{Case Tables}). If @code{case-fold-search} is | |
540 | non-@code{nil}, this also matches any upper-case letter. | |
b8d4c8d0 GM |
541 | @item [:multibyte:] |
542 | This matches any multibyte character (@pxref{Text Representations}). | |
543 | @item [:nonascii:] | |
544 | This matches any non-@acronym{ASCII} character. | |
545 | @item [:print:] | |
546 | This matches printing characters---everything except @acronym{ASCII} control | |
547 | characters and the delete character. | |
548 | @item [:punct:] | |
549 | This matches any punctuation character. (At present, for multibyte | |
550 | characters, it matches anything that has non-word syntax.) | |
551 | @item [:space:] | |
552 | This matches any character that has whitespace syntax | |
553 | (@pxref{Syntax Class Table}). | |
554 | @item [:unibyte:] | |
555 | This matches any unibyte character (@pxref{Text Representations}). | |
556 | @item [:upper:] | |
4359a806 CY |
557 | This matches any upper-case letter, as determined by the current case |
558 | table (@pxref{Case Tables}). If @code{case-fold-search} is | |
559 | non-@code{nil}, this also matches any lower-case letter. | |
b8d4c8d0 GM |
560 | @item [:word:] |
561 | This matches any character that has word syntax (@pxref{Syntax Class | |
562 | Table}). | |
563 | @item [:xdigit:] | |
564 | This matches the hexadecimal digits: @samp{0} through @samp{9}, @samp{a} | |
565 | through @samp{f} and @samp{A} through @samp{F}. | |
566 | @end table | |
567 | ||
568 | @node Regexp Backslash | |
569 | @subsubsection Backslash Constructs in Regular Expressions | |
570 | ||
571 | For the most part, @samp{\} followed by any character matches only | |
572 | that character. However, there are several exceptions: certain | |
573 | two-character sequences starting with @samp{\} that have special | |
574 | meanings. (The character after the @samp{\} in such a sequence is | |
575 | always ordinary when used on its own.) Here is a table of the special | |
576 | @samp{\} constructs. | |
577 | ||
578 | @table @samp | |
579 | @item \| | |
580 | @cindex @samp{|} in regexp | |
581 | @cindex regexp alternative | |
582 | specifies an alternative. | |
583 | Two regular expressions @var{a} and @var{b} with @samp{\|} in | |
584 | between form an expression that matches anything that either @var{a} or | |
585 | @var{b} matches.@refill | |
586 | ||
587 | Thus, @samp{foo\|bar} matches either @samp{foo} or @samp{bar} | |
588 | but no other string.@refill | |
589 | ||
590 | @samp{\|} applies to the largest possible surrounding expressions. Only a | |
591 | surrounding @samp{\( @dots{} \)} grouping can limit the grouping power of | |
592 | @samp{\|}.@refill | |
593 | ||
594 | If you need full backtracking capability to handle multiple uses of | |
595 | @samp{\|}, use the POSIX regular expression functions (@pxref{POSIX | |
596 | Regexps}). | |
597 | ||
598 | @item \@{@var{m}\@} | |
599 | is a postfix operator that repeats the previous pattern exactly @var{m} | |
600 | times. Thus, @samp{x\@{5\@}} matches the string @samp{xxxxx} | |
601 | and nothing else. @samp{c[ad]\@{3\@}r} matches string such as | |
602 | @samp{caaar}, @samp{cdddr}, @samp{cadar}, and so on. | |
603 | ||
604 | @item \@{@var{m},@var{n}\@} | |
605 | is a more general postfix operator that specifies repetition with a | |
606 | minimum of @var{m} repeats and a maximum of @var{n} repeats. If @var{m} | |
607 | is omitted, the minimum is 0; if @var{n} is omitted, there is no | |
608 | maximum. | |
609 | ||
610 | For example, @samp{c[ad]\@{1,2\@}r} matches the strings @samp{car}, | |
611 | @samp{cdr}, @samp{caar}, @samp{cadr}, @samp{cdar}, and @samp{cddr}, and | |
612 | nothing else.@* | |
d24880de GM |
613 | @samp{\@{0,1\@}} or @samp{\@{,1\@}} is equivalent to @samp{?}.@* |
614 | @samp{\@{0,\@}} or @samp{\@{,\@}} is equivalent to @samp{*}.@* | |
b8d4c8d0 GM |
615 | @samp{\@{1,\@}} is equivalent to @samp{+}. |
616 | ||
617 | @item \( @dots{} \) | |
618 | @cindex @samp{(} in regexp | |
619 | @cindex @samp{)} in regexp | |
620 | @cindex regexp grouping | |
621 | is a grouping construct that serves three purposes: | |
622 | ||
623 | @enumerate | |
624 | @item | |
625 | To enclose a set of @samp{\|} alternatives for other operations. Thus, | |
626 | the regular expression @samp{\(foo\|bar\)x} matches either @samp{foox} | |
627 | or @samp{barx}. | |
628 | ||
629 | @item | |
630 | To enclose a complicated expression for the postfix operators @samp{*}, | |
631 | @samp{+} and @samp{?} to operate on. Thus, @samp{ba\(na\)*} matches | |
632 | @samp{ba}, @samp{bana}, @samp{banana}, @samp{bananana}, etc., with any | |
633 | number (zero or more) of @samp{na} strings. | |
634 | ||
635 | @item | |
636 | To record a matched substring for future reference with | |
637 | @samp{\@var{digit}} (see below). | |
638 | @end enumerate | |
639 | ||
640 | This last application is not a consequence of the idea of a | |
641 | parenthetical grouping; it is a separate feature that was assigned as a | |
642 | second meaning to the same @samp{\( @dots{} \)} construct because, in | |
643 | practice, there was usually no conflict between the two meanings. But | |
644 | occasionally there is a conflict, and that led to the introduction of | |
645 | shy groups. | |
646 | ||
647 | @item \(?: @dots{} \) | |
80d7cdca CY |
648 | @cindex shy groups |
649 | @cindex non-capturing group | |
650 | @cindex unnumbered group | |
47f24290 | 651 | @cindex @samp{(?:} in regexp |
b8d4c8d0 GM |
652 | is the @dfn{shy group} construct. A shy group serves the first two |
653 | purposes of an ordinary group (controlling the nesting of other | |
654 | operators), but it does not get a number, so you cannot refer back to | |
80d7cdca CY |
655 | its value with @samp{\@var{digit}}. Shy groups are particularly |
656 | useful for mechanically-constructed regular expressions, because they | |
657 | can be added automatically without altering the numbering of ordinary, | |
658 | non-shy groups. | |
b8d4c8d0 | 659 | |
80d7cdca CY |
660 | Shy groups are also called @dfn{non-capturing} or @dfn{unnumbered |
661 | groups}. | |
b8d4c8d0 GM |
662 | |
663 | @item \(?@var{num}: @dots{} \) | |
664 | is the @dfn{explicitly numbered group} construct. Normal groups get | |
665 | their number implicitly, based on their position, which can be | |
666 | inconvenient. This construct allows you to force a particular group | |
667 | number. There is no particular restriction on the numbering, | |
668 | e.g.@: you can have several groups with the same number in which case | |
669 | the last one to match (i.e.@: the rightmost match) will win. | |
670 | Implicitly numbered groups always get the smallest integer larger than | |
671 | the one of any previous group. | |
672 | ||
673 | @item \@var{digit} | |
674 | matches the same text that matched the @var{digit}th occurrence of a | |
675 | grouping (@samp{\( @dots{} \)}) construct. | |
676 | ||
677 | In other words, after the end of a group, the matcher remembers the | |
678 | beginning and end of the text matched by that group. Later on in the | |
679 | regular expression you can use @samp{\} followed by @var{digit} to | |
680 | match that same text, whatever it may have been. | |
681 | ||
682 | The strings matching the first nine grouping constructs appearing in | |
683 | the entire regular expression passed to a search or matching function | |
684 | are assigned numbers 1 through 9 in the order that the open | |
685 | parentheses appear in the regular expression. So you can use | |
686 | @samp{\1} through @samp{\9} to refer to the text matched by the | |
687 | corresponding grouping constructs. | |
688 | ||
689 | For example, @samp{\(.*\)\1} matches any newline-free string that is | |
690 | composed of two identical halves. The @samp{\(.*\)} matches the first | |
691 | half, which may be anything, but the @samp{\1} that follows must match | |
692 | the same exact text. | |
693 | ||
694 | If a @samp{\( @dots{} \)} construct matches more than once (which can | |
695 | happen, for instance, if it is followed by @samp{*}), only the last | |
696 | match is recorded. | |
697 | ||
698 | If a particular grouping construct in the regular expression was never | |
699 | matched---for instance, if it appears inside of an alternative that | |
700 | wasn't used, or inside of a repetition that repeated zero times---then | |
701 | the corresponding @samp{\@var{digit}} construct never matches | |
748c30f4 | 702 | anything. To use an artificial example, @samp{\(foo\(b*\)\|lose\)\2} |
b8d4c8d0 GM |
703 | cannot match @samp{lose}: the second alternative inside the larger |
704 | group matches it, but then @samp{\2} is undefined and can't match | |
705 | anything. But it can match @samp{foobb}, because the first | |
706 | alternative matches @samp{foob} and @samp{\2} matches @samp{b}. | |
707 | ||
708 | @item \w | |
709 | @cindex @samp{\w} in regexp | |
710 | matches any word-constituent character. The editor syntax table | |
711 | determines which characters these are. @xref{Syntax Tables}. | |
712 | ||
713 | @item \W | |
714 | @cindex @samp{\W} in regexp | |
715 | matches any character that is not a word constituent. | |
716 | ||
717 | @item \s@var{code} | |
718 | @cindex @samp{\s} in regexp | |
719 | matches any character whose syntax is @var{code}. Here @var{code} is a | |
720 | character that represents a syntax code: thus, @samp{w} for word | |
721 | constituent, @samp{-} for whitespace, @samp{(} for open parenthesis, | |
722 | etc. To represent whitespace syntax, use either @samp{-} or a space | |
723 | character. @xref{Syntax Class Table}, for a list of syntax codes and | |
724 | the characters that stand for them. | |
725 | ||
726 | @item \S@var{code} | |
727 | @cindex @samp{\S} in regexp | |
728 | matches any character whose syntax is not @var{code}. | |
729 | ||
730 | @item \c@var{c} | |
731 | matches any character whose category is @var{c}. Here @var{c} is a | |
732 | character that represents a category: thus, @samp{c} for Chinese | |
733 | characters or @samp{g} for Greek characters in the standard category | |
734 | table. | |
735 | ||
736 | @item \C@var{c} | |
737 | matches any character whose category is not @var{c}. | |
738 | @end table | |
739 | ||
740 | The following regular expression constructs match the empty string---that is, | |
741 | they don't use up any characters---but whether they match depends on the | |
742 | context. For all, the beginning and end of the accessible portion of | |
743 | the buffer are treated as if they were the actual beginning and end of | |
744 | the buffer. | |
745 | ||
746 | @table @samp | |
747 | @item \` | |
748 | @cindex @samp{\`} in regexp | |
749 | matches the empty string, but only at the beginning | |
750 | of the buffer or string being matched against. | |
751 | ||
752 | @item \' | |
753 | @cindex @samp{\'} in regexp | |
754 | matches the empty string, but only at the end of | |
755 | the buffer or string being matched against. | |
756 | ||
757 | @item \= | |
758 | @cindex @samp{\=} in regexp | |
759 | matches the empty string, but only at point. | |
760 | (This construct is not defined when matching against a string.) | |
761 | ||
762 | @item \b | |
763 | @cindex @samp{\b} in regexp | |
764 | matches the empty string, but only at the beginning or | |
765 | end of a word. Thus, @samp{\bfoo\b} matches any occurrence of | |
766 | @samp{foo} as a separate word. @samp{\bballs?\b} matches | |
767 | @samp{ball} or @samp{balls} as a separate word.@refill | |
768 | ||
769 | @samp{\b} matches at the beginning or end of the buffer (or string) | |
770 | regardless of what text appears next to it. | |
771 | ||
772 | @item \B | |
773 | @cindex @samp{\B} in regexp | |
774 | matches the empty string, but @emph{not} at the beginning or | |
775 | end of a word, nor at the beginning or end of the buffer (or string). | |
776 | ||
777 | @item \< | |
778 | @cindex @samp{\<} in regexp | |
779 | matches the empty string, but only at the beginning of a word. | |
780 | @samp{\<} matches at the beginning of the buffer (or string) only if a | |
781 | word-constituent character follows. | |
782 | ||
783 | @item \> | |
784 | @cindex @samp{\>} in regexp | |
785 | matches the empty string, but only at the end of a word. @samp{\>} | |
786 | matches at the end of the buffer (or string) only if the contents end | |
787 | with a word-constituent character. | |
788 | ||
789 | @item \_< | |
790 | @cindex @samp{\_<} in regexp | |
791 | matches the empty string, but only at the beginning of a symbol. A | |
792 | symbol is a sequence of one or more word or symbol constituent | |
793 | characters. @samp{\_<} matches at the beginning of the buffer (or | |
794 | string) only if a symbol-constituent character follows. | |
795 | ||
796 | @item \_> | |
797 | @cindex @samp{\_>} in regexp | |
798 | matches the empty string, but only at the end of a symbol. @samp{\_>} | |
799 | matches at the end of the buffer (or string) only if the contents end | |
800 | with a symbol-constituent character. | |
801 | @end table | |
802 | ||
803 | @kindex invalid-regexp | |
804 | Not every string is a valid regular expression. For example, a string | |
805 | that ends inside a character alternative without terminating @samp{]} | |
806 | is invalid, and so is a string that ends with a single @samp{\}. If | |
807 | an invalid regular expression is passed to any of the search functions, | |
808 | an @code{invalid-regexp} error is signaled. | |
809 | ||
810 | @node Regexp Example | |
811 | @comment node-name, next, previous, up | |
812 | @subsection Complex Regexp Example | |
813 | ||
814 | Here is a complicated regexp which was formerly used by Emacs to | |
815 | recognize the end of a sentence together with any whitespace that | |
816 | follows. (Nowadays Emacs uses a similar but more complex default | |
817 | regexp constructed by the function @code{sentence-end}. | |
818 | @xref{Standard Regexps}.) | |
819 | ||
820 | First, we show the regexp as a string in Lisp syntax to distinguish | |
821 | spaces from tab characters. The string constant begins and ends with a | |
822 | double-quote. @samp{\"} stands for a double-quote as part of the | |
823 | string, @samp{\\} for a backslash as part of the string, @samp{\t} for a | |
824 | tab and @samp{\n} for a newline. | |
825 | ||
826 | @example | |
827 | "[.?!][]\"')@}]*\\($\\| $\\|\t\\|@ @ \\)[ \t\n]*" | |
828 | @end example | |
829 | ||
830 | @noindent | |
831 | In contrast, if you evaluate this string, you will see the following: | |
832 | ||
833 | @example | |
834 | @group | |
835 | "[.?!][]\"')@}]*\\($\\| $\\|\t\\|@ @ \\)[ \t\n]*" | |
836 | @result{} "[.?!][]\"')@}]*\\($\\| $\\| \\|@ @ \\)[ | |
837 | ]*" | |
838 | @end group | |
839 | @end example | |
840 | ||
841 | @noindent | |
842 | In this output, tab and newline appear as themselves. | |
843 | ||
844 | This regular expression contains four parts in succession and can be | |
845 | deciphered as follows: | |
846 | ||
847 | @table @code | |
848 | @item [.?!] | |
849 | The first part of the pattern is a character alternative that matches | |
850 | any one of three characters: period, question mark, and exclamation | |
851 | mark. The match must begin with one of these three characters. (This | |
852 | is one point where the new default regexp used by Emacs differs from | |
853 | the old. The new value also allows some non-@acronym{ASCII} | |
854 | characters that end a sentence without any following whitespace.) | |
855 | ||
856 | @item []\"')@}]* | |
857 | The second part of the pattern matches any closing braces and quotation | |
858 | marks, zero or more of them, that may follow the period, question mark | |
859 | or exclamation mark. The @code{\"} is Lisp syntax for a double-quote in | |
860 | a string. The @samp{*} at the end indicates that the immediately | |
861 | preceding regular expression (a character alternative, in this case) may be | |
862 | repeated zero or more times. | |
863 | ||
864 | @item \\($\\|@ $\\|\t\\|@ @ \\) | |
865 | The third part of the pattern matches the whitespace that follows the | |
866 | end of a sentence: the end of a line (optionally with a space), or a | |
867 | tab, or two spaces. The double backslashes mark the parentheses and | |
868 | vertical bars as regular expression syntax; the parentheses delimit a | |
869 | group and the vertical bars separate alternatives. The dollar sign is | |
870 | used to match the end of a line. | |
871 | ||
872 | @item [ \t\n]* | |
873 | Finally, the last part of the pattern matches any additional whitespace | |
874 | beyond the minimum needed to end a sentence. | |
875 | @end table | |
876 | ||
877 | @node Regexp Functions | |
878 | @subsection Regular Expression Functions | |
879 | ||
880 | These functions operate on regular expressions. | |
881 | ||
882 | @defun regexp-quote string | |
883 | This function returns a regular expression whose only exact match is | |
884 | @var{string}. Using this regular expression in @code{looking-at} will | |
885 | succeed only if the next characters in the buffer are @var{string}; | |
886 | using it in a search function will succeed if the text being searched | |
887 | contains @var{string}. | |
888 | ||
889 | This allows you to request an exact string match or search when calling | |
890 | a function that wants a regular expression. | |
891 | ||
892 | @example | |
893 | @group | |
894 | (regexp-quote "^The cat$") | |
895 | @result{} "\\^The cat\\$" | |
896 | @end group | |
897 | @end example | |
898 | ||
899 | One use of @code{regexp-quote} is to combine an exact string match with | |
900 | context described as a regular expression. For example, this searches | |
901 | for the string that is the value of @var{string}, surrounded by | |
902 | whitespace: | |
903 | ||
904 | @example | |
905 | @group | |
906 | (re-search-forward | |
907 | (concat "\\s-" (regexp-quote string) "\\s-")) | |
908 | @end group | |
909 | @end example | |
910 | @end defun | |
911 | ||
912 | @defun regexp-opt strings &optional paren | |
913 | This function returns an efficient regular expression that will match | |
914 | any of the strings in the list @var{strings}. This is useful when you | |
915 | need to make matching or searching as fast as possible---for example, | |
916 | for Font Lock mode. | |
917 | ||
918 | If the optional argument @var{paren} is non-@code{nil}, then the | |
919 | returned regular expression is always enclosed by at least one | |
920 | parentheses-grouping construct. If @var{paren} is @code{words}, then | |
921 | that construct is additionally surrounded by @samp{\<} and @samp{\>}. | |
922 | ||
923 | This simplified definition of @code{regexp-opt} produces a | |
924 | regular expression which is equivalent to the actual value | |
925 | (but not as efficient): | |
926 | ||
927 | @example | |
928 | (defun regexp-opt (strings paren) | |
929 | (let ((open-paren (if paren "\\(" "")) | |
930 | (close-paren (if paren "\\)" ""))) | |
931 | (concat open-paren | |
932 | (mapconcat 'regexp-quote strings "\\|") | |
933 | close-paren))) | |
934 | @end example | |
935 | @end defun | |
936 | ||
937 | @defun regexp-opt-depth regexp | |
938 | This function returns the total number of grouping constructs | |
80d7cdca CY |
939 | (parenthesized expressions) in @var{regexp}. This does not include |
940 | shy groups (@pxref{Regexp Backslash}). | |
b8d4c8d0 GM |
941 | @end defun |
942 | ||
943 | @node Regexp Search | |
944 | @section Regular Expression Searching | |
945 | @cindex regular expression searching | |
946 | @cindex regexp searching | |
947 | @cindex searching for regexp | |
948 | ||
949 | In GNU Emacs, you can search for the next match for a regular | |
950 | expression either incrementally or not. For incremental search | |
951 | commands, see @ref{Regexp Search, , Regular Expression Search, emacs, | |
952 | The GNU Emacs Manual}. Here we describe only the search functions | |
953 | useful in programs. The principal one is @code{re-search-forward}. | |
954 | ||
955 | These search functions convert the regular expression to multibyte if | |
956 | the buffer is multibyte; they convert the regular expression to unibyte | |
957 | if the buffer is unibyte. @xref{Text Representations}. | |
958 | ||
959 | @deffn Command re-search-forward regexp &optional limit noerror repeat | |
960 | This function searches forward in the current buffer for a string of | |
961 | text that is matched by the regular expression @var{regexp}. The | |
962 | function skips over any amount of text that is not matched by | |
963 | @var{regexp}, and leaves point at the end of the first match found. | |
964 | It returns the new value of point. | |
965 | ||
966 | If @var{limit} is non-@code{nil}, it must be a position in the current | |
967 | buffer. It specifies the upper bound to the search. No match | |
968 | extending after that position is accepted. | |
969 | ||
970 | If @var{repeat} is supplied, it must be a positive number; the search | |
971 | is repeated that many times; each repetition starts at the end of the | |
972 | previous match. If all these successive searches succeed, the search | |
973 | succeeds, moving point and returning its new value. Otherwise the | |
974 | search fails. What @code{re-search-forward} does when the search | |
975 | fails depends on the value of @var{noerror}: | |
976 | ||
977 | @table @asis | |
978 | @item @code{nil} | |
979 | Signal a @code{search-failed} error. | |
980 | @item @code{t} | |
981 | Do nothing and return @code{nil}. | |
982 | @item anything else | |
983 | Move point to @var{limit} (or the end of the accessible portion of the | |
984 | buffer) and return @code{nil}. | |
985 | @end table | |
986 | ||
987 | In the following example, point is initially before the @samp{T}. | |
988 | Evaluating the search call moves point to the end of that line (between | |
989 | the @samp{t} of @samp{hat} and the newline). | |
990 | ||
991 | @example | |
992 | @group | |
993 | ---------- Buffer: foo ---------- | |
994 | I read "@point{}The cat in the hat | |
995 | comes back" twice. | |
996 | ---------- Buffer: foo ---------- | |
997 | @end group | |
998 | ||
999 | @group | |
1000 | (re-search-forward "[a-z]+" nil t 5) | |
1001 | @result{} 27 | |
1002 | ||
1003 | ---------- Buffer: foo ---------- | |
1004 | I read "The cat in the hat@point{} | |
1005 | comes back" twice. | |
1006 | ---------- Buffer: foo ---------- | |
1007 | @end group | |
1008 | @end example | |
1009 | @end deffn | |
1010 | ||
1011 | @deffn Command re-search-backward regexp &optional limit noerror repeat | |
1012 | This function searches backward in the current buffer for a string of | |
1013 | text that is matched by the regular expression @var{regexp}, leaving | |
1014 | point at the beginning of the first text found. | |
1015 | ||
1016 | This function is analogous to @code{re-search-forward}, but they are not | |
1017 | simple mirror images. @code{re-search-forward} finds the match whose | |
1018 | beginning is as close as possible to the starting point. If | |
1019 | @code{re-search-backward} were a perfect mirror image, it would find the | |
1020 | match whose end is as close as possible. However, in fact it finds the | |
1021 | match whose beginning is as close as possible (and yet ends before the | |
1022 | starting point). The reason for this is that matching a regular | |
1023 | expression at a given spot always works from beginning to end, and | |
1024 | starts at a specified beginning position. | |
1025 | ||
1026 | A true mirror-image of @code{re-search-forward} would require a special | |
1027 | feature for matching regular expressions from end to beginning. It's | |
1028 | not worth the trouble of implementing that. | |
1029 | @end deffn | |
1030 | ||
1031 | @defun string-match regexp string &optional start | |
1032 | This function returns the index of the start of the first match for | |
1033 | the regular expression @var{regexp} in @var{string}, or @code{nil} if | |
1034 | there is no match. If @var{start} is non-@code{nil}, the search starts | |
1035 | at that index in @var{string}. | |
1036 | ||
1037 | For example, | |
1038 | ||
1039 | @example | |
1040 | @group | |
1041 | (string-match | |
1042 | "quick" "The quick brown fox jumped quickly.") | |
1043 | @result{} 4 | |
1044 | @end group | |
1045 | @group | |
1046 | (string-match | |
1047 | "quick" "The quick brown fox jumped quickly." 8) | |
1048 | @result{} 27 | |
1049 | @end group | |
1050 | @end example | |
1051 | ||
1052 | @noindent | |
1053 | The index of the first character of the | |
1054 | string is 0, the index of the second character is 1, and so on. | |
1055 | ||
1056 | After this function returns, the index of the first character beyond | |
1057 | the match is available as @code{(match-end 0)}. @xref{Match Data}. | |
1058 | ||
1059 | @example | |
1060 | @group | |
1061 | (string-match | |
1062 | "quick" "The quick brown fox jumped quickly." 8) | |
1063 | @result{} 27 | |
1064 | @end group | |
1065 | ||
1066 | @group | |
1067 | (match-end 0) | |
1068 | @result{} 32 | |
1069 | @end group | |
1070 | @end example | |
1071 | @end defun | |
1072 | ||
3645358a | 1073 | @defun string-match-p regexp string &optional start |
4433fa91 EZ |
1074 | This predicate function does what @code{string-match} does, but it |
1075 | avoids modifying the match data. | |
3645358a EZ |
1076 | @end defun |
1077 | ||
b8d4c8d0 GM |
1078 | @defun looking-at regexp |
1079 | This function determines whether the text in the current buffer directly | |
1080 | following point matches the regular expression @var{regexp}. ``Directly | |
1081 | following'' means precisely that: the search is ``anchored'' and it can | |
1082 | succeed only starting with the first character following point. The | |
1083 | result is @code{t} if so, @code{nil} otherwise. | |
1084 | ||
1085 | This function does not move point, but it updates the match data, which | |
1086 | you can access using @code{match-beginning} and @code{match-end}. | |
3645358a EZ |
1087 | @xref{Match Data}. If you need to test for a match without modifying |
1088 | the match data, use @code{looking-at-p}, described below. | |
b8d4c8d0 GM |
1089 | |
1090 | In this example, point is located directly before the @samp{T}. If it | |
1091 | were anywhere else, the result would be @code{nil}. | |
1092 | ||
1093 | @example | |
1094 | @group | |
1095 | ---------- Buffer: foo ---------- | |
1096 | I read "@point{}The cat in the hat | |
1097 | comes back" twice. | |
1098 | ---------- Buffer: foo ---------- | |
1099 | ||
1100 | (looking-at "The cat in the hat$") | |
1101 | @result{} t | |
1102 | @end group | |
1103 | @end example | |
1104 | @end defun | |
1105 | ||
1899a5d0 | 1106 | @defun looking-back regexp &optional limit greedy |
b8d4c8d0 GM |
1107 | This function returns @code{t} if @var{regexp} matches text before |
1108 | point, ending at point, and @code{nil} otherwise. | |
1109 | ||
1110 | Because regular expression matching works only going forward, this is | |
1111 | implemented by searching backwards from point for a match that ends at | |
1112 | point. That can be quite slow if it has to search a long distance. | |
1113 | You can bound the time required by specifying @var{limit}, which says | |
1114 | not to search before @var{limit}. In this case, the match that is | |
1115 | found must begin at or after @var{limit}. | |
1116 | ||
1899a5d0 CY |
1117 | If @var{greedy} is non-@code{nil}, this function extends the match |
1118 | backwards as far as possible, stopping when a single additional | |
1119 | previous character cannot be part of a match for regexp. When the | |
d60a8ab2 | 1120 | match is extended, its starting position is allowed to occur before |
1899a5d0 CY |
1121 | @var{limit}. |
1122 | ||
b8d4c8d0 GM |
1123 | @example |
1124 | @group | |
1125 | ---------- Buffer: foo ---------- | |
1126 | I read "@point{}The cat in the hat | |
1127 | comes back" twice. | |
1128 | ---------- Buffer: foo ---------- | |
1129 | ||
1130 | (looking-back "read \"" 3) | |
1131 | @result{} t | |
1132 | (looking-back "read \"" 4) | |
1133 | @result{} nil | |
1134 | @end group | |
1135 | @end example | |
1136 | @end defun | |
1137 | ||
3645358a EZ |
1138 | @defun looking-at-p regexp |
1139 | This predicate function works like @code{looking-at}, but without | |
1140 | updating the match data. | |
1141 | @end defun | |
1142 | ||
b8d4c8d0 GM |
1143 | @defvar search-spaces-regexp |
1144 | If this variable is non-@code{nil}, it should be a regular expression | |
1145 | that says how to search for whitespace. In that case, any group of | |
1146 | spaces in a regular expression being searched for stands for use of | |
1147 | this regular expression. However, spaces inside of constructs such as | |
1148 | @samp{[@dots{}]} and @samp{*}, @samp{+}, @samp{?} are not affected by | |
1149 | @code{search-spaces-regexp}. | |
1150 | ||
1151 | Since this variable affects all regular expression search and match | |
1152 | constructs, you should bind it temporarily for as small as possible | |
1153 | a part of the code. | |
1154 | @end defvar | |
1155 | ||
1156 | @node POSIX Regexps | |
1157 | @section POSIX Regular Expression Searching | |
1158 | ||
1159 | The usual regular expression functions do backtracking when necessary | |
1160 | to handle the @samp{\|} and repetition constructs, but they continue | |
1161 | this only until they find @emph{some} match. Then they succeed and | |
1162 | report the first match found. | |
1163 | ||
1164 | This section describes alternative search functions which perform the | |
1165 | full backtracking specified by the POSIX standard for regular expression | |
1166 | matching. They continue backtracking until they have tried all | |
1167 | possibilities and found all matches, so they can report the longest | |
1168 | match, as required by POSIX. This is much slower, so use these | |
1169 | functions only when you really need the longest match. | |
1170 | ||
1171 | The POSIX search and match functions do not properly support the | |
3645358a EZ |
1172 | non-greedy repetition operators (@pxref{Regexp Special, non-greedy}). |
1173 | This is because POSIX backtracking conflicts with the semantics of | |
1174 | non-greedy repetition. | |
b8d4c8d0 | 1175 | |
106e6894 | 1176 | @deffn Command posix-search-forward regexp &optional limit noerror repeat |
b8d4c8d0 GM |
1177 | This is like @code{re-search-forward} except that it performs the full |
1178 | backtracking specified by the POSIX standard for regular expression | |
1179 | matching. | |
106e6894 | 1180 | @end deffn |
b8d4c8d0 | 1181 | |
106e6894 | 1182 | @deffn Command posix-search-backward regexp &optional limit noerror repeat |
b8d4c8d0 GM |
1183 | This is like @code{re-search-backward} except that it performs the full |
1184 | backtracking specified by the POSIX standard for regular expression | |
1185 | matching. | |
106e6894 | 1186 | @end deffn |
b8d4c8d0 GM |
1187 | |
1188 | @defun posix-looking-at regexp | |
1189 | This is like @code{looking-at} except that it performs the full | |
1190 | backtracking specified by the POSIX standard for regular expression | |
1191 | matching. | |
1192 | @end defun | |
1193 | ||
1194 | @defun posix-string-match regexp string &optional start | |
1195 | This is like @code{string-match} except that it performs the full | |
1196 | backtracking specified by the POSIX standard for regular expression | |
1197 | matching. | |
1198 | @end defun | |
1199 | ||
1200 | @node Match Data | |
1201 | @section The Match Data | |
1202 | @cindex match data | |
1203 | ||
1204 | Emacs keeps track of the start and end positions of the segments of | |
1205 | text found during a search; this is called the @dfn{match data}. | |
1206 | Thanks to the match data, you can search for a complex pattern, such | |
1207 | as a date in a mail message, and then extract parts of the match under | |
1208 | control of the pattern. | |
1209 | ||
1210 | Because the match data normally describe the most recent search only, | |
1211 | you must be careful not to do another search inadvertently between the | |
1212 | search you wish to refer back to and the use of the match data. If you | |
1213 | can't avoid another intervening search, you must save and restore the | |
1214 | match data around it, to prevent it from being overwritten. | |
1215 | ||
1216 | @menu | |
d24880de | 1217 | * Replacing Match:: Replacing a substring that was matched. |
b8d4c8d0 | 1218 | * Simple Match Data:: Accessing single items of match data, |
d24880de | 1219 | such as where a particular subexpression started. |
b8d4c8d0 GM |
1220 | * Entire Match Data:: Accessing the entire match data at once, as a list. |
1221 | * Saving Match Data:: Saving and restoring the match data. | |
1222 | @end menu | |
1223 | ||
1224 | @node Replacing Match | |
1225 | @subsection Replacing the Text that Matched | |
1226 | @cindex replace matched text | |
1227 | ||
1228 | This function replaces all or part of the text matched by the last | |
1229 | search. It works by means of the match data. | |
1230 | ||
1231 | @cindex case in replacements | |
1232 | @defun replace-match replacement &optional fixedcase literal string subexp | |
1233 | This function replaces the text in the buffer (or in @var{string}) that | |
1234 | was matched by the last search. It replaces that text with | |
1235 | @var{replacement}. | |
1236 | ||
1237 | If you did the last search in a buffer, you should specify @code{nil} | |
1238 | for @var{string} and make sure that the current buffer when you call | |
1239 | @code{replace-match} is the one in which you did the searching or | |
1240 | matching. Then @code{replace-match} does the replacement by editing | |
1241 | the buffer; it leaves point at the end of the replacement text, and | |
1242 | returns @code{t}. | |
1243 | ||
1244 | If you did the search in a string, pass the same string as @var{string}. | |
1245 | Then @code{replace-match} does the replacement by constructing and | |
1246 | returning a new string. | |
1247 | ||
1248 | If @var{fixedcase} is non-@code{nil}, then @code{replace-match} uses | |
1249 | the replacement text without case conversion; otherwise, it converts | |
1250 | the replacement text depending upon the capitalization of the text to | |
1251 | be replaced. If the original text is all upper case, this converts | |
1252 | the replacement text to upper case. If all words of the original text | |
1253 | are capitalized, this capitalizes all the words of the replacement | |
1254 | text. If all the words are one-letter and they are all upper case, | |
1255 | they are treated as capitalized words rather than all-upper-case | |
1256 | words. | |
1257 | ||
1258 | If @var{literal} is non-@code{nil}, then @var{replacement} is inserted | |
1259 | exactly as it is, the only alterations being case changes as needed. | |
1260 | If it is @code{nil} (the default), then the character @samp{\} is treated | |
1261 | specially. If a @samp{\} appears in @var{replacement}, then it must be | |
1262 | part of one of the following sequences: | |
1263 | ||
1264 | @table @asis | |
1265 | @item @samp{\&} | |
1266 | @cindex @samp{&} in replacement | |
1267 | @samp{\&} stands for the entire text being replaced. | |
1268 | ||
1269 | @item @samp{\@var{n}} | |
1270 | @cindex @samp{\@var{n}} in replacement | |
1271 | @samp{\@var{n}}, where @var{n} is a digit, stands for the text that | |
1272 | matched the @var{n}th subexpression in the original regexp. | |
1273 | Subexpressions are those expressions grouped inside @samp{\(@dots{}\)}. | |
1274 | If the @var{n}th subexpression never matched, an empty string is substituted. | |
1275 | ||
1276 | @item @samp{\\} | |
1277 | @cindex @samp{\} in replacement | |
1278 | @samp{\\} stands for a single @samp{\} in the replacement text. | |
1279 | @end table | |
1280 | ||
1281 | These substitutions occur after case conversion, if any, | |
1282 | so the strings they substitute are never case-converted. | |
1283 | ||
1284 | If @var{subexp} is non-@code{nil}, that says to replace just | |
1285 | subexpression number @var{subexp} of the regexp that was matched, not | |
1286 | the entire match. For example, after matching @samp{foo \(ba*r\)}, | |
1287 | calling @code{replace-match} with 1 as @var{subexp} means to replace | |
1288 | just the text that matched @samp{\(ba*r\)}. | |
1289 | @end defun | |
1290 | ||
fe284805 JL |
1291 | @defun match-substitute-replacement replacement &optional fixedcase literal string subexp |
1292 | This function returns the text that would be inserted into the buffer | |
1293 | by @code{replace-match}, but without modifying the buffer. It is | |
1294 | useful if you want to present the user with actual replacement result, | |
1295 | with constructs like @samp{\@var{n}} or @samp{\&} substituted with | |
1296 | matched groups. Arguments @var{replacement} and optional | |
1297 | @var{fixedcase}, @var{literal}, @var{string} and @var{subexp} have the | |
1298 | same meaning as for @code{replace-match}. | |
1299 | @end defun | |
1300 | ||
b8d4c8d0 GM |
1301 | @node Simple Match Data |
1302 | @subsection Simple Match Data Access | |
1303 | ||
1304 | This section explains how to use the match data to find out what was | |
1305 | matched by the last search or match operation, if it succeeded. | |
1306 | ||
1307 | You can ask about the entire matching text, or about a particular | |
1308 | parenthetical subexpression of a regular expression. The @var{count} | |
1309 | argument in the functions below specifies which. If @var{count} is | |
1310 | zero, you are asking about the entire match. If @var{count} is | |
1311 | positive, it specifies which subexpression you want. | |
1312 | ||
1313 | Recall that the subexpressions of a regular expression are those | |
1314 | expressions grouped with escaped parentheses, @samp{\(@dots{}\)}. The | |
1315 | @var{count}th subexpression is found by counting occurrences of | |
1316 | @samp{\(} from the beginning of the whole regular expression. The first | |
1317 | subexpression is numbered 1, the second 2, and so on. Only regular | |
1318 | expressions can have subexpressions---after a simple string search, the | |
1319 | only information available is about the entire match. | |
1320 | ||
1321 | Every successful search sets the match data. Therefore, you should | |
1322 | query the match data immediately after searching, before calling any | |
1323 | other function that might perform another search. Alternatively, you | |
1324 | may save and restore the match data (@pxref{Saving Match Data}) around | |
1325 | the call to functions that could perform another search. | |
1326 | ||
1327 | A search which fails may or may not alter the match data. In the | |
1328 | past, a failing search did not do this, but we may change it in the | |
1329 | future. So don't try to rely on the value of the match data after | |
1330 | a failing search. | |
1331 | ||
1332 | @defun match-string count &optional in-string | |
1333 | This function returns, as a string, the text matched in the last search | |
1334 | or match operation. It returns the entire text if @var{count} is zero, | |
1335 | or just the portion corresponding to the @var{count}th parenthetical | |
1336 | subexpression, if @var{count} is positive. | |
1337 | ||
1338 | If the last such operation was done against a string with | |
1339 | @code{string-match}, then you should pass the same string as the | |
1340 | argument @var{in-string}. After a buffer search or match, | |
1341 | you should omit @var{in-string} or pass @code{nil} for it; but you | |
1342 | should make sure that the current buffer when you call | |
1343 | @code{match-string} is the one in which you did the searching or | |
1344 | matching. | |
1345 | ||
1346 | The value is @code{nil} if @var{count} is out of range, or for a | |
1347 | subexpression inside a @samp{\|} alternative that wasn't used or a | |
1348 | repetition that repeated zero times. | |
1349 | @end defun | |
1350 | ||
1351 | @defun match-string-no-properties count &optional in-string | |
1352 | This function is like @code{match-string} except that the result | |
1353 | has no text properties. | |
1354 | @end defun | |
1355 | ||
1356 | @defun match-beginning count | |
1357 | This function returns the position of the start of text matched by the | |
1358 | last regular expression searched for, or a subexpression of it. | |
1359 | ||
1360 | If @var{count} is zero, then the value is the position of the start of | |
1361 | the entire match. Otherwise, @var{count} specifies a subexpression in | |
1362 | the regular expression, and the value of the function is the starting | |
1363 | position of the match for that subexpression. | |
1364 | ||
1365 | The value is @code{nil} for a subexpression inside a @samp{\|} | |
1366 | alternative that wasn't used or a repetition that repeated zero times. | |
1367 | @end defun | |
1368 | ||
1369 | @defun match-end count | |
1370 | This function is like @code{match-beginning} except that it returns the | |
1371 | position of the end of the match, rather than the position of the | |
1372 | beginning. | |
1373 | @end defun | |
1374 | ||
1375 | Here is an example of using the match data, with a comment showing the | |
1376 | positions within the text: | |
1377 | ||
1378 | @example | |
1379 | @group | |
1380 | (string-match "\\(qu\\)\\(ick\\)" | |
1381 | "The quick fox jumped quickly.") | |
1382 | ;0123456789 | |
1383 | @result{} 4 | |
1384 | @end group | |
1385 | ||
1386 | @group | |
1387 | (match-string 0 "The quick fox jumped quickly.") | |
1388 | @result{} "quick" | |
1389 | (match-string 1 "The quick fox jumped quickly.") | |
1390 | @result{} "qu" | |
1391 | (match-string 2 "The quick fox jumped quickly.") | |
1392 | @result{} "ick" | |
1393 | @end group | |
1394 | ||
1395 | @group | |
1396 | (match-beginning 1) ; @r{The beginning of the match} | |
1397 | @result{} 4 ; @r{with @samp{qu} is at index 4.} | |
1398 | @end group | |
1399 | ||
1400 | @group | |
1401 | (match-beginning 2) ; @r{The beginning of the match} | |
1402 | @result{} 6 ; @r{with @samp{ick} is at index 6.} | |
1403 | @end group | |
1404 | ||
1405 | @group | |
1406 | (match-end 1) ; @r{The end of the match} | |
1407 | @result{} 6 ; @r{with @samp{qu} is at index 6.} | |
1408 | ||
1409 | (match-end 2) ; @r{The end of the match} | |
1410 | @result{} 9 ; @r{with @samp{ick} is at index 9.} | |
1411 | @end group | |
1412 | @end example | |
1413 | ||
1414 | Here is another example. Point is initially located at the beginning | |
1415 | of the line. Searching moves point to between the space and the word | |
1416 | @samp{in}. The beginning of the entire match is at the 9th character of | |
1417 | the buffer (@samp{T}), and the beginning of the match for the first | |
1418 | subexpression is at the 13th character (@samp{c}). | |
1419 | ||
1420 | @example | |
1421 | @group | |
1422 | (list | |
1423 | (re-search-forward "The \\(cat \\)") | |
1424 | (match-beginning 0) | |
1425 | (match-beginning 1)) | |
1899a5d0 | 1426 | @result{} (17 9 13) |
b8d4c8d0 GM |
1427 | @end group |
1428 | ||
1429 | @group | |
1430 | ---------- Buffer: foo ---------- | |
1431 | I read "The cat @point{}in the hat comes back" twice. | |
1432 | ^ ^ | |
1433 | 9 13 | |
1434 | ---------- Buffer: foo ---------- | |
1435 | @end group | |
1436 | @end example | |
1437 | ||
1438 | @noindent | |
1439 | (In this case, the index returned is a buffer position; the first | |
1440 | character of the buffer counts as 1.) | |
1441 | ||
1442 | @node Entire Match Data | |
1443 | @subsection Accessing the Entire Match Data | |
1444 | ||
1445 | The functions @code{match-data} and @code{set-match-data} read or | |
1446 | write the entire match data, all at once. | |
1447 | ||
1448 | @defun match-data &optional integers reuse reseat | |
1449 | This function returns a list of positions (markers or integers) that | |
1450 | record all the information on what text the last search matched. | |
1451 | Element zero is the position of the beginning of the match for the | |
1452 | whole expression; element one is the position of the end of the match | |
1453 | for the expression. The next two elements are the positions of the | |
1454 | beginning and end of the match for the first subexpression, and so on. | |
1455 | In general, element | |
1456 | @ifnottex | |
1457 | number 2@var{n} | |
1458 | @end ifnottex | |
1459 | @tex | |
1460 | number {\mathsurround=0pt $2n$} | |
1461 | @end tex | |
1462 | corresponds to @code{(match-beginning @var{n})}; and | |
1463 | element | |
1464 | @ifnottex | |
1465 | number 2@var{n} + 1 | |
1466 | @end ifnottex | |
1467 | @tex | |
1468 | number {\mathsurround=0pt $2n+1$} | |
1469 | @end tex | |
1470 | corresponds to @code{(match-end @var{n})}. | |
1471 | ||
1472 | Normally all the elements are markers or @code{nil}, but if | |
1473 | @var{integers} is non-@code{nil}, that means to use integers instead | |
1474 | of markers. (In that case, the buffer itself is appended as an | |
1475 | additional element at the end of the list, to facilitate complete | |
1476 | restoration of the match data.) If the last match was done on a | |
1477 | string with @code{string-match}, then integers are always used, | |
1478 | since markers can't point into a string. | |
1479 | ||
1480 | If @var{reuse} is non-@code{nil}, it should be a list. In that case, | |
1481 | @code{match-data} stores the match data in @var{reuse}. That is, | |
1482 | @var{reuse} is destructively modified. @var{reuse} does not need to | |
1483 | have the right length. If it is not long enough to contain the match | |
1484 | data, it is extended. If it is too long, the length of @var{reuse} | |
1485 | stays the same, but the elements that were not used are set to | |
1486 | @code{nil}. The purpose of this feature is to reduce the need for | |
1487 | garbage collection. | |
1488 | ||
1489 | If @var{reseat} is non-@code{nil}, all markers on the @var{reuse} list | |
1490 | are reseated to point to nowhere. | |
1491 | ||
1492 | As always, there must be no possibility of intervening searches between | |
1493 | the call to a search function and the call to @code{match-data} that is | |
1494 | intended to access the match data for that search. | |
1495 | ||
1496 | @example | |
1497 | @group | |
1498 | (match-data) | |
1499 | @result{} (#<marker at 9 in foo> | |
1500 | #<marker at 17 in foo> | |
1501 | #<marker at 13 in foo> | |
1502 | #<marker at 17 in foo>) | |
1503 | @end group | |
1504 | @end example | |
1505 | @end defun | |
1506 | ||
1507 | @defun set-match-data match-list &optional reseat | |
1508 | This function sets the match data from the elements of @var{match-list}, | |
1509 | which should be a list that was the value of a previous call to | |
1510 | @code{match-data}. (More precisely, anything that has the same format | |
1511 | will work.) | |
1512 | ||
1513 | If @var{match-list} refers to a buffer that doesn't exist, you don't get | |
1514 | an error; that sets the match data in a meaningless but harmless way. | |
1515 | ||
1516 | If @var{reseat} is non-@code{nil}, all markers on the @var{match-list} list | |
1517 | are reseated to point to nowhere. | |
1518 | ||
1519 | @findex store-match-data | |
1520 | @code{store-match-data} is a semi-obsolete alias for @code{set-match-data}. | |
1521 | @end defun | |
1522 | ||
1523 | @node Saving Match Data | |
1524 | @subsection Saving and Restoring the Match Data | |
1525 | ||
1526 | When you call a function that may do a search, you may need to save | |
1527 | and restore the match data around that call, if you want to preserve the | |
1528 | match data from an earlier search for later use. Here is an example | |
1529 | that shows the problem that arises if you fail to save the match data: | |
1530 | ||
1531 | @example | |
1532 | @group | |
1533 | (re-search-forward "The \\(cat \\)") | |
1534 | @result{} 48 | |
1535 | (foo) ; @r{Perhaps @code{foo} does} | |
1536 | ; @r{more searching.} | |
1537 | (match-end 0) | |
1538 | @result{} 61 ; @r{Unexpected result---not 48!} | |
1539 | @end group | |
1540 | @end example | |
1541 | ||
1542 | You can save and restore the match data with @code{save-match-data}: | |
1543 | ||
1544 | @defmac save-match-data body@dots{} | |
1545 | This macro executes @var{body}, saving and restoring the match | |
1546 | data around it. The return value is the value of the last form in | |
1547 | @var{body}. | |
1548 | @end defmac | |
1549 | ||
1550 | You could use @code{set-match-data} together with @code{match-data} to | |
1551 | imitate the effect of the special form @code{save-match-data}. Here is | |
1552 | how: | |
1553 | ||
1554 | @example | |
1555 | @group | |
1556 | (let ((data (match-data))) | |
1557 | (unwind-protect | |
1558 | @dots{} ; @r{Ok to change the original match data.} | |
1559 | (set-match-data data))) | |
1560 | @end group | |
1561 | @end example | |
1562 | ||
1563 | Emacs automatically saves and restores the match data when it runs | |
1564 | process filter functions (@pxref{Filter Functions}) and process | |
1565 | sentinels (@pxref{Sentinels}). | |
1566 | ||
1567 | @ignore | |
1568 | Here is a function which restores the match data provided the buffer | |
1569 | associated with it still exists. | |
1570 | ||
1571 | @smallexample | |
1572 | @group | |
1573 | (defun restore-match-data (data) | |
1574 | @c It is incorrect to split the first line of a doc string. | |
1575 | @c If there's a problem here, it should be solved in some other way. | |
1576 | "Restore the match data DATA unless the buffer is missing." | |
1577 | (catch 'foo | |
1578 | (let ((d data)) | |
1579 | @end group | |
1580 | (while d | |
1581 | (and (car d) | |
1582 | (null (marker-buffer (car d))) | |
1583 | @group | |
1584 | ;; @file{match-data} @r{buffer is deleted.} | |
1585 | (throw 'foo nil)) | |
1586 | (setq d (cdr d))) | |
1587 | (set-match-data data)))) | |
1588 | @end group | |
1589 | @end smallexample | |
1590 | @end ignore | |
1591 | ||
1592 | @node Search and Replace | |
1593 | @section Search and Replace | |
1594 | @cindex replacement after search | |
1595 | @cindex searching and replacing | |
1596 | ||
1597 | If you want to find all matches for a regexp in part of the buffer, | |
1598 | and replace them, the best way is to write an explicit loop using | |
1599 | @code{re-search-forward} and @code{replace-match}, like this: | |
1600 | ||
1601 | @example | |
1602 | (while (re-search-forward "foo[ \t]+bar" nil t) | |
1603 | (replace-match "foobar")) | |
1604 | @end example | |
1605 | ||
1606 | @noindent | |
1607 | @xref{Replacing Match,, Replacing the Text that Matched}, for a | |
1608 | description of @code{replace-match}. | |
1609 | ||
1610 | However, replacing matches in a string is more complex, especially | |
1611 | if you want to do it efficiently. So Emacs provides a function to do | |
1612 | this. | |
1613 | ||
1614 | @defun replace-regexp-in-string regexp rep string &optional fixedcase literal subexp start | |
1615 | This function copies @var{string} and searches it for matches for | |
1616 | @var{regexp}, and replaces them with @var{rep}. It returns the | |
1617 | modified copy. If @var{start} is non-@code{nil}, the search for | |
1618 | matches starts at that index in @var{string}, so matches starting | |
1619 | before that index are not changed. | |
1620 | ||
1621 | This function uses @code{replace-match} to do the replacement, and it | |
1622 | passes the optional arguments @var{fixedcase}, @var{literal} and | |
1623 | @var{subexp} along to @code{replace-match}. | |
1624 | ||
1625 | Instead of a string, @var{rep} can be a function. In that case, | |
1626 | @code{replace-regexp-in-string} calls @var{rep} for each match, | |
1627 | passing the text of the match as its sole argument. It collects the | |
1628 | value @var{rep} returns and passes that to @code{replace-match} as the | |
1629 | replacement string. The match-data at this point are the result | |
1630 | of matching @var{regexp} against a substring of @var{string}. | |
1631 | @end defun | |
1632 | ||
1633 | If you want to write a command along the lines of @code{query-replace}, | |
1634 | you can use @code{perform-replace} to do the work. | |
1635 | ||
1636 | @defun perform-replace from-string replacements query-flag regexp-flag delimited-flag &optional repeat-count map start end | |
1637 | This function is the guts of @code{query-replace} and related | |
1638 | commands. It searches for occurrences of @var{from-string} in the | |
1639 | text between positions @var{start} and @var{end} and replaces some or | |
1640 | all of them. If @var{start} is @code{nil} (or omitted), point is used | |
1641 | instead, and the end of the buffer's accessible portion is used for | |
1642 | @var{end}. | |
1643 | ||
1644 | If @var{query-flag} is @code{nil}, it replaces all | |
1645 | occurrences; otherwise, it asks the user what to do about each one. | |
1646 | ||
1647 | If @var{regexp-flag} is non-@code{nil}, then @var{from-string} is | |
1648 | considered a regular expression; otherwise, it must match literally. If | |
1649 | @var{delimited-flag} is non-@code{nil}, then only replacements | |
1650 | surrounded by word boundaries are considered. | |
1651 | ||
1652 | The argument @var{replacements} specifies what to replace occurrences | |
1653 | with. If it is a string, that string is used. It can also be a list of | |
1654 | strings, to be used in cyclic order. | |
1655 | ||
80120f13 EZ |
1656 | If @var{replacements} is a cons cell, @w{@code{(@var{function} |
1657 | . @var{data})}}, this means to call @var{function} after each match to | |
b8d4c8d0 GM |
1658 | get the replacement text. This function is called with two arguments: |
1659 | @var{data}, and the number of replacements already made. | |
1660 | ||
1661 | If @var{repeat-count} is non-@code{nil}, it should be an integer. Then | |
1662 | it specifies how many times to use each of the strings in the | |
1663 | @var{replacements} list before advancing cyclically to the next one. | |
1664 | ||
1665 | If @var{from-string} contains upper-case letters, then | |
1666 | @code{perform-replace} binds @code{case-fold-search} to @code{nil}, and | |
1667 | it uses the @code{replacements} without altering the case of them. | |
1668 | ||
1669 | Normally, the keymap @code{query-replace-map} defines the possible | |
1670 | user responses for queries. The argument @var{map}, if | |
1671 | non-@code{nil}, specifies a keymap to use instead of | |
1672 | @code{query-replace-map}. | |
80120f13 EZ |
1673 | |
1674 | This function uses one of two functions to search for the next | |
1675 | occurrence of @var{from-string}. These functions are specified by the | |
1676 | values of two variables: @code{replace-re-search-function} and | |
1677 | @code{replace-search-function}. The former is called when the | |
1678 | argument @var{regexp-flag} is non-@code{nil}, the latter when it is | |
1679 | @code{nil}. | |
b8d4c8d0 GM |
1680 | @end defun |
1681 | ||
1682 | @defvar query-replace-map | |
1683 | This variable holds a special keymap that defines the valid user | |
1684 | responses for @code{perform-replace} and the commands that use it, as | |
1685 | well as @code{y-or-n-p} and @code{map-y-or-n-p}. This map is unusual | |
1686 | in two ways: | |
1687 | ||
1688 | @itemize @bullet | |
1689 | @item | |
1690 | The ``key bindings'' are not commands, just symbols that are meaningful | |
1691 | to the functions that use this map. | |
1692 | ||
1693 | @item | |
1694 | Prefix keys are not supported; each key binding must be for a | |
1695 | single-event key sequence. This is because the functions don't use | |
1696 | @code{read-key-sequence} to get the input; instead, they read a single | |
1697 | event and look it up ``by hand.'' | |
1698 | @end itemize | |
1699 | @end defvar | |
1700 | ||
1701 | Here are the meaningful ``bindings'' for @code{query-replace-map}. | |
1702 | Several of them are meaningful only for @code{query-replace} and | |
1703 | friends. | |
1704 | ||
1705 | @table @code | |
1706 | @item act | |
1707 | Do take the action being considered---in other words, ``yes.'' | |
1708 | ||
1709 | @item skip | |
1710 | Do not take action for this question---in other words, ``no.'' | |
1711 | ||
1712 | @item exit | |
1713 | Answer this question ``no,'' and give up on the entire series of | |
1714 | questions, assuming that the answers will be ``no.'' | |
1715 | ||
1716 | @item act-and-exit | |
1717 | Answer this question ``yes,'' and give up on the entire series of | |
1718 | questions, assuming that subsequent answers will be ``no.'' | |
1719 | ||
1720 | @item act-and-show | |
1721 | Answer this question ``yes,'' but show the results---don't advance yet | |
1722 | to the next question. | |
1723 | ||
1724 | @item automatic | |
1725 | Answer this question and all subsequent questions in the series with | |
1726 | ``yes,'' without further user interaction. | |
1727 | ||
1728 | @item backup | |
1729 | Move back to the previous place that a question was asked about. | |
1730 | ||
1731 | @item edit | |
1732 | Enter a recursive edit to deal with this question---instead of any | |
1733 | other action that would normally be taken. | |
1734 | ||
1735 | @item delete-and-edit | |
1736 | Delete the text being considered, then enter a recursive edit to replace | |
1737 | it. | |
1738 | ||
1739 | @item recenter | |
1740 | Redisplay and center the window, then ask the same question again. | |
1741 | ||
1742 | @item quit | |
1743 | Perform a quit right away. Only @code{y-or-n-p} and related functions | |
1744 | use this answer. | |
1745 | ||
1746 | @item help | |
1747 | Display some help, then ask again. | |
1748 | @end table | |
1749 | ||
2c0b8144 EZ |
1750 | @defvar multi-query-replace-map |
1751 | This variable holds a keymap that extends @code{query-replace-map} by | |
1752 | providing additional keybindings that are useful in multi-buffer | |
1753 | replacements. | |
1754 | @end defvar | |
1755 | ||
80120f13 EZ |
1756 | @defvar replace-search-function |
1757 | This variable specifies a function that @code{perform-replace} calls | |
1758 | to search for the next string to replace. Its default value is | |
1759 | @code{search-forward}. Any other value should name a function of 3 | |
1760 | arguments: the first 3 arguments of @code{search-forward} | |
1761 | (@pxref{String Search}). | |
1762 | @end defvar | |
1763 | ||
1764 | @defvar replace-re-search-function | |
1765 | This variable specifies a function that @code{perform-replace} calls | |
1766 | to search for the next regexp to replace. Its default value is | |
1767 | @code{re-search-forward}. Any other value should name a function of 3 | |
1768 | arguments: the first 3 arguments of @code{re-search-forward} | |
1769 | (@pxref{Regexp Search}). | |
1770 | @end defvar | |
1771 | ||
b8d4c8d0 GM |
1772 | @node Standard Regexps |
1773 | @section Standard Regular Expressions Used in Editing | |
1774 | @cindex regexps used standardly in editing | |
1775 | @cindex standard regexps used in editing | |
1776 | ||
1777 | This section describes some variables that hold regular expressions | |
1778 | used for certain purposes in editing: | |
1779 | ||
01f17ae2 | 1780 | @defopt page-delimiter |
b8d4c8d0 GM |
1781 | This is the regular expression describing line-beginnings that separate |
1782 | pages. The default value is @code{"^\014"} (i.e., @code{"^^L"} or | |
1783 | @code{"^\C-l"}); this matches a line that starts with a formfeed | |
1784 | character. | |
01f17ae2 | 1785 | @end defopt |
b8d4c8d0 GM |
1786 | |
1787 | The following two regular expressions should @emph{not} assume the | |
1788 | match always starts at the beginning of a line; they should not use | |
1789 | @samp{^} to anchor the match. Most often, the paragraph commands do | |
1790 | check for a match only at the beginning of a line, which means that | |
1791 | @samp{^} would be superfluous. When there is a nonzero left margin, | |
1792 | they accept matches that start after the left margin. In that case, a | |
1793 | @samp{^} would be incorrect. However, a @samp{^} is harmless in modes | |
1794 | where a left margin is never used. | |
1795 | ||
01f17ae2 | 1796 | @defopt paragraph-separate |
b8d4c8d0 GM |
1797 | This is the regular expression for recognizing the beginning of a line |
1798 | that separates paragraphs. (If you change this, you may have to | |
1799 | change @code{paragraph-start} also.) The default value is | |
1800 | @w{@code{"[@ \t\f]*$"}}, which matches a line that consists entirely of | |
1801 | spaces, tabs, and form feeds (after its left margin). | |
01f17ae2 | 1802 | @end defopt |
b8d4c8d0 | 1803 | |
01f17ae2 | 1804 | @defopt paragraph-start |
b8d4c8d0 GM |
1805 | This is the regular expression for recognizing the beginning of a line |
1806 | that starts @emph{or} separates paragraphs. The default value is | |
1807 | @w{@code{"\f\\|[ \t]*$"}}, which matches a line containing only | |
1808 | whitespace or starting with a form feed (after its left margin). | |
01f17ae2 | 1809 | @end defopt |
b8d4c8d0 | 1810 | |
01f17ae2 | 1811 | @defopt sentence-end |
b8d4c8d0 GM |
1812 | If non-@code{nil}, the value should be a regular expression describing |
1813 | the end of a sentence, including the whitespace following the | |
1814 | sentence. (All paragraph boundaries also end sentences, regardless.) | |
1815 | ||
1816 | If the value is @code{nil}, the default, then the function | |
1817 | @code{sentence-end} has to construct the regexp. That is why you | |
1818 | should always call the function @code{sentence-end} to obtain the | |
1819 | regexp to be used to recognize the end of a sentence. | |
01f17ae2 | 1820 | @end defopt |
b8d4c8d0 GM |
1821 | |
1822 | @defun sentence-end | |
1823 | This function returns the value of the variable @code{sentence-end}, | |
1824 | if non-@code{nil}. Otherwise it returns a default value based on the | |
1825 | values of the variables @code{sentence-end-double-space} | |
1826 | (@pxref{Definition of sentence-end-double-space}), | |
1827 | @code{sentence-end-without-period} and | |
1828 | @code{sentence-end-without-space}. | |
1829 | @end defun | |
1830 | ||
1831 | @ignore | |
1832 | arch-tag: c2573ca2-18aa-4839-93b8-924043ef831f | |
1833 | @end ignore |