www.pudn.com > EasySoap++-0.6.1.rar > SOAPUtil.h

/* 
 * EasySoap++ - A C++ library for SOAP (Simple Object Access Protocol)
 * Copyright (C) 2001 David Crowley; SciTegic, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this library; if not, write to the Free
 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 * $Id: SOAPUtil.h,v 1.4 2002/04/03 01:53:13 dcrowley Exp $
 */

#ifndef __SOAPUTIL_H__
#define __SOAPUTIL_H__

#include 

BEGIN_EASYSOAP_NAMESPACE

template
inline T*
sp_alloc(size_t n)
{
	return (T*)malloc(n * sizeof(T));
}

template
inline void
sp_free(T*& ptr)
{
	if (ptr)
		free((void *)ptr);
	ptr = 0;
}

inline char *
sp_strcpy(char *dest, const char *src)
{
	char *work = dest;
	if (src && dest)
	{
		while ((*work++ = *src++))
			;
	}
	return dest;
}

inline char *
sp_strncpy(char *dest, const char *src, size_t n)
{
	char *work = dest;
	if (src && dest)
	{
		while (n-- && (*work++ = *src++))
			;
	}
	return dest;
}

inline size_t
sp_strlen(const char *str)
{
	size_t ret = 0;
	if (str)
	{
		while (*str++)
			++ret;
	}
	return ret;
}

inline int
sp_toupper(int c)
{
	if (c >= 'a' && c <= 'z')
		c += 'A' - 'a';
	return c;
}

inline int
sp_strcmp(const char *a, const char *b)
{
	int ret = 0;
	if (a && b)
	{
		while (*a && *b && *a == *b)
			++a, ++b;
		ret = *a - *b;
	}
	else if (a)
		ret = 1;
	else if (b)
		ret = -1;
	return ret;
}

inline int
sp_strncmp(const char *a, const char *b, unsigned int n)
{
	int ret = 0;
	if (a && b)
	{
		while (n > 0 && *a && *b && *a == *b)
			++a, ++b, --n;
		if (n == 0)
			ret = 0;
		else
			ret = *a - *b;
	}
	else if (a)
		ret = 1;
	else if (b)
		ret = -1;
	return ret;
}

inline int
sp_strcasecmp(const char *a, const char *b)
{
	int ret = 0;
	if (a && b)
	{
		int ua;
		int ub;
		do
		{
			ua = sp_toupper(*a++);
			ub = sp_toupper(*b++);
		}
		while (ua && ub && ua == ub);
		ret = ua - ub;
	}
	else if (a)
		ret = 1;
	else if (b)
		ret = -1;
	return ret;
}

inline char*
sp_strstr(const char *haystack, const char *needle)
{
	if (haystack && needle)
	{
		if (*needle == 0)
			return (char *)haystack;

		// step along the main string
		while (*haystack)
		{
			const char *nn = needle;
			const char *hh = haystack;
			// see if substring characters match
			while (*nn++ == *hh++)
			{
				if (*nn == 0)
					// we got all the way to the end of the substring
					// so we must've won
					return (char *)haystack;
			}
			++haystack;
		}
	}
	return 0;
}

inline bool
sp_isspace(char c)
{
	switch (c)
	{
	case '\r':	// carriage return
	case '\n':	// newline
	case '\t':	// tab
	case '\v':	// vertical tab
	case '\f':	// form feed
	case ' ':   // space
		return true;
	}
	return false;
}

inline char*
sp_strchr(const char *s, char c)
{
	if (s)
	{
		do
			if (*s == c)
				return (char*)s;
		while (*s++);
	}
	return 0;
}

inline char*
sp_strrchr(const char *s, char c)
{
	char *w = 0;
	if (s)
	{
		do
			if (*s == c)
				w = (char*)s;
		while (*s++);
	}
	return w;
}

inline void *
sp_memset(void *s, int c, size_t n)
{
	unsigned char *ptr = (unsigned char *)s;
	if (ptr)
	{
		while (n--)
			*ptr++ = c;
	}
	return s;
}

inline unsigned int
sp_hashcode(const char *key)
{
	unsigned char* ptr = (unsigned char*)key;
	unsigned int h = 0;
	if (ptr)
	{
		unsigned int c;
		while ((c = *ptr++))
			h = 31 * h + c;
	}
	return h;
}

inline unsigned int
sp_hashcodecase(const char *key)
{
	unsigned char* ptr = (unsigned char*)key;
	unsigned int h = 0;
	if (ptr)
	{
		unsigned int c;
		while ((c = sp_toupper(*ptr++)))
			h = 31 * h + c;
	}
	return h;
}

template 
inline T
sp_minimum(const T& a, const T& b)
{
	return (a < b) ? a : b;
}

template 
inline T
sp_maximum(const T& a, const T& b)
{
	return (a < b) ? b : a;
}

template 
inline T*
// The incoming buffer should be at least 12 bytes for a long
sp_itoa(L a, T *const buffer)
{
    T *ptr = buffer;

	// check if we're negative
	bool neg = (a < 0);

	// handle first char before we make the
	// number positive
    int rem = a % 10;
    a /= 10;

	// since we just did the divide, we know we're
	// not max int.  so it's now safe to do a=-a.
    if (neg)
    {
        rem = -rem;
        a = -a;
		*ptr++ = '-';
    }

	//
	// store begining of string
	// we have to reverse
  	T *b = ptr;
	*ptr++ = rem + '0';

	// while we have a non-zero value
	// get the base 10 remainder
    while (a != 0)
    {
        *ptr++ = (a % 10) + '0';
        a /= 10;
    }

	// null terminate
	*ptr = 0;

	// now reverse the string
	while (b < --ptr)
	{
		T keep = *b;
		*b++ = *ptr;
		*ptr = keep;
	}

    return buffer;
}

