acl/lib_acl_cpp/src/stdlib/string.cpp

1582 lines
28 KiB
C++
Raw Normal View History

2014-11-19 00:25:21 +08:00
#include "acl_stdafx.hpp"
#ifndef ACL_PREPARE_COMPILE
2014-11-19 00:25:21 +08:00
#include <utility>
#include <stdarg.h>
2015-11-09 22:11:21 +08:00
#include "acl_cpp/stdlib/dbuf_pool.hpp"
2014-11-19 00:25:21 +08:00
#include "acl_cpp/stdlib/string.hpp"
#endif
2014-11-19 00:25:21 +08:00
#define ALLOC(n) acl_vstring_alloc((n))
#define FREE(x) acl_vstring_free((x))
#define STR(x) acl_vstring_str((x))
#define LEN(x) ACL_VSTRING_LEN((x))
#define CAP(x) ACL_VSTRING_SIZE((x))
#define ADDCH(x, ch) ACL_VSTRING_ADDCH((x), (ch))
#define MCP(to, from, n) acl_vstring_memcpy((to), (from), (n))
2014-11-19 00:25:21 +08:00
#define MCAT(x, from, n) acl_vstring_memcat((x), (from), (n))
#define SCP(x, from) acl_vstring_strcpy((x), (from))
#define SCAT(x, from) acl_vstring_strcat((x), (from))
#define RSET(x) ACL_VSTRING_RESET((x))
#define TERM(x) ACL_VSTRING_TERMINATE((x))
#define AT(x, n) acl_vstring_charat((x), (n))
#define END(x) acl_vstring_end((x))
namespace acl {
void string::init(size_t len)
{
if (len < 1)
len = 1;
vbf_ = ALLOC(len);
list_tmp_ = NULL;
vector_tmp_ = NULL;
pair_tmp_ = NULL;
scan_ptr_ = NULL;
line_state_ = NULL;
line_state_offset_ = 0;
2014-11-19 00:25:21 +08:00
}
string::string(size_t len /* = 64 */, bool bin /* = false */)
: use_bin_(bin)
{
init(len);
}
string::string(const string& s) : use_bin_(false)
{
init(s.length() + 1);
MCP(vbf_, STR(s.vbf_), LEN(s.vbf_));
TERM(vbf_);
}
string::string(const char* s) : use_bin_(false)
{
size_t len = strlen(s);
init(len + 1);
MCP(vbf_, s, len);
TERM(vbf_);
}
string::string(const void* s, size_t n) : use_bin_(false)
{
init(n + 1);
if (n > 0)
MCP(vbf_, (const char*) s, n);
TERM(vbf_);
}
string::string(ACL_FILE_HANDLE fd, size_t max, size_t n)
{
if (n < 1)
n = 1;
if (fd >= 0)
vbf_ = acl_vstring_mmap_alloc(fd, max, n);
else
vbf_ = ALLOC(n);
list_tmp_ = NULL;
vector_tmp_ = NULL;
pair_tmp_ = NULL;
scan_ptr_ = NULL;
line_state_ = NULL;
line_state_offset_ = 0;
}
2014-11-19 00:25:21 +08:00
string::~string()
{
FREE(vbf_);
delete list_tmp_;
delete vector_tmp_;
delete pair_tmp_;
if (line_state_)
acl_line_state_free(line_state_);
2014-11-19 00:25:21 +08:00
}
string& string::set_bin(bool bin)
{
use_bin_ = bin;
return *this;
}
bool string::get_bin() const
{
return use_bin_;
}
string& string::set_max(int max)
{
vbf_->maxlen = max;
return *this;
}
int string::get_max(void) const
{
return vbf_->maxlen;
}
char string::operator [](size_t n) const
{
acl_assert(n < LEN(vbf_));
return AT(vbf_, n);
}
char string::operator [](int n) const
{
acl_assert(n < (int) LEN(vbf_) && n >= 0);
return AT(vbf_, n);
}
char& string::operator [](size_t n)
{
// <20><>ƫ<EFBFBD><C6AB>λ<EFBFBD>ô<EFBFBD><C3B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ռ<EFBFBD><D5BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>λ<EFBFBD>ã<EFBFBD><C3A3><EFBFBD>Ҫ<EFBFBD><D2AA><EFBFBD>·<EFBFBD><C2B7><EFBFBD><EFBFBD>ڴ<EFBFBD>
if (n >= (size_t) CAP(vbf_))
{
int len = CAP(vbf_);
space(n + 1);
int new_len = CAP(vbf_);
// <20><>ʼ<EFBFBD><CABC><EFBFBD>·<EFBFBD><C2B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڴ<EFBFBD>
if (new_len > len)
memset(END(vbf_), 0, new_len - len);
// <20><> vbf_->vbuf.ptr ָ<><D6B8> n <20>ֽڴ<D6BD><DAB4><EFBFBD>ͬʱ<CDAC>޸<EFBFBD> vbf_->vbuf.cnt ֵ
ACL_VSTRING_AT_OFFSET(vbf_, (int) n);
2014-11-19 00:25:21 +08:00
}
// <20><>ƫ<EFBFBD><C6AB>λ<EFBFBD>ô<EFBFBD><C3B4>ڵ<EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD>ݳ<EFBFBD><DDB3><EFBFBD>ʱ<EFBFBD><CAB1>ͨ<EFBFBD><CDA8><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8>λ<EFBFBD><CEBB><EFBFBD><EFBFBD><EFBFBD>޸<EFBFBD><DEB8><EFBFBD><EFBFBD>ݳ<EFBFBD><DDB3>ȣ<EFBFBD>
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> length() <20><><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD>Ի<EFBFBD><D4BB>ó<EFBFBD><C3B3><EFBFBD>
else if (n >= LEN(vbf_))
{
ACL_VSTRING_AT_OFFSET(vbf_, (int) n);
2014-11-19 00:25:21 +08:00
// <20><>Ϊ<EFBFBD><CEAA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƫ<EFBFBD><C6AB>λ<EFBFBD><CEBB> n <20><><EFBFBD>ĵ<EFBFBD>ַ<EFBFBD><D6B7><EFBFBD>ú󣬵<C3BA><F3A3ACB5><EFBFBD><EFBFBD>߶Դ<DFB6><D4B4><EFBFBD><EFBFBD><EFBFBD>
// <20><>ַ<EFBFBD><D6B7>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʹ<EFBFBD><CAB9><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݳ<EFBFBD><DDB3><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӣ<EFBFBD><D3A3><EFBFBD><EFBFBD>Դ˴<D4B4><CBB4>ں<EFBFBD><DABA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// ǰ<><C7B0><EFBFBD><EFBFBD> ADDCH <20><EFBFBD>ڵ<EFBFBD><DAB5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ⲿ<EFBFBD><E2B2BF>ֵ<EFBFBD><D6B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݳ<EFBFBD><DDB3>ȼ<EFBFBD> 1
ADDCH(vbf_, '\0');
// <20><>֤<EFBFBD><D6A4><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ֽ<EFBFBD>Ϊ \0
TERM(vbf_);
}
return (char&) (vbf_->vbuf.data[n]);
}
char& string::operator [](int n)
{
acl_assert(n >= 0);
#if 1
return (*this)[(size_t) n];
#else
if (n >= CAP(vbf_))
{
int len = CAP(vbf_);
printf("%d: cap1: %d\n", __LINE__, CAP(vbf_));
space(n + 1);
printf("%d: cap2: %d\n", __LINE__, CAP(vbf_));
int new_len = CAP(vbf_);
// <20><>ʼ<EFBFBD><CABC><EFBFBD>·<EFBFBD><C2B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڴ<EFBFBD>
if (new_len > len)
memset(END(vbf_), 0, new_len - len);
// <20><> vbf_->vbuf.ptr ָ<><D6B8> n <20>ֽڴ<D6BD><DAB4><EFBFBD>ͬʱ<CDAC>޸<EFBFBD> vbf_->vbuf.cnt ֵ
ACL_VSTRING_AT_OFFSET(vbf_, n);
}
else if (n >= (int) LEN(vbf_))
{
ACL_VSTRING_AT_OFFSET(vbf_, n);
ADDCH(vbf_, '\0');
TERM(vbf_);
}
return (char&) (vbf_->vbuf.data[n]);
#endif
}
string& string::operator =(const char* s)
{
SCP(vbf_, s);
return *this;
}
string& string::operator =(const string& s)
{
MCP(vbf_, STR(s.vbf_), LEN(s.vbf_));
TERM(vbf_);
return *this;
}
string& string::operator =(const string* s)
{
MCP(vbf_, STR(s->vbf_), LEN(s->vbf_));
TERM(vbf_);
return *this;
}
string& string::operator =(acl_int64 n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%lld", n);
}
string& string::operator =(acl_uint64 n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%llu", n);
}
string& string::operator =(long n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%ld", n);
}
string& string::operator =(unsigned long n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%lu", n);
}
string& string::operator =(int n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%d", n);
}
string& string::operator =(unsigned int n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%u", n);
}
string& string::operator =(short n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%d", n);
}
string& string::operator =(unsigned short n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%d", n);
}
string& string::operator =(char n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return *this;
}
else
return format("%c", n);
}
string& string::operator =(unsigned char n)
{
if (use_bin_)
{
copy(&n, sizeof(n));
return (*this);
}
else
return format("%c", n);
}
string& string::operator +=(const char* s)
{
SCAT(vbf_, s);
return *this;
}
string& string::operator +=(const string& s)
{
MCAT(vbf_, STR(s.vbf_), LEN(s.vbf_));
TERM(vbf_);
return *this;
}
string& string::operator +=(const string* s)
{
MCAT(vbf_, STR(s->vbf_), LEN(s->vbf_));
TERM(vbf_);
return *this;
}
string& string::operator +=(acl_int64 n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%lld", n);
}
string& string::operator +=(acl_uint64 n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%llu", n);
}
string& string::operator +=(long n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%ld", n);
}
string& string::operator +=(unsigned long n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%lu", n);
}
string& string::operator +=(int n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%d", n);
}
string& string::operator +=(unsigned int n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%u", n);
}
string& string::operator +=(short n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%d", n);
}
string& string::operator +=(unsigned short n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%u", n);
}
string& string::operator +=(unsigned char n)
{
if (use_bin_)
{
append(&n, sizeof(n));
return *this;
}
else
return format_append("%c", n);
}
string& string::operator +=(char ch)
{
*this += (unsigned char) ch;
return *this;
}
string& string::operator <<(const string& s)
{
*this += s;
return *this;
}
string& string::operator <<(const string* s)
{
*this += s;
return *this;
}
string& string::operator <<(const char* s)
{
*this += s;
return *this;
}
string& string::operator <<(acl_int64 n)
{
*this += n;
return *this;
}
string& string::operator <<(acl_uint64 n)
{
*this += n;
return *this;
}
string& string::operator <<(int n)
{
*this += n;
return *this;
}
string& string::operator <<(unsigned int n)
{
*this += n;
return *this;
}
string& string::operator <<(long n)
{
*this += n;
return *this;
}
string& string::operator <<(unsigned long n)
{
*this += n;
return *this;
}
string& string::operator <<(short n)
{
*this += n;
return *this;
}
string& string::operator <<(unsigned short n)
{
*this += n;
return *this;
}
string& string::operator <<(char n)
{
*this += n;
return *this;
}
string& string::operator <<(unsigned char n)
{
*this += n;
return *this;
}
string& string::push_back(char ch)
{
return append(&ch, sizeof(ch));
}
char* string::buf_end()
{
if (scan_ptr_ == NULL)
scan_ptr_ = STR(vbf_);
char *pEnd = acl_vstring_end(vbf_);
if (scan_ptr_ >= pEnd)
{
if (!empty())
clear();
return NULL;
}
return pEnd;
}
bool string::scan_line(string& out, bool nonl /* = true */,
size_t* n /* = NULL */, bool move /* = false */)
{
if (n)
*n = 0;
char* pEnd = buf_end();
if (pEnd == NULL)
return false;
size_t len = pEnd - scan_ptr_;
char *ln = (char*) memchr(scan_ptr_, '\n', len);
if (ln == NULL)
return false;
char *next = ln + 1;
len = ln - scan_ptr_ + 1;
if (nonl)
{
ln--;
len--;
if (ln >= scan_ptr_ && *ln == '\r')
{
ln--;
len--;
}
if (len > 0)
out.append(scan_ptr_, len);
}
else
out.append(scan_ptr_, len);
if (move)
{
if (pEnd > next)
{
acl_vstring_memmove(vbf_, next, pEnd - next);
TERM(vbf_);
scan_ptr_ = STR(vbf_);
}
else
clear();
}
else
{
if (next >= pEnd)
clear();
else
scan_ptr_ = next;
}
if (n)
*n = len;
return true;
}
size_t string::scan_buf(void* pbuf, size_t n, bool move /* = false */)
{
if (pbuf == NULL || n == 0)
return 0;
const char *pEnd = buf_end();
if (pEnd == NULL)
return 0;
size_t len = pEnd - scan_ptr_;
if (len > n)
len = n;
memcpy(pbuf, scan_ptr_, len);
if (move)
{
acl_vstring_memmove(vbf_, scan_ptr_, len);
TERM(vbf_);
scan_ptr_ = STR(vbf_);
}
else
scan_ptr_ += len;
return len;
}
size_t string::scan_move()
{
if (scan_ptr_ == NULL)
return 0;
char *pEnd = acl_vstring_end(vbf_);
if (scan_ptr_ >= pEnd)
{
clear();
return 0;
}
size_t len = pEnd - scan_ptr_;
acl_vstring_memmove(vbf_, scan_ptr_, len);
TERM(vbf_);
scan_ptr_ = STR(vbf_);
return len;
}
size_t string::operator >>(string* s)
{
size_t len = this->length();
*s = this;
clear();
return len;
}
size_t string::operator >>(acl_int64& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(acl_uint64& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(int& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(unsigned int& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(short& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(unsigned short& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(char& n)
{
return scan_buf(&n, sizeof(n));
}
size_t string::operator >>(unsigned char& n)
{
return scan_buf(&n, sizeof(n));
}
bool string::operator ==(const string& s) const
{
return compare(s) == 0 ? true : false;
}
bool string::operator==(const string* s) const
{
return compare(s) == 0 ? true : false;
}
bool string::operator ==(const char* s) const
{
return compare(s) == 0 ? true : false;
}
bool string::operator !=(const string& s) const
{
return compare(s) != 0 ? true : false;
}
bool string::operator !=(const string* s) const
{
return compare(s) != 0 ? true : false;
}
bool string::operator !=(const char* s) const
{
return compare(s) != 0 ? true : false;
}
bool string::operator <(const string& s) const
{
size_t nLeft = LEN(vbf_);
size_t nRight = LEN(s.vbf_);
size_t n = nLeft > nRight ? nLeft : nRight;
int ret = memcmp(STR(vbf_), STR(s.vbf_), n);
if (ret < 0)
return true;
else if (ret > 0)
return false;
if (nLeft < nRight)
return true;
return false;
}
bool string::operator >(const string& s) const
{
size_t nLeft = LEN(vbf_);
size_t nRight = LEN(s.vbf_);
size_t n = nLeft > nRight ? nLeft : nRight;
int ret = memcmp(STR(vbf_), STR(s.vbf_), n);
if (ret > 0)
return true;
else if (ret < 0)
return false;
if (nLeft > nRight)
return true;
return false;
}
string::operator const char *() const
{
return STR(vbf_);
}
string::operator const void *() const
{
return (void*) STR(vbf_);
}
2015-11-09 22:11:21 +08:00
bool string::equal(const string& s, bool case_sensitive /* = true */) const
{
size_t n1 = LEN(vbf_), n2 = LEN(s.vbf_);
if (n1 != n2)
return false;
size_t n = n1 > n2 ? n2 : n1;
if (case_sensitive)
return memcmp(STR(vbf_), STR(s.vbf_), n) == 0 ? true : false;
return acl_strcasecmp(STR(vbf_), STR(s.vbf_)) == 0 ? true : false;
}
2014-11-19 00:25:21 +08:00
int string::compare(const string& s) const
{
size_t n = LEN(vbf_) > LEN(s.vbf_) ? LEN(s.vbf_) : LEN(vbf_);
int ret;
ret = memcmp(STR(vbf_), STR(s.vbf_), n);
if (ret != 0)
return ret;
return (int) (LEN(vbf_) - LEN(s.vbf_));
}
int string::compare(const string* s) const
{
size_t n = LEN(vbf_) > LEN(s->vbf_) ? LEN(s->vbf_) : LEN(vbf_);
int ret;
ret = memcmp(STR(vbf_), STR(s->vbf_), n);
if (ret != 0)
return ret;
return (int) (LEN(vbf_) - LEN(s->vbf_));
}
int string::compare(const char* s, bool case_sensitive) const
{
if (case_sensitive)
return compare((const void*) s, (size_t) strlen(s));
else
return acl_strcasecmp(STR(vbf_), s);
}
int string::compare(const void* ptr, size_t len) const
{
size_t n = LEN(vbf_) > len ? len : LEN(vbf_);
int ret;
ret = memcmp(STR(vbf_), ptr, n);
if (ret != 0)
return ret;
return (int) (LEN(vbf_) - len);
}
int string::ncompare(const char* s, size_t len, bool case_sensitive/* =true */) const
{
if (case_sensitive)
return strncmp(STR(vbf_), s, len);
else
return acl_strncasecmp(STR(vbf_), s, len);
}
int string::rncompare(const char* s, size_t len, bool case_sensitive/* =true */) const
{
if (case_sensitive)
return acl_strrncmp(STR(vbf_), s, len);
else
return acl_strrncasecmp(STR(vbf_), s, len);
}
char* string::c_str() const
{
if (scan_ptr_)
return scan_ptr_;
return STR(vbf_);
}
void* string::buf() const
{
return STR(vbf_);
}
size_t string::length() const
{
if (scan_ptr_)
return LEN(vbf_) - (scan_ptr_ - STR(vbf_));
return LEN(vbf_);
}
size_t string::size() const
{
return length();
}
size_t string::capacity() const
{
return CAP(vbf_);
}
string& string::set_offset(size_t n)
{
RSET(vbf_);
ACL_VSTRING_SPACE(vbf_, (int) n);
ACL_VSTRING_AT_OFFSET(vbf_, (int) n);
TERM(vbf_);
return *this;
}
string& string::space(size_t n)
{
ACL_VSTRING_SPACE(vbf_, (int) n);
return *this;
}
bool string::empty() const
{
return LEN(vbf_) > 0 ? false : true;
}
ACL_VSTRING* string::vstring() const
{
return vbf_;
}
int string::find_blank_line(int* left_count /* = NULL */,
string* out /* = NULL */)
{
if (line_state_ == NULL)
line_state_ = (ACL_LINE_STATE*) acl_line_state_alloc();
int len = (int) LEN(vbf_);
if (line_state_->offset >= len)
return -1;
int nleft = len - line_state_->offset;
char* s = STR(vbf_) + line_state_->offset;
int ret = acl_find_blank_line(s, nleft, line_state_);
if (left_count != NULL)
*left_count = ret;
if (line_state_->finish)
{
acl_line_state_reset(line_state_, line_state_->offset);
if (out != NULL)
{
out->append(STR(vbf_) + line_state_offset_,
line_state_->offset - line_state_offset_);
}
line_state_offset_ = line_state_->offset;
return line_state_->offset;
}
return 0;
}
string& string::find_reset(void)
{
if (line_state_)
acl_line_state_reset(line_state_, 0);
line_state_offset_ = 0;
return *this;
}
2014-11-19 00:25:21 +08:00
int string::find(char ch) const
{
char *ptr = acl_vstring_memchr(vbf_, ch);
if (ptr == NULL)
return -1;
return (int)(ptr - STR(vbf_));
}
char* string::find(const char* needle, bool case_sensitive) const
{
if (case_sensitive)
return acl_vstring_strstr(vbf_, needle);
else
return acl_vstring_strcasestr(vbf_, needle);
}
char* string::rfind(const char* needle, bool case_sensitive) const
{
if (case_sensitive)
return acl_vstring_rstrstr(vbf_, needle);
else
return acl_vstring_rstrcasestr(vbf_, needle);
}
string string::left(size_t npos)
{
if (npos >= LEN(vbf_))
return *this;
return string(STR(vbf_), npos);
}
string string::right(size_t npos)
{
npos++;
if (npos >= LEN(vbf_))
return string(1);
size_t nLeft = LEN(vbf_) - npos;
return string(STR(vbf_) + npos, nLeft);
}
std::list<acl::string>& string::split(const char* sep)
{
ACL_ARGV *argv = acl_argv_split(STR(vbf_), sep);
ACL_ITER it;
if (list_tmp_ == NULL)
list_tmp_ = NEW std::list<acl::string>;
else
list_tmp_->clear();
acl_foreach(it, argv)
{
char* ptr = (char*) it.data;
list_tmp_->push_back(ptr);
}
acl_argv_free(argv);
return *list_tmp_;
}
std::vector<acl::string>& string::split2(const char* sep)
{
ACL_ARGV *argv = acl_argv_split(STR(vbf_), sep);
ACL_ITER it;
if (vector_tmp_ == NULL)
vector_tmp_ = NEW std::vector<acl::string>;
else
vector_tmp_->clear();
acl_foreach(it, argv)
{
char* ptr = (char*) it.data;
vector_tmp_->push_back(ptr);
}
acl_argv_free(argv);
return *vector_tmp_;
}
2016-04-14 22:39:11 +08:00
std::list<acl::string>& string::quote_split(const char* sep)
{
ACL_ARGV *argv = acl_argv_quote_split(STR(vbf_), sep);
ACL_ITER it;
if (list_tmp_ == NULL)
list_tmp_ = NEW std::list<acl::string>;
else
list_tmp_->clear();
acl_foreach(it, argv)
{
char* ptr = (char*) it.data;
list_tmp_->push_back(ptr);
}
acl_argv_free(argv);
return *list_tmp_;
}
std::vector<acl::string>& string::quote_split2(const char* sep)
{
ACL_ARGV *argv = acl_argv_quote_split(STR(vbf_), sep);
ACL_ITER it;
if (vector_tmp_ == NULL)
vector_tmp_ = NEW std::vector<acl::string>;
else
vector_tmp_->clear();
acl_foreach(it, argv)
{
char* ptr = (char*) it.data;
vector_tmp_->push_back(ptr);
}
acl_argv_free(argv);
return *vector_tmp_;
}
2014-11-19 00:25:21 +08:00
std::pair<acl::string, acl::string>& string::split_nameval()
{
char *name, *value;
if (pair_tmp_ == NULL)
pair_tmp_ = NEW std::pair<acl::string, acl::string>;
if (acl_split_nameval(STR(vbf_), &name, &value) != NULL) {
pair_tmp_->first = "";
pair_tmp_->second = "";
return *pair_tmp_;
}
pair_tmp_->first = name;
pair_tmp_->second = value;
return *pair_tmp_;
}
string& string::copy(const char* ptr)
{
SCP(vbf_, ptr);
return *this;
}
string& string::copy(const void* ptr, size_t len)
{
MCP(vbf_, (const char*) ptr, len);
TERM(vbf_);
return *this;
}
string& string::memmove(const char* ptr)
{
return memmove(ptr, strlen(ptr));
}
string& string::memmove(const char* ptr, size_t len)
{
acl_vstring_memmove(vbf_, ptr, len);
return *this;
}
string& string::append(const string& s)
{
return append(s.c_str(), s.length());
}
string& string::append(const string* s)
{
return append(s->c_str(), s->length());
}
string& string::append(const char* ptr)
{
SCAT(vbf_, ptr);
return *this;
}
string& string::append(const void* ptr, size_t len)
{
MCAT(vbf_, (const char*) ptr, len);
TERM(vbf_);
return *this;
}
string& string::prepend(const char* s)
{
acl_vstring_prepend(vbf_, s, strlen(s));
return *this;
}
string& string::prepend(const void* ptr, size_t len)
{
acl_vstring_prepend(vbf_, (const char*) ptr, len);
return *this;
}
string& string::insert(size_t start, const void* ptr, size_t len)
{
acl_vstring_insert(vbf_, start, (const char*) ptr, len);
return *this;
}
string& string::format(const char* fmt, ...)
{
va_list ap;
va_start(ap, fmt);
vformat(fmt, ap);
va_end(ap);
return *this;
}
string& string::vformat(const char* fmt, va_list ap)
{
acl_vstring_vsprintf(vbf_, fmt, ap);
return *this;
}
string& string::format_append(const char* fmt, ...)
{
va_list ap;
va_start(ap, fmt);
vformat_append(fmt, ap);
va_end(ap);
return *this;
}
string& string::vformat_append(const char* fmt, va_list ap)
{
acl_vstring_vsprintf_append(vbf_, fmt, ap);
return *this;
}
string& string::replace(char from, char to)
{
char* ptr = STR(vbf_);
size_t i, n = LEN(vbf_);
for (i = 0; i < n; i++) {
if (*ptr == from)
*ptr = to;
ptr++;
}
return *this;
}
string& string::truncate(size_t n)
{
acl_vstring_truncate(vbf_, n);
TERM(vbf_);
return *this;
}
string& string::strip(const char* needle, bool each /* false */)
{
char* src = STR(vbf_);
char* ptr;
if (each)
{
2015-10-20 21:07:23 +08:00
ACL_VSTRING* pVbf = NULL;
2014-11-19 00:25:21 +08:00
while (true)
{
if ((ptr = acl_mystrtok(&src, needle)) == NULL)
{
2015-10-20 21:07:23 +08:00
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ pVbf Ϊ NULL<4C><4C><EFBFBD><EFBFBD>˵<EFBFBD><CBB5>Դ<EFBFBD><D4B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// ȫ<><C8AB>Ϊƥ<CEAA><C6A5><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>£<EFBFBD><C2A3><EFBFBD>һ<EFBFBD><D2BB>
// <20><><EFBFBD><EFBFBD> acl_mystrtok <20>ͻ᷵<CDBB><E1B7B5> NULL<4C><4C><EFBFBD><EFBFBD>ʱ
// <20><>Ҫ<EFBFBD><D2AA><EFBFBD><EFBFBD>Դ<EFBFBD><D4B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (pVbf == NULL)
{
RSET(vbf_);
TERM(vbf_);
}
2014-11-19 00:25:21 +08:00
break;
}
2015-10-20 21:07:23 +08:00
// <20><><EFBFBD><EFBFBD>дʱ<D0B4><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Դ<EFBFBD><D4B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>κ<EFBFBD>ƥ<EFBFBD><C6A5><EFBFBD>ַ<EFBFBD>
// ʱ<><CAB1><EFBFBD><EFBFBD><EFBFBD>ط<EFBFBD><D8B7><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
2014-11-19 00:25:21 +08:00
if (pVbf == NULL)
2015-10-20 21:07:23 +08:00
pVbf = acl_vstring_alloc(LEN(vbf_) + 1);
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƥ<EFBFBD><C6A5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>»<EFBFBD><C2BB><EFBFBD><EFBFBD><EFBFBD>
2014-11-19 00:25:21 +08:00
SCAT(pVbf, ptr);
}
2015-10-20 21:07:23 +08:00
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> NULL<4C><4C><EFBFBD><EFBFBD>˵<EFBFBD><CBB5>Դ<EFBFBD><D4B4><EFBFBD>ݴ<EFBFBD><DDB4>ڲ<EFBFBD><DAB2><EFBFBD>ƥ<EFBFBD><C6A5><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>
// <20><>Ҫ<EFBFBD><D2AA><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><CEAA>ʽ<EFBFBD><CABD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD>Դ<EFBFBD><D4B4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
2014-11-19 00:25:21 +08:00
if (pVbf != NULL)
{
FREE(vbf_);
vbf_ = pVbf;
}
2015-10-20 21:07:23 +08:00
2014-11-19 00:25:21 +08:00
return *this;
}
size_t len = strlen(needle), n;
2015-10-20 21:07:23 +08:00
ACL_VSTRING* pVbf = NULL;
2014-11-19 00:25:21 +08:00
while (true)
{
ptr = strstr(src, needle);
if (ptr == NULL)
{
if (pVbf != NULL)
SCAT(pVbf, src);
break;
}
// <20><><EFBFBD><EFBFBD>дʱ<D0B4>ӳٷ<D3B3><D9B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if (pVbf == NULL)
pVbf = acl_vstring_alloc(LEN(vbf_));
2015-10-20 21:07:23 +08:00
2014-11-19 00:25:21 +08:00
n = ptr - src;
2015-10-20 21:07:23 +08:00
if (n > 0)
MCAT(pVbf, src, n);
2014-11-19 00:25:21 +08:00
TERM(pVbf);
2015-10-20 21:07:23 +08:00
2014-11-19 00:25:21 +08:00
src += n + len;
}
if (pVbf != NULL)
{
FREE(vbf_);
vbf_ = pVbf;
}
return *this;
}
string& string::trim_left_space()
{
char* pBegin = STR(vbf_);
char* pEnd = acl_vstring_end(vbf_);
if (pEnd == pBegin)
return *this;
size_t n = 0;
while (pBegin < pEnd && (*pBegin == ' ' || *pBegin == '\t'))
{
pBegin++;
n++;
}
if (pBegin == pEnd)
clear();
else if (n > 0)
{
acl_vstring_memmove(vbf_, pBegin, LEN(vbf_) - n);
TERM(vbf_);
}
return *this;
}
string& string::trim_right_space()
{
char* pBegin = STR(vbf_);
char* pEnd = acl_vstring_end(vbf_);
if (pEnd == pBegin)
return *this;
pEnd--;
size_t n = 0;
while (pEnd >= pBegin && (*pEnd == ' ' || *pEnd == '\t'))
{
pEnd--;
n++;
}
size_t len = LEN(vbf_);
if (n > 0)
{
len -= n;
truncate(len);
}
return *this;
}
string& string::trim_space()
{
return strip(" \t", true);
}
string& string::trim_left_line()
{
char* pBegin = STR(vbf_);
char* pEnd = acl_vstring_end(vbf_);
if (pEnd == pBegin)
return *this;
size_t n = 0;
while (pBegin < pEnd)
{
if (*pBegin == '\n')
{
pBegin++;
n++;
}
else if (*pBegin == '\r' && (pBegin + 1) < pEnd
&& *(pBegin + 1) == '\n')
{
pBegin += 2;
n += 2;
}
else
break;
}
if (pBegin == pEnd)
clear();
else if (n > 0)
{
acl_vstring_memmove(vbf_, pBegin, LEN(vbf_) - n);
TERM(vbf_);
}
return *this;
}
string& string::trim_right_line()
{
char* pBegin = STR(vbf_);
char* pEnd = acl_vstring_end(vbf_);
if (pEnd == pBegin)
return *this;
pEnd--;
size_t n = 0;
while (pEnd >= pBegin && *pEnd == '\n')
{
pEnd--;
n++;
if (pEnd >= pBegin && *pEnd == '\r')
{
pEnd--;
n++;
}
}
size_t len = LEN(vbf_);
if (n > 0)
{
len -= n;
truncate(len);
}
return *this;
}
string& string::trim_line()
{
return strip("\r\n", true);
}
string& string::clear(void)
{
RSET(vbf_);
TERM(vbf_);
scan_ptr_ = NULL;
find_reset();
2014-11-19 00:25:21 +08:00
return *this;
}
string& string::lower()
{
acl_lowercase(STR(vbf_));
return *this;
}
string& string::upper()
{
acl_uppercase(STR(vbf_));
return *this;
}
size_t string::substr(string& out, size_t pos /* = 0 */, size_t len /* = 0 */)
{
size_t n = LEN(vbf_);
if (pos >= n)
return 0;
n -= pos;
if (len == 0 || len > n)
len = n;
out.append(STR(vbf_) + pos, len);
return n;
}
2014-11-19 00:25:21 +08:00
string& string::base64_encode(void)
{
size_t dlen = length();
if (dlen == 0)
return *this;
size_t n = (dlen * 4) / 3;
ACL_VSTRING *s = ALLOC(n) ;
acl_vstring_base64_encode(s, c_str(), (int) dlen);
FREE(vbf_);
vbf_ = s;
return *this;
}
string& string::base64_encode(const void* ptr, size_t len)
{
acl_vstring_base64_encode(vbf_, (const char*) ptr, (int) len);
return *this;
}
string& string::base64_decode(void)
{
size_t dlen = length();
if (dlen == 0)
return (*this);
size_t n = (dlen * 3) / 4;
ACL_VSTRING *s = ALLOC(n) ;
if (acl_vstring_base64_decode(s, c_str(), (int) dlen) == NULL)
RSET(s);
FREE(vbf_);
vbf_ = s;
2015-08-26 20:45:40 +08:00
TERM(vbf_);
2014-11-19 00:25:21 +08:00
return *this;
}
string& string::base64_decode(const char* s)
{
2015-08-26 20:45:40 +08:00
if (acl_vstring_base64_decode(vbf_, s, (int) strlen(s)) == NULL)
2014-11-19 00:25:21 +08:00
RSET(vbf_);
2015-08-26 20:45:40 +08:00
TERM(vbf_);
2014-11-19 00:25:21 +08:00
return *this;
}
string& string::base64_decode(const void* ptr, size_t len)
{
if (acl_vstring_base64_decode(vbf_,
(const char*) ptr, (int) len) == NULL)
{
RSET(vbf_);
}
2015-08-26 20:45:40 +08:00
TERM(vbf_);
2014-11-19 00:25:21 +08:00
return *this;
}
2015-11-09 22:11:21 +08:00
string& string::url_encode(const char* s, dbuf_pool* dbuf /* = NULL */)
2014-11-19 00:25:21 +08:00
{
2015-11-09 22:11:21 +08:00
char *ptr = acl_url_encode(s, dbuf ? dbuf->get_dbuf() : NULL);
2014-11-19 00:25:21 +08:00
(*this) = ptr;
2015-11-09 22:11:21 +08:00
if (dbuf == NULL)
acl_myfree(ptr);
2014-11-19 00:25:21 +08:00
return *this;
}
2015-11-09 22:11:21 +08:00
string& string::url_decode(const char* s, dbuf_pool* dbuf /* = NULL */)
2014-11-19 00:25:21 +08:00
{
2015-11-09 22:11:21 +08:00
char *ptr = acl_url_decode(s, dbuf ? dbuf->get_dbuf() : NULL);
2014-11-19 00:25:21 +08:00
(*this) = ptr;
2015-11-09 22:11:21 +08:00
if (dbuf == NULL)
acl_myfree(ptr);
2014-11-19 00:25:21 +08:00
return *this;
}
string& string::hex_encode(const void* s, size_t len)
{
(void) acl_hex_encode(vbf_, (const char*) s, (int) len);
return *this;
}
string& string::hex_decode(const char* s, size_t len)
{
(void) acl_hex_decode(vbf_, s, (int) len);
return *this;
}
string& string::basename(const char* path)
{
(void) acl_sane_basename(vbf_, path);
return *this;
}
string& string::dirname(const char* path)
{
(void) acl_sane_dirname(vbf_, path);
return *this;
}
2014-11-19 00:25:21 +08:00
static void dummy_free(void*)
{
}
static void buf_free(void* arg)
{
string* s = (string*) arg;
delete s;
}
static string* __main_buf = NULL;
static void main_buf_free(void)
{
if (__main_buf)
delete __main_buf;
}
static acl_pthread_key_t __buf_key;
static void prepare_once(void)
{
if ((unsigned long) acl_pthread_self() == acl_main_thread_self())
{
acl_pthread_key_create(&__buf_key, dummy_free);
atexit(main_buf_free);
} else
acl_pthread_key_create(&__buf_key, buf_free);
}
static acl_pthread_once_t __buf_once = ACL_PTHREAD_ONCE_INIT;
static string& get_buf(void)
{
acl_pthread_once(&__buf_once, prepare_once);
string* s = (string*) acl_pthread_getspecific(__buf_key);
if (s != NULL)
return *s;
s = NEW string(21);
acl_pthread_setspecific(__buf_key, s);
if ((unsigned long) acl_pthread_self() == acl_main_thread_self())
__main_buf = s;
return *s;
}
string& string::parse_int(int n)
{
string& s = get_buf();
s.format("%d", n);
return s;
}
string& string::parse_int(unsigned int n)
{
string& s = get_buf();
s.format("%u", n);
return s;
}
string& string::parse_int64(acl_int64 n)
{
string& s = get_buf();
s.format("%lld", n);
return s;
}
string& string::parse_int64(acl_uint64 n)
{
string& s = get_buf();
s.format("%llu", n);
return s;
}
} // namespace acl