HAsciiFileList
class description - source file - inheritance tree (.pdf)
private:
void InsertFirstNode(HAsciiFileList::FileNode* newnode)
void InsertLastNode(HAsciiFileList::FileNode* newnode)
void InsertNode(HAsciiFileList::FileNode* newnode)
HAsciiFileList::FileNode* PreviousNode(HAsciiFileList::FileNode* refnode)
void RemoveFirstNode()
void RemoveLastNode()
void RemoveNode()
public:
HAsciiFileList()
HAsciiFileList(const HAsciiFileList& source)
virtual ~HAsciiFileList()
void AfterLastNode()
static TClass* Class()
void InsertFile()
virtual TClass* IsA() const
Int_t NodeNumber()
HAsciiFileList& operator=(const HAsciiFileList& source)
void RemoveFile()
void RestoreThisNode()
virtual void ShowMembers(TMemberInspector& insp, char* parent)
void StoreThisNode()
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
HAsciiFileList::FileNode* ThisNode()
HAsciiFile* ThisNodeFile()
void ToFirstNode()
void ToLastNode()
HAsciiFileList::FileNode* ToNextNode()
void ToNode(Int_t n)
HAsciiFile* ToNodeFile(const Char_t* name = "0")
private:
Int_t fLock - auxiliaty variable (see fpOpenNode remark)
HAsciiFileList::FileNode** fpTemp - auxiliary variable (see fpOpenNode remark)
HAsciiFileList::FileNode** fpOpenNode
HAsciiFileList::FileNode* fpFirstNode - first node in file list
HAsciiFileList::FileNode* fpLastNode - last node in file list
HAsciiFileList::FileNode* fpThisNode - current node in file list
HAsciiSectionRaw
Internal class used only in case of reading data in "raw" format.
It contains information of the structure of raw data like number
of columns, keys (keywords) names, as well as all the data banks.
***************************************************************************
HAsciiFileList() : fLock(0),fpFirstNode(NULL),
fpLastNode(NULL),fpThisNode(NULL)
Default constructor.
~HAsciiFileList()
Destructor. It deletes file list releasing memory allocated by them.
HAsciiFileList(const HAsciiFileList& source)
HAsciiFile* ThisNodeFile()
Returning file of current node (pointed by fpThisNode).
HAsciiFile* ToNodeFile(const Char_t* name)
It sets current list pointer fpThisNode to node with file of given name.
Int_t NodeNumber()
Number of nodes (files) in the list.
void ToFirstNode()
Current node set to the first.
void ToLastNode()
Current node set to the last node.
void AfterLastNode()
Current node set to NULL (it means after the last node).
void InsertFile()
It creates new node with place for file and puts into list at the position
of the current fpThisNode pointer.
void InsertFirstNode(FileNode* newnode)
It inserts node at the first position of the list.
void InsertNode(FileNode* newnode)
It inserts node into list somwhere in the place pointed by fpThisNode.
void InsertLastNode(FileNode* newnode)
It inserts node at the last list position.
void RemoveFile()
It removes file (it means node) from the list pointed by current pointer fpThisNode.
void RemoveFirstNode()
Removing first node in the list.
void RemoveLastNode()
Removing last node in the list.
void RemoveNode()
Removing node pointed by current list pointer fpThisNode.
void ToNode(Int_t n)
Setting current list pointer fpThisNode to node number n.
void StoreThisNode()
It stores in temporary stack the value of fpThisNode. Used if operations
on the list in nested loops are performed and the value od current pointer
needs to be conserved.
void RestoreThisNode()
It restores the last stored value of fpThisNode.
Inline Functions
HAsciiFileList::FileNode* PreviousNode(HAsciiFileList::FileNode* refnode)
HAsciiFileList& operator=(const HAsciiFileList& source)
HAsciiFileList::FileNode* ThisNode()
HAsciiFileList::FileNode* ToNextNode()
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
Author: Witold Przygoda (przygoda@psja1.if.uj.edu.pl)
Last update: 2001/08/20 by Witold Przygoda
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.