| #include "KanReferenceStrategy.hh" |
KanReferenceStrategy
class description - source file - inheritance tree (.pdf)
This is an abstract class, constructors will not be documented.
Look at the header to check for available constructors.
private:
KanReferenceStrategy& operator=(const KanReferenceStrategy&)
protected:
virtual Bool_t fillSelfPointers(KanEventReader& eR)
virtual Bool_t fillSelfReadRefs(KanEventReader& eR)
virtual Bool_t fillSelfWriteRefs(KanEventWriter& eW)
virtual Bool_t flushSelf(KanEventReader& eR)
virtual void resetSelf(Dna::Scope scope = Dna::Event)
virtual Bool_t syncSelf(KanEventWriter& eW)
public:
virtual ~KanReferenceStrategy()
virtual KanID ID(UInt_t i = 0) const
virtual void print(ostream& os = std::cout) const
KanPersistable::Status_t& refStatus() const
virtual void resetID()
virtual void resize(UInt_t n)
virtual void setID(KanID id, UInt_t i = 0)
virtual UInt_t size() const
Class KanReferenceStrategy:
The base class for persistent representations of references
to KanPersistables.
~KanReferenceStrategy()
d'tor
void print(ostream& os) const
Standard print method
Format is
t1:b1:o1 t2:b2:o2 ... tN:bN:oN
Bool_t syncSelf(KanEventWriter& eW)
Hook to set persistent data
void resetSelf(Dna::Scope scope)
Hook to reset own data
Bool_t flushSelf(KanEventReader& eR)
Hook to set own transient data
Inline Functions
void resetID()
void setID(KanID id, UInt_t i = 0)
KanID ID(UInt_t i = 0) const
UInt_t size() const
void resize(UInt_t n)
KanPersistable::Status_t& refStatus() const
Bool_t fillSelfReadRefs(KanEventReader& eR)
Bool_t fillSelfWriteRefs(KanEventWriter& eW)
Bool_t fillSelfPointers(KanEventReader& eR)
KanReferenceStrategy& operator=(const KanReferenceStrategy&)
Author: E. Charles
Last update: KanReferenceStrategy.cc,v 1.6 2004/08/06 06:12:59 bartoldu Exp $
Copyright (C) 2002 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.
|
