1 /* This file is part of
2 * ======================================================
4 * LyX, The Document Processor
6 * Copyright 2001 The LyX Team.
8 * ======================================================
11 * \author Angus Leeming <a.leeming@ic.ac.uk>
20 #pragma implementation
25 #include "gettext.h" // for _()
26 #include "helper_funcs.h"
27 #include "support/lstrings.h"
28 #include "support/LAssert.h"
29 #include "support/LRegex.h"
41 using namespace biblio;
43 char const * const citeCommands[] = {
44 "cite", "citet", "citep", "citealt", "citealp", "citeauthor",
45 "citeyear", "citeyearpar" };
47 unsigned int const nCiteCommands =
48 sizeof(citeCommands) / sizeof(char *);
50 CiteStyle const citeStyles[] = {
51 CITE, CITET, CITEP, CITEALT, CITEALP,
52 CITEAUTHOR, CITEYEAR, CITEYEARPAR };
54 unsigned int const nCiteStyles =
55 sizeof(citeStyles) / sizeof(CiteStyle);
57 CiteStyle const citeStylesFull[] = {
58 CITET, CITEP, CITEALT, CITEALP, CITEAUTHOR };
60 unsigned int const nCiteStylesFull =
61 sizeof(citeStylesFull) / sizeof(CiteStyle);
63 CiteStyle const citeStylesUCase[] = {
64 CITET, CITEP, CITEALT, CITEALP, CITEAUTHOR };
66 unsigned int const nCiteStylesUCase =
67 sizeof(citeStylesUCase) / sizeof(CiteStyle);
70 // The functions doing the dirty work for the search.
71 vector<string>::const_iterator
72 simpleSearch(InfoMap const & theMap,
73 vector<string> const & keys,
75 vector<string>::const_iterator start,
83 vector<string> searchwords = getVectorFromString(tmp, " ");
85 // Loop over all keys from start...
86 for (vector<string>::const_iterator it = start;
87 // End condition is direction-dependent.
88 (dir == FORWARD) ? (it<keys.end()) : (it>=keys.begin());
89 // increment is direction-dependent.
90 (dir == FORWARD) ? (++it) : (--it)) {
93 InfoMap::const_iterator info = theMap.find(*it);
94 if (info != theMap.end())
95 data += " " + info->second;
97 data = lowercase(data);
101 // Loop over all search words...
102 for (vector<string>::const_iterator sit = searchwords.begin();
103 sit != searchwords.end(); ++sit) {
104 if (data.find(*sit) == string::npos) {
110 if (found) return it;
117 vector<string>::const_iterator
118 regexSearch(InfoMap const & theMap,
119 vector<string> const & keys,
121 vector<string>::const_iterator start,
126 for (vector<string>::const_iterator it = start;
127 // End condition is direction-dependent.
128 (dir == FORWARD) ? (it<keys.end()) : (it>=keys.begin());
129 // increment is direction-dependent.
130 (dir == FORWARD) ? (++it) : (--it)) {
133 InfoMap::const_iterator info = theMap.find(*it);
134 if (info != theMap.end())
135 data += " " + info->second;
137 if (reg.exec(data).size() > 0)
144 string const familyName(string const & name)
146 // Very simple parser
149 string::size_type idx = fname.rfind(".");
150 if (idx != string::npos)
151 fname = frontStrip(fname.substr(idx+1));
157 string const getAbbreviatedAuthor(InfoMap const & map, string const & key)
159 lyx::Assert(!map.empty());
161 InfoMap::const_iterator it = map.find(key);
164 if (it != map.end()) {
165 author = parseBibTeX(it->second, "author");
167 author = parseBibTeX(it->second, "editor");
169 vector<string> authors = getVectorFromString(author, "and");
171 if (!authors.empty()) {
174 for (vector<string>::iterator it = authors.begin();
175 it != authors.end(); ++it) {
176 *it = familyName(strip(*it));
180 if (authors.size() == 2)
181 author += _(" and ") + authors[1];
182 else if (authors.size() > 2)
183 author += _(" et al.");
188 author = _("Caesar et al.");
194 string const getYear(InfoMap const & map, string const & key)
196 lyx::Assert(!map.empty());
198 InfoMap::const_iterator it = map.find(key);
203 year = parseBibTeX(it->second, "year");
219 // A functor for use with std::sort, leading to case insensitive sorting
220 struct compareNoCase: public std::binary_function<string, string, bool>
222 bool operator()(string const & s1, string const & s2) const {
223 return compare_no_case(s1, s2) < 0;
227 vector<string> const getKeys(InfoMap const & map)
229 vector<string> bibkeys;
231 for (InfoMap::const_iterator it = map.begin(); it != map.end(); ++it) {
232 bibkeys.push_back(it->first);
235 sort(bibkeys.begin(), bibkeys.end(), compareNoCase());
240 string const getInfo(InfoMap const & map, string const & key)
242 lyx::Assert(!map.empty());
244 InfoMap::const_iterator it = map.find(key);
245 if (it == map.end()) return string();
247 // Search for all possible "required" keys
248 string author = parseBibTeX(it->second, "author");
250 author = parseBibTeX(it->second, "editor");
252 string year = parseBibTeX(it->second, "year");
253 string title = parseBibTeX(it->second, "title");
254 string booktitle = parseBibTeX(it->second, "booktitle");
255 string chapter = parseBibTeX(it->second, "chapter");
256 string number = parseBibTeX(it->second, "number");
257 string volume = parseBibTeX(it->second, "volume");
258 string pages = parseBibTeX(it->second, "pages");
260 string media = parseBibTeX(it->second, "journal");
262 media = parseBibTeX(it->second, "publisher");
264 media = parseBibTeX(it->second, "school");
266 media = parseBibTeX(it->second, "institution");
268 ostringstream result;
271 result << ", " << title;
272 if (!booktitle.empty())
273 result << ", in " << booktitle;
274 if (!chapter.empty())
275 result << ", Ch. " << chapter;
277 result << ", " << media;
279 result << ", vol. " << volume;
281 result << ", no. " << number;
283 result << ", pp. " << pages;
285 result << ", " << year;
287 if (result.str().empty()) // not a BibTeX record
288 result << it->second;
290 return result.str().c_str();
294 vector<string>::const_iterator
295 searchKeys(InfoMap const & theMap,
296 vector<string> const & keys,
298 vector<string>::const_iterator start,
303 // Preliminary checks
304 if(start < keys.begin() || start >= keys.end())
307 string search_expr = frontStrip(strip(expr));
308 if (search_expr.empty())
312 return simpleSearch(theMap, keys, search_expr, start, dir,
315 return regexSearch(theMap, keys, search_expr, start, dir);
319 string const parseBibTeX(string data, string const & findkey)
322 for (string::iterator it = data.begin(); it < data.end(); ++it) {
323 if ((*it) == '\n' || (*it) == '\t')
326 data = frontStrip(data);
328 // now get only the important line of the bibtex entry.
329 // all entries are devided by ',' except the last one.
330 data += ','; // now we have same behaviour for all entries
331 // because the last one is "blah ... }"
333 string dummy = token(data, ',', Entries);
334 while (!contains(lowercase(dummy), findkey) && !dummy.empty())
335 dummy = token(data, ',', ++Entries);
337 return string(); // no such keyword
338 // we are not sure, if we get all, because "key= "blah, blah" is allowed.
339 // therefore we read all until the next "=" character, which follows a
342 dummy = token(data, ',', ++Entries);
343 while (!contains(dummy, '=') && !dummy.empty()) {
344 keyvalue += (',' + dummy);
345 dummy = token(data, ',', ++Entries);
347 data = keyvalue; // now we have the important line
348 data = strip(data, ' '); // all spaces
349 if (!contains(data, '{')) // no opening '{'
350 data = strip(data, '}');// maybe there is a main closing '}'
351 // happens, when last keyword
352 string key = lowercase(data.substr(0, data.find('=')));
353 data = data.substr(data.find('='), data.length() - 1);
354 data = frontStrip(strip(data));
355 if (data.length() < 2 || data[0] != '=') { // a valid entry?
358 data = frontStrip(data.substr(1, data.length() - 1));
359 if (data.length() < 2) {
360 return data; // not long enough to find delimiters
362 string::size_type keypos = 1;
364 if (data[0] == '{') {
366 } else if (data[0] == '"') {
369 return data; // no {} and no "", pure data
371 string tmp = data.substr(keypos, data.length()-1);
372 while (tmp.find('{') != string::npos &&
373 tmp.find('}') != string::npos &&
374 tmp.find('{') < tmp.find('}') &&
375 tmp.find('{') < tmp.find(enclosing)) {
377 keypos += tmp.find('{') + 1;
378 tmp = data.substr(keypos, data.length() - 1);
379 keypos += tmp.find('}') + 1;
380 tmp = data.substr(keypos, data.length() - 1);
382 if (tmp.find(enclosing) == string::npos)
385 keypos += tmp.find(enclosing);
386 return data.substr(1, keypos - 1);
393 CitationStyle const getCitationStyle(string const & command)
395 if (command.empty()) return CitationStyle();
398 string cmd = command;
401 cs.forceUCase = true;
405 size_t n = cmd.size()-1;
408 cmd = cmd.substr(0,n);
411 char const * const * const last = citeCommands + nCiteCommands;
412 char const * const * const ptr = std::find(citeCommands, last, cmd);
415 size_t idx = ptr - citeCommands;
416 cs.style = citeStyles[idx];
423 string const getCiteCommand(CiteStyle command, bool full, bool forceUCase)
425 string cite = citeCommands[command];
427 CiteStyle const * last = citeStylesFull + nCiteStylesFull;
428 if (std::find(citeStylesFull, last, command) != last)
433 CiteStyle const * last = citeStylesUCase + nCiteStylesUCase;
434 if (std::find(citeStylesUCase, last, command) != last)
442 vector<CiteStyle> const getCiteStyles(bool usingNatbib)
444 unsigned int nStyles = 1;
445 unsigned int start = 0;
447 nStyles = nCiteStyles - 1;
451 vector<CiteStyle> styles(nStyles);
453 vector<CiteStyle>::size_type i = 0;
455 for (; i != styles.size(); ++i, ++j) {
456 styles[i] = citeStyles[j];
464 getNumericalStrings(string const & key,
465 InfoMap const & map, vector<CiteStyle> const & styles)
468 vector<string> vec(1);
469 vec[0] = _("No database");
473 vector<string> vec(styles.size());
475 string const author = getAbbreviatedAuthor(map, key);
476 string const year = getYear(map, key);
478 for (vector<string>::size_type i = 0; i != vec.size(); ++i) {
488 str = author + " [#ID]";
492 str = author + " #ID";
508 str = "(" + year + ")";
520 getAuthorYearStrings(string const & key,
521 InfoMap const & map, vector<CiteStyle> const & styles)
524 vector<string> vec(1);
525 vec[0] = _("No database");
529 vector<string> vec(styles.size());
531 string const author = getAbbreviatedAuthor(map, key);
532 string const year = getYear(map, key);
534 for (vector<string>::size_type i = 0; i != vec.size(); ++i) {
539 str = author + " (" + year + ")";
544 str = "(" + author + ", " + year + ")";
548 str = author + " " + year ;
552 str = author + ", " + year ;
564 str = "(" + year + ")";
574 } // namespace biblio