aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--doc/lispref/ChangeLog4
-rw-r--r--doc/lispref/searching.texi48
2 files changed, 34 insertions, 18 deletions
diff --git a/doc/lispref/ChangeLog b/doc/lispref/ChangeLog
index 5b568b627c4..9b1fdf124d2 100644
--- a/doc/lispref/ChangeLog
+++ b/doc/lispref/ChangeLog
@@ -1,5 +1,9 @@
12009-04-10 Chong Yidong <cyd@stupidchicken.com> 12009-04-10 Chong Yidong <cyd@stupidchicken.com>
2 2
3 * searching.texi (String Search): Document word-search-forward-lax
4 and word-search-backward-lax.
5 (Searching and Case): Describe isearch behavior more precisely.
6
3 * keymaps.texi (Tool Bar): Mention that some platforms do not 7 * keymaps.texi (Tool Bar): Mention that some platforms do not
4 support multi-line toolbars. Suggested by Stephen Eglen. 8 support multi-line toolbars. Suggested by Stephen Eglen.
5 9
diff --git a/doc/lispref/searching.texi b/doc/lispref/searching.texi
index eea165d1c1f..bc223f8ac3f 100644
--- a/doc/lispref/searching.texi
+++ b/doc/lispref/searching.texi
@@ -106,11 +106,9 @@ leaves point at the beginning of the match.
106@end deffn 106@end deffn
107 107
108@deffn Command word-search-forward string &optional limit noerror repeat 108@deffn Command word-search-forward string &optional limit noerror repeat
109@c @cindex word search Redundant
110This function searches forward from point for a ``word'' match for 109This 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 110@var{string}. If it finds a match, it sets point to the end of the
112match found, and returns the new value of point. 111match found, and returns the new value of point.
113@c Emacs 19 feature
114 112
115Word matching regards @var{string} as a sequence of words, disregarding 113Word matching regards @var{string} as a sequence of words, disregarding
116punctuation that separates them. It searches the buffer for the same 114punctuation that separates them. It searches the buffer for the same
@@ -155,6 +153,13 @@ If @var{repeat} is non-@code{nil}, then the search is repeated that many
155times. Point is positioned at the end of the last match. 153times. Point is positioned at the end of the last match.
156@end deffn 154@end deffn
157 155
156@deffn Command word-search-forward-lax string &optional limit noerror repeat
157This command is identical to @code{word-search-forward}, except that
158the end of @code{string} need not match a word boundary unless it ends
159in whitespace. For instance, searching for @samp{ball boy} matches
160@samp{ball boyee}, but does not match @samp{aball boy}.
161@end deffn
162
158@deffn Command word-search-backward string &optional limit noerror repeat 163@deffn Command word-search-backward string &optional limit noerror repeat
159This function searches backward from point for a word match to 164This function searches backward from point for a word match to
160@var{string}. This function is just like @code{word-search-forward} 165@var{string}. This function is just like @code{word-search-forward}
@@ -162,6 +167,12 @@ except that it searches backward and normally leaves point at the
162beginning of the match. 167beginning of the match.
163@end deffn 168@end deffn
164 169
170@deffn Command word-search-backward-lax string &optional limit noerror repeat
171This command is identical to @code{word-search-backward}, except that
172the end of @code{string} need not match a word boundary unless it ends
173in whitespace.
174@end deffn
175
165@node Searching and Case 176@node Searching and Case
166@section Searching and Case 177@section Searching and Case
167@cindex searching and case 178@cindex searching and case
@@ -181,21 +192,11 @@ Buffer-Local}.) Alternatively, you may change the value of
181@code{case-fold-search} for buffers that do not override it. 192@code{case-fold-search} for buffers that do not override it.
182 193
183 Note that the user-level incremental search feature handles case 194 Note that the user-level incremental search feature handles case
184distinctions differently. When given a lower case letter, it looks for 195distinctions differently. When the search string contains only lower
185a match of either case, but when given an upper case letter, it looks 196case letters, the search ignores case, but when the search string
186for an upper case letter only. But this has nothing to do with the 197contains one or more upper case letters, the search becomes
187searching functions used in Lisp code. 198case-sensitive. But this has nothing to do with the searching
188 199functions used in Lisp code.
189@defopt case-replace
190This variable determines whether the higher level replacement
191functions should preserve case. If the variable is @code{nil}, that
192means to use the replacement text verbatim. A non-@code{nil} value
193means to convert the case of the replacement text according to the
194text being replaced.
195
196This variable is used by passing it as an argument to the function
197@code{replace-match}. @xref{Replacing Match}.
198@end defopt
199 200
200@defopt case-fold-search 201@defopt case-fold-search
201This buffer-local variable determines whether searches should ignore 202This buffer-local variable determines whether searches should ignore
@@ -209,12 +210,23 @@ The value of this variable is the default value for
209same as @code{(default-value 'case-fold-search)}. 210same as @code{(default-value 'case-fold-search)}.
210@end defvar 211@end defvar
211 212
213@defopt case-replace
214This variable determines whether the higher level replacement
215functions should preserve case. If the variable is @code{nil}, that
216means to use the replacement text verbatim. A non-@code{nil} value
217means to convert the case of the replacement text according to the
218text being replaced.
219
220This variable is used by passing it as an argument to the function
221@code{replace-match}. @xref{Replacing Match}.
222@end defopt
223
212@node Regular Expressions 224@node Regular Expressions
213@section Regular Expressions 225@section Regular Expressions
214@cindex regular expression 226@cindex regular expression
215@cindex regexp 227@cindex regexp
216 228
217 A @dfn{regular expression} (@dfn{regexp}, for short) is a pattern that 229 A @dfn{regular expression}, or @dfn{regexp} for short, is a pattern that
218denotes a (possibly infinite) set of strings. Searching for matches for 230denotes a (possibly infinite) set of strings. Searching for matches for
219a regexp is a very powerful operation. This section explains how to write 231a regexp is a very powerful operation. This section explains how to write
220regexps; the following section says how to search for them. 232regexps; the following section says how to search for them.