class Prism::InterpolatedRegularExpressionNode

^^^^^^^^^^^^^^^^
/foo #{bar} baz/
Represents a regular expression literal that contains interpolation.

def self.type

def self.type: () -> Symbol

class, but should be faster in a case statement or an array comparison.
Note that like #type, it will still be slower than using == for a single
splitting on the type of the node without having to do a long === chain.
Similar to #type, this method returns a symbol that you can use for 
def self.type
  :interpolated_regular_expression_node
end

def accept(visitor)

def accept: (Visitor visitor) -> void 
def accept(visitor)
  visitor.visit_interpolated_regular_expression_node(self)
end

def ascii_8bit?

def ascii_8bit?: () -> bool 
def ascii_8bit?
  flags.anybits?(RegularExpressionFlags::ASCII_8BIT)
end

def child_nodes

def child_nodes: () -> Array[nil | Node] 
def child_nodes
  [*parts]
end

def closing

def closing: () -> String 
def closing
  closing_loc.slice
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [opening_loc, *parts, closing_loc]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  [*parts]
end

def copy(**params)

def copy: (**params) -> InterpolatedRegularExpressionNode 
def copy(**params)
  InterpolatedRegularExpressionNode.new(
    params.fetch(:flags) { flags },
    params.fetch(:opening_loc) { opening_loc },
    params.fetch(:parts) { parts },
    params.fetch(:closing_loc) { closing_loc },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } 
def deconstruct_keys(keys)
  { flags: flags, opening_loc: opening_loc, parts: parts, closing_loc: closing_loc, location: location }
end

def euc_jp?

def euc_jp?: () -> bool 
def euc_jp?
  flags.anybits?(RegularExpressionFlags::EUC_JP)
end

def extended?

def extended?: () -> bool 
def extended?
  flags.anybits?(RegularExpressionFlags::EXTENDED)
end

def forced_binary_encoding?

def forced_binary_encoding?: () -> bool 
def forced_binary_encoding?
  flags.anybits?(RegularExpressionFlags::FORCED_BINARY_ENCODING)
end

def forced_us_ascii_encoding?

def forced_us_ascii_encoding?: () -> bool 
def forced_us_ascii_encoding?
  flags.anybits?(RegularExpressionFlags::FORCED_US_ASCII_ENCODING)
end

def forced_utf8_encoding?

def forced_utf8_encoding?: () -> bool 
def forced_utf8_encoding?
  flags.anybits?(RegularExpressionFlags::FORCED_UTF8_ENCODING)
end

def ignore_case?

def ignore_case?: () -> bool 
def ignore_case?
  flags.anybits?(RegularExpressionFlags::IGNORE_CASE)
end

def initialize(flags, opening_loc, parts, closing_loc, location)

def initialize: (Integer flags, Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void 
def initialize(flags, opening_loc, parts, closing_loc, location)
  @newline = false
  @flags = flags
  @opening_loc = opening_loc
  @parts = parts
  @closing_loc = closing_loc
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  flags = [("ignore_case" if ignore_case?), ("extended" if extended?), ("multi_line" if multi_line?), ("once" if once?), ("euc_jp" if euc_jp?), ("ascii_8bit" if ascii_8bit?), ("windows_31j" if windows_31j?), ("utf_8" if utf_8?), ("forced_utf8_encoding" if forced_utf8_encoding?), ("forced_binary_encoding" if forced_binary_encoding?), ("forced_us_ascii_encoding" if forced_us_ascii_encoding?)].compact
  inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n"
  inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n"
  inspector << "├── parts: #{inspector.list("#{inspector.prefix}│   ", parts)}"
  inspector << "└── closing_loc: #{inspector.location(closing_loc)}\n"
  inspector.to_str
end

def multi_line?

def multi_line?: () -> bool 
def multi_line?
  flags.anybits?(RegularExpressionFlags::MULTI_LINE)
end

def once?

def once?: () -> bool 
def once?
  flags.anybits?(RegularExpressionFlags::ONCE)
end

def opening

def opening: () -> String 
def opening
  opening_loc.slice
end

def set_newline_flag(newline_marked) # :nodoc:

:nodoc: 
def set_newline_flag(newline_marked) # :nodoc:
  first = parts.first
  first.set_newline_flag(newline_marked) if first
end

def type

def type: () -> Symbol

keys will use a jump table.
you can take advantage of the fact that case statements with all symbol
it uses a single integer comparison, but also because if you're on CRuby
can use for comparison. This is faster than the other approaches because
Instead, you can call #type, which will return to you a symbol that you

method calls, and/or array allocations.
these approaches are relatively slow because of the constant lookups,
case statement and doing `case node; when cls1; when cls2; end`. Both of
calling `[cls1, cls2].include?(node.class)` or putting the node into a
classes to see what kind of behavior to perform. Usually this is done by
Sometimes you want to check an instance of a node against a list of 
def type
  :interpolated_regular_expression_node
end

def utf_8?

def utf_8?: () -> bool 
def utf_8?
  flags.anybits?(RegularExpressionFlags::UTF_8)
end

def windows_31j?

def windows_31j?: () -> bool 
def windows_31j?
  flags.anybits?(RegularExpressionFlags::WINDOWS_31J)
end