container_tpl.h
4.15 KB
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
/**
* \file container_tpl.h
*
* \brief ein Template das als Behälter für alles mögliche dient.
*
* \author Georg Steffers <georg@steffers.org> [gs]
*
* \date 16.12.2003
*
* \version ..2002 [gs]: erste Implementation
* \version 16.12.2003 [gs]: <ul><li>
* Beginn der Dokumentaion mit Doxygen
* </li><li>
* Einige Änderungen, so das
* content in einem leeren container
* NULL ist und dann entsprechen auch
* nicht alle Aktionen mit diesem
* container möglich sind.
* </li></ul>
*/
/*
* Copyright (C)2003 Georg Steffers
*
* 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
*/
using namespace std;
#include <cstring>
#include "container.h"
template <class C>
container<C>::container() : content(NULL), count(0) {
//content=new C[1];
}
template <class C>
container<C>::container(const C& c) : count(1) {
content=new C[1];
content[0]=c;
}
template <class C>
container<C>::container(const C* c, unsigned co) : count(co) {
if(count > 0)
content=new C[count];
else
content=NULL;
for(unsigned i=0; i<count; i++)
content[i]=c[i];
}
template <class C>
container<C>::container(const container<C>& c) : count(c.count) {
if(count > 0)
content=new C[count];
else
content=NULL;
for(unsigned i=0; i<count; i++)
content[i]=c.content[i];
}
template <class C>
container<C>::~container() {
if(content) {
delete [] content;
content=NULL;
}
count=0;
}
template <class C>
const container<C>& container<C>::operator=(const container<C>& c) {
if(this==&c)
return *this;
if(count != c.count) {
delete [] content;
if(c.count > 0)
content=new C[c.count];
else
content=NULL;
}
count=c.count;
for(unsigned i=0; i<count; i++)
content[i]=c.content[i];
return *this;
}
template <class C>
const C& container<C>::operator[](unsigned index) const {
if(index+1 > count)
return content[0];
return content[index];
}
template <class C>
C& container<C>::operator[](unsigned index) {
if(index+1 > count) {
C* content_tmp=new C[index+1];
for(unsigned i=0; i<count; i++)
content_tmp[i]=content[i];
// memcpy(content_tmp, content, count*sizeof(C));
delete [] content;
content=content_tmp;
count=index+1;
}
return content[index];
}
// WARNUNG!!! Diese funktion verkleiner auch ohne weitern check. d.h. ist
// size < count, dann verliert man alle Einträge >size.
template <class C>
void container<C>::resize(unsigned size) {
C* content_tmp;
if(size>0) {
content_tmp=new C[size];
for(unsigned i=0; i<size<count?size:count; i++)
content_tmp[i]=content[i];
}
else
content_tmp=NULL;
delete [] content;
content=content_tmp;
count=size;
}
template <class C>
void container<C>::insert(unsigned idx, const C& value) {
C* content_tmp=new C[count+1];
memcpy(content_tmp, content, idx*sizeof(C));
content_tmp[idx]=value;
for(unsigned i=0; i<count; i++)
content_tmp[i]=content[i];
// memcpy(&content_tmp[idx+1], &content[idx], (count-idx)*sizeof(C));
delete [] content;
content=content_tmp;
count++;
}