#include "support/lassert.h"
#include "support/lstrings.h"
#include "support/lyxalgo.h"
-#include "support/types.h"
+#include <algorithm> // sort, lower_bound
#include <functional>
+#include <fstream>
#include <istream>
#include <stack>
#include <vector>
int lineno;
///
string pushTok;
- ///
- char commentChar;
/// used for error messages
string context;
+ ///
+ char commentChar;
private:
/// non-copyable
Pimpl(Pimpl const &);
public:
///
PushedTable()
- : table_elem(0), table_siz(0) {}
+ : table_elem(nullptr), table_siz(0) {}
///
PushedTable(LexerKeyword * ki, int siz)
: table_elem(ki), table_siz(siz) {}
};
-
namespace {
-class CompareTags
- : public binary_function<LexerKeyword, LexerKeyword, bool> {
-public:
- // used by lower_bound, sort and sorted
- bool operator()(LexerKeyword const & a, LexerKeyword const & b) const
- {
- // we use the ascii version, because in turkish, 'i'
- // is not the lowercase version of 'I', and thus
- // turkish locale breaks parsing of tags.
- return compare_ascii_no_case(a.tag, b.tag) < 0;
- }
-};
+// used by lower_bound, sort and sorted
+bool compareTags(LexerKeyword const & a, LexerKeyword const & b)
+{
+ // we use the ascii version, because in turkish, 'i'
+ // is not the lowercase version of 'I', and thus
+ // turkish locale breaks parsing of tags.
+ return compare_ascii_no_case(a.tag, b.tag) < 0;
+}
+
+} // namespace
-} // end of anon namespace
Lexer::Pimpl::Pimpl(LexerKeyword * tab, int num)
{
// Check if the table is sorted and if not, sort it.
if (table
- && !lyx::sorted(table, table + no_items, CompareTags())) {
+ && !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, CompareTags());
+ sort(table, table + no_items, &compareTags);
lyxerr << "\nSorted:" << endl;
printTable(lyxerr);
}
LexerKeyword search_tag = { tag, 0 };
LexerKeyword * res =
lower_bound(table, table + no_items,
- search_tag, CompareTags());
+ 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.
//////////////////////////////////////////////////////////////////////
Lexer::Lexer()
- : pimpl_(new Pimpl(0, 0)), lastReadOk_(false)
+ : pimpl_(new Pimpl(nullptr, 0)), lastReadOk_(false)
{}
break;
if (firstline) {
- size_t i = tmpstr.find_first_not_of(char_type(' '));
+ size_t i = tmpstr.find_first_not_of(from_ascii(" \t"));
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))
- tmpstr.erase(0, prefix.length() - 1);
+ if (!prefix.empty() && prefixIs(tmpstr, prefix))
+ tmpstr.erase(0, prefix.length());
- str += ltrim(tmpstr, "\t") + '\n';
+ str += tmpstr + '\n';
}
if (!pimpl_->is)
// use fail() here. However, our implementation of getString() et al.
// can cause the eof() and fail() bits to be set, even though we
// haven't tried to read 'em.
- return lastReadOk_? this : 0;
+ return lastReadOk_? this : nullptr;
}
}
-void Lexer::setContext(std::string const & str)
+void Lexer::setContext(std::string const & functionName)
{
- pimpl_->context = str;
+ pimpl_->context = functionName;
}