#include <table.hpp>

Public Member Functions

table_iterator_rep (const table< C, T, V > &t2)

Protected Member Functions

table_iterator_rep (const table< C, T, V > &t2, nat i2, const list< pair< T, C > > &l2)
void spool ()
bool is_busy ()
void advance ()
pair< T, C > current ()
iterator_rep< pair< T, C > > * clone ()

Detailed Description

template<typename C, typename T, typename V = exact_eq_table>
class mmx::table_iterator_rep< C, T, V >

Definition at line 377 of file table.hpp.

Constructor & Destructor Documentation

table_iterator_rep	(	const table< C, T, V > &	t2,
		nat	i2,
		const list< pair< T, C > > &	l2
	)		`[inline, protected]`

Definition at line 383 of file table.hpp.

Referenced by table_iterator_rep< C, T, V >::clone().

                                                                          :
    iterator_rep<pair<T,C> > (format<pair<T,C> > (CF1 (t2), CF2 (t2))),
    t(t2), i(i2), l(l2) {}

table_iterator_rep ( const table< C, T, V > & t2 ) [inline]

Definition at line 400 of file table.hpp.

References table_iterator_rep< C, T, V >::spool().

                                      :
    t(t2), i(0), l(t->a[0]) { spool (); }

Member Function Documentation

void advance ( ) [inline, protected]

Definition at line 394 of file table.hpp.

References mmx::read_cdr(), and table_iterator_rep< C, T, V >::spool().

{ l= read_cdr (l); spool (); }

iterator_rep<pair<T,C> >* clone ( ) [inline, protected]

Definition at line 396 of file table.hpp.

References table_iterator_rep< C, T, V >::table_iterator_rep().

                                     {
    return new table_iterator_rep (t, i, l); }

pair<T,C> current ( ) [inline, protected]

Definition at line 395 of file table.hpp.

References mmx::read_car().

{ return read_car (l); }

bool is_busy ( ) [inline, protected]

Definition at line 393 of file table.hpp.

{ return i<t->n; }

void spool ( ) [inline, protected]

Definition at line 386 of file table.hpp.

References mmx::is_nil().

Referenced by table_iterator_rep< C, T, V >::advance(), and table_iterator_rep< C, T, V >::table_iterator_rep().

                {
    while (is_nil (l)) {
      i++;
      if (i >= t->n) break;
      l= t->a[i];
    }
  }

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