Tree_LRP< E > Class Template Reference

Left-Right-Process iterator. More...

#include <Tree_LRP.h>

Public Member Functions
void	set (const TL::Tree< E > &T)
	Iterator::set(). More...
bool	hasNext () const
	Iterator::hasNext(). More...
const TL::Tree< E >	next ()
	Iterator::next(). More...

Public Attributes
	__pad0__: m_Q() { set(T)
	init(). More...

Private Attributes
std::list< TL::Tree< E > >	m_Q
	std::queue<>. More...

Detailed Description

template<typename E>
class Tree_LRP< E >

Left-Right-Process iterator.

    {{  // test::Tree_LRP()
        TL::Tree<char> T;     make_a_o(T);
        Tree_LRP<char> iter;  std::string L;
        iter.set(T);
        while ( iter.hasNext()  ) {
            TL::Tree<char> S = iter.next();
            L.push_back( *S );
        }
        assertTrue( L == "fghbcdilnomjkea"  && "Tree_LRP" );
    }}

See Also

test_iterJava::test_Tree_LRP()

make_a_o(TL::Tree<char> & T)

                 T = a

Definition at line 59 of file Tree_LRP.h.

Member Function Documentation

template<typename E >

void Tree_LRP< E >::set

(

const TL::Tree< E > &

T

)

Iterator::set().

Definition at line 72 of file Tree_LRP.h.

template<typename E >

bool Tree_LRP< E >::hasNext

(

)

const

Iterator::hasNext().

Definition at line 104 of file Tree_LRP.h.

template<typename E >

const TL::Tree< E > Tree_LRP< E >::next

(

)

Iterator::next().

Definition at line 110 of file Tree_LRP.h.

Member Data Documentation

template<typename E>

std::list< TL::Tree<E> > Tree_LRP< E >::m_Q

private

std::queue<>.

Definition at line 60 of file Tree_LRP.h.

template<typename E>

Tree_LRP< E >::__pad0__

init().

Definition at line 64 of file Tree_LRP.h.

---

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

• Tree_LRP.h