class Prism::InterpolatedXStringNode

Represents an xstring literal that contains interpolation.

`foo #{bar} baz`
^^^^^^^^^^^^^^^^

Attributes

closing_loc[R]

attr_reader closing_loc: Location

opening_loc[R]

attr_reader opening_loc: Location

parts[R]

attr_reader parts: Array

Public Class Methods

new(opening_loc, parts, closing_loc, location) click to toggle source

def initialize: (opening_loc: Location, parts: Array, closing_loc: Location, location: Location) -> void

# File lib/prism/node.rb, line 10301
def initialize(opening_loc, parts, closing_loc, location)
  @opening_loc = opening_loc
  @parts = parts
  @closing_loc = closing_loc
  @location = location
end

type() click to toggle source

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 lib/prism/node.rb, line 10394
def self.type
  :interpolated_x_string_node
end

Public Instance Methods

accept(visitor) click to toggle source

def accept: (visitor: Visitor) -> void

# File lib/prism/node.rb, line 10309
def accept(visitor)
  visitor.visit_interpolated_x_string_node(self)
end

child_nodes() click to toggle source

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

# File lib/prism/node.rb, line 10319
def child_nodes
  [*parts]
end

Also aliased as: deconstruct

closing() click to toggle source

def closing: () -> String

# File lib/prism/node.rb, line 10357
def closing
  closing_loc.slice
end

comment_targets() click to toggle source

def comment_targets: () -> Array[Node | Location]

# File lib/prism/node.rb, line 10329
def comment_targets
  [opening_loc, *parts, closing_loc]
end

compact_child_nodes() click to toggle source

def compact_child_nodes: () -> Array

# File lib/prism/node.rb, line 10324
def compact_child_nodes
  [*parts]
end

copy(**params) click to toggle source

def copy: (**params) -> InterpolatedXStringNode

# File lib/prism/node.rb, line 10334
def copy(**params)
  InterpolatedXStringNode.new(
    params.fetch(:opening_loc) { opening_loc },
    params.fetch(:parts) { parts },
    params.fetch(:closing_loc) { closing_loc },
    params.fetch(:location) { location },
  )
end

deconstruct()

def deconstruct: () -> Array[nil | Node]

Alias for: child_nodes

deconstruct_keys(keys) click to toggle source

# File lib/prism/node.rb, line 10347
def deconstruct_keys(keys)
  { opening_loc: opening_loc, parts: parts, closing_loc: closing_loc, location: location }
end

inspect(inspector = NodeInspector.new) click to toggle source

def inspect(inspector: NodeInspector) -> String

# File lib/prism/node.rb, line 10362
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  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

opening() click to toggle source

def opening: () -> String

# File lib/prism/node.rb, line 10352
def opening
  opening_loc.slice
end

type() click to toggle source

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 lib/prism/node.rb, line 10384
def type
  :interpolated_x_string_node
end