You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
115 lines
3.0 KiB
115 lines
3.0 KiB
/***************************************************************************
|
|
*
|
|
* Copyright (C) 2006 Elad Lahav (elad_lahav@users.sf.net)
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
***************************************************************************/
|
|
|
|
#include <tqstring.h>
|
|
#include "encoder.h"
|
|
|
|
#define CHAR_TO_HEX(c) ((c) < 0xA ? '0' + (c) : ('A' - 0xA) + (c))
|
|
#define HEX_TO_CHAR(h) ((h) > 'A' ? (h) - ('A' - 0xA) : (h) - '0')
|
|
|
|
/**
|
|
* Class constructor.
|
|
*/
|
|
Encoder::Encoder() : m_pBuf(NULL), m_nBufLen(0)
|
|
{
|
|
}
|
|
|
|
/**
|
|
* Class destructor.
|
|
*/
|
|
Encoder::~Encoder() {
|
|
if (m_pBuf)
|
|
delete[] m_pBuf;
|
|
}
|
|
|
|
/**
|
|
* Encodes a string.
|
|
* @param str The string to encode
|
|
* @return The hex-encoded ASCII string
|
|
*/
|
|
const char* Encoder::encode(const TQString& str)
|
|
{
|
|
const char* szStr;
|
|
int nLen, i, j;
|
|
|
|
szStr = str.latin1();
|
|
nLen = str.length();
|
|
|
|
// Ensure the buffer is big enough to contain the result
|
|
resize((nLen * 2) + 1);
|
|
|
|
// Encode the string
|
|
for (i = 0, j = 0; i < nLen; i++, j += 2) {
|
|
m_pBuf[j] = CHAR_TO_HEX(szStr[i] >> 4);
|
|
m_pBuf[j + 1] = CHAR_TO_HEX(szStr[i] & 0x0f);
|
|
}
|
|
|
|
m_pBuf[j] = 0;
|
|
return m_pBuf;
|
|
}
|
|
|
|
/**
|
|
* Decodes a string.
|
|
* @param str The string to decode
|
|
* @return The decoded string.
|
|
*/
|
|
const char* Encoder::decode(const TQString& str)
|
|
{
|
|
const char* szStr;
|
|
int nLen, i, j;
|
|
|
|
szStr = str.latin1();
|
|
nLen = str.length();
|
|
|
|
// Ensure the buffer is big enough to contain the result
|
|
nLen /= 2;
|
|
resize(nLen + 1);
|
|
|
|
// Decode the string
|
|
for (i = 0, j = 0; i < nLen; i++, j += 2) {
|
|
m_pBuf[i] = HEX_TO_CHAR(szStr[j]) << 4;
|
|
m_pBuf[i] |= HEX_TO_CHAR(szStr[j + 1]);
|
|
}
|
|
|
|
m_pBuf[i] = 0;
|
|
return m_pBuf;
|
|
}
|
|
|
|
/**
|
|
* Sets a new size to the buffer.
|
|
* @param nNewLen The new size of the buffer
|
|
*/
|
|
void Encoder::resize(int nNewLen)
|
|
{
|
|
if (m_nBufLen < nNewLen) {
|
|
if (m_pBuf)
|
|
delete[] m_pBuf;
|
|
|
|
m_pBuf = new char[nNewLen];
|
|
}
|
|
}
|