|
template<typename Predicate , typename Iterator , typename Sentinel > |
| lexy_ext::_filtered_node_range (Predicate &&pred, Iterator begin, Sentinel end) noexcept -> _filtered_node_range< std::decay_t< Predicate >, Iterator, Sentinel > |
|
template<typename Reader , typename TokenKind , typename MemoryResource , typename Predicate > |
auto | lexy_ext::child (const lexy::parse_tree< Reader, TokenKind, MemoryResource > &tree, typename lexy::parse_tree< Reader, TokenKind, MemoryResource >::node node, Predicate predicate) -> std::optional< typename lexy::parse_tree< Reader, TokenKind, MemoryResource >::node > |
| Returns the first child that matches predicate, if there is any. More...
|
|
template<typename Reader , typename TokenKind , typename MemoryResource , typename Predicate > |
auto | lexy_ext::children (const lexy::parse_tree< Reader, TokenKind, MemoryResource > &, typename lexy::parse_tree< Reader, TokenKind, MemoryResource >::node node, Predicate predicate) |
|
template<typename Reader , typename TokenKind , typename MemoryResource > |
auto | lexy_ext::find_covering_node (const lexy::parse_tree< Reader, TokenKind, MemoryResource > &tree, typename Reader::iterator position) -> typename lexy::parse_tree< Reader, TokenKind, MemoryResource >::node |
|
template<typename Reader , typename TokenKind , typename MemoryResource > |
auto | lexy_ext::node_position (const lexy::parse_tree< Reader, TokenKind, MemoryResource > &tree, typename lexy::parse_tree< Reader, TokenKind, MemoryResource >::node node) -> typename Reader::iterator |
|
template<typename Reader , typename TokenKind , typename MemoryResource > |
auto | lexy_ext::tokens (const lexy::parse_tree< Reader, TokenKind, MemoryResource > &tree) |
|
template<typename Reader , typename TokenKind , typename MemoryResource > |
auto | lexy_ext::tokens (const lexy::parse_tree< Reader, TokenKind, MemoryResource > &tree, typename lexy::parse_tree< Reader, TokenKind, MemoryResource >::node node) |
|