class Regexp::Expression::Base
Public Class Methods
# File lib/regexp_parser/expression/base.rb, line 5 def initialize(token, options = {}) init_from_token_and_options(token, options) end
Public Instance Methods
# File lib/regexp_parser/expression/methods/options.rb, line 25 def ascii_classes? options[:a] == true end
# File lib/regexp_parser/expression/methods/options.rb, line 8 def case_insensitive? options[:i] == true end
# File lib/regexp_parser/expression/methods/options.rb, line 20 def default_classes? options[:d] == true end
# File lib/regexp_parser/expression/methods/options.rb, line 14 def free_spacing? options[:x] == true end
# File lib/regexp_parser/expression/base.rb, line 47 def greedy? quantified? and quantifier.greedy? end
# File lib/regexp_parser/expression/methods/match.rb, line 8 def match(string, offset = 0) Regexp.new(to_s).match(string, offset) end
# File lib/regexp_parser/expression/methods/match.rb, line 3 def match?(string) !!match(string) end
# File lib/regexp_parser/expression/methods/options.rb, line 3 def multiline? options[:m] == true end
# File lib/regexp_parser/expression/base.rb, line 56 def possessive? quantified? and quantifier.possessive? end
# File lib/regexp_parser/expression/base.rb, line 17 def quantify(*args) self.quantifier = Quantifier.new(*args) end
Deprecated. Prefer ‘#repetitions` which has a more uniform interface.
# File lib/regexp_parser/expression/base.rb, line 26 def quantity return [nil,nil] unless quantified? [quantifier.min, quantifier.max] end
# File lib/regexp_parser/expression/base.rb, line 51 def reluctant? quantified? and quantifier.reluctant? end
# File lib/regexp_parser/expression/base.rb, line 31 def repetitions @repetitions ||= if quantified? min = quantifier.min max = quantifier.max < 0 ? Float::INFINITY : quantifier.max range = min..max # fix Range#minmax on old Rubies - https://bugs.ruby-lang.org/issues/15807 if RUBY_VERSION.to_f < 2.7 range.define_singleton_method(:minmax) { [min, max] } end range else 1..1 end end
%l Level (depth) of the expression. Returns ‘root’ for the root
expression, returns zero or higher for all others.
%> Indentation at expression’s level.
%x Index of the expression at its depth. Available when using
the sprintf_tree method only.
%s Start offset within the whole expression. %e End offset within the whole expression. %S Length of expression.
%o Coded offset and length, same as ‘@%s+%S’
%y Type of expression. %k Token of expression. %i ID, same as ‘%y:%k’ %c Class name
%q Quantifier
info, as {m} %Q Quantifier
text
%z Quantifier
min %Z Quantifier
max
%t Base
text of the expression (excludes quantifier, if any) %~t Full text if the expression is terminal, otherwise %i %T Full text of the expression (includes quantifier, if any)
%b Basic info, same as ‘%o %i’ %m Most info, same as ‘%b %q’ %a All info, same as ‘%m %t’
# File lib/regexp_parser/expression/methods/strfregexp.rb, line 37 def strfregexp(format = '%a', indent_offset = 0, index = nil) have_index = index ? true : false part = {} print_level = nesting_level > 0 ? nesting_level - 1 : nil # Order is important! Fields that use other fields in their # definition must appear before the fields they use. part_keys = %w[a m b o i l x s e S y k c q Q z Z t ~t T >] part.keys.each {|k| part[k] = "<?#{k}?>"} part['>'] = print_level ? (' ' * (print_level + indent_offset)) : '' part['l'] = print_level ? "#{'%d' % print_level}" : 'root' part['x'] = "#{'%d' % index}" if have_index part['s'] = starts_at part['S'] = full_length part['e'] = starts_at + full_length part['o'] = coded_offset part['k'] = token part['y'] = type part['i'] = '%y:%k' part['c'] = self.class.name if quantified? if quantifier.max == -1 part['q'] = "{#{quantifier.min}, or-more}" else part['q'] = "{#{quantifier.min}, #{quantifier.max}}" end part['Q'] = quantifier.text part['z'] = quantifier.min part['Z'] = quantifier.max else part['q'] = '{1}' part['Q'] = '' part['z'] = '1' part['Z'] = '1' end part['t'] = to_s(:base) part['~t'] = terminal? ? to_s : "#{type}:#{token}" part['T'] = to_s(:full) part['b'] = '%o %i' part['m'] = '%b %q' part['a'] = '%m %t' out = format.dup part_keys.each do |k| out.gsub!(/%#{k}/, part[k].to_s) end out end
# File lib/regexp_parser/expression/base.rb, line 60 def to_h { type: type, token: token, text: to_s(:base), starts_at: ts, length: full_length, level: level, set_level: set_level, conditional_level: conditional_level, options: options, quantifier: quantified? ? quantifier.to_h : nil, } end
# File lib/regexp_parser/expression/base.rb, line 9 def to_re(format = :full) if set_level > 0 warn "Calling #to_re on character set members is deprecated - "\ "their behavior might not be equivalent outside of the set." end ::Regexp.new(to_s(format)) end
# File lib/regexp_parser/expression/methods/options.rb, line 30 def unicode_classes? options[:u] == true end
# File lib/regexp_parser/expression/base.rb, line 21 def unquantified_clone clone.tap { |exp| exp.quantifier = nil } end