* This file is part of LyX, the document processor.
* Licence details can be found in the file COPYING.
*
- * \author Lars Gullik Bjønnes
+ * \author Lars Gullik Bjønnes
* \author Martin Vermeer
- * \author André Pönitz
+ * \author André Pönitz
* \author Richard Heck (roman numerals)
*
* Full author contact details are available in file CREDITS.
#include <config.h>
#include "Counters.h"
+#include "Lexer.h"
#include "support/convert.h"
#include "support/debug.h"
+#include "support/lassert.h"
#include "support/lstrings.h"
-#include <boost/assert.hpp>
-
+#include <algorithm>
#include <sstream>
using namespace std;
}
+bool Counter::read(Lexer & lex)
+{
+ enum {
+ CT_WITHIN = 1,
+ CT_LABELSTRING,
+ CT_LABELSTRING_APPENDIX,
+ CT_END
+ };
+
+ LexerKeyword counterTags[] = {
+ { "end", CT_END },
+ { "labelstring", CT_LABELSTRING },
+ { "labelstringappendix", CT_LABELSTRING_APPENDIX },
+ { "within", CT_WITHIN }
+ };
+
+ lex.pushTable(counterTags);
+
+ bool getout = false;
+ while (!getout && lex.isOK()) {
+ int le = lex.lex();
+ switch (le) {
+ case Lexer::LEX_UNDEF:
+ lex.printError("Unknown counter tag `$$Token'");
+ continue;
+ default:
+ break;
+ }
+ switch (le) {
+ case CT_WITHIN:
+ lex.next();
+ master_ = lex.getDocString();
+ if (master_ == "none")
+ master_.erase();
+ break;
+ case CT_LABELSTRING:
+ lex.next();
+ labelstring_ = lex.getDocString();
+ labelstringappendix_ = labelstring_;
+ break;
+ case CT_LABELSTRING_APPENDIX:
+ lex.next();
+ labelstringappendix_ = lex.getDocString();
+ break;
+ case CT_END:
+ getout = true;
+ break;
+ }
+ }
+
+ // Here if have a full counter if getout == true
+ if (!getout)
+ LYXERR0("No End tag found for counter!");
+ lex.popTable();
+ return getout;
+}
+
void Counter::set(int v)
{
value_ = v;
}
-docstring const & Counter::labelString() const
+docstring const & Counter::labelString(bool in_appendix) const
+{
+ return in_appendix ? labelstringappendix_ : labelstring_;
+}
+
+
+docstring const & Counter::flatLabelString(bool in_appendix) const
{
- return labelstring_;
+ return in_appendix ? flatlabelstringappendix_ : flatlabelstring_;
}
-docstring const & Counter::labelStringAppendix() const
+void Counter::setFlatLabelStrings(docstring const & fls, docstring const & flsa)
{
- return labelstringappendix_;
+ flatlabelstring_ = fls;
+ flatlabelstringappendix_ = flsa;
}
<< endl;
return;
}
- counterList[newc] = Counter(masterc, ls, lsa);
+ counterList_[newc] = Counter(masterc, ls, lsa);
}
bool Counters::hasCounter(docstring const & c) const
{
- return counterList.find(c) != counterList.end();
+ return counterList_.find(c) != counterList_.end();
+}
+
+
+bool Counters::read(Lexer & lex, docstring const & name)
+{
+ if (hasCounter(name)) {
+ LYXERR(Debug::TCLASS, "Reading existing counter " << to_utf8(name));
+ return counterList_[name].read(lex);
+ }
+ LYXERR(Debug::TCLASS, "Reading new counter " << to_utf8(name));
+ Counter cnt;
+ bool success = cnt.read(lex);
+ if (success)
+ counterList_[name] = cnt;
+ else
+ LYXERR0("Error reading counter `" << name << "'!");
+ return success;
}
void Counters::set(docstring const & ctr, int const val)
{
- CounterList::iterator const it = counterList.find(ctr);
- if (it == counterList.end()) {
+ CounterList::iterator const it = counterList_.find(ctr);
+ if (it == counterList_.end()) {
lyxerr << "set: Counter does not exist: "
<< to_utf8(ctr) << endl;
return;
void Counters::addto(docstring const & ctr, int const val)
{
- CounterList::iterator const it = counterList.find(ctr);
- if (it == counterList.end()) {
+ CounterList::iterator const it = counterList_.find(ctr);
+ if (it == counterList_.end()) {
lyxerr << "addto: Counter does not exist: "
<< to_utf8(ctr) << endl;
return;
int Counters::value(docstring const & ctr) const
{
- CounterList::const_iterator const cit = counterList.find(ctr);
- if (cit == counterList.end()) {
+ CounterList::const_iterator const cit = counterList_.find(ctr);
+ if (cit == counterList_.end()) {
lyxerr << "value: Counter does not exist: "
<< to_utf8(ctr) << endl;
return 0;
void Counters::step(docstring const & ctr)
{
- CounterList::iterator it = counterList.find(ctr);
- if (it == counterList.end()) {
+ CounterList::iterator it = counterList_.find(ctr);
+ if (it == counterList_.end()) {
lyxerr << "step: Counter does not exist: "
<< to_utf8(ctr) << endl;
return;
}
it->second.step();
- it = counterList.begin();
- CounterList::iterator const end = counterList.end();
+ it = counterList_.begin();
+ CounterList::iterator const end = counterList_.end();
for (; it != end; ++it) {
if (it->second.master() == ctr) {
it->second.reset();
appendix_ = false;
subfloat_ = false;
current_float_.erase();
- CounterList::iterator it = counterList.begin();
- CounterList::iterator const end = counterList.end();
+ CounterList::iterator it = counterList_.begin();
+ CounterList::iterator const end = counterList_.end();
+ std::vector<docstring> callers;
for (; it != end; ++it) {
it->second.reset();
+ // Compute the explicit counter labels without any
+ // \thexxx strings, in order to avoid recursion.
+ // It only needs to be done when the textclass is
+ // updated, but in practice the extra work is probably
+ // not noticeable (JMarc)
+ docstring const fls = flattenLabelString(it->first, false, callers);
+ docstring const flsa = flattenLabelString(it->first, true, callers);
+ it->second.setFlatLabelStrings(fls, flsa);
}
}
void Counters::reset(docstring const & match)
{
- BOOST_ASSERT(!match.empty());
+ LASSERT(!match.empty(), /**/);
- CounterList::iterator it = counterList.begin();
- CounterList::iterator end = counterList.end();
+ CounterList::iterator it = counterList_.begin();
+ CounterList::iterator end = counterList_.end();
for (; it != end; ++it) {
if (it->first.find(match) != string::npos)
it->second.reset();
void Counters::copy(Counters & from, Counters & to, docstring const & match)
{
- CounterList::iterator it = counterList.begin();
- CounterList::iterator end = counterList.end();
+ CounterList::iterator it = counterList_.begin();
+ CounterList::iterator end = counterList_.end();
for (; it != end; ++it) {
if (it->first.find(match) != string::npos || match == "") {
to.set(it->first, from.value(it->first));
docstring Counters::labelItem(docstring const & ctr,
- docstring const & numbertype)
+ docstring const & numbertype) const
{
- CounterList::const_iterator const cit = counterList.find(ctr);
- if (cit == counterList.end()) {
+ CounterList::const_iterator const cit = counterList_.find(ctr);
+ if (cit == counterList_.end()) {
lyxerr << "Counter "
<< to_utf8(ctr)
<< " does not exist." << endl;
}
-docstring Counters::theCounter(docstring const & counter)
+docstring Counters::theCounter(docstring const & counter) const
{
- std::set<docstring> callers;
- return theCounter(counter, callers);
+ CounterList::const_iterator it = counterList_.find(counter);
+ if (it == counterList_.end())
+ return from_ascii("??");
+ return counterLabel(it->second.flatLabelString(appendix()));
}
-docstring Counters::theCounter(docstring const & counter,
- std::set<docstring> & callers)
-{
- if (!hasCounter(counter))
- return from_ascii("??");
+docstring Counters::flattenLabelString(docstring const & counter,
+ bool in_appendix,
+ vector<docstring> & callers) const
+{
docstring label;
- if (callers.find(counter) == callers.end()) {
+ if (find(callers.begin(), callers.end(), counter) != callers.end()) {
+ // recursion detected
+ lyxerr << "Warning: Recursion in label for counter `"
+ << counter << "' detected"
+ << endl;
+ return from_ascii("??");
+ }
- pair<std::set<docstring>::iterator, bool> result = callers.insert(counter);
+ CounterList::const_iterator it = counterList_.find(counter);
+ if (it == counterList_.end())
+ return from_ascii("??");
+ Counter const & c = it->second;
- Counter const & c = counterList[counter];
- docstring ls = appendix() ? c.labelStringAppendix() : c.labelString();
+ docstring ls = c.labelString(in_appendix);
- if (ls.empty()) {
- if (!c.master().empty())
- ls = from_ascii("\\the") + c.master() + from_ascii(".");
- ls += from_ascii("\\arabic{") + counter + "}";
- }
-
- label = counterLabel(ls, &callers);
+ callers.push_back(counter);
+ if (ls.empty()) {
+ if (!c.master().empty())
+ ls = flattenLabelString(c.master(), in_appendix, callers)
+ + from_ascii(".");
+ callers.pop_back();
+ return ls + from_ascii("\\arabic{") + counter + "}";
+ }
- callers.erase(result.first);
- } else {
- // recursion detected
- lyxerr << "Warning: Recursion in label for counter `"
- << counter << "' detected"
- << endl;
+ while (true) {
+ //lyxerr << "ls=" << to_utf8(ls) << endl;
+ size_t const i = ls.find(from_ascii("\\the"), 0);
+ if (i == docstring::npos)
+ break;
+ size_t const j = i + 4;
+ size_t k = j;
+ while (k < ls.size() && lowercase(ls[k]) >= 'a'
+ && lowercase(ls[k]) <= 'z')
+ ++k;
+ docstring const newc = ls.substr(j, k - j);
+ docstring const repl = flattenLabelString(newc, in_appendix, callers);
+ ls.replace(i, k - j + 4, repl);
}
+ callers.pop_back();
- return label;
+ return ls;
}
-docstring Counters::counterLabel(docstring const & format,
- std::set<docstring> * callers)
+docstring Counters::counterLabel(docstring const & format) const
{
docstring label = format;
// FIXME: Using regexps would be better, but we compile boost without
// wide regexps currently.
-
while (true) {
//lyxerr << "label=" << to_utf8(label) << endl;
size_t const i = label.find(from_ascii("\\the"), 0);
if (i == docstring::npos)
break;
- size_t j = i + 4;
+ size_t const j = i + 4;
size_t k = j;
while (k < label.size() && lowercase(label[k]) >= 'a'
&& lowercase(label[k]) <= 'z')
++k;
- docstring counter = label.substr(j, k - j);
- docstring repl = callers? theCounter(counter, *callers):
- theCounter(counter);
+ docstring const newc = label.substr(j, k - j);
+ docstring const repl = theCounter(newc);
label.replace(i, k - j + 4, repl);
}
-
while (true) {
//lyxerr << "label=" << to_utf8(label) << endl;