2002-11-12 23:44:54 +00:00
|
|
|
/*
|
|
|
|
**********************************************************************
|
2003-11-05 02:26:49 +00:00
|
|
|
* Copyright (c) 2002-2003, International Business Machines
|
2002-11-12 23:44:54 +00:00
|
|
|
* Corporation and others. All Rights Reserved.
|
|
|
|
**********************************************************************
|
|
|
|
* Author: Alan Liu
|
|
|
|
* Created: November 11 2002
|
|
|
|
* Since: ICU 2.4
|
|
|
|
**********************************************************************
|
|
|
|
*/
|
|
|
|
#include "unicode/ustring.h"
|
|
|
|
#include "unicode/strenum.h"
|
|
|
|
#include "uenumimp.h"
|
|
|
|
#include "ustrenum.h"
|
|
|
|
#include "cstring.h"
|
|
|
|
#include "cmemory.h"
|
|
|
|
|
2003-11-05 22:00:21 +00:00
|
|
|
// StringEnumeration implementation ---------------------------------------- ***
|
|
|
|
|
|
|
|
StringEnumeration::StringEnumeration()
|
|
|
|
: chars(charsBuffer), charsCapacity(sizeof(charsBuffer)) {
|
|
|
|
}
|
2002-11-12 23:44:54 +00:00
|
|
|
|
2003-08-29 16:23:22 +00:00
|
|
|
StringEnumeration::~StringEnumeration() {}
|
|
|
|
|
2003-11-05 02:26:49 +00:00
|
|
|
// StringEnumeration base class clone() default implementation, does not clone
|
|
|
|
StringEnumeration *
|
|
|
|
StringEnumeration::clone() const {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2003-11-05 22:00:21 +00:00
|
|
|
const char *
|
|
|
|
StringEnumeration::next(int32_t *resultLength, UErrorCode &status) {
|
|
|
|
const UnicodeString *s=snext(status);
|
|
|
|
if(s!=NULL) {
|
|
|
|
unistr=*s;
|
|
|
|
ensureCharsCapacity(unistr.length()+1, status);
|
|
|
|
if(U_SUCCESS(status)) {
|
|
|
|
if(resultLength!=NULL) {
|
|
|
|
*resultLength=unistr.length();
|
|
|
|
}
|
|
|
|
unistr.extract(0, INT32_MAX, chars, charsCapacity, "");
|
|
|
|
return chars;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
const UChar *
|
|
|
|
StringEnumeration::unext(int32_t *resultLength, UErrorCode &status) {
|
|
|
|
const UnicodeString *s=snext(status);
|
|
|
|
if(s!=NULL) {
|
|
|
|
unistr=*s;
|
|
|
|
if(U_SUCCESS(status)) {
|
|
|
|
if(resultLength!=NULL) {
|
|
|
|
*resultLength=unistr.length();
|
|
|
|
}
|
|
|
|
return unistr.getTerminatedBuffer();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
StringEnumeration::ensureCharsCapacity(int32_t capacity, UErrorCode &status) {
|
|
|
|
if(U_SUCCESS(status) && capacity>charsCapacity) {
|
|
|
|
if(capacity<(charsCapacity+charsCapacity/2)) {
|
|
|
|
// avoid allocation thrashing
|
|
|
|
capacity=charsCapacity+charsCapacity/2;
|
|
|
|
}
|
|
|
|
if(chars!=charsBuffer) {
|
|
|
|
uprv_free(chars);
|
|
|
|
}
|
|
|
|
chars=(char *)uprv_malloc(capacity);
|
|
|
|
if(chars==NULL) {
|
|
|
|
chars=charsBuffer;
|
|
|
|
charsCapacity=sizeof(charsBuffer);
|
|
|
|
status=U_MEMORY_ALLOCATION_ERROR;
|
|
|
|
} else {
|
|
|
|
charsCapacity=capacity;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
UnicodeString *
|
|
|
|
StringEnumeration::setChars(const char *s, int32_t length, UErrorCode &status) {
|
|
|
|
if(U_SUCCESS(status) && s!=NULL) {
|
|
|
|
if(length<0) {
|
|
|
|
length=uprv_strlen(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
UChar *buffer=unistr.getBuffer(length+1);
|
|
|
|
if(buffer!=NULL) {
|
|
|
|
u_charsToUChars(s, buffer, length);
|
|
|
|
buffer[length]=0;
|
|
|
|
unistr.releaseBuffer(length);
|
|
|
|
return &unistr;
|
|
|
|
} else {
|
|
|
|
status=U_MEMORY_ALLOCATION_ERROR;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// C wrapper --------------------------------------------------------------- ***
|
|
|
|
|
|
|
|
#define THIS(en) ((StringEnumeration*)(en->context))
|
|
|
|
|
2002-11-12 23:44:54 +00:00
|
|
|
U_CDECL_BEGIN
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Wrapper API to make StringEnumeration look like UEnumeration.
|
|
|
|
*/
|
|
|
|
static void U_CALLCONV
|
|
|
|
ustrenum_close(UEnumeration* en) {
|
|
|
|
delete THIS(en);
|
|
|
|
uprv_free(en);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Wrapper API to make StringEnumeration look like UEnumeration.
|
|
|
|
*/
|
|
|
|
static int32_t U_CALLCONV
|
2002-11-21 23:58:25 +00:00
|
|
|
ustrenum_count(UEnumeration* en,
|
|
|
|
UErrorCode* ec)
|
|
|
|
{
|
2002-11-12 23:44:54 +00:00
|
|
|
return THIS(en)->count(*ec);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Wrapper API to make StringEnumeration look like UEnumeration.
|
|
|
|
*/
|
|
|
|
static const UChar* U_CALLCONV
|
2002-11-21 23:58:25 +00:00
|
|
|
ustrenum_unext(UEnumeration* en,
|
|
|
|
int32_t* resultLength,
|
|
|
|
UErrorCode* ec)
|
|
|
|
{
|
2002-11-22 18:16:02 +00:00
|
|
|
return THIS(en)->unext(resultLength, *ec);
|
2002-11-12 23:44:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Wrapper API to make StringEnumeration look like UEnumeration.
|
|
|
|
*/
|
|
|
|
static const char* U_CALLCONV
|
2002-11-21 23:58:25 +00:00
|
|
|
ustrenum_next(UEnumeration* en,
|
|
|
|
int32_t* resultLength,
|
|
|
|
UErrorCode* ec)
|
|
|
|
{
|
2002-11-22 18:16:02 +00:00
|
|
|
return THIS(en)->next(resultLength, *ec);
|
2002-11-12 23:44:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Wrapper API to make StringEnumeration look like UEnumeration.
|
|
|
|
*/
|
|
|
|
static void U_CALLCONV
|
2002-11-21 23:58:25 +00:00
|
|
|
ustrenum_reset(UEnumeration* en,
|
|
|
|
UErrorCode* ec)
|
|
|
|
{
|
2002-11-12 23:44:54 +00:00
|
|
|
THIS(en)->reset(*ec);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Pseudo-vtable for UEnumeration wrapper around StringEnumeration.
|
|
|
|
* The StringEnumeration pointer will be stored in 'context'.
|
|
|
|
*/
|
|
|
|
static const UEnumeration TEMPLATE = {
|
|
|
|
NULL,
|
|
|
|
NULL, // store StringEnumeration pointer here
|
|
|
|
ustrenum_close,
|
|
|
|
ustrenum_count,
|
|
|
|
ustrenum_unext,
|
|
|
|
ustrenum_next,
|
|
|
|
ustrenum_reset
|
|
|
|
};
|
|
|
|
|
|
|
|
U_CDECL_END
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Given a StringEnumeration, wrap it in a UEnumeration. The
|
|
|
|
* StringEnumeration is adopted; after this call, the caller must not
|
|
|
|
* delete it (regardless of error status).
|
|
|
|
*/
|
|
|
|
U_CAPI UEnumeration* U_EXPORT2
|
|
|
|
uenum_openStringEnumeration(StringEnumeration* adopted, UErrorCode* ec) {
|
|
|
|
UEnumeration* result = NULL;
|
|
|
|
if (U_SUCCESS(*ec) && adopted != NULL) {
|
|
|
|
result = (UEnumeration*) uprv_malloc(sizeof(UEnumeration));
|
|
|
|
if (result == NULL) {
|
|
|
|
*ec = U_MEMORY_ALLOCATION_ERROR;
|
|
|
|
} else {
|
|
|
|
uprv_memcpy(result, &TEMPLATE, sizeof(TEMPLATE));
|
|
|
|
result->context = adopted;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (result == NULL) {
|
|
|
|
delete adopted;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
//eof
|