Fill the completion-table-with-predicate doc string

* lisp/minibuffer.el (completion-table-with-predicate): Fill
the doc string (bug#20460).

(cherry picked from commit 207a31432c1ed8b548003a3e4af32c49aa3441e9)

diff --git a/lisp/minibuffer.el b/lisp/minibuffer.el
index 6540059b965a6f58aa660ab444e19736859a9659..714ca851eb051c81f8ba86f25b732f4814ff2cd3 100644 (file)
--- a/lisp/minibuffer.el
+++ b/lisp/minibuffer.el
@@ -369,13 +369,15 @@ instead of a string, a function that takes the completion and returns the
 
 (defun completion-table-with-predicate (table pred1 strict string pred2 action)
   "Make a completion table equivalent to TABLE but filtered through PRED1.
-PRED1 is a function of one argument which returns non-nil if and only if the
-argument is an element of TABLE which should be considered for completion.
-STRING, PRED2, and ACTION are the usual arguments to completion tables,
-as described in `try-completion', `all-completions', and `test-completion'.
-If STRICT is t, the predicate always applies; if nil it only applies if
-it does not reduce the set of possible completions to nothing.
-Note: TABLE needs to be a proper completion table which obeys predicates."
+PRED1 is a function of one argument which returns non-nil if and
+only if the argument is an element of TABLE which should be
+considered for completion.  STRING, PRED2, and ACTION are the
+usual arguments to completion tables, as described in
+`try-completion', `all-completions', and `test-completion'.  If
+STRICT is t, the predicate always applies; if nil it only applies
+if it does not reduce the set of possible completions to nothing.
+Note: TABLE needs to be a proper completion table which obeys
+predicates."
   (cond
    ((and (not strict) (eq action 'lambda))
     ;; Ignore pred1 since it doesn't really have to apply anyway.