---

cmt_one_more Class Reference

Inheritance diagram for cmt_one_more

[legend]Collaboration diagram for cmt_one_more:

[legend]List of all members.

Public Methods
	cmt_one_more (cmt_node* n)
const cmt_regexp::iterator	match (const cmt_string& text, int pos) const

---

Constructor & Destructor Documentation

cmt_one_more::cmt_one_more ( cmt_node * n )

Definition at line 591 of file cmt_regexp.cxx. : cmt_many_node (n) { }

---

Member Function Documentation

const cmt_regexp::iterator cmt_one_more::match ( const cmt_string & text, int pos ) const [virtual]

Reimplemented from cmt_node. Definition at line 595 of file cmt_regexp.cxx. { if ((pos < 0) || (pos > text.size ())) { return (cmt_regexp::iterator::null ()); } int total = 0; // // we are at : x+y // int saved_pos = -1; int saved_total = -1; bool at_least_one = false; do { const cmt_regexp::iterator itx = _node->match (text, pos); const cmt_regexp::iterator ity = _follower.match (text, pos); if ((itx == cmt_regexp::iterator::null ()) && (ity == cmt_regexp::iterator::null ())) { // // There is neither x nor y. We move back to the last // succesful match for y. // if (saved_pos >= 0) { // // We had once a y. // pos = saved_pos; total = saved_total; } else { // // We never had any y ! // return (cmt_regexp::iterator::null ()); } break; } if (itx == cmt_regexp::iterator::null ()) { // // There is a y but no x anymore, fine, we can quit. // total += ity._length; pos += ity._length; break; } if (ity != cmt_regexp::iterator::null ()) { // // We have both x and y. We save the current pos and total, // and then skip this x. // saved_total = total + ity._length; saved_pos = pos + ity._length; } total += itx._length; pos += itx._length; at_least_one = true; } while (true); if (!at_least_one) return (cmt_regexp::iterator::null ()); return (cmt_regexp::iterator (pos, total)); }

---

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

• cmt_regexp.cxx

---