]>
Commit | Line | Data |
---|---|---|
cc336771 | 1 | /************************************************************************** |
2 | * Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. * | |
3 | * * | |
4 | * Author: The ALICE Off-line Project. * | |
5 | * Contributors are mentioned in the code where appropriate. * | |
6 | * * | |
7 | * Permission to use, copy, modify and distribute this software and its * | |
8 | * documentation strictly for non-commercial purposes is hereby granted * | |
9 | * without fee, provided that the above copyright notice appears in all * | |
10 | * copies and that both the copyright notice and this permission notice * | |
11 | * appear in the supporting documentation. The authors make no claims * | |
12 | * about the suitability of this software for any purpose. It is * | |
13 | * provided "as is" without express or implied warranty. * | |
14 | **************************************************************************/ | |
15 | ||
16 | /* $Id$ */ | |
17 | ||
18 | //------------------------------------------------------------------------- | |
19 | // Offline Analysis Database Container and Service Class | |
20 | // Author: Andreas Morsch, CERN | |
21 | //------------------------------------------------------------------------- | |
22 | ||
23 | ||
24 | ||
25 | ||
26 | #include "AliOADBContainer.h" | |
27 | #include "AliLog.h" | |
28 | #include <TObjArray.h> | |
29 | #include <TArrayI.h> | |
30 | #include <TFile.h> | |
bad1b400 | 31 | #include <TList.h> |
08b752d1 | 32 | #include "TBrowser.h" |
cc336771 | 33 | |
34 | ClassImp(AliOADBContainer); | |
35 | ||
36 | //______________________________________________________________________________ | |
37 | AliOADBContainer::AliOADBContainer() : | |
38 | TNamed(), | |
63671ce7 | 39 | fArray(0), |
40 | fDefaultList(0), | |
cc336771 | 41 | fLowerLimits(), |
42 | fUpperLimits(), | |
43 | fEntries(0) | |
44 | { | |
58a28442 | 45 | // Default constructor |
cc336771 | 46 | } |
47 | ||
48 | AliOADBContainer::AliOADBContainer(char* name) : | |
49 | TNamed(name, "OADBContainer"), | |
50 | fArray(new TObjArray(100)), | |
bad1b400 | 51 | fDefaultList(new TList()), |
cc336771 | 52 | fLowerLimits(), |
53 | fUpperLimits(), | |
54 | fEntries(0) | |
55 | { | |
58a28442 | 56 | // Constructor |
cc336771 | 57 | } |
58 | ||
59 | ||
60 | //______________________________________________________________________________ | |
61 | AliOADBContainer::~AliOADBContainer() | |
62 | { | |
63 | // destructor | |
64 | } | |
65 | ||
66 | //______________________________________________________________________________ | |
67 | AliOADBContainer::AliOADBContainer(const AliOADBContainer& cont) : | |
68 | TNamed(cont), | |
69 | fArray(cont.fArray), | |
bad1b400 | 70 | fDefaultList(cont.fDefaultList), |
cc336771 | 71 | fLowerLimits(cont.fLowerLimits), |
72 | fUpperLimits(cont.fUpperLimits), | |
73 | fEntries(cont.fEntries) | |
74 | { | |
75 | // Copy constructor. | |
76 | } | |
77 | ||
78 | //______________________________________________________________________________ | |
79 | AliOADBContainer& AliOADBContainer::operator=(const AliOADBContainer& cont) | |
80 | { | |
58a28442 | 81 | // |
cc336771 | 82 | // Assignment operator |
58a28442 | 83 | // Copy objects related to run ranges |
cc336771 | 84 | if(this!=&cont) { |
85 | TNamed::operator=(cont); | |
35f37af6 | 86 | fEntries = cont.fEntries; |
87 | fLowerLimits.Set(fEntries); | |
88 | fUpperLimits.Set(fEntries); | |
89 | for (Int_t i = 0; i < fEntries; i++) { | |
90 | fLowerLimits[i] = cont.fLowerLimits[i]; | |
91 | fUpperLimits[i] = cont.fUpperLimits[i]; | |
92 | fArray->AddAt(cont.fArray->At(i), i); | |
93 | } | |
cc336771 | 94 | } |
58a28442 | 95 | // |
96 | // Copy default objects | |
97 | TList* list = cont.GetDefaultList(); | |
98 | TIter next(list); | |
99 | TObject* obj; | |
100 | while((obj = next())) fDefaultList->Add(obj); | |
101 | // | |
cc336771 | 102 | return *this; |
103 | } | |
104 | ||
105 | void AliOADBContainer::AppendObject(TObject* obj, Int_t lower, Int_t upper) | |
106 | { | |
58a28442 | 107 | // |
cc336771 | 108 | // Append a new object to the list |
58a28442 | 109 | // |
110 | // Check that there is no overlap with existing run ranges | |
111 | Int_t index = HasOverlap(lower, upper); | |
112 | ||
113 | if (index != -1) { | |
114 | AliFatal(Form("Ambiguos validity range (%5d) !\n", index)); | |
115 | return; | |
116 | } | |
117 | // | |
118 | // Adjust arrays | |
cc336771 | 119 | fEntries++; |
120 | fLowerLimits.Set(fEntries); | |
121 | fUpperLimits.Set(fEntries); | |
122 | ||
58a28442 | 123 | // Add the object |
cc336771 | 124 | fLowerLimits[fEntries - 1] = lower; |
125 | fUpperLimits[fEntries - 1] = upper; | |
cc336771 | 126 | fArray->Add(obj); |
127 | } | |
128 | ||
129 | void AliOADBContainer::RemoveObject(Int_t idx) | |
130 | { | |
58a28442 | 131 | // |
cc336771 | 132 | // Remove object from the list |
58a28442 | 133 | |
134 | // | |
135 | // Check that index is inside range | |
cc336771 | 136 | if (idx < 0 || idx >= fEntries) |
137 | { | |
138 | AliError(Form("Index out of Range %5d >= %5d", idx, fEntries)); | |
139 | return; | |
140 | } | |
58a28442 | 141 | // |
142 | // Remove the object | |
cc336771 | 143 | TObject* obj = fArray->RemoveAt(idx); |
144 | delete obj; | |
58a28442 | 145 | // |
146 | // Adjust the run ranges and shrink the array | |
cc336771 | 147 | for (Int_t i = idx; i < (fEntries-1); i++) { |
148 | fLowerLimits[i] = fLowerLimits[i + 1]; | |
149 | fUpperLimits[i] = fUpperLimits[i + 1]; | |
150 | fArray->AddAt(fArray->At(i+1), i); | |
151 | } | |
152 | fArray->RemoveAt(fEntries - 1); | |
153 | fEntries--; | |
154 | } | |
155 | ||
156 | void AliOADBContainer::UpdateObject(Int_t idx, TObject* obj, Int_t lower, Int_t upper) | |
157 | { | |
58a28442 | 158 | // |
cc336771 | 159 | // Append a new object to the list |
58a28442 | 160 | |
161 | // Check that index is inside range | |
cc336771 | 162 | if (idx < 0 || idx >= fEntries) |
163 | { | |
164 | AliError(Form("Index out of Range %5d >= %5d", idx, fEntries)); | |
165 | return; | |
166 | } | |
58a28442 | 167 | // |
168 | // Check that there is no overlap with existing run ranges | |
169 | Int_t index = HasOverlap(lower, upper); | |
170 | if (index != -1) { | |
171 | AliFatal(Form("Ambiguos validity range (%5d) !\n", index)); | |
172 | return; | |
173 | } | |
174 | // | |
175 | // Add object | |
cc336771 | 176 | fLowerLimits[idx] = lower; |
177 | fUpperLimits[idx] = upper; | |
178 | fArray->AddAt(obj, idx); | |
179 | } | |
58a28442 | 180 | |
181 | ||
08b752d1 | 182 | void AliOADBContainer::AddDefaultObject(TObject* obj) |
bad1b400 | 183 | { |
184 | // Add a default object | |
185 | fDefaultList->Add(obj); | |
186 | } | |
187 | ||
188 | void AliOADBContainer::CleanDefaultList() | |
189 | { | |
190 | // Clean default list | |
191 | fDefaultList->Delete(); | |
192 | } | |
193 | ||
35f37af6 | 194 | Int_t AliOADBContainer::GetIndexForRun(Int_t run) const |
cc336771 | 195 | { |
bad1b400 | 196 | // |
cc336771 | 197 | // Find the index for a given run |
198 | Int_t found = 0; | |
199 | Int_t index = -1; | |
200 | for (Int_t i = 0; i < fEntries; i++) | |
201 | { | |
202 | if (run >= fLowerLimits[i] && run <= fUpperLimits[i]) | |
203 | { | |
204 | found++; | |
205 | index = i; | |
206 | } | |
207 | } | |
bad1b400 | 208 | |
209 | if (found > 1) { | |
210 | AliError(Form("More than one (%5d) object found; return last (%5d) !\n", found, index)); | |
211 | } else if (index == -1) { | |
212 | AliWarning(Form("No object found for run %5d !\n", run)); | |
213 | } | |
214 | ||
cc336771 | 215 | return index; |
216 | } | |
217 | ||
bad1b400 | 218 | TObject* AliOADBContainer::GetObject(Int_t run, char* def) const |
219 | { | |
220 | // Return object for given run or default if not found | |
221 | TObject* obj = 0; | |
222 | Int_t idx = GetIndexForRun(run); | |
223 | if (idx == -1) { | |
224 | // no object found, try default | |
225 | obj = fDefaultList->FindObject(def); | |
226 | if (!obj) { | |
227 | AliError("Default Object not found !\n"); | |
228 | return (0); | |
229 | } else { | |
230 | return (obj); | |
231 | } | |
232 | } else { | |
233 | return (fArray->At(idx)); | |
234 | } | |
235 | } | |
236 | ||
237 | TObject* AliOADBContainer::GetObjectByIndex(Int_t run) const | |
238 | { | |
239 | // Return object for given index | |
240 | return (fArray->At(run)); | |
241 | } | |
242 | ||
35f37af6 | 243 | void AliOADBContainer::WriteToFile(char* fname) const |
cc336771 | 244 | { |
bad1b400 | 245 | // |
cc336771 | 246 | // Write object to file |
247 | TFile* f = new TFile(fname, "recreate"); | |
248 | Write(); | |
249 | f->Close(); | |
250 | } | |
bad1b400 | 251 | |
35f37af6 | 252 | Int_t AliOADBContainer::InitFromFile(char* fname, char* key) |
253 | { | |
bad1b400 | 254 | // |
35f37af6 | 255 | // Initialize object from file |
256 | TFile* file = TFile::Open(fname); | |
257 | if (!file) return (1); | |
258 | AliOADBContainer* cont = 0; | |
259 | file->GetObject(key, cont); | |
260 | if (!cont) | |
261 | { | |
262 | AliError("Object not found in file \n"); | |
263 | return 1; | |
264 | } | |
265 | ||
266 | fEntries = cont->GetNumberOfEntries(); | |
267 | fLowerLimits.Set(fEntries); | |
268 | fUpperLimits.Set(fEntries); | |
269 | for (Int_t i = 0; i < fEntries; i++) { | |
270 | fLowerLimits[i] = cont->LowerLimit(i); | |
271 | fUpperLimits[i] = cont->UpperLimit(i); | |
bad1b400 | 272 | fArray->AddAt(cont->GetObjectByIndex(i), i); |
35f37af6 | 273 | } |
58a28442 | 274 | |
275 | TIter next(cont->GetDefaultList()); | |
276 | TObject* obj; | |
277 | while((obj = next())) fDefaultList->Add(obj); | |
278 | ||
35f37af6 | 279 | return 0; |
280 | ||
281 | } | |
282 | ||
cc336771 | 283 | |
284 | void AliOADBContainer::List() | |
285 | { | |
bad1b400 | 286 | // |
cc336771 | 287 | // List Objects |
288 | for (Int_t i = 0; i < fEntries; i++) { | |
289 | printf("Lower %5d Upper %5d \n", fLowerLimits[i], fUpperLimits[i]); | |
290 | (fArray->At(i))->Dump(); | |
291 | } | |
58a28442 | 292 | TIter next(fDefaultList); |
293 | TObject* obj; | |
294 | while((obj = next())) obj->Dump(); | |
295 | ||
296 | } | |
297 | ||
63671ce7 | 298 | Int_t AliOADBContainer::HasOverlap(Int_t lower, Int_t upper) const |
58a28442 | 299 | { |
300 | // | |
301 | // Checks for overlpapping validity regions | |
302 | for (Int_t i = 0; i < fEntries; i++) { | |
303 | if ((lower >= fLowerLimits[i] && lower <= fUpperLimits[i]) || | |
304 | (upper >= fLowerLimits[i] && upper <= fUpperLimits[i])) | |
305 | { | |
306 | return (i); | |
307 | } | |
308 | } | |
309 | return (-1); | |
cc336771 | 310 | } |
08b752d1 | 311 | |
312 | void AliOADBContainer::Browse(TBrowser *b) | |
313 | { | |
314 | // Browse this object. | |
315 | // If b=0, there is no Browse call TObject::Browse(0) instead. | |
316 | // This means TObject::Inspect() will be invoked indirectly | |
317 | ||
318 | ||
319 | if (b) { | |
320 | for (Int_t i = 0; i < fEntries; i++) { | |
321 | b->Add(fArray->At(i),Form("%9.9d - %9.9d", fLowerLimits[i], fUpperLimits[i])); | |
322 | } | |
323 | TIter next(fDefaultList); | |
324 | TObject* obj; | |
325 | while((obj = next())) b->Add(obj); | |
326 | ||
327 | } | |
328 | else | |
329 | TObject::Browse(b); | |
330 | } | |
331 |