From 140a6b7efd5210aa629adeb8708d57ae11e71375 Mon Sep 17 00:00:00 2001 From: "Kim F. Storm" Date: Thu, 13 Feb 2003 10:33:49 +0000 Subject: [PATCH] (Fmatch_data): Doc fix. Explicitly state that match-data is undefined if last search failed. --- src/ChangeLog | 3 +++ src/search.c | 4 +++- 2 files changed, 6 insertions(+), 1 deletion(-) diff --git a/src/ChangeLog b/src/ChangeLog index f5933c00a8e..d849ecb49e3 100644 --- a/src/ChangeLog +++ b/src/ChangeLog @@ -1,5 +1,8 @@ 2003-02-13 Kim F. Storm + * search.c (Fmatch_data): Doc fix. Explicitly state that + match-data is undefined if last search failed. + * keymap.c (Fcommand_remapping): Renamed from Fremap_command. All uses changed. diff --git a/src/search.c b/src/search.c index a9544a2db39..0170838b599 100644 --- a/src/search.c +++ b/src/search.c @@ -2651,7 +2651,9 @@ Use `store-match-data' to reinstate the data in this list. If INTEGERS (the optional first argument) is non-nil, always use integers \(rather than markers) to represent buffer positions. If REUSE is a list, reuse it as part of the value. If REUSE is long enough -to hold all the values, and if INTEGERS is non-nil, no consing is done. */) +to hold all the values, and if INTEGERS is non-nil, no consing is done. + +Return value is undefined if the last search failed. */) (integers, reuse) Lisp_Object integers, reuse; { -- 2.39.2