comparison lisp/textmodes/bibtex.el @ 13968:cc71d8efd948

(bibtex-generate-autokey, bibtex-find-entry-location): Doc fix.
author Karl Heuer <kwzh@gnu.org>
date Thu, 04 Jan 1996 23:27:50 +0000
parents 4b7903cfa7ee
children 83f275dcd93a
comparison
equal deleted inserted replaced
13967:8058d6f606de 13968:cc71d8efd948
967 7. For the title part of the key change the contents of the \"title\" 967 7. For the title part of the key change the contents of the \"title\"
968 field of the reference according to 968 field of the reference according to
969 `bibtex-autokey-titleword-change-strings' to the corresponding 969 `bibtex-autokey-titleword-change-strings' to the corresponding
970 new one (see documentation of this variable for further detail). 970 new one (see documentation of this variable for further detail).
971 8. Abbreviate the result to the string up to (but not including) the 971 8. Abbreviate the result to the string up to (but not including) the
972 first occurence of a regexp matched by the items of 972 first occurrence of a regexp matched by the items of
973 `bibtex-autokey-title-terminators' and delete the first 973 `bibtex-autokey-title-terminators' and delete the first
974 word if it appears in `bibtex-autokey-titleword-first-ignore'. 974 word if it appears in `bibtex-autokey-titleword-first-ignore'.
975 Build the title part of the key by using at least the first 975 Build the title part of the key by using at least the first
976 `bibtex-autokey-titlewords' capitalized words from this 976 `bibtex-autokey-titlewords' capitalized words from this
977 abbreviated title. If the abbreviated title ends after maximal 977 abbreviated title. If the abbreviated title ends after maximal
1628 (defun bibtex-find-entry-location (entry-name &optional ignore-dups) 1628 (defun bibtex-find-entry-location (entry-name &optional ignore-dups)
1629 "Looking for place to put the BibTeX entry named ENTRY-NAME. 1629 "Looking for place to put the BibTeX entry named ENTRY-NAME.
1630 Performs a binary search (therefore, buffer is assumed to be in sorted 1630 Performs a binary search (therefore, buffer is assumed to be in sorted
1631 order, without duplicates (see \\[bibtex-validate-buffer]), if it is 1631 order, without duplicates (see \\[bibtex-validate-buffer]), if it is
1632 not, bibtex-find-entry-location will fail). If entry-name is already 1632 not, bibtex-find-entry-location will fail). If entry-name is already
1633 used as a reference key, an error is signalled. However, if optional 1633 used as a reference key, an error is signaled. However, if optional
1634 variable IGNORE-DUPS is non-nil, no error messages about duplicate 1634 variable IGNORE-DUPS is non-nil, no error messages about duplicate
1635 entries are signalled, but the error handling is assumed to be made in 1635 entries are signaled, but the error handling is assumed to be made in
1636 the calling function. Nil is returned, if an duplicate entry error 1636 the calling function. Nil is returned, if an duplicate entry error
1637 occured, and t in all other cases." 1637 occurred, and t in all other cases."
1638 (let* ((left 1638 (let* ((left
1639 (progn 1639 (progn
1640 (beginning-of-first-bibtex-entry) 1640 (beginning-of-first-bibtex-entry)
1641 (if bibtex-sort-ignore-string-entries 1641 (if bibtex-sort-ignore-string-entries
1642 (re-search-forward bibtex-reference nil `move) 1642 (re-search-forward bibtex-reference nil `move)