class Prism::InterpolatedRegularExpressionNode
Represents a regular expression literal that contains interpolation.
/foo #{bar} baz/ ^^^^^^^^^^^^^^^^
Attributes
protected attr_reader flags: Integer
attr_reader parts: Array[StringNode | EmbeddedStatementsNode
| EmbeddedVariableNode]
Public Class Methods
def initialize: (Integer flags, Location
opening_loc
, Array[StringNode | EmbeddedStatementsNode
| EmbeddedVariableNode] parts, Location
closing_loc
, Location
location) -> void
# File prism/node.rb, line 10805 def initialize(source, flags, opening_loc, parts, closing_loc, location) @source = source @location = location @flags = flags @opening_loc = opening_loc @parts = parts @closing_loc = closing_loc end
Similar to type
, this method returns a symbol that you can use for splitting on the type of the node without having to do a long === chain. Note that like type
, it will still be slower than using == for a single class, but should be faster in a case statement or an array comparison.
def self.type: () -> Symbol
# File prism/node.rb, line 10962 def self.type :interpolated_regular_expression_node end
Public Instance Methods
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
# File prism/node.rb, line 10968 def ===(other) other.is_a?(InterpolatedRegularExpressionNode) && (flags === other.flags) && (opening_loc.nil? == other.opening_loc.nil?) && (parts.length == other.parts.length) && parts.zip(other.parts).all? { |left, right| left === right } && (closing_loc.nil? == other.closing_loc.nil?) end
def accept: (Visitor
visitor) -> void
# File prism/node.rb, line 10815 def accept(visitor) visitor.visit_interpolated_regular_expression_node(self) end
def ascii_8bit?: () -> bool
# File prism/node.rb, line 10894 def ascii_8bit? flags.anybits?(RegularExpressionFlags::ASCII_8BIT) end
def child_nodes
: () -> Array[nil | Node]
# File prism/node.rb, line 10820 def child_nodes [*parts] end
def closing: () -> String
# File prism/node.rb, line 10929 def closing closing_loc.slice end
attr_reader closing_loc
: Location
# File prism/node.rb, line 10862 def closing_loc location = @closing_loc return location if location.is_a?(Location) @closing_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end
def comment_targets
: () -> Array[Node | Location]
# File prism/node.rb, line 10830 def comment_targets [opening_loc, *parts, closing_loc] #: Array[Prism::node | Location] end
def compact_child_nodes
: () -> Array
# File prism/node.rb, line 10825 def compact_child_nodes [*parts] end
def copy: (?flags: Integer, ?opening_loc: Location
, ?parts: Array[StringNode | EmbeddedStatementsNode
| EmbeddedVariableNode], ?closing_loc: Location
, ?location: Location
) -> InterpolatedRegularExpressionNode
# File prism/node.rb, line 10835 def copy(flags: self.flags, opening_loc: self.opening_loc, parts: self.parts, closing_loc: self.closing_loc, location: self.location) InterpolatedRegularExpressionNode.new(source, flags, opening_loc, parts, closing_loc, location) end
def deconstruct_keys
: (Array keys) -> { flags: Integer, opening_loc
: Location
, parts: Array[StringNode | EmbeddedStatementsNode
| EmbeddedVariableNode], closing_loc
: Location
, location: Location
}
# File prism/node.rb, line 10843 def deconstruct_keys(keys) { flags: flags, opening_loc: opening_loc, parts: parts, closing_loc: closing_loc, location: location } end
def euc_jp?: () -> bool
# File prism/node.rb, line 10889 def euc_jp? flags.anybits?(RegularExpressionFlags::EUC_JP) end
def extended?: () -> bool
# File prism/node.rb, line 10874 def extended? flags.anybits?(RegularExpressionFlags::EXTENDED) end
def forced_binary_encoding?: () -> bool
# File prism/node.rb, line 10914 def forced_binary_encoding? flags.anybits?(RegularExpressionFlags::FORCED_BINARY_ENCODING) end
def forced_us_ascii_encoding?: () -> bool
# File prism/node.rb, line 10919 def forced_us_ascii_encoding? flags.anybits?(RegularExpressionFlags::FORCED_US_ASCII_ENCODING) end
def forced_utf8_encoding?: () -> bool
# File prism/node.rb, line 10909 def forced_utf8_encoding? flags.anybits?(RegularExpressionFlags::FORCED_UTF8_ENCODING) end
def ignore_case?: () -> bool
# File prism/node.rb, line 10869 def ignore_case? flags.anybits?(RegularExpressionFlags::IGNORE_CASE) end
def inspect -> String
# File prism/node.rb, line 10934 def inspect InspectVisitor.compose(self) end
def multi_line?: () -> bool
# File prism/node.rb, line 10879 def multi_line? flags.anybits?(RegularExpressionFlags::MULTI_LINE) end
def once?: () -> bool
# File prism/node.rb, line 10884 def once? flags.anybits?(RegularExpressionFlags::ONCE) end
def opening: () -> String
# File prism/node.rb, line 10924 def opening opening_loc.slice end
attr_reader opening_loc
: Location
# File prism/node.rb, line 10852 def opening_loc location = @opening_loc return location if location.is_a?(Location) @opening_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.
Instead, you can call type
, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.
def type: () -> Symbol
# File prism/node.rb, line 10952 def type :interpolated_regular_expression_node end
def utf_8?: () -> bool
# File prism/node.rb, line 10904 def utf_8? flags.anybits?(RegularExpressionFlags::UTF_8) end
def windows_31j?: () -> bool
# File prism/node.rb, line 10899 def windows_31j? flags.anybits?(RegularExpressionFlags::WINDOWS_31J) end