3 * This file is part of LyX, the document processor.
4 * Licence details can be found in the file COPYING.
6 * \author Angus Leeming
9 * Full author contact details are available in file CREDITS.
17 #include "bufferparams.h"
20 #include "support/lstrings.h"
22 #include <boost/regex.hpp>
28 using std::ostringstream;
34 using support::ascii_lowercase;
35 using support::bformat;
36 using support::compare_ascii_no_case;
37 using support::contains;
38 using support::getVectorFromString;
40 using support::prefixIs;
51 vector<string> const init_possible_cite_commands()
53 char const * const pos[] = {
55 "citet", "citep", "citealt", "citealp",
56 "citeauthor", "citeyear", "citeyearpar",
57 "citet*", "citep*", "citealt*", "citealp*", "citeauthor*",
58 "Citet", "Citep", "Citealt", "Citealp", "Citeauthor",
59 "Citet*", "Citep*", "Citealt*", "Citealp*", "Citeauthor*",
61 "footcite", "footcitet", "footcitep", "footcitealt",
62 "footcitealp", "footciteauthor", "footciteyear",
68 size_t const size_pos = sizeof(pos) / sizeof(pos[0]);
70 return vector<string>(pos, pos + size_pos);
74 vector<string> const & possible_cite_commands()
76 static vector<string> const pos = init_possible_cite_commands();
81 bool is_possible_cite_command(string const & input)
83 vector<string> const & possibles = possible_cite_commands();
84 vector<string>::const_iterator const end = possibles.end();
85 return std::find(possibles.begin(), end, input) != end;
89 string const default_cite_command(CiteEngine engine)
96 case ENGINE_NATBIB_AUTHORYEAR:
99 case ENGINE_NATBIB_NUMERICAL:
112 string const asValidLatexCommand(string const & input,
113 CiteEngine_enum const & engine)
115 string const default_str = default_cite_command(engine);
116 if (!is_possible_cite_command(input))
122 output = default_str;
125 case ENGINE_NATBIB_AUTHORYEAR:
126 case ENGINE_NATBIB_NUMERICAL:
127 if (input == "cite" || input == "citefield" ||
128 input == "citetitle" || input == "cite*")
129 output = default_str;
130 else if (prefixIs(input, "foot"))
131 output = input.substr(4);
136 case ENGINE_JURABIB: {
137 // Jurabib does not support the 'uppercase' natbib style.
139 output = string(1, 'c') + input.substr(1);
143 // Jurabib does not support the 'full' natbib style.
144 string::size_type const n = output.size() - 1;
145 if (output != "cite*" && output[n] == '*')
146 output = output.substr(0, n);
156 string const familyName(string const & name)
158 // Very simple parser
161 // possible authorname combinations are:
162 // "Surname, FirstName"
164 // "FirstName Surname"
166 string::size_type idx = fname.find(',');
167 if (idx != string::npos)
168 return ltrim(fname.substr(0, idx));
169 idx = fname.rfind('.');
170 if (idx != string::npos)
171 fname = ltrim(fname.substr(idx + 1));
172 // test if we have a LaTeX Space in front
173 if (fname[0] == '\\')
174 return fname.substr(2);
180 string const getAbbreviatedAuthor(InfoMap const & map, string const & key)
182 BOOST_ASSERT(!map.empty());
184 InfoMap::const_iterator it = map.find(key);
187 string const & data = it->second;
189 // Is the entry a BibTeX one or one from lyx-layout "bibliography"?
190 string::size_type const pos = data.find("TheBibliographyRef");
191 if (pos != string::npos) {
196 string const opt = trim(data.substr(0, pos - 1));
201 split(opt, authors, '(');
205 string author = parseBibTeX(data, "author");
208 author = parseBibTeX(data, "editor");
210 if (author.empty()) {
211 author = parseBibTeX(data, "key");
217 vector<string> const authors = getVectorFromString(author, " and ");
221 if (authors.size() == 2)
222 return bformat(_("%1$s and %2$s"),
223 familyName(authors[0]), familyName(authors[1]));
225 if (authors.size() > 2)
226 return bformat(_("%1$s et al."), familyName(authors[0]));
228 return familyName(authors[0]);
232 string const getYear(InfoMap const & map, string const & key)
234 BOOST_ASSERT(!map.empty());
236 InfoMap::const_iterator it = map.find(key);
239 string const & data = it->second;
241 // Is the entry a BibTeX one or one from lyx-layout "bibliography"?
242 string::size_type const pos = data.find("TheBibliographyRef");
243 if (pos != string::npos) {
249 trim(data.substr(0, pos - 1));
254 string const tmp = split(opt, authors, '(');
256 split(tmp, year, ')');
261 string year = parseBibTeX(data, "year");
271 // A functor for use with std::sort, leading to case insensitive sorting
272 class compareNoCase: public std::binary_function<string, string, bool>
275 bool operator()(string const & s1, string const & s2) const {
276 return compare_ascii_no_case(s1, s2) < 0;
283 vector<string> const getKeys(InfoMap const & map)
285 vector<string> bibkeys;
286 InfoMap::const_iterator it = map.begin();
287 InfoMap::const_iterator end = map.end();
288 for (; it != end; ++it) {
289 bibkeys.push_back(it->first);
292 std::sort(bibkeys.begin(), bibkeys.end(), compareNoCase());
297 string const getInfo(InfoMap const & map, string const & key)
299 BOOST_ASSERT(!map.empty());
301 InfoMap::const_iterator it = map.find(key);
304 string const & data = it->second;
306 // is the entry a BibTeX one or one from lyx-layout "bibliography"?
307 string const separator("TheBibliographyRef");
308 string::size_type const pos = data.find(separator);
309 if (pos != string::npos) {
310 string::size_type const pos2 = pos + separator.size();
311 string const info = trim(data.substr(pos2));
315 // Search for all possible "required" keys
316 string author = parseBibTeX(data, "author");
318 author = parseBibTeX(data, "editor");
320 string year = parseBibTeX(data, "year");
321 string title = parseBibTeX(data, "title");
322 string booktitle = parseBibTeX(data, "booktitle");
323 string chapter = parseBibTeX(data, "chapter");
324 string number = parseBibTeX(data, "number");
325 string volume = parseBibTeX(data, "volume");
326 string pages = parseBibTeX(data, "pages");
328 string media = parseBibTeX(data, "journal");
330 media = parseBibTeX(data, "publisher");
332 media = parseBibTeX(data, "school");
334 media = parseBibTeX(data, "institution");
336 ostringstream result;
338 result << author << ", ";
341 if (!booktitle.empty())
342 result << ", in " << booktitle;
343 if (!chapter.empty())
344 result << ", Ch. " << chapter;
346 result << ", " << media;
348 result << ", vol. " << volume;
350 result << ", no. " << number;
352 result << ", pp. " << pages;
354 result << ", " << year;
356 string const result_str = rtrim(result.str());
357 if (!result_str.empty())
360 // This should never happen (or at least be very unusual!)
367 // Escape special chars.
368 // All characters are literals except: '.|*?+(){}[]^$\'
369 // These characters are literals when preceded by a "\", which is done here
370 string const escape_special_chars(string const & expr)
372 // Search for all chars '.|*?+(){}[^$]\'
373 // Note that '[' and '\' must be escaped.
374 // This is a limitation of boost::regex, but all other chars in BREs
375 // are assumed literal.
376 boost::RegEx reg("[].|*?+(){}^$\\[\\\\]");
378 // $& is a perl-like expression that expands to all of the current match
379 // The '$' must be prefixed with the escape character '\' for
380 // boost to treat it as a literal.
381 // Thus, to prefix a matched expression with '\', we use:
382 return reg.Merge(expr, "\\\\$&");
386 // A functor for use with std::find_if, used to ascertain whether a
387 // data entry matches the required regex_
388 class RegexMatch : public std::unary_function<string, bool>
391 // re and icase are used to construct an instance of boost::RegEx.
392 // if icase is true, then matching is insensitive to case
393 RegexMatch(InfoMap const & m, string const & re, bool icase)
394 : map_(m), regex_(re, icase) {}
396 bool operator()(string const & key) const {
400 // the data searched is the key + its associated BibTeX/biblio
403 InfoMap::const_iterator info = map_.find(key);
404 if (info != map_.end())
405 data += ' ' + info->second;
407 // Attempts to find a match for the current RE
408 // somewhere in data.
409 return regex_.Search(data);
412 bool validRE() const { return regex_.error_code() == 0; }
416 mutable boost::RegEx regex_;
422 vector<string>::const_iterator
423 searchKeys(InfoMap const & theMap,
424 vector<string> const & keys,
425 string const & search_expr,
426 vector<string>::const_iterator start,
431 // Preliminary checks
432 if (start < keys.begin() || start >= keys.end())
435 string expr = trim(search_expr);
440 // We must escape special chars in the search_expr so that
441 // it is treated as a simple string by boost::regex.
442 expr = escape_special_chars(expr);
444 // Build the functor that will be passed to find_if.
445 RegexMatch const match(theMap, expr, !caseSensitive);
446 if (!match.validRE())
449 // Search the vector of 'keys' from 'start' for one that matches the
450 // predicate 'match'. Searching can be forward or backward from start.
452 return std::find_if(start, keys.end(), match);
454 vector<string>::const_reverse_iterator rit(start);
455 vector<string>::const_reverse_iterator rend = keys.rend();
456 rit = std::find_if(rit, rend, match);
460 // This is correct and always safe.
461 // (See Meyer's Effective STL, Item 28.)
462 return (++rit).base();
466 string const parseBibTeX(string data, string const & findkey)
469 // at first we delete all characters right of '%' and
470 // replace tabs through a space and remove leading spaces
471 // we read the data line by line so that the \n are
475 string dummy = token(data,'\n', Entries);
476 while (!dummy.empty()) {
477 dummy = subst(dummy, '\t', ' '); // no tabs
478 dummy = ltrim(dummy); // no leading spaces
479 // ignore lines with a beginning '%' or ignore all right of %
480 string::size_type const idx =
481 dummy.empty() ? string::npos : dummy.find('%');
482 if (idx != string::npos)
483 dummy.erase(idx, string::npos);
484 // do we have a new token or a new line of
485 // the same one? In the first case we ignore
486 // the \n and in the second we replace it
488 if (!dummy.empty()) {
489 if (!contains(dummy, '='))
490 data_ += ' ' + dummy;
494 dummy = token(data, '\n', ++Entries);
497 // replace double commas with "" for easy scanning
498 data = subst(data_, ",,", "\"\"");
504 // now get only the important line of the bibtex entry.
505 // all entries are devided by ',' except the last one.
506 data += ','; // now we have same behaviour for all entries
507 // because the last one is "blah ... }"
510 // parsing of title and booktitle is different from the
511 // others, because booktitle contains title
513 dummy = token(data, ',', Entries++);
514 if (!dummy.empty()) {
515 found = contains(ascii_lowercase(dummy), findkey);
516 if (findkey == "title" &&
517 contains(ascii_lowercase(dummy), "booktitle"))
520 } while (!found && !dummy.empty());
525 // we are not sure, if we get all, because "key= "blah, blah" is
527 // Therefore we read all until the next "=" character, which follows a
530 dummy = token(data, ',', Entries++);
531 while (!contains(dummy, '=') && !dummy.empty()) {
532 keyvalue += ',' + dummy;
533 dummy = token(data, ',', Entries++);
536 // replace double "" with originals ,, (two commas)
537 // leaving us with the all-important line
538 data = subst(keyvalue, "\"\"", ",,");
543 // 2. if there is no opening '{' then a closing '{' is probably cruft.
544 if (!contains(data, '{'))
545 data = rtrim(data, "}");
546 // happens, when last keyword
547 string::size_type const idx =
548 !data.empty() ? data.find('=') : string::npos;
550 if (idx == string::npos)
553 data = trim(data.substr(idx));
555 if (data.length() < 2 || data[0] != '=') { // a valid entry?
558 // delete '=' and the following spaces
559 data = ltrim(data, " =");
560 if (data.length() < 2) {
561 return data; // not long enough to find delimiters
563 string::size_type keypos = 1;
565 if (data[0] == '{') {
567 } else if (data[0] == '"') {
570 // no {} and no "", pure data but with a
571 // possible ',' at the end
572 return rtrim(data, ",");
574 string tmp = data.substr(keypos);
575 while (tmp.find('{') != string::npos &&
576 tmp.find('}') != string::npos &&
577 tmp.find('{') < tmp.find('}') &&
578 tmp.find('{') < tmp.find(enclosing)) {
580 keypos += tmp.find('{') + 1;
581 tmp = data.substr(keypos);
582 keypos += tmp.find('}') + 1;
583 tmp = data.substr(keypos);
585 if (tmp.find(enclosing) == string::npos)
588 keypos += tmp.find(enclosing);
589 return data.substr(1, keypos - 1);
599 char const * const citeCommands[] = {
600 "cite", "citet", "citep", "citealt", "citealp", "citeauthor",
601 "citeyear", "citeyearpar" };
603 unsigned int const nCiteCommands =
604 sizeof(citeCommands) / sizeof(char *);
606 CiteStyle const citeStyles[] = {
607 CITE, CITET, CITEP, CITEALT, CITEALP,
608 CITEAUTHOR, CITEYEAR, CITEYEARPAR };
610 unsigned int const nCiteStyles =
611 sizeof(citeStyles) / sizeof(CiteStyle);
613 CiteStyle const citeStylesFull[] = {
614 CITET, CITEP, CITEALT, CITEALP, CITEAUTHOR };
616 unsigned int const nCiteStylesFull =
617 sizeof(citeStylesFull) / sizeof(CiteStyle);
619 CiteStyle const citeStylesUCase[] = {
620 CITET, CITEP, CITEALT, CITEALP, CITEAUTHOR };
622 unsigned int const nCiteStylesUCase =
623 sizeof(citeStylesUCase) / sizeof(CiteStyle);
628 CitationStyle::CitationStyle(string const & command)
629 : style(CITE), full(false), forceUCase(false)
634 string cmd = command;
640 string::size_type const n = cmd.size() - 1;
641 if (cmd != "cite" && cmd[n] == '*') {
643 cmd = cmd.substr(0,n);
646 char const * const * const last = citeCommands + nCiteCommands;
647 char const * const * const ptr = std::find(citeCommands, last, cmd);
650 size_t idx = ptr - citeCommands;
651 style = citeStyles[idx];
656 string const CitationStyle::asLatexStr() const
658 string cite = citeCommands[style];
660 CiteStyle const * last = citeStylesFull + nCiteStylesFull;
661 if (std::find(citeStylesFull, last, style) != last)
666 CiteStyle const * last = citeStylesUCase + nCiteStylesUCase;
667 if (std::find(citeStylesUCase, last, style) != last)
675 CiteEngine_enum getEngine(Buffer const & buffer)
677 return buffer.params().cite_engine;
681 vector<CiteStyle> const getCiteStyles(CiteEngine_enum const & engine)
683 unsigned int nStyles = 0;
684 unsigned int start = 0;
691 case ENGINE_NATBIB_AUTHORYEAR:
692 case ENGINE_NATBIB_NUMERICAL:
693 nStyles = nCiteStyles - 1;
697 nStyles = nCiteStyles;
702 typedef vector<CiteStyle> cite_vec;
704 cite_vec styles(nStyles);
705 cite_vec::size_type i = 0;
707 for (; i != styles.size(); ++i, ++j)
708 styles[i] = citeStyles[j];
715 getNumericalStrings(string const & key,
716 InfoMap const & map, vector<CiteStyle> const & styles)
719 return vector<string>();
722 string const author = getAbbreviatedAuthor(map, key);
723 string const year = getYear(map, key);
724 if (author.empty() || year.empty())
725 return vector<string>();
727 vector<string> vec(styles.size());
728 for (vector<string>::size_type i = 0; i != vec.size(); ++i) {
738 str = author + " [#ID]";
742 str = author + " #ID";
758 str = '(' + year + ')';
770 getAuthorYearStrings(string const & key,
771 InfoMap const & map, vector<CiteStyle> const & styles)
774 return vector<string>();
777 string const author = getAbbreviatedAuthor(map, key);
778 string const year = getYear(map, key);
779 if (author.empty() || year.empty())
780 return vector<string>();
782 vector<string> vec(styles.size());
783 for (vector<string>::size_type i = 0; i != vec.size(); ++i) {
788 // jurabib only: Author/Annotator
789 // (i.e. the "before" field, 2nd opt arg)
790 str = author + "/<" + _("before") + '>';
794 str = author + " (" + year + ')';
798 str = '(' + author + ", " + year + ')';
802 str = author + ' ' + year ;
806 str = author + ", " + year ;
818 str = '(' + year + ')';
828 } // namespace biblio