? ? ? ? ? ?

---

cmt_and_node Class Reference

Inheritance diagram for cmt_and_node:

[legend] Collaboration diagram for cmt_and_node:

[legend] List of all members.

Public Methods
?	cmt_and_node ()
?	cmt_and_node (cmt_regexp_node_set *father)
const cmt_regexp::iterator?	match (const cmt_string &text, int pos) const
void?	reduce ()
void?	fill (cmt_and_node &other, int start_index)

---

Constructor & Destructor Documentation

cmt_and_node::cmt_and_node (? ? )?

?	Definition at line 784 of file cmt_regexp.cxx. : cmt_regexp_node_set () { }

cmt_and_node::cmt_and_node (? cmt_regexp_node_set *? ? father )?

?	Definition at line 788 of file cmt_regexp.cxx. : cmt_regexp_node_set (father) { }

---

Member Function Documentation

void cmt_and_node::fill (? cmt_and_node &? ? other, int? ? start_index )?

?

Definition at line 893 of file cmt_regexp.cxx. References cmt_regexp_node_set::_nodes, cmt_regexp_node_set::nodes(), and cmt_regexp_node_set::push(). Referenced by cmt_many_node::install(). { if ((start_index < 0) || (start_index > other.nodes ())) return; for (int i = start_index; i < other.nodes (); i++) { cmt_regexp_node* n = other._nodes[i]; push (n); } }

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

?

Reimplemented from cmt_regexp_node. Definition at line 792 of file cmt_regexp.cxx. References cmt_regexp::iterator::_length, cmt_regexp_node_set::_nodes, cmt_regexp_node::match(), cmt_regexp::iterator::null(), cmt_vector< cmt_regexp_node * >::size(), and cmt_string::size(). Referenced by cmt_one_more::match(), and cmt_zero_more::match(). { if ((pos < 0) || (pos > text.size ())) { return (cmt_regexp::iterator::null ()); } if (_nodes.size () == 0) return (cmt_regexp::iterator (pos, 0)); int i; int total = 0; int p = pos; for (i = 0; i < _nodes.size (); i++) { cmt_regexp_node* n = _nodes[i]; const cmt_regexp::iterator it = n->match (text, p); if (it == cmt_regexp::iterator::null ()) return (it); total += it._length; p += it._length; } // All nodes match return (cmt_regexp::iterator (pos, total)); }

void cmt_and_node::reduce (? ? )? [virtual]

?

Reimplemented from cmt_regexp_node_set. Definition at line 823 of file cmt_regexp.cxx. References cmt_regexp_node_set::_nodes, cmt_many_node::install(), cmt_regexp_node::is_char(), cmt_regexp_node::is_many_node(), cmt_vector< T >::push_back(), cmt_many_node::reduce(), cmt_string::size(), and cmt_vector< cmt_regexp_node * >::size(). Referenced by cmt_many_node::reduce(). { if (_nodes.size () < 2) return; char c = ' '; cmt_string s = ""; cmt_vector new_nodes; // // We loop once too much in order to finish the possibly accumulated // string at the end. // for (int i = 0; i <= _nodes.size (); i++) { cmt_regexp_node* n = 0; if (i < _nodes.size ()) n = _nodes[i]; if ((i >= _nodes.size ()) || (!n->is_char ())) { if (s.size () == 1) { // // Too bad there was only one char node to consider // let's put it back as a char node ! // new_nodes.push_back (new cmt_char_node (c)); s = ""; } else if (s.size () > 1) { // // We have real reduction here sonce there was several // consecutive char nodes. // new_nodes.push_back (new cmt_string_node (s)); s = ""; } if (i >= _nodes.size ()) break; } if (n->is_char ()) { // // We are now trying to compact those char nodes. // cmt_char_node& cn = *((cmt_char_node*) n); c = (char) cn; s += c; delete n; _nodes[i] = 0; } else if (n->is_many_node ()) { cmt_many_node& mn = *((cmt_many_node*) n); mn.install (*this, i + 1); mn.reduce (); new_nodes.push_back (n); break; } else { new_nodes.push_back (n); } } _nodes = new_nodes; }

---

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

• cmt_regexp.cxx

---