29 TLeafI::TLeafI(): TLeaf()
41 TLeafI::TLeafI(TBranch *parent,
const char *name,
const char *type)
42 :TLeaf(parent, name,type)
56 if (ResetAddress(0,kTRUE))
delete [] fValue;
62 void TLeafI::Export(TClonesArray *list, Int_t n)
64 Int_t *value = fValue;
65 for (Int_t i=0;i<n;i++) {
66 char *first = (
char*)list->UncheckedAt(i);
67 Int_t *ii = (Int_t*)&first[fOffset];
68 for (Int_t j=0;j<fLen;j++) {
78 void TLeafI::FillBasket(TBuffer &b)
82 if (fPointer) fValue = *fPointer;
84 if (fValue[0] > fMaximum) fMaximum = fValue[0];
87 for (i=0;i<len;i++) b << (UInt_t)fValue[i];
89 b.WriteFastArray(fValue,len);
96 const char *TLeafI::GetTypeName()
const
98 if (fIsUnsigned)
return "UInt_t";
107 Double_t TLeafI::GetValue(Int_t i)
const
109 if (fIsUnsigned)
return (UInt_t)fValue[i];
116 Bool_t TLeafI::IncludeRange(TLeaf *input)
119 if (input->GetMaximum() > this->GetMaximum())
120 this->SetMaximum( input->GetMaximum() );
121 if (input->GetMinimum() < this->GetMinimum())
122 this->SetMinimum( input->GetMinimum() );
132 void TLeafI::Import(TClonesArray *list, Int_t n)
134 const Int_t kIntUndefined = -9999;
137 for (Int_t i=0;i<n;i++) {
138 clone = (
char*)list->UncheckedAt(i);
139 if (clone) memcpy(&fValue[j],clone + fOffset, 4*fLen);
140 else memcpy(&fValue[j],&kIntUndefined, 4*fLen);
148 void TLeafI::PrintValue(Int_t l)
const
151 UInt_t *uvalue = (UInt_t*)GetValuePointer();
152 printf(
"%u",uvalue[l]);
154 Int_t *value = (Int_t*)GetValuePointer();
155 printf(
"%d",value[l]);
162 void TLeafI::ReadBasket(TBuffer &b)
164 if (!fLeafCount && fNdata == 1) {
165 b.ReadInt(fValue[0]);
168 Long64_t entry = fBranch->GetReadEntry();
169 if (fLeafCount->GetBranch()->GetReadEntry() != entry) {
170 fLeafCount->GetBranch()->GetEntry(entry);
172 Int_t len = Int_t(fLeafCount->GetValue());
173 if (len > fLeafCount->GetMaximum()) {
174 printf(
"ERROR leaf:%s, len=%d and max=%d\n",GetName(),len,fLeafCount->GetMaximum());
175 len = fLeafCount->GetMaximum();
178 b.ReadFastArray(fValue,len*fLen);
180 b.ReadFastArray(fValue,fLen);
187 bool TLeafI::ReadBasketFast(TBuffer& input_buf, Long64_t N)
189 if (R__unlikely(fLeafCount)) {
return false;}
190 return input_buf.ByteSwapBuffer(fLen*N, kInt_t);
197 void TLeafI::ReadBasketExport(TBuffer &b, TClonesArray *list, Int_t n)
202 b.ReadFastArray(fValue,n*fLen);
204 Int_t *value = fValue;
205 for (Int_t i=0;i<n;i++) {
206 char *first = (
char*)list->UncheckedAt(i);
207 Int_t *ii = (Int_t*)&first[fOffset];
208 for (Int_t j=0;j<fLen;j++) {
218 void TLeafI::ReadValue(std::istream &s, Char_t )
221 UInt_t *uvalue = (UInt_t*)GetValuePointer();
222 for (Int_t i=0;i<fLen;i++) s >> uvalue[i];
224 Int_t *value = (Int_t*)GetValuePointer();
225 for (Int_t i=0;i<fLen;i++) s >> value[i];
232 void TLeafI::SetAddress(
void *add)
234 if (ResetAddress(add) && (add!= fValue)) {
238 if (TestBit(kIndirectAddress)) {
239 fPointer = (Int_t**) add;
240 Int_t ncountmax = fLen;
241 if (fLeafCount) ncountmax = fLen*(fLeafCount->GetMaximum() + 1);
242 if ((fLeafCount && ncountmax > Int_t(fLeafCount->GetValue())) ||
243 ncountmax > fNdata || *fPointer == 0) {
244 if (*fPointer)
delete [] *fPointer;
245 if (ncountmax > fNdata) fNdata = ncountmax;
246 *fPointer =
new Int_t[fNdata];
250 fValue = (Int_t*)add;
253 fValue =
new Int_t[fNdata];