# HG changeset patch
# User Stefan Monnier <monnier@iro.umontreal.ca>
# Date 1287341998 14400
# Node ID 2e8109ba205db495059abd534c30f22af8b8ab13
# Parent  41b4a4c75ab953753a1a4390dc967ebf68ab52f6
(regexp-opt-group, regexp-opt-charset): Turn comments into docstrings

diff -r 41b4a4c75ab9 -r 2e8109ba205d lisp/emacs-lisp/regexp-opt.el
--- a/lisp/emacs-lisp/regexp-opt.el	Sun Oct 17 13:30:22 2010 -0400
+++ b/lisp/emacs-lisp/regexp-opt.el	Sun Oct 17 14:59:58 2010 -0400
@@ -136,11 +136,10 @@
   (require 'cl))
 
 (defun regexp-opt-group (strings &optional paren lax)
-  ;; Return a regexp to match a string in the sorted list STRINGS.
-  ;; If PAREN non-nil, output regexp parentheses around returned regexp.
-  ;; If LAX non-nil, don't output parentheses if it doesn't require them.
-  ;; Merges keywords to avoid backtracking in Emacs' regexp matcher.
-
+  "Return a regexp to match a string in the sorted list STRINGS.
+If PAREN non-nil, output regexp parentheses around returned regexp.
+If LAX non-nil, don't output parentheses if it doesn't require them.
+Merges keywords to avoid backtracking in Emacs' regexp matcher."
   ;; The basic idea is to find the shortest common prefix or suffix, remove it
   ;; and recurse.  If there is no prefix, we divide the list into two so that
   ;; \(at least) one half will have at least a one-character common prefix.
@@ -234,9 +233,7 @@
 
 
 (defun regexp-opt-charset (chars)
-  ;;
-  ;; Return a regexp to match a character in CHARS.
-  ;;
+  "Return a regexp to match a character in CHARS."
   ;; The basic idea is to find character ranges.  Also we take care in the
   ;; position of character set meta characters in the character set regexp.
   ;;