summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorNicolas Goaziou <mail@nicolasgoaziou.fr>2021-04-19 14:34:43 +0200
committerNicolas Goaziou <mail@nicolasgoaziou.fr>2021-04-19 14:34:43 +0200
commitf918ba1094c8a12c1e75f09525ed7651b8c36b58 (patch)
tree58a720445fb0bd5166babf69238909bbe241ee1e
parentedadbb8bab0f04a19618fa13dbaf6980ed57d248 (diff)
parenta89d96e6a5bb519c5bc03ef0f984e89de940f8b3 (diff)
downloadorg-mode-f918ba1094c8a12c1e75f09525ed7651b8c36b58.tar.gz
Merge branch 'maint'
-rw-r--r--lisp/ox-texinfo.el12
1 files changed, 7 insertions, 5 deletions
diff --git a/lisp/ox-texinfo.el b/lisp/ox-texinfo.el
index 5531653..27bcfaa 100644
--- a/lisp/ox-texinfo.el
+++ b/lisp/ox-texinfo.el
@@ -489,16 +489,18 @@ node or anchor name is unique."
;; Org exports deeper elements before their parents. If two
;; node names collide -- e.g., they have the same title --
;; within the same hierarchy, the second one would get the
- ;; shorter node name. This is counter-intuitive.
- ;; Consequently, we ensure that every parent headline get
- ;; its node beforehand. As a recursive operation, this
+ ;; smaller node name. This is counter-intuitive.
+ ;; Consequently, we ensure that every parent headline gets
+ ;; its node beforehand. As a recursive operation, this
;; achieves the desired effect.
(let ((parent (org-element-lineage datum '(headline))))
(when (and parent (not (assq parent cache)))
(org-texinfo--get-node parent info)
(setq cache (plist-get info :texinfo-node-cache))))
- ;; Ensure NAME is unique and not reserved node name "Top".
- (while (or (equal name "Top") (rassoc name cache))
+ ;; Ensure NAME is unique and not reserved node name "Top",
+ ;; no matter what case is used.
+ (while (or (string-equal "Top" (capitalize name))
+ (rassoc name cache))
(setq name (concat basename (format " (%d)" (cl-incf salt)))))
(plist-put info :texinfo-node-cache (cons (cons datum name) cache))
name))))