C See below. Only minimal checking is done to ensure sensible C arguments. The Figaro version should be slightly more robust than the C Lolita version in this respect, since the linear interpolation between C array values is less likely to run berserk than the polynomial evaluation C of the earlier version. This refers to the way in which the input data is interpolated to arrive C at the number of counts in a fraction of a bin. Suppose that one of the C output bins completely covers one of the input bins, and partially covers C the bins on either side.
Bin is treated as though it collects all the C counts from to .
It is not treated as sampling the data C a position only. In linear rebinning it is assumed that the count C rate was uniform across each bin. Thus, for example, if an output bin covers C one quarter of an input bin, then it receives one quarter of the counts C in that bin. In quadratic rebinning it is assumed that, locally, the original data C followed a parabola, and that the number of counts in bin results C from integrating this parabola from to . When a fraction C of an input bin is required, the equation of the parabola which fits this C bin and the neighbouring bins is found, and then integrated appropriately.