3 * This file is part of LyX, the document processor.
4 * Licence details can be found in the file COPYING.
6 * \author Angus Leeming
11 * Full author contact details are available in file CREDITS.
16 #include "BiblioInfo.h"
18 #include "BufferParams.h"
19 #include "buffer_funcs.h"
21 #include "InsetIterator.h"
23 #include "output_xhtml.h"
24 #include "Paragraph.h"
25 #include "TextClass.h"
26 #include "TocBackend.h"
28 #include "support/convert.h"
29 #include "support/debug.h"
30 #include "support/docstream.h"
31 #include "support/gettext.h"
32 #include "support/lassert.h"
33 #include "support/lstrings.h"
34 #include "support/regex.h"
35 #include "support/textutils.h"
40 using namespace lyx::support;
47 // gets the "family name" from an author-type string
48 docstring familyName(docstring const & name)
53 // first we look for a comma, and take the last name to be everything
54 // preceding the right-most one, so that we also get the "jr" part.
55 docstring::size_type idx = name.rfind(',');
56 if (idx != docstring::npos)
57 return ltrim(name.substr(0, idx));
59 // OK, so now we want to look for the last name. We're going to
60 // include the "von" part. This isn't perfect.
61 // Split on spaces, to get various tokens.
62 vector<docstring> pieces = getVectorFromString(name, from_ascii(" "));
63 // If we only get two, assume the last one is the last name
64 if (pieces.size() <= 2)
67 // Now we look for the first token that begins with a lower case letter.
68 vector<docstring>::const_iterator it = pieces.begin();
69 vector<docstring>::const_iterator en = pieces.end();
70 for (; it != en; ++it) {
73 char_type const c = (*it)[0];
78 if (it == en) // we never found a "von"
81 // reconstruct what we need to return
84 for (; it != en; ++it) {
95 // converts a string containing LaTeX commands into unicode
97 docstring convertLaTeXCommands(docstring const & str)
102 bool scanning_cmd = false;
103 bool scanning_math = false;
104 bool escaped = false; // used to catch \$, etc.
105 while (!val.empty()) {
106 char_type const ch = val[0];
108 // if we're scanning math, we output everything until we
109 // find an unescaped $, at which point we break out.
116 scanning_math = false;
122 // if we're scanning a command name, then we just
123 // discard characters until we hit something that
126 if (isAlphaASCII(ch)) {
131 // so we're done with this command.
132 // now we fall through and check this character.
133 scanning_cmd = false;
136 // was the last character a \? If so, then this is something like:
137 // \\ or \$, so we'll just output it. That's probably not always right...
139 // exception: output \, as THIN SPACE
141 ret.push_back(0x2009);
152 scanning_math = true;
156 // we just ignore braces
157 if (ch == '{' || ch == '}') {
162 // we're going to check things that look like commands, so if
163 // this doesn't, just output it.
170 // ok, could be a command of some sort
171 // let's see if it corresponds to some unicode
172 // unicodesymbols has things in the form: \"{u},
173 // whereas we may see things like: \"u. So we'll
174 // look for that and change it, if necessary.
175 // FIXME: This is a sort of mini-tex2lyx.
176 // Use the real tex2lyx instead!
177 static lyx::regex const reg("^\\\\\\W\\w");
178 if (lyx::regex_search(to_utf8(val), reg)) {
179 val.insert(3, from_ascii("}"));
180 val.insert(2, from_ascii("{"));
184 docstring const cnvtd = Encodings::fromLaTeXCommand(val,
185 Encodings::TEXT_CMD, termination, rem);
186 if (!cnvtd.empty()) {
187 // it did, so we'll take that bit and proceed with what's left
192 // it's a command of some sort
201 // Escape '<' and '>' and remove richtext markers (e.g. {!this is richtext!}) from a string.
202 docstring processRichtext(docstring const & str, bool richtext)
207 bool scanning_rich = false;
208 while (!val.empty()) {
209 char_type const ch = val[0];
210 if (ch == '{' && val.size() > 1 && val[1] == '!') {
211 // beginning of rich text
212 scanning_rich = true;
216 if (scanning_rich && ch == '!' && val.size() > 1 && val[1] == '}') {
218 scanning_rich = false;
226 // we need to escape '<' and '>'
234 } else if (!scanning_rich /* && !richtext */)
236 // else the character is discarded, which will happen only if
237 // richtext == false and we are scanning rich text
246 //////////////////////////////////////////////////////////////////////
250 //////////////////////////////////////////////////////////////////////
252 BibTeXInfo::BibTeXInfo(docstring const & key, docstring const & type)
253 : is_bibtex_(true), bib_key_(key), entry_type_(type), info_(),
258 docstring const BibTeXInfo::getAbbreviatedAuthor(bool jurabib_style) const
261 docstring const opt = label();
266 docstring const remainder = trim(split(opt, authors, '('));
267 if (remainder.empty())
268 // in this case, we didn't find a "(",
269 // so we don't have author (year)
274 docstring author = operator[]("author");
275 if (author.empty()) {
276 author = operator[]("editor");
281 // FIXME Move this to a separate routine that can
282 // be called from elsewhere.
284 // OK, we've got some names. Let's format them.
285 // Try to split the author list on " and "
286 vector<docstring> const authors =
287 getVectorFromString(author, from_ascii(" and "));
289 if (jurabib_style && (authors.size() == 2 || authors.size() == 3)) {
290 docstring shortauthor = familyName(authors[0])
291 + "/" + familyName(authors[1]);
292 if (authors.size() == 3)
293 shortauthor += "/" + familyName(authors[2]);
294 return convertLaTeXCommands(shortauthor);
297 docstring retval = familyName(authors[0]);
299 if (authors.size() == 2 && authors[1] != "others")
300 retval = bformat(from_ascii("%1$s and %2$s"),
301 familyName(authors[0]), familyName(authors[1]));
303 if (authors.size() >= 2)
304 retval = bformat(from_ascii("%1$s et al."),
305 familyName(authors[0]));
307 return convertLaTeXCommands(retval);
311 docstring const BibTeXInfo::getAbbreviatedAuthor(Buffer const & buf, bool jurabib_style) const
313 docstring const author = getAbbreviatedAuthor(jurabib_style);
316 vector<docstring> const authors = getVectorFromString(author, from_ascii(" and "));
317 if (authors.size() == 2)
318 return bformat(buf.B_("%1$s and %2$s"), authors[0], authors[1]);
319 docstring::size_type const idx = author.rfind(from_ascii(" et al."));
320 if (idx != docstring::npos)
321 return bformat(buf.B_("%1$s et al."), author.substr(0, idx));
326 docstring const BibTeXInfo::getYear() const
329 return operator[]("year");
331 docstring const opt = label();
336 docstring tmp = split(opt, authors, '(');
338 // we don't have author (year)
341 tmp = split(tmp, year, ')');
346 docstring const BibTeXInfo::getXRef() const
350 return operator[]("crossref");
356 docstring parseOptions(docstring const & format, string & optkey,
357 docstring & ifpart, docstring & elsepart);
359 // Calls parseOptions to deal with an embedded option, such as:
360 // {%number%[[, no.~%number%]]}
361 // which must appear at the start of format. ifelsepart gets the
362 // whole of the option, and we return what's left after the option.
363 // we return format if there is an error.
364 docstring parseEmbeddedOption(docstring const & format, docstring & ifelsepart)
366 LASSERT(format[0] == '{' && format[1] == '%', return format);
370 docstring const rest = parseOptions(format, optkey, ifpart, elsepart);
371 if (format == rest) { // parse error
372 LYXERR0("ERROR! Couldn't parse `" << format <<"'.");
375 LASSERT(rest.size() <= format.size(),
376 { ifelsepart = docstring(); return format; });
377 ifelsepart = format.substr(0, format.size() - rest.size());
382 // Gets a "clause" from a format string, where the clause is
383 // delimited by '[[' and ']]'. Returns what is left after the
384 // clause is removed, and returns format if there is an error.
385 docstring getClause(docstring const & format, docstring & clause)
387 docstring fmt = format;
390 // we'll remove characters from the front of fmt as we
392 while (!fmt.empty()) {
393 if (fmt[0] == ']' && fmt.size() > 1 && fmt[1] == ']') {
398 // check for an embedded option
399 if (fmt[0] == '{' && fmt.size() > 1 && fmt[1] == '%') {
401 docstring const rest = parseEmbeddedOption(fmt, part);
403 LYXERR0("ERROR! Couldn't parse embedded option in `" << format <<"'.");
408 } else { // it's just a normal character
417 // parse an options string, which must appear at the start of the
418 // format parameter. puts the parsed bits in optkey, ifpart, and
419 // elsepart and returns what's left after the option is removed.
420 // if there's an error, it returns format itself.
421 docstring parseOptions(docstring const & format, string & optkey,
422 docstring & ifpart, docstring & elsepart)
424 LASSERT(format[0] == '{' && format[1] == '%', return format);
426 docstring fmt = format.substr(2);
427 size_t pos = fmt.find('%'); // end of key
428 if (pos == string::npos) {
429 LYXERR0("Error parsing `" << format <<"'. Can't find end of key.");
432 optkey = to_utf8(fmt.substr(0, pos));
433 fmt = fmt.substr(pos + 1);
434 // [[format]] should be next
435 if (fmt[0] != '[' || fmt[1] != '[') {
436 LYXERR0("Error parsing `" << format <<"'. Can't find '[[' after key.");
440 docstring curfmt = fmt;
441 fmt = getClause(curfmt, ifpart);
443 LYXERR0("Error parsing `" << format <<"'. Couldn't get if clause.");
447 if (fmt[0] == '}') // we're done, no else clause
448 return fmt.substr(1);
450 // else part should follow
451 if (fmt[0] != '[' || fmt[1] != '[') {
452 LYXERR0("Error parsing `" << format <<"'. Can't find else clause.");
457 fmt = getClause(curfmt, elsepart);
459 if (fmt == curfmt || fmt[0] != '}') {
460 LYXERR0("Error parsing `" << format <<"'. Can't find end of option.");
463 return fmt.substr(1);
470 docstring BibTeXInfo::expandFormat(docstring const & format,
471 BibTeXInfo const * const xref, int & counter, Buffer const & buf,
472 docstring before, docstring after, docstring dialog, bool next) const
474 // incorrect use of macros could put us in an infinite loop
475 static int const max_passes = 5000;
476 // the use of overly large keys can lead to performance problems, due
477 // to eventual attempts to convert LaTeX macros to unicode. See bug
478 // #8944. This is perhaps not the best solution, but it will have to
480 static size_t const max_keysize = 128;
481 odocstringstream ret; // return value
483 bool scanning_key = false;
484 bool scanning_rich = false;
486 CiteEngineType const engine_type = buf.params().citeEngineType();
487 docstring fmt = format;
488 // we'll remove characters from the front of fmt as we
490 while (!fmt.empty()) {
491 if (counter++ > max_passes) {
492 LYXERR0("Recursion limit reached while parsing `"
497 char_type thischar = fmt[0];
498 if (thischar == '%') {
499 // beginning or end of key
502 scanning_key = false;
503 // so we replace the key with its value, which may be empty
507 buf.params().documentClass().getCiteMacro(engine_type, key);
508 fmt = from_utf8(val) + fmt.substr(1);
510 } else if (key[0] == '_') {
511 // a translatable bit
513 buf.params().documentClass().getCiteMacro(engine_type, key);
514 docstring const trans =
515 translateIfPossible(from_utf8(val), buf.params().language->code());
518 docstring const val =
519 getValueForKey(key, buf, before, after, dialog, xref, max_keysize);
521 ret << from_ascii("{!<span class=\"bib-" + key + "\">!}");
524 ret << from_ascii("{!</span>!}");
532 else if (thischar == '{') {
533 // beginning of option?
535 LYXERR0("ERROR: Found `{' when scanning key in `" << format << "'.");
538 if (fmt.size() > 1) {
540 // it is the beginning of an optional format
544 docstring const newfmt =
545 parseOptions(fmt, optkey, ifpart, elsepart);
546 if (newfmt == fmt) // parse error
549 docstring const val =
550 getValueForKey(optkey, buf, before, after, dialog, xref);
551 if (optkey == "next" && next)
552 ret << ifpart; // without expansion
553 else if (!val.empty())
554 ret << expandFormat(ifpart, xref, counter, buf,
555 before, after, dialog, next);
556 else if (!elsepart.empty())
557 ret << expandFormat(elsepart, xref, counter, buf,
558 before, after, dialog, next);
559 // fmt will have been shortened for us already
563 // beginning of rich text
564 scanning_rich = true;
566 ret << from_ascii("{!");
570 // we are here if '{' was not followed by % or !.
571 // So it's just a character.
574 else if (scanning_rich && thischar == '!'
575 && fmt.size() > 1 && fmt[1] == '}') {
577 scanning_rich = false;
579 ret << from_ascii("!}");
582 else if (scanning_key)
583 key += char(thischar);
587 } catch (EncodingException & /* e */) {
588 LYXERR0("Uncodable character '" << docstring(1, thischar) << " in citation label!");
594 LYXERR0("Never found end of key in `" << format << "'!");
598 LYXERR0("Never found end of rich text in `" << format << "'!");
605 docstring const & BibTeXInfo::getInfo(BibTeXInfo const * const xref,
606 Buffer const & buf, bool richtext) const
608 if (!richtext && !info_.empty())
610 if (richtext && !info_richtext_.empty())
611 return info_richtext_;
614 BibTeXInfo::const_iterator it = find(from_ascii("ref"));
619 CiteEngineType const engine_type = buf.params().citeEngineType();
620 DocumentClass const & dc = buf.params().documentClass();
621 docstring const & format =
622 from_utf8(dc.getCiteFormat(engine_type, to_utf8(entry_type_)));
624 info_ = expandFormat(format, xref, counter, buf,
625 docstring(), docstring(), docstring(), false);
628 // this probably shouldn't happen
633 info_richtext_ = convertLaTeXCommands(processRichtext(info_, true));
634 return info_richtext_;
637 info_ = convertLaTeXCommands(processRichtext(info_, false));
642 docstring const BibTeXInfo::getLabel(BibTeXInfo const * const xref,
643 Buffer const & buf, docstring const & format, bool richtext,
644 docstring before, docstring after, docstring dialog, bool next) const
649 loclabel = expandFormat(format, xref, counter, buf,
650 before, after, dialog, next);
652 if (!loclabel.empty() && !next) {
653 loclabel = processRichtext(loclabel, richtext);
654 loclabel = convertLaTeXCommands(loclabel);
661 docstring const & BibTeXInfo::operator[](docstring const & field) const
663 BibTeXInfo::const_iterator it = find(field);
666 static docstring const empty_value = docstring();
671 docstring const & BibTeXInfo::operator[](string const & field) const
673 return operator[](from_ascii(field));
677 docstring BibTeXInfo::getValueForKey(string const & oldkey, Buffer const & buf,
678 docstring const & before, docstring const & after, docstring const & dialog,
679 BibTeXInfo const * const xref, size_t maxsize) const
681 // anything less is pointless
682 LASSERT(maxsize >= 16, maxsize = 16);
684 bool cleanit = false;
685 if (prefixIs(oldkey, "clean:")) {
686 key = oldkey.substr(6);
690 docstring ret = operator[](key);
691 if (ret.empty() && xref)
695 // FIXME: dialog, textbefore and textafter have nothing to do with this
698 else if (key == "entrytype")
700 else if (key == "key")
702 else if (key == "label")
704 else if (key == "modifier" && modifier_ != 0)
706 else if (key == "numericallabel")
708 else if (key == "abbrvauthor")
709 // Special key to provide abbreviated author names.
710 ret = getAbbreviatedAuthor(buf, false);
711 else if (key == "shortauthor")
712 // When shortauthor is not defined, jurabib automatically
713 // provides jurabib-style abbreviated author names. We do
715 ret = getAbbreviatedAuthor(buf, true);
716 else if (key == "shorttitle") {
717 // When shorttitle is not defined, jurabib uses for `article'
718 // and `periodical' entries the form `journal volume [year]'
719 // and for other types of entries it uses the `title' field.
720 if (entry_type_ == "article" || entry_type_ == "periodical")
721 ret = operator[]("journal") + " " + operator[]("volume")
722 + " [" + operator[]("year") + "]";
724 ret = operator[]("title");
725 } else if (key == "bibentry") {
726 // Special key to provide the full bibliography entry: see getInfo()
727 CiteEngineType const engine_type = buf.params().citeEngineType();
728 DocumentClass const & dc = buf.params().documentClass();
729 docstring const & format =
730 from_utf8(dc.getCiteFormat(engine_type, to_utf8(entry_type_)));
732 ret = expandFormat(format, xref, counter, buf,
733 docstring(), docstring(), docstring(), false);
734 } else if (key == "textbefore")
736 else if (key == "textafter")
738 else if (key == "year")
743 ret = html::cleanAttr(ret);
745 // make sure it is not too big
746 if (ret.size() > maxsize)
747 ret = ret.substr(0, maxsize - 3) + from_ascii("...");
752 //////////////////////////////////////////////////////////////////////
756 //////////////////////////////////////////////////////////////////////
760 // A functor for use with sort, leading to case insensitive sorting
761 class compareNoCase: public binary_function<docstring, docstring, bool>
764 bool operator()(docstring const & s1, docstring const & s2) const {
765 return compare_no_case(s1, s2) < 0;
772 vector<docstring> const BiblioInfo::getKeys() const
774 vector<docstring> bibkeys;
775 BiblioInfo::const_iterator it = begin();
776 for (; it != end(); ++it)
777 bibkeys.push_back(it->first);
778 sort(bibkeys.begin(), bibkeys.end(), compareNoCase());
783 vector<docstring> const BiblioInfo::getFields() const
785 vector<docstring> bibfields;
786 set<docstring>::const_iterator it = field_names_.begin();
787 set<docstring>::const_iterator end = field_names_.end();
788 for (; it != end; ++it)
789 bibfields.push_back(*it);
790 sort(bibfields.begin(), bibfields.end());
795 vector<docstring> const BiblioInfo::getEntries() const
797 vector<docstring> bibentries;
798 set<docstring>::const_iterator it = entry_types_.begin();
799 set<docstring>::const_iterator end = entry_types_.end();
800 for (; it != end; ++it)
801 bibentries.push_back(*it);
802 sort(bibentries.begin(), bibentries.end());
807 docstring const BiblioInfo::getAbbreviatedAuthor(docstring const & key, Buffer const & buf) const
809 BiblioInfo::const_iterator it = find(key);
812 BibTeXInfo const & data = it->second;
813 return data.getAbbreviatedAuthor(buf, false);
817 docstring const BiblioInfo::getCiteNumber(docstring const & key) const
819 BiblioInfo::const_iterator it = find(key);
822 BibTeXInfo const & data = it->second;
823 return data.citeNumber();
827 docstring const BiblioInfo::getYear(docstring const & key, bool use_modifier) const
829 BiblioInfo::const_iterator it = find(key);
832 BibTeXInfo const & data = it->second;
833 docstring year = data.getYear();
835 // let's try the crossref
836 docstring const xref = data.getXRef();
840 BiblioInfo::const_iterator const xrefit = find(xref);
844 BibTeXInfo const & xref_data = xrefit->second;
845 year = xref_data.getYear();
847 if (use_modifier && data.modifier() != 0)
848 year += data.modifier();
853 docstring const BiblioInfo::getYear(docstring const & key, Buffer const & buf, bool use_modifier) const
855 docstring const year = getYear(key, use_modifier);
857 return buf.B_("No year");
862 docstring const BiblioInfo::getInfo(docstring const & key,
863 Buffer const & buf, bool richtext) const
865 BiblioInfo::const_iterator it = find(key);
867 return docstring(_("Bibliography entry not found!"));
868 BibTeXInfo const & data = it->second;
869 BibTeXInfo const * xrefptr = 0;
870 docstring const xref = data.getXRef();
872 BiblioInfo::const_iterator const xrefit = find(xref);
874 xrefptr = &(xrefit->second);
876 return data.getInfo(xrefptr, buf, richtext);
880 docstring const BiblioInfo::getLabel(vector<docstring> const & keys,
881 Buffer const & buf, string const & style, bool richtext,
882 docstring const & before, docstring const & after, docstring const & dialog) const
884 CiteEngineType const engine_type = buf.params().citeEngineType();
885 DocumentClass const & dc = buf.params().documentClass();
886 docstring const & format = from_utf8(dc.getCiteFormat(engine_type, style, "cite"));
887 docstring ret = format;
888 vector<docstring>::const_iterator key = keys.begin();
889 vector<docstring>::const_iterator ken = keys.end();
890 for (; key != ken; ++key) {
891 BiblioInfo::const_iterator it = find(*key);
892 BibTeXInfo empty_data;
893 empty_data.key(*key);
894 BibTeXInfo & data = empty_data;
895 BibTeXInfo const * xrefptr = 0;
898 docstring const xref = data.getXRef();
900 BiblioInfo::const_iterator const xrefit = find(xref);
902 xrefptr = &(xrefit->second);
905 ret = data.getLabel(xrefptr, buf, ret, richtext,
906 before, after, dialog, key+1 != ken);
912 bool BiblioInfo::isBibtex(docstring const & key) const
914 BiblioInfo::const_iterator it = find(key);
917 return it->second.isBibTeX();
921 vector<docstring> const BiblioInfo::getCiteStrings(
922 vector<docstring> const & keys, vector<CitationStyle> const & styles,
923 Buffer const & buf, bool richtext, docstring const & before,
924 docstring const & after, docstring const & dialog) const
927 return vector<docstring>();
930 vector<docstring> vec(styles.size());
931 for (size_t i = 0; i != vec.size(); ++i) {
932 style = styles[i].cmd;
933 vec[i] = getLabel(keys, buf, style, richtext, before, after, dialog);
940 void BiblioInfo::mergeBiblioInfo(BiblioInfo const & info)
942 bimap_.insert(info.begin(), info.end());
943 field_names_.insert(info.field_names_.begin(), info.field_names_.end());
944 entry_types_.insert(info.entry_types_.begin(), info.entry_types_.end());
950 // used in xhtml to sort a list of BibTeXInfo objects
951 bool lSorter(BibTeXInfo const * lhs, BibTeXInfo const * rhs)
953 docstring const lauth = lhs->getAbbreviatedAuthor();
954 docstring const rauth = rhs->getAbbreviatedAuthor();
955 docstring const lyear = lhs->getYear();
956 docstring const ryear = rhs->getYear();
957 docstring const ltitl = lhs->operator[]("title");
958 docstring const rtitl = rhs->operator[]("title");
959 return (lauth < rauth)
960 || (lauth == rauth && lyear < ryear)
961 || (lauth == rauth && lyear == ryear && ltitl < rtitl);
967 void BiblioInfo::collectCitedEntries(Buffer const & buf)
969 cited_entries_.clear();
970 // We are going to collect all the citation keys used in the document,
971 // getting them from the TOC.
972 // FIXME We may want to collect these differently, in the first case,
973 // so that we might have them in order of appearance.
974 set<docstring> citekeys;
975 Toc const & toc = buf.tocBackend().toc("citation");
976 Toc::const_iterator it = toc.begin();
977 Toc::const_iterator const en = toc.end();
978 for (; it != en; ++it) {
979 if (it->str().empty())
981 vector<docstring> const keys = getVectorFromString(it->str());
982 citekeys.insert(keys.begin(), keys.end());
984 if (citekeys.empty())
987 // We have a set of the keys used in this document.
988 // We will now convert it to a list of the BibTeXInfo objects used in
990 vector<BibTeXInfo const *> bi;
991 set<docstring>::const_iterator cit = citekeys.begin();
992 set<docstring>::const_iterator const cen = citekeys.end();
993 for (; cit != cen; ++cit) {
994 BiblioInfo::const_iterator const bt = find(*cit);
995 if (bt == end() || !bt->second.isBibTeX())
997 bi.push_back(&(bt->second));
1000 sort(bi.begin(), bi.end(), lSorter);
1002 // Now we can write the sorted keys
1003 vector<BibTeXInfo const *>::const_iterator bit = bi.begin();
1004 vector<BibTeXInfo const *>::const_iterator ben = bi.end();
1005 for (; bit != ben; ++bit)
1006 cited_entries_.push_back((*bit)->key());
1010 void BiblioInfo::makeCitationLabels(Buffer const & buf)
1012 collectCitedEntries(buf);
1013 CiteEngineType const engine_type = buf.params().citeEngineType();
1014 bool const numbers = (engine_type & ENGINE_TYPE_NUMERICAL);
1018 // used to remember the last one we saw
1019 // we'll be comparing entries to see if we need to add
1020 // modifiers, like "1984a"
1021 map<docstring, BibTeXInfo>::iterator last;
1023 vector<docstring>::const_iterator it = cited_entries_.begin();
1024 vector<docstring>::const_iterator const en = cited_entries_.end();
1025 for (; it != en; ++it) {
1026 map<docstring, BibTeXInfo>::iterator const biit = bimap_.find(*it);
1027 // this shouldn't happen, but...
1028 if (biit == bimap_.end())
1029 // ...fail gracefully, anyway.
1031 BibTeXInfo & entry = biit->second;
1033 docstring const num = convert<docstring>(++keynumber);
1034 entry.setCiteNumber(num);
1036 if (it != cited_entries_.begin()
1037 && entry.getAbbreviatedAuthor() == last->second.getAbbreviatedAuthor()
1038 // we access the year via getYear() so as to get it from the xref,
1039 // if we need to do so
1040 && getYear(entry.key()) == getYear(last->second.key())) {
1041 if (modifier == 0) {
1042 // so the last one should have been 'a'
1043 last->second.setModifier('a');
1045 } else if (modifier == 'z')
1052 entry.setModifier(modifier);
1053 // remember the last one
1058 it = cited_entries_.begin();
1059 for (; it != en; ++it) {
1060 map<docstring, BibTeXInfo>::iterator const biit = bimap_.find(*it);
1061 // this shouldn't happen, but...
1062 if (biit == bimap_.end())
1063 // ...fail gracefully, anyway.
1065 BibTeXInfo & entry = biit->second;
1067 entry.label(entry.citeNumber());
1069 docstring const auth = entry.getAbbreviatedAuthor(buf, false);
1070 // we do it this way so as to access the xref, if necessary
1071 // note that this also gives us the modifier
1072 docstring const year = getYear(*it, buf, true);
1073 if (!auth.empty() && !year.empty())
1074 entry.label(auth + ' ' + year);
1076 entry.label(entry.key());
1082 //////////////////////////////////////////////////////////////////////
1086 //////////////////////////////////////////////////////////////////////
1089 CitationStyle citationStyleFromString(string const & command)
1092 if (command.empty())
1095 string cmd = command;
1096 if (cmd[0] == 'C') {
1097 cs.forceUpperCase = true;
1101 size_t const n = cmd.size() - 1;
1102 if (cmd[n] == '*') {
1103 cs.fullAuthorList = true;
1104 cmd = cmd.substr(0, n);
1112 string citationStyleToString(const CitationStyle & cs)
1114 string cmd = cs.cmd;
1115 if (cs.forceUpperCase)
1117 if (cs.fullAuthorList)