aboutsummaryrefslogtreecommitdiffstats
path: root/lib/bufferarray.cc
diff options
context:
space:
mode:
authorFritz Elfert <felfert@to.com>2001-03-01 00:22:23 +0000
committerFritz Elfert <felfert@to.com>2001-03-01 00:22:23 +0000
commit75007da068aac10fed90fc5234ab2d50deed3e61 (patch)
treebe0a8ebba9bad4ccab4600c60d9e7fcc21dc7837 /lib/bufferarray.cc
parentd8ae774198cf180fcaa4a2512dd94b4dbfdfd72d (diff)
downloadplptools-75007da068aac10fed90fc5234ab2d50deed3e61.tar.gz
plptools-75007da068aac10fed90fc5234ab2d50deed3e61.tar.bz2
plptools-75007da068aac10fed90fc5234ab2d50deed3e61.zip
Modified icons.
Started NLS support. Added kpsion KDE2 application. Unified file-headers.
Diffstat (limited to 'lib/bufferarray.cc')
-rw-r--r--lib/bufferarray.cc185
1 files changed, 96 insertions, 89 deletions
diff --git a/lib/bufferarray.cc b/lib/bufferarray.cc
index 953ec8f..65f2acf 100644
--- a/lib/bufferarray.cc
+++ b/lib/bufferarray.cc
@@ -1,25 +1,26 @@
-//
-// PLP - An implementation of the PSION link protocol
-//
-// Copyright (C) 1999 Philip Proudman
-// extensions Copyright (C) 2000 Fritz Elfert <felfert@to.com>
-//
-// 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 2 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, write to the Free Software
-// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-//
-// e-mail philip.proudman@btinternet.com
-
+/*-*-c++-*-
+ * $Id$
+ *
+ * This file is part of plptools.
+ *
+ * Copyright (C) 1999 Philip Proudman <philip.proudman@btinternet.com>
+ * Copyright (C) 2000, 2001 Fritz Elfert <felfert@to.com>
+ *
+ * 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 2 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, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ */
#include <stream.h>
#include <iomanip.h>
@@ -29,136 +30,142 @@
bufferArray::bufferArray()
{
- len = 0;
- lenAllocd = ALLOC_MIN;
- buff = new bufferStore[lenAllocd];
+ len = 0;
+ lenAllocd = ALLOC_MIN;
+ buff = new bufferStore[lenAllocd];
}
bufferArray::bufferArray(const bufferArray & a)
{
- len = a.len;
- lenAllocd = a.lenAllocd;
- buff = new bufferStore[lenAllocd];
- for (int i = 0; i < len; i++)
- buff[i] = a.buff[i];
+ len = a.len;
+ lenAllocd = a.lenAllocd;
+ buff = new bufferStore[lenAllocd];
+ for (int i = 0; i < len; i++)
+ buff[i] = a.buff[i];
}
bufferArray::~bufferArray()
{
- delete []buff;
+ delete []buff;
}
bufferStore bufferArray::
pop()
{
- bufferStore ret;
- if (len > 0) {
- ret = buff[0];
- len--;
- for (long i = 0; i < len; i++) {
- buff[i] = buff[i + 1];
- }
+ bufferStore ret;
+ if (len > 0) {
+ ret = buff[0];
+ len--;
+ for (long i = 0; i < len; i++) {
+ buff[i] = buff[i + 1];
}
- return ret;
+ }
+ return ret;
}
void bufferArray::
append(const bufferStore & b)
{
- if (len == lenAllocd) {
- lenAllocd += ALLOC_MIN;
- bufferStore *nb = new bufferStore[lenAllocd];
- for (long i = 0; i < len; i++) {
- nb[i] = buff[i];
- }
- delete []buff;
- buff = nb;
+ if (len == lenAllocd) {
+ lenAllocd += ALLOC_MIN;
+ bufferStore *nb = new bufferStore[lenAllocd];
+ for (long i = 0; i < len; i++) {
+ nb[i] = buff[i];
}
- buff[len++] = b;
+ delete []buff;
+ buff = nb;
+ }
+ buff[len++] = b;
}
void bufferArray::
push(const bufferStore & b)
{
- if (len == lenAllocd)
- lenAllocd += ALLOC_MIN;
- bufferStore *nb = new bufferStore[lenAllocd];
- for (long i = len; i > 0; i--) {
- nb[i] = buff[i - 1];
- }
- nb[0] = b;
- delete[]buff;
- buff = nb;
- len++;
+ if (len == lenAllocd)
+ lenAllocd += ALLOC_MIN;
+ bufferStore *nb = new bufferStore[lenAllocd];
+ for (long i = len; i > 0; i--) {
+ nb[i] = buff[i - 1];
+ }
+ nb[0] = b;
+ delete[]buff;
+ buff = nb;
+ len++;
}
long bufferArray::
length(void)
{
- return len;
+ return len;
}
void bufferArray::
clear(void)
{
- len = 0;
- lenAllocd = ALLOC_MIN;
- delete []buff;
- buff = new bufferStore[lenAllocd];
+ len = 0;
+ lenAllocd = ALLOC_MIN;
+ delete []buff;
+ buff = new bufferStore[lenAllocd];
}
bufferArray &bufferArray::
operator =(const bufferArray & a)
{
- delete []buff;
- len = a.len;
- lenAllocd = a.lenAllocd;
- buff = new bufferStore[lenAllocd];
- for (int i = 0; i < len; i++)
- buff[i] = a.buff[i];
- return *this;
+ delete []buff;
+ len = a.len;
+ lenAllocd = a.lenAllocd;
+ buff = new bufferStore[lenAllocd];
+ for (int i = 0; i < len; i++)
+ buff[i] = a.buff[i];
+ return *this;
}
bufferStore &bufferArray::
operator [](const unsigned long index)
{
- return buff[index];
+ return buff[index];
}
bufferArray bufferArray::
operator +(const bufferStore &s)
{
- bufferArray res = *this;
- res += s;
- return res;
+ bufferArray res = *this;
+ res += s;
+ return res;
}
bufferArray bufferArray::
operator +(const bufferArray &a)
{
- bufferArray res = *this;
- res += a;
- return res;
+ bufferArray res = *this;
+ res += a;
+ return res;
}
bufferArray &bufferArray::
operator +=(const bufferArray &a)
{
- lenAllocd += a.lenAllocd;
- bufferStore *nb = new bufferStore[lenAllocd];
- for (int i = 0; i < len; i++)
- nb[len + i] = buff[i];
- for (int i = 0; i < a.len; i++)
- nb[len + i] = a.buff[i];
- len += a.len;
- delete []buff;
- buff = nb;
- return *this;
+ lenAllocd += a.lenAllocd;
+ bufferStore *nb = new bufferStore[lenAllocd];
+ for (int i = 0; i < len; i++)
+ nb[len + i] = buff[i];
+ for (int i = 0; i < a.len; i++)
+ nb[len + i] = a.buff[i];
+ len += a.len;
+ delete []buff;
+ buff = nb;
+ return *this;
}
bufferArray &bufferArray::
operator +=(const bufferStore &s)
{
- append(s);
- return *this;
+ append(s);
+ return *this;
}
+
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * End:
+ */