mirror of https://github.com/Icinga/icinga2.git
201 lines
6.3 KiB
C++
201 lines
6.3 KiB
C++
/******************************************************************************
|
|
* Icinga 2 *
|
|
* Copyright (C) 2012-2013 Icinga Development Team (http://www.icinga.org/) *
|
|
* *
|
|
* This program is free software; you can redistribute it and/or *
|
|
* modify it under the terms of the GNU General Public License *
|
|
* as published by the Free Software Foundation; either version 2 *
|
|
* of the License, or (at your option) any later version. *
|
|
* *
|
|
* This program is distributed in the hope that it will be useful, *
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
* GNU General Public License for more details. *
|
|
* *
|
|
* You should have received a copy of the GNU General Public License *
|
|
* along with this program; if not, write to the Free Software Foundation *
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. *
|
|
******************************************************************************/
|
|
|
|
#ifndef STRING_H
|
|
#define STRING_H
|
|
|
|
#include "base/i2-base.h"
|
|
#include <boost/range/iterator.hpp>
|
|
#include <ostream>
|
|
#include <istream>
|
|
#include <utility>
|
|
|
|
namespace icinga {
|
|
|
|
class Value;
|
|
|
|
/**
|
|
* String class.
|
|
*
|
|
* Rationale for having this: The std::string class has an ambiguous assignment
|
|
* operator when used in conjunction with the Value class.
|
|
*/
|
|
class I2_BASE_API String
|
|
{
|
|
public:
|
|
typedef std::string::iterator Iterator;
|
|
typedef std::string::const_iterator ConstIterator;
|
|
|
|
typedef std::string::iterator iterator;
|
|
typedef std::string::const_iterator const_iterator;
|
|
|
|
String(void);
|
|
String(const char *data);
|
|
String(const std::string& data);
|
|
String(size_t n, char c);
|
|
|
|
template<typename InputIterator>
|
|
String(InputIterator begin, InputIterator end)
|
|
: m_Data(begin, end)
|
|
{ }
|
|
|
|
String(const String& other);
|
|
|
|
String& operator=(const String& rhs);
|
|
String& operator=(const std::string& rhs);
|
|
String& operator=(const char *rhs);
|
|
|
|
const char& operator[](size_t pos) const;
|
|
char& operator[](size_t pos);
|
|
|
|
String& operator+=(const String& rhs);
|
|
String& operator+=(const char *rhs);
|
|
String& operator+=(const Value& rhs);
|
|
String& operator+=(char rhs);
|
|
|
|
bool IsEmpty(void) const;
|
|
|
|
bool operator<(const String& rhs) const;
|
|
|
|
operator const std::string&(void) const;
|
|
|
|
const char *CStr(void) const;
|
|
void Clear(void);
|
|
size_t GetLength(void) const;
|
|
|
|
std::string& GetData(void);
|
|
|
|
size_t Find(const String& str, size_t pos = 0) const;
|
|
size_t RFind(const String& str, size_t pos = NPos) const;
|
|
size_t FindFirstOf(const char *s, size_t pos = 0) const;
|
|
size_t FindFirstOf(char ch, size_t pos = 0) const;
|
|
size_t FindFirstNotOf(const char *s, size_t pos = 0) const;
|
|
size_t FindFirstNotOf(char ch, size_t pos = 0) const;
|
|
String SubStr(size_t first, size_t len = NPos) const;
|
|
void Replace(size_t first, size_t second, const String& str);
|
|
|
|
void Trim(void);
|
|
|
|
void swap(String& str);
|
|
Iterator erase(Iterator first, Iterator last);
|
|
|
|
template<typename InputIterator>
|
|
void insert(Iterator p, InputIterator first, InputIterator last)
|
|
{
|
|
m_Data.insert(p, first, last);
|
|
}
|
|
|
|
Iterator Begin(void);
|
|
ConstIterator Begin(void) const;
|
|
Iterator End(void);
|
|
ConstIterator End(void) const;
|
|
|
|
static const size_t NPos;
|
|
|
|
private:
|
|
std::string m_Data;
|
|
};
|
|
|
|
I2_BASE_API std::ostream& operator<<(std::ostream& stream, const String& str);
|
|
I2_BASE_API std::istream& operator>>(std::istream& stream, String& str);
|
|
|
|
I2_BASE_API String operator+(const String& lhs, const String& rhs);
|
|
I2_BASE_API String operator+(const String& lhs, const char *rhs);
|
|
I2_BASE_API String operator+(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API bool operator==(const String& lhs, const String& rhs);
|
|
I2_BASE_API bool operator==(const String& lhs, const char *rhs);
|
|
I2_BASE_API bool operator==(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API bool operator!=(const String& lhs, const String& rhs);
|
|
I2_BASE_API bool operator!=(const String& lhs, const char *rhs);
|
|
I2_BASE_API bool operator!=(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API bool operator<(const String& lhs, const char *rhs);
|
|
I2_BASE_API bool operator<(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API bool operator>(const String& lhs, const String& rhs);
|
|
I2_BASE_API bool operator>(const String& lhs, const char *rhs);
|
|
I2_BASE_API bool operator>(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API bool operator<=(const String& lhs, const String& rhs);
|
|
I2_BASE_API bool operator<=(const String& lhs, const char *rhs);
|
|
I2_BASE_API bool operator<=(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API bool operator>=(const String& lhs, const String& rhs);
|
|
I2_BASE_API bool operator>=(const String& lhs, const char *rhs);
|
|
I2_BASE_API bool operator>=(const char *lhs, const String& rhs);
|
|
|
|
I2_BASE_API String::Iterator range_begin(String& x);
|
|
I2_BASE_API String::ConstIterator range_begin(const String& x);
|
|
I2_BASE_API String::Iterator range_end(String& x);
|
|
I2_BASE_API String::ConstIterator range_end(const String& x);
|
|
|
|
struct string_iless : std::binary_function<String, String, bool>
|
|
{
|
|
bool operator()(const String& s1, const String& s2) const
|
|
{
|
|
return strcasecmp(s1.CStr(), s2.CStr()) < 0;
|
|
|
|
/* The "right" way would be to do this - however the
|
|
* overhead is _massive_ due to the repeated non-inlined
|
|
* function calls:
|
|
|
|
return lexicographical_compare(s1.Begin(), s1.End(),
|
|
s2.Begin(), s2.End(), boost::algorithm::is_iless());
|
|
|
|
*/
|
|
}
|
|
};
|
|
|
|
struct pair_string_iless : std::binary_function<std::pair<String, String>, std::pair<String, String>, bool>
|
|
{
|
|
bool operator()(const std::pair<String, String>& p1, const std::pair<String, String>& p2) const
|
|
{
|
|
if (string_iless()(p1.first, p2.first))
|
|
return true;
|
|
|
|
if (string_iless()(p2.first, p1.first))
|
|
return false;
|
|
|
|
return string_iless()(p1.second, p2.second);
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
namespace boost
|
|
{
|
|
|
|
template<>
|
|
struct range_mutable_iterator<icinga::String>
|
|
{
|
|
typedef icinga::String::Iterator type;
|
|
};
|
|
|
|
template<>
|
|
struct range_const_iterator<icinga::String>
|
|
{
|
|
typedef icinga::String::ConstIterator type;
|
|
};
|
|
|
|
}
|
|
|
|
#endif /* STRING_H */
|