aboutsummaryrefslogtreecommitdiff
path: root/lout
diff options
context:
space:
mode:
authorJorge Arellano Cid <jcid@dillo.org>2009-02-09 14:56:31 -0300
committerJorge Arellano Cid <jcid@dillo.org>2009-02-09 14:56:31 -0300
commite32686c10a4f4fe7c34b181845220b5c491f32fb (patch)
treec090052c311a3a1732d03dc17fe357f97437b397 /lout
parent74f64426001a693759e47963f99965e0e6ee847d (diff)
whitespace cleanup: 's/ +$//g'
Diffstat (limited to 'lout')
-rw-r--r--lout/container.cc4
-rw-r--r--lout/container.hh14
-rw-r--r--lout/identity.hh4
-rw-r--r--lout/misc.cc6
-rw-r--r--lout/misc.hh8
-rw-r--r--lout/object.cc2
-rw-r--r--lout/object.hh6
-rw-r--r--lout/signal.hh4
8 files changed, 24 insertions, 24 deletions
diff --git a/lout/container.cc b/lout/container.cc
index 6c886baa..d44d92d4 100644
--- a/lout/container.cc
+++ b/lout/container.cc
@@ -77,7 +77,7 @@ Iterator &Iterator::operator=(Iterator &it2)
Iterator::~Iterator()
{
if (impl)
- impl->unref();
+ impl->unref();
}
// ----------------
@@ -241,7 +241,7 @@ void List::append(Object *element)
if (last) {
last->next = newLast;
last = newLast;
- } else
+ } else
first = last = newLast;
numElements++;
diff --git a/lout/container.hh b/lout/container.hh
index 26803e23..52c5019f 100644
--- a/lout/container.hh
+++ b/lout/container.hh
@@ -20,7 +20,7 @@ namespace lout {
namespace container {
/**
- * \brief The container classes defined here contain instances of
+ * \brief The container classes defined here contain instances of
* object::Object.
*
* Different sub-classes may be mixed, and you have to care about casting,
@@ -44,13 +44,13 @@ protected:
{
private:
int refcount;
-
+
public:
AbstractIterator() { refcount = 1; }
-
+
void ref () { refcount++; }
void unref () { refcount--; if (refcount == 0) delete this; }
-
+
virtual bool hasNext () = 0;
virtual Object *getNext () = 0;
};
@@ -60,7 +60,7 @@ protected:
};
/**
- * \brief This is a small wrapper for AbstractIterator, which may be used
+ * \brief This is a small wrapper for AbstractIterator, which may be used
* directly, not as a pointer, to makes memory management simpler.
*/
class Iterator
@@ -271,7 +271,7 @@ protected:
public:
Stack (bool ownerOfObjects);
~Stack();
-
+
void push (object::Object *object);
void pushUnder (object::Object *object);
inline object::Object *getTop () { return top ? top->object : NULL; }
@@ -421,7 +421,7 @@ public:
inline Stack (bool ownerOfObjects)
{ this->base = new untyped::Stack (ownerOfObjects); }
~Stack() { delete this->base; }
-
+
inline void push (T *object) {
((untyped::Stack*)this->base)->push (object); }
inline void pushUnder (T *object)
diff --git a/lout/identity.hh b/lout/identity.hh
index 7dcdbac4..544656fc 100644
--- a/lout/identity.hh
+++ b/lout/identity.hh
@@ -131,11 +131,11 @@ public:
* identity::IdentifiableObject::instanceOf are done.
*/
int getClassId () { return classId; }
-
+
/**
* \brief Return the name, under which the class of this object was
* registered.
- */
+ */
const char *getClassName() { return classesById->get(classId)->className; }
bool instanceOf (int otherClassId);
diff --git a/lout/misc.cc b/lout/misc.cc
index 435fe8be..2e4dfaf5 100644
--- a/lout/misc.cc
+++ b/lout/misc.cc
@@ -154,7 +154,7 @@ const char *StringBuffer::getChars()
memcpy(p, node->data, l * sizeof(char));
p += l;
}
-
+
*p = 0;
strValid = true;
return str;
@@ -183,7 +183,7 @@ void StringBuffer::clear ()
BitSet::BitSet(int initBits)
{
- numBytes = bytesForBits(initBits);
+ numBytes = bytesForBits(initBits);
bits = (unsigned char*)malloc(numBytes * sizeof(unsigned char));
clear();
}
@@ -220,7 +220,7 @@ void BitSet::set(int i, bool val)
memset(bits + numBytes, 0, newNumBytes - numBytes);
numBytes = newNumBytes;
}
-
+
if (val)
bits[i / 8] |= (1 << (i % 8));
else
diff --git a/lout/misc.hh b/lout/misc.hh
index 730a47a4..aa32a4f5 100644
--- a/lout/misc.hh
+++ b/lout/misc.hh
@@ -51,7 +51,7 @@ class Comparable
{
public:
virtual ~Comparable();
-
+
/**
* \brief Compare two objects c1 and c2.
*
@@ -240,9 +240,9 @@ class BitSet
private:
unsigned char *bits;
int numBytes;
-
+
inline int bytesForBits(int bits) { return bits == 0 ? 1 : (bits + 7) / 8; }
-
+
public:
BitSet(int initBits);
~BitSet();
@@ -263,7 +263,7 @@ private:
size_t poolSize, poolLimit, freeIdx;
SimpleVector <char*> *pools;
SimpleVector <char*> *bulk;
-
+
public:
ZoneAllocator (size_t poolSize) {
this->poolSize = poolSize;
diff --git a/lout/object.cc b/lout/object.cc
index 684bb8fa..beef4005 100644
--- a/lout/object.cc
+++ b/lout/object.cc
@@ -271,7 +271,7 @@ int PairBase::hashValue()
value ^= first->hashValue();
if (second)
value ^= second->hashValue();
-
+
return value;
}
diff --git a/lout/object.hh b/lout/object.hh
index 7d505c99..789542fe 100644
--- a/lout/object.hh
+++ b/lout/object.hh
@@ -40,7 +40,7 @@ class Pointer: public Object
{
private:
void *value;
-
+
public:
Pointer(void *value) { this->value = value; }
bool equals(Object *other);
@@ -93,9 +93,9 @@ public:
int hashValue();
int compareTo(Comparable *other);
void intoStringBuffer(misc::StringBuffer *sb);
-
+
inline const char *chars() { return str; }
-
+
static int hashValue(const char *str);
};
diff --git a/lout/signal.hh b/lout/signal.hh
index c96247be..9a5635d0 100644
--- a/lout/signal.hh
+++ b/lout/signal.hh
@@ -160,7 +160,7 @@
* // ...
* };
* \endcode
- *
+ *
* The constructor of Qix should then set \em qix:
*
* \code
@@ -217,7 +217,7 @@ private:
container::typed::List <Receiver> *receivers;
void unconnect (Receiver *receiver);
-
+
protected:
void emitVoid (int signalNo, int argc, Object **argv);
bool emitBool (int signalNo, int argc, Object **argv);