#include <xtl_primary.h>
Inheritance diagram for xtl_primary:
template< typename UniverseT > size_t internal_match( UniverseT& edge_ ); template< typename UniverseT > size_t internal_find( UniverseT& edge_ );
internal_match()
, or internal_find()
succeed, they should: // 1. Set ending position of the matched symbol: edge_.first.offset( end_offset ); // 2. Return starting position of the matched symbol: return begin_offset;
Definition at line 109 of file xtl_primary.h.
Public Member Functions | |
template<typename UniverseT> | |
size_t | match (UniverseT &edge_) |
Implements grammar evaluation method for symbol match algorithm, starting at the upper boundary of the parseable universe. | |
template<typename UniverseT> | |
size_t | find (UniverseT &edge_) |
Implements grammar evaluation method for symbol 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 repeatable search algorithm, starting at the upper boundary of the parseable universe. | |
Protected Member Functions | |
int | primary_length (size_t upper_offset_, size_t lower_offset_) const |
Calculates length of the matched symbol. |
|
Implements grammar evaluation method for repeatable search algorithm, starting at the upper boundary of the parseable universe.
Reimplemented in xtl_char_symbol. Definition at line 321 of file xtl_primary.h. |
|
Implements grammar evaluation method for symbol search algorithm, starting at the upper boundary of the parseable universe.
Reimplemented in xtl_char_symbol. Definition at line 219 of file xtl_primary.h. |
|
Implements grammar evaluation method for symbol match algorithm, starting at the upper boundary of the parseable universe.
Reimplemented in xtl_iswhat_end, xtl_iswwhat_end, xtl_text_end, and xtl_text_ref_end. Definition at line 136 of file xtl_primary.h. |
|
Calculates length of the matched symbol.
Definition at line 339 of file xtl_primary.h. |