/usr/include/root/RooNormSetCache.h is in libroot-roofit-dev 5.34.30-0ubuntu8.
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 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 | /*****************************************************************************
* Project: RooFit *
* Package: RooFitCore *
* File: $Id: RooNormSetCache.h,v 1.12 2007/08/09 19:55:47 wouter 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_NORMSET_CACHE
#define ROO_NORMSET_CACHE
#include <utility>
#include <vector>
#include <map>
#include "Rtypes.h"
#include "Riosfwd.h"
#include "RooNameSet.h"
class RooAbsArg;
class RooArgSet;
typedef RooArgSet* pRooArgSet ;
class RooNormSetCache {
protected:
typedef std::pair<const RooArgSet*, const RooArgSet*> Pair;
struct PairCmp {
inline bool operator()(const Pair& a, const Pair& b) const
{
if (a.first < b.first) return true;
if (b.first < a.first) return false;
return a.second < b.second;
}
};
typedef std::vector<Pair> PairVectType;
typedef std::map<Pair, ULong_t> PairIdxMapType;
public:
RooNormSetCache(ULong_t max = 32);
virtual ~RooNormSetCache();
void add(const RooArgSet* set1, const RooArgSet* set2 = 0);
inline Int_t index(const RooArgSet* set1, const RooArgSet* set2 = 0,
const TNamed* set2RangeName = 0)
{
// Match range name first
if (set2RangeName != _set2RangeName) return -1;
const Pair pair(set1, set2);
PairIdxMapType::const_iterator it = _pairToIdx.lower_bound(pair);
if (_pairToIdx.end() != it &&
!PairCmp()(it->first, pair) && !PairCmp()(pair, it->first))
return it->second;
return -1;
}
inline Bool_t contains(const RooArgSet* set1, const RooArgSet* set2 = 0,
const TNamed* set2RangeName = 0)
{ return (index(set1,set2,set2RangeName) >= 0); }
inline Bool_t containsSet1(const RooArgSet* set1)
{
const Pair pair(set1, (const RooArgSet*)0);
PairIdxMapType::const_iterator it = _pairToIdx.lower_bound(pair);
if (_pairToIdx.end() != it && it->first.first == set1)
return kTRUE;
return kFALSE;
}
const RooArgSet* lastSet1() const { return _pairs.empty()?0:_pairs.back().first; }
const RooArgSet* lastSet2() const { return _pairs.empty()?0:_pairs.back().second; }
const RooNameSet& nameSet1() const { return _name1; }
const RooNameSet& nameSet2() const { return _name2; }
Bool_t autoCache(const RooAbsArg* self, const RooArgSet* set1,
const RooArgSet* set2 = 0, const TNamed* set2RangeName = 0,
Bool_t autoRefill = kTRUE);
void clear();
Int_t entries() const { return _pairs.size(); }
void initialize(const RooNormSetCache& other) { clear(); *this = other; }
protected:
PairVectType _pairs; //!
PairIdxMapType _pairToIdx; //!
ULong_t _max; //!
ULong_t _next; //!
RooNameSet _name1; //!
RooNameSet _name2; //!
TNamed* _set2RangeName; //!
ClassDef(RooNormSetCache, 0) // Management tool for tracking sets of similar integration/normalization sets
};
#endif
|