class DataLoopNameListNode

This is a list of lists of names in a loop. The first list of names is the list of names for the outermost loop. the second list of names is the list of names for the next nesting level in, and so on.

Inheritance:

Public Methods
Public Members
class const_iterator: This is supposed to behave like the iterator class in an STL vector.
class iterator: This is supposed to behave like the iterator class in an STL vector.

Inherited from ASTnode:

Public Methods
bool NotVirtualIsOfType( ASTtype T )
virtual void copyFrom( const ASTnode &copyFromMe )
virtual ASTnode* myParent(void)
virtual bool removeChild( ASTnode* child )
virtual bool removeMe( void )
virtual void setParent( ASTnode* p )
virtual bool unlinkMe( void )

Public Members
enum ASTtype

Protected Methods
void printIndent(int indent)

Inherited from ASTnodeWithPosBits:

Documentation

This is a list of lists of names in a loop. The first list of names is the list of names for the outermost loop. the second list of names is the list of names for the next nesting level in, and so on.

enum Status ERROR STOP NEW_ITER SAME_ITER

virtual ~DataLoopNameListNode()

Destructor - recursively destroys the whole list of names

void debugPrint( void )

Print out debugging info detailing the layout of this list:

typedef LoopNameListNode *value_type typedef value_type* pointer typedef const value_type* const_pointer typedef value_type& reference typedef const value_type& const_reference typedef size_t size_type typedef size_t difference_type DataLoopNameListNode( DataLoopDefListNode &L) Copy constructor with a deep recursive copy DataLoopNameListNode( bool link, DataLoopDefListNode &L) Parallel copy constructor: DataLoopNameListNode(const DataLoopDefListNode& D) Also a Copy Constructor DataLoopNameListNode(ASTlist<LoopDefListNode* >* L) DataLoopNameListNode() Create an empty list of lists of names

iterator begin()

iterator end()

const_iterator begin() const

const_iterator end() const

size_type size() const

bool empty() const

reference operator[]( size_type n )

const_reference operator[]( size_type n) const

reference front()

const_reference back() const

const_reference front() const

reference back()

Insertions/Deletions.

Insertions/Deletions. Inserting new loop levels' names, and deleting a level of loop names.

Insert - Insert before 'pos', the row of tagnames given by 'v'. Note that what this means is that you are inserting a new nesting level to the loop. If this is already inside a DataLoopNode, then you are only allowed to add new nesting levels at the deepest level, i.e. 'pos' must == 'end()' or it will refuse to do it and return false. This is because if you inserted a new nesting level in the middle, then values that are at the levels deeper than that are no longer associated with the higher-level row that they are supposed to "hang" off from.

If this DataLoopNameListNode is not inside a DataLoopNode, then you can insert and remove nesting levels at will.

the passed vector itself (in other words, you can delete it after calling (and the DataNameNodes it points to).

bool insert( iterator pos, LoopNameListNode &v )

Insert - Insert before 'pos', the LoopNameListNode given.

(This function performs a DEEP copy of the given name def list so everything in the passed argument can be deleted after calling, if it is appropriate.)

bool insert( iterator pos, LoopNameListNode* v )

Make a link to the node given (NOT A COPY - don't delete the node pointer that was passed)

void erase( iterator pos )

erase - Remove the row of tagnames given. If this is inside a DataLoopNode, then calling this method also removes all the values from the body of the loop that were associated with these names.

In order to keep the STAR syntax correct, deleting a row of names also results in all tagnames for levels nested AFTER that row being deleted also. (If there are three nested levels in a loop and you delete the middle level, then the inner level goes away too.)

That is why there is no erase() method for erasing a range of rows of names. There would be no point, seeing as how once one is deleted, the rest under it have to be deleted too.

virtual void Unparse(int indent)

virtual ASTnode::ASTtype myType(void)

virtual bool isOfType( ASTtype T )

StarFileNode::Status AddDataName(const string & name)