Adaption to new fluka common blocks (E. Futo)
[u/mrichter/AliRoot.git] / CONTAINERS / AliSegmentArray.h
CommitLineData
a46e9031 1#ifndef ALISEGMENTARRAY_H
2#define ALISEGMENTARRAY_H
3/* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * See cxx source for full Copyright notice */
5
6/* $Id$ */
7
8////////////////////////////////////////////////
9// Manager class general Alice segment
10// segment is for example one pad row in TPC //
11////////////////////////////////////////////////
12
13#include "TNamed.h"
14#include "TError.h"
15#include "TObjArray.h"
16
17class TTree;
18class TBranch;
67ae3681 19class TFile;
a46e9031 20class AliArrayI;
21class AliSegmentID;
22
23class AliSegmentArray: public TNamed{
24public:
25 AliSegmentArray();
26 AliSegmentArray(Text_t *classname, Int_t n); //
27 virtual ~AliSegmentArray();
28 Bool_t SetClass(Text_t *classname); //set class of stored object
29 const AliSegmentID * At(Int_t i); //return pointer to segment with index i
30 const AliSegmentID * operator[](Int_t i); //return pointer to segment with index i
31
32 Bool_t AddSegment(AliSegmentID *segment); // add segment to array
33 AliSegmentID * AddSegment(Int_t index); //create objet and set index
34 Bool_t MakeArray(Int_t n); //make array of pointers to Segments
35 void ClearSegment(Int_t index); //remove segment from active
36 virtual AliSegmentID * NewSegment(); //dynamicaly create new segment
37 //input output functions
38 TTree * GetTree(){return fTree;} //return pointer to connected tree
39
1ec4fc51 40 virtual void MakeTree(char *file=0); //Make tree with the name
41 virtual TTree* MakeTree(TFile *file); //Make tree in the file file
a46e9031 42 virtual Bool_t ConnectTree(const char * treeName); //connect tree from current directory
43 virtual AliSegmentID * LoadSegment(Int_t index);//load segment with index to the memory
44 virtual AliSegmentID * LoadEntry(Int_t index); //load segment entry from position index in tree
45 virtual void StoreSegment(Int_t index);//write segmen persistent
46 Bool_t MakeDictionary(Int_t size);//create index table for tree
47 TClass * GetClass() {return fClass;}
48
49protected:
50 AliSegmentArray(const AliSegmentArray &segment); //copy constructor
51 AliSegmentArray &operator = (const AliSegmentArray & segment); //assignment operator
52 TObjArray * fSegment; //!pointer to array of pointers to segment
53 AliArrayI * fTreeIndex; //!pointers(index) table in tree
54 Int_t fNSegment; //number of alocated segments
55 TTree * fTree; //!tree with segment objects
56 TBranch * fBranch; //!total branch
57private:
58 TClass * fClass; //!class type of included objects
59 ClassDef(AliSegmentArray,1)
60};
61
62
63
64inline const AliSegmentID* AliSegmentArray::operator[](Int_t i)
65{
66 //
67 //return segment with given index
68 //
69 if ( (i<0) || (i>=fNSegment)) return 0;
70 return (AliSegmentID *)(fSegment->At(i));
71
72}
73
74inline const AliSegmentID* AliSegmentArray::At(Int_t i)
75{
76 //
77 //return segment with given index
78 //
79 if ( (i<0) || (i>=fNSegment)) return 0;
80 return (AliSegmentID *)(fSegment->At(i));
81}
82
83#endif //ALISEGMENTARRAY_H