/usr/include/dime/util/Array.h is in libdime-dev 0.20030921-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 | /**************************************************************************\
*
* FILE: Array.h
*
* This source file is part of DIME.
* Copyright (C) 1998-1999 by Systems In Motion. All rights reserved.
*
* This library is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License, version 2, as
* published by the Free Software Foundation.
*
* 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
* General Public License (the accompanying file named COPYING) for more
* details.
*
**************************************************************************
*
* If you need DIME for a non-GPL project, contact Systems In Motion
* to acquire a Professional Edition License:
*
* Systems In Motion http://www.sim.no/
* Prof. Brochs gate 6 sales@sim.no
* N-7030 Trondheim Voice: +47 22114160
* NORWAY Fax: +47 67172912
*
\**************************************************************************/
#ifndef DIME_ARRAY_H
#define DIME_ARRAY_H
#include <stdlib.h>
#include <dime/Basic.h>
// FIXME: the #pragmas below is just a quick hack to avoid heaps of
// irritating warning messages from the compiler for client code
// compiled under MSVC++. Should try to find the real reason for the
// warnings and fix the cause of the problem instead. 20020730 mortene.
//
// UPDATE 20030617 mortene: there is a Microsoft Knowledge Base
// article at <URL:http://support.microsoft.com> which is related to
// this problem. It's article number KB168958.
//
// In short, the general solution is that classes that exposes usage
// of dimeArray<type> needs to declare the specific template instance
// with "extern" and __declspec(dllimport/export).
//
// That is a lot of work to change, tho'. Another possibility which
// might be better is to simply avoid using (exposing) dimeArray from
// any of the other public classes. Judging from a quick look, this
// seems feasible, and just a couple of hours or so of work.
//
#ifdef _MSC_VER // Microsoft Visual C++
#pragma warning(disable:4251)
#pragma warning(disable:4275)
#endif // _MSC_VER
template <class T>
class dimeArray
{
public:
dimeArray(const int initsize = 4);
~dimeArray();
void append(const T &value);
void append(const dimeArray<T> &array);
void prepend(const dimeArray<T> &array);
void insertElem(const int idx, const T &value);
void setElem(const int index, const T &value);
T getElem(const int index) const;
void getElem(const int index, T &elem) const;
T getLastElem() const;
void getLastElem(T &elem) const;
T &operator [](const int index);
T operator [](const int index) const;
void removeElem(const int index);
void removeElemFast(const int index);
void reverse();
void setCount(const int count);
void makeEmpty(const int initsize = 4);
void freeMemory();
int count() const;
int allocSize() const;
T *arrayPointer();
const T *constArrayPointer() const;
void shrinkToFit();
private:
void growArray();
T *array;
int num;
int size;
}; // class dimeArray<>
template <class T> inline
dimeArray<T>::dimeArray(const int size)
{
this->array = new T[size];
this->size = size;
this->num = 0;
}
template <class T> inline
dimeArray<T>::~dimeArray()
{
delete [] this->array;
}
template <class T> inline void
dimeArray<T>::growArray()
{
int oldsize = this->size;
T *oldarray = this->array;
this->size <<= 1;
this->array = new T[this->size];
for (int i = 0; i < oldsize; i++) this->array[i] = oldarray[i];
delete [] oldarray;
}
template <class T> inline void
dimeArray<T>::append(const T &elem)
{
if (this->num >= this->size) growArray();
this->array[this->num++] = elem;
}
template <class T> inline void
dimeArray<T>::append(const dimeArray<T> &array)
{
while (this->size <= this->num+array.count()) growArray();
for (int i=0;i<array.count();i++)
this->array[this->num++] = array[i];
}
template <class T> inline void
dimeArray<T>::prepend(const dimeArray<T> &array)
{
int newsize=this->num+array.count();
int i;
if (this->size<=newsize) {
T *oldarray=this->array;
this->array=new T[newsize];
this->size=newsize;
for (i=0;i<array.count(); i++) this->array[i] = array[i];
for (i=0;i<this->num;i++) this->array[i+array.count()] = oldarray[i];
delete[] oldarray;
}
else {
for (i=0;i<this->num;i++) this->array[array.count()+i]=this->array[i];
for (i=0;i<array.count();i++) this->array[i] = array[i];
}
this->num+=array.count();
}
template <class T> inline void
dimeArray<T>::insertElem(const int idx, const T &elem)
{
int n = this->num;
this->append(elem); // make room for one more
if (idx < n) {
for (int i = n; i > idx; i--) {
this->array[i] = this->array[i-1];
}
this->array[idx] = elem;
}
}
template <class T> inline void
dimeArray<T>::setElem(const int index, const T &elem)
{
while (index >= this->size) growArray();
if (this->num <= index) this->num = index+1;
this->array[index] = elem;
}
template <class T> inline T
dimeArray<T>::getElem(const int index) const
{
return this->array[index];
}
template <class T> inline void
dimeArray<T>::getElem(const int index, T &elem) const
{
elem = this->array[index];
}
template <class T> inline T
dimeArray<T>::getLastElem() const
{
return this->array[this->num-1];
}
template <class T> inline void
dimeArray<T>::getLastElem(T &elem) const
{
elem = this->array[this->num-1];
}
template <class T> inline T &
dimeArray<T>::operator [](const int index)
{
while (index >= this->size) growArray();
if (this->num <= index) this->num = index + 1;
return this->array[index];
}
template <class T> inline T
dimeArray<T>::operator [](const int index) const
{
return this->array[index];
}
template <class T> inline void
dimeArray<T>::removeElem(const int index)
{
if (this->num <= 0 || index >= this->num) return;
for (int i = index; i < this->num-1; i++)
this->array[i] = this->array[i+1];
this->num--;
}
template <class T> inline void
dimeArray<T>::removeElemFast(const int index)
{
this->array[index] = this->array[--this->num];
}
template <class T> inline void
dimeArray<T>::reverse()
{
T tmp;
for (int i=0;i<this->num/2;i++) {
tmp=this->array[i];
this->array[i]=this->array[this->num-1-i];
this->array[this->num-1-i]=tmp;
}
}
template <class T> inline void
dimeArray<T>::setCount(const int count)
{
if (count < this->num)
this->num = count;
}
template <class T> inline int
dimeArray<T>::count() const
{
return this->num;
}
template <class T> inline int
dimeArray<T>::allocSize() const
{
return this->size;
}
template <class T> inline T *
dimeArray<T>::arrayPointer()
{
return this->array;
}
template <class T> inline const T *
dimeArray<T>::constArrayPointer() const
{
return this->array;
}
template <class T> inline void
dimeArray<T>::makeEmpty(const int initsize)
{
delete [] this->array;
this->array = new T[initsize];
this->size = initsize;
this->num = 0;
}
template <class T> inline void
dimeArray<T>::freeMemory()
{
delete [] this->array;
this->array = NULL;
this->size = 0;
this->num = 0;
}
template <class T> inline void
dimeArray<T>::shrinkToFit()
{
T *oldarray = this->array;
this->array = new T[this->num];
for (int i = 0; i < this->num; i++) this->array[i] = oldarray[i];
this->size = this->num;
delete [] oldarray;
}
#endif // ! DIME_ARRAY_H
|