This file is indexed.

/usr/include/root/RooRangeBinning.h is in libroot-roofit-dev 5.34.00-2.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*****************************************************************************
 * Project: RooFit                                                           *
 * Package: RooFitCore                                                       *
 *    File: $Id: RooRangeBinning.h,v 1.4 2007/05/11 09:11:30 verkerke Exp $
 * Authors:                                                                  *
 *   WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu       *
 *   DK, David Kirkby,    UC Irvine,         dkirkby@uci.edu                 *
 *                                                                           *
 * Copyright (c) 2000-2005, Regents of the University of California          *
 *                          and Stanford University. All rights reserved.    *
 *                                                                           *
 * Redistribution and use in source and binary forms,                        *
 * with or without modification, are permitted according to the terms        *
 * listed in LICENSE (http://roofit.sourceforge.net/license.txt)             *
 *****************************************************************************/
#ifndef ROO_RANGE_BINNING
#define ROO_RANGE_BINNING

#include "RooAbsBinning.h"

class RooRangeBinning : public RooAbsBinning {
public:

  RooRangeBinning(const char* name=0) ;
  RooRangeBinning(Double_t xmin, Double_t xmax, const char* name=0) ;
  RooRangeBinning(const RooRangeBinning&, const char* name=0) ;
  virtual RooAbsBinning* clone(const char* name=0) const { return new RooRangeBinning(*this,name?name:GetName()) ; }
  virtual ~RooRangeBinning() ;

  virtual Int_t numBoundaries() const { return 2 ; }
  virtual Int_t binNumber(Double_t) const { return 0 ; }
  virtual Double_t binCenter(Int_t) const { return (_range[0] + _range[1]) / 2 ; }
  virtual Double_t binWidth(Int_t) const { return (_range[1] - _range[0]) ; }
  virtual Double_t binLow(Int_t) const { return _range[0] ; }
  virtual Double_t binHigh(Int_t) const { return _range[1] ; }

  virtual void setRange(Double_t xlo, Double_t xhi) ;
  virtual void setMin(Double_t xlo) { setRange(xlo,highBound()) ; }
  virtual void setMax(Double_t xhi) { setRange(lowBound(),xhi) ; }

  virtual Double_t lowBound() const { return _range[0] ; }
  virtual Double_t highBound() const { return _range[1] ; }
  virtual Double_t averageBinWidth() const { return binWidth(0) ; }

  virtual Double_t* array() const { return const_cast<Double_t*>(_range) ; }

protected:

  Double_t _range[2] ;
    
  ClassDef(RooRangeBinning,1) // Binning that only defines the total range
};

#endif