class Prism::StringNode
Experimental RBS support (using type sampling data from the type_fusion project).
# sig/prism/node.rbs class Prism::StringNode < Prism::Node def accept: (Analyzer::Visitor visitor) -> Array[] def compact_child_nodes: () -> Array[] def initialize: (Integer flags, Prism::Location? opening_loc, Prism::Location content_loc, Prism::Location? closing_loc, String unescaped, Prism::Location location) -> void end
^^^^ ^^^^
“foo #{bar} baz”
^^^
%w[foo]
^^^^^
“foo”
Represents a string literal, a string contained within a ‘%w` list, or plain string content within an interpolated string.
def self.type
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 :string_node end
def accept(visitor)
Experimental RBS support (using type sampling data from the type_fusion project).
def accept: (Analyzer::Visitor visitor) ->
This signature was generated using 12 samples from 1 application.
def accept(visitor) visitor.visit_string_node(self) end
def child_nodes
def child_nodes [] end
def closing
def closing closing_loc&.slice end
def comment_targets
def comment_targets [*opening_loc, content_loc, *closing_loc] end
def compact_child_nodes
Experimental RBS support (using type sampling data from the type_fusion project).
def compact_child_nodes: () ->
This signature was generated using 12 samples from 1 application.
def compact_child_nodes [] end
def content
def content content_loc.slice end
def copy(**params)
def copy(**params) StringNode.new( params.fetch(:flags) { flags }, params.fetch(:opening_loc) { opening_loc }, params.fetch(:content_loc) { content_loc }, params.fetch(:closing_loc) { closing_loc }, params.fetch(:unescaped) { unescaped }, params.fetch(:location) { location }, ) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { flags: flags, opening_loc: opening_loc, content_loc: content_loc, closing_loc: closing_loc, unescaped: unescaped, location: location } end
def forced_binary_encoding?
def forced_binary_encoding? flags.anybits?(StringFlags::FORCED_BINARY_ENCODING) end
def forced_utf8_encoding?
def forced_utf8_encoding? flags.anybits?(StringFlags::FORCED_UTF8_ENCODING) end
def frozen?
def frozen? flags.anybits?(StringFlags::FROZEN) end
def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location)
Experimental RBS support (using type sampling data from the type_fusion project).
def initialize: (Integer flags, Prism::Location? opening_loc, Prism::Location content_loc, Prism::Location? closing_loc, String unescaped, Prism::Location location) -> void
This signature was generated using 17 samples from 1 application.
def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location) @newline = false @flags = flags @opening_loc = opening_loc @content_loc = content_loc @closing_loc = closing_loc @unescaped = unescaped @location = location end
def inspect(inspector = NodeInspector.new)
def inspect(inspector = NodeInspector.new) inspector << inspector.header(self) flags = [("forced_utf8_encoding" if forced_utf8_encoding?), ("forced_binary_encoding" if forced_binary_encoding?), ("frozen" if frozen?)].compact inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n" inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n" inspector << "├── content_loc: #{inspector.location(content_loc)}\n" inspector << "├── closing_loc: #{inspector.location(closing_loc)}\n" inspector << "└── unescaped: #{unescaped.inspect}\n" inspector.to_str end
def opening
def opening opening_loc&.slice end
def type
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 :string_node end