29 TLeafD::TLeafD(): TLeaf()
41 TLeafD::TLeafD(TBranch *parent,
const char *name,
const char *type)
42 :TLeaf(parent, name,type)
56 if (ResetAddress(0,kTRUE))
delete [] fValue;
62 void TLeafD::Export(TClonesArray *list, Int_t n)
65 for (Int_t i=0;i<n;i++) {
66 memcpy((
char*)list->UncheckedAt(i) + fOffset,&fValue[j], 8*fLen);
74 void TLeafD::FillBasket(TBuffer &b)
77 if (fPointer) fValue = *fPointer;
78 b.WriteFastArray(fValue,len);
84 void TLeafD::Import(TClonesArray *list, Int_t n)
86 const Double_t kDoubleUndefined = -9999.;
89 for (Int_t i=0;i<n;i++) {
90 clone = (
char*)list->UncheckedAt(i);
91 if (clone) memcpy(&fValue[j],clone + fOffset, 8*fLen);
92 else memcpy(&fValue[j],&kDoubleUndefined, 8*fLen);
100 void TLeafD::PrintValue(Int_t l)
const
102 Double_t *value = (Double_t *)GetValuePointer();
103 printf(
"%g",value[l]);
109 void TLeafD::ReadBasket(TBuffer &b)
111 if (!fLeafCount && fNdata == 1) {
112 b.ReadDouble(fValue[0]);
115 Long64_t entry = fBranch->GetReadEntry();
116 if (fLeafCount->GetBranch()->GetReadEntry() != entry) {
117 fLeafCount->GetBranch()->GetEntry(entry);
119 Int_t len = Int_t(fLeafCount->GetValue());
120 if (len > fLeafCount->GetMaximum()) {
121 printf(
"ERROR leaf:%s, len=%d and max=%d\n",GetName(),len,fLeafCount->GetMaximum());
122 len = fLeafCount->GetMaximum();
125 b.ReadFastArray(fValue,len*fLen);
127 b.ReadFastArray(fValue,fLen);
133 bool TLeafD::ReadBasketFast(TBuffer &input_buf, Long64_t N) {
134 if (R__unlikely(fLeafCount)) {
return false; }
135 return input_buf.ByteSwapBuffer(fLen*N, kDouble_t);
142 void TLeafD::ReadBasketExport(TBuffer &b, TClonesArray *list, Int_t n)
144 b.ReadFastArray(fValue,n*fLen);
147 for (Int_t i=0;i<n;i++) {
148 memcpy((
char*)list->UncheckedAt(i) + fOffset,&fValue[j], 8*fLen);
156 void TLeafD::ReadValue(std::istream &s, Char_t )
158 Double_t *value = (Double_t*)GetValuePointer();
159 for (Int_t i=0;i<fLen;i++) s >> value[i];
165 void TLeafD::SetAddress(
void *add)
167 if (ResetAddress(add) && (add!= fValue)) {
171 if (TestBit(kIndirectAddress)) {
172 fPointer = (Double_t**) add;
173 Int_t ncountmax = fLen;
174 if (fLeafCount) ncountmax = fLen*(fLeafCount->GetMaximum() + 1);
175 if ((fLeafCount && ncountmax > Int_t(fLeafCount->GetValue())) ||
176 ncountmax > fNdata || *fPointer == 0) {
177 if (*fPointer)
delete [] *fPointer;
178 if (ncountmax > fNdata) fNdata = ncountmax;
179 *fPointer =
new Double_t[fNdata];
183 fValue = (Double_t*)add;
186 fValue =
new Double_t[fNdata];