lyx_mirror/src/support/lstrings.h

// -*- C++ -*-

/** This is a collection of string helper functions that works
    together with string (and later also with STL String. Some of these
    would certainly benefit from a rewrite/optimization.
*/

#ifndef LSTRINGS_H
#define LSTRINGS_H

#include <cstring>

//#warning verify this please. Lgb
///
template<class T>
size_t lstrlen(T const * t)
{
	Assert(t); // we don't want null pointers
	size_t count = 0;
	T const * r = t;
	while(*r != 0) ++r, ++count;
	return count;
}


//#warning verify this please. Lgb
///
template<class T>
T * lstrchr(T const * t, int c)
{
  Assert(t); // we don't want null pointers
  T * r = const_cast<T*>(t);
  while(*r != 0) 
    if (*r == c) return r; else ++r;
  return 0;
}

#include <cctype>
#include "LString.h"

///
inline 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()) {
		if (tolower(*p) != tolower(*p2))
			return (tolower(*p) < tolower(*p2)) ? -1 : 1;
		++p;
		++p2;
	}

	return s.size() - s2.size();
}

///
inline int compare_no_case(string const & s, string const & s2,
			   unsigned int len)
{
//#warning verify this func please
	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()) {
		if (tolower(*p) != tolower(*p2))
			return (tolower(*p) < tolower(*p2)) ? -1 : 1;
		++i;
		++p;
		++p2;
	}
	return s.size() - s2.size();
}

///
inline int compare(char const * a, char const * b)
{
	return strcmp(a, b);
}

///
inline int compare(char const * a, char const * b, unsigned int len)
{
	return strncmp(a, b, len);
}

///
bool isStrInt(string const & str);

///
int strToInt(string const & str);

///
string lowercase(string const &);

/// int to string
string tostr(int i);

///
string tostr(unsigned int);

/// long to string
string tostr(long l);

///
string tostr(unsigned long l); 

///
string tostr(char c);

/// void* to string
string tostr(void* v);

/// bool to string
string tostr(bool b);

///
string tostr(double d);

/// Does the string start with this prefix?
bool prefixIs(string const &, char const *);

/// Does the string end with this char?
bool suffixIs(string const &, char);

/// Does the string end with this suffix?
bool suffixIs(string const &, char const *);

///
bool contains(char const * a, string const & b);

///
bool contains(string const & a, char const * b);

///
bool contains(string const & a, string const & b);

///
bool contains(char const * a, char const * b);

/// Counts how many of character c there is in a
int countChar(string const & a, char const c);

/** Extracts a token from this string at the nth delim.
  Doesn't modify the original string. Similar to strtok.
  Example:
  #"a;bc;d".token(';', 1) == "bc";#
  #"a;bc;d".token(';', 2) == "d";#
*/
string token(string const & a, char delim, int n);


/** Search a token in this string using the delim.
  Doesn't modify the original string. Returns -1 in case of
  failure. 
  Example:
  #"a;bc;d".tokenPos(';', "bc") == 1;#
  #"a;bc;d".token(';', "d") == 2;#
*/
int tokenPos(string const & a, char delim, string const & tok);


/** Compares a string and a (simple) regular expression
  The only element allowed is "*" for any string of characters
  */
bool regexMatch(string const & a, string const & pattern);

/// Substitute all "oldchar"s with "newchar"
string subst(string const & a, char oldchar, char newchar);

/// Substitutes all instances of oldstr with newstr
string subst(string const & a,
	      char const * oldstr, string const & newstr);

/** Strips characters off the end of a string.
  #"abccc".strip('c') = "ab".#
  */
string strip(string const & a, char const c = ' ');

/** Strips characters of the beginning of a string.
  #"cccba".frontstrip('c') = "ba"#. */
string frontStrip(string const & a, char const c = ' ');

/** Strips characters off the beginning of a string.
    #"ababcdef".frontstrip("ab") = "cdef"# .*/
string frontStrip(string const & a, char const * p);

/** Splits the string by the first delim.
  Splits the string by the first appearance of delim.
  The leading string up to delim is returned in piece (not including
  delim), while the original string is cut from after the delimiter.
  Example:
  #s1=""; s2="a;bc".split(s1, ';') -> s1=="a"; s2 == "bc";#
  */
string split(string const & a, string & piece, char delim);

/// Same as split but does not return a piece
string split(string const & a, char delim);

/// Same as split but uses the last delim.
string rsplit(string const & a, string & piece, char delim);

#endif