-
Notifications
You must be signed in to change notification settings - Fork 0
/
Soporte.cpp
295 lines (251 loc) · 9.37 KB
/
Soporte.cpp
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
/************************************************************************
Soporte.h.cpp - Copyright rodrigo
Here you can write a license for your code, some comments or any other
information you want to have in your generated code. To to this simply
configure the "headings" directory in uml to point to a directory
where you have your heading files.
or you can just replace the contents of this file with your own.
If you want to do this, this file is located at
/usr/share/apps/umbrello/headings/heading.cpp
-->Code Generators searches for heading files based on the file extension
i.e. it will look for a file name ending in ".h" to include in C++ header
files, and for a file name ending in ".java" to include in all generated
java code.
If you name the file "heading.<extension>", Code Generator will always
choose this file even if there are other files with the same extension in the
directory. If you name the file something else, it must be the only one with that
extension in the directory to guarantee that Code Generator will choose it.
you can use variables in your heading files which are replaced at generation
time. possible variables are : author, date, time, filename and filepath.
just write %variable_name%
This file was generated on sáb oct 11 2008 at 17:15:49
The original location of this file is /home/rodrigo/uml-generated-code/Soporte.cpp
**************************************************************************/
#include "Soporte.h"
#include "Directorio.h"
// Constructor // Destructuctor
Soporte::Soporte ( ){
this->directorios.clear();
this->espacioLibre = 0;
}
Soporte::~Soporte ( ){
this->eliminarDirectorios();
}
void Soporte::agregarDirectorio (Directorio* directorio ) {
this->directorios.push_back(directorio);
}
// TODO: Analizar la mejora de mantener un orden y hacer busqueda binaria!!!
void Soporte::borrarDirectorio (const string ruta ) {
Directorio* dir;
list<Almacenable*>::iterator it = this->directorios.begin();
bool encontrado = false;
while ((!encontrado) && ( it != this->directorios.end())){
if ( ((Directorio*)*it)->getRuta() == ruta) {
dir = (Directorio*)*it;
delete dir;
it = this->directorios.erase(it);
encontrado = true;
}
else
it++;
}
}
/**
* Elimina el directorio del soporte
* @param directorio El directorio a eliminar
*/
void Soporte::borrarDirectorio (const unsigned int id ){
list<Almacenable *>::iterator it = this->directorios.begin();
bool encontrado = false;
while ((!encontrado) && ( it != this->directorios.end())){
if ( ((Directorio*)*it)->getId() == id) {
delete (*it);
it = this->directorios.erase(it);
encontrado = true;
}
else
it++;
}
}
/**
* @return bool TRUE si existe el directorio en el soporte, false en caso cotnrario
* @param ruta La ruta del directorio a verificar
*/
bool Soporte::existeDirectorio (string ruta ) {
Directorio* dir = NULL;
bool existe = false;
list<Almacenable *>::iterator it = this->directorios.begin();
while ( (!existe) && (it != this->directorios.end()) ){
dir = (Directorio*)*it;
if (ruta.compare(dir->getRuta()) == 0){
existe = true;
}
it++;
}
return existe;
}
/**
* @return Directorio
* @param ID_Directorio
*/
Directorio* Soporte::obtenerDirectorio (const unsigned int id ) {
pthread_mutex_lock( &this->directoriosMutex );
list<Almacenable *>::iterator it = this->directorios.begin();
Directorio* directorio = NULL;
while ((!directorio) && ( it != this->directorios.end())){
if ( ((Directorio*)*it)->getId() == id) {
directorio = (Directorio*)*it;
}
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
return directorio;
}
Directorio* Soporte::obtenerDirectorio(const string ruta ) {
pthread_mutex_lock( &this->directoriosMutex );
list<Almacenable *>::iterator it = this->directorios.begin();
Directorio* dir= NULL;
while ((!dir) && ( it != this->directorios.end())){
if ( ((Directorio*)*it)->getRuta() == ruta) {
dir = (Directorio*)*it;
}
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
return dir;
}
Portador* Soporte::obtenerPortador (const unsigned int id ) {
pthread_mutex_lock( &this->directoriosMutex );
list<Almacenable*>::iterator it = this->directorios.begin();
Portador* portador = NULL;
Directorio* directorio;
while ((!portador) && ( it != this->directorios.end())){
directorio = (Directorio*)*it;
portador = directorio->obtenerPortador(id);
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
return portador;
}
unsigned int Soporte::obtenerCantidadDirectorios ( ) {
pthread_mutex_lock( &this->directoriosMutex );
pthread_mutex_unlock( &this->directoriosMutex );
return this->directorios.size();
}
list<Almacenable*>* Soporte::obtenerDirectorios ( ){
pthread_mutex_lock( &this->directoriosMutex );
pthread_mutex_unlock( &this->directoriosMutex );
return (&this->directorios);
}
list<Almacenable*> Soporte::obtenerCopiaDirectorios ( ) {
pthread_mutex_lock( &this->directoriosMutex );
pthread_mutex_unlock( &this->directoriosMutex );
return this->directorios;
}
list<Almacenable*> Soporte::obtenerCopiaDirectorios ( const unsigned int tamano ){
pthread_mutex_lock( &this->directoriosMutex );
list<Almacenable *>::iterator it = this->directorios.begin();
list<Almacenable *>::iterator itResultado;
list<Almacenable*> resultado;
Directorio* directorio;
bool insertado;
while ( it != this->directorios.end()){ // insercion ordenada en lista
directorio = (Directorio*)*it;
if (directorio->getEspacioLibre() >= tamano){
if (resultado.empty())
resultado.push_front(directorio);
else{
itResultado = resultado.begin();
insertado = false;
while ((!insertado) && (itResultado != resultado.end())){
if (((Directorio*)*itResultado)->getEspacioLibre() < directorio->getEspacioLibre()){
resultado.insert(itResultado,directorio);
insertado = true;
}
itResultado++;
}
if (!insertado)
resultado.push_back(directorio);
}
}
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
return resultado;
}
list<Almacenable*> Soporte::obtenerCopiaDirectoriosParaCompletar( const unsigned int tamano ){
pthread_mutex_lock( &this->directoriosMutex );
list<Almacenable*> resultado;
list<Almacenable*> lista = this->obtenerListaEspacioLibreDescendente();
list<Almacenable *>::iterator it = lista.begin();
unsigned long acumulado = 0;
while ((it != lista.end()) && (acumulado < tamano)){
acumulado += ((Directorio*)*it)->getEspacioLibre();
resultado.push_back(*it);
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
return resultado;
}
Directorio* Soporte::obtenerDirectorioContenedor( const unsigned int idImagen ){
pthread_mutex_lock( &this->directoriosMutex );
list<Almacenable *>::iterator it = this->directorios.begin();
Directorio* dir = NULL;
while ((it != this->directorios.end()) && (!dir)){
if (((Directorio*)*it)->existePortador(idImagen)){
dir = ((Directorio*)*it);
}
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
return dir;
}
void Soporte::actualizarEspacioLibre(){
pthread_mutex_lock( &this->directoriosMutex );
this->espacioLibre = 0;
list<Almacenable *>::iterator it = this->directorios.begin();
while ( it != this->directorios.end()){
this->espacioLibre += (((Directorio*)*it)->getEspacioLibre());
it++;
}
pthread_mutex_unlock( &this->directoriosMutex );
}
unsigned long int Soporte::getEspacioLibre ( ){
return this->espacioLibre;
}
void Soporte::setDirectorios ( list<Almacenable*> new_var ){
pthread_mutex_lock( &this->directoriosMutex );
this->eliminarDirectorios();
this->directorios = new_var;
pthread_mutex_unlock( &this->directoriosMutex );
}
void Soporte::setEspacioLibre ( const unsigned long int espacioLibre ){
this->espacioLibre = espacioLibre;
}
void Soporte::agregarEspacioLibre (const unsigned long int masEspacioLibre ){
this->espacioLibre+= masEspacioLibre;
}
void Soporte::reducirEspacioLibre (const unsigned long int menosEspacioLibre ){
this->espacioLibre-= menosEspacioLibre;
}
//private
/* Elimina la lista de directorios del soporte*/
void Soporte::eliminarDirectorios(){
list<Almacenable *>::iterator it = this->directorios.begin();
while ( it != this->directorios.end() ){
delete (*it);
it = this->directorios.erase(it);
}
}
bool ordenarEspacioLibre (Almacenable* res1, Almacenable* res2){
if((((Directorio*)res1)->getEspacioLibre()) < (((Directorio*)res2)->getEspacioLibre()))
return true;
else
return false;
}
list<Almacenable*> Soporte::obtenerListaEspacioLibreDescendente(){
list<Almacenable*> resultado;
resultado = this->directorios;
resultado.sort(ordenarEspacioLibre);
return resultado;
}