These comments concern root v1.01/4 and (where applicable) the 1.00
documentation (haven't wasted another tree, yet, so apologies if my
comments conerning this have already been addressed):
1) -- easy one first -- The error message triggered by trying to add two
histograms with different numbers of bins has a typo -- it says `Attemp'
rather than `Attempt'. It's also not clear what actually happens in this
case -- are the bins added anyway, and if so, how many bins does the new
histogram have -- the same as the smaller histogram, or the same as the
larger? An extra line clarifying what happens probably wouldn't go amiss.
2) GetBinLowEdge and related functions don't give well-defined responses
if you specify a bin which doesn't exist in the histogram -- they give an
answer (which is presumably what would have been the right answer had
their been that many bins) with no error message. Is this the intended
behaviour, or is some trapping required?
3) Now we're getting nasty: TTree::Select(). The 1.00 documentation is
sparse to the point of confusion, and the function doesn't work --
certainly as I interpret the documentation, anyway. I would expect lines
of the form
TEventList *elist = T->Select("mu==-100")
to a return an eventlist giving me the numbers of all events where the key
mu has value -100. Instead I get the NULL pointer despite the fact I
*know* entries with this key value exist. Connected with this, the
documentation on selectors a) doesn't explain what they are or what they
do, and b) isn't clear about whether this is a function a normal user
would want to use (and under what circumstances), or if it is mainly (or
exclusively) for the internal gubbins of TTree and related classes (in
which case why isn't it protected?).
Finally, an easy one -- have macro search paths been implemented yet? If
so, how are they set, and if not, is this in the pipeline?
Thanks,
Chris.
--- Chris Green. HEP, University of Liverpool MAIL Chris.Green@cern.ch, WWW http://wwwcn.cern.ch/~greenc/ +41 22 767 8075. On LTA at CERN.---