A DataLoopNode is a list of tagnames and a list of values for those names
![]() | myDefList This is private, but doc++ doesn't realize that. |
![]() | myValList This is private, but doc++ doesn't realize that. |
![]() | AddDataName (const string & name) DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | AddDataValue ( const string & value, DataValueNode::ValType type ) DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | ChangeName (const string &oldName, const string &newName ) Find the old tag name in the loop and change it to the new name. |
![]() | FlattenNestedLoop ( List<DataNameNode*>* &L, List<DataValueNode*>* &M) DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | getMaxDepth ( void ) Get the deepest depth of nesting of the entire loop |
![]() | isOfType ( ASTtype T ) |
![]() | myLongestStr ( void ) const Returns the length of the longest string in this object |
![]() | myName () const Return the name of the loop (arbitrarily chosen to be the name of the first tag in the loop's names |
![]() | myType (void) |
![]() | NotVirtualIsOfType ( ASTtype T ) |
![]() | RemoveColumn ( const string name ) DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | reset () DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | returnLoopValues (const string & tagName) DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | returnNextLoopElement (DataValueNode* & v) DEPRECIATED - instead use the STL vector-like methods outlined in the documentation for DataLoopNameListNode and LoopTableNode |
![]() | searchByTag ( string &searchFor ) Given a tag name, find the AST object it resides in |
![]() | searchByTagValue ( string &tag, string &value ) Given a tag name and a value, find the AST object that that particular tag and value pair resides in |
![]() | searchForType ( ASTtype type, int delim = -1 ) This method returns a list of all the nodes of the given type that are inside this node, or children of this node, or children of children of this node, etc all the way down to the leaf nodes |
![]() | tagPositionDeep ( string tagName, int *nestLevel, int *column ) Get the integer indexes that tell where the given tagname is located |
![]() | transform (DataLoopValListNode *l) |
![]() | unlinkChild ( ASTnode *child ) unlinks the given ASTnode from this ASTnode, assuming that the given ASTnode is a child of this ASTnode |
![]() | Unparse (int indent) |
![]() | Unparse (int indent, int ) |
![]() | ~DataLoopNode () Destructor: |
![]() |
| ||||||||||
![]() | level where it was found. | ||||||||||
![]() |
| ||||||||||
![]() |
| ||||||||||
![]() |
| ||||||||||
![]() |
| ||||||||||
![]() |
|
A DataLoopNode is a list of tagnames and a list of values for those names. It corresponds to a 'loop' in a STAR file.
DataLoopNode(const string &tflag)
DataLoopNode( DataLoopNode& D)
DataLoopNode( bool link, DataLoopNode& D)
This search is case-insensitive. The names of things, according
to the STAR specification, are supposed to be case-insensitive.
This is being applied not only to tag names but also to
saveframe names and datablock names.
WARNING: The list returned is allocated in heap space. It is
the caller's responsibility to delete the list after it is no
longer needed.
This search is case-insensitive. The names of things, according
to the STAR specification, are supposed to be case-insensitive.
This is being applied not only to tag names but also to
saveframe names and datablock names.
(However, the values are case-sensitive. A search for a
tag of _t1 is identical to a search for a tag of _T1,
but a search for a value of "V1" is different from a search for
a value of "v1".)
WARNING: The list returned is allocated in heap space. It is
the caller's responsibility to delete the list after it is no
longer needed.
void setIndentFlag( bool flg )
bool getIndentFlag( void ) const
void setRowsPerLine( int setTo )
bool getRowsPerLine( void ) const
loop_
_foo
_bar
fooval1 barval1 fooval2 barval2 fooval3 barval3
fooval4 barval4 fooval5 barval5 fooval6 barval6
stop_
void setTabFlag( bool setTo )
bool getTabFlag( void )
virtual ASTnode::ASTtype myType(void)
virtual bool isOfType( ASTtype T )
bool NotVirtualIsOfType( ASTtype T )
virtual string myName() const
void FlattenNestedLoop( List<DataNameNode*>* &L, List<DataValueNode*>* &M)
DataLoopValListNode::Status returnNextLoopElement(DataValueNode* & v)
virtual ASTlist <DataValueNode *> * returnLoopValues(const string & tagName)
void reset()
virtual void Unparse(int indent)
virtual void Unparse(int indent, int )
void tagPositionDeep( string tagName, int *nestLevel, int *column )
StarFileNode::Status RemoveColumn( const string name )
StarFileNode::Status AddDataName(const string & name)
StarFileNode::Status AddDataValue( const string & value, DataValueNode::ValType type )
StarFileNode::Status ChangeName(const string &oldName, const string &newName )
LoopTableNode& getVals( void )
LoopTableNode* getValsPtr( void )
DataLoopNameListNode& getNames( void )
DataLoopNameListNode* getNamesPtr( void )
virtual List <ASTnode*> * searchByTag( string &searchFor )
virtual List <ASTnode*> * searchByTagValue( string &tag, string &value )
value - ...where it has this value. virtual List <ASTnode*> * searchForType( ASTtype type, int delim = -1 )
delim - the delimiter type if searching for a DataValueNode. The
default if it is left off is "dont-care". virtual bool unlinkChild( ASTnode *child )
private : StarFileNode::Status transform(DataLoopValListNode *l)
DataLoopNameListNode* myDefList
LoopTableNode myValList
virtual int myLongestStr( void ) const
virtual int getMaxDepth( void )
alphabetic index hierarchy of classes
generated by doc++