//
// Functions to convert between
// UTF16 and UCS character encoding.
template 
inline bool
sp_UCS_UTF16(int c, T& utf16)
{
	if (c > 0xFFFF && c < 0x00110000)
	{ 
		*utf16++ = (0xD7C0 + (c >> 10));
		*utf16++ = (0xDC00 | c & 0x3FF);
	}
	else if (c >= 0)
	{
		*utf16++ = c;
	}
	else
	{
		return false;
	}
	return true;
}

template 
inline bool
sp_UTF16_UCS(T& utf16, int& c)
{
	int x = utf16[0];

	if (x >= 0 && x <= 0xD7FF || x >= 0xE000 && x <= 0xFFFF)
	{
		c = x;
		++utf16;
	}
	else
	{
		int y = utf16[1];
		if (x >= 0xD800 && x <= 0xDBFF && y >= 0xDC00 && y <= 0xDFFF)
		{
			c = (x - 0xD800) * 0x400 + y - 0xDC00;
			++utf16; ++utf16;
		}
		else
		{
			return false;
		}
	}
	return true;
}

//
// Functions to convert between
// UTF8 and UCS character encoding.
//
// T is an iterator.  (or pointer)
inline bool
sp_UCS_UTF8(int c, char *& utf8)
{
	if (c < 0)
		return false;

	if (c <= 0x7F)
	{
		/* Leave ASCII encoded */
		*utf8++ = (c);
	}
	else if (c <= 0x07FF)
	{
		/* 110xxxxx 10xxxxxx */
		*utf8++ = (0xC0 | (c >> 6));
		*utf8++ = (0x80 | (c & 0x3F));
	}
	else if (c <= 0xFFFF)
	{
		/* 1110xxxx + 2 */
		*utf8++ = (0xE0 | (c >> 12));
		*utf8++ = (0x80 | ((c >> 6) & 0x3F));
		*utf8++ = (0x80 | (c & 0x3F));
	}
	else if (c <= 0x1FFFFF)
	{
		/* 11110xxx + 3 */
		*utf8++ = (0xF0 | (c >> 18));
		*utf8++ = (0x80 | ((c >> 12) & 0x3F));
		*utf8++ = (0x80 | ((c >> 6) & 0x3F));
		*utf8++ = (0x80 | (c & 0x3F));
	}
	else if (c <= 0x3FFFFFF)
	{
		/* 111110xx + 4 */
		*utf8++ = (0xF8 | (c >> 24));
		*utf8++ = (0x80 | ((c >> 18) & 0x3F));
		*utf8++ = (0x80 | ((c >> 12) & 0x3F));
		*utf8++ = (0x80 | ((c >> 6) & 0x3F));
		*utf8++ = (0x80 | (c & 0x3F));
	}
	else //if (c <= 0x7FFFFFFF)
	{
		/* 1111110x + 5 */
		*utf8++ = (0xFC | (c >> 30));
		*utf8++ = (0x80 | ((c >> 24) & 0x3F));
		*utf8++ = (0x80 | ((c >> 18) & 0x3F));
		*utf8++ = (0x80 | ((c >> 12) & 0x3F));
		*utf8++ = (0x80 | ((c >> 6) & 0x3F));
		*utf8++ = (0x80 | (c & 0x3F));
	}

	return true;
}

inline bool
sp_UTF8_UCS(const char *& utf8, int& c)
{
	int b = (unsigned char)*utf8++;
	if (b <= 0x7F)
	{
		c = b;
	}
	else if ((b & 0xE0) == 0xC0)
	{	/* 110xxxxx 10xxxxxx */
		c = (b & 0x1F) << 6;
		b = *utf8++;
		c |= b & 0x3F;
	}
	else if ((b & 0xF0) == 0xE0)
	{	/* 1110xxxx + 2 */
		c = (b & 0x0F) << 12;
		b = *utf8++;
		c |= (b & 0x3F) << 6;
		b = *utf8++;
		c |= b & 0x3F;
	}
	else if ((b & 0xF1) == 0xF0)
	{	/* 11110xxx + 3 */
		c = (b & 0x0F) << 18;
		b = *utf8++;
		c |= (b & 0x3F) << 12;
		b = *utf8++;
		c |= (b & 0x3F) << 6;
		b = *utf8++;
		c |= b & 0x3F;
	}
	else if ((b & 0xFD) == 0xF8)
	{
		/* 111110xx + 4 */
		c = (b & 0x0F) << 24;
		b = *utf8++;
		c |= (b & 0x0F) << 18;
		b = *utf8++;
		c |= (b & 0x3F) << 12;
		b = *utf8++;
		c |= (b & 0x3F) << 6;
		b = *utf8++;
		c |= b & 0x3F;
	}
	else if ((b & 0xFE) == 0xFC)
	{	
		/* 1111110x + 5 */
		c = (b & 0x0F) << 30;
		b = *utf8++;
		c |= (b & 0x0F) << 24;
		b = *utf8++;
		c |= (b & 0x0F) << 18;
		b = *utf8++;
		c |= (b & 0x3F) << 12;
		b = *utf8++;
		c |= (b & 0x3F) << 6;
		b = *utf8++;
		c |= b & 0x3F;
	}
	else
	{
		/* Error */
		return false;
	}
  	return true;
}

END_EASYSOAP_NAMESPACE

#endif // __SOAPUTIL_H__