/* This file is part of
- * ======================================================
- *
+ * ======================================================
+ *
* LyX, The Document Processor
- *
+ *
* Copyright 1995 Matthias Ettrich
- * Copyright 1995-2000 The LyX Team.
+ * Copyright 1995-2001 The LyX Team.
*
* ====================================================== */
#pragma implementation
#endif
+#include "LString.h"
+#include "lstrings.h"
+#include "LAssert.h"
+#include "debug.h"
+
+#include <boost/regex.hpp>
+
#include <algorithm>
#include <cctype>
#include <cstdlib>
-#include "LString.h"
-#include "lstrings.h"
-#include "LRegex.h"
-#include "LAssert.h"
-
using std::count;
using std::transform;
+using std::vector;
+
#ifndef CXX_GLOBAL_CSTD
+using std::atof;
+using std::isdigit;
+using std::strlen;
using std::tolower;
using std::toupper;
#endif
}
+namespace {
+ int ascii_tolower(int c) {
+ if (c >= 'A' && c <= 'Z')
+ return c - 'A' + 'a';
+ return c;
+ }
+}
+
+
+int compare_ascii_no_case(string const & s, string const & s2)
+{
+ string::const_iterator p = s.begin();
+ string::const_iterator p2 = s2.begin();
+
+ while (p != s.end() && p2 != s2.end()) {
+ int const lc1 = ascii_tolower(*p);
+ int const lc2 = ascii_tolower(*p2);
+ if (lc1 != lc2)
+ return (lc1 < lc2) ? -1 : 1;
+ ++p;
+ ++p2;
+ }
+
+ if (s.size() == s2.size())
+ return 0;
+ if (s.size() < s2.size())
+ return -1;
+ return 1;
+}
+
+
int compare_no_case(string const & s, string const & s2, unsigned int len)
{
string::const_iterator p = s.begin();
bool isStrInt(string const & str)
{
if (str.empty()) return false;
-
+
// Remove leading and trailing white space chars.
string const tmpstr = frontStrip(strip(str, ' '), ' ');
if (tmpstr.empty()) return false;
-
+
string::const_iterator cit = tmpstr.begin();
if ((*cit) == '-') ++cit;
string::const_iterator end = tmpstr.end();
bool isStrUnsignedInt(string const & str)
{
if (str.empty()) return false;
-
+
// Remove leading and trailing white space chars.
string const tmpstr = frontStrip(strip(str, ' '), ' ');
if (tmpstr.empty()) return false;
-
+
string::const_iterator cit = tmpstr.begin();
string::const_iterator end = tmpstr.end();
for (; cit != end; ++cit) {
bool isStrDbl(string const & str)
{
if (str.empty()) return false;
-
+
// Remove leading and trailing white space chars.
string const tmpstr = frontStrip(strip(str, ' '), ' ');
if (tmpstr.empty()) return false;
}
-char lowercase(char c)
-{
- return char( tolower(c) );
+char lowercase(char c)
+{
+ return char(tolower(c));
}
-char uppercase(char c)
-{
- return char( toupper(c) );
+char uppercase(char c)
+{
+ return char(toupper(c));
}
+namespace {
+
+// since we cannot use std::tolower and std::toupper directly in the
+// calls to std::transform yet, we use these helper clases. (Lgb)
+
+struct local_lowercase {
+ char operator()(char c) const {
+ return tolower(c);
+ }
+};
+
+struct local_uppercase {
+ char operator()(char c) const {
+ return toupper(c);
+ }
+};
+
+} // end of anon namespace
+
string const lowercase(string const & a)
{
string tmp(a);
-#if 1
- string::iterator result = tmp.begin();
- string::iterator end = tmp.end();
- for (string::iterator first = tmp.begin();
- first != end; ++first, ++result) {
- *result = lowercase(*first);
- }
-#else
- // We want to use this one. (Lgb)
- transform(tmp.begin(), tmp.end(), tmp.begin(), lowercase);
-#endif
+ transform(tmp.begin(), tmp.end(), tmp.begin(), local_lowercase());
return tmp;
}
-
string const uppercase(string const & a)
{
string tmp(a);
-#if 1
- string::iterator result = tmp.begin();
- string::iterator end = tmp.end();
- for (string::iterator first = tmp.begin();
- first != end; ++first, ++result) {
- *result = uppercase(*first);
- }
-#else
- // We want to use this one. (Lgb)
- transform(tmp.begin(), tmp.end(), tmp.begin(), uppercase);
-#endif
+ transform(tmp.begin(), tmp.end(), tmp.begin(), local_uppercase());
return tmp;
}
bool prefixIs(string const & a, char const * pre)
{
- Assert(pre);
-
+ lyx::Assert(pre);
+
size_t const l = strlen(pre);
string::size_type const alen = a.length();
-
+
if (l > alen || a.empty())
return false;
else {
{
string::size_type const prelen = pre.length();
string::size_type const alen = a.length();
-
+
if (prelen > alen || a.empty())
return false;
else {
bool suffixIs(string const & a, char const * suf)
{
- Assert(suf);
-
+ lyx::Assert(suf);
+
size_t const suflen = strlen(suf);
string::size_type const alen = a.length();
-
+
if (suflen > alen)
return false;
else {
{
string::size_type const suflen = suf.length();
string::size_type const alen = a.length();
-
+
if (suflen > alen) {
return false;
} else {
bool contains(char const * a, string const & b)
{
- Assert(a);
+ lyx::Assert(a);
string const at(a);
return contains(at, b);
}
bool contains(string const & a, char const * b)
{
- Assert(b);
+ lyx::Assert(b);
string const bt(b);
return contains(a, bt);
}
}
+bool contains(string const & a, char b)
+{
+ if (a.empty())
+ return false;
+ return a.find(b) != string::npos;
+}
+
+
bool contains(char const * a, char const * b)
{
- Assert(a && b);
+ lyx::Assert(a && b);
string const at(a);
string const bt(b);
return contains(at, bt);
bool containsOnly(string const & s, char const * cset)
{
- Assert(cset);
-
+ lyx::Assert(cset);
+
return s.find_first_not_of(cset) == string::npos;
}
bool containsOnly(char const * s, char const * cset)
{
- Assert(s && cset);
-
+ lyx::Assert(s && cset);
+
return string(s).find_first_not_of(cset) == string::npos;
}
bool containsOnly(char const * s, string const & cset)
{
- Assert(s);
-
- return string(s).find_first_not_of(cset) == string::npos;
-}
+ lyx::Assert(s);
-
-string::size_type countChar(string const & a, char c)
-{
-#ifdef HAVE_STD_COUNT
- return count(a.begin(), a.end(), c);
-#else
- unsigned int n = 0;
- count(a.begin(), a.end(), c, n);
- return n;
-#endif
+ return string(s).find_first_not_of(cset) == string::npos;
}
string const token(string const & a, char delim, int n)
{
if (a.empty()) return string();
-
+
string::size_type k = 0;
string::size_type i = 0;
string regex(pattern);
regex = subst(regex, ".", "\\.");
regex = subst(regex, "*", ".*");
- LRegex reg(regex);
- return reg.exact_match(a);
+ boost::regex reg(regex);
+ return boost::regex_match(a, reg);
}
string const subst(string const & a,
- char const * oldstr, string const & newstr)
+ char const * oldstr, string const & newstr)
{
- Assert(oldstr);
-
+ lyx::Assert(oldstr);
+
string lstr(a);
string::size_type i = 0;
string::size_type olen = strlen(oldstr);
- while((i = lstr.find(oldstr, i)) != string::npos) {
+ while ((i = lstr.find(oldstr, i)) != string::npos) {
lstr.replace(i, olen, newstr);
i += newstr.length(); // We need to be sure that we dont
// use the same i over and over again.
string lstr(a);
string::size_type i = 0;
string::size_type const olen = oldstr.length();
- while((i = lstr.find(oldstr, i)) != string::npos) {
+ while ((i = lstr.find(oldstr, i)) != string::npos) {
lstr.replace(i, olen, newstr);
i += newstr.length(); // We need to be sure that we dont
// use the same i over and over again.
string tmp(a);
string::size_type i = tmp.find_last_not_of(c);
if (i == a.length() - 1) return tmp; // no c's at end of a
- if (i != string::npos)
+ if (i != string::npos)
tmp.erase(i + 1, string::npos);
+#if !defined(USE_INCLUDED_STRING) && !defined(STD_STRING_IS_GOOD)
+ /// Needed for broken string::find_last_not_of
+ else if (tmp[0] != c) {
+ if (a.length() == 1) return tmp;
+ tmp.erase(1, string::npos);
+ }
+#endif
else
tmp.erase(); // only c in the whole string
return tmp;
string const frontStrip(string const & a, char const * p)
{
- Assert(p);
-
+ lyx::Assert(p);
+
if (a.empty() || !*p) return a;
string tmp(a);
string::size_type i = tmp.find_first_not_of(p);
}
return tmp;
}
+
+
+// This function escapes 8-bit characters and other problematic
+// characters that cause problems in latex labels.
+string const escape(string const & lab)
+{
+ char hexdigit[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
+ '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' };
+ string enc;
+ for (string::size_type i = 0; i < lab.length(); ++i) {
+ unsigned char c= lab[i];
+ if (c >= 128 || c == '=' || c == '%') {
+ enc += '=';
+ enc += hexdigit[c>>4];
+ enc += hexdigit[c & 15];
+ } else {
+ enc += c;
+ }
+ }
+ return enc;
+}
+
+
+/// gives a vector of stringparts which have the delimiter delim
+vector<string> const getVectorFromString(string const & str,
+ string const & delim)
+{
+ vector<string> vec;
+ if (str.empty())
+ return vec;
+ string keys(strip(str));
+ for(;;) {
+ string::size_type const idx = keys.find(delim);
+ if (idx == string::npos) {
+ vec.push_back(frontStrip(keys));
+ break;
+ }
+ string const key = strip(frontStrip(keys.substr(0, idx)));
+ if (!key.empty())
+ vec.push_back(key);
+ string::size_type const start = idx + delim.size();
+ keys = keys.substr(start);
+ }
+ return vec;
+}
+
+// the same vice versa
+string const getStringFromVector(vector<string> const & vec,
+ string const & delim)
+{
+ string str;
+ int i = 0;
+ for (vector<string>::const_iterator it = vec.begin();
+ it != vec.end(); ++it) {
+ string item = strip(frontStrip(*it));
+ if (item.empty()) continue;
+
+ if (i++ > 0) str += delim;
+ str += item;
+ }
+ return str;
+}
projects / lyx.git / blobdiff