+/* This file is part of
+ * ======================================================
+ *
+ * LyX, The Document Processor
+ *
+ * Copyright 1995 Matthias Ettrich
+ * Copyright 1995-2000 The LyX Team.
+ *
+ * ====================================================== */
+
#include <config.h>
+#ifdef __GNUG__
+#pragma implementation
+#endif
+
#include <algorithm>
+
#include <cctype>
-#include <cstdio>
#include <cstdlib>
#include "LString.h"
#include "lstrings.h"
-
-//#include "debug.h"
+#include "LRegex.h"
+#include "LAssert.h"
using std::count;
+using std::transform;
+#ifndef CXX_GLOBAL_CSTD
+using std::tolower;
+using std::toupper;
+#endif
+
+
+int compare_no_case(string const & s, string const & s2)
+{
+ // ANSI C
+ string::const_iterator p = s.begin();
+ string::const_iterator p2 = s2.begin();
+
+ while (p != s.end() && p2 != s2.end()) {
+ int const lc1 = tolower(*p);
+ int const lc2 = 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();
+ string::const_iterator p2 = s2.begin();
+ unsigned int i = 0;
+ while (i < len && p != s.end() && p2 != s2.end()) {
+ int const lc1 = tolower(*p);
+ int const lc2 = tolower(*p2);
+ if (lc1 != lc2)
+ return (lc1 < lc2) ? -1 : 1;
+ ++i;
+ ++p;
+ ++p2;
+ }
+ if (s.size() == s2.size())
+ return 0;
+ if (s.size() < s2.size())
+ return -1;
+ return 1;
+}
+
bool isStrInt(string const & str)
{
if (str.empty()) return false;
// Remove leading and trailing white space chars.
- string tmpstr = frontStrip(strip(str, ' '), ' ');
+ string const tmpstr = frontStrip(strip(str, ' '), ' ');
if (tmpstr.empty()) return false;
string::const_iterator cit = tmpstr.begin();
- if ( (*cit) == '-') ++cit;
- for (; cit != tmpstr.end(); ++cit) {
+ if ((*cit) == '-') ++cit;
+ string::const_iterator end = tmpstr.end();
+ for (; cit != end; ++cit) {
if (!isdigit((*cit))) return false;
}
return true;
}
-int LStr2Int(string const & str)
+bool isStrUnsignedInt(string const & str)
{
- string tmpstr;
+ 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) {
+ if (!isdigit((*cit))) return false;
+ }
+ return true;
+}
+
+int strToInt(string const & str)
+{
if (isStrInt(str)) {
// Remove leading and trailing white space chars.
- tmpstr = frontStrip(strip(str, ' '), ' ');
+ string const tmpstr = frontStrip(strip(str, ' '), ' ');
// Do the conversion proper.
- return atoi(tmpstr.c_str());
- } else
+ return lyx::atoi(tmpstr);
+ } else {
return 0;
+ }
}
-string lowercase(string const & a)
+unsigned int strToUnsignedInt(string const & str)
{
- string tmp;
- string::const_iterator cit = a.begin();
- for(; cit != a.end(); ++cit) {
- tmp += char(tolower(*cit));
+ if (isStrUnsignedInt(str)) {
+ // Remove leading and trailing white space chars.
+ string const tmpstr = frontStrip(strip(str, ' '), ' ');
+ // Do the conversion proper.
+ return lyx::atoi(tmpstr);
+ } else {
+ return 0;
}
- return tmp;
}
-string tostr(long i)
+bool isStrDbl(string const & str)
{
- char str[30];
- sprintf(str, "%ld", i);
- return string(str);
-}
+ if (str.empty()) return false;
+
+ // Remove leading and trailing white space chars.
+ string const tmpstr = frontStrip(strip(str, ' '), ' ');
+ if (tmpstr.empty()) return false;
+ // if (1 < tmpstr.count('.')) return false;
-string tostr(unsigned long i)
-{
- char str[30];
- sprintf(str, "%lu", i);
- return string(str);
+ string::const_iterator cit = tmpstr.begin();
+ bool found_dot(false);
+ if ((*cit) == '-') ++cit;
+ string::const_iterator end = tmpstr.end();
+ for (; cit != end; ++cit) {
+ if (!isdigit((*cit))
+ && '.' != (*cit)) {
+ return false;
+ }
+ if ('.' == (*cit)) {
+ if (found_dot) {
+ return false;
+ } else {
+ found_dot = true;
+ }
+ }
+ }
+ return true;
}
-string tostr(void * v)
+
+double strToDbl(string const & str)
{
- return tostr(long(v));
+ if (isStrDbl(str)) {
+ // Remove leading and trailing white space chars.
+ string const tmpstr = frontStrip(strip(str, ' '), ' ');
+ // Do the conversion proper.
+ return ::atof(tmpstr.c_str());
+ } else {
+ return 0.0;
+ }
}
-string tostr(int i)
-{
- return tostr(long(i));
+char lowercase(char c)
+{
+ return char( tolower(c) );
}
-string tostr(unsigned int ui)
-{
- return tostr(long(ui));
-}
-string tostr(char c)
-{
- return tostr(long(c));
+char uppercase(char c)
+{
+ return char( toupper(c) );
}
-string tostr(bool b)
-{
- return b ? "true" : "false";
-}
-#if 0
-string tostr(float f)
+string const lowercase(string const & a)
{
- return tostr(double(f));
-}
+ 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
+ return tmp;
+}
+
-string tostr(double d)
+string const uppercase(string const & a)
{
- char tmp[40];
- sprintf(tmp, "%f", d);
- return string(tmp);
+ 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
+ return tmp;
}
bool prefixIs(string const & a, char const * pre)
{
- unsigned int l = strlen(pre);
- if (l > a.length() || a.empty())
+ Assert(pre);
+
+ size_t const l = strlen(pre);
+ string::size_type const alen = a.length();
+
+ if (l > alen || a.empty())
return false;
- else
+ else {
+#if !defined(USE_INCLUDED_STRING) && !defined(STD_STRING_IS_GOOD)
+ // Delete this code when the compilers get a bit better.
+ return ::strncmp(a.c_str(), pre, l) == 0;
+#else
+ // This is the code that we really want to use
+ // but until gcc ships with a basic_string that
+ // implements std::string correctly we have to
+ // use the code above.
return a.compare(0, l, pre, l) == 0;
+#endif
+ }
+}
+
+
+bool prefixIs(string const & a, string const & pre)
+{
+ string::size_type const prelen = pre.length();
+ string::size_type const alen = a.length();
+
+ if (prelen > alen || a.empty())
+ return false;
+ else {
+#if !defined(USE_INCLUDED_STRING) && !defined(STD_STRING_IS_GOOD)
+ return ::strncmp(a.c_str(), pre.c_str(), prelen) == 0;
+#else
+ return a.compare(0, prelen, pre) == 0;
+#endif
+ }
}
bool suffixIs(string const & a, char c)
{
if (a.empty()) return false;
- return a[a.length()-1] == c;
+ return a[a.length() - 1] == c;
}
bool suffixIs(string const & a, char const * suf)
{
- unsigned int suflen = strlen(suf);
- if (suflen > a.length())
+ Assert(suf);
+
+ size_t const suflen = strlen(suf);
+ string::size_type const alen = a.length();
+
+ if (suflen > alen)
return false;
else {
- return a.compare(a.length() - suflen, suflen, suf) == 0;
+#if !defined(USE_INCLUDED_STRING) && !defined(STD_STRING_IS_GOOD)
+ // Delete this code when the compilers get a bit better.
+ string tmp(a, alen - suflen);
+ return ::strncmp(tmp.c_str(), suf, suflen) == 0;
+#else
+ // This is the code that we really want to use
+ // but until gcc ships with a basic_string that
+ // implements std::string correctly we have to
+ // use the code above.
+ return a.compare(alen - suflen, suflen, suf) == 0;
+#endif
+ }
+}
+
+
+bool suffixIs(string const & a, string const & suf)
+{
+ string::size_type const suflen = suf.length();
+ string::size_type const alen = a.length();
+
+ if (suflen > alen) {
+ return false;
+ } else {
+#if !defined(USE_INCLUDED_STRING) && !defined(STD_STRING_IS_GOOD)
+ string tmp(a, alen - suflen);
+ return ::strncmp(tmp.c_str(), suf.c_str(), suflen) == 0;
+#else
+ return a.compare(alen - suflen, suflen, suf) == 0;
+#endif
}
}
bool contains(char const * a, string const & b)
{
- if (!a || !*a || b.empty()) return false;
- return strstr(a, b.c_str()) != 0;
+ Assert(a);
+ string const at(a);
+ return contains(at, b);
}
bool contains(string const & a, char const * b)
{
- if (a.empty())
- return false;
- return a.find(b) != string::npos;
+ Assert(b);
+ string const bt(b);
+ return contains(a, bt);
}
bool contains(char const * a, char const * b)
{
- if (!a || !b || !*a || !*b) return false;
- return strstr(a, b) != 0;
+ 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);
+
+ return s.find_first_not_of(cset) == string::npos;
+}
+
+
+bool containsOnly(string const & s, string const & cset)
+{
+ return s.find_first_not_of(cset) == string::npos;
+}
+
+
+bool containsOnly(char const * s, char const * cset)
+{
+ Assert(s && cset);
+
+ return string(s).find_first_not_of(cset) == string::npos;
}
-int countChar(string const & a, char const c)
+bool containsOnly(char const * s, string const & cset)
{
+ Assert(s);
+
+ return string(s).find_first_not_of(cset) == string::npos;
+}
+
+
+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
}
// ale970405+lasgoutt-970425
// rewritten to use new string (Lgb)
-string token(string const & a, char delim, int n)
+string const token(string const & a, char delim, int n)
{
if (a.empty()) return string();
int tokenPos(string const & a, char delim, string const & tok)
{
int i = 0;
- string str = a;
+ string str(a);
string tmptok;
while (!str.empty()) {
str = split(str, tmptok, delim);
- if (tok==tmptok)
+ if (tok == tmptok)
return i;
++i;
}
bool regexMatch(string const & a, string const & pattern)
{
- if (pattern.empty())
- return true;
- if (a.empty())
- return false;
-
- string::size_type si=0, pi=0;
- string::size_type const sl = a.length();
- string::size_type const pl = pattern.length();
-
- while (si < sl && pi < pl) {
- if (pattern[pi]=='*') {
- // Skip all consequtive *s
- while (pattern[pi] == '*') {
- ++pi;
- if (pi == pl)
- return true;
- }
-
- // Get next chunk of pattern to match
- string chunk;
- string temp =
- split(pattern.substr(pi, pl-1), chunk, '*');
-
- if (!chunk.empty() && pattern[pl-1] == '*' &&
- temp.empty())
- temp = '*';
-
- if (temp.empty()) {
- // Last chunk, see if tail matches
- if (sl < chunk.length()) {
- return false;
- }
- temp = a.substr(sl - chunk.length(), sl - 1);
- return temp == chunk;
- } else {
- // Middle chunk, see if we can find a match
- bool match = false;
- while (!match && si<sl) {
- temp = a.substr(si, sl - 1);
- match = prefixIs(temp, chunk.c_str());
- ++si;
- };
- if (!match)
- return false;
- si += chunk.length()-1;
- pi += chunk.length();
- if (si==sl && pi==pl-1)
- return true;
- }
- } else if (a[si++] != pattern[pi++]) {
- return false;
- }
- }
- if (pi < pl || si < sl)
- return false;
- return true;
+ // We massage the pattern a bit so that the usual
+ // shell pattern we all are used to will work.
+ // One nice thing about using a real regex is that
+ // things like "*.*[^~]" will work also.
+ // build the regex string.
+ string regex(pattern);
+ regex = subst(regex, ".", "\\.");
+ regex = subst(regex, "*", ".*");
+ LRegex reg(regex);
+ return reg.exact_match(a);
}
-string subst(string const & a, char oldchar, char newchar)
+string const subst(string const & a, char oldchar, char newchar)
{
- string tmp = a;
+ string tmp(a);
string::iterator lit = tmp.begin();
- for(; lit != tmp.end(); ++lit)
+ string::iterator end = tmp.end();
+ for (; lit != end; ++lit)
if ((*lit) == oldchar)
(*lit) = newchar;
return tmp;
}
-string subst(string const & a,
- char const * oldstr, string const & newstr)
+string const subst(string const & a,
+ char const * oldstr, string const & newstr)
+{
+ Assert(oldstr);
+
+ string lstr(a);
+ string::size_type i = 0;
+ string::size_type olen = strlen(oldstr);
+ 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.
+ }
+ return lstr;
+}
+
+
+string const subst(string const & a,
+ string const & oldstr, string const & newstr)
{
string lstr(a);
string::size_type i = 0;
- int olen = strlen(oldstr);
+ string::size_type const olen = oldstr.length();
while((i = lstr.find(oldstr, i)) != string::npos) {
lstr.replace(i, olen, newstr);
i += newstr.length(); // We need to be sure that we dont
}
-string strip(string const & a, char const c)
+string const strip(string const & a, char c)
{
if (a.empty()) return a;
- string tmp = a;
+ 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)
}
-string frontStrip(string const & a, char const * p)
+string const frontStrip(string const & a, char const * p)
{
- if (a.empty() || !p || !*p) return a;
- string tmp = a;
+ Assert(p);
+
+ if (a.empty() || !*p) return a;
+ string tmp(a);
string::size_type i = tmp.find_first_not_of(p);
if (i > 0)
tmp.erase(0, i);
}
-string frontStrip(string const & a, char const c)
+string const frontStrip(string const & a, char c)
{
if (a.empty()) return a;
- string tmp = a;
+ string tmp(a);
string::size_type i = tmp.find_first_not_of(c);
if (i > 0)
tmp.erase(0, i);
}
-string split(string const & a, string & piece, char delim)
+string const split(string const & a, string & piece, char delim)
{
string tmp;
string::size_type i = a.find(delim);
}
-string split(string const & a, char delim)
+string const split(string const & a, char delim)
{
string tmp;
string::size_type i = a.find(delim);
// ale970521
-string rsplit(string const & a, string & piece, char delim)
+string const rsplit(string const & a, string & piece, char delim)
{
string tmp;
string::size_type i = a.rfind(delim);
projects / lyx.git / blobdiff