Variables
art/doc/ROOT_FILE_NOTES.txt File Reference

Variables

and eliminated if possible List of trees
 
and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of ParentageID
 
and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches are
 
and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional branch
 
and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional we are writing an invalid ProcessHistoryID for each event
 
and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional we are writing an invalid ProcessHistoryID for each for backward compatibility EventMetaData **This needs to be verified **This tree contains one row per distinct vector of ProductProvenance encountered during Event processing
 

Variable Documentation

and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches are

Definition at line 15 of file ROOT_FILE_NOTES.txt.

and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional we are writing an invalid ProcessHistoryID for each for backward compatibility EventMetaData **This needs to be verified **This tree contains one row per distinct vector of ProductProvenance encountered during Event and one additional branch

Definition at line 15 of file ROOT_FILE_NOTES.txt.

and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional we are writing an invalid ProcessHistoryID for each event

Definition at line 15 of file ROOT_FILE_NOTES.txt.

and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of ParentageID

Definition at line 15 of file ROOT_FILE_NOTES.txt.

and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional we are writing an invalid ProcessHistoryID for each for backward compatibility EventMetaData** This needs to be verified** This tree contains one row per distinct vector of ProductProvenance encountered during Event processing
Initial value:
==================== ==================================
*branch name* *entry type*
EventBranchEntryInfo ``vector<art::ProductProvenance>``
==================== ==================================
-------
This tree contains one row per subrun.
It contains one branch per product stored in the SubRun
unsigned int subrun
*file AnalysisTree_module cc *brief Module to create a TTree for analysis *authors tjyang fnal sowjanyag phys ksu edu **Taken from uboone code Imported by Karl k warburton sheffield ac uk *with the help of Tingjun Yang **Current implementation with one set of branches for each tracking algorithm *The data structure which hosts the addresses of the tree branches is *dynamically allocated on and it can be optionally destroyed at the *end of each event *The data and it is contained in a C vector of *one per algorithm These structures can also be allocated on demand *Each of these structures is connected to a set of one branch per *data member Data members are vectors of numbers or vectors of fixed size *C arrays The vector index represents the tracks reconstructed by the and each has a fixed size pool for connect to a *ROOT tree(creating the branches they need) and resize.*The AnalysisTreeDataStruct is const ructed with as many tracking algorithms as *there are named in the module configuration(even if they are not backed by *any available tracking data).*By default const ruction
these are called *plugin *libraries Plugin libraries are loaded by the *LibraryManager *see above The source file in which a module is implemented must be named< module > _plugin cc It must contain an invocation of the *DEFINE_EDM_PLUGIN *macro The *DEFINE_EDM_PLUGIN *macro is responsible for writing the appropriate *factory **function and that takes a const reference to a *ParameterSet *and that returns a newly created instance of the associated module type
still a headache We still need to provide the flexibility currently offered by the cfg file In if a user wants to have completely different destination we should not force upon her the default files as well This issue is highly relevant for unit and may be important in other situations too The appropriate defaults are in some instances defendant on the mode of running For batch reco or simulation jobs want reportEvery for FwkReport to be one
and eliminated if possible List of as opposed to merely propagated from Root file to Root file Parentage This tree contains one row per value of which means one row per distinct set of parents saved The branches and one additional branch
< separator(=)> SubRuns
an exception should be thrown only if an ambiguous lookup is attempted It is an error to register more than one *factory function *for any long form name
This add method has three it adds this message xid and id to the appropriate and it updates the dynamic information in counts The sequence is as the static apppropriate and timespan will be in the mapped CountAndLimit and there will be no need to recompute them If this xid is not yet in see if the category is in limits if the appropriate counts struct can be formed by using the precedence rules above to combine the limit and interval found in limits along with the severityLimits and severityIntervals arrays found in the ELlimitsTable Along the way the limits map for this category is filled in

Definition at line 111 of file ROOT_FILE_NOTES.txt.

and eliminated if possible List of trees

Definition at line 15 of file ROOT_FILE_NOTES.txt.