SLAC PEP-II
BABAR
SLAC<->RAL
Babar logo
HEPIC E,S & H Databases PDG HEP preprints
Organization Detector Computing Physics Documentation
Personnel Glossary Sitemap Search Hypernews
Unwrap page!
Comp. Search
Who's who?
Meetings
FAQ Homepage
Archive
Environment
Administration
New User Info.
Web Info/Tools
Monitoring
Training
Tools & Utils
Programming
C++ Standard
SRT, AFS, CVS
QA and QC
Remedy
Histogramming
Operations
PromptReco
Simulation Production
Online SW
Dataflow
Detector Control
Evt Processing
Run Control
Calibration
Databases
Offline
Workbook
Coding Standards
Simulation
Reconstruction
Prompt Reco.
BaBar Grid
Data Distribution
Beta & BetaTools
Kanga & Root
Analysis Tools
RooFit Toolkit
Data Management
Data Quality
Event display
Event Browser
Code releases
Databases
Check this page for HTML 4.01 Transitional compliance with the
W3C Validator
(More checks...)
#include "EmcBumpI.hh"

EmcBumpI


class description - source file - inheritance tree (.pdf)

class EmcBumpI : public KanObj, public KanClassI

Inheritance Chart:
TObject
KanPersistable
KanPersistentRefOwner
<-
KanObj
KanClassI
<-
EmcBumpI
<-
EmcMiniBumpK
EmcMiniMultiBumpK
EmcMiniSingleBumpK
 
    This is an abstract class, constructors will not be documented.
    Look at the header to check for available constructors.

    private:
EmcBumpI& operator=(const EmcBumpI&) protected:
virtual EmcBump* buildTransient(KanEventReader& eR) virtual void loadFrom(const EmcBump*, KanEventWriter& eW) virtual KanTransCache& transCache() const public:
virtual ~EmcBumpI() EmcBump* access() virtual const EmcClusterI* cluster() const virtual Int_t compare(const EmcBumpI& other, UInt_t recurse = 0, Bool_t verbose = kTRUE) virtual const char* iClassName() const virtual UInt_t nDigis() const virtual UInt_t nSharedDigis() const virtual UInt_t nUnSharedDigis() const void set(EmcBump* setTo) virtual const EmcDigiI* sharedDigi(UInt_t i) const EmcBump* transient(KanEventReader& eR) virtual const EmcDigiI* unSharedDigi(UInt_t i) const virtual Double_t weight(UInt_t i) const

Data Members

    private:
KanTransCache_I<EmcBumpI> _cache !

Class Description

	This is the interface for persistent DchHits.EmcBumps.

      This interface requires the following functions:

        UInt_t nDigis() const                        // Total number of digis
        UInt_t nSharedDigis() const                  // Number of digis shared with other bumps
        const EmcDigiI* sharedDigi(UInt_t i) const   // Return a shared digi by index
        Double_t weight(UInt_t i) const              // Return a shared digi weight by index
        UInt_t nUnSharedDigis() const                // Number of unshared digis
        const EmcDigiI* unSharedDigi(UInt_t i) const // Return an unshared digi by index
        const EmcClusterI* cluster() const           // The cluster this bump is part of


~EmcBumpI()



Inline Functions


               const char* iClassName() const
                    UInt_t nDigis() const
                    UInt_t nSharedDigis() const
           const EmcDigiI* sharedDigi(UInt_t i) const
                  Double_t weight(UInt_t i) const
                    UInt_t nUnSharedDigis() const
           const EmcDigiI* unSharedDigi(UInt_t i) const
        const EmcClusterI* cluster() const
                 EmcBumpI& operator=(const EmcBumpI&)
                  EmcBump* transient(KanEventReader& eR)
                      void set(EmcBump* setTo)
                  EmcBump* access()
                     Int_t compare(const EmcBumpI& other, UInt_t recurse = 0, Bool_t verbose = kTRUE)
                  EmcBump* buildTransient(KanEventReader& eR)
                      void loadFrom(const EmcBump*, KanEventWriter& eW)
            KanTransCache& transCache() const


Author: E. Charles
Last update: EmcBumpI.cc,v 1.2 2004/01/13 18:57:09 echarles Exp $
Copyright (C) 2003 LBNL


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.