386 lines
8.3 KiB
C
386 lines
8.3 KiB
C
/*
|
|
* $Id$
|
|
*
|
|
Copyright 2006-2012 Chung, Hyung-Hwan.
|
|
This file is part of QSE.
|
|
|
|
QSE is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as
|
|
published by the Free Software Foundation, either version 3 of
|
|
the License, or (at your option) any later version.
|
|
|
|
QSE 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 Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with QSE. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <qse/cmn/str.h>
|
|
#include "mem.h"
|
|
|
|
QSE_IMPLEMENT_COMMON_FUNCTIONS (mbs)
|
|
|
|
qse_mbs_t* qse_mbs_open (qse_mmgr_t* mmgr, qse_size_t ext, qse_size_t capa)
|
|
{
|
|
qse_mbs_t* str;
|
|
|
|
str = (qse_mbs_t*) QSE_MMGR_ALLOC (mmgr, QSE_SIZEOF(qse_mbs_t) + ext);
|
|
if (str == QSE_NULL) return QSE_NULL;
|
|
|
|
if (qse_mbs_init (str, mmgr, capa) <= -1)
|
|
{
|
|
QSE_MMGR_FREE (mmgr, str);
|
|
return QSE_NULL;
|
|
}
|
|
|
|
return str;
|
|
}
|
|
|
|
void qse_mbs_close (qse_mbs_t* str)
|
|
{
|
|
qse_mbs_fini (str);
|
|
QSE_MMGR_FREE (str->mmgr, str);
|
|
}
|
|
|
|
int qse_mbs_init (qse_mbs_t* str, qse_mmgr_t* mmgr, qse_size_t capa)
|
|
{
|
|
QSE_MEMSET (str, 0, QSE_SIZEOF(qse_mbs_t));
|
|
|
|
str->mmgr = mmgr;
|
|
str->sizer = QSE_NULL;
|
|
|
|
if (capa == 0) str->val.ptr = QSE_NULL;
|
|
else
|
|
{
|
|
str->val.ptr = (qse_mchar_t*) QSE_MMGR_ALLOC (
|
|
mmgr, QSE_SIZEOF(qse_mchar_t) * (capa + 1));
|
|
if (str->val.ptr == QSE_NULL) return -1;
|
|
str->val.ptr[0] = QSE_MT('\0');
|
|
}
|
|
|
|
str->val.len = 0;
|
|
str->capa = capa;
|
|
|
|
return 0;
|
|
}
|
|
|
|
void qse_mbs_fini (qse_mbs_t* str)
|
|
{
|
|
if (str->val.ptr != QSE_NULL) QSE_MMGR_FREE (str->mmgr, str->val.ptr);
|
|
}
|
|
|
|
int qse_mbs_yield (qse_mbs_t* str, qse_mxstr_t* buf, qse_size_t newcapa)
|
|
{
|
|
qse_mchar_t* tmp;
|
|
|
|
if (newcapa == 0) tmp = QSE_NULL;
|
|
else
|
|
{
|
|
tmp = (qse_mchar_t*) QSE_MMGR_ALLOC (
|
|
str->mmgr, QSE_SIZEOF(qse_mchar_t) * (newcapa + 1));
|
|
if (tmp == QSE_NULL) return -1;
|
|
tmp[0] = QSE_MT('\0');
|
|
}
|
|
|
|
if (buf != QSE_NULL)
|
|
{
|
|
buf->ptr = str->val.ptr;
|
|
buf->len = str->val.len;
|
|
}
|
|
|
|
str->val.ptr = tmp;
|
|
str->val.len = 0;
|
|
str->capa = newcapa;
|
|
|
|
return 0;
|
|
}
|
|
|
|
qse_mchar_t* qse_mbs_yieldptr (qse_mbs_t* str, qse_size_t newcapa)
|
|
{
|
|
qse_mxstr_t mx;
|
|
if (qse_mbs_yield (str, &mx, newcapa) <= -1) return QSE_NULL;
|
|
return mx.ptr;
|
|
}
|
|
|
|
qse_mbs_sizer_t qse_mbs_getsizer (qse_mbs_t* str)
|
|
{
|
|
return str->sizer;
|
|
}
|
|
|
|
void qse_mbs_setsizer (qse_mbs_t* str, qse_mbs_sizer_t sizer)
|
|
{
|
|
str->sizer = sizer;
|
|
}
|
|
|
|
qse_size_t qse_mbs_getcapa (qse_mbs_t* str)
|
|
{
|
|
return str->capa;
|
|
}
|
|
|
|
qse_size_t qse_mbs_setcapa (qse_mbs_t* str, qse_size_t capa)
|
|
{
|
|
qse_mchar_t* tmp;
|
|
|
|
if (capa == str->capa) return capa;
|
|
|
|
if (str->mmgr->realloc != QSE_NULL && str->val.ptr != QSE_NULL)
|
|
{
|
|
tmp = (qse_mchar_t*) QSE_MMGR_REALLOC (
|
|
str->mmgr, str->val.ptr,
|
|
QSE_SIZEOF(qse_mchar_t)*(capa+1));
|
|
if (tmp == QSE_NULL) return (qse_size_t)-1;
|
|
}
|
|
else
|
|
{
|
|
tmp = (qse_mchar_t*) QSE_MMGR_ALLOC (
|
|
str->mmgr, QSE_SIZEOF(qse_mchar_t)*(capa+1));
|
|
if (tmp == QSE_NULL) return (qse_size_t)-1;
|
|
|
|
if (str->val.ptr != QSE_NULL)
|
|
{
|
|
qse_size_t ncopy = (str->val.len <= capa)? str->val.len: capa;
|
|
QSE_MEMCPY (tmp, str->val.ptr,
|
|
QSE_SIZEOF(qse_mchar_t)*(ncopy+1));
|
|
QSE_MMGR_FREE (str->mmgr, str->val.ptr);
|
|
}
|
|
}
|
|
|
|
if (capa < str->val.len)
|
|
{
|
|
str->val.len = capa;
|
|
tmp[capa] = QSE_MT('\0');
|
|
}
|
|
|
|
str->capa = capa;
|
|
str->val.ptr = tmp;
|
|
|
|
return str->capa;
|
|
}
|
|
|
|
qse_size_t qse_mbs_getlen (qse_mbs_t* str)
|
|
{
|
|
return QSE_MBS_LEN (str);
|
|
}
|
|
|
|
qse_size_t qse_mbs_setlen (qse_mbs_t* str, qse_size_t len)
|
|
{
|
|
if (len == str->val.len) return len;
|
|
if (len < str->val.len)
|
|
{
|
|
str->val.len = len;
|
|
str->val.ptr[len] = QSE_MT('\0');
|
|
return len;
|
|
}
|
|
|
|
if (len > str->capa)
|
|
{
|
|
if (qse_mbs_setcapa (str, len) == (qse_size_t)-1)
|
|
return (qse_size_t)-1;
|
|
}
|
|
|
|
while (str->val.len < len) str->val.ptr[str->val.len++] = QSE_MT(' ');
|
|
return str->val.len;
|
|
}
|
|
|
|
void qse_mbs_clear (qse_mbs_t* str)
|
|
{
|
|
str->val.len = 0;
|
|
if (str->val.ptr != QSE_NULL)
|
|
{
|
|
QSE_ASSERT (str->capa >= 1);
|
|
str->val.ptr[0] = QSE_MT('\0');
|
|
}
|
|
}
|
|
|
|
void qse_mbs_swap (qse_mbs_t* str, qse_mbs_t* str1)
|
|
{
|
|
qse_mbs_t tmp;
|
|
|
|
tmp.val.ptr = str->val.ptr;
|
|
tmp.val.len = str->val.len;
|
|
tmp.capa = str->capa;
|
|
tmp.mmgr = str->mmgr;
|
|
|
|
str->val.ptr = str1->val.ptr;
|
|
str->val.len = str1->val.len;
|
|
str->capa = str1->capa;
|
|
str->mmgr = str1->mmgr;
|
|
|
|
str1->val.ptr = tmp.val.ptr;
|
|
str1->val.len = tmp.val.len;
|
|
str1->capa = tmp.capa;
|
|
str1->mmgr = tmp.mmgr;
|
|
}
|
|
|
|
qse_size_t qse_mbs_cpy (qse_mbs_t* str, const qse_mchar_t* s)
|
|
{
|
|
/* TODO: improve it */
|
|
return qse_mbs_ncpy (str, s, qse_mbslen(s));
|
|
}
|
|
|
|
qse_size_t qse_mbs_ncpy (qse_mbs_t* str, const qse_mchar_t* s, qse_size_t len)
|
|
{
|
|
if (len > str->capa || str->capa <= 0)
|
|
{
|
|
qse_size_t tmp;
|
|
|
|
/* if the current capacity is 0 and the string len to copy is 0
|
|
* we can't simply pass 'len' as the new capapcity.
|
|
* qse_mbs_setcapa() won't do anything the current capacity of 0
|
|
* is the same as new capacity required. note that when str->capa
|
|
* is 0, str->val.ptr is QSE_NULL. However, this is copying operation.
|
|
* Copying a zero-length string may indicate that str->val.ptr must
|
|
* not be QSE_NULL. so I simply pass 1 as the new capacity */
|
|
tmp = qse_mbs_setcapa (
|
|
str, ((str->capa <= 0 && len <= 0)? 1: len)
|
|
);
|
|
if (tmp == (qse_size_t)-1) return (qse_size_t)-1;
|
|
}
|
|
|
|
QSE_MEMCPY (&str->val.ptr[0], s, len*QSE_SIZEOF(*s));
|
|
str->val.ptr[len] = QSE_MT('\0');
|
|
str->val.len = len;
|
|
return len;
|
|
#if 0
|
|
str->val.len = qse_mbsncpy (str->val.ptr, s, len);
|
|
/*str->val.ptr[str->val.len] = QSE_MT('\0'); -> mbsncpy does this*/
|
|
return str->val.len;
|
|
#endif
|
|
}
|
|
|
|
qse_size_t qse_mbs_cat (qse_mbs_t* str, const qse_mchar_t* s)
|
|
{
|
|
/* TODO: improve it */
|
|
return qse_mbs_ncat (str, s, qse_mbslen(s));
|
|
}
|
|
|
|
qse_size_t qse_mbs_ncat (qse_mbs_t* str, const qse_mchar_t* s, qse_size_t len)
|
|
{
|
|
if (len > str->capa - str->val.len)
|
|
{
|
|
qse_size_t ncapa, mincapa;
|
|
|
|
/* let the minimum capacity be as large as
|
|
* to fit in the new substring */
|
|
mincapa = str->val.len + len;
|
|
|
|
if (str->sizer == QSE_NULL)
|
|
{
|
|
/* increase the capacity by the length to add */
|
|
ncapa = mincapa;
|
|
/* if the new capacity is less than the double,
|
|
* just double it */
|
|
if (ncapa < str->capa * 2) ncapa = str->capa * 2;
|
|
}
|
|
else
|
|
{
|
|
/* let the user determine the new capacity.
|
|
* pass the minimum capacity required as a hint */
|
|
ncapa = str->sizer (str, mincapa);
|
|
/* if no change in capacity, return current length */
|
|
if (ncapa == str->capa) return str->val.len;
|
|
}
|
|
|
|
/* change the capacity */
|
|
do
|
|
{
|
|
if (qse_mbs_setcapa (str, ncapa) != (qse_size_t)-1) break;
|
|
if (ncapa <= mincapa) return (qse_size_t)-1;
|
|
ncapa--;
|
|
}
|
|
while (1);
|
|
}
|
|
else if (str->capa <= 0 && len <= 0)
|
|
{
|
|
QSE_ASSERT (str->val.ptr == QSE_NULL);
|
|
QSE_ASSERT (str->val.len <= 0);
|
|
if (qse_mbs_setcapa (str, 1) == (qse_size_t)-1) return (qse_size_t)-1;
|
|
}
|
|
|
|
if (len > str->capa - str->val.len)
|
|
{
|
|
/* copy as many characters as the number of cells available.
|
|
* if the capacity has been decreased, len is adjusted here */
|
|
len = str->capa - str->val.len;
|
|
}
|
|
|
|
#if 0
|
|
if (len > 0)
|
|
{
|
|
#endif
|
|
QSE_MEMCPY (&str->val.ptr[str->val.len], s, len*QSE_SIZEOF(*s));
|
|
str->val.len += len;
|
|
str->val.ptr[str->val.len] = QSE_MT('\0');
|
|
#if 0
|
|
}
|
|
#endif
|
|
|
|
return str->val.len;
|
|
}
|
|
|
|
qse_size_t qse_mbs_ccat (qse_mbs_t* str, qse_mchar_t c)
|
|
{
|
|
return qse_mbs_ncat (str, &c, 1);
|
|
}
|
|
|
|
qse_size_t qse_mbs_nccat (qse_mbs_t* str, qse_mchar_t c, qse_size_t len)
|
|
{
|
|
while (len > 0)
|
|
{
|
|
if (qse_mbs_ncat (str, &c, 1) == (qse_size_t)-1)
|
|
{
|
|
return (qse_size_t)-1;
|
|
}
|
|
|
|
len--;
|
|
}
|
|
return str->val.len;
|
|
}
|
|
|
|
qse_size_t qse_mbs_del (qse_mbs_t* str, qse_size_t index, qse_size_t size)
|
|
{
|
|
if (str->val.ptr != QSE_NULL && index < str->val.len && size > 0)
|
|
{
|
|
qse_size_t nidx = index + size;
|
|
if (nidx >= str->val.len)
|
|
{
|
|
str->val.ptr[index] = QSE_MT('\0');
|
|
str->val.len = index;
|
|
}
|
|
else
|
|
{
|
|
qse_mbsncpy (
|
|
&str->val.ptr[index], &str->val.ptr[nidx],
|
|
str->val.len - nidx);
|
|
str->val.len -= size;
|
|
}
|
|
}
|
|
|
|
return str->val.len;
|
|
}
|
|
|
|
qse_size_t qse_mbs_trm (qse_mbs_t* str)
|
|
{
|
|
if (str->val.ptr != QSE_NULL)
|
|
{
|
|
str->val.len = qse_mbsxtrm (str->val.ptr, str->val.len);
|
|
}
|
|
|
|
return str->val.len;
|
|
}
|
|
|
|
qse_size_t qse_mbs_pac (qse_mbs_t* str)
|
|
{
|
|
if (str->val.ptr != QSE_NULL)
|
|
{
|
|
str->val.len = qse_mbsxpac (str->val.ptr, str->val.len);
|
|
}
|
|
|
|
return str->val.len;
|
|
}
|
|
|
|
|