class Regexp::Expression::Subexpression
def <<(exp)
def <<(exp) if exp.is_a?(WhiteSpace) && last && last.is_a?(WhiteSpace) last.merge(exp) else exp.nesting_level = nesting_level + 1 expressions << exp end end
def dig(*indices)
def dig(*indices) exp = self indices.each { |idx| exp = exp.nil? || exp.terminal? ? nil : exp[idx] } exp end
def each_expression(include_self = false)
Iterates over the expressions of this expression as an array, passing
def each_expression(include_self = false) return enum_for(__method__, include_self) unless block_given? traverse(include_self) do |event, exp, index| yield(exp, index) unless event == :exit end end
def flat_map(include_self = false)
for every expression. If a block is not given, returns an array with
Returns a new array with the results of calling the given block once
def flat_map(include_self = false) result = [] each_expression(include_self) do |exp, index| if block_given? result << yield(exp, index) else result << [exp, index] end end result end
def initialize(token, options = {})
def initialize(token, options = {}) self.expressions = [] super end
def initialize_copy(orig)
def initialize_copy(orig) self.expressions = orig.expressions.map(&:clone) super end
def inner_match_length
def inner_match_length dummy = Regexp::Expression::Root.construct dummy.expressions = expressions.map(&:clone) dummy.quantifier = quantifier && quantifier.clone dummy.match_length end
def intersperse(expressions, separator)
def intersperse(expressions, separator) expressions.flat_map { |exp| [exp, separator] }.slice(0...-1) end
def match_length
def match_length MatchLength.new(self, base_min: map { |exp| exp.match_length.min }.inject(0, :+), base_max: map { |exp| exp.match_length.max }.inject(0, :+), reify: ->{ map { |exp| exp.match_length.to_re }.join }) end
def parts
def parts expressions end
def strfregexp_tree(format = '%a', include_self = true, separator = "\n")
def strfregexp_tree(format = '%a', include_self = true, separator = "\n") output = include_self ? [self.strfregexp(format)] : [] output += flat_map do |exp, index| exp.strfregexp(format, (include_self ? 1 : 0), index) end output.join(separator) end
def te
def te ts + to_s.length end
def to_h
def to_h attributes.merge( text: to_s(:base), expressions: expressions.map(&:to_h) ) end
def traverse(include_self = false, &block)
- For terminal expressions, :visit is called once.
:exit upon exiting it.
- For subexpressions, :enter upon entering the subexpression, and
The event argument is passed as follows:
the expression, and the index of the expression within its parent.
block for each expression with three arguments; the traversal event,
Traverses the subexpression (depth-first, pre-order) and calls the given
def traverse(include_self = false, &block) return enum_for(__method__, include_self) unless block_given? block.call(:enter, self, 0) if include_self each_with_index do |exp, index| if exp.terminal? block.call(:visit, exp, index) else block.call(:enter, exp, index) exp.traverse(&block) block.call(:exit, exp, index) end end block.call(:exit, self, 0) if include_self self end