#include "Lexer.h"
-#include "support/debug.h"
-
#include "support/convert.h"
+#include "support/debug.h"
+#include "support/FileName.h"
#include "support/filetools.h"
#include "support/gzstream.h"
#include "support/lstrings.h"
#include "support/lyxalgo.h"
#include "support/types.h"
-#include "support/unicode.h"
-
-#include <boost/noncopyable.hpp>
#include <functional>
#include <istream>
#include <stack>
-#include <sstream>
#include <vector>
using namespace std;
///
-class Lexer::Pimpl : boost::noncopyable {
+class Lexer::Pimpl {
public:
///
Pimpl(keyword_item * tab, int num);
///
char commentChar;
private:
+ /// non-copyable
+ Pimpl(Pimpl const &);
+ void operator=(Pimpl const &);
+
///
void verifyTable();
///
- class pushed_table {
+ class PushedTable {
public:
///
- pushed_table()
+ PushedTable()
: table_elem(0), table_siz(0) {}
///
- pushed_table(keyword_item * ki, int siz)
+ PushedTable(keyword_item * ki, int siz)
: table_elem(ki), table_siz(siz) {}
///
keyword_item * table_elem;
int table_siz;
};
///
- stack<pushed_table> pushed;
+ stack<PushedTable> pushed;
};
namespace {
-class compare_tags
+class CompareTags
: public binary_function<keyword_item, keyword_item, bool> {
public:
// used by lower_bound, sort and sorted
{
// Check if the table is sorted and if not, sort it.
if (table
- && !lyx::sorted(table, table + no_items, compare_tags())) {
+ && !lyx::sorted(table, table + no_items, CompareTags())) {
lyxerr << "The table passed to Lexer is not sorted!\n"
<< "Tell the developers to fix it!" << endl;
// We sort it anyway to avoid problems.
lyxerr << "\nUnsorted:" << endl;
printTable(lyxerr);
- sort(table, table + no_items, compare_tags());
+ sort(table, table + no_items, CompareTags());
lyxerr << "\nSorted:" << endl;
printTable(lyxerr);
}
void Lexer::Pimpl::pushTable(keyword_item * tab, int num)
{
- pushed_table tmppu(table, no_items);
+ PushedTable tmppu(table, no_items);
pushed.push(tmppu);
table = tab;
return;
}
- pushed_table tmp = pushed.top();
+ PushedTable tmp = pushed.top();
pushed.pop();
table = tmp.table_elem;
no_items = tmp.table_siz;
keyword_item search_tag = { tag, 0 };
keyword_item * res =
lower_bound(table, table + no_items,
- search_tag, compare_tags());
+ search_tag, CompareTags());
// use the compare_ascii_no_case instead of compare_no_case,
// because in turkish, 'i' is not the lowercase version of 'I',
// and thus turkish locale breaks parsing of tags.
} while (c >= ' ' && c != '\\' && is);
}
- if (c == '\\') is.putback(c); // put it back
+ if (c == '\\')
+ is.putback(c); // put it back
status = LEX_TOKEN;
}
// explicit tokens (JMarc)
string const Lexer::getLongString(string const & endtoken)
{
- string str, prefix;
+ string str;
+ string prefix;
bool firstline = true;
while (pimpl_->is) { //< eatLine only reads from is, not from pushTok
string tmpstr = getString();
if (firstline) {
- string::size_type i(tmpstr.find_first_not_of(' '));
+ size_t i = tmpstr.find_first_not_of(' ');
if (i != string::npos)
prefix = tmpstr.substr(0, i);
firstline = false;
// further lines in long strings may have the same
// whitespace prefix as the first line. Remove it.
- if (prefix.length() && prefixIs(tmpstr, prefix)) {
+ if (prefix.length() && prefixIs(tmpstr, prefix))
tmpstr.erase(0, prefix.length() - 1);
- }
str += ltrim(tmpstr, "\t") + '\n';
}
- if (!pimpl_->is) {
+ if (!pimpl_->is)
printError("Long string not ended by `" + endtoken + '\'');
- }
return str;
}
}
-/// quotes a string, e.g. for use in preferences files or as an argument of the "log" dialog
+// quotes a string, e.g. for use in preferences files or as an argument
+// of the "log" dialog
string const Lexer::quoteString(string const & arg)
{
- ostringstream os;
- os << '"' << subst(subst(arg, "\\", "\\\\"), "\"", "\\\"") << '"';
- return os.str();
+ string res;
+ res += '"';
+ res += subst(subst(arg, "\\", "\\\\"), "\"", "\\\"");
+ res += '"';
+ return res;
}