PostorderStrategy Class Reference

Inheritance diagram for PostorderStrategy:

Collaboration diagram for PostorderStrategy:

Public Member Functions
	PostorderStrategy ()
virtual PostorderStrategy *	clone () const
virtual IteratorMemento	first (const INode *p_root)
virtual void	next (IteratorMemento &iterator_stack) const
virtual bool	isDone (IteratorMemento &iterator_stack) const

Detailed Description

Traverse tree; visit children before their parents.

Definition at line 49 of file IterationStrategy.h.

Constructor & Destructor Documentation

PostorderStrategy()

PostorderStrategy::PostorderStrategy ( )

default

Referenced by clone().

Member Function Documentation

clone()

PostorderStrategy * PostorderStrategy::clone ( ) const

virtual

Implements IterationStrategy.

Definition at line 57 of file IterationStrategy.cpp.

{
    return new PostorderStrategy();
}

References PostorderStrategy().

Here is the call graph for this function:

first()

IteratorMemento PostorderStrategy::first ( const INode *  p_root )

virtual

Implements IterationStrategy.

Definition at line 62 of file IterationStrategy.cpp.

{
    IteratorMemento iterator_stack;
    iterator_stack.push_state(IteratorState(p_root));
    std::vector<const INode*> children = p_root->getChildren();
    while (children.size() > 0) {
        iterator_stack.push_state(IteratorState(children));
        children = iterator_stack.getCurrent()->getChildren();
    }
    return iterator_stack;
}

References INode::getChildren(), IteratorMemento::getCurrent(), and IteratorMemento::push_state().

Here is the call graph for this function:

next()

void PostorderStrategy::next ( IteratorMemento &  iterator_stack ) const

virtual

Implements IterationStrategy.

Definition at line 74 of file IterationStrategy.cpp.

{
    iterator_stack.next();
    if (iterator_stack.get_state().isEnd()) {
        iterator_stack.pop_state();
        return;
    }
    std::vector<const INode*> children = iterator_stack.getCurrent()->getChildren();
    while (children.size() > 0) {
        iterator_stack.push_state(IteratorState(children));
        children = iterator_stack.getCurrent()->getChildren();
    }
}

References IteratorMemento::get_state(), INode::getChildren(), IteratorMemento::getCurrent(), IteratorState::isEnd(), IteratorMemento::next(), IteratorMemento::pop_state(), and IteratorMemento::push_state().

Here is the call graph for this function:

isDone()

bool PostorderStrategy::isDone ( IteratorMemento &  iterator_stack ) const

virtual

Implements IterationStrategy.

Definition at line 88 of file IterationStrategy.cpp.

{
    return iterator_stack.empty();
}

References IteratorMemento::empty().

Here is the call graph for this function:

---

The documentation for this class was generated from the following files:

• /home/www/ba/Param/Node/IterationStrategy.h
• /home/www/ba/Param/Node/IterationStrategy.cpp