360 lines
7.1 KiB
C
360 lines
7.1 KiB
C
/*
|
|
* $Id: str_dyn.c 297 2009-10-08 13:09:19Z hyunghwan.chung $
|
|
*
|
|
Copyright 2006-2009 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 (str)
|
|
|
|
qse_str_t* qse_str_open (qse_mmgr_t* mmgr, qse_size_t ext, qse_size_t capa)
|
|
{
|
|
qse_str_t* str;
|
|
|
|
if (mmgr == QSE_NULL)
|
|
{
|
|
mmgr = QSE_MMGR_GETDFL();
|
|
|
|
QSE_ASSERTX (mmgr != QSE_NULL,
|
|
"Set the memory manager with QSE_MMGR_SETDFL()");
|
|
|
|
if (mmgr == QSE_NULL) return QSE_NULL;
|
|
}
|
|
|
|
str = (qse_str_t*) QSE_MMGR_ALLOC (mmgr, QSE_SIZEOF(qse_str_t) + ext);
|
|
if (str == QSE_NULL) return QSE_NULL;
|
|
|
|
if (qse_str_init (str, mmgr, capa) == QSE_NULL)
|
|
{
|
|
QSE_MMGR_FREE (mmgr, str);
|
|
return QSE_NULL;
|
|
}
|
|
|
|
return str;
|
|
}
|
|
|
|
void qse_str_close (qse_str_t* str)
|
|
{
|
|
qse_str_fini (str);
|
|
QSE_MMGR_FREE (str->mmgr, str);
|
|
}
|
|
|
|
qse_str_t* qse_str_init (qse_str_t* str, qse_mmgr_t* mmgr, qse_size_t capa)
|
|
{
|
|
QSE_MEMSET (str, 0, QSE_SIZEOF(qse_str_t));
|
|
|
|
str->mmgr = mmgr;
|
|
str->sizer = QSE_NULL;
|
|
|
|
if (capa == 0) str->ptr = QSE_NULL;
|
|
else
|
|
{
|
|
str->ptr = (qse_char_t*) QSE_MMGR_ALLOC (
|
|
mmgr, QSE_SIZEOF(qse_char_t) * (capa + 1));
|
|
if (str->ptr == QSE_NULL) return QSE_NULL;
|
|
str->ptr[0] = QSE_T('\0');
|
|
}
|
|
|
|
str->len = 0;
|
|
str->capa = capa;
|
|
|
|
return str;
|
|
}
|
|
|
|
void qse_str_fini (qse_str_t* str)
|
|
{
|
|
if (str->ptr != QSE_NULL) QSE_MMGR_FREE (str->mmgr, str->ptr);
|
|
}
|
|
|
|
int qse_str_yield (qse_str_t* str, qse_xstr_t* buf, int new_capa)
|
|
{
|
|
qse_char_t* tmp;
|
|
|
|
if (new_capa == 0) tmp = QSE_NULL;
|
|
else
|
|
{
|
|
tmp = (qse_char_t*) QSE_MMGR_ALLOC (
|
|
str->mmgr, QSE_SIZEOF(qse_char_t) * (new_capa + 1));
|
|
if (tmp == QSE_NULL) return -1;
|
|
tmp[0] = QSE_T('\0');
|
|
}
|
|
|
|
if (buf != QSE_NULL)
|
|
{
|
|
buf->ptr = str->ptr;
|
|
buf->len = str->len;
|
|
}
|
|
|
|
str->ptr = tmp;
|
|
str->len = 0;
|
|
str->capa = new_capa;
|
|
|
|
return 0;
|
|
}
|
|
|
|
qse_str_sizer_t qse_str_getsizer (qse_str_t* str)
|
|
{
|
|
return str->sizer;
|
|
}
|
|
|
|
void qse_str_setsizer (qse_str_t* str, qse_str_sizer_t sizer)
|
|
{
|
|
str->sizer = sizer;
|
|
}
|
|
|
|
qse_size_t qse_str_getcapa (qse_str_t* str)
|
|
{
|
|
return str->capa;
|
|
}
|
|
|
|
qse_size_t qse_str_setcapa (qse_str_t* str, qse_size_t capa)
|
|
{
|
|
qse_char_t* tmp;
|
|
|
|
if (capa == str->capa) return capa;
|
|
|
|
if (str->mmgr->realloc != QSE_NULL && str->ptr != QSE_NULL)
|
|
{
|
|
tmp = (qse_char_t*) QSE_MMGR_REALLOC (
|
|
str->mmgr, str->ptr,
|
|
QSE_SIZEOF(qse_char_t)*(capa+1));
|
|
if (tmp == QSE_NULL) return (qse_size_t)-1;
|
|
}
|
|
else
|
|
{
|
|
tmp = (qse_char_t*) QSE_MMGR_ALLOC (
|
|
str->mmgr, QSE_SIZEOF(qse_char_t)*(capa+1));
|
|
if (tmp == QSE_NULL) return (qse_size_t)-1;
|
|
|
|
if (str->ptr != QSE_NULL)
|
|
{
|
|
qse_size_t ncopy = (str->len <= capa)? str->len: capa;
|
|
QSE_MEMCPY (tmp, str->ptr,
|
|
QSE_SIZEOF(qse_char_t)*(ncopy+1));
|
|
QSE_MMGR_FREE (str->mmgr, str->ptr);
|
|
}
|
|
}
|
|
|
|
if (capa < str->len)
|
|
{
|
|
str->len = capa;
|
|
tmp[capa] = QSE_T('\0');
|
|
}
|
|
|
|
str->capa = capa;
|
|
str->ptr = tmp;
|
|
|
|
return str->capa;
|
|
}
|
|
|
|
qse_size_t qse_str_getlen (qse_str_t* str)
|
|
{
|
|
return QSE_STR_LEN (str);
|
|
}
|
|
|
|
qse_size_t qse_str_setlen (qse_str_t* str, qse_size_t len)
|
|
{
|
|
if (len == str->len) return len;
|
|
if (len < str->len)
|
|
{
|
|
str->len = len;
|
|
str->ptr[len] = QSE_T('\0');
|
|
return len;
|
|
}
|
|
|
|
if (len > str->capa)
|
|
{
|
|
if (qse_str_setcapa (str, len) == (qse_size_t)-1)
|
|
return (qse_size_t)-1;
|
|
}
|
|
|
|
while (str->len < len) str->ptr[str->len++] = QSE_T(' ');
|
|
return str->len;
|
|
}
|
|
|
|
void qse_str_clear (qse_str_t* str)
|
|
{
|
|
str->len = 0;
|
|
if (str->ptr != QSE_NULL)
|
|
{
|
|
QSE_ASSERT (str->capa >= 1);
|
|
str->ptr[0] = QSE_T('\0');
|
|
}
|
|
}
|
|
|
|
void qse_str_swap (qse_str_t* str, qse_str_t* str1)
|
|
{
|
|
qse_str_t tmp;
|
|
|
|
tmp.ptr = str->ptr;
|
|
tmp.len = str->len;
|
|
tmp.capa = str->capa;
|
|
tmp.mmgr = str->mmgr;
|
|
|
|
str->ptr = str1->ptr;
|
|
str->len = str1->len;
|
|
str->capa = str1->capa;
|
|
str->mmgr = str1->mmgr;
|
|
|
|
str1->ptr = tmp.ptr;
|
|
str1->len = tmp.len;
|
|
str1->capa = tmp.capa;
|
|
str1->mmgr = tmp.mmgr;
|
|
}
|
|
|
|
qse_size_t qse_str_cpy (qse_str_t* str, const qse_char_t* s)
|
|
{
|
|
/* TODO: improve it */
|
|
return qse_str_ncpy (str, s, qse_strlen(s));
|
|
}
|
|
|
|
qse_size_t qse_str_ncpy (qse_str_t* str, const qse_char_t* s, qse_size_t len)
|
|
{
|
|
if (len > str->capa || str->ptr == QSE_NULL)
|
|
{
|
|
qse_char_t* buf;
|
|
|
|
buf = (qse_char_t*) QSE_MMGR_ALLOC (
|
|
str->mmgr, QSE_SIZEOF(qse_char_t) * (len + 1));
|
|
if (buf == QSE_NULL) return (qse_size_t)-1;
|
|
|
|
if (str->ptr != QSE_NULL) QSE_MMGR_FREE (str->mmgr, str->ptr);
|
|
str->capa = len;
|
|
str->ptr = buf;
|
|
}
|
|
|
|
str->len = qse_strncpy (str->ptr, s, len);
|
|
str->ptr[str->len] = QSE_T('\0');
|
|
return str->len;
|
|
}
|
|
|
|
qse_size_t qse_str_cat (qse_str_t* str, const qse_char_t* s)
|
|
{
|
|
/* TODO: improve it */
|
|
return qse_str_ncat (str, s, qse_strlen(s));
|
|
}
|
|
|
|
qse_size_t qse_str_ncat (qse_str_t* str, const qse_char_t* s, qse_size_t len)
|
|
{
|
|
if (len > str->capa - str->len)
|
|
{
|
|
qse_size_t ncapa;
|
|
|
|
if (str->sizer == QSE_NULL)
|
|
{
|
|
/* increase the capacity by the length to add */
|
|
ncapa = str->len + len;
|
|
/* 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, str->len + len);
|
|
/* if no change in capacity, return current length */
|
|
if (ncapa == str->capa) return str->len;
|
|
}
|
|
|
|
if (qse_str_setcapa (str, ncapa) == (qse_size_t)-1)
|
|
{
|
|
return (qse_size_t)-1;
|
|
}
|
|
}
|
|
|
|
if (len > str->capa - str->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->len;
|
|
}
|
|
|
|
if (len > 0)
|
|
{
|
|
QSE_MEMCPY (&str->ptr[str->len], s, len*QSE_SIZEOF(*s));
|
|
str->len += len;
|
|
str->ptr[str->len] = QSE_T('\0');
|
|
}
|
|
|
|
return str->len;
|
|
}
|
|
|
|
qse_size_t qse_str_ccat (qse_str_t* str, qse_char_t c)
|
|
{
|
|
return qse_str_ncat (str, &c, 1);
|
|
}
|
|
|
|
qse_size_t qse_str_nccat (qse_str_t* str, qse_char_t c, qse_size_t len)
|
|
{
|
|
while (len > 0)
|
|
{
|
|
if (qse_str_ncat (str, &c, 1) == (qse_size_t)-1)
|
|
{
|
|
return (qse_size_t)-1;
|
|
}
|
|
|
|
len--;
|
|
}
|
|
return str->len;
|
|
}
|
|
|
|
qse_size_t qse_str_del (qse_str_t* str, qse_size_t index, qse_size_t size)
|
|
{
|
|
if (str->ptr != QSE_NULL && index < str->len && size > 0)
|
|
{
|
|
qse_size_t nidx = index + size;
|
|
if (nidx >= str->len)
|
|
{
|
|
str->ptr[index] = QSE_T('\0');
|
|
str->len = index;
|
|
}
|
|
else
|
|
{
|
|
qse_strncpy (
|
|
&str->ptr[index], &str->ptr[nidx],
|
|
str->len - nidx);
|
|
str->len -= size;
|
|
}
|
|
}
|
|
|
|
return str->len;
|
|
}
|
|
|
|
qse_size_t qse_str_trm (qse_str_t* str)
|
|
{
|
|
if (str->ptr != QSE_NULL)
|
|
{
|
|
str->len = qse_strxtrm (str->ptr, str->len);
|
|
}
|
|
|
|
return str->len;
|
|
}
|
|
|
|
qse_size_t qse_str_pac (qse_str_t* str)
|
|
{
|
|
if (str->ptr != QSE_NULL)
|
|
{
|
|
str->len = qse_strxpac (str->ptr, str->len);
|
|
}
|
|
|
|
return str->len;
|
|
}
|
|
|