#include <xtl_op_impl.h>
Inheritance diagram for xtl_opunarstar:


ExprT
Definition at line 340 of file xtl_op_impl.h.
Public Member Functions | |
| xtl_opunarstar (ExprT const &expr_, size_t upper_limit_=0) | |
| Constructs and initializes the object. | |
| template<typename UniverseT> | |
| size_t | match (UniverseT &edge_) |
| Implements grammar evaluation method for Kleene star match algorithm, starting at the upper boundary of the parseable universe. | |
| template<typename UniverseT> | |
| size_t | find (UniverseT &edge_) |
| Implements grammar evaluation method for Kleene star search algorithm, starting at the upper boundary of the parseable universe. | |
| template<typename UniverseT> | |
| size_t | bang_find (UniverseT &edge_) |
| Implements grammar evaluation method for Kleene star repeatable search algorithm, starting at the upper boundary of the parseable universe. | |
Protected Attributes | |
| size_t | m_upper_limit |
| Stores upper limit for the number of matches. | |
|
||||||||||||
|
Constructs and initializes the object.
Definition at line 359 of file xtl_op_impl.h. |
|
|
Implements grammar evaluation method for Kleene star repeatable search algorithm, starting at the upper boundary of the parseable universe.
Definition at line 548 of file xtl_op_impl.h. |
|
|
Implements grammar evaluation method for Kleene star search algorithm, starting at the upper boundary of the parseable universe.
Definition at line 469 of file xtl_op_impl.h. |
|
|
Implements grammar evaluation method for Kleene star match algorithm, starting at the upper boundary of the parseable universe.
Definition at line 391 of file xtl_op_impl.h. |
1.3.9.1