189 lines
3.8 KiB
C++
189 lines
3.8 KiB
C++
/*
|
|
* Dillo Widget
|
|
*
|
|
* Copyright 2005-2007 Sebastian Geerken <sgeerken@dillo.org>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program 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 General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
|
|
|
|
#include "misc.hh"
|
|
|
|
#include <ctype.h>
|
|
#include <config.h>
|
|
|
|
#define PRGNAME PACKAGE "/" VERSION
|
|
|
|
namespace lout {
|
|
|
|
namespace misc {
|
|
|
|
const char *prgName = PRGNAME;
|
|
|
|
// ------------------
|
|
// StringBuffer
|
|
// ------------------
|
|
|
|
|
|
StringBuffer::StringBuffer()
|
|
{
|
|
firstNode = lastNode = NULL;
|
|
numChars = 0;
|
|
str = NULL;
|
|
strValid = false;
|
|
}
|
|
|
|
StringBuffer::~StringBuffer()
|
|
{
|
|
clear ();
|
|
if (str)
|
|
delete[] str;
|
|
}
|
|
|
|
/**
|
|
* \brief Append a NUL-terminated string to the buffer, without copying.
|
|
*
|
|
* No copy is made, so this method should only be used in cases, where
|
|
* the string would otherwise be freed again. (This method may then
|
|
* save some CPU cycles.)
|
|
*/
|
|
void StringBuffer::appendNoCopy(char *str)
|
|
{
|
|
Node *node = new Node();
|
|
node->data = str;
|
|
node->next = NULL;
|
|
|
|
if (firstNode == NULL) {
|
|
firstNode = node;
|
|
lastNode = node;
|
|
} else {
|
|
lastNode->next = node;
|
|
lastNode = node;
|
|
}
|
|
|
|
numChars += strlen(str);
|
|
strValid = false;
|
|
}
|
|
|
|
/**
|
|
* \brief Return a NUL-terminated strings containing all appended strings.
|
|
*
|
|
* The caller does not have to free the string, this is done in
|
|
* misc::StringBuffer::~StringBuffer.
|
|
*/
|
|
const char *StringBuffer::getChars()
|
|
{
|
|
if (strValid)
|
|
return str;
|
|
|
|
if (str)
|
|
delete[] str;
|
|
str = new char[numChars + 1];
|
|
char *p = str;
|
|
|
|
for (Node *node = firstNode; node; node = node->next) {
|
|
int l = strlen(node->data);
|
|
memcpy(p, node->data, l * sizeof(char));
|
|
p += l;
|
|
}
|
|
|
|
*p = 0;
|
|
strValid = true;
|
|
return str;
|
|
}
|
|
|
|
/**
|
|
* \brief Remove all strings appended to the string buffer.
|
|
*/
|
|
void StringBuffer::clear ()
|
|
{
|
|
Node *node, *nextNode;
|
|
for (node = firstNode; node; node = nextNode) {
|
|
nextNode = node->next;
|
|
free(node->data);
|
|
delete node;
|
|
}
|
|
firstNode = lastNode = NULL;
|
|
numChars = 0;
|
|
strValid = false;
|
|
}
|
|
|
|
|
|
// ------------
|
|
// BitSet
|
|
// ------------
|
|
|
|
BitSet::BitSet(int initBits)
|
|
{
|
|
numBits = initBits;
|
|
numBytes = bytesForBits(initBits);
|
|
bits = (unsigned char*)malloc(numBytes * sizeof(unsigned char));
|
|
clear();
|
|
}
|
|
|
|
BitSet::~BitSet()
|
|
{
|
|
free(bits);
|
|
}
|
|
|
|
void BitSet::intoStringBuffer(misc::StringBuffer *sb)
|
|
{
|
|
sb->append("[");
|
|
for (int i = 0; i < numBits; i++)
|
|
sb->append(get(i) ? "1" : "0");
|
|
sb->append("]");
|
|
}
|
|
|
|
bool BitSet::get(int i) const
|
|
{
|
|
if (8 * i >= numBytes)
|
|
return false;
|
|
else
|
|
return bits[i / 8] & (1 << (i % 8));
|
|
}
|
|
|
|
void BitSet::set(int i, bool val)
|
|
{
|
|
if (i > numBits)
|
|
numBits = i;
|
|
|
|
if (8 * i >= numBytes) {
|
|
int newNumBytes = numBytes;
|
|
while (8 * i >= newNumBytes)
|
|
newNumBytes *= 2;
|
|
|
|
void *vp;
|
|
assert((vp = realloc(bits, newNumBytes * sizeof(unsigned char))));
|
|
if (!vp) exit(-2); // when NDEBUG is defined
|
|
bits = (unsigned char*)vp;
|
|
memset(bits + numBytes, 0, newNumBytes - numBytes);
|
|
numBytes = newNumBytes;
|
|
}
|
|
|
|
if (val)
|
|
bits[i / 8] |= (1 << (i % 8));
|
|
else
|
|
bits[i / 8] &= ~(1 << (i % 8));
|
|
}
|
|
|
|
void BitSet::clear()
|
|
{
|
|
memset(bits, 0, numBytes);
|
|
}
|
|
|
|
} // namespace misc
|
|
|
|
} // namespace lout
|