PreorderStrategy Class Reference

Inheritance diagram for PreorderStrategy:

Collaboration diagram for PreorderStrategy:

Public Member Functions
	PreorderStrategy ()
virtual PreorderStrategy *	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 parents before their children.

Definition at line 36 of file IterationStrategy.h.

Constructor & Destructor Documentation

PreorderStrategy()

PreorderStrategy::PreorderStrategy ( )

default

Referenced by clone().

Member Function Documentation

clone()

PreorderStrategy * PreorderStrategy::clone ( ) const

virtual

Implements IterationStrategy.

Definition at line 21 of file IterationStrategy.cpp.

{
    return new PreorderStrategy();
}

References PreorderStrategy().

Here is the call graph for this function:

first()

IteratorMemento PreorderStrategy::first ( const INode *  p_root )

virtual

Implements IterationStrategy.

Definition at line 26 of file IterationStrategy.cpp.

{
    IteratorMemento iterator_stack;
    iterator_stack.push_state(IteratorState(p_root));
    return iterator_stack;
}

References IteratorMemento::push_state().

Here is the call graph for this function:

next()

void PreorderStrategy::next ( IteratorMemento &  iterator_stack ) const

virtual

Implements IterationStrategy.

Definition at line 33 of file IterationStrategy.cpp.

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

References ASSERT, IteratorMemento::empty(), 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 PreorderStrategy::isDone ( IteratorMemento &  iterator_stack ) const

virtual

Implements IterationStrategy.

Definition at line 50 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