Logo ROOT   6.30.04
Reference Guide
 All Namespaces Files Pages
TLeafS.cxx
Go to the documentation of this file.
1 // @(#)root/tree:$Id$
2 // Author: Rene Brun 12/01/96
3 
4 /*************************************************************************
5  * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
6  * All rights reserved. *
7  * *
8  * For the licensing terms see $ROOTSYS/LICENSE. *
9  * For the list of contributors see $ROOTSYS/README/CREDITS. *
10  *************************************************************************/
11 
12 /** \class TLeafS
13 \ingroup tree
14 
15 A TLeaf for a 16 bit Integer data type.
16 */
17 
18 #include "TLeafS.h"
19 #include "TBranch.h"
20 #include "TBuffer.h"
21 #include "TClonesArray.h"
22 #include "Riostream.h"
23 
24 ClassImp(TLeafS);
25 
26 ////////////////////////////////////////////////////////////////////////////////
27 /// Default constructor for LeafS.
28 
29 TLeafS::TLeafS(): TLeaf()
30 {
31  fValue = 0;
32  fPointer = 0;
33  fMinimum = 0;
34  fMaximum = 0;
35  fLenType = 2;
36 }
37 
38 ////////////////////////////////////////////////////////////////////////////////
39 /// Create a LeafS.
40 
41 TLeafS::TLeafS(TBranch *parent, const char *name, const char *type)
42  :TLeaf(parent,name,type)
43 {
44  fLenType = 2;
45  fMinimum = 0;
46  fMaximum = 0;
47  fValue = 0;
48  fPointer = 0;
49 }
50 
51 ////////////////////////////////////////////////////////////////////////////////
52 /// Default destructor for a LeafS.
53 
54 TLeafS::~TLeafS()
55 {
56  if (ResetAddress(0,kTRUE)) delete [] fValue;
57 }
58 
59 ////////////////////////////////////////////////////////////////////////////////
60 /// Export element from local leaf buffer to ClonesArray.
61 
62 void TLeafS::Export(TClonesArray *list, Int_t n)
63 {
64  Int_t j = 0;
65  for (Int_t i=0;i<n;i++) {
66  memcpy((char*)list->UncheckedAt(i) + fOffset,&fValue[j], 2*fLen);
67  j += fLen;
68  }
69 }
70 
71 ////////////////////////////////////////////////////////////////////////////////
72 /// Pack leaf elements in Basket output buffer.
73 
74 void TLeafS::FillBasket(TBuffer &b)
75 {
76  Int_t i;
77  Int_t len = GetLen();
78  if (fPointer) fValue = *fPointer;
79  if (IsRange()) {
80  if (fValue[0] > fMaximum) fMaximum = fValue[0];
81  }
82  if (IsUnsigned()) {
83  for (i=0;i<len;i++) b << (UShort_t)fValue[i];
84  } else {
85  b.WriteFastArray(fValue,len);
86  }
87 }
88 
89 ////////////////////////////////////////////////////////////////////////////////
90 /// Returns name of leaf type.
91 
92 const char *TLeafS::GetTypeName() const
93 {
94  if (fIsUnsigned) return "UShort_t";
95  return "Short_t";
96 }
97 
98 ////////////////////////////////////////////////////////////////////////////////
99 /// Returns current value of leaf.
100 /// - if leaf is a simple type, i must be set to 0
101 /// - if leaf is an array, i is the array element number to be returned
102 
103 Double_t TLeafS::GetValue(Int_t i) const
104 {
105  if (fIsUnsigned) return (UShort_t)fValue[i];
106  return fValue[i];
107 }
108 
109 ////////////////////////////////////////////////////////////////////////////////
110 /// Copy/set fMinimum and fMaximum to include/be wide than those of the parameter
111 
112 Bool_t TLeafS::IncludeRange(TLeaf *input)
113 {
114  if (input) {
115  if (input->GetMaximum() > this->GetMaximum())
116  this->SetMaximum( input->GetMaximum() );
117  if (input->GetMinimum() < this->GetMinimum())
118  this->SetMinimum( input->GetMinimum() );
119  return kTRUE;
120  } else {
121  return kFALSE;
122  }
123 }
124 
125 ////////////////////////////////////////////////////////////////////////////////
126 /// Import element from ClonesArray into local leaf buffer.
127 
128 void TLeafS::Import(TClonesArray *list, Int_t n)
129 {
130  const Short_t kShortUndefined = -9999;
131  Int_t j = 0;
132  char *clone;
133  for (Int_t i=0;i<n;i++) {
134  clone = (char*)list->UncheckedAt(i);
135  if (clone) memcpy(&fValue[j],clone + fOffset, 2*fLen);
136  else memcpy(&fValue[j],&kShortUndefined, 2*fLen);
137  j += fLen;
138  }
139 }
140 
141 ////////////////////////////////////////////////////////////////////////////////
142 /// Prints leaf value.
143 
144 void TLeafS::PrintValue(Int_t l) const
145 {
146  if (fIsUnsigned) {
147  UShort_t *uvalue = (UShort_t*)GetValuePointer();
148  printf("%u",uvalue[l]);
149  } else {
150  Short_t *value = (Short_t*)GetValuePointer();
151  printf("%d",value[l]);
152  }
153 }
154 
155 ////////////////////////////////////////////////////////////////////////////////
156 /// Read leaf elements from Basket input buffer.
157 
158 void TLeafS::ReadBasket(TBuffer &b)
159 {
160  if (!fLeafCount && fNdata == 1) {
161  b.ReadShort(fValue[0]);
162  }else {
163  if (fLeafCount) {
164  Long64_t entry = fBranch->GetReadEntry();
165  if (fLeafCount->GetBranch()->GetReadEntry() != entry) {
166  fLeafCount->GetBranch()->GetEntry(entry);
167  }
168  Int_t len = Int_t(fLeafCount->GetValue());
169  if (len > fLeafCount->GetMaximum()) {
170  printf("ERROR leaf:%s, len=%d and max=%d\n",GetName(),len,fLeafCount->GetMaximum());
171  len = fLeafCount->GetMaximum();
172  }
173  fNdata = len*fLen;
174  b.ReadFastArray(fValue,len*fLen);
175  } else {
176  b.ReadFastArray(fValue,fLen);
177  }
178  }
179 }
180 
181 ////////////////////////////////////////////////////////////////////////////////
182 /// Deserialize input by performing byteswap as needed.
183 bool TLeafS::ReadBasketFast(TBuffer& input_buf, Long64_t N)
184 {
185  if (R__unlikely(fLeafCount)) {return false;}
186  return input_buf.ByteSwapBuffer(fLen*N, kShort_t);
187 }
188 
189 ////////////////////////////////////////////////////////////////////////////////
190 /// Read leaf elements from Basket input buffer and export buffer to
191 /// TClonesArray objects.
192 
193 void TLeafS::ReadBasketExport(TBuffer &b, TClonesArray *list, Int_t n)
194 {
195  if (n*fLen == 1) {
196  b >> fValue[0];
197  } else {
198  b.ReadFastArray(fValue,n*fLen);
199  }
200 
201  Int_t j = 0;
202  for (Int_t i=0;i<n;i++) {
203  memcpy((char*)list->UncheckedAt(i) + fOffset,&fValue[j], 2*fLen);
204  j += fLen;
205  }
206 }
207 
208 ////////////////////////////////////////////////////////////////////////////////
209 /// Read a integer integer from std::istream s and store it into the branch buffer.
210 
211 void TLeafS::ReadValue(std::istream &s, Char_t /*delim = ' '*/)
212 {
213  if (fIsUnsigned) {
214  UShort_t *uvalue = (UShort_t*)GetValuePointer();
215  for (Int_t i=0;i<fLen;i++) s >> uvalue[i];
216  } else {
217  Short_t *value = (Short_t*)GetValuePointer();
218  for (Int_t i=0;i<fLen;i++) s >> value[i];
219  }
220 }
221 
222 ////////////////////////////////////////////////////////////////////////////////
223 /// Set leaf buffer data address.
224 
225 void TLeafS::SetAddress(void *add)
226 {
227  if (ResetAddress(add) && (add!=fValue)) {
228  delete [] fValue;
229  }
230  if (add) {
231  if (TestBit(kIndirectAddress)) {
232  fPointer = (Short_t**) add;
233  Int_t ncountmax = fLen;
234  if (fLeafCount) ncountmax = fLen*(fLeafCount->GetMaximum() + 1);
235  if ((fLeafCount && ncountmax > Int_t(fLeafCount->GetValue())) ||
236  ncountmax > fNdata || *fPointer == 0) {
237  if (*fPointer) delete [] *fPointer;
238  if (ncountmax > fNdata) fNdata = ncountmax;
239  *fPointer = new Short_t[fNdata];
240  }
241  fValue = *fPointer;
242  } else {
243  fValue = (Short_t*)add;
244  }
245  } else {
246  fValue = new Short_t[fNdata];
247  fValue[0] = 0;
248  }
249 }