]> git.lyx.org Git - lyx.git/blob - src/Counters.cpp
c4ec31b017eb5db7c7d19526ee8cf859110b10a1
[lyx.git] / src / Counters.cpp
1 /**
2  * \file Counters.cpp
3  * This file is part of LyX, the document processor.
4  * Licence details can be found in the file COPYING.
5  *
6  * \author Lars Gullik Bjønnes
7  * \author Martin Vermeer
8  * \author André Pönitz
9  * \author Richard Heck (roman numerals)
10  *
11  * Full author contact details are available in file CREDITS.
12  */
13
14 #include <config.h>
15
16 #include "Counters.h"
17 #include "Layout.h"
18 #include "Lexer.h"
19
20 #include "support/convert.h"
21 #include "support/debug.h"
22 #include "support/gettext.h"
23 #include "support/lassert.h"
24 #include "support/lstrings.h"
25
26 #include <algorithm>
27 #include <sstream>
28
29 using namespace std;
30 using namespace lyx::support;
31
32 namespace lyx {
33
34
35 Counter::Counter()
36 {
37         reset();
38 }
39
40
41 Counter::Counter(docstring const & mc, docstring const & ls,  
42                 docstring const & lsa)
43         : master_(mc), labelstring_(ls), labelstringappendix_(lsa)
44 {
45         reset();
46 }
47
48
49 bool Counter::read(Lexer & lex)
50 {
51         enum {
52                 CT_WITHIN = 1,
53                 CT_LABELSTRING,
54                 CT_LABELSTRING_APPENDIX,
55                 CT_PRETTYFORMAT,
56                 CT_END
57         };
58
59         LexerKeyword counterTags[] = {
60                 { "end", CT_END },
61                 { "labelstring", CT_LABELSTRING },
62                 { "labelstringappendix", CT_LABELSTRING_APPENDIX },
63                 { "prettyformat", CT_PRETTYFORMAT },
64                 { "within", CT_WITHIN }
65         };
66
67         lex.pushTable(counterTags);
68
69         bool getout = false;
70         while (!getout && lex.isOK()) {
71                 int le = lex.lex();
72                 switch (le) {
73                         case Lexer::LEX_UNDEF:
74                                 lex.printError("Unknown counter tag `$$Token'");
75                                 continue;
76                         default: 
77                                 break;
78                 }
79                 switch (le) {
80                         case CT_WITHIN:
81                                 lex.next();
82                                 master_ = lex.getDocString();
83                                 if (master_ == "none")
84                                         master_.erase();
85                                 break;
86                         case CT_PRETTYFORMAT:
87                                 lex.next();
88                                 prettyformat_ = lex.getDocString();
89                                 break;
90                         case CT_LABELSTRING:
91                                 lex.next();
92                                 labelstring_ = lex.getDocString();
93                                 labelstringappendix_ = labelstring_;
94                                 break;
95                         case CT_LABELSTRING_APPENDIX:
96                                 lex.next();
97                                 labelstringappendix_ = lex.getDocString();
98                                 break;
99                         case CT_END:
100                                 getout = true;
101                                 break;
102                 }
103         }
104
105         // Here if have a full counter if getout == true
106         if (!getout)
107                 LYXERR0("No End tag found for counter!");
108         lex.popTable();
109         return getout;
110 }
111
112 void Counter::set(int v)
113 {
114         value_ = v;
115 }
116
117
118 void Counter::addto(int v)
119 {
120         value_ += v;
121 }
122
123
124 int Counter::value() const
125 {
126         return value_;
127 }
128
129
130 void Counter::step()
131 {
132         ++value_;
133 }
134
135
136 void Counter::reset()
137 {
138         value_ = 0;
139 }
140
141
142 docstring const & Counter::master() const
143 {
144         return master_;
145 }
146
147
148 docstring const & Counter::labelString(bool in_appendix) const
149 {
150         return in_appendix ? labelstringappendix_ : labelstring_;
151 }
152
153
154 Counter::StringMap & Counter::flatLabelStrings(bool in_appendix) const
155 {
156         return in_appendix ? flatlabelstringappendix_ : flatlabelstring_;
157 }
158
159
160 Counters::Counters() : appendix_(false), subfloat_(false)
161 {
162         layout_stack_.push_back(0);
163         counter_stack_.push_back(0);
164 }
165
166
167 void Counters::newCounter(docstring const & newc,
168                           docstring const & masterc, 
169                           docstring const & ls,
170                           docstring const & lsa)
171 {
172         if (!masterc.empty() && !hasCounter(masterc)) {
173                 lyxerr << "Master counter does not exist: "
174                        << to_utf8(masterc)
175                        << endl;
176                 return;
177         }
178         counterList_[newc] = Counter(masterc, ls, lsa);
179 }
180
181
182 bool Counters::hasCounter(docstring const & c) const
183 {
184         return counterList_.find(c) != counterList_.end();
185 }
186
187
188 bool Counters::read(Lexer & lex, docstring const & name, bool makenew)
189 {
190         if (hasCounter(name)) {
191                 LYXERR(Debug::TCLASS, "Reading existing counter " << to_utf8(name));
192                 return counterList_[name].read(lex);
193         }
194
195         LYXERR(Debug::TCLASS, "Reading new counter " << to_utf8(name));
196         Counter cnt;
197         bool success = cnt.read(lex);
198         // if makenew is false, we will just discard what we read
199         if (success && makenew)
200                 counterList_[name] = cnt;
201         else if (!success)
202                 LYXERR0("Error reading counter `" << name << "'!");
203         return success;
204 }
205
206
207 void Counters::set(docstring const & ctr, int const val)
208 {
209         CounterList::iterator const it = counterList_.find(ctr);
210         if (it == counterList_.end()) {
211                 lyxerr << "set: Counter does not exist: "
212                        << to_utf8(ctr) << endl;
213                 return;
214         }
215         it->second.set(val);
216 }
217
218
219 void Counters::addto(docstring const & ctr, int const val)
220 {
221         CounterList::iterator const it = counterList_.find(ctr);
222         if (it == counterList_.end()) {
223                 lyxerr << "addto: Counter does not exist: "
224                        << to_utf8(ctr) << endl;
225                 return;
226         }
227         it->second.addto(val);
228 }
229
230
231 int Counters::value(docstring const & ctr) const
232 {
233         CounterList::const_iterator const cit = counterList_.find(ctr);
234         if (cit == counterList_.end()) {
235                 lyxerr << "value: Counter does not exist: "
236                        << to_utf8(ctr) << endl;
237                 return 0;
238         }
239         return cit->second.value();
240 }
241
242
243 void Counters::step(docstring const & ctr, UpdateType utype)
244 {
245         CounterList::iterator it = counterList_.find(ctr);
246         if (it == counterList_.end()) {
247                 lyxerr << "step: Counter does not exist: "
248                        << to_utf8(ctr) << endl;
249                 return;
250         }
251
252         it->second.step();
253         if (utype == OutputUpdate) {
254                 LASSERT(!counter_stack_.empty(), /* */);
255                 counter_stack_.pop_back();
256                 counter_stack_.push_back(ctr);
257         }
258         it = counterList_.begin();
259         CounterList::iterator const end = counterList_.end();
260         for (; it != end; ++it) {
261                 if (it->second.master() == ctr) {
262                         it->second.reset();
263                 }
264         }
265 }
266
267
268 void Counters::reset()
269 {
270         appendix_ = false;
271         subfloat_ = false;
272         current_float_.erase();
273         CounterList::iterator it = counterList_.begin();
274         CounterList::iterator const end = counterList_.end();
275         for (; it != end; ++it)
276                 it->second.reset();
277         counter_stack_.clear();
278         counter_stack_.push_back(from_ascii(""));
279         layout_stack_.clear();
280         layout_stack_.push_back(0);
281 }
282
283
284 void Counters::reset(docstring const & match)
285 {
286         LASSERT(!match.empty(), /**/);
287
288         CounterList::iterator it = counterList_.begin();
289         CounterList::iterator end = counterList_.end();
290         for (; it != end; ++it) {
291                 if (it->first.find(match) != string::npos)
292                         it->second.reset();
293         }
294 }
295
296
297 void Counters::copy(Counters & from, Counters & to, docstring const & match)
298 {
299         CounterList::iterator it = counterList_.begin();
300         CounterList::iterator end = counterList_.end();
301         for (; it != end; ++it) {
302                 if (it->first.find(match) != string::npos || match == "") {
303                         to.set(it->first, from.value(it->first));
304                 }
305         }
306 }
307
308
309 namespace {
310
311 char loweralphaCounter(int const n)
312 {
313         if (n < 1 || n > 26)
314                 return '?';
315         return 'a' + n - 1;
316 }
317
318
319 char alphaCounter(int const n)
320 {
321         if (n < 1 || n > 26)
322                 return '?';
323         return 'A' + n - 1;
324 }
325
326
327 char hebrewCounter(int const n)
328 {
329         static const char hebrew[22] = {
330                 '\xe0', '\xe1', '\xe2', '\xe3', '\xe4', '\xe5', '\xe6', '\xe7', '\xe8',
331                 '\xe9', '\xeb', '\xec', '\xee', '\xf0', '\xf1', '\xf2', '\xf4', '\xf6',
332                 '\xf7', '\xf8', '\xf9', '\xfa'
333         };
334
335         if (n < 1 || n > 22)
336                 return '?';
337         return hebrew[n - 1];
338 }
339
340
341
342 // On the special cases, see http://mathworld.wolfram.com/RomanNumerals.html
343 // and for a list of roman numerals up to and including 3999, see 
344 // http://www.research.att.com/~njas/sequences/a006968.txt. (Thanks to Joost
345 // for this info.)
346 docstring const romanCounter(int const n)
347 {
348         static char const * const ones[9] = {
349                 "I",   "II",  "III", "IV", "V",
350                 "VI",  "VII", "VIII", "IX"
351         };
352         
353         static char const * const tens[9] = {
354                 "X", "XX", "XXX", "XL", "L",
355                 "LX", "LXX", "LXXX", "XC"
356         };
357         
358         static char const * const hunds[9] = {
359                 "C", "CC", "CCC", "CD", "D",
360                 "DC", "DCC", "DCCC", "CM"
361         };
362         
363         if (n > 1000 || n < 1) 
364                 return from_ascii("??");
365         
366         int val = n;
367         string roman;
368         switch (n) {
369         //special cases
370         case 900: 
371                 roman = "CM";
372                 break;
373         case 400:
374                 roman = "CD";
375                 break;
376         default:
377                 if (val >= 100) {
378                         int hundreds = val / 100;
379                         roman = hunds[hundreds - 1];
380                         val = val % 100;
381                 }
382                 if (val >= 10) {
383                         switch (val) {
384                         //special case
385                         case 90:
386                                 roman = roman + "XC";
387                                 val = 0; //skip next
388                                 break;
389                         default:
390                                 int tensnum = val / 10;
391                                 roman = roman + tens[tensnum - 1];
392                                 val = val % 10;
393                         } // end switch
394                 } // end tens
395                 if (val > 0)
396                         roman = roman + ones[val -1];
397         }
398         return from_ascii(roman);
399 }
400
401
402 docstring const lowerromanCounter(int const n)
403 {
404         return lowercase(romanCounter(n));
405 }
406
407 } // namespace anon
408
409
410 docstring Counters::labelItem(docstring const & ctr,
411                               docstring const & numbertype) const
412 {
413         CounterList::const_iterator const cit = counterList_.find(ctr);
414         if (cit == counterList_.end()) {
415                 lyxerr << "Counter "
416                        << to_utf8(ctr)
417                        << " does not exist." << endl;
418                 return docstring();
419         }
420
421         int val = cit->second.value();
422
423         if (numbertype == "hebrew")
424                 return docstring(1, hebrewCounter(val));
425
426         if (numbertype == "alph")
427                 return docstring(1, loweralphaCounter(val));
428
429         if (numbertype == "Alph")
430                 return docstring(1, alphaCounter(val));
431
432         if (numbertype == "roman")
433                 return lowerromanCounter(val);
434
435         if (numbertype == "Roman")
436                 return romanCounter(val);
437
438         return convert<docstring>(val);
439 }
440
441
442 docstring Counters::theCounter(docstring const & counter,
443                                string const & lang) const
444 {
445         CounterList::const_iterator it = counterList_.find(counter); 
446         if (it == counterList_.end())
447                 return from_ascii("#");
448         Counter const & ctr = it->second;
449         Counter::StringMap & sm = ctr.flatLabelStrings(appendix());
450         Counter::StringMap::iterator smit = sm.find(lang);
451         if (smit != sm.end())
452                 return counterLabel(smit->second, lang);
453
454         vector<docstring> callers;
455         docstring const & fls = flattenLabelString(counter, appendix(),
456                                                    lang, callers);
457         sm[lang] = fls;
458         return counterLabel(fls, lang);
459 }
460
461
462 docstring Counters::flattenLabelString(docstring const & counter, 
463                                        bool in_appendix,
464                                        string const & lang,
465                                        vector<docstring> & callers) const
466 {
467         docstring label;
468
469         if (find(callers.begin(), callers.end(), counter) != callers.end()) {
470                 // recursion detected
471                 lyxerr << "Warning: Recursion in label for counter `"
472                        << counter << "' detected"
473                        << endl;
474                 return from_ascii("??");
475         }
476                 
477         CounterList::const_iterator it = counterList_.find(counter); 
478         if (it == counterList_.end())
479                 return from_ascii("#");
480         Counter const & c = it->second;
481
482         docstring ls = translateIfPossible(c.labelString(in_appendix), lang);
483
484         callers.push_back(counter);
485         if (ls.empty()) {
486                 if (!c.master().empty())
487                         ls = flattenLabelString(c.master(), in_appendix, lang, callers) 
488                                 + from_ascii(".");
489                 callers.pop_back();
490                 return ls + from_ascii("\\arabic{") + counter + "}";
491         }
492
493         while (true) {
494                 //lyxerr << "ls=" << to_utf8(ls) << endl;
495                 size_t const i = ls.find(from_ascii("\\the"), 0);
496                 if (i == docstring::npos)
497                         break;
498                 size_t const j = i + 4;
499                 size_t k = j;
500                 while (k < ls.size() && lowercase(ls[k]) >= 'a' 
501                        && lowercase(ls[k]) <= 'z')
502                         ++k;
503                 docstring const newc = ls.substr(j, k - j);
504                 docstring const repl = flattenLabelString(newc, in_appendix,
505                                                           lang, callers);
506                 ls.replace(i, k - j + 4, repl);
507         }
508         callers.pop_back();
509
510         return ls;
511 }
512
513
514 docstring Counters::counterLabel(docstring const & format,
515                                  string const & lang) const
516 {
517         docstring label = format;
518
519         // FIXME: Using regexps would be better, but we compile boost without
520         // wide regexps currently.
521         docstring const the = from_ascii("\\the");
522         while (true) {
523                 //lyxerr << "label=" << label << endl;
524                 size_t const i = label.find(the, 0);
525                 if (i == docstring::npos)
526                         break;
527                 size_t const j = i + 4;
528                 size_t k = j;
529                 while (k < label.size() && lowercase(label[k]) >= 'a' 
530                        && lowercase(label[k]) <= 'z')
531                         ++k;
532                 docstring const newc(label, j, k - j);
533                 label.replace(i, k - i, theCounter(newc, lang));
534         }
535         while (true) {
536                 //lyxerr << "label=" << label << endl;
537
538                 size_t const i = label.find('\\', 0);
539                 if (i == docstring::npos)
540                         break;
541                 size_t const j = label.find('{', i + 1);
542                 if (j == docstring::npos)
543                         break;
544                 size_t const k = label.find('}', j + 1);
545                 if (k == docstring::npos)
546                         break;
547                 docstring const numbertype(label, i + 1, j - i - 1);
548                 docstring const counter(label, j + 1, k - j - 1);
549                 label.replace(i, k + 1 - i, labelItem(counter, numbertype));
550         }
551         //lyxerr << "DONE! label=" << label << endl;
552         return label;
553 }
554
555
556 docstring Counters::prettyCounter(docstring const & name,
557                                string const & lang) const
558 {
559         CounterList::const_iterator it = counterList_.find(name); 
560         if (it == counterList_.end())
561                 return from_ascii("#");
562         Counter const & ctr = it->second;
563
564         docstring const value = theCounter(name, lang);
565         docstring const & format = ctr.prettyFormat();
566         if (format.empty())
567                 return value;
568         return subst(format, from_ascii("##"), value);
569 }
570
571
572 docstring Counters::currentCounter() const
573
574         LASSERT(!counter_stack_.empty(), /* */);
575         return counter_stack_.back(); 
576 }
577
578
579 void Counters::setActiveLayout(Layout const & lay)
580 {
581         LASSERT(!layout_stack_.empty(), return);
582         Layout const * const lastlay = layout_stack_.back();
583         // we want to check whether the layout has changed and, if so,
584         // whether we are coming out of or going into an environment.
585         if (!lastlay) { 
586                 layout_stack_.pop_back();
587                 layout_stack_.push_back(&lay);
588                 if (lay.isEnvironment())
589                         beginEnvironment();
590         } else if (lastlay->name() != lay.name()) {
591                 layout_stack_.pop_back();
592                 layout_stack_.push_back(&lay);
593                 if (lastlay->isEnvironment()) {
594                         // we are coming out of an environment
595                         // LYXERR0("Out: " << lastlay->name());
596                         endEnvironment();
597                 }
598                 if (lay.isEnvironment()) {
599                         // we are going into a new environment
600                         // LYXERR0("In: " << lay.name());
601                         beginEnvironment();
602                 }
603         } 
604 }
605
606
607 void Counters::beginEnvironment()
608 {
609         counter_stack_.push_back(counter_stack_.back());
610 }
611
612
613 void Counters::endEnvironment()
614 {
615         LASSERT(!counter_stack_.empty(), return);
616         counter_stack_.pop_back();
617 }
618
619
620 } // namespace lyx