80 for (i=0;i<
fNin;i++) {
88 for (i=0;i<
fNin;i++) {
123 if (
xout ==
nullptr) {
280 while (
iiter <= iter+1) {
305 if (!ok)
ys[i] =
y[i];
312 for(
j = last+1;
j < i;
j++) {
314 ys[
j] = alpha*
ys[i] + (1.-alpha)*
ys[last];
322 cut =
x[last] + delta;
323 for (i = last+1; i <=
n; i++) {
326 if (
x[i] ==
x[last]) {
338 res[i] =
y[i+1] -
ys[i+1];
360 for(i=0 ; i<
n ; i++) {
407 w[
j] = (1.-
d)*(1.-
d)*(1.-
d);
412 }
else if (
x[
j] >
xs)
439 w[
j] *= (
b*(
x[
j]-
a) + 1.);
491 std::cout <<
"Error: Span must be between 0 and 1" << std::endl;
503 std::cout <<
"Error: x must be between 0 and 1 for periodic smooth" << std::endl;
512 for (i=0; i<
fNout; i++) {
518 for (i=0; i<
fNin; i++) {
519 if (
w ==
nullptr) weight[i] = 1;
520 else weight[i] =
w[i];
526 for (i=0; i<
nTmp; i++) {
622 while (
scale <= 0.0) {
632 if (
iper == 2 && (
x[1] < 0.0 ||
x[
n] > 1.0)) {
645 for (i = 1; i <= 3; ++i) {
647 &
sc[((i<<1)-1)*
n + 1], &
sc[
n*7 + 1]);
649 &
sc[(i<<1)*
n + 1], &
h[1]);
652 for (
j=1;
j<=
n; ++
j) {
654 for (i=1; i<=3; ++i) {
670 &
sc[(
n<<1) + 1], &
h[1]);
672 for (
j=1;
j<=
n; ++
j) {
731 for (i=1; i<=it; ++i) {
752 var += tmp * (
xti -
xm);
756 for (
j=1;
j<=
n; ++
j) {
780 var -= tmp * (
xto -
xm);
797 var += tmp * (
xti -
xm);
839 if (
x[
j + 1] >
x[
j]) {
853 for (i=
j0; i<=
j; ++i) {
876 for (i=0;i<
fNin;i++) {
893 for (i=1;i<
fNin+1;i++) {
926 for (i=0;i<
fNin;i++) {
1015 std::cout <<
"Error: Invalid f value" << std::endl;
1031 std::cout <<
"Error: Method not known: " <<
ties << std::endl;
1043 if (
xout ==
nullptr) {
1080 if(
v <
x[i])
return ylow;
1086 if(
v <
x[ij])
j = ij;
1091 if(
v ==
x[
j])
return y[
j];
1092 if(
v ==
x[i])
return y[i];
1095 return y[i] + (
y[
j] -
y[i]) * ((
v -
x[i])/(
x[
j] -
x[i]));
1097 return y[i] * (1-
f) +
y[
j] *
f;
1109 if (
x <
y)
return -1;
1110 if (
x >
y)
return 1;
1126 for(i =
pL,
j =
pR; i <=
j;) {
1129 if (i <=
j) {
w =
x[i];
x[i++] =
x[
j];
x[
j--] =
w; }
1151 for (
Int_t i=0;i<
n;i++) {
int Int_t
Signed integer 4 bytes (int)
const char Option_t
Option string (const char)
ROOT::Detail::TRangeCast< T, true > TRangeDynCast
TRangeDynCast is an adapter class that allows the typed iteration through a TCollection.
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t Float_t Float_t Float_t Int_t Int_t UInt_t UInt_t Rectangle_t Int_t Int_t Window_t TString Int_t GCValues_t GetPrimarySelectionOwner GetDisplay GetScreen GetColormap GetNativeEvent const char const char dpyName wid window const char font_name cursor keysym reg const char only_if_exist regb h Point_t np
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t Float_t r
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t index
A TGraphErrors is a TGraph with error bars.
Double_t fMinX
Minimum value of array X.
TGraph * fGin
Input graph.
Double_t fMaxX
Maximum value of array X.
static Int_t Rcmp(Double_t x, Double_t y)
Static function if (ISNAN(x)) return 1; if (ISNAN(y)) return -1;.
TGraph * SmoothLowess(TGraph *grin, Option_t *option="", Double_t span=0.67, Int_t iter=3, Double_t delta=0)
Smooth data with Lowess smoother.
~TGraphSmooth() override
GraphSmooth destructor.
TGraph * SmoothSuper(TGraph *grin, Option_t *option="", Double_t bass=0, Double_t span=0, Bool_t isPeriodic=kFALSE, Double_t *w=nullptr)
Smooth data with Super smoother.
static void Rank(Int_t n, Double_t *a, Int_t *index, Int_t *rank, Bool_t down=kTRUE)
static function
Int_t fNout
Number of output points.
static void BDRksmooth(Double_t *x, Double_t *y, Int_t n, Double_t *xp, Double_t *yp, Int_t np, Int_t kernel, Double_t bw)
Smooth data with specified kernel.
Int_t fNin
Number of input points.
void Smoothin(TGraph *grin)
Sort input data points.
TGraph * SmoothKern(TGraph *grin, Option_t *option="normal", Double_t bandwidth=0.5, Int_t nout=100, Double_t *xout=nullptr)
Smooth data with Kernel smoother.
TGraph * Approx(TGraph *grin, Option_t *option="linear", Int_t nout=50, Double_t *xout=nullptr, Double_t yleft=0, Double_t yright=0, Int_t rule=0, Double_t f=0, Option_t *ties="mean")
Approximate data points.
static void BDRsupsmu(Int_t n, Double_t *x, Double_t *y, Double_t *w, Int_t iper, Double_t span, Double_t alpha, Double_t *smo, Double_t *sc)
Friedmanns super smoother (Friedman, 1984).
static void Psort(Double_t *x, Int_t n, Int_t k)
Static function based on R function rPsort: adapted to C++ by Christian Stratowa (R source file: R_so...
TGraph * fGout
Output graph.
static void Lowest(Double_t *x, Double_t *y, Int_t n, Double_t &xs, Double_t &ys, Int_t nleft, Int_t nright, Double_t *w, Bool_t userw, Double_t *rw, Bool_t &ok)
Fit value at x[i] Based on R function lowest: Translated to C++ by C.
static void BDRsmooth(Int_t n, Double_t *x, Double_t *y, Double_t *w, Double_t span, Int_t iper, Double_t vsmlsq, Double_t *smo, Double_t *acvr)
Function for super smoother Based on R function supsmu: Translated to C++ by C.
static Double_t Approx1(Double_t v, Double_t f, Double_t *x, Double_t *y, Int_t n, Int_t iKind, Double_t Ylow, Double_t Yhigh)
Approximate one data point.
void Lowess(Double_t *x, Double_t *y, Int_t n, Double_t *ys, Double_t span, Int_t iter, Double_t delta)
Lowess regression smoother.
void Approxin(TGraph *grin, Int_t iKind, Double_t &Ylow, Double_t &Yhigh, Int_t rule, Int_t iTies)
Sort data points and eliminate double x values.
A TGraph is an object made of two arrays X and Y with npoints each.
virtual void SetPoint(Int_t i, Double_t x, Double_t y)
Set x and y values for point number i.
virtual void Set(Int_t n)
Set number of points in the graph Existing coordinates are preserved New coordinates above fNpoints a...
The TNamed class is the base class for all named ROOT classes.
void ToLower()
Change string to lower-case.
Bool_t Contains(const char *pat, ECaseCompare cmp=kExact) const
Short_t Max(Short_t a, Short_t b)
Returns the largest of a and b.
Double_t Exp(Double_t x)
Returns the base-e exponential function of x, which is e raised to the power x.
Double_t Sqrt(Double_t x)
Returns the square root of x.
LongDouble_t Power(LongDouble_t x, LongDouble_t y)
Returns x raised to the power y.
Short_t Min(Short_t a, Short_t b)
Returns the smallest of a and b.
void Sort(Index n, const Element *a, Index *index, Bool_t down=kTRUE)
Sort the n elements of the array a of generic templated type Element.
Short_t Abs(Short_t d)
Returns the absolute value of parameter Short_t d.