entries_iterator_rep< C, T, V > Class Template Reference

#include <table.hpp>

List of all members.

Public Member Functions

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

Protected Member Functions

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

---

Detailed Description

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

Definition at line 346 of file table.hpp.

---

Constructor & Destructor Documentation

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

Definition at line 352 of file table.hpp.

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

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

entries_iterator_rep

(

const table< C, T, V > &

t2

)

[inline]

Definition at line 367 of file table.hpp.

References entries_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 362 of file table.hpp.

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

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

iterator_rep<T>* clone

(

)

[inline, protected]

Definition at line 364 of file table.hpp.

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

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

T current

(

)

[inline, protected]

Definition at line 363 of file table.hpp.

References mmx::read_car().

{ return read_car (l).x1; }

bool is_busy

(

)

[inline, protected]

Definition at line 361 of file table.hpp.

{ return i<t->n; }

void spool

(

)

[inline, protected]

Definition at line 354 of file table.hpp.

References mmx::is_nil().

Referenced by entries_iterator_rep< C, T, V >::advance(), and entries_iterator_rep< C, T, V >::entries_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:

• /Users/mourrain/Devel/mmx/basix/include/basix/table.hpp