aboutsummaryrefslogtreecommitdiffstats
path: root/lisp/textmodes
diff options
context:
space:
mode:
authorRoland Winkler2013-04-13 15:41:52 -0500
committerRoland Winkler2013-04-13 15:41:52 -0500
commit6646e848210529fc797adeb8230ce77369824909 (patch)
tree308e02d15b38e29a6d26b0352a34d561bb6cba6d /lisp/textmodes
parent23a0e159ee303e0b3cd00483a0e2c3b1649d8642 (diff)
downloademacs-6646e848210529fc797adeb8230ce77369824909.tar.gz
emacs-6646e848210529fc797adeb8230ce77369824909.zip
lisp/textmodes/bibtex.el (bibtex-url): Doc fix
Diffstat (limited to 'lisp/textmodes')
-rw-r--r--lisp/textmodes/bibtex.el3
1 files changed, 3 insertions, 0 deletions
diff --git a/lisp/textmodes/bibtex.el b/lisp/textmodes/bibtex.el
index 669a33bff73..1daa0186bdb 100644
--- a/lisp/textmodes/bibtex.el
+++ b/lisp/textmodes/bibtex.el
@@ -5168,6 +5168,9 @@ Return the URL or nil if none can be generated."
5168 (if (stringp (car scheme)) 5168 (if (stringp (car scheme))
5169 (setq fmt (pop scheme))) 5169 (setq fmt (pop scheme)))
5170 (dolist (step scheme) 5170 (dolist (step scheme)
5171 ;; In the first STEP, if the field contains multiple
5172 ;; matches, we want the match the closest to point.
5173 ;; (if (eq step (car scheme))
5171 (setq text (cdr (assoc-string (car step) fields-alist t))) 5174 (setq text (cdr (assoc-string (car step) fields-alist t)))
5172 (if (string-match (nth 1 step) text) 5175 (if (string-match (nth 1 step) text)
5173 (push (cond ((functionp (nth 2 step)) 5176 (push (cond ((functionp (nth 2 step))