/*****************************************************************************
* Project: RooFit *
* Package: RooFitCore *
* File: $Id: RooAbsArg.cc,v 1.92 2005/06/20 15:44:43 wverkerke 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) *
*****************************************************************************/
// -- CLASS DESCRIPTION [MISC] --
// RooAbsArg is the common abstract base class for objects that represent a
// value (of arbitrary type) and "shape" that in general depends on (is a client of)
// other RooAbsArg subclasses. The only state information about a value that
// is maintained in this base class consists of named attributes and flags
// that track when either the value or the shape of this object changes. The
// meaning of shape depends on the client implementation but could be, for
// example, the allowed range of a value. The base class is also responsible
// for managing client/server links and propagating value/shape changes
// through an expression tree.
//
// RooAbsArg implements public interfaces for inspecting client/server
// relationships and setting/clearing/testing named attributes. The class
// also defines a pure virtual public interface for I/O streaming.
#include "RooFit.h"
#include "TObjString.h"
#include "TObjString.h"
#include "RooAbsArg.h"
#include "RooArgSet.h"
#include "RooArgProxy.h"
#include "RooSetProxy.h"
#include "RooListProxy.h"
#include "RooAbsData.h"
#include "RooAbsCategoryLValue.h"
#include "RooAbsRealLValue.h"
#include "RooTrace.h"
#include "RooStringVar.h"
#include <string.h>
#include <iomanip>
#include <fstream>
#if (__GNUC__==3&&__GNUC_MINOR__==2&&__GNUC_PATCHLEVEL__==3)
char* operator+( streampos&, char* );
#endif
ClassImp(RooAbsArg)
;
Bool_t RooAbsArg::_verboseDirty(kFALSE) ;
Bool_t RooAbsArg::_inhibitDirty(kFALSE) ;
Int_t RooAbsArg::_nameLength(0) ;
RooAbsArg::RooAbsArg() :
TNamed(),
_attribList(),
_deleteWatch(kFALSE),
_operMode(Auto)
{
// Default constructor creates an unnamed object. At present this
// will trigger an assert(0) because may indicate an attempt to
// recreate a RooAbsArg from a root stream buffer, which is not
// supported yet.
_clientShapeIter = _clientListShape.MakeIterator() ;
_clientValueIter = _clientListValue.MakeIterator() ;
// cout << "RooAbsArg::ctor WARNING: default ctor called" << endl ;
// assert(0) ;
RooTrace::create(this) ;
}
RooAbsArg::RooAbsArg(const char *name, const char *title) :
TNamed(name,title),
_deleteWatch(kFALSE),
_valueDirty(kTRUE),
_shapeDirty(kTRUE),
_operMode(Auto)
{
// Create an object with the specified name and descriptive title.
// The newly created object has no clients or servers and has its
// dirty flags set.
_clientShapeIter = _clientListShape.MakeIterator() ;
_clientValueIter = _clientListValue.MakeIterator() ;
RooTrace::create(this) ;
}
RooAbsArg::RooAbsArg(const RooAbsArg& other, const char* name)
: TNamed(other.GetName(),other.GetTitle()),
RooPrintable(other),
_deleteWatch(other._deleteWatch),
_operMode(Auto)
{
// Copy constructor transfers all properties of the original
// object, except for its list of clients. The newly created
// object has an empty client list and has its dirty
// flags set.
// Use name in argument, if supplied
if (name) SetName(name) ;
// take attributes from target
TObject* obj ;
TIterator* aIter = other._attribList.MakeIterator() ;
while ((obj=aIter->Next())) {
_attribList.Add(new TObjString(obj->GetName())) ;
}
delete aIter ;
// Copy server list by hand
TIterator* sIter = other._serverList.MakeIterator() ;
RooAbsArg* server ;
Bool_t valueProp, shapeProp ;
while ((server = (RooAbsArg*) sIter->Next())) {
valueProp = server->_clientListValue.FindObject((TObject*)&other)?kTRUE:kFALSE ;
shapeProp = server->_clientListShape.FindObject((TObject*)&other)?kTRUE:kFALSE ;
addServer(*server,valueProp,shapeProp) ;
}
delete sIter ;
_clientShapeIter = _clientListShape.MakeIterator() ;
_clientValueIter = _clientListValue.MakeIterator() ;
setValueDirty() ;
setShapeDirty() ;
setAttribute(Form("CloneOf(%08x)",&other)) ;
RooTrace::create(this) ;
}
RooAbsArg::~RooAbsArg()
{
// Destructor notifies its servers that they no longer need to serve us and
// notifies its clients that they are now in limbo (!)
// Notify all servers that they no longer need to serve us
TIterator* serverIter = _serverList.MakeIterator() ;
RooAbsArg* server ;
while ((server=(RooAbsArg*)serverIter->Next())) {
removeServer(*server,kTRUE) ;
}
delete serverIter ;
//Notify all client that they are in limbo
TIterator* clientIter = _clientList.MakeIterator() ;
RooAbsArg* client = 0;
Bool_t first(kTRUE) ;
while ((client=(RooAbsArg*)clientIter->Next())) {
client->setAttribute("ServerDied") ;
TString attr("ServerDied:");
attr.Append(GetName());
attr.Append(Form("(%x)",this)) ;
client->setAttribute(attr.Data());
client->removeServer(*this,kTRUE);
if (_verboseDirty || deleteWatch()) {
if (deleteWatch() && first) {
cout << "RooAbsArg::dtor(" << GetName() << "," << this << ") DeleteWatch: object is being destroyed" << endl ;
first = kFALSE ;
}
cout << fName << "::" << ClassName() << ":~RooAbsArg: dependent \""
<< client->GetName() << "\" should have been deleted first" << endl ;
}
}
delete clientIter ;
_attribList.Delete() ;
delete _clientShapeIter ;
delete _clientValueIter ;
RooTrace::destroy(this) ;
}
Bool_t RooAbsArg::isCloneOf(const RooAbsArg& other) const
{
// Check if this object was created as a clone of 'other'
return (getAttribute(Form("CloneOf(%08x)",&other)) ||
other.getAttribute(Form("CloneOf(%08x)",this))) ;
}
void RooAbsArg::setAttribute(const Text_t* name, Bool_t value)
{
// Set (default) or clear a named boolean attribute of this object.
TObject* oldAttrib = _attribList.FindObject(name) ;
if (value) {
// Add string to attribute list, if not already there
if (!oldAttrib) {
TObjString* nameObj = new TObjString(name) ;
_attribList.Add(nameObj) ;
}
} else {
// Remove string from attribute list, if found
if (oldAttrib) {
_attribList.Remove(oldAttrib) ;
}
}
}
Bool_t RooAbsArg::getAttribute(const Text_t* name) const
{
// Check if a named attribute is set. By default, all attributes
// are unset.
return _attribList.FindObject(name)?kTRUE:kFALSE ;
}
void RooAbsArg::addServer(RooAbsArg& server, Bool_t valueProp, Bool_t shapeProp)
{
// Register another RooAbsArg as a server to us, ie, declare that
// we depend on it. In addition to the basic client-server relationship,
// we can declare dependence on the server's value and/or shape.
if (_verboseDirty) {
cout << "RooAbsArg::addServer(" << GetName() << "): adding server " << server.GetName()
<< "(" << &server << ") for " << (valueProp?"value ":"") << (shapeProp?"shape":"") << endl ;
}
// Add server link to given server
_serverList.Add(&server) ;
server._clientList.Add(this) ;
if (valueProp) server._clientListValue.Add(this) ;
if (shapeProp) server._clientListShape.Add(this) ;
}
void RooAbsArg::addServerList(RooAbsCollection& serverList, Bool_t valueProp, Bool_t shapeProp)
{
// Register a list of RooAbsArg as servers to us by calls addServer() for each
// arg in the list
RooAbsArg* arg ;
TIterator* iter = serverList.createIterator() ;
while ((arg=(RooAbsArg*)iter->Next())) {
addServer(*arg,valueProp,shapeProp) ;
}
delete iter ;
}
void RooAbsArg::removeServer(RooAbsArg& server, Bool_t force)
{
// Unregister another RooAbsArg as a server to us, ie, declare that
// we no longer depend on its value and shape.
if (_verboseDirty) {
cout << "RooAbsArg::removeServer(" << GetName() << "): removing server "
<< server.GetName() << "(" << &server << ")" << endl ;
}
// Remove server link to given server
if (!force) {
_serverList.Remove(&server) ;
server._clientList.Remove(this) ;
server._clientListValue.Remove(this) ;
server._clientListShape.Remove(this) ;
} else {
_serverList.RemoveAll(&server) ;
server._clientList.RemoveAll(this) ;
server._clientListValue.RemoveAll(this) ;
server._clientListShape.RemoveAll(this) ;
}
}
void RooAbsArg::replaceServer(RooAbsArg& oldServer, RooAbsArg& newServer, Bool_t propValue, Bool_t propShape)
{
Int_t count = _serverList.refCount(&oldServer) ;
removeServer(oldServer,kTRUE) ;
while(count--) {
addServer(newServer,propValue,propShape) ;
}
}
void RooAbsArg::changeServer(RooAbsArg& server, Bool_t valueProp, Bool_t shapeProp)
{
// Change dirty flag propagation mask for specified server
if (!_serverList.FindObject(&server)) {
cout << "RooAbsArg::changeServer(" << GetName() << "): Server "
<< server.GetName() << " not registered" << endl ;
return ;
}
// This condition should not happen, but check anyway
if (!server._clientList.FindObject(this)) {
cout << "RooAbsArg::changeServer(" << GetName() << "): Server "
<< server.GetName() << " doesn't have us registered as client" << endl ;
return ;
}
// Remove all propagation links, then reinstall requested ones ;
Int_t vcount = server._clientListValue.refCount(this) ;
Int_t scount = server._clientListShape.refCount(this) ;
server._clientListValue.RemoveAll(this) ;
server._clientListShape.RemoveAll(this) ;
if (valueProp) {
while (vcount--) server._clientListValue.Add(this) ;
}
if (shapeProp) {
while(scount--) server._clientListShape.Add(this) ;
}
}
void RooAbsArg::leafNodeServerList(RooAbsCollection* list, const RooAbsArg* arg) const
{
// Fill supplied list with all leaf nodes of the arg tree, starting with
// ourself as top node. A leaf node is node that has no servers declared.
treeNodeServerList(list,arg,kFALSE,kTRUE) ;
}
void RooAbsArg::branchNodeServerList(RooAbsCollection* list, const RooAbsArg* arg) const
{
// Fill supplied list with all branch nodes of the arg tree starting with
// ourself as top node. A branch node is node that has one or more servers declared.
treeNodeServerList(list,arg,kTRUE,kFALSE) ;
}
void RooAbsArg::treeNodeServerList(RooAbsCollection* list, const RooAbsArg* arg, Bool_t doBranch, Bool_t doLeaf, Bool_t valueOnly) const
{
// Fill supplied list with nodes of the arg tree, following all server links,
// starting with ourself as top node.
if (!arg) {
if (list->getHashTableSize()==0) {
list->setHashTableSize(1000) ;
}
arg=this ;
}
// Decide if to add current node
if ((doBranch&&doLeaf) ||
(doBranch&&arg->isDerived()) ||
(doLeaf&&!arg->isDerived())) {
list->add(*arg,kTRUE) ;
}
// Recurse if current node is derived
if (arg->isDerived()) {
RooAbsArg* server ;
TIterator* sIter = arg->serverIterator() ;
while ((server=(RooAbsArg*)sIter->Next())) {
// Skip non-value server nodes if requested
Bool_t isValueServer = server->_clientListValue.FindObject((TObject*)arg)?kTRUE:kFALSE ;
if (valueOnly && !isValueServer) continue ;
treeNodeServerList(list,server,doBranch,doLeaf) ;
}
delete sIter ;
}
}
RooArgSet* RooAbsArg::getParameters(const RooAbsData* set) const
{
// Create a list of leaf nodes in the arg tree starting with
// ourself as top node that don't match any of the names of the variable list
// of the supplied data set (the dependents). The caller of this
// function is responsible for deleting the returned argset.
// The complement of this function is getObservables()
return getParameters(set?set->get():0) ;
}
RooArgSet* RooAbsArg::getParameters(const RooArgSet* nset) const
{
// Create a list of leaf nodes in the arg tree starting with
// ourself as top node that don't match any of the names the args in the
// supplied argset. The caller of this function is responsible
// for deleting the returned argset. The complement of this function
// is getObservables()
RooArgSet parList("parameters") ;
// Create and fill deep server list
RooArgSet leafList("leafNodeServerList") ;
treeNodeServerList(&leafList,0,kFALSE,kTRUE,kFALSE) ;
// leafNodeServerList(&leafList) ;
// Copy non-dependent servers to parameter list
TIterator* sIter = leafList.createIterator() ;
RooAbsArg* arg ;
while ((arg=(RooAbsArg*)sIter->Next())) {
if ((!nset || !arg->dependsOn(*nset)) && arg->isLValue()) {
parList.add(*arg) ;
}
}
delete sIter ;
// Call hook function for all branch nodes
RooArgSet branchList ;
branchNodeServerList(&branchList) ;
RooAbsArg* branch ;
TIterator* bIter = branchList.createIterator() ;
while((branch=(RooAbsArg*)bIter->Next())) {
branch->getParametersHook(nset, &parList) ;
}
delete bIter ;
RooArgList tmp(parList) ;
tmp.sort() ;
return new RooArgSet(tmp) ;
}
RooArgSet* RooAbsArg::getObservables(const RooAbsData* set) const
{
// Create a list of leaf nodes in the arg tree starting with
// ourself as top node that match any of the names of the variable list
// of the supplied data set (the dependents). The caller of this
// function is responsible for deleting the returned argset.
// The complement of this function is getObservables()
if (!set) return new RooArgSet ;
return getObservables(set->get()) ;
}
RooArgSet* RooAbsArg::getObservables(const RooArgSet* dataList) const
{
// Create a list of leaf nodes in the arg tree starting with
// ourself as top node that match any of the names the args in the
// supplied argset. The caller of this function is responsible
// for deleting the returned argset. The complement of this function
// is getObservables()
//cout << "RooAbsArg::getObservables(" << GetName() << ")" << endl ;
RooArgSet* depList = new RooArgSet("dependents") ;
if (!dataList) return depList ;
// Make iterator over tree leaf node list
RooArgSet leafList("leafNodeServerList") ;
treeNodeServerList(&leafList,0,kFALSE,kTRUE,kTRUE) ;
//leafNodeServerList(&leafList) ;
TIterator *sIter = leafList.createIterator() ;
RooAbsArg* arg ;
while ((arg=(RooAbsArg*)sIter->Next())) {
if (arg->dependsOn(*dataList) && arg->isLValue()) {
depList->add(*arg) ;
}
}
delete sIter ;
// Call hook function for all branch nodes
RooArgSet branchList ;
branchNodeServerList(&branchList) ;
RooAbsArg* branch ;
TIterator* bIter = branchList.createIterator() ;
while((branch=(RooAbsArg*)bIter->Next())) {
branch->getObservablesHook(dataList, depList) ;
}
delete bIter ;
return depList ;
}
RooArgSet* RooAbsArg::getComponents() const
{
TString name(GetName()) ;
name.Append("_components") ;
RooArgSet* set = new RooArgSet(name) ;
branchNodeServerList(set) ;
return set ;
}
Bool_t RooAbsArg::checkObservables(const RooArgSet*) const
{
// Overloadable function in which derived classes can implement
// consistency checks of the variables. If this function returns
// true, indicating an error, the fitter or generator will abort.
return kFALSE ;
}
Bool_t RooAbsArg::recursiveCheckObservables(const RooArgSet* nset) const
{
RooArgSet nodeList ;
treeNodeServerList(&nodeList) ;
TIterator* iter = nodeList.createIterator() ;
RooAbsArg* arg ;
Bool_t ret(kFALSE) ;
while((arg=(RooAbsArg*)iter->Next())) {
if (arg->getAttribute("ServerDied")) {
cout << "RooAbsArg::recursiveCheckObservables(" << GetName() << "): ERROR: one or more servers of node "
<< arg->GetName() << " no longer exists!" << endl ;
arg->Print("v") ;
ret = kTRUE ;
}
ret |= arg->checkObservables(nset) ;
}
delete iter ;
return ret ;
}
Bool_t RooAbsArg::dependsOn(const RooAbsCollection& serverList, const RooAbsArg* ignoreArg) const
{
// Test whether we depend on (ie, are served by) any object in the
// specified collection. Uses the dependsOn(RooAbsArg&) member function.
Bool_t result(kFALSE);
TIterator* sIter = serverList.createIterator();
RooAbsArg* server ;
while ((!result && (server=(RooAbsArg*)sIter->Next()))) {
if (dependsOn(*server,ignoreArg)) {
result= kTRUE;
}
}
delete sIter;
return result;
}
Bool_t RooAbsArg::dependsOn(const RooAbsArg& testArg, const RooAbsArg* ignoreArg) const
{
// Test whether we depend on (ie, are served by) the specified object.
// Note that RooAbsArg objects are considered equivalent if they have
// the same name.
if (this==ignoreArg) return kFALSE ;
// First check if testArg is self
if (!TString(testArg.GetName()).CompareTo(GetName())) return kTRUE ;
// Next test direct dependence
if (_serverList.FindObject(testArg.GetName())) return kTRUE ;
// If not, recurse
TIterator* sIter = serverIterator() ;
RooAbsArg* server = 0 ;
while ((server=(RooAbsArg*)sIter->Next())) {
if (server->dependsOn(testArg)) {
delete sIter ;
return kTRUE ;
}
}
delete sIter ;
return kFALSE ;
}
Bool_t RooAbsArg::overlaps(const RooAbsArg& testArg) const
{
// Test if any of the nodes of tree are shared with that of the given tree
RooArgSet list("treeNodeList") ;
treeNodeServerList(&list) ;
return testArg.dependsOn(list) ;
}
Bool_t RooAbsArg::observableOverlaps(const RooAbsData* dset, const RooAbsArg& testArg) const
{
// Test if any of the dependents of the arg tree (as determined by getObservables)
// overlaps with those of the testArg.
return observableOverlaps(dset->get(),testArg) ;
}
Bool_t RooAbsArg::observableOverlaps(const RooArgSet* nset, const RooAbsArg& testArg) const
{
// Test if any of the dependents of the arg tree (as determined by getObservables)
// overlaps with those of the testArg.
RooArgSet* depList = getObservables(nset) ;
Bool_t ret = testArg.dependsOn(*depList) ;
delete depList ;
return ret ;
}
void RooAbsArg::setValueDirty(const RooAbsArg* source) const
{
// Mark this object as having changed its value, and propagate this status
// change to all of our clients. If the object is not in automatic dirty
// state propagation mode, this call has no effect
if (_operMode!=Auto || _inhibitDirty) return ;
// Handle no-propagation scenarios first
if (_clientListValue.GetSize()==0) {
_valueDirty = kTRUE ;
return ;
}
// Cyclical dependency interception
if (source==0) {
source=this ;
} else if (source==this) {
// Cyclical dependency, abort
cout << "RooAbsArg::setValueDirty(" << GetName()
<< "): cyclical dependency detected" << endl ;
return ;
}
// Propagate dirty flag to all clients if this is a down->up transition
if (_verboseDirty) cout << "RooAbsArg::setValueDirty(" << (source?source->GetName():"self") << "->" << GetName() << "," << this
<< "): dirty flag " << (_valueDirty?"already ":"") << "raised" << endl ;
_valueDirty = kTRUE ;
_clientValueIter->Reset() ;
RooAbsArg* client ;
while ((client=(RooAbsArg*)_clientValueIter->Next())) {
client->setValueDirty(source) ;
}
}
void RooAbsArg::setShapeDirty(const RooAbsArg* source) const
{
// Mark this object as having changed its shape, and propagate this status
// change to all of our clients.
if (_verboseDirty) cout << "RooAbsArg::setShapeDirty(" << GetName()
<< "): dirty flag " << (_shapeDirty?"already ":"") << "raised" << endl ;
if (_clientListShape.GetSize()==0) {
_shapeDirty = kTRUE ;
return ;
}
// Set 'dirty' shape state for this object and propagate flag to all its clients
if (source==0) {
source=this ;
} else if (source==this) {
// Cyclical dependency, abort
cout << "RooAbsArg::setShapeDirty(" << GetName()
<< "): cyclical dependency detected" << endl ;
return ;
}
// Propagate dirty flag to all clients if this is a down->up transition
_shapeDirty=kTRUE ;
_clientShapeIter->Reset() ;
RooAbsArg* client ;
while ((client=(RooAbsArg*)_clientShapeIter->Next())) {
client->setShapeDirty(source) ;
client->setValueDirty(source) ;
}
}
Bool_t RooAbsArg::redirectServers(const RooAbsCollection& newSet, Bool_t mustReplaceAll, Bool_t nameChange, Bool_t isRecursionStep)
{
// Substitute our servers with those listed in newSet. If nameChange is false, servers and
// and substitutes are matched by name. If nameChange is true, servers are matched to args
// in newSet that have the 'ORIGNAME:<servername>' attribute set. If mustReplaceAll is set,
// a warning is printed and error status is returned if not all servers could be sucessfully
// substituted.
// Trivial case, no servers
if (!_serverList.First()) return kFALSE ;
if (newSet.getSize()==0) return kFALSE ;
// Replace current servers with new servers with the same name from the given list
Bool_t ret(kFALSE) ;
//Copy original server list to not confuse the iterator while deleting
THashList origServerList, origServerValue, origServerShape ;
RooAbsArg *oldServer, *newServer ;
TIterator* sIter = _serverList.MakeIterator() ;
while ((oldServer=(RooAbsArg*)sIter->Next())) {
origServerList.Add(oldServer) ;
// Retrieve server side link state information
if (oldServer->_clientListValue.FindObject(this)) {
origServerValue.Add(oldServer) ;
}
if (oldServer->_clientListShape.FindObject(this)) {
origServerShape.Add(oldServer) ;
}
}
delete sIter ;
// Delete all previously registered servers
sIter = origServerList.MakeIterator() ;
Bool_t propValue, propShape ;
while ((oldServer=(RooAbsArg*)sIter->Next())) {
newServer= oldServer->findNewServer(newSet, nameChange);
if (newServer && _verboseDirty) {
cout << "RooAbsArg::redirectServers(" << (void*)this << "," << GetName() << "): server " << oldServer->GetName()
<< " redirected from " << oldServer << " to " << newServer << endl ;
}
if (!newServer) {
if (mustReplaceAll) {
cout << "RooAbsArg::redirectServers(" << (void*)this << "," << GetName() << "): server " << oldServer->GetName()
<< " (" << (void*)oldServer << ") not redirected" << (nameChange?"[nameChange]":"") << endl ;
ret = kTRUE ;
}
continue ;
}
propValue=origServerValue.FindObject(oldServer)?kTRUE:kFALSE ;
propShape=origServerShape.FindObject(oldServer)?kTRUE:kFALSE ;
replaceServer(*oldServer,*newServer,propValue,propShape) ;
// removeServer(*oldServer) ;
// addServer(*newServer,propValue,propShape) ;
}
delete sIter ;
setValueDirty() ;
setShapeDirty() ;
// Process the proxies
Bool_t allReplaced=kTRUE ;
for (int i=0 ; i<numProxies() ; i++) {
Bool_t ret = getProxy(i)->changePointer(newSet,nameChange) ;
allReplaced &= ret ;
}
if (mustReplaceAll && !allReplaced) {
cout << "RooAbsArg::redirectServers(" << GetName()
<< "): ERROR, some proxies could not be adjusted" << endl ;
ret = kTRUE ;
}
// Optional subclass post-processing
ret |= redirectServersHook(newSet,mustReplaceAll,nameChange,isRecursionStep) ;
return ret ;
}
RooAbsArg *RooAbsArg::findNewServer(const RooAbsCollection &newSet, Bool_t nameChange) const {
// Find the new server in the specified set that matches the old server.
// Allow a name change if nameChange is kTRUE, in which case the new
// server is selected by searching for a new server with an attribute
// of "ORIGNAME:<oldName>". Return zero if there is not a unique match.
RooAbsArg *newServer = 0;
if (!nameChange) {
newServer = newSet.find(GetName()) ;
}
else {
// Name changing server redirect:
// use 'ORIGNAME:<oldName>' attribute instead of name of new server
TString nameAttrib("ORIGNAME:") ;
nameAttrib.Append(GetName()) ;
RooArgSet* tmp = (RooArgSet*) newSet.selectByAttrib(nameAttrib,kTRUE) ;
if(0 != tmp) {
// Check if any match was found
if (tmp->getSize()==0) {
delete tmp ;
return 0 ;
}
// Check if match is unique
if(tmp->getSize()>1) {
cout << "RooAbsArg::redirectServers(" << GetName() << "): FATAL Error, " << tmp->getSize() << " servers with "
<< nameAttrib << " attribute" << endl ;
tmp->Print("v") ;
assert(0) ;
}
// use the unique element in the set
newServer= tmp->first();
delete tmp ;
}
}
return newServer;
}
Bool_t RooAbsArg::recursiveRedirectServers(const RooAbsCollection& newSet, Bool_t mustReplaceAll, Bool_t nameChange)
{
// Cyclic recursion protection
static RooLinkedList callStack ;
if (callStack.FindObject(this)) {
return kFALSE ;
} else {
callStack.Add(this) ;
}
// Apply the redirectServers function recursively on all branch nodes in this argument tree.
Bool_t ret(kFALSE) ;
// Do redirect on self (identify operation as recursion step)
ret |= redirectServers(newSet,mustReplaceAll,nameChange,kTRUE) ;
// Do redirect on servers
TIterator* sIter = serverIterator() ;
RooAbsArg* server ;
while((server=(RooAbsArg*)sIter->Next())) {
ret |= server->recursiveRedirectServers(newSet,mustReplaceAll,nameChange) ;
}
delete sIter ;
callStack.Remove(this) ;
return ret ;
}
void RooAbsArg::registerProxy(RooArgProxy& proxy)
{
// Register an RooArgProxy in the proxy list. This function is called by owned
// proxies upon creation. After registration, this arg wil forward pointer
// changes from serverRedirects and updates in cached normalization sets
// to the proxies immediately after they occur. The proxied argument is
// also added as value and/or shape server
// Every proxy can be registered only once
if (_proxyList.FindObject(&proxy)) {
cout << "RooAbsArg::registerProxy(" << GetName() << "): proxy named "
<< proxy.GetName() << " for arg " << proxy.absArg()->GetName()
<< " already registered" << endl ;
return ;
}
// cout << (void*)this << " " << GetName() << ": registering proxy "
// << (void*)&proxy << " with name " << proxy.name() << " in mode "
// << (proxy.isValueServer()?"V":"-") << (proxy.isShapeServer()?"S":"-") << endl ;
// Register proxied object as server
addServer(*proxy.absArg(),proxy.isValueServer(),proxy.isShapeServer()) ;
// Register proxy itself
_proxyList.Add(&proxy) ;
}
void RooAbsArg::unRegisterProxy(RooArgProxy& proxy)
{
// Remove proxy from proxy list. This functions is called by owned proxies
// upon their destruction.
_proxyList.Remove(&proxy) ;
}
void RooAbsArg::registerProxy(RooSetProxy& proxy)
{
// Register an RooSetProxy in the proxy list. This function is called by owned
// proxies upon creation. After registration, this arg wil forward pointer
// changes from serverRedirects and updates in cached normalization sets
// to the proxies immediately after they occur.
// Every proxy can be registered only once
if (_proxyList.FindObject(&proxy)) {
cout << "RooAbsArg::registerProxy(" << GetName() << "): proxy named "
<< proxy.GetName() << " already registered" << endl ;
return ;
}
// Register proxy itself
_proxyList.Add(&proxy) ;
}
void RooAbsArg::unRegisterProxy(RooSetProxy& proxy)
{
// Remove proxy from proxy list. This functions is called by owned proxies
// upon their destruction.
_proxyList.Remove(&proxy) ;
}
void RooAbsArg::registerProxy(RooListProxy& proxy)
{
// Register an RooListProxy in the proxy list. This function is called by owned
// proxies upon creation. After registration, this arg wil forward pointer
// changes from serverRedirects and updates in cached normalization sets
// to the proxies immediately after they occur.
// Every proxy can be registered only once
if (_proxyList.FindObject(&proxy)) {
cout << "RooAbsArg::registerProxy(" << GetName() << "): proxy named "
<< proxy.GetName() << " already registered" << endl ;
return ;
}
// Register proxy itself
_proxyList.Add(&proxy) ;
}
void RooAbsArg::unRegisterProxy(RooListProxy& proxy)
{
// Remove proxy from proxy list. This functions is called by owned proxies
// upon their destruction.
_proxyList.Remove(&proxy) ;
}
RooAbsProxy* RooAbsArg::getProxy(Int_t index) const
{
// Return the nth proxy from the proxy list.
// Cross cast: proxy list returns TObject base pointer, we need
// a RooAbsProxy base pointer. C++ standard requires
// a dynamic_cast for this.
return dynamic_cast<RooAbsProxy*> (_proxyList.At(index)) ;
}
Int_t RooAbsArg::numProxies() const
{
// Return the number of registered proxies.
return _proxyList.GetSize() ;
}
void RooAbsArg::setProxyNormSet(const RooArgSet* nset)
{
// Forward a change in the cached normalization argset
// to all the registered proxies.
for (int i=0 ; i<numProxies() ; i++) {
getProxy(i)->changeNormSet(nset) ;
}
}
void RooAbsArg::attachToTree(TTree& ,Int_t)
{
// Overloadable function for derived classes to implement
// attachment as branch to a TTree
cout << "RooAbsArg::attachToTree(" << GetName()
<< "): Cannot be attached to a TTree" << endl ;
}
Bool_t RooAbsArg::isValid() const
{
// WVE (08/21/01) Probably obsolete now
return kTRUE ;
}
void RooAbsArg::copyList(TList& dest, const TList& source)
{
// WVE (08/21/01) Probably obsolete now
dest.Clear() ;
TIterator* sIter = source.MakeIterator() ;
TObject* obj ;
while ((obj = sIter->Next())) {
dest.Add(obj) ;
}
delete sIter ;
}
void RooAbsArg::printToStream(ostream& os, PrintOption opt, TString indent) const
{
// Print the state of this object to the specified output stream.
//
// OneLine : use RooPrintable::oneLinePrint()
// Standard : use virtual writeToStream() method in non-compact mode
// Verbose : list dirty flags,attributes, clients, servers, and proxies
//
// Subclasses will normally call this method first in their implementation,
// and then add any additional state of their own with the Shape or Verbose
// options.
if(opt == Standard) {
os << ClassName() << "::" << GetName() ;
Int_t nfill = _nameLength-strlen(GetName()) ;
while(nfill-- > 0) os << " " ;
os << ": " ;
if (isDerived()) {
os << "(" ;
writeToStream(os,kFALSE);
os << ") -> " ;
writeToStream(os,kTRUE);
} else {
writeToStream(os,kFALSE);
}
os << endl;
}
else {
if (opt==InLine) {
inLinePrint(os,*this) ;
} else if (opt==OneLine) {
oneLinePrint(os,*this);
} else if(opt == Verbose) {
os << indent << "--- RooAbsArg ---" << endl;
// dirty state flags
os << indent << " Value State: " ;
switch(_operMode) {
case ADirty: os << "FORCED DIRTY" ; break ;
case AClean: os << "FORCED clean" ; break ;
case Auto: os << (isValueDirty() ? "DIRTY":"clean") ; break ;
}
os << endl
<< indent << " Shape State: " << (isShapeDirty() ? "DIRTY":"clean") << endl;
// attribute list
os << indent << " Attributes: " ;
printAttribList(os) ;
os << endl ;
// our memory address (for x-referencing with client addresses of other args)
os << indent << " Address: " << (void*)this << endl;
// client list
os << indent << " Clients: " << endl;
TIterator *clientIter= _clientList.MakeIterator();
RooAbsArg* client ;
while ((client=(RooAbsArg*)clientIter->Next())) {
os << indent << " (" << (void*)client << ","
<< (_clientListValue.FindObject(client)?"V":"-")
<< (_clientListShape.FindObject(client)?"S":"-")
<< ") " ;
client->printToStream(os,OneLine);
}
delete clientIter;
// server list
os << indent << " Servers: " << endl;
TIterator *serverIter= _serverList.MakeIterator();
RooAbsArg* server ;
while ((server=(RooAbsArg*)serverIter->Next())) {
os << indent << " (" << (void*)server << ","
<< (server->_clientListValue.FindObject((TObject*)this)?"V":"-")
<< (server->_clientListShape.FindObject((TObject*)this)?"S":"-")
<< ") " ;
server->printToStream(os,OneLine);
}
delete serverIter;
// proxy list
os << indent << " Proxies: " << endl ;
for (int i=0 ; i<numProxies() ; i++) {
RooAbsProxy* proxy=getProxy(i) ;
if (proxy->IsA()->InheritsFrom(RooArgProxy::Class())) {
os << indent << " " << proxy->name() << " -> " ;
((RooArgProxy*)proxy)->absArg()->printToStream(os,OneLine) ;
} else {
os << indent << " " << proxy->name() << " -> " ;
TString moreIndent(indent) ;
moreIndent.Append(" ") ;
((RooSetProxy*)proxy)->printToStream(os,Standard,moreIndent.Data()) ;
}
}
}
}
}
ostream& operator<<(ostream& os, RooAbsArg &arg)
{
arg.writeToStream(os,kTRUE) ;
return os ;
}
istream& operator>>(istream& is, RooAbsArg &arg)
{
arg.readFromStream(is,kTRUE,kFALSE) ;
return is ;
}
void RooAbsArg::printAttribList(ostream& os) const
{
// Print the attribute list
TIterator *attribIter= _attribList.MakeIterator();
TObjString* attrib ;
Bool_t first(kTRUE) ;
while ((attrib=(TObjString*)attribIter->Next())) {
os << (first?" [":",") << attrib->String() ;
first=kFALSE ;
}
if (!first) os << "] " ;
delete attribIter ;
}
void RooAbsArg::attachDataSet(const RooAbsData &data)
{
// Replace server nodes with names matching the dataset variable names
// with those data set variables, making this PDF directly dependent on the dataset
// recursiveRedirectServers(*data.get(),kFALSE);
// return ;
const RooArgSet* set = data.get() ;
RooArgSet branches ;
branchNodeServerList(&branches) ;
TIterator* iter = branches.createIterator() ;
RooAbsArg* branch ;
while((branch=(RooAbsArg*)iter->Next())) {
branch->redirectServers(*set,kFALSE,kFALSE) ;
}
delete iter ;
}
Int_t RooAbsArg::Compare(const TObject* other) const
{
// Utility function used by TCollection::Sort to compare contained TObjects
// We implement comparison by name, resulting in alphabetical sorting by object name.
return strcmp(GetName(),other->GetName()) ;
}
void RooAbsArg::printDirty(Bool_t depth) const
{
// Print information about current value dirty state information.
// If depth flag is true, information is recursively printed for
// all nodes in this arg tree.
if (depth) {
RooArgSet branchList ;
branchNodeServerList(&branchList) ;
TIterator* bIter = branchList.createIterator() ;
RooAbsArg* branch ;
while((branch=(RooAbsArg*)bIter->Next())) {
branch->printDirty(kFALSE) ;
}
} else {
cout << GetName() << " : " ;
switch (_operMode) {
case AClean: cout << "FORCED clean" ; break ;
case ADirty: cout << "FORCED DIRTY" ; break ;
case Auto: cout << "Auto " << (isValueDirty()?"DIRTY":"clean") ;
}
cout << endl ;
}
}
void RooAbsArg::constOptimize(ConstOpCode opcode)
{
// Default implementation -- forward to all servers
TIterator* sIter = serverIterator() ;
RooAbsArg* server ;
while((server=(RooAbsArg*)sIter->Next())) {
// cout << GetName() << " forwarding constOpt to " << server->GetName() << endl ;
server->constOptimize(opcode) ;
}
delete sIter ;
}
void RooAbsArg::setOperMode(OperMode mode, Bool_t recurseADirty)
{
// Prevent recursion loops
if (mode==_operMode) return ;
_operMode = mode ;
operModeHook() ;
// Propagate to all clients
if (mode==ADirty && recurseADirty) {
TIterator* iter = valueClientIterator() ;
RooAbsArg* client ;
while((client=(RooAbsArg*)iter->Next())) {
client->setOperMode(mode) ;
}
delete iter ;
}
}
void RooAbsArg::printCompactTree(const char* indent, const char* filename)
{
if (filename) {
ofstream ofs(filename) ;
printCompactTree(ofs,indent) ;
} else {
printCompactTree(cout,indent) ;
}
}
void RooAbsArg::printCompactTree(ostream& os, const char* indent)
{
os << indent << this << " " << IsA()->GetName() << "::" << GetName() << " (" << GetTitle() << ") " ;
if (_serverList.GetSize()>0) {
switch(operMode()) {
case Auto: os << " [Auto]" << endl ; break ;
case AClean: os << " [ACLEAN]" << endl ; break ;
case ADirty: os << " [ADIRTY]" << endl ; break ;
}
} else {
os << endl ;
}
printCompactTreeHook(os,indent) ;
TString indent2(indent) ;
indent2 += " " ;
TIterator * iter = serverIterator() ;
RooAbsArg* arg ;
while((arg=(RooAbsArg*)iter->Next())) {
arg->printCompactTree(os,indent2) ;
}
delete iter ;
}
TString RooAbsArg::cleanBranchName() const
{
// Construct a mangled name from the actual name that
// is free of any math symbols that might be interpreted by TTree
TString cleanName(GetName()) ;
cleanName.ReplaceAll("/","D") ;
cleanName.ReplaceAll("-","M") ;
cleanName.ReplaceAll("+","P") ;
cleanName.ReplaceAll("*","X") ;
cleanName.ReplaceAll("[","L") ;
cleanName.ReplaceAll("]","R") ;
cleanName.ReplaceAll("(","L") ;
cleanName.ReplaceAll(")","R") ;
cleanName.ReplaceAll("{","L") ;
cleanName.ReplaceAll("}","R") ;
if (cleanName.Length()<=60) return cleanName ;
// Name is too long, truncate and include CRC32 checksum of full name in clean name
static char buf[1024] ;
strcpy(buf,cleanName.Data()) ;
sprintf(buf+46,"_CRC%08x",crc32(cleanName.Data())) ;
return TString(buf) ;
}
UInt_t RooAbsArg::crc32(const char* data) const
{
// Calculate and extract length of string
Int_t len = strlen(data) ;
if (len<4) {
cout << "RooAbsReal::crc32 cannot calculate checksum of less than 4 bytes of data" << endl ;
return 0 ;
}
// Initialize CRC table on first use
static Bool_t init(kFALSE) ;
static unsigned int crctab[256];
if (!init) {
int i, j;
unsigned int crc;
for (i = 0; i < 256; i++){
crc = i << 24;
for (j = 0; j < 8; j++) {
if (crc & 0x80000000) {
crc = (crc << 1) ^ 0x04c11db7 ;
} else {
crc = crc << 1;
}
}
crctab[i] = crc;
}
init = kTRUE ;
}
unsigned int result(0);
int i(0);
result = *data++ << 24;
result |= *data++ << 16;
result |= *data++ << 8;
result |= *data++;
result = ~ result;
len -=4;
for (i=0; i<len; i++) {
result = (result << 8 | *data++) ^ crctab[result >> 24];
}
return ~result;
}
void RooAbsArg::printCompactTreeHook(ostream&, const char *)
{
}
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.