.
+ #
+ # CSS styles use classes, so you have to include a stylesheet
+ # in your output.
+ #
+ # See encode.
+ #
+ # pkg:gem/coderay#lib/coderay.rb:232
+ def highlight(code, lang, options = T.unsafe(nil), format = T.unsafe(nil)); end
+
+ # Highlight a file into a HTML
.
+ #
+ # CSS styles use classes, so you have to include a stylesheet
+ # in your output.
+ #
+ # See encode.
+ #
+ # pkg:gem/coderay#lib/coderay.rb:242
+ def highlight_file(filename, options = T.unsafe(nil), format = T.unsafe(nil)); end
+
+ # Scans the given +code+ (a String) with the Scanner for +lang+.
+ #
+ # This is a simple way to use CodeRay. Example:
+ # require 'coderay'
+ # page = CodeRay.scan("puts 'Hello, world!'", :ruby).html
+ #
+ # See also demo/demo_simple.
+ #
+ # pkg:gem/coderay#lib/coderay.rb:168
+ def scan(code, lang, options = T.unsafe(nil), &block); end
+
+ # Scans +filename+ (a path to a code file) with the Scanner for +lang+.
+ #
+ # If +lang+ is :auto or omitted, the CodeRay::FileType module is used to
+ # determine it. If it cannot find out what type it is, it uses
+ # CodeRay::Scanners::Text.
+ #
+ # Calls CodeRay.scan.
+ #
+ # Example:
+ # require 'coderay'
+ # page = CodeRay.scan_file('some_c_code.c').html
+ #
+ # pkg:gem/coderay#lib/coderay.rb:183
+ def scan_file(filename, lang = T.unsafe(nil), options = T.unsafe(nil), &block); end
+
+ # Finds the Scanner class for +lang+ and creates an instance, passing
+ # +options+ to it.
+ #
+ # See Scanner.new.
+ #
+ # pkg:gem/coderay#lib/coderay.rb:268
+ def scanner(lang, options = T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay.rb:130
+CodeRay::CODERAY_PATH = T.let(T.unsafe(nil), String)
+
+# = Duo
+#
+# A Duo is a convenient way to use CodeRay. You just create a Duo,
+# giving it a lang (language of the input code) and a format (desired
+# output format), and call Duo#highlight with the code.
+#
+# Duo makes it easy to re-use both scanner and encoder for a repetitive
+# task. It also provides a very easy interface syntax:
+#
+# require 'coderay'
+# CodeRay::Duo[:python, :div].highlight 'import this'
+#
+# Until you want to do uncommon things with CodeRay, I recommend to use
+# this method, since it takes care of everything.
+#
+# pkg:gem/coderay#lib/coderay/duo.rb:17
+class CodeRay::Duo
+ # Create a new Duo, holding a lang and a format to highlight code.
+ #
+ # simple:
+ # CodeRay::Duo[:ruby, :html].highlight 'bla 42'
+ #
+ # with options:
+ # CodeRay::Duo[:ruby, :html, :hint => :debug].highlight '????::??'
+ #
+ # alternative syntax without options:
+ # CodeRay::Duo[:ruby => :statistic].encode 'class << self; end'
+ #
+ # alternative syntax with options:
+ # CodeRay::Duo[{ :ruby => :statistic }, :do => :something].encode 'abc'
+ #
+ # The options are forwarded to scanner and encoder
+ # (see CodeRay.get_scanner_options).
+ #
+ # pkg:gem/coderay#lib/coderay/duo.rb:37
+ def initialize(lang = T.unsafe(nil), format = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # Allows to use Duo like a proc object:
+ #
+ # CodeRay::Duo[:python => :yaml].call(code)
+ #
+ # or, in Ruby 1.9 and later:
+ #
+ # CodeRay::Duo[:python => :yaml].(code)
+ #
+ # pkg:gem/coderay#lib/coderay/duo.rb:77
+ def call(code, options = T.unsafe(nil)); end
+
+ # Tokenize and highlight the code using +scanner+ and +encoder+.
+ #
+ # pkg:gem/coderay#lib/coderay/duo.rb:64
+ def encode(code, options = T.unsafe(nil)); end
+
+ # The encoder of the duo. Only created once.
+ #
+ # pkg:gem/coderay#lib/coderay/duo.rb:59
+ def encoder; end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:19
+ def format; end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:19
+ def format=(_arg0); end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:68
+ def highlight(code, options = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:19
+ def lang; end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:19
+ def lang=(_arg0); end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:19
+ def options; end
+
+ # pkg:gem/coderay#lib/coderay/duo.rb:19
+ def options=(_arg0); end
+
+ # The scanner of the duo. Only created once.
+ #
+ # pkg:gem/coderay#lib/coderay/duo.rb:54
+ def scanner; end
+
+ class << self
+ # To allow calls like Duo[:ruby, :html].highlight.
+ #
+ # pkg:gem/coderay#lib/coderay/duo.rb:50
+ def [](*_arg0); end
+ end
+end
+
+# This module holds the Encoder class and its subclasses.
+# For example, the HTML encoder is named CodeRay::Encoders::HTML
+# can be found in coderay/encoders/html.
+#
+# Encoders also provides methods and constants for the register
+# mechanism and the [] method that returns the Encoder class
+# belonging to the given format.
+#
+# pkg:gem/coderay#lib/coderay/encoders.rb:10
+module CodeRay::Encoders
+ extend ::CodeRay::PluginHost
+end
+
+# A simple Filter that removes all tokens of the :comment kind.
+#
+# Alias: +remove_comments+
+#
+# Usage:
+# CodeRay.scan('print # foo', :ruby).comment_filter.text
+# #-> "print "
+#
+# See also: TokenKindFilter, LinesOfCode
+#
+# pkg:gem/coderay#lib/coderay/encoders/comment_filter.rb:15
+class CodeRay::Encoders::CommentFilter < ::CodeRay::Encoders::TokenKindFilter; end
+
+# pkg:gem/coderay#lib/coderay/encoders/comment_filter.rb:19
+CodeRay::Encoders::CommentFilter::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# Returns the number of tokens.
+#
+# Text and block tokens are counted.
+#
+# pkg:gem/coderay#lib/coderay/encoders/count.rb:7
+class CodeRay::Encoders::Count < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:29
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:33
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:32
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:34
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:25
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:19
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/count.rb:13
+ def setup(options); end
+end
+
+# = Debug Encoder
+#
+# Fast encoder producing simple debug output.
+#
+# It is readable and diff-able and is used for testing.
+#
+# You cannot fully restore the tokens information from the
+# output, because consecutive :space tokens are merged.
+#
+# See also: Scanners::Debug
+#
+# pkg:gem/coderay#lib/coderay/encoders/debug.rb:14
+class CodeRay::Encoders::Debug < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/debug.rb:30
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug.rb:38
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug.rb:34
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug.rb:42
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug.rb:20
+ def text_token(text, kind); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/debug.rb:18
+CodeRay::Encoders::Debug::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# = Debug Lint Encoder
+#
+# Debug encoder with additional checks for:
+#
+# - empty tokens
+# - incorrect nesting
+#
+# It will raise an InvalidTokenStream exception when any of the above occurs.
+#
+# See also: Encoders::Debug
+#
+# pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:16
+class CodeRay::Encoders::DebugLint < ::CodeRay::Encoders::Debug
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:26
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:37
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:31
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:42
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:20
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:55
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/debug_lint.rb:50
+ def setup(options); end
+end
+
+# Wraps HTML output into a DIV element, using inline styles by default.
+#
+# See Encoders::HTML for available options.
+#
+# pkg:gem/coderay#lib/coderay/encoders/div.rb:9
+class CodeRay::Encoders::Div < ::CodeRay::Encoders::HTML; end
+
+# pkg:gem/coderay#lib/coderay/encoders/div.rb:15
+CodeRay::Encoders::Div::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/div.rb:11
+CodeRay::Encoders::Div::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# = Encoder
+#
+# The Encoder base class. Together with Scanner and
+# Tokens, it forms the highlighting triad.
+#
+# Encoder instances take a Tokens object and do something with it.
+#
+# The most common Encoder is surely the HTML encoder
+# (CodeRay::Encoders::HTML). It highlights the code in a colorful
+# html page.
+# If you want the highlighted code in a div or a span instead,
+# use its subclasses Div and Span.
+#
+# pkg:gem/coderay#lib/coderay/encoders/encoder.rb:16
+class CodeRay::Encoders::Encoder
+ extend ::CodeRay::Plugin
+
+ # Creates a new Encoder.
+ # +options+ is saved and used for all encode operations, as long
+ # as you don't overwrite it there by passing additional options.
+ #
+ # Encoder objects provide three encode methods:
+ # - encode simply takes a +code+ string and a +lang+
+ # - encode_tokens expects a +tokens+ object instead
+ #
+ # Each method has an optional +options+ parameter. These are
+ # added to the options you passed at creation.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:55
+ def initialize(options = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:87
+ def <<(token); end
+
+ # Starts a token group with the given +kind+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:123
+ def begin_group(kind); end
+
+ # Starts a new line token group with the given +kind+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:131
+ def begin_line(kind); end
+
+ # Encode the given +code+ using the Scanner for +lang+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:70
+ def encode(code, lang, options = T.unsafe(nil)); end
+
+ # Encode a Tokens object.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:61
+ def encode_tokens(tokens, options = T.unsafe(nil)); end
+
+ # Ends a token group with the given +kind+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:127
+ def end_group(kind); end
+
+ # Ends a new line token group with the given +kind+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:135
+ def end_line(kind); end
+
+ # The default file extension for this encoder.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:83
+ def file_extension; end
+
+ # You can use highlight instead of encode, if that seems
+ # more clear to you.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:80
+ def highlight(code, lang, options = T.unsafe(nil)); end
+
+ # The options you gave the Encoder at creating.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:43
+ def options; end
+
+ # The options you gave the Encoder at creating.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:43
+ def options=(_arg0); end
+
+ # The options you gave the Encoder at creating.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:43
+ def scanner; end
+
+ # The options you gave the Encoder at creating.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:43
+ def scanner=(_arg0); end
+
+ # Called for each text token ([text, kind]), where text is a String.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:118
+ def text_token(text, kind); end
+
+ # Called with +content+ and +kind+ of the currently scanned token.
+ # For simple scanners, it's enougth to implement this method.
+ #
+ # By default, it calls text_token, begin_group, end_group, begin_line,
+ # or end_line, depending on the +content+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:100
+ def token(content, kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:184
+ def tokens(tokens, options = T.unsafe(nil)); end
+
+ protected
+
+ # Do the encoding.
+ #
+ # The already created +tokens+ object must be used; it must be a
+ # Tokens object.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:168
+ def compile(tokens, options = T.unsafe(nil)); end
+
+ # Called with merged options after encoding starts.
+ # The return value is the result of encoding, typically @out.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:160
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:148
+ def get_output(options); end
+
+ # Append data.to_s to the output. Returns the argument.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:153
+ def output(data); end
+
+ # Called with merged options before encoding starts.
+ # Sets @out to an empty string.
+ #
+ # See the HTML Encoder for an example of option caching.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:144
+ def setup(options); end
+
+ class << self
+ # If FILE_EXTENSION isn't defined, this method returns the
+ # downcase class name instead.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:24
+ def const_missing(sym); end
+
+ # The default file extension for output file of this encoder class.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/encoder.rb:33
+ def file_extension; end
+ end
+end
+
+# Subclasses are to store their default options in this constant.
+#
+# pkg:gem/coderay#lib/coderay/encoders/encoder.rb:40
+CodeRay::Encoders::Encoder::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/helpers/plugin.rb:41
+CodeRay::Encoders::Encoder::PLUGIN_HOST = CodeRay::Encoders
+
+# A Filter encoder has another Tokens instance as output.
+# It can be subclass to select, remove, or modify tokens in the stream.
+#
+# Subclasses of Filter are called "Filters" and can be chained.
+#
+# == Options
+#
+# === :tokens
+#
+# The Tokens object which will receive the output.
+#
+# Default: Tokens.new
+#
+# See also: TokenKindFilter
+#
+# pkg:gem/coderay#lib/coderay/encoders/filter.rb:18
+class CodeRay::Encoders::Filter < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:39
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:43
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:47
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:51
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:35
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:29
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/filter.rb:23
+ def setup(options); end
+end
+
+# = HTML Encoder
+#
+# This is CodeRay's most important highlighter:
+# It provides save, fast XHTML generation and CSS support.
+#
+# == Usage
+#
+# require 'coderay'
+# puts CodeRay.scan('Some /code/', :ruby).html #-> a HTML page
+# puts CodeRay.scan('Some /code/', :ruby).html(:wrap => :span)
+# #->
Some /code/
+# puts CodeRay.scan('Some /code/', :ruby).span #-> the same
+#
+# puts CodeRay.scan('Some code', :ruby).html(
+# :wrap => nil,
+# :line_numbers => :inline,
+# :css => :style
+# )
+#
+# == Options
+#
+# === :tab_width
+# Convert \t characters to +n+ spaces (a number or false.)
+# false will keep tab characters untouched.
+#
+# Default: 8
+#
+# === :css
+# How to include the styles; can be :class or :style.
+#
+# Default: :class
+#
+# === :wrap
+# Wrap in :page, :div, :span or nil.
+#
+# You can also use Encoders::Div and Encoders::Span.
+#
+# Default: nil
+#
+# === :title
+#
+# The title of the HTML page (works only when :wrap is set to :page.)
+#
+# Default: 'CodeRay output'
+#
+# === :break_lines
+#
+# Split multiline blocks at line breaks.
+# Forced to true if :line_numbers option is set to :inline.
+#
+# Default: false
+#
+# === :line_numbers
+# Include line numbers in :table, :inline, or nil (no line numbers)
+#
+# Default: nil
+#
+# === :line_number_anchors
+# Adds anchors and links to the line numbers. Can be false (off), true (on),
+# or a prefix string that will be prepended to the anchor name.
+#
+# The prefix must consist only of letters, digits, and underscores.
+#
+# Default: true, default prefix name: "line"
+#
+# === :line_number_start
+# Where to start with line number counting.
+#
+# Default: 1
+#
+# === :bold_every
+# Make every +n+-th number appear bold.
+#
+# Default: 10
+#
+# === :highlight_lines
+#
+# Highlights certain line numbers.
+# Can be any Enumerable, typically just an Array or Range, of numbers.
+#
+# Bolding is deactivated when :highlight_lines is set. It only makes sense
+# in combination with :line_numbers.
+#
+# Default: nil
+#
+# === :hint
+# Include some information into the output using the title attribute.
+# Can be :info (show token kind on mouse-over), :info_long (with full path)
+# or :debug (via inspect).
+#
+# Default: false
+#
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:97
+class CodeRay::Encoders::HTML < ::CodeRay::Encoders::Encoder
+ # token groups, eg. strings
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:235
+ def begin_group(kind); end
+
+ # whole lines to be highlighted, eg. a deleted line in a diff
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:247
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:126
+ def css; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:241
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:261
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:221
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:316
+ def break_lines(text, style); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:310
+ def check_group_nesting(name, kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:268
+ def check_options!(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:324
+ def close_span; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:280
+ def css_class_for_kinds(kinds); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:195
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:289
+ def make_span_for_kinds(method, hint); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:172
+ def setup(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:284
+ def style_for_kinds(kinds); end
+
+ class << self
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:130
+ def make_html_escape_hash; end
+
+ # Generate a hint about the given +kinds+ in a +hint+ style.
+ #
+ # +hint+ may be :info, :info_long or :debug.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/html.rb:157
+ def token_path_to_hint(hint, kinds); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/html/css.rb:5
+class CodeRay::Encoders::HTML::CSS
+ # pkg:gem/coderay#lib/coderay/encoders/html/css.rb:13
+ def initialize(style = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/css.rb:23
+ def get_style_for_css_classes(css_classes); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/css.rb:7
+ def stylesheet; end
+
+ private
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/css.rb:49
+ def parse(stylesheet); end
+
+ class << self
+ # pkg:gem/coderay#lib/coderay/encoders/html/css.rb:9
+ def load_stylesheet(style = T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/html/css.rb:36
+CodeRay::Encoders::HTML::CSS::CSS_CLASS_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:103
+CodeRay::Encoders::HTML::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:101
+CodeRay::Encoders::HTML::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:143
+CodeRay::Encoders::HTML::HTML_ESCAPE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:144
+CodeRay::Encoders::HTML::HTML_ESCAPE_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/encoders/html/numbering.rb:6
+module CodeRay::Encoders::HTML::Numbering
+ class << self
+ # pkg:gem/coderay#lib/coderay/encoders/html/numbering.rb:8
+ def number!(output, mode = T.unsafe(nil), options = T.unsafe(nil)); end
+ end
+end
+
+# This module is included in the output String of the HTML Encoder.
+#
+# It provides methods like wrap, div, page etc.
+#
+# Remember to use #clone instead of #dup to keep the modules the object was
+# extended with.
+#
+# TODO: Rewrite this without monkey patching.
+#
+# pkg:gem/coderay#lib/coderay/encoders/html/output.rb:14
+module CodeRay::Encoders::HTML::Output
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:57
+ def apply_title!(title); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:16
+ def css; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:16
+ def css=(_arg0); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:86
+ def stylesheet(in_tag = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:62
+ def wrap!(element, *args); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:52
+ def wrap_in!(template); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:47
+ def wrapped_in; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:50
+ def wrapped_in=(_arg0); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:43
+ def wrapped_in?(element); end
+
+ class << self
+ # Raises an exception if an object that doesn't respond to to_str is extended by Output,
+ # to prevent users from misuse. Use Module#remove_method to disable.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:22
+ def extended(o); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:26
+ def make_stylesheet(css, in_tag = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:36
+ def page_template_for_css(css); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/html/output.rb:117
+CodeRay::Encoders::HTML::Output::DIV = T.let(T.unsafe(nil), CodeRay::Encoders::HTML::Output::Template)
+
+# pkg:gem/coderay#lib/coderay/encoders/html/output.rb:130
+CodeRay::Encoders::HTML::Output::PAGE = T.let(T.unsafe(nil), CodeRay::Encoders::HTML::Output::Template)
+
+# pkg:gem/coderay#lib/coderay/encoders/html/output.rb:115
+CodeRay::Encoders::HTML::Output::SPAN = T.let(T.unsafe(nil), CodeRay::Encoders::HTML::Output::Template)
+
+# pkg:gem/coderay#lib/coderay/encoders/html/output.rb:123
+CodeRay::Encoders::HTML::Output::TABLE = T.let(T.unsafe(nil), CodeRay::Encoders::HTML::Output::Template)
+
+# -- don't include the templates in docu
+#
+# pkg:gem/coderay#lib/coderay/encoders/html/output.rb:92
+class CodeRay::Encoders::HTML::Output::Template < ::String
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:104
+ def apply(target, replacement); end
+
+ class << self
+ # pkg:gem/coderay#lib/coderay/encoders/html/output.rb:94
+ def wrap!(str, template, target); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:146
+CodeRay::Encoders::HTML::TOKEN_KIND_TO_INFO = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/html.rb:150
+CodeRay::Encoders::HTML::TRANSPARENT_TOKEN_KINDS = T.let(T.unsafe(nil), Set)
+
+# A simple JSON Encoder.
+#
+# Example:
+# CodeRay.scan('puts "Hello world!"', :ruby).json
+# yields
+# [
+# {"type"=>"text", "text"=>"puts", "kind"=>"ident"},
+# {"type"=>"text", "text"=>" ", "kind"=>"space"},
+# {"type"=>"block", "action"=>"open", "kind"=>"string"},
+# {"type"=>"text", "text"=>"\"", "kind"=>"delimiter"},
+# {"type"=>"text", "text"=>"Hello world!", "kind"=>"content"},
+# {"type"=>"text", "text"=>"\"", "kind"=>"delimiter"},
+# {"type"=>"block", "action"=>"close", "kind"=>"string"},
+# ]
+#
+# pkg:gem/coderay#lib/coderay/encoders/json.rb:18
+class CodeRay::Encoders::JSON < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:64
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:72
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:68
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:76
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:60
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:49
+ def append(data); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:45
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/json.rb:38
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/json.rb:35
+CodeRay::Encoders::JSON::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# Counts the LoC (Lines of Code). Returns an Integer >= 0.
+#
+# Alias: +loc+
+#
+# Everything that is not comment, markup, doctype/shebang, or an empty line,
+# is considered to be code.
+#
+# For example,
+# * HTML files not containing JavaScript have 0 LoC
+# * in a Java class without comments, LoC is the number of non-empty lines
+#
+# A Scanner class should define the token kinds that are not code in the
+# KINDS_NOT_LOC constant, which defaults to [:comment, :doctype].
+#
+# pkg:gem/coderay#lib/coderay/encoders/lines_of_code.rb:17
+class CodeRay::Encoders::LinesOfCode < ::CodeRay::Encoders::TokenKindFilter
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/lines_of_code.rb:38
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/lines_of_code.rb:25
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/lines_of_code.rb:21
+CodeRay::Encoders::LinesOfCode::NON_EMPTY_LINE = T.let(T.unsafe(nil), Regexp)
+
+# = Lint Encoder
+#
+# Checks for:
+#
+# - empty tokens
+# - incorrect nesting
+#
+# It will raise an InvalidTokenStream exception when any of the above occurs.
+#
+# See also: Encoders::DebugLint
+#
+# pkg:gem/coderay#lib/coderay/encoders/lint.rb:14
+class CodeRay::Encoders::Lint < ::CodeRay::Encoders::Debug
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:28
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:37
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:32
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:41
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:23
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:52
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/lint.rb:48
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/lint.rb:19
+class CodeRay::Encoders::Lint::EmptyToken < ::CodeRay::Encoders::Lint::InvalidTokenStream; end
+
+# pkg:gem/coderay#lib/coderay/encoders/lint.rb:21
+class CodeRay::Encoders::Lint::IncorrectTokenGroupNesting < ::CodeRay::Encoders::Lint::InvalidTokenStream; end
+
+# pkg:gem/coderay#lib/coderay/encoders/lint.rb:18
+class CodeRay::Encoders::Lint::InvalidTokenStream < ::StandardError; end
+
+# pkg:gem/coderay#lib/coderay/encoders/lint.rb:20
+class CodeRay::Encoders::Lint::UnknownTokenKind < ::CodeRay::Encoders::Lint::InvalidTokenStream; end
+
+# = Null Encoder
+#
+# Does nothing and returns an empty string.
+#
+# pkg:gem/coderay#lib/coderay/encoders/null.rb:7
+class CodeRay::Encoders::Null < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/null.rb:11
+ def text_token(text, kind); end
+end
+
+# Wraps the output into a HTML page, using CSS classes and
+# line numbers in the table format by default.
+#
+# See Encoders::HTML for available options.
+#
+# pkg:gem/coderay#lib/coderay/encoders/page.rb:10
+class CodeRay::Encoders::Page < ::CodeRay::Encoders::HTML; end
+
+# pkg:gem/coderay#lib/coderay/encoders/page.rb:16
+CodeRay::Encoders::Page::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/page.rb:12
+CodeRay::Encoders::Page::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# Wraps HTML output into a SPAN element, using inline styles by default.
+#
+# See Encoders::HTML for available options.
+#
+# pkg:gem/coderay#lib/coderay/encoders/span.rb:9
+class CodeRay::Encoders::Span < ::CodeRay::Encoders::HTML; end
+
+# pkg:gem/coderay#lib/coderay/encoders/span.rb:15
+CodeRay::Encoders::Span::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/span.rb:11
+CodeRay::Encoders::Span::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# Makes a statistic for the given tokens.
+#
+# Alias: +stats+
+#
+# pkg:gem/coderay#lib/coderay/encoders/statistic.rb:7
+class CodeRay::Encoders::Statistic < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:70
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:78
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:86
+ def block_token(action, kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:74
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:82
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:11
+ def real_token_count; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:62
+ def text_token(text, kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:11
+ def type_stats; end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:42
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:17
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/statistic.rb:24
+CodeRay::Encoders::Statistic::STATS = T.let(T.unsafe(nil), String)
+
+# pkg:gem/coderay#lib/coderay/encoders/statistic.rb:38
+CodeRay::Encoders::Statistic::TOKEN_TYPES_ROW = T.let(T.unsafe(nil), String)
+
+# pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+class CodeRay::Encoders::Statistic::TypeStats < ::Struct
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def count; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def count=(_); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def size; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def size=(_); end
+
+ class << self
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def [](*_arg0); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def inspect; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def keyword_init?; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def members; end
+
+ # pkg:gem/coderay#lib/coderay/encoders/statistic.rb:13
+ def new(*_arg0); end
+ end
+end
+
+# Outputs code highlighted for a color terminal.
+#
+# Note: This encoder is in beta. It currently doesn't use the Styles.
+#
+# Alias: +term+
+#
+# == Authors & License
+#
+# By Rob Aldred (http://robaldred.co.uk)
+#
+# Based on idea by Nathan Weizenbaum (http://nex-3.com)
+#
+# MIT License (http://www.opensource.org/licenses/mit-license.php)
+#
+# pkg:gem/coderay#lib/coderay/encoders/terminal.rb:17
+class CodeRay::Encoders::Terminal < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:156
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:160
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:162
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:172
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:141
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:133
+ def setup(options); end
+
+ private
+
+ # pkg:gem/coderay#lib/coderay/encoders/terminal.rb:179
+ def open_token(kind); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/terminal.rb:21
+CodeRay::Encoders::Terminal::TOKEN_COLORS = T.let(T.unsafe(nil), Hash)
+
+# Concats the tokens into a single string, resulting in the original
+# code string if no tokens were removed.
+#
+# Alias: +plain+, +plaintext+
+#
+# == Options
+#
+# === :separator
+# A separator string to join the tokens.
+#
+# Default: empty String
+#
+# pkg:gem/coderay#lib/coderay/encoders/text.rb:15
+class CodeRay::Encoders::Text < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/text.rb:25
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/text.rb:36
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/text.rb:21
+CodeRay::Encoders::Text::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/text.rb:19
+CodeRay::Encoders::Text::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# A Filter that selects tokens based on their token kind.
+#
+# == Options
+#
+# === :exclude
+#
+# One or many symbols (in an Array) which shall be excluded.
+#
+# Default: []
+#
+# === :include
+#
+# One or many symbols (in an array) which shall be included.
+#
+# Default: :all, which means all tokens are included.
+#
+# Exclusion wins over inclusion.
+#
+# See also: CommentFilter
+#
+# pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:25
+class CodeRay::Encoders::TokenKindFilter < ::CodeRay::Encoders::Filter
+ # Add the token group to the output stream if +kind+ matches the
+ # conditions.
+ #
+ # If it does not, all tokens inside the group are excluded from the
+ # stream, even if their kinds match.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:66
+ def begin_group(kind); end
+
+ # See +begin_group+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:77
+ def begin_line(kind); end
+
+ # Take care of re-enabling the delegation of tokens to the output stream
+ # if an exluded group has ended.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:89
+ def end_group(kind); end
+
+ # See +end_group+.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:99
+ def end_line(kind); end
+
+ # Add the token to the output stream if +kind+ matches the conditions.
+ #
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:57
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:49
+ def include_group?(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:45
+ def include_text_token?(text, kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:35
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/token_kind_filter.rb:29
+CodeRay::Encoders::TokenKindFilter::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# = XML Encoder
+#
+# Uses REXML. Very slow.
+#
+# pkg:gem/coderay#lib/coderay/encoders/xml.rb:7
+class CodeRay::Encoders::XML < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/xml.rb:58
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/xml.rb:62
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/xml.rb:38
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/xml.rb:31
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/xml.rb:22
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/xml.rb:15
+CodeRay::Encoders::XML::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/encoders/xml.rb:11
+CodeRay::Encoders::XML::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# = YAML Encoder
+#
+# Slow.
+#
+# pkg:gem/coderay#lib/coderay/encoders/yaml.rb:9
+class CodeRay::Encoders::YAML < ::CodeRay::Encoders::Encoder
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:31
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:39
+ def begin_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:35
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:43
+ def end_line(kind); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:27
+ def text_token(text, kind); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:22
+ def finish(options); end
+
+ # pkg:gem/coderay#lib/coderay/encoders/yaml.rb:16
+ def setup(options); end
+end
+
+# pkg:gem/coderay#lib/coderay/encoders/yaml.rb:13
+CodeRay::Encoders::YAML::FILE_EXTENSION = T.let(T.unsafe(nil), String)
+
+# = FileType
+#
+# A simple filetype recognizer.
+#
+# == Usage
+#
+# # determine the type of the given
+# lang = FileType[file_name]
+#
+# # return :text if the file type is unknown
+# lang = FileType.fetch file_name, :text
+#
+# # try the shebang line, too
+# lang = FileType.fetch file_name, :text, true
+#
+# pkg:gem/coderay#lib/coderay/helpers/file_type.rb:17
+module CodeRay::FileType
+ class << self
+ # Try to determine the file type of the file.
+ #
+ # +filename+ is a relative or absolute path to a file.
+ #
+ # The file itself is only accessed when +read_shebang+ is set to true.
+ # That means you can get filetypes from files that don't exist.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/file_type.rb:29
+ def [](filename, read_shebang = T.unsafe(nil)); end
+
+ # This works like Hash#fetch.
+ #
+ # If the filetype cannot be found, the +default+ value
+ # is returned.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/file_type.rb:50
+ def fetch(filename, default = T.unsafe(nil), read_shebang = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/helpers/file_type.rb:66
+ def type_from_shebang(filename); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/helpers/file_type.rb:79
+CodeRay::FileType::TypeFromExt = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/helpers/file_type.rb:139
+CodeRay::FileType::TypeFromName = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/helpers/file_type.rb:137
+CodeRay::FileType::TypeFromShebang = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/helpers/file_type.rb:19
+class CodeRay::FileType::UnknownFileType < ::Exception; end
+
+# = Plugin
+#
+# Plugins have to include this module.
+#
+# IMPORTANT: Use extend for this module.
+#
+# See CodeRay::PluginHost for examples.
+#
+# pkg:gem/coderay#lib/coderay/helpers/plugin.rb:10
+module CodeRay::Plugin
+ # pkg:gem/coderay#lib/coderay/helpers/plugin.rb:46
+ def aliases; end
+
+ # The PluginHost for this Plugin class.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin.rb:39
+ def plugin_host(host = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/helpers/plugin.rb:12
+ def plugin_id; end
+
+ # Register this class for the given +id+.
+ #
+ # Example:
+ # class MyPlugin < PluginHost::BaseClass
+ # register_for :my_id
+ # ...
+ # end
+ #
+ # See PluginHost.register.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin.rb:23
+ def register_for(id); end
+
+ # Returns the title of the plugin, or sets it to the
+ # optional argument +title+.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin.rb:30
+ def title(title = T.unsafe(nil)); end
+end
+
+# = PluginHost
+#
+# A simple subclass/subfolder plugin system.
+#
+# Example:
+# class Generators
+# extend PluginHost
+# plugin_path 'app/generators'
+# end
+#
+# class Generator
+# extend Plugin
+# PLUGIN_HOST = Generators
+# end
+#
+# class FancyGenerator < Generator
+# register_for :fancy
+# end
+#
+# Generators[:fancy] #-> FancyGenerator
+# # or
+# CodeRay.require_plugin 'Generators/fancy'
+# # or
+# Generators::Fancy
+#
+# pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:27
+module CodeRay::PluginHost
+ # Returns the Plugin for +id+.
+ #
+ # Example:
+ # yaml_plugin = MyPluginHost[:yaml]
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:49
+ def [](id, *args, &blk); end
+
+ # Returns an array of all Plugins.
+ #
+ # Note: This loads all plugins using load_all.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:151
+ def all_plugins; end
+
+ # Tries to +load+ the missing plugin by translating +const+ to the
+ # underscore form (eg. LinesOfCode becomes lines_of_code).
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:61
+ def const_missing(const); end
+
+ # Define the default plugin to use when no plugin is found
+ # for a given id, or return the default plugin.
+ #
+ # See also map.
+ #
+ # class MyColorHost < PluginHost
+ # map :navy => :dark_blue
+ # default :gray
+ # end
+ #
+ # MyColorHost.default # loads and returns the Gray plugin
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:114
+ def default(id = T.unsafe(nil)); end
+
+ # Returns an array of all .rb files in the plugin path.
+ #
+ # The extension .rb is not included.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:140
+ def list; end
+
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:57
+ def load(id, *args, &blk); end
+
+ # Loads all plugins using list and load.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:39
+ def load_all; end
+
+ # Loads the map file (see map).
+ #
+ # This is done automatically when plugin_path is called.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:159
+ def load_plugin_map; end
+
+ # Map a plugin_id to another.
+ #
+ # Usage: Put this in a file plugin_path/_map.rb.
+ #
+ # class MyColorHost < PluginHost
+ # map :navy => :dark_blue,
+ # :maroon => :brown,
+ # :luna => :moon
+ # end
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:95
+ def map(hash); end
+
+ # A Hash of plugion_id => Plugin pairs.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:133
+ def plugin_hash; end
+
+ # The path where the plugins can be found.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:79
+ def plugin_path(*args); end
+
+ # Every plugin must register itself for +id+ by calling register_for,
+ # which calls this method.
+ #
+ # See Plugin#register_for.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:128
+ def register(plugin, id); end
+
+ protected
+
+ # Return a plugin hash that automatically loads plugins.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:172
+ def make_plugin_hash; end
+
+ # Returns the expected path to the plugin file for the given id.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:196
+ def path_to(plugin_id); end
+
+ # Converts +id+ to a valid plugin ID String, or returns +nil+.
+ #
+ # Raises +ArgumentError+ for all other objects, or if the
+ # given String includes non-alphanumeric characters (\W).
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:204
+ def validate_id(id); end
+
+ class << self
+ # Adds the module/class to the PLUGIN_HOSTS list.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:72
+ def extended(mod); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:33
+class CodeRay::PluginHost::HostNotFound < ::LoadError; end
+
+# pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:35
+CodeRay::PluginHost::PLUGIN_HOSTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:36
+CodeRay::PluginHost::PLUGIN_HOSTS_BY_ID = T.let(T.unsafe(nil), Hash)
+
+# Raised if Encoders::[] fails because:
+# * a file could not be found
+# * the requested Plugin is not registered
+#
+# pkg:gem/coderay#lib/coderay/helpers/plugin_host.rb:32
+class CodeRay::PluginHost::PluginNotFound < ::LoadError; end
+
+# = Scanners
+#
+# This module holds the Scanner class and its subclasses.
+# For example, the Ruby scanner is named CodeRay::Scanners::Ruby
+# can be found in coderay/scanners/ruby.
+#
+# Scanner also provides methods and constants for the register
+# mechanism and the [] method that returns the Scanner class
+# belonging to the given lang.
+#
+# See PluginHost.
+#
+# pkg:gem/coderay#lib/coderay/scanners.rb:18
+module CodeRay::Scanners
+ extend ::CodeRay::PluginHost
+end
+
+# Scanner for C.
+#
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:5
+class CodeRay::Scanners::C < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/c.rb:44
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:27
+CodeRay::Scanners::C::DIRECTIVES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:39
+CodeRay::Scanners::C::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:33
+CodeRay::Scanners::C::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:10
+CodeRay::Scanners::C::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:23
+CodeRay::Scanners::C::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:17
+CodeRay::Scanners::C::PREDEFINED_TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/c.rb:40
+CodeRay::Scanners::C::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# Scanner for C++.
+#
+# Aliases: +cplusplus+, c++
+CodeRay::Scanners::CPlusPlus = CodeRay::Scanners::Text
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:4
+class CodeRay::Scanners::CSS < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/css.rb:55
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/css.rb:50
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:8
+CodeRay::Scanners::CSS::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:16
+module CodeRay::Scanners::CSS::RE; end
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:31
+CodeRay::Scanners::CSS::RE::AtKeyword = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:45
+CodeRay::Scanners::CSS::RE::AttributeSelector = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:43
+CodeRay::Scanners::CSS::RE::Class = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:38
+CodeRay::Scanners::CSS::RE::Dimension = T.let(T.unsafe(nil), Regexp)
+
+# differs from standard because it allows uppercase hex too
+#
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:19
+CodeRay::Scanners::CSS::RE::Escape = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:40
+CodeRay::Scanners::CSS::RE::Function = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:17
+CodeRay::Scanners::CSS::RE::Hex = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:26
+CodeRay::Scanners::CSS::RE::HexColor = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:42
+CodeRay::Scanners::CSS::RE::Id = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:30
+CodeRay::Scanners::CSS::RE::Ident = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:20
+CodeRay::Scanners::CSS::RE::NMChar = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:21
+CodeRay::Scanners::CSS::RE::NMStart = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:29
+CodeRay::Scanners::CSS::RE::Name = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:28
+CodeRay::Scanners::CSS::RE::Num = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:32
+CodeRay::Scanners::CSS::RE::Percentage = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:44
+CodeRay::Scanners::CSS::RE::PseudoClass = T.let(T.unsafe(nil), Regexp)
+
+# TODO: buggy regexp
+#
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:24
+CodeRay::Scanners::CSS::RE::String = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:22
+CodeRay::Scanners::CSS::RE::String1 = T.let(T.unsafe(nil), Regexp)
+
+# TODO: buggy regexp
+#
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:23
+CodeRay::Scanners::CSS::RE::String2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:18
+CodeRay::Scanners::CSS::RE::Unicode = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/css.rb:36
+CodeRay::Scanners::CSS::RE::Unit = T.let(T.unsafe(nil), Regexp)
+
+# Clojure scanner by Licenser.
+#
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:6
+class CodeRay::Scanners::Clojure < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/clojure.rb:145
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:95
+CodeRay::Scanners::Clojure::BASIC_IDENTIFIER = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:133
+CodeRay::Scanners::Clojure::COMPLEX10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:134
+CodeRay::Scanners::Clojure::COMPLEX16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:136
+CodeRay::Scanners::Clojure::COMPLEX2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:135
+CodeRay::Scanners::Clojure::COMPLEX8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:16
+CodeRay::Scanners::Clojure::CORE_FORMS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:120
+CodeRay::Scanners::Clojure::DECIMAL = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:98
+CodeRay::Scanners::Clojure::DIGIT = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:99
+CodeRay::Scanners::Clojure::DIGIT10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:100
+CodeRay::Scanners::Clojure::DIGIT16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:102
+CodeRay::Scanners::Clojure::DIGIT2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:101
+CodeRay::Scanners::Clojure::DIGIT8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:107
+CodeRay::Scanners::Clojure::EXACTNESS = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:110
+CodeRay::Scanners::Clojure::EXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:109
+CodeRay::Scanners::Clojure::EXP_MARK = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:96
+CodeRay::Scanners::Clojure::IDENTIFIER = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:85
+CodeRay::Scanners::Clojure::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:129
+CodeRay::Scanners::Clojure::IMAG10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:130
+CodeRay::Scanners::Clojure::IMAG16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:132
+CodeRay::Scanners::Clojure::IMAG2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:131
+CodeRay::Scanners::Clojure::IMAG8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:90
+CodeRay::Scanners::Clojure::KEYWORD_NEXT_TOKEN_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:141
+CodeRay::Scanners::Clojure::NUM = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:137
+CodeRay::Scanners::Clojure::NUM10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:138
+CodeRay::Scanners::Clojure::NUM16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:140
+CodeRay::Scanners::Clojure::NUM2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:139
+CodeRay::Scanners::Clojure::NUM8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:78
+CodeRay::Scanners::Clojure::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:112
+CodeRay::Scanners::Clojure::PREFIX10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:113
+CodeRay::Scanners::Clojure::PREFIX16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:115
+CodeRay::Scanners::Clojure::PREFIX2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:114
+CodeRay::Scanners::Clojure::PREFIX8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:106
+CodeRay::Scanners::Clojure::RADIX10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:103
+CodeRay::Scanners::Clojure::RADIX16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:105
+CodeRay::Scanners::Clojure::RADIX2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:104
+CodeRay::Scanners::Clojure::RADIX8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:125
+CodeRay::Scanners::Clojure::REAL10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:126
+CodeRay::Scanners::Clojure::REAL16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:128
+CodeRay::Scanners::Clojure::REAL2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:127
+CodeRay::Scanners::Clojure::REAL8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:108
+CodeRay::Scanners::Clojure::SIGN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:11
+CodeRay::Scanners::Clojure::SPECIAL_FORMS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:111
+CodeRay::Scanners::Clojure::SUFFIX = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:97
+CodeRay::Scanners::Clojure::SYMBOL = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:116
+CodeRay::Scanners::Clojure::UINT10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:117
+CodeRay::Scanners::Clojure::UINT16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:119
+CodeRay::Scanners::Clojure::UINT2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:118
+CodeRay::Scanners::Clojure::UINT8 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:121
+CodeRay::Scanners::Clojure::UREAL10 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:122
+CodeRay::Scanners::Clojure::UREAL16 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:124
+CodeRay::Scanners::Clojure::UREAL2 = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/clojure.rb:123
+CodeRay::Scanners::Clojure::UREAL8 = T.let(T.unsafe(nil), Regexp)
+
+# = Debug Scanner
+#
+# Interprets the output of the Encoders::Debug encoder (basically the inverse function).
+#
+# pkg:gem/coderay#lib/coderay/scanners/debug.rb:9
+class CodeRay::Scanners::Debug < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/debug.rb:21
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/debug.rb:16
+ def setup; end
+end
+
+# Scanner for the Delphi language (Object Pascal).
+#
+# Alias: +pascal+
+#
+# pkg:gem/coderay#lib/coderay/scanners/delphi.rb:7
+class CodeRay::Scanners::Delphi < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/delphi.rb:45
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/delphi.rb:25
+CodeRay::Scanners::Delphi::DIRECTIVES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/delphi.rb:36
+CodeRay::Scanners::Delphi::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList::CaseIgnoring)
+
+# pkg:gem/coderay#lib/coderay/scanners/delphi.rb:12
+CodeRay::Scanners::Delphi::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/delphi.rb:40
+CodeRay::Scanners::Delphi::NAME_FOLLOWS = T.let(T.unsafe(nil), CodeRay::WordList::CaseIgnoring)
+
+# Scanner for output of the diff command.
+#
+# Alias: +patch+
+#
+# pkg:gem/coderay#lib/coderay/scanners/diff.rb:7
+class CodeRay::Scanners::Diff < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/diff.rb:19
+ def scan_tokens(encoder, options); end
+
+ private
+
+ # pkg:gem/coderay#lib/coderay/scanners/diff.rb:204
+ def diff(a, b); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/diff.rb:12
+CodeRay::Scanners::Diff::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# Scanner for HTML ERB templates.
+#
+# pkg:gem/coderay#lib/coderay/scanners/erb.rb:8
+class CodeRay::Scanners::ERB < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/erb.rb:38
+ def reset_instance; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/erb.rb:43
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/erb.rb:33
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/erb.rb:15
+CodeRay::Scanners::ERB::ERB_RUBY_BLOCK = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/erb.rb:13
+CodeRay::Scanners::ERB::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/erb.rb:27
+CodeRay::Scanners::ERB::START_OF_ERB = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:4
+class CodeRay::Scanners::Go < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/go.rb:50
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:45
+CodeRay::Scanners::Go::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:39
+CodeRay::Scanners::Go::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# http://golang.org/ref/spec#Keywords
+#
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:10
+CodeRay::Scanners::Go::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:29
+CodeRay::Scanners::Go::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:34
+CodeRay::Scanners::Go::PREDEFINED_FUNCTIONS = T.let(T.unsafe(nil), Array)
+
+# http://golang.org/ref/spec#Types
+#
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:19
+CodeRay::Scanners::Go::PREDEFINED_TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/go.rb:46
+CodeRay::Scanners::Go::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# Scanner for Groovy.
+#
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:7
+class CodeRay::Scanners::Groovy < ::CodeRay::Scanners::Java
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/groovy.rb:43
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/groovy.rb:39
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:24
+CodeRay::Scanners::Groovy::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# TODO: check list of keywords
+#
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:12
+CodeRay::Scanners::Groovy::GROOVY_KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:18
+CodeRay::Scanners::Groovy::GROOVY_MAGIC_VARIABLES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:20
+CodeRay::Scanners::Groovy::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:15
+CodeRay::Scanners::Groovy::KEYWORDS_EXPECTING_VALUE = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:26
+CodeRay::Scanners::Groovy::REGEXP_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# TODO: interpretation inside ', ", /
+#
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:29
+CodeRay::Scanners::Groovy::STRING_CONTENT_PATTERN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/groovy.rb:25
+CodeRay::Scanners::Groovy::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/haml.rb:8
+class CodeRay::Scanners::HAML < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/haml.rb:24
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/haml.rb:17
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/haml.rb:13
+CodeRay::Scanners::HAML::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# HTML Scanner
+#
+# Alias: +xhtml+
+#
+# See also: Scanners::XML
+#
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:9
+class CodeRay::Scanners::HTML < ::CodeRay::Scanners::Scanner
+ # pkg:gem/coderay#lib/coderay/scanners/html.rb:62
+ def reset; end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/html.rb:83
+ def scan_css(encoder, code, state = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/html.rb:76
+ def scan_java_script(encoder, code); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/html.rb:90
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/html.rb:70
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:39
+CodeRay::Scanners::HTML::ATTR_NAME = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:42
+CodeRay::Scanners::HTML::ENTITY = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:20
+CodeRay::Scanners::HTML::EVENT_ATTRIBUTES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:41
+CodeRay::Scanners::HTML::HEX = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:35
+CodeRay::Scanners::HTML::IN_ATTRIBUTE = T.let(T.unsafe(nil), CodeRay::WordList::CaseIgnoring)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:13
+CodeRay::Scanners::HTML::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:57
+CodeRay::Scanners::HTML::PLAIN_STRING_CONTENT = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/html.rb:40
+CodeRay::Scanners::HTML::TAG_END = T.let(T.unsafe(nil), Regexp)
+
+# Scanner for JSON (JavaScript Object Notation).
+#
+# pkg:gem/coderay#lib/coderay/scanners/json.rb:5
+class CodeRay::Scanners::JSON < ::CodeRay::Scanners::Scanner
+ protected
+
+ # See http://json.org/ for a definition of the JSON lexic/grammar.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/json.rb:26
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/json.rb:21
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/json.rb:15
+CodeRay::Scanners::JSON::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/json.rb:17
+CodeRay::Scanners::JSON::KEY = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/json.rb:10
+CodeRay::Scanners::JSON::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/json.rb:16
+CodeRay::Scanners::JSON::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# Scanner for Java.
+#
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:5
+class CodeRay::Scanners::Java < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/java.rb:51
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/java/builtin_types.rb:4
+module CodeRay::Scanners::Java::BuiltinTypes; end
+
+# :nocov:
+#
+# pkg:gem/coderay#lib/coderay/scanners/java/builtin_types.rb:7
+CodeRay::Scanners::Java::BuiltinTypes::List = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:19
+CodeRay::Scanners::Java::CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:25
+CodeRay::Scanners::Java::DIRECTIVES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:40
+CodeRay::Scanners::Java::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:47
+CodeRay::Scanners::Java::IDENT = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:30
+CodeRay::Scanners::Java::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# http://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html
+#
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:12
+CodeRay::Scanners::Java::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:20
+CodeRay::Scanners::Java::MAGIC_VARIABLES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:18
+CodeRay::Scanners::Java::RESERVED = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:42
+CodeRay::Scanners::Java::STRING_CONTENT_PATTERN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:21
+CodeRay::Scanners::Java::TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java.rb:41
+CodeRay::Scanners::Java::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# Scanner for JavaScript.
+#
+# Aliases: +ecmascript+, +ecma_script+, +javascript+
+#
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:7
+class CodeRay::Scanners::JavaScript < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/java_script.rb:224
+ def reset_instance; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/java_script.rb:61
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/java_script.rb:57
+ def setup; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/java_script.rb:229
+ def xml_scanner; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:42
+CodeRay::Scanners::JavaScript::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:36
+CodeRay::Scanners::JavaScript::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# The actual JavaScript keywords.
+#
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:13
+CodeRay::Scanners::JavaScript::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:24
+CodeRay::Scanners::JavaScript::KEYWORDS_EXPECTING_VALUE = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:50
+CodeRay::Scanners::JavaScript::KEY_CHECK_PATTERN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:22
+CodeRay::Scanners::JavaScript::MAGIC_VARIABLES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:18
+CodeRay::Scanners::JavaScript::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:44
+CodeRay::Scanners::JavaScript::REGEXP_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# Reserved for future use.
+#
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:29
+CodeRay::Scanners::JavaScript::RESERVED_WORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:45
+CodeRay::Scanners::JavaScript::STRING_CONTENT_PATTERN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/java_script.rb:43
+CodeRay::Scanners::JavaScript::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# Scanner for the Lua[http://lua.org] programming lanuage.
+#
+# The language’s complete syntax is defined in
+# {the Lua manual}[http://www.lua.org/manual/5.2/manual.html],
+# which is what this scanner tries to conform to.
+#
+# pkg:gem/coderay#lib/coderay/scanners/lua.rb:11
+class CodeRay::Scanners::Lua < ::CodeRay::Scanners::Scanner
+ protected
+
+ # CodeRay entry hook. Starts parsing.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/lua.rb:60
+ def scan_tokens(encoder, options); end
+
+ # Scanner initialization.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/lua.rb:54
+ def setup; end
+end
+
+# Automatic token kind selection for normal words.
+#
+# pkg:gem/coderay#lib/coderay/scanners/lua.rb:46
+CodeRay::Scanners::Lua::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# Keywords used in Lua.
+#
+# pkg:gem/coderay#lib/coderay/scanners/lua.rb:18
+CodeRay::Scanners::Lua::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# Constants set by the Lua core.
+#
+# pkg:gem/coderay#lib/coderay/scanners/lua.rb:25
+CodeRay::Scanners::Lua::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# The expressions contained in this array are parts of Lua’s `basic'
+# library. Although it’s not entirely necessary to load that library,
+# it is highly recommended and one would have to provide own implementations
+# of some of these expressions if one does not do so. They however aren’t
+# keywords, neither are they constants, but nearly predefined, so they
+# get tagged as `predefined' rather than anything else.
+#
+# This list excludes values of form `_UPPERCASE' because the Lua manual
+# requires such identifiers to be reserved by Lua anyway and they are
+# highlighted directly accordingly, without the need for specific
+# identifiers to be listed here.
+#
+# pkg:gem/coderay#lib/coderay/scanners/lua.rb:38
+CodeRay::Scanners::Lua::PREDEFINED_EXPRESSIONS = T.let(T.unsafe(nil), Array)
+
+# Scanner for PHP.
+#
+# Original by Stefan Walk.
+#
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:10
+class CodeRay::Scanners::PHP < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/php.rb:23
+ def reset_instance; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/php.rb:234
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/php.rb:19
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:15
+CodeRay::Scanners::PHP::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:197
+module CodeRay::Scanners::PHP::RE; end
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:211
+CodeRay::Scanners::PHP::RE::HTML_INDICATOR = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:213
+CodeRay::Scanners::PHP::RE::IDENTIFIER = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:216
+CodeRay::Scanners::PHP::RE::OPERATOR = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:206
+CodeRay::Scanners::PHP::RE::PHP_END = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:199
+CodeRay::Scanners::PHP::RE::PHP_START = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:214
+CodeRay::Scanners::PHP::RE::VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:28
+module CodeRay::Scanners::PHP::Words; end
+
+# according to http://php.net/quickref.php on 2009-04-21;
+# all functions with _ excluded (module functions) and selected additional functions
+#
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:50
+CodeRay::Scanners::PHP::Words::BUILTIN_FUNCTIONS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:46
+CodeRay::Scanners::PHP::Words::CLASSES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:145
+CodeRay::Scanners::PHP::Words::CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# TODO: more built-in PHP functions?
+#
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:140
+CodeRay::Scanners::PHP::Words::EXCEPTIONS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:184
+CodeRay::Scanners::PHP::Words::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList::CaseIgnoring)
+
+# according to http://www.php.net/manual/en/reserved.keywords.php
+#
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:31
+CodeRay::Scanners::PHP::Words::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:41
+CodeRay::Scanners::PHP::Words::LANGUAGE_CONSTRUCTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:178
+CodeRay::Scanners::PHP::Words::PREDEFINED = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:39
+CodeRay::Scanners::PHP::Words::TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/php.rb:193
+CodeRay::Scanners::PHP::Words::VARIABLE_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# Scanner for Python. Supports Python 3.
+#
+# Based on pygments' PythonLexer, see
+# http://dev.pocoo.org/projects/pygments/browser/pygments/lexers/agile.py.
+#
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:8
+class CodeRay::Scanners::Python < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/python.rb:103
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:86
+CodeRay::Scanners::Python::DEF_NEW_STATE = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:91
+CodeRay::Scanners::Python::DESCRIPTOR = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:97
+CodeRay::Scanners::Python::DOCSTRING_COMING = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:65
+CodeRay::Scanners::Python::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:57
+CodeRay::Scanners::Python::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:13
+CodeRay::Scanners::Python::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:64
+CodeRay::Scanners::Python::NAME = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:21
+CodeRay::Scanners::Python::OLD_KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:68
+CodeRay::Scanners::Python::OPERATOR = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:37
+CodeRay::Scanners::Python::PREDEFINED_EXCEPTIONS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:25
+CodeRay::Scanners::Python::PREDEFINED_METHODS_AND_TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:52
+CodeRay::Scanners::Python::PREDEFINED_VARIABLES_AND_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:82
+CodeRay::Scanners::Python::STRING_CONTENT_REGEXP = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:78
+CodeRay::Scanners::Python::STRING_DELIMITER_REGEXP = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/python.rb:66
+CodeRay::Scanners::Python::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# = Raydebug Scanner
+#
+# Highlights the output of the Encoders::Debug encoder.
+#
+# pkg:gem/coderay#lib/coderay/scanners/raydebug.rb:9
+class CodeRay::Scanners::Raydebug < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/raydebug.rb:22
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/raydebug.rb:17
+ def setup; end
+end
+
+# This scanner is really complex, since Ruby _is_ a complex language!
+#
+# It tries to highlight 100% of all common code,
+# and 90% of strange codes.
+#
+# It is optimized for HTML highlighting, and is not very useful for
+# parsing or pretty printing.
+#
+# pkg:gem/coderay#lib/coderay/scanners/ruby.rb:11
+class CodeRay::Scanners::Ruby < ::CodeRay::Scanners::Scanner
+ # pkg:gem/coderay#lib/coderay/scanners/ruby.rb:19
+ def interpreted_string_state; end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/ruby.rb:29
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/ruby.rb:25
+ def setup; end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:5
+module CodeRay::Scanners::Ruby::Patterns; end
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:72
+CodeRay::Scanners::Ruby::Patterns::BINARY = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:106
+CodeRay::Scanners::Ruby::Patterns::CHARACTER = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:55
+CodeRay::Scanners::Ruby::Patterns::CLASS_VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:96
+CodeRay::Scanners::Ruby::Patterns::CONTROL_META_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:132
+CodeRay::Scanners::Ruby::Patterns::DATA = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:69
+CodeRay::Scanners::Ruby::Patterns::DECIMAL = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:102
+CodeRay::Scanners::Ruby::Patterns::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:74
+CodeRay::Scanners::Ruby::Patterns::EXPONENT = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:168
+CodeRay::Scanners::Ruby::Patterns::FANCY_STRING_INTERPRETED = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:161
+CodeRay::Scanners::Ruby::Patterns::FANCY_STRING_KIND = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:160
+CodeRay::Scanners::Ruby::Patterns::FANCY_STRING_START = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:76
+CodeRay::Scanners::Ruby::Patterns::FLOAT_OR_INT = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:75
+CodeRay::Scanners::Ruby::Patterns::FLOAT_SUFFIX = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:57
+CodeRay::Scanners::Ruby::Patterns::GLOBAL_VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# NOTE: This is not completely correct, but
+# nobody needs heredoc delimiters ending with \n.
+#
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:116
+CodeRay::Scanners::Ruby::Patterns::HEREDOC_OPEN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:71
+CodeRay::Scanners::Ruby::Patterns::HEXADECIMAL = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:38
+CodeRay::Scanners::Ruby::Patterns::IDENT = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:28
+CodeRay::Scanners::Ruby::Patterns::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:54
+CodeRay::Scanners::Ruby::Patterns::INSTANCE_VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:7
+CodeRay::Scanners::Ruby::Patterns::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:151
+CodeRay::Scanners::Ruby::Patterns::KEYWORDS_EXPECTING_VALUE = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:32
+CodeRay::Scanners::Ruby::Patterns::KEYWORD_NEW_STATE = T.let(T.unsafe(nil), CodeRay::WordList)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:53
+CodeRay::Scanners::Ruby::Patterns::METHOD_AFTER_DOT = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:40
+CodeRay::Scanners::Ruby::Patterns::METHOD_NAME = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:52
+CodeRay::Scanners::Ruby::Patterns::METHOD_NAME_EX = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:41
+CodeRay::Scanners::Ruby::Patterns::METHOD_NAME_OPERATOR = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:87
+CodeRay::Scanners::Ruby::Patterns::METHOD_NAME_OR_SYMBOL = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:51
+CodeRay::Scanners::Ruby::Patterns::METHOD_SUFFIX = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:77
+CodeRay::Scanners::Ruby::Patterns::NUMERIC = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:56
+CodeRay::Scanners::Ruby::Patterns::OBJECT_VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:70
+CodeRay::Scanners::Ruby::Patterns::OCTAL = T.let(T.unsafe(nil), Regexp)
+
+# See http://murfy.de/ruby-constants.
+#
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:17
+CodeRay::Scanners::Ruby::Patterns::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:58
+CodeRay::Scanners::Ruby::Patterns::PREFIX_VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:61
+CodeRay::Scanners::Ruby::Patterns::QUOTE_TO_TYPE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:67
+CodeRay::Scanners::Ruby::Patterns::REGEXP_MODIFIERS = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:126
+CodeRay::Scanners::Ruby::Patterns::RUBYDOC = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:138
+CodeRay::Scanners::Ruby::Patterns::RUBYDOC_OR_DATA = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:89
+CodeRay::Scanners::Ruby::Patterns::SIMPLE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:79
+CodeRay::Scanners::Ruby::Patterns::SYMBOL = T.let(T.unsafe(nil), Regexp)
+
+# Checks for a valid value to follow. This enables
+# value_expected in method calls without parentheses.
+#
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:142
+CodeRay::Scanners::Ruby::Patterns::VALUE_FOLLOWS = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/patterns.rb:59
+CodeRay::Scanners::Ruby::Patterns::VARIABLE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/string_state.rb:8
+class CodeRay::Scanners::Ruby::StringState < ::Struct
+ # pkg:gem/coderay#lib/coderay/scanners/ruby/string_state.rb:48
+ def initialize(kind, interpreted, delim, heredoc = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/ruby/string_state.rb:63
+ def heredoc_pattern(delim, interpreted, indented); end
+
+ class << self
+ # pkg:gem/coderay#lib/coderay/scanners/ruby/string_state.rb:40
+ def simple_key_pattern(delim); end
+ end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/ruby/string_state.rb:10
+CodeRay::Scanners::Ruby::StringState::CLOSING_PAREN = T.let(T.unsafe(nil), Hash)
+
+# debug, if I try to change it with <<
+#
+# pkg:gem/coderay#lib/coderay/scanners/ruby/string_state.rb:17
+CodeRay::Scanners::Ruby::StringState::STRING_PATTERN = T.let(T.unsafe(nil), Hash)
+
+# by Josh Goebel
+#
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:5
+class CodeRay::Scanners::SQL < ::CodeRay::Scanners::Scanner
+ # pkg:gem/coderay#lib/coderay/scanners/sql.rb:66
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:23
+CodeRay::Scanners::SQL::COMMANDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:38
+CodeRay::Scanners::SQL::DIRECTIVES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:55
+CodeRay::Scanners::SQL::ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:46
+CodeRay::Scanners::SQL::IDENT_KIND = T.let(T.unsafe(nil), CodeRay::WordList::CaseIgnoring)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:9
+CodeRay::Scanners::SQL::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:18
+CodeRay::Scanners::SQL::OBJECTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:44
+CodeRay::Scanners::SQL::PREDEFINED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:36
+CodeRay::Scanners::SQL::PREDEFINED_FUNCTIONS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:28
+CodeRay::Scanners::SQL::PREDEFINED_TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:60
+CodeRay::Scanners::SQL::STRING_CONTENT_PATTERN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:58
+CodeRay::Scanners::SQL::STRING_PREFIXES = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/coderay#lib/coderay/scanners/sql.rb:56
+CodeRay::Scanners::SQL::UNICODE_ESCAPE = T.let(T.unsafe(nil), Regexp)
+
+# A scanner for Sass.
+#
+# pkg:gem/coderay#lib/coderay/scanners/sass.rb:5
+class CodeRay::Scanners::Sass < ::CodeRay::Scanners::CSS
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/sass.rb:16
+ def scan_tokens(encoder, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/sass.rb:12
+ def setup; end
+end
+
+# = Scanner
+#
+# The base class for all Scanners.
+#
+# It is a subclass of Ruby's great +StringScanner+, which
+# makes it easy to access the scanning methods inside.
+#
+# It is also +Enumerable+, so you can use it like an Array of
+# Tokens:
+#
+# require 'coderay'
+#
+# c_scanner = CodeRay::Scanners[:c].new "if (*p == '{') nest++;"
+#
+# for text, kind in c_scanner
+# puts text if kind == :operator
+# end
+#
+# # prints: (*==)++;
+#
+# OK, this is a very simple example :)
+# You can also use +map+, +any?+, +find+ and even +sort_by+,
+# if you want.
+#
+# pkg:gem/coderay#lib/coderay/scanners/scanner.rb:29
+class CodeRay::Scanners::Scanner < ::StringScanner
+ include ::Enumerable
+ extend ::CodeRay::Plugin
+
+ # Create a new Scanner.
+ #
+ # * +code+ is the input String and is handled by the superclass
+ # StringScanner.
+ # * +options+ is a Hash with Symbols as keys.
+ # It is merged with the default options of the class (you can
+ # overwrite default options here.)
+ #
+ # Else, a Tokens object is used.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:125
+ def initialize(code = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # The string in binary encoding.
+ #
+ # To be used with #pos, which is the index of the byte the scanner
+ # will scan next.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:218
+ def binary_string; end
+
+ # The current column position of the scanner, starting with 1.
+ # See also: #line.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:209
+ def column(pos = T.unsafe(nil)); end
+
+ # Traverse the tokens.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:192
+ def each(&block); end
+
+ # the default file extension for this scanner
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:160
+ def file_extension; end
+
+ # the Plugin ID for this scanner
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:155
+ def lang; end
+
+ # The current line position of the scanner, starting with 1.
+ # See also: #column.
+ #
+ # Beware, this is implemented inefficiently. It should be used
+ # for debugging only.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:202
+ def line(pos = T.unsafe(nil)); end
+
+ # Sets back the scanner. Subclasses should redefine the reset_instance
+ # method instead of this one.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:142
+ def reset; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:44
+ def state; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:44
+ def state=(_arg0); end
+
+ # Set a new string to be scanned.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:148
+ def string=(code); end
+
+ # Scan the code and returns all tokens in a Tokens object.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:165
+ def tokenize(source = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # Cache the result of tokenize.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:187
+ def tokens; end
+
+ protected
+
+ # Scanner error with additional status information
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:314
+ def raise_inspect(message, tokens, state = T.unsafe(nil), ambit = T.unsafe(nil), backtrace = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:289
+ def raise_inspect_arguments(message, tokens, state, ambit); end
+
+ # Resets the scanner.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:265
+ def reset_instance; end
+
+ # Shorthand for scan_until(/\z/).
+ # This method also avoids a JRuby 1.9 mode bug.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:328
+ def scan_rest; end
+
+ # This is the central method, and commonly the only one a
+ # subclass implements.
+ #
+ # Subclasses must implement this method; it must return +tokens+
+ # and must only use Tokens#<< for storing scanned tokens!
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:260
+ def scan_tokens(tokens, options); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:305
+ def scanner_state_info(state); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:239
+ def set_string_from_source(source); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:250
+ def set_tokens_from_options(options); end
+
+ # Can be implemented by subclasses to do some initialization
+ # that has to be done once per instance.
+ #
+ # Use reset for initialization that has to be done once per
+ # scan.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:236
+ def setup; end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:322
+ def tokens_last(tokens, n); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:318
+ def tokens_size(tokens); end
+
+ class << self
+ # The encoding used internally by this scanner.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:71
+ def encoding(name = T.unsafe(nil)); end
+
+ # The typical filename suffix for this scanner's language.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:66
+ def file_extension(extension = T.unsafe(nil)); end
+
+ # The lang of this Scanner class, which is equal to its Plugin ID.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:76
+ def lang; end
+
+ # Normalizes the given code into a string with UNIX newlines, in the
+ # scanner's internal encoding, with invalid and undefined charachters
+ # replaced by placeholders. Always returns a new object.
+ #
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:51
+ def normalize(code); end
+
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:82
+ def encode_with_encoding(code, target_encoding); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:100
+ def guess_encoding(s); end
+
+ # pkg:gem/coderay#lib/coderay/scanners/scanner.rb:96
+ def to_unix(code); end
+ end
+end
+
+# The default options for all scanner classes.
+#
+# Define @default_options for subclasses.
+#
+# pkg:gem/coderay#lib/coderay/scanners/scanner.rb:40
+CodeRay::Scanners::Scanner::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/scanners/scanner.rb:42
+CodeRay::Scanners::Scanner::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/coderay#lib/coderay/helpers/plugin.rb:41
+CodeRay::Scanners::Scanner::PLUGIN_HOST = CodeRay::Scanners
+
+# pkg:gem/coderay#lib/coderay/scanners/scanner.rb:299
+CodeRay::Scanners::Scanner::SCANNER_STATE_INFO = T.let(T.unsafe(nil), String)
+
+# pkg:gem/coderay#lib/coderay/scanners/scanner.rb:271
+CodeRay::Scanners::Scanner::SCAN_ERROR_MESSAGE = T.let(T.unsafe(nil), String)
+
+# Raised if a Scanner fails while scanning
+#
+# pkg:gem/coderay#lib/coderay/scanners/scanner.rb:35
+class CodeRay::Scanners::Scanner::ScanError < ::StandardError; end
+
+# pkg:gem/coderay#lib/coderay/scanners/taskpaper.rb:4
+class CodeRay::Scanners::Taskpaper < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/taskpaper.rb:11
+ def scan_tokens(encoder, options); end
+end
+
+# Scanner for plain text.
+#
+# Yields just one token of the kind :plain.
+#
+# Alias: +plaintext+, +plain+
+#
+# pkg:gem/coderay#lib/coderay/scanners/text.rb:9
+class CodeRay::Scanners::Text < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/text.rb:18
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/text.rb:14
+CodeRay::Scanners::Text::KINDS_NOT_LOC = T.let(T.unsafe(nil), Array)
+
+# Scanner for XML.
+#
+# Currently this is the same scanner as Scanners::HTML.
+#
+# pkg:gem/coderay#lib/coderay/scanners/xml.rb:9
+class CodeRay::Scanners::XML < ::CodeRay::Scanners::HTML; end
+
+# Scanner for YAML.
+#
+# Based on the YAML scanner from Syntax by Jamis Buck.
+#
+# pkg:gem/coderay#lib/coderay/scanners/yaml.rb:7
+class CodeRay::Scanners::YAML < ::CodeRay::Scanners::Scanner
+ protected
+
+ # pkg:gem/coderay#lib/coderay/scanners/yaml.rb:16
+ def scan_tokens(encoder, options); end
+end
+
+# pkg:gem/coderay#lib/coderay/scanners/yaml.rb:12
+CodeRay::Scanners::YAML::KINDS_NOT_LOC = T.let(T.unsafe(nil), Symbol)
+
+# This module holds the Style class and its subclasses.
+#
+# See Plugin.
+#
+# pkg:gem/coderay#lib/coderay/styles.rb:6
+module CodeRay::Styles
+ extend ::CodeRay::PluginHost
+end
+
+# A colorful theme using CSS 3 colors (with alpha channel).
+#
+# pkg:gem/coderay#lib/coderay/styles/alpha.rb:5
+class CodeRay::Styles::Alpha < ::CodeRay::Styles::Style; end
+
+# pkg:gem/coderay#lib/coderay/styles/alpha.rb:14
+CodeRay::Styles::Alpha::CSS_MAIN_STYLES = T.let(T.unsafe(nil), String)
+
+# pkg:gem/coderay#lib/coderay/styles/alpha.rb:53
+CodeRay::Styles::Alpha::TOKEN_COLORS = T.let(T.unsafe(nil), String)
+
+# Base class for styles.
+#
+# Styles are used by Encoders::HTML to colorize tokens.
+#
+# pkg:gem/coderay#lib/coderay/styles/style.rb:8
+class CodeRay::Styles::Style
+ extend ::CodeRay::Plugin
+end
+
+# pkg:gem/coderay#lib/coderay/styles/style.rb:12
+CodeRay::Styles::Style::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/coderay#lib/coderay/helpers/plugin.rb:41
+CodeRay::Styles::Style::PLUGIN_HOST = CodeRay::Styles
+
+# A Hash of all known token kinds and their associated CSS classes.
+#
+# pkg:gem/coderay#lib/coderay/token_kinds.rb:4
+CodeRay::TokenKinds = T.let(T.unsafe(nil), Hash)
+
+# The Tokens class represents a list of tokens returned from
+# a Scanner. It's actually just an Array with a few helper methods.
+#
+# A token itself is not a special object, just two elements in an Array:
+# * the _token_ _text_ (the original source of the token in a String) or
+# a _token_ _action_ (begin_group, end_group, begin_line, end_line)
+# * the _token_ _kind_ (a Symbol representing the type of the token)
+#
+# It looks like this:
+#
+# ..., '# It looks like this', :comment, ...
+# ..., '3.1415926', :float, ...
+# ..., '$^', :error, ...
+#
+# Some scanners also yield sub-tokens, represented by special
+# token actions, for example :begin_group and :end_group.
+#
+# The Ruby scanner, for example, splits "a string" into:
+#
+# [
+# :begin_group, :string,
+# '"', :delimiter,
+# 'a string', :content,
+# '"', :delimiter,
+# :end_group, :string
+# ]
+#
+# Tokens can be used to save the output of a Scanners in a simple
+# Ruby object that can be send to an Encoder later:
+#
+# tokens = CodeRay.scan('price = 2.59', :ruby).tokens
+# tokens.encode(:html)
+# tokens.html
+# CodeRay.encoder(:html).encode_tokens(tokens)
+#
+# Tokens gives you the power to handle pre-scanned code very easily:
+# You can serialize it to a JSON string and store it in a database, pass it
+# around to encode it more than once, send it to other algorithms...
+#
+# pkg:gem/coderay#lib/coderay/tokens.rb:41
+class CodeRay::Tokens < ::Array
+ # pkg:gem/coderay#lib/coderay/tokens.rb:156
+ def begin_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/tokens.rb:158
+ def begin_line(kind); end
+
+ # Return the actual number of tokens.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:151
+ def count; end
+
+ # Encode the tokens using encoder.
+ #
+ # encoder can be
+ # * a plugin name like :html oder 'statistic'
+ # * an Encoder object
+ #
+ # options are passed to the encoder.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:56
+ def encode(encoder, options = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/tokens.rb:157
+ def end_group(kind); end
+
+ # pkg:gem/coderay#lib/coderay/tokens.rb:159
+ def end_line(kind); end
+
+ # Redirects unknown methods to encoder calls.
+ #
+ # For example, if you call +tokens.html+, the HTML encoder
+ # is used to highlight the tokens.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:70
+ def method_missing(meth, options = T.unsafe(nil)); end
+
+ # The Scanner instance that created the tokens.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:47
+ def scanner; end
+
+ # The Scanner instance that created the tokens.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:47
+ def scanner=(_arg0); end
+
+ # Split the tokens into parts of the given +sizes+.
+ #
+ # The result will be an Array of Tokens objects. The parts have
+ # the text size specified by the parameter. In addition, each
+ # part closes all opened tokens. This is useful to insert tokens
+ # betweem them.
+ #
+ # This method is used by @Scanner#tokenize@ when called with an Array
+ # of source strings. The Diff encoder uses it for inline highlighting.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:85
+ def split_into_parts(*sizes); end
+
+ # pkg:gem/coderay#lib/coderay/tokens.rb:155
+ def text_token(*_arg0); end
+
+ # Turn tokens into a string by concatenating them.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens.rb:62
+ def to_s; end
+
+ # pkg:gem/coderay#lib/coderay/tokens.rb:160
+ def tokens(*_arg0); end
+end
+
+# The result of a scan operation is a TokensProxy, but should act like Tokens.
+#
+# This proxy makes it possible to use the classic CodeRay.scan.encode API
+# while still providing the benefits of direct streaming.
+#
+# pkg:gem/coderay#lib/coderay/tokens_proxy.rb:7
+class CodeRay::TokensProxy
+ # Create a new TokensProxy with the arguments of CodeRay.scan.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:12
+ def initialize(input, lang, options = T.unsafe(nil), block = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def block; end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def block=(_arg0); end
+
+ # Overwrite Struct#each.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:48
+ def each(*args, &blk); end
+
+ # Call CodeRay.encode if +encoder+ is a Symbol;
+ # otherwise, convert the receiver to tokens and call encoder.encode_tokens.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:21
+ def encode(encoder, options = T.unsafe(nil)); end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def input; end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def input=(_arg0); end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def lang; end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def lang=(_arg0); end
+
+ # Tries to call encode;
+ # delegates to tokens otherwise.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:31
+ def method_missing(method, *args, &blk); end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def options; end
+
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:9
+ def options=(_arg0); end
+
+ # A (cached) scanner instance to use for the scan task.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:43
+ def scanner; end
+
+ # The (cached) result of the tokenized input; a Tokens instance.
+ #
+ # pkg:gem/coderay#lib/coderay/tokens_proxy.rb:38
+ def tokens; end
+end
+
+# pkg:gem/coderay#lib/coderay/version.rb:2
+CodeRay::VERSION = T.let(T.unsafe(nil), String)
+
+# = WordList
+#
+#
A Hash subclass designed for mapping word lists to token types.
+#
+# A WordList is a Hash with some additional features.
+# It is intended to be used for keyword recognition.
+#
+# WordList is optimized to be used in Scanners,
+# typically to decide whether a given ident is a special token.
+#
+# For case insensitive words use WordList::CaseIgnoring.
+#
+# Example:
+#
+# # define word arrays
+# RESERVED_WORDS = %w[
+# asm break case continue default do else
+# ]
+#
+# PREDEFINED_TYPES = %w[
+# int long short char void
+# ]
+#
+# # make a WordList
+# IDENT_KIND = WordList.new(:ident).
+# add(RESERVED_WORDS, :reserved).
+# add(PREDEFINED_TYPES, :predefined_type)
+#
+# ...
+#
+# def scan_tokens tokens, options
+# ...
+#
+# elsif scan(/[A-Za-z_][A-Za-z_0-9]*/)
+# # use it
+# kind = IDENT_KIND[match]
+# ...
+#
+# pkg:gem/coderay#lib/coderay/helpers/word_list.rb:40
+class CodeRay::WordList < ::Hash
+ # Create a new WordList with +default+ as default value.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/word_list.rb:43
+ def initialize(default = T.unsafe(nil)); end
+
+ # Add words to the list and associate them with +value+.
+ #
+ # Returns +self+, so you can concat add calls.
+ #
+ # pkg:gem/coderay#lib/coderay/helpers/word_list.rb:50
+ def add(words, value = T.unsafe(nil)); end
+end
+
+# A CaseIgnoring WordList is like a WordList, only that
+# keys are compared case-insensitively (normalizing keys using +downcase+).
+#
+# pkg:gem/coderay#lib/coderay/helpers/word_list.rb:60
+class CodeRay::WordList::CaseIgnoring < ::CodeRay::WordList
+ # pkg:gem/coderay#lib/coderay/helpers/word_list.rb:62
+ def [](key); end
+
+ # pkg:gem/coderay#lib/coderay/helpers/word_list.rb:66
+ def []=(key, value); end
+end
diff --git a/sorbet/rbi/gems/concurrent-ruby@1.3.8.rbi b/sorbet/rbi/gems/concurrent-ruby@1.3.8.rbi
new file mode 100644
index 0000000..ac8bf9c
--- /dev/null
+++ b/sorbet/rbi/gems/concurrent-ruby@1.3.8.rbi
@@ -0,0 +1,10591 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `concurrent-ruby` gem.
+# Please instead update this file by running `bin/tapioca gem concurrent-ruby`.
+
+
+# {include:file:README.md}
+# load native parts first
+# load native parts first
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/constants.rb:1
+module Concurrent
+ extend ::Concurrent::Utility::EngineDetector
+ extend ::Concurrent::Utility::NativeExtensionLoader
+ extend ::Concurrent::Concern::Logging
+ extend ::Concurrent::Concern::Deprecation
+
+ private
+
+ # Abort a currently running transaction - see `Concurrent::atomically`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:139
+ def abort_transaction; end
+
+ # Run a block that reads and writes `TVar`s as a single atomic transaction.
+ # With respect to the value of `TVar` objects, the transaction is atomic, in
+ # that it either happens or it does not, consistent, in that the `TVar`
+ # objects involved will never enter an illegal state, and isolated, in that
+ # transactions never interfere with each other. You may recognise these
+ # properties from database transactions.
+ #
+ # There are some very important and unusual semantics that you must be aware of:
+ #
+ # * Most importantly, the block that you pass to atomically may be executed
+ # more than once. In most cases your code should be free of
+ # side-effects, except for via TVar.
+ #
+ # * If an exception escapes an atomically block it will abort the transaction.
+ #
+ # * It is undefined behaviour to use callcc or Fiber with atomically.
+ #
+ # * If you create a new thread within an atomically, it will not be part of
+ # the transaction. Creating a thread counts as a side-effect.
+ #
+ # Transactions within transactions are flattened to a single transaction.
+ #
+ # @example
+ # a = new TVar(100_000)
+ # b = new TVar(100)
+ #
+ # Concurrent::atomically do
+ # a.value -= 10
+ # b.value += 10
+ # end
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:82
+ def atomically; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:56
+ def call_dataflow(method, executor, *inputs, &block); end
+
+ # Dataflow allows you to create a task that will be scheduled when all of its data dependencies are available.
+ # {include:file:docs-source/dataflow.md}
+ #
+ # @param [Future] inputs zero or more `Future` operations that this dataflow depends upon
+ #
+ # @yield The operation to perform once all the dependencies are met
+ # @yieldparam [Future] inputs each of the `Future` inputs to the dataflow
+ # @yieldreturn [Object] the result of the block operation
+ #
+ # @return [Object] the result of all the operations
+ #
+ # @raise [ArgumentError] if no block is given
+ # @raise [ArgumentError] if any of the inputs are not `IVar`s
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:34
+ def dataflow(*inputs, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:44
+ def dataflow!(*inputs, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:39
+ def dataflow_with(executor, *inputs, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:49
+ def dataflow_with!(executor, *inputs, &block); end
+
+ # Leave a transaction without committing or aborting - see `Concurrent::atomically`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:144
+ def leave_transaction; end
+
+ # @!macro monotonic_get_time
+ #
+ # Returns the current time as tracked by the application monotonic clock.
+ #
+ # @param [Symbol] unit the time unit to be returned, can be either
+ # :float_second, :float_millisecond, :float_microsecond, :second,
+ # :millisecond, :microsecond, or :nanosecond default to :float_second.
+ #
+ # @return [Float] The current monotonic time since some unspecified
+ # starting point
+ #
+ # @!macro monotonic_clock_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/monotonic_time.rb:15
+ def monotonic_time(unit = T.unsafe(nil)); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:148
+ def abort_transaction; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:148
+ def atomically; end
+
+ # Number of processors cores available for process scheduling.
+ # This method takes in account the CPU quota if the process is inside a cgroup with a
+ # dedicated CPU quota (typically Docker).
+ # Otherwise it returns the same value as #processor_count but as a Float.
+ #
+ # For performance reasons the calculated value will be memoized on the first
+ # call.
+ #
+ # @return [Float] number of available processors
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:194
+ def available_processor_count; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:80
+ def call_dataflow(method, executor, *inputs, &block); end
+
+ # The maximum number of processors cores available for process scheduling.
+ # Returns `nil` if there is no enforced limit, or a `Float` if the
+ # process is inside a cgroup with a dedicated CPU quota (typically Docker).
+ #
+ # Note that nothing prevents setting a CPU quota higher than the actual number of
+ # cores on the system.
+ #
+ # For performance reasons the calculated value will be memoized on the first
+ # call.
+ #
+ # @return [nil, Float] Maximum number of available processors as set by a cgroup CPU quota, or nil if none set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:209
+ def cpu_quota; end
+
+ # The CPU shares requested by the process. For performance reasons the calculated
+ # value will be memoized on the first call.
+ #
+ # @return [Float, nil] CPU shares requested by the process, or nil if not set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:217
+ def cpu_shares; end
+
+ # Create a simple logger with provided level and output.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:38
+ def create_simple_logger(level = T.unsafe(nil), output = T.unsafe(nil)); end
+
+ # Create a stdlib logger with provided level and output.
+ # If you use this deprecated method you might need to add logger to your Gemfile to avoid warnings from Ruby 3.3.5+.
+ # @deprecated
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:73
+ def create_stdlib_logger(level = T.unsafe(nil), output = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:37
+ def dataflow(*inputs, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:47
+ def dataflow!(*inputs, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:42
+ def dataflow_with(executor, *inputs, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:52
+ def dataflow_with!(executor, *inputs, &block); end
+
+ # Disables AtExit handlers including pool auto-termination handlers.
+ # When disabled it will be the application programmer's responsibility
+ # to ensure that the handlers are shutdown properly prior to application
+ # exit by calling `AtExit.run` method.
+ #
+ # @note this option should be needed only because of `at_exit` ordering
+ # issues which may arise when running some of the testing frameworks.
+ # E.g. Minitest's test-suite runs itself in `at_exit` callback which
+ # executes after the pools are already terminated. Then auto termination
+ # needs to be disabled and called manually after test-suite ends.
+ # @note This method should *never* be called
+ # from within a gem. It should *only* be used from within the main
+ # application and even then it should be used only when necessary.
+ # @deprecated Has no effect since it is no longer needed, see https://github.com/ruby-concurrency/concurrent-ruby/pull/841.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:48
+ def disable_at_exit_handlers!; end
+
+ # General access point to global executors.
+ # @param [Symbol, Executor] executor_identifier symbols:
+ # - :fast - {Concurrent.global_fast_executor}
+ # - :io - {Concurrent.global_io_executor}
+ # - :immediate - {Concurrent.global_immediate_executor}
+ # @return [Executor]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:83
+ def executor(executor_identifier); end
+
+ # Global thread pool optimized for short, fast *operations*.
+ #
+ # @return [ThreadPoolExecutor] the thread pool
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:55
+ def global_fast_executor; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:66
+ def global_immediate_executor; end
+
+ # Global thread pool optimized for long, blocking (IO) *tasks*.
+ #
+ # @return [ThreadPoolExecutor] the thread pool
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:62
+ def global_io_executor; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:114
+ def global_logger; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:118
+ def global_logger=(value); end
+
+ # Global thread pool user for global *timers*.
+ #
+ # @return [Concurrent::TimerSet] the thread pool
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:73
+ def global_timer_set; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:148
+ def leave_transaction; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/monotonic_time.rb:18
+ def monotonic_time(unit = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/lock_local_var.rb:7
+ def mutex_owned_per_thread?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:87
+ def new_fast_executor(opts = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:98
+ def new_io_executor(opts = T.unsafe(nil)); end
+
+ # Number of physical processor cores on the current system. For performance
+ # reasons the calculated value will be memoized on the first call.
+ #
+ # On Windows the Win32 API will be queried for the `NumberOfCores from
+ # Win32_Processor`. This will return the total number "of cores for the
+ # current instance of the processor." On Unix-like operating systems either
+ # the `hwprefs` or `sysctl` utility will be called in a subshell and the
+ # returned value will be used. In the rare case where none of these methods
+ # work or an exception is raised the function will simply return 1.
+ #
+ # @return [Integer] number physical processor cores on the current system
+ #
+ # @see https://github.com/grosser/parallel/blob/4fc8b89d08c7091fe0419ca8fba1ec3ce5a8d185/lib/parallel.rb
+ #
+ # @see http://msdn.microsoft.com/en-us/library/aa394373(v=vs.85).aspx
+ # @see http://www.unix.com/man-page/osx/1/HWPREFS/
+ # @see http://linux.die.net/man/8/sysctl
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:181
+ def physical_processor_count; end
+
+ # Number of processors seen by the OS and used for process scheduling. For
+ # performance reasons the calculated value will be memoized on the first
+ # call.
+ #
+ # When running under JRuby the Java runtime call
+ # `java.lang.Runtime.getRuntime.availableProcessors` will be used. According
+ # to the Java documentation this "value may change during a particular
+ # invocation of the virtual machine... [applications] should therefore
+ # occasionally poll this property." We still memoize this value once under
+ # JRuby.
+ #
+ # Otherwise Ruby's Etc.nprocessors will be used.
+ #
+ # @return [Integer] number of processors seen by the OS or Java runtime
+ #
+ # @see http://docs.oracle.com/javase/6/docs/api/java/lang/Runtime.html#availableProcessors()
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:160
+ def processor_count; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:142
+ def processor_counter; end
+
+ # Use logger created by #create_simple_logger to log concurrent-ruby messages.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:66
+ def use_simple_logger(level = T.unsafe(nil), output = T.unsafe(nil)); end
+
+ # Use logger created by #create_stdlib_logger to log concurrent-ruby messages.
+ # @deprecated
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:101
+ def use_stdlib_logger(level = T.unsafe(nil), output = T.unsafe(nil)); end
+ end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:38
+class Concurrent::AbstractExchanger < ::Concurrent::Synchronization::Object
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:44
+ def initialize; end
+
+ # @!macro exchanger_method_do_exchange
+ #
+ # Waits for another thread to arrive at this exchange point (unless the
+ # current thread is interrupted), and then transfers the given object to
+ # it, receiving its object in return. The timeout value indicates the
+ # approximate number of seconds the method should block while waiting
+ # for the exchange. When the timeout value is `nil` the method will
+ # block indefinitely.
+ #
+ # @param [Object] value the value to exchange with another thread
+ # @param [Numeric, nil] timeout in seconds, `nil` blocks indefinitely
+ #
+ # @!macro exchanger_method_exchange
+ #
+ # In some edge cases when a `timeout` is given a return value of `nil` may be
+ # ambiguous. Specifically, if `nil` is a valid value in the exchange it will
+ # be impossible to tell whether `nil` is the actual return value or if it
+ # signifies timeout. When `nil` is a valid value in the exchange consider
+ # using {#exchange!} or {#try_exchange} instead.
+ #
+ # @return [Object] the value exchanged by the other thread or `nil` on timeout
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:69
+ def exchange(value, timeout = T.unsafe(nil)); end
+
+ # @!macro exchanger_method_do_exchange
+ # @!macro exchanger_method_exchange_bang
+ #
+ # On timeout a {Concurrent::TimeoutError} exception will be raised.
+ #
+ # @return [Object] the value exchanged by the other thread
+ # @raise [Concurrent::TimeoutError] on timeout
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:80
+ def exchange!(value, timeout = T.unsafe(nil)); end
+
+ # @!macro exchanger_method_do_exchange
+ # @!macro exchanger_method_try_exchange
+ #
+ # The return value will be a {Concurrent::Maybe} set to `Just` on success or
+ # `Nothing` on timeout.
+ #
+ # @return [Concurrent::Maybe] on success a `Just` maybe will be returned with
+ # the item exchanged by the other thread as `#value`; on timeout a
+ # `Nothing` maybe will be returned with {Concurrent::TimeoutError} as `#reason`
+ #
+ # @example
+ #
+ # exchanger = Concurrent::Exchanger.new
+ #
+ # result = exchanger.exchange(:foo, 0.5)
+ #
+ # if result.just?
+ # puts result.value #=> :bar
+ # else
+ # puts 'timeout'
+ # end
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:109
+ def try_exchange(value, timeout = T.unsafe(nil)); end
+
+ private
+
+ # @!macro exchanger_method_do_exchange
+ #
+ # @return [Object, CANCEL] the value exchanged by the other thread; {CANCEL} on timeout
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:122
+ def do_exchange(value, timeout); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:41
+Concurrent::AbstractExchanger::CANCEL = T.let(T.unsafe(nil), Object)
+
+# @!macro abstract_executor_service_public_api
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:10
+class Concurrent::AbstractExecutorService < ::Concurrent::Synchronization::LockableObject
+ include ::Concurrent::Concern::Logging
+ include ::Concurrent::ExecutorService
+ include ::Concurrent::Concern::Deprecation
+
+ # Create a new thread pool.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:23
+ def initialize(opts = T.unsafe(nil), &block); end
+
+ # @!macro executor_service_method_auto_terminate_setter
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:72
+ def auto_terminate=(value); end
+
+ # @!macro executor_service_method_auto_terminate_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:67
+ def auto_terminate?; end
+
+ # @!macro executor_service_attr_reader_fallback_policy
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:18
+ def fallback_policy; end
+
+ # @!macro executor_service_method_kill
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:42
+ def kill; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:20
+ def name; end
+
+ # @!macro executor_service_method_running_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:52
+ def running?; end
+
+ # @!macro executor_service_method_shutdown
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:37
+ def shutdown; end
+
+ # @!macro executor_service_method_shutdown_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:62
+ def shutdown?; end
+
+ # @!macro executor_service_method_shuttingdown_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:57
+ def shuttingdown?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:32
+ def to_s; end
+
+ # @!macro executor_service_method_wait_for_termination
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:47
+ def wait_for_termination(timeout = T.unsafe(nil)); end
+
+ private
+
+ # Returns an action which executes the `fallback_policy` once the queue
+ # size reaches `max_queue`. The reason for the indirection of an action
+ # is so that the work can be deferred outside of synchronization.
+ #
+ # @param [Array] args the arguments to the task which is being handled.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:85
+ def fallback_action(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:126
+ def ns_auto_terminate?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:106
+ def ns_execute(*args, &task); end
+
+ # @!macro executor_service_method_ns_kill_execution
+ #
+ # Callback method called when the executor has been killed.
+ # The default behavior is to do nothing.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:122
+ def ns_kill_execution; end
+
+ # @!macro executor_service_method_ns_shutdown_execution
+ #
+ # Callback method called when an orderly shutdown has completed.
+ # The default behavior is to signal all waiting threads.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:114
+ def ns_shutdown_execution; end
+end
+
+# The set of possible fallback policies that may be set at thread pool creation.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/abstract_executor_service.rb:15
+Concurrent::AbstractExecutorService::FALLBACK_POLICIES = T.let(T.unsafe(nil), Array)
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# An abstract implementation of local storage, with sub-classes for
+# per-thread and per-fiber locals.
+#
+# Each execution context (EC, thread or fiber) has a lazily initialized array
+# of local variable values. Each time a new local variable is created, we
+# allocate an "index" for it.
+#
+# For example, if the allocated index is 1, that means slot #1 in EVERY EC's
+# locals array will be used for the value of that variable.
+#
+# The good thing about using a per-EC structure to hold values, rather than
+# a global, is that no synchronization is needed when reading and writing
+# those values (since the structure is only ever accessed by a single
+# thread).
+#
+# Of course, when a local variable is GC'd, 1) we need to recover its index
+# for use by other new local variables (otherwise the locals arrays could
+# get bigger and bigger with time), and 2) we need to null out all the
+# references held in the now-unused slots (both to avoid blocking GC of those
+# objects, and also to prevent "stale" values from being passed on to a new
+# local when the index is reused).
+#
+# Because we need to null out freed slots, we need to keep references to
+# ALL the locals arrays, so we can null out the appropriate slots in all of
+# them. This is why we need to use a finalizer to clean up the locals array
+# when the EC goes out of scope.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:35
+class Concurrent::AbstractLocals
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:36
+ def initialize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:89
+ def fetch(index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:71
+ def free_index(index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:55
+ def next_index(local); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:102
+ def set(index, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:43
+ def synchronize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:48
+ def weak_synchronize; end
+
+ private
+
+ # When the local goes out of scope, clean up that slot across all locals currently assigned.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:112
+ def local_finalizer(index); end
+
+ # Returns the locals for the current scope, or nil if none exist.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:128
+ def locals; end
+
+ # Returns the locals for the current scope, creating them if necessary.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:133
+ def locals!; end
+
+ # When a thread/fiber goes out of scope, remove the array from @all_arrays.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:119
+ def thread_fiber_finalizer(array_object_id); end
+end
+
+# `Agent` is inspired by Clojure's [agent](http://clojure.org/agents)
+# function. An agent is a shared, mutable variable providing independent,
+# uncoordinated, *asynchronous* change of individual values. Best used when
+# the value will undergo frequent, complex updates. Suitable when the result
+# of an update does not need to be known immediately. `Agent` is (mostly)
+# functionally equivalent to Clojure's agent, except where the runtime
+# prevents parity.
+#
+# Agents are reactive, not autonomous - there is no imperative message loop
+# and no blocking receive. The state of an Agent should be itself immutable
+# and the `#value` of an Agent is always immediately available for reading by
+# any thread without any messages, i.e. observation does not require
+# cooperation or coordination.
+#
+# Agent action dispatches are made using the various `#send` methods. These
+# methods always return immediately. At some point later, in another thread,
+# the following will happen:
+#
+# 1. The given `action` will be applied to the state of the Agent and the
+# `args`, if any were supplied.
+# 2. The return value of `action` will be passed to the validator lambda,
+# if one has been set on the Agent.
+# 3. If the validator succeeds or if no validator was given, the return value
+# of the given `action` will become the new `#value` of the Agent. See
+# `#initialize` for details.
+# 4. If any observers were added to the Agent, they will be notified. See
+# `#add_observer` for details.
+# 5. If during the `action` execution any other dispatches are made (directly
+# or indirectly), they will be held until after the `#value` of the Agent
+# has been changed.
+#
+# If any exceptions are thrown by an action function, no nested dispatches
+# will occur, and the exception will be cached in the Agent itself. When an
+# Agent has errors cached, any subsequent interactions will immediately throw
+# an exception, until the agent's errors are cleared. Agent errors can be
+# examined with `#error` and the agent restarted with `#restart`.
+#
+# The actions of all Agents get interleaved amongst threads in a thread pool.
+# At any point in time, at most one action for each Agent is being executed.
+# Actions dispatched to an agent from another single agent or thread will
+# occur in the order they were sent, potentially interleaved with actions
+# dispatched to the same agent from other sources. The `#send` method should
+# be used for actions that are CPU limited, while the `#send_off` method is
+# appropriate for actions that may block on IO.
+#
+# Unlike in Clojure, `Agent` cannot participate in `Concurrent::TVar` transactions.
+#
+# ## Example
+#
+# ```
+# def next_fibonacci(set = nil)
+# return [0, 1] if set.nil?
+# set + [set[-2..-1].reduce{|sum,x| sum + x }]
+# end
+#
+# # create an agent with an initial value
+# agent = Concurrent::Agent.new(next_fibonacci)
+#
+# # send a few update requests
+# 5.times do
+# agent.send{|set| next_fibonacci(set) }
+# end
+#
+# # wait for them to complete
+# agent.await
+#
+# # get the current value
+# agent.value #=> [0, 1, 1, 2, 3, 5, 8]
+# ```
+#
+# ## Observation
+#
+# Agents support observers through the {Concurrent::Observable} mixin module.
+# Notification of observers occurs every time an action dispatch returns and
+# the new value is successfully validated. Observation will *not* occur if the
+# action raises an exception, if validation fails, or when a {#restart} occurs.
+#
+# When notified the observer will receive three arguments: `time`, `old_value`,
+# and `new_value`. The `time` argument is the time at which the value change
+# occurred. The `old_value` is the value of the Agent when the action began
+# processing. The `new_value` is the value to which the Agent was set when the
+# action completed. Note that `old_value` and `new_value` may be the same.
+# This is not an error. It simply means that the action returned the same
+# value.
+#
+# ## Nested Actions
+#
+# It is possible for an Agent action to post further actions back to itself.
+# The nested actions will be enqueued normally then processed *after* the
+# outer action completes, in the order they were sent, possibly interleaved
+# with action dispatches from other threads. Nested actions never deadlock
+# with one another and a failure in a nested action will never affect the
+# outer action.
+#
+# Nested actions can be called using the Agent reference from the enclosing
+# scope or by passing the reference in as a "send" argument. Nested actions
+# cannot be post using `self` from within the action block/proc/lambda; `self`
+# in this context will not reference the Agent. The preferred method for
+# dispatching nested actions is to pass the Agent as an argument. This allows
+# Ruby to more effectively manage the closing scope.
+#
+# Prefer this:
+#
+# ```
+# agent = Concurrent::Agent.new(0)
+# agent.send(agent) do |value, this|
+# this.send {|v| v + 42 }
+# 3.14
+# end
+# agent.value #=> 45.14
+# ```
+#
+# Over this:
+#
+# ```
+# agent = Concurrent::Agent.new(0)
+# agent.send do |value|
+# agent.send {|v| v + 42 }
+# 3.14
+# end
+# ```
+#
+# @!macro agent_await_warning
+#
+# **NOTE** Never, *under any circumstances*, call any of the "await" methods
+# ({#await}, {#await_for}, {#await_for!}, and {#wait}) from within an action
+# block/proc/lambda. The call will block the Agent and will always fail.
+# Calling either {#await} or {#wait} (with a timeout of `nil`) will
+# hopelessly deadlock the Agent with no possibility of recovery.
+#
+# @!macro thread_safe_variable_comparison
+#
+# @see http://clojure.org/Agents Clojure Agents
+# @see http://clojure.org/state Values and Change - Clojure's approach to Identity and State
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:145
+class Concurrent::Agent < ::Concurrent::Synchronization::LockableObject
+ include ::Concurrent::Concern::Observable
+
+ # Create a new `Agent` with the given initial value and options.
+ #
+ # The `:validator` option must be `nil` or a side-effect free proc/lambda
+ # which takes one argument. On any intended value change the validator, if
+ # provided, will be called. If the new value is invalid the validator should
+ # return `false` or raise an error.
+ #
+ # The `:error_handler` option must be `nil` or a proc/lambda which takes two
+ # arguments. When an action raises an error or validation fails, either by
+ # returning false or raising an error, the error handler will be called. The
+ # arguments to the error handler will be a reference to the agent itself and
+ # the error object which was raised.
+ #
+ # The `:error_mode` may be either `:continue` (the default if an error
+ # handler is given) or `:fail` (the default if error handler nil or not
+ # given).
+ #
+ # If an action being run by the agent throws an error or doesn't pass
+ # validation the error handler, if present, will be called. After the
+ # handler executes if the error mode is `:continue` the Agent will continue
+ # as if neither the action that caused the error nor the error itself ever
+ # happened.
+ #
+ # If the mode is `:fail` the Agent will become {#failed?} and will stop
+ # accepting new action dispatches. Any previously queued actions will be
+ # held until {#restart} is called. The {#value} method will still work,
+ # returning the value of the Agent before the error.
+ #
+ # @param [Object] initial the initial value
+ # @param [Hash] opts the configuration options
+ #
+ # @option opts [Symbol] :error_mode either `:continue` or `:fail`
+ # @option opts [nil, Proc] :error_handler the (optional) error handler
+ # @option opts [nil, Proc] :validator the (optional) validation procedure
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:220
+ def initialize(initial, opts = T.unsafe(nil)); end
+
+ # Dispatches an action to the Agent and returns immediately. Subsequently,
+ # in a thread from a thread pool, the {#value} will be set to the return
+ # value of the action. Appropriate for actions that may block on IO.
+ #
+ # @param [Proc] action the action dispatch to be enqueued
+ # @return [Concurrent::Agent] self
+ # @see #send_off
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:331
+ def <<(action); end
+
+ # Blocks the current thread (indefinitely!) until all actions dispatched
+ # thus far, from this thread or nested by the Agent, have occurred. Will
+ # block when {#failed?}. Will never return if a failed Agent is {#restart}
+ # with `:clear_actions` true.
+ #
+ # Returns a reference to `self` to support method chaining:
+ #
+ # ```
+ # current_value = agent.await.value
+ # ```
+ #
+ # @return [Boolean] self
+ #
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:350
+ def await; end
+
+ # Blocks the current thread until all actions dispatched thus far, from this
+ # thread or nested by the Agent, have occurred, or the timeout (in seconds)
+ # has elapsed.
+ #
+ # @param [Float] timeout the maximum number of seconds to wait
+ # @return [Boolean] true if all actions complete before timeout else false
+ #
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:363
+ def await_for(timeout); end
+
+ # Blocks the current thread until all actions dispatched thus far, from this
+ # thread or nested by the Agent, have occurred, or the timeout (in seconds)
+ # has elapsed.
+ #
+ # @param [Float] timeout the maximum number of seconds to wait
+ # @return [Boolean] true if all actions complete before timeout
+ #
+ # @raise [Concurrent::TimeoutError] when timeout is reached
+ #
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:377
+ def await_for!(timeout); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:233
+ def deref; end
+
+ # When {#failed?} and {#error_mode} is `:fail`, returns the error object
+ # which caused the failure, else `nil`. When {#error_mode} is `:continue`
+ # will *always* return `nil`.
+ #
+ # @return [nil, Error] the error which caused the failure when {#failed?}
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:240
+ def error; end
+
+ # The error mode this Agent is operating in. See {#initialize} for details.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:184
+ def error_mode; end
+
+ # Is the Agent in a failed state?
+ #
+ # @see #restart
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:402
+ def failed?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:298
+ def post(*args, &action); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:244
+ def reason; end
+
+ # When an Agent is {#failed?}, changes the Agent {#value} to `new_value`
+ # then un-fails the Agent so that action dispatches are allowed again. If
+ # the `:clear_actions` option is give and true, any actions queued on the
+ # Agent that were being held while it was failed will be discarded,
+ # otherwise those held actions will proceed. The `new_value` must pass the
+ # validator if any, or `restart` will raise an exception and the Agent will
+ # remain failed with its old {#value} and {#error}. Observers, if any, will
+ # not be notified of the new state.
+ #
+ # @param [Object] new_value the new value for the Agent once restarted
+ # @param [Hash] opts the configuration options
+ # @option opts [Symbol] :clear_actions true if all enqueued but unprocessed
+ # actions should be discarded on restart, else false (default: false)
+ # @return [Boolean] true
+ #
+ # @raise [Concurrent:AgentError] when not failed
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:424
+ def restart(new_value, opts = T.unsafe(nil)); end
+
+ # @!macro agent_send
+ #
+ # Dispatches an action to the Agent and returns immediately. Subsequently,
+ # in a thread from a thread pool, the {#value} will be set to the return
+ # value of the action. Action dispatches are only allowed when the Agent
+ # is not {#failed?}.
+ #
+ # The action must be a block/proc/lambda which takes 1 or more arguments.
+ # The first argument is the current {#value} of the Agent. Any arguments
+ # passed to the send method via the `args` parameter will be passed to the
+ # action as the remaining arguments. The action must return the new value
+ # of the Agent.
+ #
+ # * {#send} and {#send!} should be used for actions that are CPU limited
+ # * {#send_off}, {#send_off!}, and {#<<} are appropriate for actions that
+ # may block on IO
+ # * {#send_via} and {#send_via!} are used when a specific executor is to
+ # be used for the action
+ #
+ # @param [Array
] args zero or more arguments to be passed to
+ # the action
+ # @param [Proc] action the action dispatch to be enqueued
+ #
+ # @yield [agent, value, *args] process the old value and return the new
+ # @yieldparam [Object] value the current {#value} of the Agent
+ # @yieldparam [Array] args zero or more arguments to pass to the
+ # action
+ # @yieldreturn [Object] the new value of the Agent
+ #
+ # @!macro send_return
+ # @return [Boolean] true if the action is successfully enqueued, false if
+ # the Agent is {#failed?}
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:278
+ def send(*args, &action); end
+
+ # @!macro agent_send
+ #
+ # @!macro send_bang_return_and_raise
+ # @return [Boolean] true if the action is successfully enqueued
+ # @raise [Concurrent::Agent::Error] if the Agent is {#failed?}
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:287
+ def send!(*args, &action); end
+
+ # @!macro agent_send
+ # @!macro send_return
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:294
+ def send_off(*args, &action); end
+
+ # @!macro agent_send
+ # @!macro send_bang_return_and_raise
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:302
+ def send_off!(*args, &action); end
+
+ # @!macro agent_send
+ # @!macro send_return
+ # @param [Concurrent::ExecutorService] executor the executor on which the
+ # action is to be dispatched
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:311
+ def send_via(executor, *args, &action); end
+
+ # @!macro agent_send
+ # @!macro send_bang_return_and_raise
+ # @param [Concurrent::ExecutorService] executor the executor on which the
+ # action is to be dispatched
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:319
+ def send_via!(executor, *args, &action); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:406
+ def stopped?; end
+
+ # The current value (state) of the Agent, irrespective of any pending or
+ # in-progress actions. The value is always available and is non-blocking.
+ #
+ # @return [Object] the current value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:229
+ def value; end
+
+ # Blocks the current thread until all actions dispatched thus far, from this
+ # thread or nested by the Agent, have occurred, or the timeout (in seconds)
+ # has elapsed. Will block indefinitely when timeout is nil or not given.
+ #
+ # Provided mainly for consistency with other classes in this library. Prefer
+ # the various `await` methods instead.
+ #
+ # @param [Float] timeout the maximum number of seconds to wait
+ # @return [Boolean] true if all actions complete before timeout else false
+ #
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:393
+ def wait(timeout = T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:510
+ def enqueue_action_job(action, args, executor); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:516
+ def enqueue_await_job(latch); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:543
+ def execute_next_job; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:576
+ def handle_error(error); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:529
+ def ns_enqueue_job(job, index = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:584
+ def ns_find_last_job_for_thread; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:490
+ def ns_initialize(initial, opts); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:539
+ def ns_post_next_job; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:570
+ def ns_validate(value); end
+
+ class << self
+ # Blocks the current thread (indefinitely!) until all actions dispatched
+ # thus far to all the given Agents, from this thread or nested by the
+ # given Agents, have occurred. Will block when any of the agents are
+ # failed. Will never return if a failed Agent is restart with
+ # `:clear_actions` true.
+ #
+ # @param [Array] agents the Agents on which to wait
+ # @return [Boolean] true
+ #
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:449
+ def await(*agents); end
+
+ # Blocks the current thread until all actions dispatched thus far to all
+ # the given Agents, from this thread or nested by the given Agents, have
+ # occurred, or the timeout (in seconds) has elapsed.
+ #
+ # @param [Float] timeout the maximum number of seconds to wait
+ # @param [Array] agents the Agents on which to wait
+ # @return [Boolean] true if all actions complete before timeout else false
+ #
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:463
+ def await_for(timeout, *agents); end
+
+ # Blocks the current thread until all actions dispatched thus far to all
+ # the given Agents, from this thread or nested by the given Agents, have
+ # occurred, or the timeout (in seconds) has elapsed.
+ #
+ # @param [Float] timeout the maximum number of seconds to wait
+ # @param [Array] agents the Agents on which to wait
+ # @return [Boolean] true if all actions complete before timeout
+ #
+ # @raise [Concurrent::TimeoutError] when timeout is reached
+ # @!macro agent_await_warning
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:482
+ def await_for!(timeout, *agents); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:154
+Concurrent::Agent::AWAIT_ACTION = T.let(T.unsafe(nil), Proc)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:151
+Concurrent::Agent::AWAIT_FLAG = T.let(T.unsafe(nil), Object)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:157
+Concurrent::Agent::DEFAULT_ERROR_HANDLER = T.let(T.unsafe(nil), Proc)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:160
+Concurrent::Agent::DEFAULT_VALIDATOR = T.let(T.unsafe(nil), Proc)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:148
+Concurrent::Agent::ERROR_MODES = T.let(T.unsafe(nil), Array)
+
+# Raised during action processing or any other time in an Agent's lifecycle.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:167
+class Concurrent::Agent::Error < ::StandardError
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:168
+ def initialize(message = T.unsafe(nil)); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+class Concurrent::Agent::Job < ::Struct
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def action; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def action=(_); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def args; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def args=(_); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def caller; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def caller=(_); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def executor; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def executor=(_); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def [](*_arg0); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def keyword_init?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def members; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:163
+ def new(*_arg0); end
+ end
+end
+
+# Raised when a new value obtained during action processing or at `#restart`
+# fails validation.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:176
+class Concurrent::Agent::ValidationError < ::Concurrent::Agent::Error
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/agent.rb:177
+ def initialize(message = T.unsafe(nil)); end
+end
+
+# @!macro concurrent_array
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/array.rb:53
+class Concurrent::Array < ::Array; end
+
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/array.rb:22
+Concurrent::ArrayImplementation = Array
+
+# A mixin module that provides simple asynchronous behavior to a class,
+# turning it into a simple actor. Loosely based on Erlang's
+# [gen_server](http://www.erlang.org/doc/man/gen_server.html), but without
+# supervision or linking.
+#
+# A more feature-rich {Concurrent::Actor} is also available when the
+# capabilities of `Async` are too limited.
+#
+# ```cucumber
+# Feature:
+# As a stateful, plain old Ruby class
+# I want safe, asynchronous behavior
+# So my long-running methods don't block the main thread
+# ```
+#
+# The `Async` module is a way to mix simple yet powerful asynchronous
+# capabilities into any plain old Ruby object or class, turning each object
+# into a simple Actor. Method calls are processed on a background thread. The
+# caller is free to perform other actions while processing occurs in the
+# background.
+#
+# Method calls to the asynchronous object are made via two proxy methods:
+# `async` (alias `cast`) and `await` (alias `call`). These proxy methods post
+# the method call to the object's background thread and return a "future"
+# which will eventually contain the result of the method call.
+#
+# This behavior is loosely patterned after Erlang's `gen_server` behavior.
+# When an Erlang module implements the `gen_server` behavior it becomes
+# inherently asynchronous. The `start` or `start_link` function spawns a
+# process (similar to a thread but much more lightweight and efficient) and
+# returns the ID of the process. Using the process ID, other processes can
+# send messages to the `gen_server` via the `cast` and `call` methods. Unlike
+# Erlang's `gen_server`, however, `Async` classes do not support linking or
+# supervision trees.
+#
+# ## Basic Usage
+#
+# When this module is mixed into a class, objects of the class become inherently
+# asynchronous. Each object gets its own background thread on which to post
+# asynchronous method calls. Asynchronous method calls are executed in the
+# background one at a time in the order they are received.
+#
+# To create an asynchronous class, simply mix in the `Concurrent::Async` module:
+#
+# ```
+# class Hello
+# include Concurrent::Async
+#
+# def hello(name)
+# "Hello, #{name}!"
+# end
+# end
+# ```
+#
+# Mixing this module into a class provides each object two proxy methods:
+# `async` and `await`. These methods are thread safe with respect to the
+# enclosing object. The former proxy allows methods to be called
+# asynchronously by posting to the object's internal thread. The latter proxy
+# allows a method to be called synchronously but does so safely with respect
+# to any pending asynchronous method calls and ensures proper ordering. Both
+# methods return a {Concurrent::IVar} which can be inspected for the result
+# of the proxied method call. Calling a method with `async` will return a
+# `:pending` `IVar` whereas `await` will return a `:complete` `IVar`.
+#
+# ```
+# class Echo
+# include Concurrent::Async
+#
+# def echo(msg)
+# print "#{msg}\n"
+# end
+# end
+#
+# horn = Echo.new
+# horn.echo('zero') # synchronous, not thread-safe
+# # returns the actual return value of the method
+#
+# horn.async.echo('one') # asynchronous, non-blocking, thread-safe
+# # returns an IVar in the :pending state
+#
+# horn.await.echo('two') # synchronous, blocking, thread-safe
+# # returns an IVar in the :complete state
+# ```
+#
+# ## Let It Fail
+#
+# The `async` and `await` proxy methods have built-in error protection based
+# on Erlang's famous "let it fail" philosophy. Instance methods should not be
+# programmed defensively. When an exception is raised by a delegated method
+# the proxy will rescue the exception, expose it to the caller as the `reason`
+# attribute of the returned future, then process the next method call.
+#
+# ## Calling Methods Internally
+#
+# External method calls should *always* use the `async` and `await` proxy
+# methods. When one method calls another method, the `async` proxy should
+# rarely be used and the `await` proxy should *never* be used.
+#
+# When an object calls one of its own methods using the `await` proxy the
+# second call will be enqueued *behind* the currently running method call.
+# Any attempt to wait on the result will fail as the second call will never
+# run until after the current call completes.
+#
+# Calling a method using the `await` proxy from within a method that was
+# itself called using `async` or `await` will irreversibly deadlock the
+# object. Do *not* do this, ever.
+#
+# ## Instance Variables and Attribute Accessors
+#
+# Instance variables do not need to be thread-safe so long as they are private.
+# Asynchronous method calls are processed in the order they are received and
+# are processed one at a time. Therefore private instance variables can only
+# be accessed by one thread at a time. This is inherently thread-safe.
+#
+# When using private instance variables within asynchronous methods, the best
+# practice is to read the instance variable into a local variable at the start
+# of the method then update the instance variable at the *end* of the method.
+# This way, should an exception be raised during method execution the internal
+# state of the object will not have been changed.
+#
+# ### Reader Attributes
+#
+# The use of `attr_reader` is discouraged. Internal state exposed externally,
+# when necessary, should be done through accessor methods. The instance
+# variables exposed by these methods *must* be thread-safe, or they must be
+# called using the `async` and `await` proxy methods. These two approaches are
+# subtly different.
+#
+# When internal state is accessed via the `async` and `await` proxy methods,
+# the returned value represents the object's state *at the time the call is
+# processed*, which may *not* be the state of the object at the time the call
+# is made.
+#
+# To get the state *at the current* time, irrespective of an enqueued method
+# calls, a reader method must be called directly. This is inherently unsafe
+# unless the instance variable is itself thread-safe, preferably using one
+# of the thread-safe classes within this library. Because the thread-safe
+# classes within this library are internally-locking or non-locking, they can
+# be safely used from within asynchronous methods without causing deadlocks.
+#
+# Generally speaking, the best practice is to *not* expose internal state via
+# reader methods. The best practice is to simply use the method's return value.
+#
+# ### Writer Attributes
+#
+# Writer attributes should never be used with asynchronous classes. Changing
+# the state externally, even when done in the thread-safe way, is not logically
+# consistent. Changes to state need to be timed with respect to all asynchronous
+# method calls which my be in-process or enqueued. The only safe practice is to
+# pass all necessary data to each method as arguments and let the method update
+# the internal state as necessary.
+#
+# ## Class Constants, Variables, and Methods
+#
+# ### Class Constants
+#
+# Class constants do not need to be thread-safe. Since they are read-only and
+# immutable they may be safely read both externally and from within
+# asynchronous methods.
+#
+# ### Class Variables
+#
+# Class variables should be avoided. Class variables represent shared state.
+# Shared state is anathema to concurrency. Should there be a need to share
+# state using class variables they *must* be thread-safe, preferably
+# using the thread-safe classes within this library. When updating class
+# variables, never assign a new value/object to the variable itself. Assignment
+# is not thread-safe in Ruby. Instead, use the thread-safe update functions
+# of the variable itself to change the value.
+#
+# The best practice is to *never* use class variables with `Async` classes.
+#
+# ### Class Methods
+#
+# Class methods which are pure functions are safe. Class methods which modify
+# class variables should be avoided, for all the reasons listed above.
+#
+# ## An Important Note About Thread Safe Guarantees
+#
+# > Thread safe guarantees can only be made when asynchronous method calls
+# > are not mixed with direct method calls. Use only direct method calls
+# > when the object is used exclusively on a single thread. Use only
+# > `async` and `await` when the object is shared between threads. Once you
+# > call a method using `async` or `await`, you should no longer call methods
+# > directly on the object. Use `async` and `await` exclusively from then on.
+#
+# @example
+#
+# class Echo
+# include Concurrent::Async
+#
+# def echo(msg)
+# print "#{msg}\n"
+# end
+# end
+#
+# horn = Echo.new
+# horn.echo('zero') # synchronous, not thread-safe
+# # returns the actual return value of the method
+#
+# horn.async.echo('one') # asynchronous, non-blocking, thread-safe
+# # returns an IVar in the :pending state
+#
+# horn.await.echo('two') # synchronous, blocking, thread-safe
+# # returns an IVar in the :complete state
+#
+# @see Concurrent::Actor
+# @see https://en.wikipedia.org/wiki/Actor_model "Actor Model" at Wikipedia
+# @see http://www.erlang.org/doc/man/gen_server.html Erlang gen_server
+# @see http://c2.com/cgi/wiki?LetItCrash "Let It Crash" at http://c2.com/
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:217
+module Concurrent::Async
+ mixes_in_class_methods ::Concurrent::Async::ClassMethods
+
+ # Causes the chained method call to be performed asynchronously on the
+ # object's thread. The delegated method will return a future in the
+ # `:pending` state and the method call will have been scheduled on the
+ # object's thread. The final disposition of the method call can be obtained
+ # by inspecting the returned future.
+ #
+ # @!macro async_thread_safety_warning
+ # @note The method call is guaranteed to be thread safe with respect to
+ # all other method calls against the same object that are called with
+ # either `async` or `await`. The mutable nature of Ruby references
+ # (and object orientation in general) prevent any other thread safety
+ # guarantees. Do NOT mix direct method calls with delegated method calls.
+ # Use *only* delegated method calls when sharing the object between threads.
+ #
+ # @return [Concurrent::IVar] the pending result of the asynchronous operation
+ #
+ # @raise [NameError] the object does not respond to the requested method
+ # @raise [ArgumentError] the given `args` do not match the arity of
+ # the requested method
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:412
+ def async; end
+
+ # Causes the chained method call to be performed synchronously on the
+ # current thread. The delegated will return a future in either the
+ # `:fulfilled` or `:rejected` state and the delegated method will have
+ # completed. The final disposition of the delegated method can be obtained
+ # by inspecting the returned future.
+ #
+ # @!macro async_thread_safety_warning
+ #
+ # @return [Concurrent::IVar] the completed result of the synchronous operation
+ #
+ # @raise [NameError] the object does not respond to the requested method
+ # @raise [ArgumentError] the given `args` do not match the arity of the
+ # requested method
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:430
+ def await; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:433
+ def call; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:415
+ def cast; end
+
+ # Initialize the internal serializer and other stnchronization mechanisms.
+ #
+ # @note This method *must* be called immediately upon object construction.
+ # This is the only way thread-safe initialization can be guaranteed.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:441
+ def init_synchronization; end
+
+ class << self
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:262
+ def included(base); end
+
+ # Check for the presence of a method on an object and determine if a given
+ # set of arguments matches the required arity.
+ #
+ # @param [Object] obj the object to check against
+ # @param [Symbol] method the method to check the object for
+ # @param [Array] args zero or more arguments for the arity check
+ #
+ # @raise [NameError] the object does not respond to `method` method
+ # @raise [ArgumentError] the given `args` do not match the arity of `method`
+ #
+ # @note This check is imperfect because of the way Ruby reports the arity of
+ # methods with a variable number of arguments. It is possible to determine
+ # if too few arguments are given but impossible to determine if too many
+ # arguments are given. This check may also fail to recognize dynamic behavior
+ # of the object, such as methods simulated with `method_missing`.
+ #
+ # @see http://www.ruby-doc.org/core-2.1.1/Method.html#method-i-arity Method#arity
+ # @see http://ruby-doc.org/core-2.1.0/Object.html#method-i-respond_to-3F Object#respond_to?
+ # @see http://www.ruby-doc.org/core-2.1.0/BasicObject.html#method-i-method_missing BasicObject#method_missing
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:250
+ def validate_argc(obj, method, *args); end
+ end
+end
+
+# Delegates asynchronous, thread-safe method calls to the wrapped object.
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:282
+class Concurrent::Async::AsyncDelegator < ::Concurrent::Synchronization::LockableObject
+ # Create a new delegator object wrapping the given delegate.
+ #
+ # @param [Object] delegate the object to wrap and delegate method calls to
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:288
+ def initialize(delegate); end
+
+ # Delegates method calls to the wrapped object.
+ #
+ # @param [Symbol] method the method being called
+ # @param [Array] args zero or more arguments to the method
+ #
+ # @return [IVar] the result of the method call
+ #
+ # @raise [NameError] the object does not respond to `method` method
+ # @raise [ArgumentError] the given `args` do not match the arity of `method`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:305
+ def method_missing(method, *args, &block); end
+
+ # Perform all enqueued tasks.
+ #
+ # This method must be called from within the executor. It must not be
+ # called while already running. It will loop until the queue is empty.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:330
+ def perform; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:348
+ def reset_if_forked; end
+
+ private
+
+ # Check whether the method is responsive
+ #
+ # @param [Symbol] method the method being called
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:322
+ def respond_to_missing?(method, include_private = T.unsafe(nil)); end
+end
+
+# Delegates synchronous, thread-safe method calls to the wrapped object.
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:360
+class Concurrent::Async::AwaitDelegator
+ # Create a new delegator object wrapping the given delegate.
+ #
+ # @param [AsyncDelegator] delegate the object to wrap and delegate method calls to
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:365
+ def initialize(delegate); end
+
+ # Delegates method calls to the wrapped object.
+ #
+ # @param [Symbol] method the method being called
+ # @param [Array] args zero or more arguments to the method
+ #
+ # @return [IVar] the result of the method call
+ #
+ # @raise [NameError] the object does not respond to `method` method
+ # @raise [ArgumentError] the given `args` do not match the arity of `method`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:378
+ def method_missing(method, *args, &block); end
+
+ private
+
+ # Check whether the method is responsive
+ #
+ # @param [Symbol] method the method being called
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:387
+ def respond_to_missing?(method, include_private = T.unsafe(nil)); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:269
+module Concurrent::Async::ClassMethods
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/async.rb:270
+ def new(*args, **_arg1, &block); end
+end
+
+# Atoms provide a way to manage shared, synchronous, independent state.
+#
+# An atom is initialized with an initial value and an optional validation
+# proc. At any time the value of the atom can be synchronously and safely
+# changed. If a validator is given at construction then any new value
+# will be checked against the validator and will be rejected if the
+# validator returns false or raises an exception.
+#
+# There are two ways to change the value of an atom: {#compare_and_set} and
+# {#swap}. The former will set the new value if and only if it validates and
+# the current value matches the new value. The latter will atomically set the
+# new value to the result of running the given block if and only if that
+# value validates.
+#
+# ## Example
+#
+# ```
+# def next_fibonacci(set = nil)
+# return [0, 1] if set.nil?
+# set + [set[-2..-1].reduce{|sum,x| sum + x }]
+# end
+#
+# # create an atom with an initial value
+# atom = Concurrent::Atom.new(next_fibonacci)
+#
+# # send a few update requests
+# 5.times do
+# atom.swap{|set| next_fibonacci(set) }
+# end
+#
+# # get the current value
+# atom.value #=> [0, 1, 1, 2, 3, 5, 8]
+# ```
+#
+# ## Observation
+#
+# Atoms support observers through the {Concurrent::Observable} mixin module.
+# Notification of observers occurs every time the value of the Atom changes.
+# When notified the observer will receive three arguments: `time`, `old_value`,
+# and `new_value`. The `time` argument is the time at which the value change
+# occurred. The `old_value` is the value of the Atom when the change began
+# The `new_value` is the value to which the Atom was set when the change
+# completed. Note that `old_value` and `new_value` may be the same. This is
+# not an error. It simply means that the change operation returned the same
+# value.
+#
+# Unlike in Clojure, `Atom` cannot participate in {Concurrent::TVar} transactions.
+#
+# @!macro thread_safe_variable_comparison
+#
+# @see http://clojure.org/atoms Clojure Atoms
+# @see http://clojure.org/state Values and Change - Clojure's approach to Identity and State
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:95
+class Concurrent::Atom < ::Concurrent::Synchronization::Object
+ include ::Concurrent::Concern::Observable
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # Create a new atom with the given initial value.
+ #
+ # @param [Object] value The initial value
+ # @param [Hash] opts The options used to configure the atom
+ # @option opts [Proc] :validator (nil) Optional proc used to validate new
+ # values. It must accept one and only one argument which will be the
+ # intended new value. The validator will return true if the new value
+ # is acceptable else return false (preferably) or raise an exception.
+ #
+ # @!macro deref_options
+ #
+ # @raise [ArgumentError] if the validator is not a `Proc` (when given)
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:121
+ def initialize(value, opts = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:99
+ def __initialize_atomic_fields__; end
+
+ # Atomically sets the value of atom to the new value if and only if the
+ # current value of the atom is identical to the old value and the new
+ # value successfully validates against the (optional) validator given
+ # at construction.
+ #
+ # @param [Object] old_value The expected current value.
+ # @param [Object] new_value The intended new value.
+ #
+ # @return [Boolean] True if the value is changed else false.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:181
+ def compare_and_set(old_value, new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:102
+ def deref; end
+
+ # Atomically sets the value of atom to the new value without regard for the
+ # current value so long as the new value successfully validates against the
+ # (optional) validator given at construction.
+ #
+ # @param [Object] new_value The intended new value.
+ #
+ # @return [Object] The final value of the atom after all operations and
+ # validations are complete.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:198
+ def reset(new_value); end
+
+ # Atomically swaps the value of atom using the given block. The current
+ # value will be passed to the block, as will any arguments passed as
+ # arguments to the function. The new value will be validated against the
+ # (optional) validator proc given at construction. If validation fails the
+ # value will not be changed.
+ #
+ # Internally, {#swap} reads the current value, applies the block to it, and
+ # attempts to compare-and-set it in. Since another thread may have changed
+ # the value in the intervening time, it may have to retry, and does so in a
+ # spin loop. The net effect is that the value will always be the result of
+ # the application of the supplied block to a current value, atomically.
+ # However, because the block might be called multiple times, it must be free
+ # of side effects.
+ #
+ # @note The given block may be called multiple times, and thus should be free
+ # of side effects.
+ #
+ # @param [Object] args Zero or more arguments passed to the block.
+ #
+ # @yield [value, args] Calculates a new value for the atom based on the
+ # current value and any supplied arguments.
+ # @yieldparam value [Object] The current value of the atom.
+ # @yieldparam args [Object] All arguments passed to the function, in order.
+ # @yieldreturn [Object] The intended new value of the atom.
+ #
+ # @return [Object] The final value of the atom after all operations and
+ # validations are complete.
+ #
+ # @raise [ArgumentError] When no block is given.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:157
+ def swap(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:99
+ def value; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:99
+ def compare_and_set_value(expected, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:99
+ def swap_value(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:99
+ def update_value(&block); end
+
+ # Is the new value valid?
+ #
+ # @param [Object] new_value The intended new value.
+ # @return [Boolean] false if the validator function returns false or raises
+ # an exception else true
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:216
+ def valid?(new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atom.rb:99
+ def value=(value); end
+end
+
+# @!macro atomic_boolean
+#
+# A boolean value that can be updated atomically. Reads and writes to an atomic
+# boolean and thread-safe and guaranteed to succeed. Reads and writes may block
+# briefly but no explicit locking is required.
+#
+# @!macro thread_safe_variable_comparison
+#
+# Performance:
+#
+# ```
+# Testing with ruby 2.1.2
+# Testing with Concurrent::MutexAtomicBoolean...
+# 2.790000 0.000000 2.790000 ( 2.791454)
+# Testing with Concurrent::CAtomicBoolean...
+# 0.740000 0.000000 0.740000 ( 0.740206)
+#
+# Testing with jruby 1.9.3
+# Testing with Concurrent::MutexAtomicBoolean...
+# 5.240000 2.520000 7.760000 ( 3.683000)
+# Testing with Concurrent::JavaAtomicBoolean...
+# 3.340000 0.010000 3.350000 ( 0.855000)
+# ```
+#
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/atomic/AtomicBoolean.html java.util.concurrent.atomic.AtomicBoolean
+#
+# @!macro atomic_boolean_public_api
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_boolean.rb:119
+class Concurrent::AtomicBoolean < ::Concurrent::MutexAtomicBoolean
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_boolean.rb:125
+ def inspect; end
+
+ # @return [String] Short string representation.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_boolean.rb:121
+ def to_s; end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_boolean.rb:82
+Concurrent::AtomicBooleanImplementation = Concurrent::MutexAtomicBoolean
+
+# Define update methods that use direct paths
+#
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/atomic_direct_update.rb:9
+module Concurrent::AtomicDirectUpdate
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/atomic_direct_update.rb:15
+ def try_update; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/atomic_direct_update.rb:24
+ def try_update!; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/atomic_direct_update.rb:10
+ def update; end
+end
+
+# @!macro atomic_fixnum
+#
+# A numeric value that can be updated atomically. Reads and writes to an atomic
+# fixnum and thread-safe and guaranteed to succeed. Reads and writes may block
+# briefly but no explicit locking is required.
+#
+# @!macro thread_safe_variable_comparison
+#
+# Performance:
+#
+# ```
+# Testing with ruby 2.1.2
+# Testing with Concurrent::MutexAtomicFixnum...
+# 3.130000 0.000000 3.130000 ( 3.136505)
+# Testing with Concurrent::CAtomicFixnum...
+# 0.790000 0.000000 0.790000 ( 0.785550)
+#
+# Testing with jruby 1.9.3
+# Testing with Concurrent::MutexAtomicFixnum...
+# 5.460000 2.460000 7.920000 ( 3.715000)
+# Testing with Concurrent::JavaAtomicFixnum...
+# 4.520000 0.030000 4.550000 ( 1.187000)
+# ```
+#
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/atomic/AtomicLong.html java.util.concurrent.atomic.AtomicLong
+#
+# @!macro atomic_fixnum_public_api
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_fixnum.rb:136
+class Concurrent::AtomicFixnum < ::Concurrent::MutexAtomicFixnum
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_fixnum.rb:142
+ def inspect; end
+
+ # @return [String] Short string representation.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_fixnum.rb:138
+ def to_s; end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_fixnum.rb:99
+Concurrent::AtomicFixnumImplementation = Concurrent::MutexAtomicFixnum
+
+# An atomic reference which maintains an object reference along with a mark bit
+# that can be updated atomically.
+#
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/atomic/AtomicMarkableReference.html
+# java.util.concurrent.atomic.AtomicMarkableReference
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:10
+class Concurrent::AtomicMarkableReference < ::Concurrent::Synchronization::Object
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:15
+ def initialize(value = T.unsafe(nil), mark = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:12
+ def __initialize_atomic_fields__; end
+
+ # Atomically sets the value and mark to the given updated value and
+ # mark given both:
+ # - the current value == the expected value &&
+ # - the current mark == the expected mark
+ #
+ # @param [Object] expected_val the expected value
+ # @param [Object] new_val the new value
+ # @param [Boolean] expected_mark the expected mark
+ # @param [Boolean] new_mark the new mark
+ #
+ # @return [Boolean] `true` if successful. A `false` return indicates
+ # that the actual value was not equal to the expected value or the
+ # actual mark was not equal to the expected mark
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:33
+ def compare_and_set(expected_val, new_val, expected_mark, new_mark); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:59
+ def compare_and_swap(expected_val, new_val, expected_mark, new_mark); end
+
+ # Gets the current reference and marked values.
+ #
+ # @return [Array] the current reference and marked values
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:64
+ def get; end
+
+ # Gets the current marked value
+ #
+ # @return [Boolean] the current marked value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:78
+ def mark; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:82
+ def marked?; end
+
+ # _Unconditionally_ sets to the given value of both the reference and
+ # the mark.
+ #
+ # @param [Object] new_val the new value
+ # @param [Boolean] new_mark the new mark
+ #
+ # @return [Array] both the new value and the new mark
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:91
+ def set(new_val, new_mark); end
+
+ # Pass the current value to the given block, replacing it with the
+ # block's result. Simply return nil if update fails.
+ #
+ # @yield [Object] Calculate a new value and marked state for the atomic
+ # reference using given (old) value and (old) marked
+ # @yieldparam [Object] old_val the starting value of the atomic reference
+ # @yieldparam [Boolean] old_mark the starting state of marked
+ #
+ # @return [Array] the new value and marked state, or nil if
+ # the update failed
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:152
+ def try_update; end
+
+ # Pass the current value to the given block, replacing it
+ # with the block's result. Raise an exception if the update
+ # fails.
+ #
+ # @yield [Object] Calculate a new value and marked state for the atomic
+ # reference using given (old) value and (old) marked
+ # @yieldparam [Object] old_val the starting value of the atomic reference
+ # @yieldparam [Boolean] old_mark the starting state of marked
+ #
+ # @return [Array] the new value and marked state
+ #
+ # @raise [Concurrent::ConcurrentUpdateError] if the update fails
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:128
+ def try_update!; end
+
+ # Pass the current value and marked state to the given block, replacing it
+ # with the block's results. May retry if the value changes during the
+ # block's execution.
+ #
+ # @yield [Object] Calculate a new value and marked state for the atomic
+ # reference using given (old) value and (old) marked
+ # @yieldparam [Object] old_val the starting value of the atomic reference
+ # @yieldparam [Boolean] old_mark the starting state of marked
+ #
+ # @return [Array] the new value and new mark
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:105
+ def update; end
+
+ # Gets the current value of the reference
+ #
+ # @return [Object] the current value of the reference
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:71
+ def value; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:12
+ def compare_and_set_reference(expected, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:163
+ def immutable_array(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:12
+ def reference; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:12
+ def reference=(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:12
+ def swap_reference(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_markable_reference.rb:12
+ def update_reference(&block); end
+end
+
+# Special "compare and set" handling of numeric values.
+#
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/numeric_cas_wrapper.rb:7
+module Concurrent::AtomicNumericCompareAndSetWrapper
+ # @!macro atomic_reference_method_compare_and_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/numeric_cas_wrapper.rb:10
+ def compare_and_set(old_value, new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/numeric_cas_wrapper.rb:33
+ def compare_and_swap(old_value, new_value); end
+end
+
+# An object reference that may be updated atomically. All read and write
+# operations have java volatile semantic.
+#
+# @!macro thread_safe_variable_comparison
+#
+# @see http://docs.oracle.com/javase/8/docs/api/java/util/concurrent/atomic/AtomicReference.html
+# @see http://docs.oracle.com/javase/8/docs/api/java/util/concurrent/atomic/package-summary.html
+#
+# @!method initialize(value = nil)
+# @!macro atomic_reference_method_initialize
+# @param [Object] value The initial value.
+#
+# @!method get
+# @!macro atomic_reference_method_get
+# Gets the current value.
+# @return [Object] the current value
+#
+# @!method set(new_value)
+# @!macro atomic_reference_method_set
+# Sets to the given value.
+# @param [Object] new_value the new value
+# @return [Object] the new value
+#
+# @!method get_and_set(new_value)
+# @!macro atomic_reference_method_get_and_set
+# Atomically sets to the given value and returns the old value.
+# @param [Object] new_value the new value
+# @return [Object] the old value
+#
+# @!method compare_and_set(old_value, new_value)
+# @!macro atomic_reference_method_compare_and_set
+#
+# Atomically sets the value to the given updated value if
+# the current value == the expected value.
+#
+# @param [Object] old_value the expected value
+# @param [Object] new_value the new value
+#
+# @return [Boolean] `true` if successful. A `false` return indicates
+# that the actual value was not equal to the expected value.
+#
+# @!method update
+# Pass the current value to the given block, replacing it
+# with the block's result. May retry if the value changes
+# during the block's execution.
+#
+# @yield [Object] Calculate a new value for the atomic reference using
+# given (old) value
+# @yieldparam [Object] old_value the starting value of the atomic reference
+# @return [Object] the new value
+#
+# @!method try_update
+# Pass the current value to the given block, replacing it
+# with the block's result. Return nil if the update fails.
+#
+# @yield [Object] Calculate a new value for the atomic reference using
+# given (old) value
+# @yieldparam [Object] old_value the starting value of the atomic reference
+# @note This method was altered to avoid raising an exception by default.
+# Instead, this method now returns `nil` in case of failure. For more info,
+# please see: https://github.com/ruby-concurrency/concurrent-ruby/pull/336
+# @return [Object] the new value, or nil if update failed
+#
+# @!method try_update!
+# Pass the current value to the given block, replacing it
+# with the block's result. Raise an exception if the update
+# fails.
+#
+# @yield [Object] Calculate a new value for the atomic reference using
+# given (old) value
+# @yieldparam [Object] old_value the starting value of the atomic reference
+# @note This behavior mimics the behavior of the original
+# `AtomicReference#try_update` API. The reason this was changed was to
+# avoid raising exceptions (which are inherently slow) by default. For more
+# info: https://github.com/ruby-concurrency/concurrent-ruby/pull/336
+# @return [Object] the new value
+# @raise [Concurrent::ConcurrentUpdateError] if the update fails
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_reference.rb:133
+class Concurrent::AtomicReference < ::Concurrent::MutexAtomicReference
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_reference.rb:140
+ def inspect; end
+
+ # @return [String] Short string representation.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_reference.rb:136
+ def to_s; end
+end
+
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/atomic_reference.rb:18
+Concurrent::AtomicReferenceImplementation = Concurrent::MutexAtomicReference
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:30
+class Concurrent::CRubySet < ::Set
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def initialize(*args, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def &(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def +(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def -(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def <(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def <<(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def <=(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def <=>(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def ==(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def ===(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def >(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def >=(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def ^(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def add(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def add?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def classify(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def clear(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def collect!(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def compare_by_identity(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def compare_by_identity?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def delete(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def delete?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def delete_if(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def difference(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def disjoint?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def divide(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def each(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def empty?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def eql?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def filter!(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def flatten(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def flatten!(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def flatten_merge(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def freeze(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def hash(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def include?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def inspect(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def intersect?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def intersection(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def join(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def keep_if(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def length(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def map!(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def member?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def merge(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def pretty_print(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def pretty_print_cycle(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def proper_subset?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def proper_superset?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def reject!(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def replace(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def reset(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def select!(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def size(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def subset?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def subtract(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def superset?(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def to_a(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def to_s(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def to_set(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def union(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def |(*args); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:33
+ def initialize_copy(other); end
+end
+
+# A thread pool that dynamically grows and shrinks to fit the current workload.
+# New threads are created as needed, existing threads are reused, and threads
+# that remain idle for too long are killed and removed from the pool. These
+# pools are particularly suited to applications that perform a high volume of
+# short-lived tasks.
+#
+# On creation a `CachedThreadPool` has zero running threads. New threads are
+# created on the pool as new operations are `#post`. The size of the pool
+# will grow until `#max_length` threads are in the pool or until the number
+# of threads exceeds the number of running and pending operations. When a new
+# operation is post to the pool the first available idle thread will be tasked
+# with the new operation.
+#
+# Should a thread crash for any reason the thread will immediately be removed
+# from the pool. Similarly, threads which remain idle for an extended period
+# of time will be killed and reclaimed. Thus these thread pools are very
+# efficient at reclaiming unused resources.
+#
+# The API and behavior of this class are based on Java's `CachedThreadPool`
+#
+# @!macro thread_pool_options
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/cached_thread_pool.rb:27
+class Concurrent::CachedThreadPool < ::Concurrent::ThreadPoolExecutor
+ # @!macro cached_thread_pool_method_initialize
+ #
+ # Create a new thread pool.
+ #
+ # @param [Hash] opts the options defining pool behavior.
+ # @option opts [Symbol] :fallback_policy (`:abort`) the fallback policy
+ #
+ # @raise [ArgumentError] if `fallback_policy` is not a known policy
+ #
+ # @see http://docs.oracle.com/javase/8/docs/api/java/util/concurrent/Executors.html#newCachedThreadPool--
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/cached_thread_pool.rb:39
+ def initialize(opts = T.unsafe(nil)); end
+
+ private
+
+ # @!macro cached_thread_pool_method_initialize
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/cached_thread_pool.rb:51
+ def ns_initialize(opts); end
+end
+
+# Raised when an asynchronous operation is cancelled before execution.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:9
+class Concurrent::CancelledOperationError < ::Concurrent::Error; end
+
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:7
+module Concurrent::Collection; end
+
+# A thread safe observer set implemented using copy-on-read approach:
+# observers are added and removed from a thread safe collection; every time
+# a notification is required the internal data structure is copied to
+# prevent concurrency issues
+#
+# @api private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:12
+class Concurrent::Collection::CopyOnNotifyObserverSet < ::Concurrent::Synchronization::LockableObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:14
+ def initialize; end
+
+ # @!macro observable_add_observer
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:20
+ def add_observer(observer = T.unsafe(nil), func = T.unsafe(nil), &block); end
+
+ # @!macro observable_count_observers
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:55
+ def count_observers; end
+
+ # @!macro observable_delete_observer
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:39
+ def delete_observer(observer); end
+
+ # @!macro observable_delete_observers
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:47
+ def delete_observers; end
+
+ # Notifies all registered observers with optional args and deletes them.
+ #
+ # @param [Object] args arguments to be passed to each observer
+ # @return [CopyOnWriteObserverSet] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:72
+ def notify_and_delete_observers(*args, &block); end
+
+ # Notifies all registered observers with optional args
+ # @param [Object] args arguments to be passed to each observer
+ # @return [CopyOnWriteObserverSet] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:62
+ def notify_observers(*args, &block); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:80
+ def ns_initialize; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:86
+ def duplicate_and_clear_observers; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:94
+ def duplicate_observers; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_notify_observer_set.rb:98
+ def notify_to(observers, *args); end
+end
+
+# A thread safe observer set implemented using copy-on-write approach:
+# every time an observer is added or removed the whole internal data structure is
+# duplicated and replaced with a new one.
+#
+# @api private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:11
+class Concurrent::Collection::CopyOnWriteObserverSet < ::Concurrent::Synchronization::LockableObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:13
+ def initialize; end
+
+ # @!macro observable_add_observer
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:19
+ def add_observer(observer = T.unsafe(nil), func = T.unsafe(nil), &block); end
+
+ # @!macro observable_count_observers
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:56
+ def count_observers; end
+
+ # @!macro observable_delete_observer
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:40
+ def delete_observer(observer); end
+
+ # @!macro observable_delete_observers
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:50
+ def delete_observers; end
+
+ # Notifies all registered observers with optional args and deletes them.
+ #
+ # @param [Object] args arguments to be passed to each observer
+ # @return [CopyOnWriteObserverSet] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:72
+ def notify_and_delete_observers(*args, &block); end
+
+ # Notifies all registered observers with optional args
+ # @param [Object] args arguments to be passed to each observer
+ # @return [CopyOnWriteObserverSet] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:63
+ def notify_observers(*args, &block); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:80
+ def ns_initialize; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:102
+ def clear_observers_and_return_old; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:86
+ def notify_to(observers, *args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:94
+ def observers; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/copy_on_write_observer_set.rb:98
+ def observers=(new_set); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:10
+Concurrent::Collection::MapImplementation = Concurrent::Collection::MriMapBackend
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:10
+class Concurrent::Collection::MriMapBackend < ::Concurrent::Collection::NonConcurrentMapBackend
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:12
+ def initialize(options = T.unsafe(nil), &default_proc); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:17
+ def []=(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:61
+ def clear; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:33
+ def compute(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:21
+ def compute_if_absent(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:29
+ def compute_if_present(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:53
+ def delete(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:57
+ def delete_pair(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:49
+ def get_and_set(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:37
+ def merge_pair(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:45
+ def replace_if_exists(key, new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/mri_map_backend.rb:41
+ def replace_pair(key, old_value, new_value); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:9
+class Concurrent::Collection::NonConcurrentMapBackend
+ # WARNING: all public methods of the class must operate on the @backend
+ # directly without calling each other. This is important because of the
+ # SynchronizedMapBackend which uses a non-reentrant mutex for performance
+ # reasons.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:15
+ def initialize(options = T.unsafe(nil), &default_proc); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:21
+ def [](key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:25
+ def []=(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:94
+ def clear; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:59
+ def compute(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:29
+ def compute_if_absent(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:53
+ def compute_if_present(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:81
+ def delete(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:85
+ def delete_pair(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:99
+ def each_pair; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:71
+ def get_and_set(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:110
+ def get_or_default(key, default_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:77
+ def key?(key); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:63
+ def merge_pair(key, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:46
+ def replace_if_exists(key, new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:37
+ def replace_pair(key, old_value, new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:106
+ def size; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:130
+ def dupped_backend; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:124
+ def initialize_copy(other); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:134
+ def pair?(key, expected_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:116
+ def set_backend(default_proc); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/map/non_concurrent_map_backend.rb:138
+ def store_computed_value(key, new_value); end
+end
+
+# @!macro priority_queue
+#
+# A queue collection in which the elements are sorted based on their
+# comparison (spaceship) operator `<=>`. Items are added to the queue
+# at a position relative to their priority. On removal the element
+# with the "highest" priority is removed. By default the sort order is
+# from highest to lowest, but a lowest-to-highest sort order can be
+# set on construction.
+#
+# The API is based on the `Queue` class from the Ruby standard library.
+#
+# The pure Ruby implementation, `RubyNonConcurrentPriorityQueue` uses a heap algorithm
+# stored in an array. The algorithm is based on the work of Robert Sedgewick
+# and Kevin Wayne.
+#
+# The JRuby native implementation is a thin wrapper around the standard
+# library `java.util.NonConcurrentPriorityQueue`.
+#
+# When running under JRuby the class `NonConcurrentPriorityQueue` extends `JavaNonConcurrentPriorityQueue`.
+# When running under all other interpreters it extends `RubyNonConcurrentPriorityQueue`.
+#
+# @note This implementation is *not* thread safe.
+#
+# @see http://en.wikipedia.org/wiki/Priority_queue
+# @see http://ruby-doc.org/stdlib-2.0.0/libdoc/thread/rdoc/Queue.html
+#
+# @see http://algs4.cs.princeton.edu/24pq/index.php#2.6
+# @see http://algs4.cs.princeton.edu/24pq/MaxPQ.java.html
+#
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/PriorityQueue.html
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:50
+class Concurrent::Collection::NonConcurrentPriorityQueue < ::Concurrent::Collection::RubyNonConcurrentPriorityQueue
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:59
+ def <<(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:56
+ def deq; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:60
+ def enq(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:52
+ def has_priority?(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:57
+ def shift; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:54
+ def size; end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/non_concurrent_priority_queue.rb:10
+Concurrent::Collection::NonConcurrentPriorityQueueImplementation = Concurrent::Collection::RubyNonConcurrentPriorityQueue
+
+# @!macro priority_queue
+#
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:8
+class Concurrent::Collection::RubyNonConcurrentPriorityQueue
+ # @!macro priority_queue_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:11
+ def initialize(opts = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:85
+ def <<(item); end
+
+ # @!macro priority_queue_method_clear
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:18
+ def clear; end
+
+ # @!macro priority_queue_method_delete
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:25
+ def delete(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:74
+ def deq; end
+
+ # @!macro priority_queue_method_empty
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:43
+ def empty?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:86
+ def enq(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:51
+ def has_priority?(item); end
+
+ # @!macro priority_queue_method_include
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:48
+ def include?(item); end
+
+ # @!macro priority_queue_method_length
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:54
+ def length; end
+
+ # @!macro priority_queue_method_peek
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:60
+ def peek; end
+
+ # @!macro priority_queue_method_pop
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:65
+ def pop; end
+
+ # @!macro priority_queue_method_push
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:78
+ def push(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:75
+ def shift; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:57
+ def size; end
+
+ private
+
+ # Are the items at the given indexes ordered based on the priority
+ # order specified at construction?
+ #
+ # @param [Integer] x the first index from which to retrieve a comparable value
+ # @param [Integer] y the second index from which to retrieve a comparable value
+ #
+ # @return [Boolean] true if the two elements are in the correct priority order
+ # else false
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:119
+ def ordered?(x, y); end
+
+ # Percolate down to maintain heap invariant.
+ #
+ # @param [Integer] k the index at which to start the percolation
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:128
+ def sink(k); end
+
+ # Exchange the values at the given indexes within the internal array.
+ #
+ # @param [Integer] x the first index to swap
+ # @param [Integer] y the second index to swap
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:103
+ def swap(x, y); end
+
+ # Percolate up to maintain heap invariant.
+ #
+ # @param [Integer] k the index at which to start the percolation
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:147
+ def swim(k); end
+
+ class << self
+ # @!macro priority_queue_method_from_list
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/ruby_non_concurrent_priority_queue.rb:89
+ def from_list(list, opts = T.unsafe(nil)); end
+ end
+end
+
+# @!visibility private
+# @!macro timeout_queue
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/timeout_queue.rb:15
+class Concurrent::Collection::TimeoutQueue < ::Thread::Queue; end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/timeout_queue.rb:5
+Concurrent::Collection::TimeoutQueueImplementation = Thread::Queue
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:2
+module Concurrent::Concern; end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/deprecation.rb:8
+module Concurrent::Concern::Deprecation
+ include ::Concurrent::Concern::Logging
+ extend ::Concurrent::Concern::Logging
+ extend ::Concurrent::Concern::Deprecation
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/deprecation.rb:12
+ def deprecated(message, strip = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/deprecation.rb:27
+ def deprecated_method(old_name, new_name); end
+end
+
+# Object references in Ruby are mutable. This can lead to serious problems when
+# the `#value` of a concurrent object is a mutable reference. Which is always the
+# case unless the value is a `Fixnum`, `Symbol`, or similar "primitive" data type.
+# Most classes in this library that expose a `#value` getter method do so using the
+# `Dereferenceable` mixin module.
+#
+# @!macro copy_options
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:11
+module Concurrent::Concern::Dereferenceable
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:24
+ def deref; end
+
+ # Return the value this object represents after applying the options specified
+ # by the `#set_deref_options` method.
+ #
+ # @return [Object] the current value of the object
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:21
+ def value; end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:63
+ def apply_deref_options(value); end
+
+ # @!macro dereferenceable_set_deref_options
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:54
+ def ns_set_deref_options(opts); end
+
+ # @!macro dereferenceable_set_deref_options
+ # Set the options which define the operations #value performs before
+ # returning data to the caller (dereferencing).
+ #
+ # @note Most classes that include this module will call `#set_deref_options`
+ # from within the constructor, thus allowing these options to be set at
+ # object creation.
+ #
+ # @param [Hash] opts the options defining dereference behavior.
+ # @option opts [String] :dup_on_deref (false) call `#dup` before returning the data
+ # @option opts [String] :freeze_on_deref (false) call `#freeze` before returning the data
+ # @option opts [String] :copy_on_deref (nil) call the given `Proc` passing
+ # the internal value and returning the value returned from the proc
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:48
+ def set_deref_options(opts = T.unsafe(nil)); end
+
+ # Set the internal value of this object
+ #
+ # @param [Object] value the new value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/dereferenceable.rb:31
+ def value=(value); end
+end
+
+# Include where logging is needed
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:9
+module Concurrent::Concern::Logging
+ # Logs through {Concurrent.global_logger}, it can be overridden by setting @logger
+ # @param [Integer] level one of Concurrent::Concern::Logging constants
+ # @param [String] progname e.g. a path of an Actor
+ # @param [String, nil] message when nil block is used to generate the message
+ # @yieldreturn [String] a message
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:19
+ def log(level, progname, message = T.unsafe(nil), &block); end
+end
+
+# The same as Logger::Severity but we copy it here to avoid a dependency on the logger gem just for these 7 constants
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:11
+Concurrent::Concern::Logging::DEBUG = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:11
+Concurrent::Concern::Logging::ERROR = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:11
+Concurrent::Concern::Logging::FATAL = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:11
+Concurrent::Concern::Logging::INFO = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:12
+Concurrent::Concern::Logging::SEV_LABEL = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:11
+Concurrent::Concern::Logging::UNKNOWN = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:11
+Concurrent::Concern::Logging::WARN = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:10
+module Concurrent::Concern::Obligation
+ include ::Concurrent::Concern::Dereferenceable
+
+ # Has the obligation completed processing?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:49
+ def complete?; end
+
+ # @example allows Obligation to be risen
+ # rejected_ivar = Ivar.new.fail
+ # raise rejected_ivar
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:126
+ def exception(*args); end
+
+ # Has the obligation been fulfilled?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:20
+ def fulfilled?; end
+
+ # Is the obligation still awaiting completion of processing?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:56
+ def incomplete?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:89
+ def no_error!(timeout = T.unsafe(nil)); end
+
+ # Is obligation completion still pending?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:35
+ def pending?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:23
+ def realized?; end
+
+ # If an exception was raised during processing this will return the
+ # exception object. Will return `nil` when the state is pending or if
+ # the obligation has been successfully fulfilled.
+ #
+ # @return [Exception] the exception raised during processing or `nil`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:119
+ def reason; end
+
+ # Has the obligation been rejected?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:28
+ def rejected?; end
+
+ # The current state of the obligation.
+ #
+ # @return [Symbol] the current state
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:110
+ def state; end
+
+ # Is the obligation still unscheduled?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:42
+ def unscheduled?; end
+
+ # The current value of the obligation. Will be `nil` while the state is
+ # pending or the operation has been rejected.
+ #
+ # @param [Numeric] timeout the maximum time in seconds to wait.
+ # @return [Object] see Dereferenceable#deref
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:65
+ def value(timeout = T.unsafe(nil)); end
+
+ # The current value of the obligation. Will be `nil` while the state is
+ # pending or the operation has been rejected. Will re-raise any exceptions
+ # raised during processing (but will not raise an exception on timeout).
+ #
+ # @param [Numeric] timeout the maximum time in seconds to wait.
+ # @return [Object] see Dereferenceable#deref
+ # @raise [Exception] raises the reason when rejected
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:98
+ def value!(timeout = T.unsafe(nil)); end
+
+ # Wait until obligation is complete or the timeout has been reached.
+ #
+ # @param [Numeric] timeout the maximum time in seconds to wait.
+ # @return [Obligation] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:74
+ def wait(timeout = T.unsafe(nil)); end
+
+ # Wait until obligation is complete or the timeout is reached. Will re-raise
+ # any exceptions raised during processing (but will not raise an exception
+ # on timeout).
+ #
+ # @param [Numeric] timeout the maximum time in seconds to wait.
+ # @return [Obligation] self
+ # @raise [Exception] raises the reason when rejected
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:86
+ def wait!(timeout = T.unsafe(nil)); end
+
+ protected
+
+ # Atomic compare and set operation
+ # State is set to `next_state` only if `current state == expected_current`.
+ #
+ # @param [Symbol] next_state
+ # @param [Symbol] expected_current
+ #
+ # @return [Boolean] true is state is changed, false otherwise
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:174
+ def compare_and_set_state(next_state, *expected_current); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:145
+ def event; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:134
+ def get_arguments_from(opts = T.unsafe(nil)); end
+
+ # Executes the block within mutex if current state is included in expected_states
+ #
+ # @return block value if executed, false otherwise
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:190
+ def if_state(*expected_states); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:139
+ def init_obligation; end
+
+ # Am I in the current state?
+ #
+ # @param [Symbol] expected The state to check against
+ # @return [Boolean] true if in the expected state else false
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:210
+ def ns_check_state?(expected); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:215
+ def ns_set_state(value); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:150
+ def set_state(success, value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/obligation.rb:161
+ def state=(value); end
+end
+
+# The [observer pattern](http://en.wikipedia.org/wiki/Observer_pattern) is one
+# of the most useful design patterns.
+#
+# The workflow is very simple:
+# - an `observer` can register itself to a `subject` via a callback
+# - many `observers` can be registered to the same `subject`
+# - the `subject` notifies all registered observers when its status changes
+# - an `observer` can deregister itself when is no more interested to receive
+# event notifications
+#
+# In a single threaded environment the whole pattern is very easy: the
+# `subject` can use a simple data structure to manage all its subscribed
+# `observer`s and every `observer` can react directly to every event without
+# caring about synchronization.
+#
+# In a multi threaded environment things are more complex. The `subject` must
+# synchronize the access to its data structure and to do so currently we're
+# using two specialized ObserverSet: {Concurrent::Concern::CopyOnWriteObserverSet}
+# and {Concurrent::Concern::CopyOnNotifyObserverSet}.
+#
+# When implementing and `observer` there's a very important rule to remember:
+# **there are no guarantees about the thread that will execute the callback**
+#
+# Let's take this example
+# ```
+# class Observer
+# def initialize
+# @count = 0
+# end
+#
+# def update
+# @count += 1
+# end
+# end
+#
+# obs = Observer.new
+# [obj1, obj2, obj3, obj4].each { |o| o.add_observer(obs) }
+# # execute [obj1, obj2, obj3, obj4]
+# ```
+#
+# `obs` is wrong because the variable `@count` can be accessed by different
+# threads at the same time, so it should be synchronized (using either a Mutex
+# or an AtomicFixum)
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:50
+module Concurrent::Concern::Observable
+ # @!macro observable_add_observer
+ #
+ # Adds an observer to this set. If a block is passed, the observer will be
+ # created by this method and no other params should be passed.
+ #
+ # @param [Object] observer the observer to add
+ # @param [Symbol] func the function to call on the observer during notification.
+ # Default is :update
+ # @return [Object] the added observer
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:61
+ def add_observer(observer = T.unsafe(nil), func = T.unsafe(nil), &block); end
+
+ # @!macro observable_count_observers
+ #
+ # Return the number of observers associated with this object.
+ #
+ # @return [Integer] the observers count
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:101
+ def count_observers; end
+
+ # @!macro observable_delete_observer
+ #
+ # Remove `observer` as an observer on this object so that it will no
+ # longer receive notifications.
+ #
+ # @param [Object] observer the observer to remove
+ # @return [Object] the deleted observer
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:82
+ def delete_observer(observer); end
+
+ # @!macro observable_delete_observers
+ #
+ # Remove all observers associated with this object.
+ #
+ # @return [Observable] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:91
+ def delete_observers; end
+
+ # As `#add_observer` but can be used for chaining.
+ #
+ # @param [Object] observer the observer to add
+ # @param [Symbol] func the function to call on the observer during notification.
+ # @return [Observable] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:70
+ def with_observer(observer = T.unsafe(nil), func = T.unsafe(nil), &block); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:107
+ def observers; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/observable.rb:107
+ def observers=(_arg0); end
+end
+
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:70
+class Concurrent::ConcurrentUpdateError < ::ThreadError; end
+
+# frozen pre-allocated backtrace to speed ConcurrentUpdateError
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:72
+Concurrent::ConcurrentUpdateError::CONC_UP_ERR_BACKTRACE = T.let(T.unsafe(nil), Array)
+
+# Raised when errors occur during configuration.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:6
+class Concurrent::ConfigurationError < ::Concurrent::Error; end
+
+# @!macro count_down_latch
+#
+# A synchronization object that allows one thread to wait on multiple other threads.
+# The thread that will wait creates a `CountDownLatch` and sets the initial value
+# (normally equal to the number of other threads). The initiating thread passes the
+# latch to the other threads then waits for the other threads by calling the `#wait`
+# method. Each of the other threads calls `#count_down` when done with its work.
+# When the latch counter reaches zero the waiting thread is unblocked and continues
+# with its work. A `CountDownLatch` can be used only once. Its value cannot be reset.
+#
+# @!macro count_down_latch_public_api
+# @example Waiter and Decrementer
+# latch = Concurrent::CountDownLatch.new(3)
+#
+# waiter = Thread.new do
+# latch.wait()
+# puts ("Waiter released")
+# end
+#
+# decrementer = Thread.new do
+# sleep(1)
+# latch.count_down
+# puts latch.count
+#
+# sleep(1)
+# latch.count_down
+# puts latch.count
+#
+# sleep(1)
+# latch.count_down
+# puts latch.count
+# end
+#
+# [waiter, decrementer].each(&:join)
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/count_down_latch.rb:98
+class Concurrent::CountDownLatch < ::Concurrent::MutexCountDownLatch; end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/count_down_latch.rb:56
+Concurrent::CountDownLatchImplementation = Concurrent::MutexCountDownLatch
+
+# A synchronization aid that allows a set of threads to all wait for each
+# other to reach a common barrier point.
+# @example
+# barrier = Concurrent::CyclicBarrier.new(3)
+# jobs = Array.new(3) { |i| -> { sleep i; p done: i } }
+# process = -> (i) do
+# # waiting to start at the same time
+# barrier.wait
+# # execute job
+# jobs[i].call
+# # wait for others to finish
+# barrier.wait
+# end
+# threads = 2.times.map do |i|
+# Thread.new(i, &process)
+# end
+#
+# # use main as well
+# process.call 2
+#
+# # here we can be sure that all jobs are processed
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:27
+class Concurrent::CyclicBarrier < ::Concurrent::Synchronization::LockableObject
+ # Create a new `CyclicBarrier` that waits for `parties` threads
+ #
+ # @param [Fixnum] parties the number of parties
+ # @yield an optional block that will be executed that will be executed after
+ # the last thread arrives and before the others are released
+ #
+ # @raise [ArgumentError] if `parties` is not an integer or is less than zero
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:40
+ def initialize(parties, &block); end
+
+ # A barrier can be broken when:
+ # - a thread called the `reset` method while at least one other thread was waiting
+ # - at least one thread timed out on `wait` method
+ #
+ # A broken barrier can be restored using `reset` it's safer to create a new one
+ # @return [Boolean] true if the barrier is broken otherwise false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:105
+ def broken?; end
+
+ # @return [Fixnum] the number of threads currently waiting on the barrier
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:54
+ def number_waiting; end
+
+ # @return [Fixnum] the number of threads needed to pass the barrier
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:49
+ def parties; end
+
+ # resets the barrier to its initial state
+ # If there is at least one waiting thread, it will be woken up, the `wait`
+ # method will return false and the barrier will be broken
+ # If the barrier is broken, this method restores it to the original state
+ #
+ # @return [nil]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:95
+ def reset; end
+
+ # Blocks on the barrier until the number of waiting threads is equal to
+ # `parties` or until `timeout` is reached or `reset` is called
+ # If a block has been passed to the constructor, it will be executed once by
+ # the last arrived thread before releasing the others
+ # @param [Fixnum] timeout the number of seconds to wait for the counter or
+ # `nil` to block indefinitely
+ # @return [Boolean] `true` if the `count` reaches zero else false on
+ # `timeout` or on `reset` or if the barrier is broken
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:66
+ def wait(timeout = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:111
+ def ns_generation_done(generation, status, continue = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:122
+ def ns_initialize(parties, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:117
+ def ns_next_generation; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+class Concurrent::CyclicBarrier::Generation < ::Struct
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def status; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def status=(_); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def [](*_arg0); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def keyword_init?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def members; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/cyclic_barrier.rb:30
+ def new(*_arg0); end
+ end
+end
+
+# Lazy evaluation of a block yielding an immutable result. Useful for
+# expensive operations that may never be needed. It may be non-blocking,
+# supports the `Concern::Obligation` interface, and accepts the injection of
+# custom executor upon which to execute the block. Processing of
+# block will be deferred until the first time `#value` is called.
+# At that time the caller can choose to return immediately and let
+# the block execute asynchronously, block indefinitely, or block
+# with a timeout.
+#
+# When a `Delay` is created its state is set to `pending`. The value and
+# reason are both `nil`. The first time the `#value` method is called the
+# enclosed operation will be run and the calling thread will block. Other
+# threads attempting to call `#value` will block as well. Once the operation
+# is complete the *value* will be set to the result of the operation or the
+# *reason* will be set to the raised exception, as appropriate. All threads
+# blocked on `#value` will return. Subsequent calls to `#value` will immediately
+# return the cached value. The operation will only be run once. This means that
+# any side effects created by the operation will only happen once as well.
+#
+# `Delay` includes the `Concurrent::Concern::Dereferenceable` mixin to support thread
+# safety of the reference returned by `#value`.
+#
+# @!macro copy_options
+#
+# @!macro delay_note_regarding_blocking
+# @note The default behavior of `Delay` is to block indefinitely when
+# calling either `value` or `wait`, executing the delayed operation on
+# the current thread. This makes the `timeout` value completely
+# irrelevant. To enable non-blocking behavior, use the `executor`
+# constructor option. This will cause the delayed operation to be
+# execute on the given executor, allowing the call to timeout.
+#
+# @see Concurrent::Concern::Dereferenceable
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:44
+class Concurrent::Delay < ::Concurrent::Synchronization::LockableObject
+ include ::Concurrent::Concern::Dereferenceable
+ include ::Concurrent::Concern::Obligation
+
+ # Create a new `Delay` in the `:pending` state.
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @yield the delayed operation to perform
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:62
+ def initialize(opts = T.unsafe(nil), &block); end
+
+ # Reconfigures the block returning the value if still `#incomplete?`
+ #
+ # @yield the delayed operation to perform
+ # @return [true, false] if success
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:146
+ def reconfigure(&block); end
+
+ # Return the value this object represents after applying the options
+ # specified by the `#set_deref_options` method. If the delayed operation
+ # raised an exception this method will return nil. The exception object
+ # can be accessed via the `#reason` method.
+ #
+ # @param [Numeric] timeout the maximum number of seconds to wait
+ # @return [Object] the current value of the object
+ #
+ # @!macro delay_note_regarding_blocking
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:77
+ def value(timeout = T.unsafe(nil)); end
+
+ # Return the value this object represents after applying the options
+ # specified by the `#set_deref_options` method. If the delayed operation
+ # raised an exception, this method will raise that exception (even when)
+ # the operation has already been executed).
+ #
+ # @param [Numeric] timeout the maximum number of seconds to wait
+ # @return [Object] the current value of the object
+ # @raise [Exception] when `#rejected?` raises `#reason`
+ #
+ # @!macro delay_note_regarding_blocking
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:113
+ def value!(timeout = T.unsafe(nil)); end
+
+ # Return the value this object represents after applying the options
+ # specified by the `#set_deref_options` method.
+ #
+ # @param [Integer] timeout (nil) the maximum number of seconds to wait for
+ # the value to be computed. When `nil` the caller will block indefinitely.
+ #
+ # @return [Object] self
+ #
+ # @!macro delay_note_regarding_blocking
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:132
+ def wait(timeout = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:160
+ def ns_initialize(opts, &block); end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/delay.rb:173
+ def execute_task_once; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:7
+class Concurrent::DependencyCounter
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:9
+ def initialize(count, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/dataflow.rb:14
+ def update(time, value, reason); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:3
+class Concurrent::Error < ::StandardError; end
+
+# Old school kernel-style event reminiscent of Win32 programming in C++.
+#
+# When an `Event` is created it is in the `unset` state. Threads can choose to
+# `#wait` on the event, blocking until released by another thread. When one
+# thread wants to alert all blocking threads it calls the `#set` method which
+# will then wake up all listeners. Once an `Event` has been set it remains set.
+# New threads calling `#wait` will return immediately. An `Event` may be
+# `#reset` at any time once it has been set.
+#
+# @see http://msdn.microsoft.com/en-us/library/windows/desktop/ms682655.aspx
+# @example
+# event = Concurrent::Event.new
+#
+# t1 = Thread.new do
+# puts "t1 is waiting"
+# event.wait(1)
+# puts "event occurred"
+# end
+#
+# t2 = Thread.new do
+# puts "t2 calling set"
+# event.set
+# end
+#
+# [t1, t2].each(&:join)
+#
+# # prints:
+# # t1 is waiting
+# # t2 calling set
+# # event occurred
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:36
+class Concurrent::Event < ::Concurrent::Synchronization::LockableObject
+ # Creates a new `Event` in the unset state. Threads calling `#wait` on the
+ # `Event` will block.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:40
+ def initialize; end
+
+ # Reset a previously set event back to the `unset` state.
+ # Has no effect if the `Event` has not yet been set.
+ #
+ # @return [Boolean] should always return `true`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:68
+ def reset; end
+
+ # Trigger the event, setting the state to `set` and releasing all threads
+ # waiting on the event. Has no effect if the `Event` has already been set.
+ #
+ # @return [Boolean] should always return `true`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:56
+ def set; end
+
+ # Is the object in the set state?
+ #
+ # @return [Boolean] indicating whether or not the `Event` has been set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:48
+ def set?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:60
+ def try?; end
+
+ # Wait a given number of seconds for the `Event` to be set by another
+ # thread. Will wait forever when no `timeout` value is given. Returns
+ # immediately if the `Event` has already been set.
+ #
+ # @return [Boolean] true if the `Event` was set before timeout else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:83
+ def wait(timeout = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:104
+ def ns_initialize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/event.rb:96
+ def ns_set; end
+end
+
+# @!macro exchanger
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:336
+class Concurrent::Exchanger < ::Concurrent::RubyExchanger; end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:327
+Concurrent::ExchangerImplementation = Concurrent::RubyExchanger
+
+# @!macro executor_service_public_api
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/executor_service.rb:157
+module Concurrent::ExecutorService
+ include ::Concurrent::Concern::Logging
+
+ # @!macro executor_service_method_left_shift
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/executor_service.rb:166
+ def <<(task); end
+
+ # @!macro executor_service_method_can_overflow_question
+ #
+ # @note Always returns `false`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/executor_service.rb:174
+ def can_overflow?; end
+
+ # @!macro executor_service_method_post
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/executor_service.rb:161
+ def post(*args, &task); end
+
+ # @!macro executor_service_method_serialized_question
+ #
+ # @note Always returns `false`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/executor_service.rb:181
+ def serialized?; end
+end
+
+# A `FiberLocalVar` is a variable where the value is different for each fiber.
+# Each variable may have a default value, but when you modify the variable only
+# the current fiber will ever see that change.
+#
+# This is similar to Ruby's built-in fiber-local variables (`Thread.current[:name]`),
+# but with these major advantages:
+# * `FiberLocalVar` has its own identity, it doesn't need a Symbol.
+# * Each Ruby's built-in fiber-local variable leaks some memory forever (it's a Symbol held forever on the fiber),
+# so it's only OK to create a small amount of them.
+# `FiberLocalVar` has no such issue and it is fine to create many of them.
+# * Ruby's built-in fiber-local variables leak forever the value set on each fiber (unless set to nil explicitly).
+# `FiberLocalVar` automatically removes the mapping for each fiber once the `FiberLocalVar` instance is GC'd.
+#
+# @example
+# v = FiberLocalVar.new(14)
+# v.value #=> 14
+# v.value = 2
+# v.value #=> 2
+#
+# @example
+# v = FiberLocalVar.new(14)
+#
+# Fiber.new do
+# v.value #=> 14
+# v.value = 1
+# v.value #=> 1
+# end.resume
+#
+# Fiber.new do
+# v.value #=> 14
+# v.value = 2
+# v.value #=> 2
+# end.resume
+#
+# v.value #=> 14
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:41
+class Concurrent::FiberLocalVar
+ # Creates a fiber local variable.
+ #
+ # @param [Object] default the default value when otherwise unset
+ # @param [Proc] default_block Optional block that gets called to obtain the
+ # default value for each fiber
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:49
+ def initialize(default = T.unsafe(nil), &default_block); end
+
+ # Bind the given value to fiber local storage during
+ # execution of the given block.
+ #
+ # @param [Object] value the value to bind
+ # @yield the operation to be performed with the bound variable
+ # @return [Object] the value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:86
+ def bind(value); end
+
+ # Returns the value in the current fiber's copy of this fiber-local variable.
+ #
+ # @return [Object] the current value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:68
+ def value; end
+
+ # Sets the current fiber's copy of this fiber-local variable to the specified value.
+ #
+ # @param [Object] value the value to set
+ # @return [Object] the new value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:76
+ def value=(value); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:101
+ def default; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/fiber_local_var.rb:42
+Concurrent::FiberLocalVar::LOCALS = T.let(T.unsafe(nil), Concurrent::FiberLocals)
+
+# @!visibility private
+# @!macro internal_implementation_note
+# An array-backed storage of indexed variables per fiber.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:166
+class Concurrent::FiberLocals < ::Concurrent::AbstractLocals
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:167
+ def locals; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:171
+ def locals!; end
+end
+
+# @!macro fixed_thread_pool
+#
+# A thread pool that reuses a fixed number of threads operating off an unbounded queue.
+# At any point, at most `num_threads` will be active processing tasks. When all threads are busy new
+# tasks `#post` to the thread pool are enqueued until a thread becomes available.
+# Should a thread crash for any reason the thread will immediately be removed
+# from the pool and replaced.
+#
+# The API and behavior of this class are based on Java's `FixedThreadPool`
+#
+# @!macro thread_pool_options
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/fixed_thread_pool.rb:199
+class Concurrent::FixedThreadPool < ::Concurrent::ThreadPoolExecutor
+ # @!macro fixed_thread_pool_method_initialize
+ #
+ # Create a new thread pool.
+ #
+ # @param [Integer] num_threads the number of threads to allocate
+ # @param [Hash] opts the options defining pool behavior.
+ # @option opts [Symbol] :fallback_policy (`:abort`) the fallback policy
+ #
+ # @raise [ArgumentError] if `num_threads` is less than or equal to zero
+ # @raise [ArgumentError] if `fallback_policy` is not a known policy
+ #
+ # @see http://docs.oracle.com/javase/8/docs/api/java/util/concurrent/Executors.html#newFixedThreadPool-int-
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/fixed_thread_pool.rb:213
+ def initialize(num_threads, opts = T.unsafe(nil)); end
+end
+
+# {include:file:docs-source/future.md}
+#
+# @!macro copy_options
+#
+# @see http://ruby-doc.org/stdlib-2.1.1/libdoc/observer/rdoc/Observable.html Ruby Observable module
+# @see http://clojuredocs.org/clojure_core/clojure.core/future Clojure's future function
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/Future.html java.util.concurrent.Future
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:21
+class Concurrent::Future < ::Concurrent::IVar
+ # Create a new `Future` in the `:unscheduled` state.
+ #
+ # @yield the asynchronous operation to perform
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @option opts [object, Array] :args zero or more arguments to be passed the task
+ # block on execution
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:33
+ def initialize(opts = T.unsafe(nil), &block); end
+
+ # Attempt to cancel the operation if it has not already processed.
+ # The operation can only be cancelled while still `pending`. It cannot
+ # be cancelled once it has begun processing or has completed.
+ #
+ # @return [Boolean] was the operation successfully cancelled.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:99
+ def cancel; end
+
+ # Has the operation been successfully cancelled?
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:111
+ def cancelled?; end
+
+ # Execute an `:unscheduled` `Future`. Immediately sets the state to `:pending` and
+ # passes the block to a new thread/thread pool for eventual execution.
+ # Does nothing if the `Future` is in any state other than `:unscheduled`.
+ #
+ # @return [Future] a reference to `self`
+ #
+ # @example Instance and execute in separate steps
+ # future = Concurrent::Future.new{ sleep(1); 42 }
+ # future.state #=> :unscheduled
+ # future.execute
+ # future.state #=> :pending
+ #
+ # @example Instance and execute in one line
+ # future = Concurrent::Future.new{ sleep(1); 42 }.execute
+ # future.state #=> :pending
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:53
+ def execute; end
+
+ # @!macro ivar_set_method
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:82
+ def set(value = T.unsafe(nil), &block); end
+
+ # Wait the given number of seconds for the operation to complete.
+ # On timeout attempt to cancel the operation.
+ #
+ # @param [Numeric] timeout the maximum time in seconds to wait.
+ # @return [Boolean] true if the operation completed before the timeout
+ # else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:121
+ def wait_or_cancel(timeout); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:133
+ def ns_initialize(value, opts); end
+
+ class << self
+ # Create a new `Future` object with the given block, execute it, and return the
+ # `:pending` object.
+ #
+ # @yield the asynchronous operation to perform
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @option opts [object, Array] :args zero or more arguments to be passed the task
+ # block on execution
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # @return [Future] the newly created `Future` in the `:pending` state
+ #
+ # @example
+ # future = Concurrent::Future.execute{ sleep(1); 42 }
+ # future.state #=> :pending
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/future.rb:77
+ def execute(opts = T.unsafe(nil), &block); end
+ end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:18
+Concurrent::GLOBAL_FAST_EXECUTOR = T.let(T.unsafe(nil), Concurrent::Delay)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:30
+Concurrent::GLOBAL_IMMEDIATE_EXECUTOR = T.let(T.unsafe(nil), Concurrent::ImmediateExecutor)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:22
+Concurrent::GLOBAL_IO_EXECUTOR = T.let(T.unsafe(nil), Concurrent::Delay)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:111
+Concurrent::GLOBAL_LOGGER = T.let(T.unsafe(nil), Concurrent::AtomicReference)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/configuration.rb:26
+Concurrent::GLOBAL_TIMER_SET = T.let(T.unsafe(nil), Concurrent::Delay)
+
+# @!macro concurrent_hash
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/hash.rb:49
+class Concurrent::Hash < ::Hash; end
+
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/hash.rb:16
+Concurrent::HashImplementation = Hash
+
+# An `IVar` is like a future that you can assign. As a future is a value that
+# is being computed that you can wait on, an `IVar` is a value that is waiting
+# to be assigned, that you can wait on. `IVars` are single assignment and
+# deterministic.
+#
+# Then, express futures as an asynchronous computation that assigns an `IVar`.
+# The `IVar` becomes the primitive on which [futures](Future) and
+# [dataflow](Dataflow) are built.
+#
+# An `IVar` is a single-element container that is normally created empty, and
+# can only be set once. The I in `IVar` stands for immutable. Reading an
+# `IVar` normally blocks until it is set. It is safe to set and read an `IVar`
+# from different threads.
+#
+# If you want to have some parallel task set the value in an `IVar`, you want
+# a `Future`. If you want to create a graph of parallel tasks all executed
+# when the values they depend on are ready you want `dataflow`. `IVar` is
+# generally a low-level primitive.
+#
+# ## Examples
+#
+# Create, set and get an `IVar`
+#
+# ```ruby
+# ivar = Concurrent::IVar.new
+# ivar.set 14
+# ivar.value #=> 14
+# ivar.set 2 # would now be an error
+# ```
+#
+# ## See Also
+#
+# 1. For the theory: Arvind, R. Nikhil, and K. Pingali.
+# [I-Structures: Data structures for parallel computing](http://dl.acm.org/citation.cfm?id=69562).
+# In Proceedings of Workshop on Graph Reduction, 1986.
+# 2. For recent application:
+# [DataDrivenFuture in Habanero Java from Rice](http://www.cs.rice.edu/~vs3/hjlib/doc/edu/rice/hj/api/HjDataDrivenFuture.html).
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:48
+class Concurrent::IVar < ::Concurrent::Synchronization::LockableObject
+ include ::Concurrent::Concern::Dereferenceable
+ include ::Concurrent::Concern::Obligation
+ include ::Concurrent::Concern::Observable
+
+ # Create a new `IVar` in the `:pending` state with the (optional) initial value.
+ #
+ # @param [Object] value the initial value
+ # @param [Hash] opts the options to create a message with
+ # @option opts [String] :dup_on_deref (false) call `#dup` before returning
+ # the data
+ # @option opts [String] :freeze_on_deref (false) call `#freeze` before
+ # returning the data
+ # @option opts [String] :copy_on_deref (nil) call the given `Proc` passing
+ # the internal value and returning the value returned from the proc
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:62
+ def initialize(value = T.unsafe(nil), opts = T.unsafe(nil), &block); end
+
+ # Add an observer on this object that will receive notification on update.
+ #
+ # Upon completion the `IVar` will notify all observers in a thread-safe way.
+ # The `func` method of the observer will be called with three arguments: the
+ # `Time` at which the `Future` completed the asynchronous operation, the
+ # final `value` (or `nil` on rejection), and the final `reason` (or `nil` on
+ # fulfillment).
+ #
+ # @param [Object] observer the object that will be notified of changes
+ # @param [Symbol] func symbol naming the method to call when this
+ # `Observable` has changes`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:81
+ def add_observer(observer = T.unsafe(nil), func = T.unsafe(nil), &block); end
+
+ # @!macro ivar_fail_method
+ # Set the `IVar` to failed due to some error and wake or notify all threads waiting on it.
+ #
+ # @param [Object] reason for the failure
+ # @raise [Concurrent::MultipleAssignmentError] if the `IVar` has already
+ # been set or otherwise completed
+ # @return [IVar] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:135
+ def fail(reason = T.unsafe(nil)); end
+
+ # @!macro ivar_set_method
+ # Set the `IVar` to a value and wake or notify all threads waiting on it.
+ #
+ # @!macro ivar_set_parameters_and_exceptions
+ # @param [Object] value the value to store in the `IVar`
+ # @yield A block operation to use for setting the value
+ # @raise [ArgumentError] if both a value and a block are given
+ # @raise [Concurrent::MultipleAssignmentError] if the `IVar` has already
+ # been set or otherwise completed
+ #
+ # @return [IVar] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:113
+ def set(value = T.unsafe(nil)); end
+
+ # Attempt to set the `IVar` with the given value or block. Return a
+ # boolean indicating the success or failure of the set operation.
+ #
+ # @!macro ivar_set_parameters_and_exceptions
+ #
+ # @return [Boolean] true if the value was set else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:145
+ def try_set(value = T.unsafe(nil), &block); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:202
+ def check_for_block_or_value!(block_given, value); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:177
+ def complete(success, value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:184
+ def complete_without_notification(success, value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:190
+ def notify_observers(value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:195
+ def ns_complete_without_notification(success, value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:155
+ def ns_initialize(value, opts); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/ivar.rb:168
+ def safe_execute(task, args = T.unsafe(nil)); end
+end
+
+# Raised when an operation is attempted which is not legal given the
+# receiver's current state
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:20
+class Concurrent::IllegalOperationError < ::Concurrent::Error; end
+
+# An executor service which runs all operations on the current thread,
+# blocking as necessary. Operations are performed in the order they are
+# received and no two operations can be performed simultaneously.
+#
+# This executor service exists mainly for testing an debugging. When used
+# it immediately runs every `#post` operation on the current thread, blocking
+# that thread until the operation is complete. This can be very beneficial
+# during testing because it makes all operations deterministic.
+#
+# @note Intended for use primarily in testing and debugging.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:17
+class Concurrent::ImmediateExecutor < ::Concurrent::AbstractExecutorService
+ include ::Concurrent::SerialExecutorService
+
+ # Creates a new executor
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:21
+ def initialize; end
+
+ # @!macro executor_service_method_left_shift
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:34
+ def <<(task); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:59
+ def kill; end
+
+ # @!macro executor_service_method_post
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:26
+ def post(*args, &task); end
+
+ # @!macro executor_service_method_running_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:40
+ def running?; end
+
+ # @!macro executor_service_method_shutdown
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:55
+ def shutdown; end
+
+ # @!macro executor_service_method_shutdown_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:50
+ def shutdown?; end
+
+ # @!macro executor_service_method_shuttingdown_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:45
+ def shuttingdown?; end
+
+ # @!macro executor_service_method_wait_for_termination
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/immediate_executor.rb:62
+ def wait_for_termination(timeout = T.unsafe(nil)); end
+end
+
+# Raised when an attempt is made to violate an immutability guarantee.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:16
+class Concurrent::ImmutabilityError < ::Concurrent::Error; end
+
+# A thread-safe, immutable variation of Ruby's standard `Struct`.
+#
+# @see http://ruby-doc.org/core/Struct.html Ruby standard library `Struct`
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:9
+module Concurrent::ImmutableStruct
+ include ::Concurrent::Synchronization::AbstractStruct
+
+ # @!macro struct_equality
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:51
+ def ==(other); end
+
+ # @!macro struct_get
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:46
+ def [](member); end
+
+ # @!macro struct_each
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:56
+ def each(&block); end
+
+ # @!macro struct_each_pair
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:62
+ def each_pair(&block); end
+
+ # @!macro struct_inspect
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:29
+ def inspect; end
+
+ # @!macro struct_merge
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:36
+ def merge(other, &block); end
+
+ # @!macro struct_select
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:68
+ def select(&block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:21
+ def to_a; end
+
+ # @!macro struct_to_h
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:41
+ def to_h; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:33
+ def to_s; end
+
+ # @!macro struct_values
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:17
+ def values; end
+
+ # @!macro struct_values_at
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:24
+ def values_at(*indexes); end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:76
+ def initialize_copy(original); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:12
+ def included(base); end
+
+ # @!macro struct_new
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:82
+ def new(*args, &block); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/immutable_struct.rb:92
+Concurrent::ImmutableStruct::FACTORY = T.let(T.unsafe(nil), T.untyped)
+
+# An executor service which runs all operations on a new thread, blocking
+# until it completes. Operations are performed in the order they are received
+# and no two operations can be performed simultaneously.
+#
+# This executor service exists mainly for testing an debugging. When used it
+# immediately runs every `#post` operation on a new thread, blocking the
+# current thread until the operation is complete. This is similar to how the
+# ImmediateExecutor works, but the operation has the full stack of the new
+# thread at its disposal. This can be helpful when the operations will spawn
+# more operations on the same executor and so on - such a situation might
+# overflow the single stack in case of an ImmediateExecutor, which is
+# inconsistent with how it would behave for a threaded executor.
+#
+# @note Intended for use primarily in testing and debugging.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/indirect_immediate_executor.rb:19
+class Concurrent::IndirectImmediateExecutor < ::Concurrent::ImmediateExecutor
+ # Creates a new executor
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/indirect_immediate_executor.rb:21
+ def initialize; end
+
+ # @!macro executor_service_method_post
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/indirect_immediate_executor.rb:27
+ def post(*args, &task); end
+end
+
+# Raised when an object's methods are called when it has not been
+# properly initialized.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:24
+class Concurrent::InitializationError < ::Concurrent::Error; end
+
+# Raised when a lifecycle method (such as `stop`) is called in an improper
+# sequence or when the object is in an inappropriate state.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:13
+class Concurrent::LifecycleError < ::Concurrent::Error; end
+
+# @!macro warn.edge
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:6
+class Concurrent::LockFreeStack < ::Concurrent::Synchronization::Object
+ include ::Enumerable
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # @param [Node] head
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:51
+ def initialize(head = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:37
+ def __initialize_atomic_fields__; end
+
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:118
+ def clear; end
+
+ # @return [self]
+ # @yield over the cleared stack
+ # @yieldparam [Object] value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:142
+ def clear_each(&block); end
+
+ # @param [Node] head
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:128
+ def clear_if(head); end
+
+ # @param [Node] head
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:99
+ def compare_and_clear(head); end
+
+ # @param [Node] head
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:85
+ def compare_and_pop(head); end
+
+ # @param [Node] head
+ # @param [Object] value
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:65
+ def compare_and_push(head, value); end
+
+ # @param [Node] head
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:107
+ def each(head = T.unsafe(nil)); end
+
+ # @param [Node] head
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:58
+ def empty?(head = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:158
+ def inspect; end
+
+ # @return [Node]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:79
+ def peek; end
+
+ # @return [Object]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:90
+ def pop; end
+
+ # @param [Object] value
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:71
+ def push(value); end
+
+ # @param [Node] head
+ # @param [Node] new_head
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:135
+ def replace_if(head, new_head); end
+
+ # @return [String] Short string representation.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:154
+ def to_s; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:37
+ def compare_and_set_head(expected, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:37
+ def head; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:37
+ def head=(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:37
+ def swap_head(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:37
+ def update_head(&block); end
+
+ class << self
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:41
+ def of1(value); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:46
+ def of2(value1, value2); end
+ end
+end
+
+# The singleton for empty node
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:32
+Concurrent::LockFreeStack::EMPTY = T.let(T.unsafe(nil), Concurrent::LockFreeStack::Node)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:10
+class Concurrent::LockFreeStack::Node
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:23
+ def initialize(value, next_node); end
+
+ # @return [Node]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:14
+ def next_node; end
+
+ # @return [Object]
+ # @!visibility private
+ # allow to nil-ify to free GC when the entry is no longer relevant, not synchronised
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:17
+ def value; end
+
+ # @return [Object]
+ # @!visibility private
+ # allow to nil-ify to free GC when the entry is no longer relevant, not synchronised
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:21
+ def value=(_arg0); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/collection/lock_free_stack.rb:28
+ def [](*_arg0); end
+ end
+end
+
+# Either {FiberLocalVar} or {ThreadLocalVar} depending on whether Mutex (and Monitor)
+# are held, respectively, per Fiber or per Thread.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/lock_local_var.rb:22
+Concurrent::LockLocalVar = Concurrent::FiberLocalVar
+
+# An `MVar` is a synchronized single element container. They are empty or
+# contain one item. Taking a value from an empty `MVar` blocks, as does
+# putting a value into a full one. You can either think of them as blocking
+# queue of length one, or a special kind of mutable variable.
+#
+# On top of the fundamental `#put` and `#take` operations, we also provide a
+# `#modify` that is atomic with respect to operations on the same instance.
+# These operations all support timeouts.
+#
+# We also support non-blocking operations `#try_put!` and `#try_take!`, a
+# `#set!` that ignores existing values, a `#value` that returns the value
+# without removing it or returns `MVar::EMPTY`, and a `#modify!` that yields
+# `MVar::EMPTY` if the `MVar` is empty and can be used to set `MVar::EMPTY`.
+# You shouldn't use these operations in the first instance.
+#
+# `MVar` is a [Dereferenceable](Dereferenceable).
+#
+# `MVar` is related to M-structures in Id, `MVar` in Haskell and `SyncVar` in Scala.
+#
+# Note that unlike the original Haskell paper, our `#take` is blocking. This is how
+# Haskell and Scala do it today.
+#
+# @!macro copy_options
+#
+# ## See Also
+#
+# 1. P. Barth, R. Nikhil, and Arvind. [M-Structures: Extending a parallel, non- strict, functional language with state](http://dl.acm.org/citation.cfm?id=652538). In Proceedings of the 5th
+# ACM Conference on Functional Programming Languages and Computer Architecture (FPCA), 1991.
+#
+# 2. S. Peyton Jones, A. Gordon, and S. Finne. [Concurrent Haskell](http://dl.acm.org/citation.cfm?id=237794).
+# In Proceedings of the 23rd Symposium on Principles of Programming Languages
+# (PoPL), 1996.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:38
+class Concurrent::MVar < ::Concurrent::Synchronization::Object
+ include ::Concurrent::Concern::Dereferenceable
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # Create a new `MVar`, either empty or with an initial value.
+ #
+ # @param [Hash] opts the options controlling how the future will be processed
+ #
+ # @!macro deref_options
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:54
+ def initialize(value = T.unsafe(nil), opts = T.unsafe(nil)); end
+
+ # acquires lock on the from an `MVAR`, yields the value to provided block,
+ # and release lock. A timeout can be set to limit the time spent blocked,
+ # in which case it returns `TIMEOUT` if the time is exceeded.
+ # @return [Object] the value returned by the block, or `TIMEOUT`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:86
+ def borrow(timeout = T.unsafe(nil)); end
+
+ # Returns if the `MVar` is currently empty.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:195
+ def empty?; end
+
+ # Returns if the `MVar` currently contains a value.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:200
+ def full?; end
+
+ # Atomically `take`, yield the value to a block for transformation, and then
+ # `put` the transformed value. Returns the pre-transform value. A timeout can
+ # be set to limit the time spent blocked, in which case it returns `TIMEOUT`
+ # if the time is exceeded.
+ # @return [Object] the pre-transform value, or `TIMEOUT`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:123
+ def modify(timeout = T.unsafe(nil)); end
+
+ # Non-blocking version of `modify` that will yield with `EMPTY` if there is no value yet.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:179
+ def modify!; end
+
+ # Put a value into an `MVar`, blocking if there is already a value until
+ # it is empty. A timeout can be set to limit the time spent blocked, in
+ # which case it returns `TIMEOUT` if the time is exceeded.
+ # @return [Object] the value that was put, or `TIMEOUT`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:103
+ def put(value, timeout = T.unsafe(nil)); end
+
+ # Non-blocking version of `put` that will overwrite an existing value.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:169
+ def set!(value); end
+
+ # Remove the value from an `MVar`, leaving it empty, and blocking if there
+ # isn't a value. A timeout can be set to limit the time spent blocked, in
+ # which case it returns `TIMEOUT` if the time is exceeded.
+ # @return [Object] the value that was taken, or `TIMEOUT`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:66
+ def take(timeout = T.unsafe(nil)); end
+
+ # Non-blocking version of `put`, that returns whether or not it was successful.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:156
+ def try_put!(value); end
+
+ # Non-blocking version of `take`, that returns `EMPTY` instead of blocking.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:142
+ def try_take!; end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:206
+ def synchronize(&block); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:212
+ def unlocked_empty?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:216
+ def unlocked_full?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:224
+ def wait_for_empty(timeout); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:220
+ def wait_for_full(timeout); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:228
+ def wait_while(condition, timeout); end
+end
+
+# Unique value that represents that an `MVar` was empty
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:43
+Concurrent::MVar::EMPTY = T.let(T.unsafe(nil), Object)
+
+# Unique value that represents that an `MVar` timed out before it was able
+# to produce a value.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mvar.rb:47
+Concurrent::MVar::TIMEOUT = T.let(T.unsafe(nil), Object)
+
+# `Concurrent::Map` is a hash-like object and should have much better performance
+# characteristics, especially under high concurrency, than `Concurrent::Hash`.
+# However, `Concurrent::Map `is not strictly semantically equivalent to a ruby `Hash`
+# -- for instance, it does not necessarily retain ordering by insertion time as `Hash`
+# does. For most uses it should do fine though, and we recommend you consider
+# `Concurrent::Map` instead of `Concurrent::Hash` for your concurrency-safe hash needs.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:39
+class Concurrent::Map < ::Concurrent::Collection::MriMapBackend
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:279
+ def each; end
+
+ # Iterates over each key.
+ # @yield for each key in the map
+ # @yieldparam key [Object]
+ # @return [self]
+ # @!macro map.atomic_method_with_block
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:255
+ def each_key; end
+
+ # Iterates over each key value pair.
+ # @yield for each key value pair in the map
+ # @yieldparam key [Object]
+ # @yieldparam value [Object]
+ # @return [self]
+ # @!macro map.atomic_method_with_block
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:274
+ def each_pair; end
+
+ # Iterates over each value.
+ # @yield for each value in the map
+ # @yieldparam value [Object]
+ # @return [self]
+ # @!macro map.atomic_method_with_block
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:264
+ def each_value; end
+
+ # Is map empty?
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:291
+ def empty?; end
+
+ # Get a value with key, or default_value when key is absent,
+ # or fail when no default_value is given.
+ # @param [Object] key
+ # @param [Object] default_value
+ # @yield default value for a key
+ # @yieldparam key [Object]
+ # @yieldreturn [Object] default value
+ # @return [Object] the value or default value
+ # @raise [KeyError] when key is missing and no default_value is provided
+ # @!macro map_method_not_atomic
+ # @note The "fetch-then-act" methods of `Map` are not atomic. `Map` is intended
+ # to be use as a concurrency primitive with strong happens-before
+ # guarantees. It is not intended to be used as a high-level abstraction
+ # supporting complex operations. All read and write operations are
+ # thread safe, but no guarantees are made regarding race conditions
+ # between the fetch operation and yielding to the block. Additionally,
+ # this method does not support recursion. This is due to internal
+ # constraints that are very unlikely to change in the near future.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:183
+ def fetch(key, default_value = T.unsafe(nil)); end
+
+ # Fetch value with key, or store default value when key is absent,
+ # or fail when no default_value is given. This is a two step operation,
+ # therefore not atomic. The store can overwrite other concurrently
+ # stored value.
+ # @param [Object] key
+ # @param [Object] default_value
+ # @yield default value for a key
+ # @yieldparam key [Object]
+ # @yieldreturn [Object] default value
+ # @return [Object] the value or default value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:205
+ def fetch_or_store(key, default_value = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:162
+ def get(key); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:321
+ def inspect; end
+
+ # Find key of a value.
+ # @param [Object] value
+ # @return [Object, nil] key or nil when not found
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:284
+ def key(value); end
+
+ # All keys
+ # @return [::Array] keys
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:236
+ def keys; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:305
+ def marshal_dump; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:313
+ def marshal_load(hash); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:163
+ def put(key, value); end
+
+ # Insert value into map with key if key is absent in one atomic step.
+ # @param [Object] key
+ # @param [Object] value
+ # @return [Object, nil] the previous value when key was present or nil when there was no key
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:215
+ def put_if_absent(key, value); end
+
+ # Is the value stored in the map. Iterates over all values.
+ # @param [Object] value
+ # @return [true, false]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:227
+ def value?(value); end
+
+ # All values
+ # @return [::Array] values
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:244
+ def values; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:331
+ def initialize_copy(other); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:336
+ def populate_from(hash); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:327
+ def raise_fetch_no_key; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/map.rb:341
+ def validate_options_hash!(options); end
+end
+
+# Raised when an object with a start/stop lifecycle has been started an
+# excessive number of times. Often used in conjunction with a restart
+# policy or strategy.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:29
+class Concurrent::MaxRestartFrequencyError < ::Concurrent::Error; end
+
+# A `Maybe` encapsulates an optional value. A `Maybe` either contains a value
+# of (represented as `Just`), or it is empty (represented as `Nothing`). Using
+# `Maybe` is a good way to deal with errors or exceptional cases without
+# resorting to drastic measures such as exceptions.
+#
+# `Maybe` is a replacement for the use of `nil` with better type checking.
+#
+# For compatibility with {Concurrent::Concern::Obligation} the predicate and
+# accessor methods are aliased as `fulfilled?`, `rejected?`, `value`, and
+# `reason`.
+#
+# ## Motivation
+#
+# A common pattern in languages with pattern matching, such as Erlang and
+# Haskell, is to return *either* a value *or* an error from a function
+# Consider this Erlang code:
+#
+# ```erlang
+# case file:consult("data.dat") of
+# {ok, Terms} -> do_something_useful(Terms);
+# {error, Reason} -> lager:error(Reason)
+# end.
+# ```
+#
+# In this example the standard library function `file:consult` returns a
+# [tuple](http://erlang.org/doc/reference_manual/data_types.html#id69044)
+# with two elements: an [atom](http://erlang.org/doc/reference_manual/data_types.html#id64134)
+# (similar to a ruby symbol) and a variable containing ancillary data. On
+# success it returns the atom `ok` and the data from the file. On failure it
+# returns `error` and a string with an explanation of the problem. With this
+# pattern there is no ambiguity regarding success or failure. If the file is
+# empty the return value cannot be misinterpreted as an error. And when an
+# error occurs the return value provides useful information.
+#
+# In Ruby we tend to return `nil` when an error occurs or else we raise an
+# exception. Both of these idioms are problematic. Returning `nil` is
+# ambiguous because `nil` may also be a valid value. It also lacks
+# information pertaining to the nature of the error. Raising an exception
+# is both expensive and usurps the normal flow of control. All of these
+# problems can be solved with the use of a `Maybe`.
+#
+# A `Maybe` is unambiguous with regard to whether or not it contains a value.
+# When `Just` it contains a value, when `Nothing` it does not. When `Just`
+# the value it contains may be `nil`, which is perfectly valid. When
+# `Nothing` the reason for the lack of a value is contained as well. The
+# previous Erlang example can be duplicated in Ruby in a principled way by
+# having functions return `Maybe` objects:
+#
+# ```ruby
+# result = MyFileUtils.consult("data.dat") # returns a Maybe
+# if result.just?
+# do_something_useful(result.value) # or result.just
+# else
+# logger.error(result.reason) # or result.nothing
+# end
+# ```
+#
+# @example Returning a Maybe from a Function
+# module MyFileUtils
+# def self.consult(path)
+# file = File.open(path, 'r')
+# Concurrent::Maybe.just(file.read)
+# rescue => ex
+# return Concurrent::Maybe.nothing(ex)
+# ensure
+# file.close if file
+# end
+# end
+#
+# maybe = MyFileUtils.consult('bogus.file')
+# maybe.just? #=> false
+# maybe.nothing? #=> true
+# maybe.reason #=> #
+#
+# maybe = MyFileUtils.consult('README.md')
+# maybe.just? #=> true
+# maybe.nothing? #=> false
+# maybe.value #=> "# Concurrent Ruby\n[![Gem Version..."
+#
+# @example Using Maybe with a Block
+# result = Concurrent::Maybe.from do
+# Client.find(10) # Client is an ActiveRecord model
+# end
+#
+# # -- if the record was found
+# result.just? #=> true
+# result.value #=> #
+#
+# # -- if the record was not found
+# result.just? #=> false
+# result.reason #=> ActiveRecord::RecordNotFound
+#
+# @example Using Maybe with the Null Object Pattern
+# # In a Rails controller...
+# result = ClientService.new(10).find # returns a Maybe
+# render json: result.or(NullClient.new)
+#
+# @see https://hackage.haskell.org/package/base-4.2.0.1/docs/Data-Maybe.html Haskell Data.Maybe
+# @see https://github.com/purescript/purescript-maybe/blob/master/docs/Data.Maybe.md PureScript Data.Maybe
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:104
+class Concurrent::Maybe < ::Concurrent::Synchronization::Object
+ include ::Comparable
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # Create a new `Maybe` with the given attributes.
+ #
+ # @param [Object] just The value when `Just` else `NONE`.
+ # @param [Exception, Object] nothing The exception when `Nothing` else `NONE`.
+ #
+ # @return [Maybe] The new `Maybe`.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:224
+ def initialize(just, nothing); end
+
+ # Comparison operator.
+ #
+ # @return [Integer] 0 if self and other are both `Nothing`;
+ # -1 if self is `Nothing` and other is `Just`;
+ # 1 if self is `Just` and other is nothing;
+ # `self.just <=> other.just` if both self and other are `Just`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:199
+ def <=>(other); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:179
+ def fulfilled?; end
+
+ # The value of a `Maybe` when `Just`. Will be `NONE` when `Nothing`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:114
+ def just; end
+
+ # Is this `Maybe` a `Just` (successfully fulfilled with a value)?
+ #
+ # @return [Boolean] True if `Just` or false if `Nothing`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:176
+ def just?; end
+
+ # The reason for the `Maybe` when `Nothing`. Will be `NONE` when `Just`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:117
+ def nothing; end
+
+ # Is this `Maybe` a `nothing` (rejected with an exception upon fulfillment)?
+ #
+ # @return [Boolean] True if `Nothing` or false if `Just`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:184
+ def nothing?; end
+
+ # Return either the value of self or the given default value.
+ #
+ # @return [Object] The value of self when `Just`; else the given default.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:210
+ def or(other); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:191
+ def reason; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:187
+ def rejected?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:189
+ def value; end
+
+ class << self
+ # Create a new `Maybe` using the given block.
+ #
+ # Runs the given block passing all function arguments to the block as block
+ # arguments. If the block runs to completion without raising an exception
+ # a new `Just` is created with the value set to the return value of the
+ # block. If the block raises an exception a new `Nothing` is created with
+ # the reason being set to the raised exception.
+ #
+ # @param [Array] args Zero or more arguments to pass to the block.
+ # @yield The block from which to create a new `Maybe`.
+ # @yieldparam [Array] args Zero or more block arguments passed as
+ # arguments to the function.
+ #
+ # @return [Maybe] The newly created object.
+ #
+ # @raise [ArgumentError] when no block given.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:137
+ def from(*args); end
+
+ # Create a new `Just` with the given value.
+ #
+ # @param [Object] value The value to set for the new `Maybe` object.
+ #
+ # @return [Maybe] The newly created object.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:152
+ def just(value); end
+
+ # Create a new `Nothing` with the given (optional) reason.
+ #
+ # @param [Exception] error The reason to set for the new `Maybe` object.
+ # When given a string a new `StandardError` will be created with the
+ # argument as the message. When no argument is given a new
+ # `StandardError` with an empty message will be created.
+ #
+ # @return [Maybe] The newly created object.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:164
+ def nothing(error = T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:119
+ def new(*args, &block); end
+ end
+end
+
+# Indicates that the given attribute has not been set.
+# When `Just` the {#nothing} getter will return `NONE`.
+# When `Nothing` the {#just} getter will return `NONE`.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/maybe.rb:111
+Concurrent::Maybe::NONE = T.let(T.unsafe(nil), Object)
+
+# Raised when an attempt is made to modify an immutable object
+# (such as an `IVar`) after its final state has been set.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:33
+class Concurrent::MultipleAssignmentError < ::Concurrent::Error
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:36
+ def initialize(message = T.unsafe(nil), inspection_data = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:41
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:34
+ def inspection_data; end
+end
+
+# Aggregates multiple exceptions.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:58
+class Concurrent::MultipleErrors < ::Concurrent::Error
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:61
+ def initialize(errors, message = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:59
+ def errors; end
+end
+
+# An thread-safe variation of Ruby's standard `Struct`. Values can be set at
+# construction or safely changed at any time during the object's lifecycle.
+#
+# @see http://ruby-doc.org/core/Struct.html Ruby standard library `Struct`
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:10
+module Concurrent::MutableStruct
+ include ::Concurrent::Synchronization::AbstractStruct
+
+ # @!macro struct_equality
+ #
+ # Equality
+ #
+ # @return [Boolean] true if other has the same struct subclass and has
+ # equal member values (according to `Object#==`)
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:128
+ def ==(other); end
+
+ # @!macro struct_get
+ #
+ # Attribute Reference
+ #
+ # @param [Symbol, String, Integer] member the string or symbol name of the member
+ # for which to obtain the value or the member's index
+ #
+ # @return [Object] the value of the given struct member or the member at the given index.
+ #
+ # @raise [NameError] if the member does not exist
+ # @raise [IndexError] if the index is out of range.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:118
+ def [](member); end
+
+ # @!macro struct_set
+ #
+ # Attribute Assignment
+ #
+ # Sets the value of the given struct member or the member at the given index.
+ #
+ # @param [Symbol, String, Integer] member the string or symbol name of the member
+ # for which to obtain the value or the member's index
+ #
+ # @return [Object] the value of the given struct member or the member at the given index.
+ #
+ # @raise [NameError] if the name does not exist
+ # @raise [IndexError] if the index is out of range.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:185
+ def []=(member, value); end
+
+ # @!macro struct_each
+ #
+ # Yields the value of each struct member in order. If no block is given
+ # an enumerator is returned.
+ #
+ # @yield the operation to be performed on each struct member
+ # @yieldparam [Object] value each struct value (in order)
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:139
+ def each(&block); end
+
+ # @!macro struct_each_pair
+ #
+ # Yields the name and value of each struct member in order. If no block is
+ # given an enumerator is returned.
+ #
+ # @yield the operation to be performed on each struct member/value pair
+ # @yieldparam [Object] member each struct member (in order)
+ # @yieldparam [Object] value each struct value (in order)
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:152
+ def each_pair(&block); end
+
+ # @!macro struct_inspect
+ #
+ # Describe the contents of this struct in a string.
+ #
+ # @return [String] the contents of this struct in a string
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:72
+ def inspect; end
+
+ # @!macro struct_merge
+ #
+ # Returns a new struct containing the contents of `other` and the contents
+ # of `self`. If no block is specified, the value for entries with duplicate
+ # keys will be that of `other`. Otherwise the value for each duplicate key
+ # is determined by calling the block with the key, its value in `self` and
+ # its value in `other`.
+ #
+ # @param [Hash] other the hash from which to set the new values
+ # @yield an options block for resolving duplicate keys
+ # @yieldparam [String, Symbol] member the name of the member which is duplicated
+ # @yieldparam [Object] selfvalue the value of the member in `self`
+ # @yieldparam [Object] othervalue the value of the member in `other`
+ #
+ # @return [Synchronization::AbstractStruct] a new struct with the new values
+ #
+ # @raise [ArgumentError] of given a member that is not defined in the struct
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:94
+ def merge(other, &block); end
+
+ # @!macro struct_select
+ #
+ # Yields each member value from the struct to the block and returns an Array
+ # containing the member values from the struct for which the given block
+ # returns a true value (equivalent to `Enumerable#select`).
+ #
+ # @yield the operation to be performed on each struct member
+ # @yieldparam [Object] value each struct value (in order)
+ #
+ # @return [Array] an array containing each value for which the block returns true
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:167
+ def select(&block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:54
+ def to_a; end
+
+ # @!macro struct_to_h
+ #
+ # Returns a hash containing the names and values for the struct’s members.
+ #
+ # @return [Hash] the names and values for the struct’s members
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:103
+ def to_h; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:75
+ def to_s; end
+
+ # @!macro struct_values
+ #
+ # Returns the values for this struct as an Array.
+ #
+ # @return [Array] the values for this struct
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:51
+ def values; end
+
+ # @!macro struct_values_at
+ #
+ # Returns the struct member values for each selector as an Array.
+ #
+ # A selector may be either an Integer offset or a Range of offsets (as in `Array#values_at`).
+ #
+ # @param [Fixnum, Range] indexes the index(es) from which to obatin the values (in order)
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:63
+ def values_at(*indexes); end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:202
+ def initialize_copy(original); end
+
+ class << self
+ # @!macro struct_new
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:210
+ def new(*args, &block); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/mutable_struct.rb:220
+Concurrent::MutableStruct::FACTORY = T.let(T.unsafe(nil), T.untyped)
+
+# @!macro atomic_boolean
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:8
+class Concurrent::MutexAtomicBoolean
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # @!macro atomic_boolean_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:12
+ def initialize(initial = T.unsafe(nil)); end
+
+ # @!macro atomic_boolean_method_false_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:34
+ def false?; end
+
+ # @!macro atomic_boolean_method_make_false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:44
+ def make_false; end
+
+ # @!macro atomic_boolean_method_make_true
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:39
+ def make_true; end
+
+ # @!macro atomic_boolean_method_true_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:29
+ def true?; end
+
+ # @!macro atomic_boolean_method_value_get
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:19
+ def value; end
+
+ # @!macro atomic_boolean_method_value_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:24
+ def value=(value); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:51
+ def synchronize; end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_boolean.rb:62
+ def ns_make_value(value); end
+end
+
+# @!macro atomic_fixnum
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:9
+class Concurrent::MutexAtomicFixnum
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # @!macro atomic_fixnum_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:13
+ def initialize(initial = T.unsafe(nil)); end
+
+ # @!macro atomic_fixnum_method_compare_and_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:44
+ def compare_and_set(expect, update); end
+
+ # @!macro atomic_fixnum_method_decrement
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:37
+ def decrement(delta = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:41
+ def down(delta = T.unsafe(nil)); end
+
+ # @!macro atomic_fixnum_method_increment
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:30
+ def increment(delta = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:34
+ def up(delta = T.unsafe(nil)); end
+
+ # @!macro atomic_fixnum_method_update
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:56
+ def update; end
+
+ # @!macro atomic_fixnum_method_value_get
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:20
+ def value; end
+
+ # @!macro atomic_fixnum_method_value_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:25
+ def value=(value); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:65
+ def synchronize; end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_atomic_fixnum.rb:76
+ def ns_set(value); end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:9
+class Concurrent::MutexAtomicReference
+ include ::Concurrent::AtomicDirectUpdate
+ include ::Concurrent::AtomicNumericCompareAndSetWrapper
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # @!macro atomic_reference_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:15
+ def initialize(value = T.unsafe(nil)); end
+
+ # @!macro atomic_reference_method_get
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:22
+ def get; end
+
+ # @!macro atomic_reference_method_get_and_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:34
+ def get_and_set(new_value); end
+
+ # @!macro atomic_reference_method_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:28
+ def set(new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:41
+ def swap(new_value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:25
+ def value; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:31
+ def value=(new_value); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:58
+ def synchronize; end
+
+ private
+
+ # @!macro atomic_reference_method_compare_and_set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic_reference/mutex_atomic.rb:44
+ def _compare_and_set(old_value, new_value); end
+end
+
+# @!macro count_down_latch
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_count_down_latch.rb:9
+class Concurrent::MutexCountDownLatch < ::Concurrent::Synchronization::LockableObject
+ # @!macro count_down_latch_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_count_down_latch.rb:12
+ def initialize(count = T.unsafe(nil)); end
+
+ # @!macro count_down_latch_method_count
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_count_down_latch.rb:34
+ def count; end
+
+ # @!macro count_down_latch_method_count_down
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_count_down_latch.rb:26
+ def count_down; end
+
+ # @!macro count_down_latch_method_wait
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_count_down_latch.rb:21
+ def wait(timeout = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_count_down_latch.rb:40
+ def ns_initialize(count); end
+end
+
+# @!macro semaphore
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:9
+class Concurrent::MutexSemaphore < ::Concurrent::Synchronization::LockableObject
+ # @!macro semaphore_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:12
+ def initialize(count); end
+
+ # @!macro semaphore_method_acquire
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:20
+ def acquire(permits = T.unsafe(nil)); end
+
+ # @!macro semaphore_method_available_permits
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:38
+ def available_permits; end
+
+ # @!macro semaphore_method_drain_permits
+ #
+ # Acquires and returns all permits that are immediately available.
+ #
+ # @return [Integer]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:47
+ def drain_permits; end
+
+ # Shrinks the number of available permits by the indicated reduction.
+ #
+ # @param [Fixnum] reduction Number of permits to remove.
+ #
+ # @raise [ArgumentError] if `reduction` is not an integer or is negative
+ #
+ # @raise [ArgumentError] if `@free` - `@reduction` is less than zero
+ #
+ # @return [nil]
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:99
+ def reduce_permits(reduction); end
+
+ # @!macro semaphore_method_release
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:77
+ def release(permits = T.unsafe(nil)); end
+
+ # @!macro semaphore_method_try_acquire
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:54
+ def try_acquire(permits = T.unsafe(nil), timeout = T.unsafe(nil)); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:110
+ def ns_initialize(count); end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:117
+ def try_acquire_now(permits); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/mutex_semaphore.rb:127
+ def try_acquire_timed(permits, timeout); end
+end
+
+# Various classes within allows for +nil+ values to be stored,
+# so a special +NULL+ token is required to indicate the "nil-ness".
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/constants.rb:6
+Concurrent::NULL = T.let(T.unsafe(nil), Object)
+
+# Suppresses all output when used for logging.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/concern/logging.rb:108
+Concurrent::NULL_LOGGER = T.let(T.unsafe(nil), Proc)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/options.rb:6
+module Concurrent::Options
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/options.rb:27
+ def executor(executor_identifier); end
+
+ # Get the requested `Executor` based on the values set in the options hash.
+ #
+ # @param [Hash] opts the options defining the requested executor
+ # @option opts [Executor] :executor when set use the given `Executor` instance.
+ # Three special values are also supported: `:fast` returns the global fast executor,
+ # `:io` returns the global io executor, and `:immediate` returns a new
+ # `ImmediateExecutor` object.
+ #
+ # @return [Executor, nil] the requested thread pool, or nil when no option specified
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/options.rb:19
+ def executor_from_options(opts = T.unsafe(nil)); end
+ end
+end
+
+# Promises are inspired by the JavaScript [Promises/A](http://wiki.commonjs.org/wiki/Promises/A)
+# and [Promises/A+](http://promises-aplus.github.io/promises-spec/) specifications.
+#
+# > A promise represents the eventual value returned from the single
+# > completion of an operation.
+#
+# Promises are similar to futures and share many of the same behaviours.
+# Promises are far more robust, however. Promises can be chained in a tree
+# structure where each promise may have zero or more children. Promises are
+# chained using the `then` method. The result of a call to `then` is always
+# another promise. Promises are resolved asynchronously (with respect to the
+# main thread) but in a strict order: parents are guaranteed to be resolved
+# before their children, children before their younger siblings. The `then`
+# method takes two parameters: an optional block to be executed upon parent
+# resolution and an optional callable to be executed upon parent failure. The
+# result of each promise is passed to each of its children upon resolution.
+# When a promise is rejected all its children will be summarily rejected and
+# will receive the reason.
+#
+# Promises have several possible states: *:unscheduled*, *:pending*,
+# *:processing*, *:rejected*, or *:fulfilled*. These are also aggregated as
+# `#incomplete?` and `#complete?`. When a Promise is created it is set to
+# *:unscheduled*. Once the `#execute` method is called the state becomes
+# *:pending*. Once a job is pulled from the thread pool's queue and is given
+# to a thread for processing (often immediately upon `#post`) the state
+# becomes *:processing*. The future will remain in this state until processing
+# is complete. A future that is in the *:unscheduled*, *:pending*, or
+# *:processing* is considered `#incomplete?`. A `#complete?` Promise is either
+# *:rejected*, indicating that an exception was thrown during processing, or
+# *:fulfilled*, indicating success. If a Promise is *:fulfilled* its `#value`
+# will be updated to reflect the result of the operation. If *:rejected* the
+# `reason` will be updated with a reference to the thrown exception. The
+# predicate methods `#unscheduled?`, `#pending?`, `#rejected?`, and
+# `#fulfilled?` can be called at any time to obtain the state of the Promise,
+# as can the `#state` method, which returns a symbol.
+#
+# Retrieving the value of a promise is done through the `value` (alias:
+# `deref`) method. Obtaining the value of a promise is a potentially blocking
+# operation. When a promise is *rejected* a call to `value` will return `nil`
+# immediately. When a promise is *fulfilled* a call to `value` will
+# immediately return the current value. When a promise is *pending* a call to
+# `value` will block until the promise is either *rejected* or *fulfilled*. A
+# *timeout* value can be passed to `value` to limit how long the call will
+# block. If `nil` the call will block indefinitely. If `0` the call will not
+# block. Any other integer or float value will indicate the maximum number of
+# seconds to block.
+#
+# Promises run on the global thread pool.
+#
+# @!macro copy_options
+#
+# ### Examples
+#
+# Start by requiring promises
+#
+# ```ruby
+# require 'concurrent/promise'
+# ```
+#
+# Then create one
+#
+# ```ruby
+# p = Concurrent::Promise.execute do
+# # do something
+# 42
+# end
+# ```
+#
+# Promises can be chained using the `then` method. The `then` method accepts a
+# block and an executor, to be executed on fulfillment, and a callable argument to be executed
+# on rejection. The result of the each promise is passed as the block argument
+# to chained promises.
+#
+# ```ruby
+# p = Concurrent::Promise.new{10}.then{|x| x * 2}.then{|result| result - 10 }.execute
+# ```
+#
+# And so on, and so on, and so on...
+#
+# ```ruby
+# p = Concurrent::Promise.fulfill(20).
+# then{|result| result - 10 }.
+# then{|result| result * 3 }.
+# then(executor: different_executor){|result| result % 5 }.execute
+# ```
+#
+# The initial state of a newly created Promise depends on the state of its parent:
+# - if parent is *unscheduled* the child will be *unscheduled*
+# - if parent is *pending* the child will be *pending*
+# - if parent is *fulfilled* the child will be *pending*
+# - if parent is *rejected* the child will be *pending* (but will ultimately be *rejected*)
+#
+# Promises are executed asynchronously from the main thread. By the time a
+# child Promise finishes initialization it may be in a different state than its
+# parent (by the time a child is created its parent may have completed
+# execution and changed state). Despite being asynchronous, however, the order
+# of execution of Promise objects in a chain (or tree) is strictly defined.
+#
+# There are multiple ways to create and execute a new `Promise`. Both ways
+# provide identical behavior:
+#
+# ```ruby
+# # create, operate, then execute
+# p1 = Concurrent::Promise.new{ "Hello World!" }
+# p1.state #=> :unscheduled
+# p1.execute
+#
+# # create and immediately execute
+# p2 = Concurrent::Promise.new{ "Hello World!" }.execute
+#
+# # execute during creation
+# p3 = Concurrent::Promise.execute{ "Hello World!" }
+# ```
+#
+# Once the `execute` method is called a `Promise` becomes `pending`:
+#
+# ```ruby
+# p = Concurrent::Promise.execute{ "Hello, world!" }
+# p.state #=> :pending
+# p.pending? #=> true
+# ```
+#
+# Wait a little bit, and the promise will resolve and provide a value:
+#
+# ```ruby
+# p = Concurrent::Promise.execute{ "Hello, world!" }
+# sleep(0.1)
+#
+# p.state #=> :fulfilled
+# p.fulfilled? #=> true
+# p.value #=> "Hello, world!"
+# ```
+#
+# If an exception occurs, the promise will be rejected and will provide
+# a reason for the rejection:
+#
+# ```ruby
+# p = Concurrent::Promise.execute{ raise StandardError.new("Here comes the Boom!") }
+# sleep(0.1)
+#
+# p.state #=> :rejected
+# p.rejected? #=> true
+# p.reason #=> "#"
+# ```
+#
+# #### Rejection
+#
+# When a promise is rejected all its children will be rejected and will
+# receive the rejection `reason` as the rejection callable parameter:
+#
+# ```ruby
+# p = Concurrent::Promise.execute { Thread.pass; raise StandardError }
+#
+# c1 = p.then(-> reason { 42 })
+# c2 = p.then(-> reason { raise 'Boom!' })
+#
+# c1.wait.state #=> :fulfilled
+# c1.value #=> 42
+# c2.wait.state #=> :rejected
+# c2.reason #=> #
+# ```
+#
+# Once a promise is rejected it will continue to accept children that will
+# receive immediately rejection (they will be executed asynchronously).
+#
+# #### Aliases
+#
+# The `then` method is the most generic alias: it accepts a block to be
+# executed upon parent fulfillment and a callable to be executed upon parent
+# rejection. At least one of them should be passed. The default block is `{
+# |result| result }` that fulfills the child with the parent value. The
+# default callable is `{ |reason| raise reason }` that rejects the child with
+# the parent reason.
+#
+# - `on_success { |result| ... }` is the same as `then {|result| ... }`
+# - `rescue { |reason| ... }` is the same as `then(Proc.new { |reason| ... } )`
+# - `rescue` is aliased by `catch` and `on_error`
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:190
+class Concurrent::Promise < ::Concurrent::IVar
+ # Initialize a new Promise with the provided options.
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @!macro promise_init_options
+ #
+ # @option opts [Promise] :parent the parent `Promise` when building a chain/tree
+ # @option opts [Proc] :on_fulfill fulfillment handler
+ # @option opts [Proc] :on_reject rejection handler
+ # @option opts [object, Array] :args zero or more arguments to be passed
+ # the task block on execution
+ #
+ # @yield The block operation to be performed asynchronously.
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # @see http://wiki.commonjs.org/wiki/Promises/A
+ # @see http://promises-aplus.github.io/promises-spec/
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:210
+ def initialize(opts = T.unsafe(nil), &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:364
+ def catch(&block); end
+
+ # Execute an `:unscheduled` `Promise`. Immediately sets the state to `:pending` and
+ # passes the block to a new thread/thread pool for eventual execution.
+ # Does nothing if the `Promise` is in any state other than `:unscheduled`.
+ #
+ # @return [Promise] a reference to `self`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:246
+ def execute; end
+
+ # @!macro ivar_fail_method
+ #
+ # @raise [Concurrent::PromiseExecutionError] if not the root promise
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:278
+ def fail(reason = T.unsafe(nil)); end
+
+ # Yield the successful result to the block that returns a promise. If that
+ # promise is also successful the result is the result of the yielded promise.
+ # If either part fails the whole also fails.
+ #
+ # @example
+ # Promise.execute { 1 }.flat_map { |v| Promise.execute { v + 2 } }.value! #=> 3
+ #
+ # @return [Promise]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:375
+ def flat_map(&block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:365
+ def on_error(&block); end
+
+ # Chain onto this promise an action to be undertaken on success
+ # (fulfillment).
+ #
+ # @yield The block to execute
+ #
+ # @return [Promise] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:349
+ def on_success(&block); end
+
+ # Chain onto this promise an action to be undertaken on failure
+ # (rejection).
+ #
+ # @yield The block to execute
+ #
+ # @return [Promise] self
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:360
+ def rescue(&block); end
+
+ # @!macro ivar_set_method
+ #
+ # @raise [Concurrent::PromiseExecutionError] if not the root promise
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:262
+ def set(value = T.unsafe(nil), &block); end
+
+ # Chain a new promise off the current promise.
+ #
+ # @return [Promise] the new promise
+ # @yield The block operation to be performed asynchronously.
+ # @overload then(rescuer, executor, &block)
+ # @param [Proc] rescuer An optional rescue block to be executed if the
+ # promise is rejected.
+ # @param [ThreadPool] executor An optional thread pool executor to be used
+ # in the new Promise
+ # @overload then(rescuer, executor: executor, &block)
+ # @param [Proc] rescuer An optional rescue block to be executed if the
+ # promise is rejected.
+ # @param [ThreadPool] executor An optional thread pool executor to be used
+ # in the new Promise
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:314
+ def then(*args, &block); end
+
+ # Builds a promise that produces the result of self and others in an Array
+ # and fails if any of them fails.
+ #
+ # @overload zip(*promises)
+ # @param [Array] others
+ #
+ # @overload zip(*promises, opts)
+ # @param [Array] others
+ # @param [Hash] opts the configuration options
+ # @option opts [Executor] :executor (ImmediateExecutor.new) when set use the given `Executor` instance.
+ # @option opts [Boolean] :execute (true) execute promise before returning
+ #
+ # @return [Promise]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:440
+ def zip(*others); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:551
+ def complete(success, value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:545
+ def notify_child(child); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:481
+ def ns_initialize(value, opts); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:533
+ def on_fulfill(result); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:539
+ def on_reject(reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:562
+ def realize(task); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:528
+ def root?; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:520
+ def set_pending; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:570
+ def set_state!(success, value, reason); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:576
+ def synchronized_set_state!(success, value, reason); end
+
+ class << self
+ # Aggregate a collection of zero or more promises under a composite promise,
+ # execute the aggregated promises and collect them into a standard Ruby array,
+ # call the given Ruby `Ennnumerable` predicate (such as `any?`, `all?`, `none?`,
+ # or `one?`) on the collection checking for the success or failure of each,
+ # then executing the composite's `#then` handlers if the predicate returns
+ # `true` or executing the composite's `#rescue` handlers if the predicate
+ # returns false.
+ #
+ # @!macro promise_self_aggregate
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:505
+ def aggregate(method, *promises); end
+
+ # Aggregates a collection of promises and executes the `then` condition
+ # if all aggregated promises succeed. Executes the `rescue` handler with
+ # a `Concurrent::PromiseExecutionError` if any of the aggregated promises
+ # fail. Upon execution will execute any of the aggregate promises that
+ # were not already executed.
+ #
+ # @!macro promise_self_aggregate
+ #
+ # The returned promise will not yet have been executed. Additional `#then`
+ # and `#rescue` handlers may still be provided. Once the returned promise
+ # is execute the aggregate promises will be also be executed (if they have
+ # not been executed already). The results of the aggregate promises will
+ # be checked upon completion. The necessary `#then` and `#rescue` blocks
+ # on the aggregating promise will then be executed as appropriate. If the
+ # `#rescue` handlers are executed the raises exception will be
+ # `Concurrent::PromiseExecutionError`.
+ #
+ # @param [Array] promises Zero or more promises to aggregate
+ # @return [Promise] an unscheduled (not executed) promise that aggregates
+ # the promises given as arguments
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:464
+ def all?(*promises); end
+
+ # Aggregates a collection of promises and executes the `then` condition
+ # if any aggregated promises succeed. Executes the `rescue` handler with
+ # a `Concurrent::PromiseExecutionError` if any of the aggregated promises
+ # fail. Upon execution will execute any of the aggregate promises that
+ # were not already executed.
+ #
+ # @!macro promise_self_aggregate
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:475
+ def any?(*promises); end
+
+ # Create a new `Promise` object with the given block, execute it, and return the
+ # `:pending` object.
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @!macro promise_init_options
+ #
+ # @return [Promise] the newly created `Promise` in the `:pending` state
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # @example
+ # promise = Concurrent::Promise.execute{ sleep(1); 42 }
+ # promise.state #=> :pending
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:296
+ def execute(opts = T.unsafe(nil), &block); end
+
+ # Create a new `Promise` and fulfill it immediately.
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @!macro promise_init_options
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # @return [Promise] the newly created `Promise`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:224
+ def fulfill(value, opts = T.unsafe(nil)); end
+
+ # Create a new `Promise` and reject it immediately.
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @!macro promise_init_options
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # @return [Promise] the newly created `Promise`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:237
+ def reject(reason, opts = T.unsafe(nil)); end
+
+ # Builds a promise that produces the result of promises in an Array
+ # and fails if any of them fails.
+ #
+ # @overload zip(*promises)
+ # @param [Array] promises
+ #
+ # @overload zip(*promises, opts)
+ # @param [Array] promises
+ # @param [Hash] opts the configuration options
+ # @option opts [Executor] :executor (ImmediateExecutor.new) when set use the given `Executor` instance.
+ # @option opts [Boolean] :execute (true) execute promise before returning
+ #
+ # @return [Promise]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:409
+ def zip(*promises); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promise.rb:11
+class Concurrent::PromiseExecutionError < ::StandardError; end
+
+# {include:file:docs-source/promises-main.md}
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:13
+module Concurrent::Promises
+ extend ::Concurrent::Promises::FactoryMethods::Configuration
+ extend ::Concurrent::Promises::FactoryMethods
+end
+
+# @abstract
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2053
+class Concurrent::Promises::AbstractAnyPromise < ::Concurrent::Promises::BlockedPromise; end
+
+# Common ancestor of {Event} and {Future} classes, many shared methods are defined here.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:513
+class Concurrent::Promises::AbstractEventFuture < ::Concurrent::Synchronization::Object
+ include ::Concurrent::Promises::InternalStates
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:522
+ def initialize(promise, default_executor); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:515
+ def __initialize_atomic_fields__; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:738
+ def add_callback_clear_delayed_node(node); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:733
+ def add_callback_notify_blocked(promise, index); end
+
+ # For inspection.
+ # @!visibility private
+ # @return [Array]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:702
+ def blocks; end
+
+ # For inspection.
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:710
+ def callbacks; end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:596
+ def chain(*args, &task); end
+
+ # Chains the task to be executed asynchronously on executor after it is resolved.
+ #
+ # @!macro promises.param.executor
+ # @!macro promises.param.args
+ # @return [Future]
+ # @!macro promise.param.task-future
+ #
+ # @overload an_event.chain_on(executor, *args, &task)
+ # @yield [*args] to the task.
+ # @overload a_future.chain_on(executor, *args, &task)
+ # @yield [fulfilled, value, reason, *args] to the task.
+ # @yieldparam [true, false] fulfilled
+ # @yieldparam [Object] value
+ # @yieldparam [Object] reason
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:614
+ def chain_on(executor, *args, &task); end
+
+ # Resolves the resolvable when receiver is resolved.
+ #
+ # @param [Resolvable] resolvable
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:629
+ def chain_resolvable(resolvable); end
+
+ # Returns default executor.
+ # @return [Executor] default executor
+ # @see #with_default_executor
+ # @see FactoryMethods#future_on
+ # @see FactoryMethods#resolvable_future
+ # @see FactoryMethods#any_fulfilled_future_on
+ # @see similar
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:590
+ def default_executor; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:623
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:515
+ def internal_state; end
+
+ # @!macro promises.shortcut.using
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:637
+ def on_resolution(*args, &callback); end
+
+ # Stores the callback to be executed synchronously on resolving thread after it is
+ # resolved.
+ #
+ # @!macro promises.param.args
+ # @!macro promise.param.callback
+ # @return [self]
+ #
+ # @overload an_event.on_resolution!(*args, &callback)
+ # @yield [*args] to the callback.
+ # @overload a_future.on_resolution!(*args, &callback)
+ # @yield [fulfilled, value, reason, *args] to the callback.
+ # @yieldparam [true, false] fulfilled
+ # @yieldparam [Object] value
+ # @yieldparam [Object] reason
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:655
+ def on_resolution!(*args, &callback); end
+
+ # Stores the callback to be executed asynchronously on executor after it is resolved.
+ #
+ # @!macro promises.param.executor
+ # @!macro promises.param.args
+ # @!macro promise.param.callback
+ # @return [self]
+ #
+ # @overload an_event.on_resolution_using(executor, *args, &callback)
+ # @yield [*args] to the callback.
+ # @overload a_future.on_resolution_using(executor, *args, &callback)
+ # @yield [fulfilled, value, reason, *args] to the callback.
+ # @yieldparam [true, false] fulfilled
+ # @yieldparam [Object] value
+ # @yieldparam [Object] reason
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:673
+ def on_resolution_using(executor, *args, &callback); end
+
+ # Is it in pending state?
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:549
+ def pending?; end
+
+ # For inspection.
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:716
+ def promise; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:688
+ def resolve_with(state, raise_on_reassign = T.unsafe(nil), reserved = T.unsafe(nil)); end
+
+ # Is it in resolved state?
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:555
+ def resolved?; end
+
+ # Returns its state.
+ # @return [Symbol]
+ #
+ # @overload an_event.state
+ # @return [:pending, :resolved]
+ # @overload a_future.state
+ # Both :fulfilled, :rejected implies :resolved.
+ # @return [:pending, :fulfilled, :rejected]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:543
+ def state; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:633
+ def tangle(resolvable); end
+
+ # @return [String] Short string representation.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:619
+ def to_s; end
+
+ # Propagates touch. Requests all the delayed futures, which it depends on, to be
+ # executed. This method is called by any other method requiring resolved state, like {#wait}.
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:562
+ def touch; end
+
+ # For inspection.
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:722
+ def touched?; end
+
+ # @!macro promises.method.wait
+ # Wait (block the Thread) until receiver is {#resolved?}.
+ # @!macro promises.touches
+ #
+ # @!macro promises.warn.blocks
+ # @!macro promises.param.timeout
+ # @return [self, true, false] self implies timeout was not used, true implies timeout was used
+ # and it was resolved, false implies it was not resolved within timeout.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:578
+ def wait(timeout = T.unsafe(nil)); end
+
+ # For inspection.
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:728
+ def waiting_threads; end
+
+ # @!macro promises.method.with_default_executor
+ # Crates new object with same class with the executor set as its new default executor.
+ # Any futures depending on it will use the new default executor.
+ # @!macro promises.shortcut.event-future
+ # @abstract
+ # @return [AbstractEventFuture]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:683
+ def with_default_executor(executor); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:743
+ def with_hidden_resolvable; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:750
+ def add_callback(method, *args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:812
+ def async_callback_on_resolution(state, executor, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:796
+ def call_callback(method, state, args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:800
+ def call_callbacks(state); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:763
+ def callback_clear_delayed_node(state, node); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:818
+ def callback_notify_blocked(state, promise, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:515
+ def compare_and_set_internal_state(expected, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:515
+ def internal_state=(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:515
+ def swap_internal_state(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:515
+ def update_internal_state(&block); end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:768
+ def wait_until_resolved(timeout); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:808
+ def with_async(executor, *args, &block); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1802
+class Concurrent::Promises::AbstractFlatPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1804
+ def initialize(delayed_because, blockers_count, event_or_future); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1814
+ def touch; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1834
+ def add_delayed_of(future); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1826
+ def on_resolvable(resolved_future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1830
+ def resolvable?(countdown, future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1822
+ def touched?; end
+end
+
+# @abstract
+# @private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1555
+class Concurrent::Promises::AbstractPromise < ::Concurrent::Synchronization::Object
+ include ::Concurrent::Promises::InternalStates
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1559
+ def initialize(future); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1570
+ def default_executor; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1587
+ def delayed_because; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1568
+ def event; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1564
+ def future; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1585
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1574
+ def state; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1581
+ def to_s; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1578
+ def touch; end
+
+ private
+
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1598
+ def evaluate_to(*args, block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1593
+ def resolve_with(new_state, raise_on_reassign = T.unsafe(nil)); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2090
+class Concurrent::Promises::AnyFulfilledFuturePromise < ::Concurrent::Promises::AnyResolvedFuturePromise
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2094
+ def resolvable?(countdown, event_or_future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2056
+class Concurrent::Promises::AnyResolvedEventPromise < ::Concurrent::Promises::AbstractAnyPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2060
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2068
+ def on_resolvable(resolved_future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2064
+ def resolvable?(countdown, future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2073
+class Concurrent::Promises::AnyResolvedFuturePromise < ::Concurrent::Promises::AbstractAnyPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2077
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2085
+ def on_resolvable(resolved_future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2081
+ def resolvable?(countdown, future, index); end
+end
+
+# @abstract
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1625
+class Concurrent::Promises::BlockedPromise < ::Concurrent::Promises::InnerPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1667
+ def initialize(delayed, blockers_count, future); end
+
+ # for inspection only
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1689
+ def blocked_by; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1680
+ def delayed_because; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1673
+ def on_blocker_resolution(future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1684
+ def touch; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1697
+ def clear_and_propagate_touch(stack_or_element = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1716
+ def on_resolvable(resolved_future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1712
+ def process_on_blocker_resolution(future, index); end
+
+ # @return [true,false] if resolvable
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1708
+ def resolvable?(countdown, future, index); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1658
+ def add_delayed(delayed1, delayed2); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1651
+ def new_blocked_by(blockers, *args, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1629
+ def new_blocked_by1(blocker, *args, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1636
+ def new_blocked_by2(blocker1, blocker2, *args, &block); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1627
+ def new(*args, &block); end
+ end
+end
+
+# @abstract
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1722
+class Concurrent::Promises::BlockedTaskPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1723
+ def initialize(delayed, blockers_count, default_executor, executor, args, &task); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1731
+ def executor; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1772
+class Concurrent::Promises::ChainPromise < ::Concurrent::Promises::BlockedTaskPromise
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1775
+ def on_resolvable(resolved_future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2101
+class Concurrent::Promises::DelayPromise < ::Concurrent::Promises::InnerPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2103
+ def initialize(default_executor); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2114
+ def delayed_because; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2110
+ def touch; end
+end
+
+# Represents an event which will happen in future (will be resolved). The event is either
+# pending or resolved. It should be always resolved. Use {Future} to communicate rejections and
+# cancellation.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:826
+class Concurrent::Promises::Event < ::Concurrent::Promises::AbstractEventFuture
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:847
+ def &(other); end
+
+ # Creates a new event which will be resolved when the first of receiver, `event_or_future`
+ # resolves.
+ #
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:853
+ def any(event_or_future); end
+
+ # Creates new event dependent on receiver which will not evaluate until touched, see {#touch}.
+ # In other words, it inserts delay into the chain of Futures making rest of it lazy evaluated.
+ #
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:863
+ def delay; end
+
+ # @!macro promise.method.schedule
+ # Creates new event dependent on receiver scheduled to execute on/in intended_time.
+ # In time is interpreted from the moment the receiver is resolved, therefore it inserts
+ # delay into the chain.
+ #
+ # @!macro promises.param.intended_time
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:875
+ def schedule(intended_time); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:828
+ def then(*args, &task); end
+
+ # Returns self, since this is event
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:893
+ def to_event; end
+
+ # Converts event to a future. The future is fulfilled when the event is resolved, the future may never fail.
+ #
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:885
+ def to_future; end
+
+ # @!macro promises.method.with_default_executor
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:899
+ def with_default_executor(executor); end
+
+ # @!macro promises.method.zip
+ # Creates a new event or a future which will be resolved when receiver and other are.
+ # Returns an event if receiver and other are events, otherwise returns a future.
+ # If just one of the parties is Future then the result
+ # of the returned future is equal to the result of the supplied future. If both are futures
+ # then the result is as described in {FactoryMethods#zip_futures_on}.
+ #
+ # @return [Future, Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:839
+ def zip(other); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:857
+ def |(event_or_future); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:910
+ def callback_on_resolution(state, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:905
+ def rejected_resolution(raise_on_reassign, state); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1978
+class Concurrent::Promises::EventWrapperPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1979
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1985
+ def on_resolvable(resolved_future, index); end
+end
+
+# Container of all {Future}, {Event} factory methods. They are never constructed directly with
+# new.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:46
+module Concurrent::Promises::FactoryMethods
+ include ::Concurrent::Promises::FactoryMethods::Configuration
+ extend ::Concurrent::ReInclude
+ extend ::Concurrent::Promises::FactoryMethods::Configuration
+ extend ::Concurrent::Promises::FactoryMethods
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:282
+ def any(*futures_and_or_events); end
+
+ # @!macro promises.shortcut.on
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:319
+ def any_event(*futures_and_or_events); end
+
+ # Creates a new event which becomes resolved after the first futures_and_or_events resolves.
+ # @!macro promises.any-touch
+ #
+ # @!macro promises.param.default_executor
+ # @param [AbstractEventFuture] futures_and_or_events
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:329
+ def any_event_on(default_executor, *futures_and_or_events); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:300
+ def any_fulfilled_future(*futures_and_or_events); end
+
+ # Creates a new future which is resolved after the first futures_and_or_events is fulfilled.
+ # Its result equals the result of the first resolved future or if all futures_and_or_events reject,
+ # it has reason of the last rejected future.
+ # @!macro promises.any-touch
+ # @!macro promises.event-conversion
+ #
+ # @!macro promises.param.default_executor
+ # @param [AbstractEventFuture] futures_and_or_events
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:313
+ def any_fulfilled_future_on(default_executor, *futures_and_or_events); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:278
+ def any_resolved_future(*futures_and_or_events); end
+
+ # Creates a new future which is resolved after the first futures_and_or_events is resolved.
+ # Its result equals the result of the first resolved future.
+ # @!macro promises.any-touch
+ # If resolved it does not propagate {Concurrent::AbstractEventFuture#touch}, leaving delayed
+ # futures un-executed if they are not required any more.
+ # @!macro promises.event-conversion
+ #
+ # @!macro promises.param.default_executor
+ # @param [AbstractEventFuture] futures_and_or_events
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:294
+ def any_resolved_future_on(default_executor, *futures_and_or_events); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future, Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:190
+ def delay(*args, &task); end
+
+ # Creates a new event or future which is resolved only after it is touched,
+ # see {Concurrent::AbstractEventFuture#touch}.
+ #
+ # @!macro promises.param.default_executor
+ # @overload delay_on(default_executor, *args, &task)
+ # If task is provided it returns a {Future} representing the result of the task.
+ # @!macro promises.param.args
+ # @yield [*args] to the task.
+ # @!macro promise.param.task-future
+ # @return [Future]
+ # @overload delay_on(default_executor)
+ # If no task is provided, it returns an {Event}
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:207
+ def delay_on(default_executor, *args, &task); end
+
+ # Creates a resolved future which will be fulfilled with the given value.
+ #
+ # @!macro promises.param.default_executor
+ # @param [Object] value
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:127
+ def fulfilled_future(value, default_executor = T.unsafe(nil)); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:94
+ def future(*args, &task); end
+
+ # Constructs a new Future which will be resolved after block is evaluated on default executor.
+ # Evaluation begins immediately.
+ #
+ # @!macro promises.param.default_executor
+ # @!macro promises.param.args
+ # @yield [*args] to the task.
+ # @!macro promise.param.task-future
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:106
+ def future_on(default_executor, *args, &task); end
+
+ # General constructor. Behaves differently based on the argument's type. It's provided for convenience
+ # but it's better to be explicit.
+ #
+ # @see rejected_future, resolved_event, fulfilled_future
+ # @!macro promises.param.default_executor
+ # @return [Event, Future]
+ #
+ # @overload make_future(nil, default_executor = self.default_executor)
+ # @param [nil] nil
+ # @return [Event] resolved event.
+ #
+ # @overload make_future(a_future, default_executor = self.default_executor)
+ # @param [Future] a_future
+ # @return [Future] a future which will be resolved when a_future is.
+ #
+ # @overload make_future(an_event, default_executor = self.default_executor)
+ # @param [Event] an_event
+ # @return [Event] an event which will be resolved when an_event is.
+ #
+ # @overload make_future(exception, default_executor = self.default_executor)
+ # @param [Exception] exception
+ # @return [Future] a rejected future with the exception as its reason.
+ #
+ # @overload make_future(value, default_executor = self.default_executor)
+ # @param [Object] value when none of the above overloads fits
+ # @return [Future] a fulfilled future with the value.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:174
+ def make_future(argument = T.unsafe(nil), default_executor = T.unsafe(nil)); end
+
+ # Creates a resolved future which will be rejected with the given reason.
+ #
+ # @!macro promises.param.default_executor
+ # @param [Object] reason
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:136
+ def rejected_future(reason, default_executor = T.unsafe(nil)); end
+
+ # @!macro promises.shortcut.on
+ # @return [ResolvableEvent]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:63
+ def resolvable_event; end
+
+ # Creates a resolvable event, user is responsible for resolving the event once
+ # by calling {Promises::ResolvableEvent#resolve}.
+ #
+ # @!macro promises.param.default_executor
+ # @return [ResolvableEvent]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:72
+ def resolvable_event_on(default_executor = T.unsafe(nil)); end
+
+ # @!macro promises.shortcut.on
+ # @return [ResolvableFuture]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:78
+ def resolvable_future; end
+
+ # Creates resolvable future, user is responsible for resolving the future once by
+ # {Promises::ResolvableFuture#resolve}, {Promises::ResolvableFuture#fulfill},
+ # or {Promises::ResolvableFuture#reject}
+ #
+ # @!macro promises.param.default_executor
+ # @return [ResolvableFuture]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:88
+ def resolvable_future_on(default_executor = T.unsafe(nil)); end
+
+ # Creates resolved event.
+ #
+ # @!macro promises.param.default_executor
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:144
+ def resolved_event(default_executor = T.unsafe(nil)); end
+
+ # Creates a resolved future with will be either fulfilled with the given value or rejected with
+ # the given reason.
+ #
+ # @param [true, false] fulfilled
+ # @param [Object] value
+ # @param [Object] reason
+ # @!macro promises.param.default_executor
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:118
+ def resolved_future(fulfilled, value, reason, default_executor = T.unsafe(nil)); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future, Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:214
+ def schedule(intended_time, *args, &task); end
+
+ # Creates a new event or future which is resolved in intended_time.
+ #
+ # @!macro promises.param.default_executor
+ # @!macro promises.param.intended_time
+ # @param [Numeric, Time] intended_time `Numeric` means to run in `intended_time` seconds.
+ # `Time` means to run on `intended_time`.
+ # @overload schedule_on(default_executor, intended_time, *args, &task)
+ # If task is provided it returns a {Future} representing the result of the task.
+ # @!macro promises.param.args
+ # @yield [*args] to the task.
+ # @!macro promise.param.task-future
+ # @return [Future]
+ # @overload schedule_on(default_executor, intended_time)
+ # If no task is provided, it returns an {Event}
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:233
+ def schedule_on(default_executor, intended_time, *args, &task); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:258
+ def zip(*futures_and_or_events); end
+
+ # @!macro promises.shortcut.on
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:262
+ def zip_events(*futures_and_or_events); end
+
+ # Creates a new event which is resolved after all futures_and_or_events are resolved.
+ # (Future is resolved when fulfilled or rejected.)
+ #
+ # @!macro promises.param.default_executor
+ # @param [AbstractEventFuture] futures_and_or_events
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:272
+ def zip_events_on(default_executor, *futures_and_or_events); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:240
+ def zip_futures(*futures_and_or_events); end
+
+ # Creates a new future which is resolved after all futures_and_or_events are resolved.
+ # Its value is an array of zipped future values. Its reason is an array of reasons for rejection.
+ # If there is an error it rejects.
+ # @!macro promises.event-conversion
+ # If event is supplied, which does not have value and can be only resolved, it's
+ # represented as `:fulfilled` with value `nil`.
+ #
+ # @!macro promises.param.default_executor
+ # @param [AbstractEventFuture] futures_and_or_events
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:254
+ def zip_futures_on(default_executor, *futures_and_or_events); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:50
+module Concurrent::Promises::FactoryMethods::Configuration
+ # @return [Executor, :io, :fast] the executor which is used when none is supplied
+ # to a factory method. The method can be overridden in the receivers of
+ # `include FactoryMethod`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:54
+ def default_executor; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1846
+class Concurrent::Promises::FlatEventPromise < ::Concurrent::Promises::AbstractFlatPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1850
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1854
+ def process_on_blocker_resolution(future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1879
+class Concurrent::Promises::FlatFuturePromise < ::Concurrent::Promises::AbstractFlatPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1883
+ def initialize(delayed, blockers_count, levels, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1890
+ def process_on_blocker_resolution(future, index); end
+end
+
+# Represents a value which will become available in future. May reject with a reason instead,
+# e.g. when the tasks raises an exception.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:917
+class Concurrent::Promises::Future < ::Concurrent::Promises::AbstractEventFuture
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1084
+ def &(other); end
+
+ # Creates a new event which will be resolved when the first of receiver, `event_or_future`
+ # resolves. Returning future will have value nil if event_or_future is event and resolves
+ # first.
+ #
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1091
+ def any(event_or_future); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1221
+ def apply(args, block); end
+
+ # Creates new future dependent on receiver which will not evaluate until touched, see {#touch}.
+ # In other words, it inserts delay into the chain of Futures making rest of it lazy evaluated.
+ #
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1101
+ def delay; end
+
+ # Allows rejected Future to be risen with `raise` method.
+ # If the reason is not an exception `Runtime.new(reason)` is returned.
+ #
+ # @example
+ # raise Promises.rejected_future(StandardError.new("boom"))
+ # raise Promises.rejected_future("or just boom")
+ # @raise [Concurrent::Error] when raising not rejected future
+ # @return [Exception]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1014
+ def exception(*args); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1130
+ def flat(level = T.unsafe(nil)); end
+
+ # Creates new event which will be resolved when the returned event by receiver is.
+ # Be careful if the receiver rejects it will just resolve since Event does not hold reason.
+ #
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1136
+ def flat_event; end
+
+ # Creates new future which will have result of the future returned by receiver. If receiver
+ # rejects it will have its rejection.
+ #
+ # @param [Integer] level how many levels of futures should flatten
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1126
+ def flat_future(level = T.unsafe(nil)); end
+
+ # Is it in fulfilled state?
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:922
+ def fulfilled?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1249
+ def inspect; end
+
+ # @!macro promises.shortcut.using
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1142
+ def on_fulfillment(*args, &callback); end
+
+ # Stores the callback to be executed synchronously on resolving thread after it is
+ # fulfilled. Does nothing on rejection.
+ #
+ # @!macro promises.param.args
+ # @!macro promise.param.callback
+ # @return [self]
+ # @yield [value, *args] to the callback.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1153
+ def on_fulfillment!(*args, &callback); end
+
+ # Stores the callback to be executed asynchronously on executor after it is
+ # fulfilled. Does nothing on rejection.
+ #
+ # @!macro promises.param.executor
+ # @!macro promises.param.args
+ # @!macro promise.param.callback
+ # @return [self]
+ # @yield [value, *args] to the callback.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1165
+ def on_fulfillment_using(executor, *args, &callback); end
+
+ # @!macro promises.shortcut.using
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1171
+ def on_rejection(*args, &callback); end
+
+ # Stores the callback to be executed synchronously on resolving thread after it is
+ # rejected. Does nothing on fulfillment.
+ #
+ # @!macro promises.param.args
+ # @!macro promise.param.callback
+ # @return [self]
+ # @yield [reason, *args] to the callback.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1182
+ def on_rejection!(*args, &callback); end
+
+ # Stores the callback to be executed asynchronously on executor after it is
+ # rejected. Does nothing on fulfillment.
+ #
+ # @!macro promises.param.executor
+ # @!macro promises.param.args
+ # @!macro promise.param.callback
+ # @return [self]
+ # @yield [reason, *args] to the callback.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1194
+ def on_rejection_using(executor, *args, &callback); end
+
+ # Returns reason of future's rejection.
+ # @!macro promises.touches
+ #
+ # @!macro promises.warn.blocks
+ # @!macro promises.warn.nil
+ # @!macro promises.param.timeout
+ # @!macro promises.param.timeout_value
+ # @return [Object, timeout_value] the reason, or timeout_value on timeout, or nil on fulfillment.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:967
+ def reason(timeout = T.unsafe(nil), timeout_value = T.unsafe(nil)); end
+
+ # Is it in rejected state?
+ # @return [Boolean]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:929
+ def rejected?; end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1058
+ def rescue(*args, &task); end
+
+ # Chains the task to be executed asynchronously on executor after it rejects. Does not run
+ # the task if it fulfills. It will resolve though, triggering any dependent futures.
+ #
+ # @!macro promises.param.executor
+ # @!macro promises.param.args
+ # @!macro promise.param.task-future
+ # @return [Future]
+ # @yield [reason, *args] to the task.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1070
+ def rescue_on(executor, *args, &task); end
+
+ # Returns triplet fulfilled?, value, reason.
+ # @!macro promises.touches
+ #
+ # @!macro promises.warn.blocks
+ # @!macro promises.param.timeout
+ # @return [Array(Boolean, Object, Object), nil] triplet of fulfilled?, value, reason, or nil
+ # on timeout.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:982
+ def result(timeout = T.unsafe(nil)); end
+
+ # Allows to use futures as green threads. The receiver has to evaluate to a future which
+ # represents what should be done next. It basically flattens indefinitely until non Future
+ # values is returned which becomes result of the returned future. Any encountered exception
+ # will become reason of the returned future.
+ #
+ # @return [Future]
+ # @param [#call(value)] run_test
+ # an object which when called returns either Future to keep running with
+ # or nil, then the run completes with the value.
+ # The run_test can be used to extract the Future from deeper structure,
+ # or to distinguish Future which is a resulting value from a future
+ # which is suppose to continue running.
+ # @example
+ # body = lambda do |v|
+ # v += 1
+ # v < 5 ? Promises.future(v, &body) : v
+ # end
+ # Promises.future(0, &body).run.value! # => 5
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1216
+ def run(run_test = T.unsafe(nil)); end
+
+ # @!macro promise.method.schedule
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1108
+ def schedule(intended_time); end
+
+ # @!macro promises.shortcut.on
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1040
+ def then(*args, &task); end
+
+ # Chains the task to be executed asynchronously on executor after it fulfills. Does not run
+ # the task if it rejects. It will resolve though, triggering any dependent futures.
+ #
+ # @!macro promises.param.executor
+ # @!macro promises.param.args
+ # @!macro promise.param.task-future
+ # @return [Future]
+ # @yield [value, *args] to the task.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1052
+ def then_on(executor, *args, &task); end
+
+ # Converts future to event which is resolved when future is resolved by fulfillment or rejection.
+ #
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1228
+ def to_event; end
+
+ # Returns self, since this is a future
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1236
+ def to_future; end
+
+ # @return [String] Short string representation.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1241
+ def to_s; end
+
+ # @!macro promises.method.value
+ # Return value of the future.
+ # @!macro promises.touches
+ #
+ # @!macro promises.warn.blocks
+ # @!macro promises.warn.nil
+ # @!macro promises.param.timeout
+ # @!macro promises.param.timeout_value
+ # @param [Object] timeout_value a value returned by the method when it times out
+ # @return [Object, nil, timeout_value] the value of the Future when fulfilled,
+ # timeout_value on timeout,
+ # nil on rejection.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:951
+ def value(timeout = T.unsafe(nil), timeout_value = T.unsafe(nil)); end
+
+ # @!macro promises.method.value
+ # @return [Object, nil, timeout_value] the value of the Future when fulfilled,
+ # or nil on rejection,
+ # or timeout_value on timeout.
+ # @raise [Exception] {#reason} on rejection
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:998
+ def value!(timeout = T.unsafe(nil), timeout_value = T.unsafe(nil)); end
+
+ # @!macro promises.method.wait
+ # @raise [Exception] {#reason} on rejection
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:988
+ def wait!(timeout = T.unsafe(nil)); end
+
+ # @!macro promises.method.with_default_executor
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1117
+ def with_default_executor(executor); end
+
+ # @!macro promises.method.zip
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1076
+ def zip(other); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1095
+ def |(event_or_future); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1278
+ def async_callback_on_fulfillment(state, executor, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1284
+ def async_callback_on_rejection(state, executor, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1290
+ def callback_on_fulfillment(state, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1294
+ def callback_on_rejection(state, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1298
+ def callback_on_resolution(state, args, callback); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1257
+ def rejected_resolution(raise_on_reassign, state); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1253
+ def run_test(v); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1272
+ def wait_until_resolved!(timeout = T.unsafe(nil)); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:918
+Concurrent::Promises::Future::SET_BACKTRACE_LOCATIONS_SUPPORTED = T.let(T.unsafe(nil), TrueClass)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1990
+class Concurrent::Promises::FutureWrapperPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1991
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1997
+ def on_resolvable(resolved_future, index); end
+end
+
+# will be immediately resolved
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1789
+class Concurrent::Promises::ImmediateEventPromise < ::Concurrent::Promises::InnerPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1790
+ def initialize(default_executor); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1795
+class Concurrent::Promises::ImmediateFuturePromise < ::Concurrent::Promises::InnerPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1796
+ def initialize(default_executor, fulfilled, value, reason); end
+end
+
+# @abstract
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1621
+class Concurrent::Promises::InnerPromise < ::Concurrent::Promises::AbstractPromise; end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:338
+module Concurrent::Promises::InternalStates; end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:397
+class Concurrent::Promises::InternalStates::Fulfilled < ::Concurrent::Promises::InternalStates::ResolvedWithResult
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:399
+ def initialize(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:407
+ def apply(args, block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:403
+ def fulfilled?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:415
+ def reason; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:419
+ def to_sym; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:411
+ def value; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:425
+class Concurrent::Promises::InternalStates::FulfilledArray < ::Concurrent::Promises::InternalStates::Fulfilled
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:426
+ def apply(args, block); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:488
+Concurrent::Promises::InternalStates::PENDING = T.let(T.unsafe(nil), Concurrent::Promises::InternalStates::Pending)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:459
+class Concurrent::Promises::InternalStates::PartiallyRejected < ::Concurrent::Promises::InternalStates::ResolvedWithResult
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:460
+ def initialize(value, reason); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:482
+ def apply(args, block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:466
+ def fulfilled?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:478
+ def reason; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:470
+ def to_sym; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:474
+ def value; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:351
+class Concurrent::Promises::InternalStates::Pending < ::Concurrent::Promises::InternalStates::State
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:352
+ def resolved?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:356
+ def to_sym; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:490
+Concurrent::Promises::InternalStates::RESERVED = T.let(T.unsafe(nil), Concurrent::Promises::InternalStates::Reserved)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:492
+Concurrent::Promises::InternalStates::RESOLVED = T.let(T.unsafe(nil), Concurrent::Promises::InternalStates::Fulfilled)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:432
+class Concurrent::Promises::InternalStates::Rejected < ::Concurrent::Promises::InternalStates::ResolvedWithResult
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:433
+ def initialize(reason); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:453
+ def apply(args, block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:437
+ def fulfilled?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:445
+ def reason; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:449
+ def to_sym; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:441
+ def value; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:362
+class Concurrent::Promises::InternalStates::Reserved < ::Concurrent::Promises::InternalStates::Pending; end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:366
+class Concurrent::Promises::InternalStates::ResolvedWithResult < ::Concurrent::Promises::InternalStates::State
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:391
+ def apply; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:379
+ def fulfilled?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:387
+ def reason; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:367
+ def resolved?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:375
+ def result; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:371
+ def to_sym; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:383
+ def value; end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:340
+class Concurrent::Promises::InternalStates::State
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:341
+ def resolved?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:345
+ def to_sym; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1754
+class Concurrent::Promises::RescuePromise < ::Concurrent::Promises::BlockedTaskPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1757
+ def initialize(delayed, blockers_count, default_executor, executor, args, &task); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1761
+ def on_resolvable(resolved_future, index); end
+end
+
+# Marker module of Future, Event resolved manually.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1305
+module Concurrent::Promises::Resolvable
+ include ::Concurrent::Promises::InternalStates
+end
+
+# A Event which can be resolved by user.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1310
+class Concurrent::Promises::ResolvableEvent < ::Concurrent::Promises::Event
+ include ::Concurrent::Promises::Resolvable
+
+ # Makes the event resolved, which triggers all dependent futures.
+ #
+ # @!macro promise.param.raise_on_reassign
+ # @!macro promise.param.reserved
+ # @param [true, false] reserved
+ # Set to true if the resolvable is {#reserve}d by you,
+ # marks resolution of reserved resolvable events and futures explicitly.
+ # Advanced feature, ignore unless you use {Resolvable#reserve} from edge.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1330
+ def resolve(raise_on_reassign = T.unsafe(nil), reserved = T.unsafe(nil)); end
+
+ # Behaves as {AbstractEventFuture#wait} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @param [true, false] resolve_on_timeout
+ # If it times out and the argument is true it will also resolve the event.
+ # @return [self, true, false]
+ # @see AbstractEventFuture#wait
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1348
+ def wait(timeout = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Creates new event wrapping receiver, effectively hiding the resolve method.
+ #
+ # @return [Event]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1337
+ def with_hidden_resolvable; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1606
+class Concurrent::Promises::ResolvableEventPromise < ::Concurrent::Promises::AbstractPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1607
+ def initialize(default_executor); end
+end
+
+# A Future which can be resolved by user.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1360
+class Concurrent::Promises::ResolvableFuture < ::Concurrent::Promises::Future
+ include ::Concurrent::Promises::Resolvable
+
+ # Evaluates the block and sets its result as future's value fulfilling, if the block raises
+ # an exception the future rejects with it.
+ #
+ # @yield [*args] to the block.
+ # @yieldreturn [Object] value
+ # @return [self]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1401
+ def evaluate_to(*args, &block); end
+
+ # Evaluates the block and sets its result as future's value fulfilling, if the block raises
+ # an exception the future rejects with it.
+ #
+ # @yield [*args] to the block.
+ # @yieldreturn [Object] value
+ # @return [self]
+ # @raise [Exception] also raise reason on rejection.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1412
+ def evaluate_to!(*args, &block); end
+
+ # Makes the future fulfilled with `value`,
+ # which triggers all dependent futures.
+ #
+ # @param [Object] value
+ # @!macro promise.param.raise_on_reassign
+ # @!macro promise.param.reserved
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1381
+ def fulfill(value, raise_on_reassign = T.unsafe(nil), reserved = T.unsafe(nil)); end
+
+ # Behaves as {Future#reason} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @!macro promises.resolvable.resolve_on_timeout
+ # @return [Exception, timeout_value, nil]
+ # @see Future#reason
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1509
+ def reason(timeout = T.unsafe(nil), timeout_value = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Makes the future rejected with `reason`,
+ # which triggers all dependent futures.
+ #
+ # @param [Object] reason
+ # @!macro promise.param.raise_on_reassign
+ # @!macro promise.param.reserved
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1391
+ def reject(reason, raise_on_reassign = T.unsafe(nil), reserved = T.unsafe(nil)); end
+
+ # Makes the future resolved with result of triplet `fulfilled?`, `value`, `reason`,
+ # which triggers all dependent futures.
+ #
+ # @param [true, false] fulfilled
+ # @param [Object] value
+ # @param [Object] reason
+ # @!macro promise.param.raise_on_reassign
+ # @!macro promise.param.reserved
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1371
+ def resolve(fulfilled = T.unsafe(nil), value = T.unsafe(nil), reason = T.unsafe(nil), raise_on_reassign = T.unsafe(nil), reserved = T.unsafe(nil)); end
+
+ # Behaves as {Future#result} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @!macro promises.resolvable.resolve_on_timeout
+ # @return [::Array(Boolean, Object, Exception), nil]
+ # @see Future#result
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1530
+ def result(timeout = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Behaves as {Future#value} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @!macro promises.resolvable.resolve_on_timeout
+ # @return [Object, timeout_value, nil]
+ # @see Future#value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1465
+ def value(timeout = T.unsafe(nil), timeout_value = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Behaves as {Future#value!} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @!macro promises.resolvable.resolve_on_timeout
+ # @return [Object, timeout_value, nil]
+ # @raise [Exception] {#reason} on rejection
+ # @see Future#value!
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1487
+ def value!(timeout = T.unsafe(nil), timeout_value = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Behaves as {AbstractEventFuture#wait} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @!macro promises.resolvable.resolve_on_timeout
+ # @return [self, true, false]
+ # @see AbstractEventFuture#wait
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1427
+ def wait(timeout = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Behaves as {Future#wait!} but has one additional optional argument
+ # resolve_on_timeout.
+ #
+ # @!macro promises.resolvable.resolve_on_timeout
+ # @return [self, true, false]
+ # @raise [Exception] {#reason} on rejection
+ # @see Future#wait!
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1444
+ def wait!(timeout = T.unsafe(nil), resolve_on_timeout = T.unsafe(nil)); end
+
+ # Creates new future wrapping receiver, effectively hiding the resolve method and similar.
+ #
+ # @return [Future]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1548
+ def with_hidden_resolvable; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1612
+class Concurrent::Promises::ResolvableFuturePromise < ::Concurrent::Promises::AbstractPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1613
+ def initialize(default_executor); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1617
+ def evaluate_to(*args, block); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1915
+class Concurrent::Promises::RunFuturePromise < ::Concurrent::Promises::AbstractFlatPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1919
+ def initialize(delayed, blockers_count, default_executor, run_test); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1924
+ def process_on_blocker_resolution(future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2120
+class Concurrent::Promises::ScheduledPromise < ::Concurrent::Promises::InnerPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2131
+ def initialize(default_executor, intended_time); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2125
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2121
+ def intended_time; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1736
+class Concurrent::Promises::ThenPromise < ::Concurrent::Promises::BlockedTaskPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1739
+ def initialize(delayed, blockers_count, default_executor, executor, args, &task); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1743
+ def on_resolvable(resolved_future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1946
+class Concurrent::Promises::ZipEventEventPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1947
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1953
+ def on_resolvable(resolved_future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2037
+class Concurrent::Promises::ZipEventsPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2041
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2047
+ def on_resolvable(resolved_future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1958
+class Concurrent::Promises::ZipFutureEventPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1959
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1973
+ def on_resolvable(resolved_future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:1966
+ def process_on_blocker_resolution(future, index); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2002
+class Concurrent::Promises::ZipFuturesPromise < ::Concurrent::Promises::BlockedPromise
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2006
+ def initialize(delayed, blockers_count, default_executor); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2019
+ def on_resolvable(resolved_future, index); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/promises.rb:2013
+ def process_on_blocker_resolution(future, index); end
+end
+
+# Methods form module A included to a module B, which is already included into class C,
+# will not be visible in the C class. If this module is extended to B then A's methods
+# are correctly made visible to C.
+#
+# @example
+# module A
+# def a
+# :a
+# end
+# end
+#
+# module B1
+# end
+#
+# class C1
+# include B1
+# end
+#
+# module B2
+# extend Concurrent::ReInclude
+# end
+#
+# class C2
+# include B2
+# end
+#
+# B1.send :include, A
+# B2.send :include, A
+#
+# C1.new.respond_to? :a # => false
+# C2.new.respond_to? :a # => true
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/re_include.rb:36
+module Concurrent::ReInclude
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/re_include.rb:44
+ def extended(base); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/re_include.rb:50
+ def include(*modules); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/re_include.rb:38
+ def included(base); end
+end
+
+# Ruby read-write lock implementation
+#
+# Allows any number of concurrent readers, but only one concurrent writer
+# (And if the "write" lock is taken, any readers who come along will have to wait)
+#
+# If readers are already active when a writer comes along, the writer will wait for
+# all the readers to finish before going ahead.
+# Any additional readers that come when the writer is already waiting, will also
+# wait (so writers are not starved).
+#
+# This implementation is based on `java.util.concurrent.ReentrantReadWriteLock`.
+#
+# @example
+# lock = Concurrent::ReadWriteLock.new
+# lock.with_read_lock { data.retrieve }
+# lock.with_write_lock { data.modify! }
+#
+# @note Do **not** try to acquire the write lock while already holding a read lock
+# **or** try to acquire the write lock while you already have it.
+# This will lead to deadlock
+#
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/locks/ReentrantReadWriteLock.html java.util.concurrent.ReentrantReadWriteLock
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:32
+class Concurrent::ReadWriteLock < ::Concurrent::Synchronization::Object
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # Create a new `ReadWriteLock` in the unlocked state.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:60
+ def initialize; end
+
+ # Acquire a read lock. If a write lock has been acquired will block until
+ # it is released. Will not block if other read locks have been acquired.
+ #
+ # @return [Boolean] true if the lock is successfully acquired
+ #
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of readers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:113
+ def acquire_read_lock; end
+
+ # Acquire a write lock. Will block and wait for all active readers and writers.
+ #
+ # @return [Boolean] true if the lock is successfully acquired
+ #
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of writers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:166
+ def acquire_write_lock; end
+
+ # Queries whether any threads are waiting to acquire the read or write lock.
+ #
+ # @return [Boolean] true if any threads are waiting for a lock else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:227
+ def has_waiters?; end
+
+ # Release a previously acquired read lock.
+ #
+ # @return [Boolean] true if the lock is successfully released
+ #
+ # @raise [Concurrent::IllegalOperationError] if no read lock is currently held.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:144
+ def release_read_lock; end
+
+ # Release a previously acquired write lock.
+ #
+ # @return [Boolean] true if the lock is successfully released
+ #
+ # @raise [Concurrent::IllegalOperationError] if the write lock is not held
+ # by the current thread.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:206
+ def release_write_lock; end
+
+ # Execute a block operation within a read lock.
+ #
+ # @yield the task to be performed within the lock.
+ #
+ # @return [Object] the result of the block operation.
+ #
+ # @raise [ArgumentError] when no block is given.
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of readers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:77
+ def with_read_lock; end
+
+ # Execute a block operation within a write lock.
+ #
+ # @yield the task to be performed within the lock.
+ #
+ # @return [Object] the result of the block operation.
+ #
+ # @raise [ArgumentError] when no block is given.
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of readers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:96
+ def with_write_lock; end
+
+ # Queries if the write lock is held by any thread.
+ #
+ # @return [Boolean] true if the write lock is held else false`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:220
+ def write_locked?; end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:259
+ def max_readers?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:264
+ def max_writers?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:234
+ def running_readers(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:239
+ def running_readers?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:244
+ def running_writer?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:254
+ def waiting_writer?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:249
+ def waiting_writers(c = T.unsafe(nil)); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:41
+Concurrent::ReadWriteLock::MAX_READERS = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:44
+Concurrent::ReadWriteLock::MAX_WRITERS = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:38
+Concurrent::ReadWriteLock::RUNNING_WRITER = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/read_write_lock.rb:35
+Concurrent::ReadWriteLock::WAITING_WRITER = T.let(T.unsafe(nil), Integer)
+
+# Re-entrant read-write lock implementation
+#
+# Allows any number of concurrent readers, but only one concurrent writer
+# (And while the "write" lock is taken, no read locks can be obtained either.
+# Hence, the write lock can also be called an "exclusive" lock.)
+#
+# If another thread has taken a read lock, any thread which wants a write lock
+# will block until all the readers release their locks. However, once a thread
+# starts waiting to obtain a write lock, any additional readers that come along
+# will also wait (so writers are not starved).
+#
+# A thread can acquire both a read and write lock at the same time. A thread can
+# also acquire a read lock OR a write lock more than once. Only when the read (or
+# write) lock is released as many times as it was acquired, will the thread
+# actually let it go, allowing other threads which might have been waiting
+# to proceed. Therefore the lock can be upgraded by first acquiring
+# read lock and then write lock and that the lock can be downgraded by first
+# having both read and write lock a releasing just the write lock.
+#
+# If both read and write locks are acquired by the same thread, it is not strictly
+# necessary to release them in the same order they were acquired. In other words,
+# the following code is legal:
+#
+# @example
+# lock = Concurrent::ReentrantReadWriteLock.new
+# lock.acquire_write_lock
+# lock.acquire_read_lock
+# lock.release_write_lock
+# # At this point, the current thread is holding only a read lock, not a write
+# # lock. So other threads can take read locks, but not a write lock.
+# lock.release_read_lock
+# # Now the current thread is not holding either a read or write lock, so
+# # another thread could potentially acquire a write lock.
+#
+# This implementation was inspired by `java.util.concurrent.ReentrantReadWriteLock`.
+#
+# @example
+# lock = Concurrent::ReentrantReadWriteLock.new
+# lock.with_read_lock { data.retrieve }
+# lock.with_write_lock { data.modify! }
+#
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/locks/ReentrantReadWriteLock.html java.util.concurrent.ReentrantReadWriteLock
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:53
+class Concurrent::ReentrantReadWriteLock < ::Concurrent::Synchronization::Object
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # Create a new `ReentrantReadWriteLock` in the unlocked state.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:109
+ def initialize; end
+
+ # Acquire a read lock. If a write lock is held by another thread, will block
+ # until it is released.
+ #
+ # @return [Boolean] true if the lock is successfully acquired
+ #
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of readers
+ # or per-thread reentrant acquires is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:162
+ def acquire_read_lock; end
+
+ # Acquire a write lock. Will block and wait for all active readers and writers.
+ #
+ # @return [Boolean] true if the lock is successfully acquired
+ #
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of writers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:264
+ def acquire_write_lock; end
+
+ # Release a previously acquired read lock.
+ #
+ # @return [Boolean] true if the lock is successfully released
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:243
+ def release_read_lock; end
+
+ # Release a previously acquired write lock.
+ #
+ # @return [Boolean] true if the lock is successfully released
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:336
+ def release_write_lock; end
+
+ # Try to acquire a read lock and return true if we succeed. If it cannot be
+ # acquired immediately, return false.
+ #
+ # @return [Boolean] true if the lock is successfully acquired
+ #
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of per-thread
+ # reentrant acquires is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:220
+ def try_read_lock; end
+
+ # Try to acquire a write lock and return true if we succeed. If it cannot be
+ # acquired immediately, return false.
+ #
+ # @return [Boolean] true if the lock is successfully acquired
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:317
+ def try_write_lock; end
+
+ # Execute a block operation within a read lock.
+ #
+ # @yield the task to be performed within the lock.
+ #
+ # @return [Object] the result of the block operation.
+ #
+ # @raise [ArgumentError] when no block is given.
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of readers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:126
+ def with_read_lock; end
+
+ # Execute a block operation within a write lock.
+ #
+ # @yield the task to be performed within the lock.
+ #
+ # @return [Object] the result of the block operation.
+ #
+ # @raise [ArgumentError] when no block is given.
+ # @raise [Concurrent::ResourceLimitError] if the maximum number of readers
+ # is exceeded.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:145
+ def with_write_lock; end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:377
+ def max_readers?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:382
+ def max_writers?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:352
+ def running_readers(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:357
+ def running_readers?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:362
+ def running_writer?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:372
+ def waiting_or_running_writer?(c = T.unsafe(nil)); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:367
+ def waiting_writers(c = T.unsafe(nil)); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:94
+Concurrent::ReentrantReadWriteLock::MAX_READERS = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:96
+Concurrent::ReentrantReadWriteLock::MAX_WRITERS = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:84
+Concurrent::ReentrantReadWriteLock::READER_BITS = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:102
+Concurrent::ReentrantReadWriteLock::READ_LOCK_MASK = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:92
+Concurrent::ReentrantReadWriteLock::RUNNING_WRITER = T.let(T.unsafe(nil), Integer)
+
+# Used with @Counter:
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:90
+Concurrent::ReentrantReadWriteLock::WAITING_WRITER = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:86
+Concurrent::ReentrantReadWriteLock::WRITER_BITS = T.let(T.unsafe(nil), Integer)
+
+# Used with @HeldCount:
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:100
+Concurrent::ReentrantReadWriteLock::WRITE_LOCK_HELD = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/reentrant_read_write_lock.rb:104
+Concurrent::ReentrantReadWriteLock::WRITE_LOCK_MASK = T.let(T.unsafe(nil), Integer)
+
+# Raised by an `Executor` when it is unable to process a given task,
+# possibly because of a reject policy or other internal error.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:48
+class Concurrent::RejectedExecutionError < ::Concurrent::Error; end
+
+# Raised when any finite resource, such as a lock counter, exceeds its
+# maximum limit/threshold.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:52
+class Concurrent::ResourceLimitError < ::Concurrent::Error; end
+
+# @!macro internal_implementation_note
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:129
+class Concurrent::RubyExchanger < ::Concurrent::AbstractExchanger
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:159
+ def initialize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:165
+ def __initialize_atomic_fields__; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:165
+ def compare_and_set_slot(expected, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:165
+ def slot; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:165
+ def slot=(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:165
+ def swap_slot(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:165
+ def update_slot(&block); end
+
+ private
+
+ # @!macro exchanger_method_do_exchange
+ #
+ # @return [Object, CANCEL] the value exchanged by the other thread; {CANCEL} on timeout
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:170
+ def do_exchange(value, timeout); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:138
+class Concurrent::RubyExchanger::Node < ::Concurrent::Synchronization::Object
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:142
+ def initialize(item); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:139
+ def __initialize_atomic_fields__; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:139
+ def compare_and_set_value(expected, value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:153
+ def item; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:149
+ def latch; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:139
+ def swap_value(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:139
+ def update_value(&block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:139
+ def value; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/exchanger.rb:139
+ def value=(value); end
+end
+
+# @!macro abstract_executor_service_public_api
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:8
+class Concurrent::RubyExecutorService < ::Concurrent::AbstractExecutorService
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:11
+ def initialize(*args, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:42
+ def kill; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:17
+ def post(*args, &task); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:33
+ def shutdown; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:52
+ def wait_for_termination(timeout = T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:70
+ def ns_running?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:78
+ def ns_shutdown?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:66
+ def ns_shutdown_execution; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:74
+ def ns_shuttingdown?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:58
+ def stop_event; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_executor_service.rb:62
+ def stopped_event; end
+end
+
+# @!macro single_thread_executor
+# @!macro abstract_executor_service_public_api
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_single_thread_executor.rb:9
+class Concurrent::RubySingleThreadExecutor < ::Concurrent::RubyThreadPoolExecutor
+ include ::Concurrent::SerialExecutorService
+
+ # @!macro single_thread_executor_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_single_thread_executor.rb:13
+ def initialize(opts = T.unsafe(nil)); end
+end
+
+# @!macro thread_pool_executor
+# @!macro thread_pool_options
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:13
+class Concurrent::RubyThreadPoolExecutor < ::Concurrent::RubyExecutorService
+ # @!macro thread_pool_executor_method_initialize
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:47
+ def initialize(opts = T.unsafe(nil)); end
+
+ # @!macro thread_pool_executor_method_active_count
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:67
+ def active_count; end
+
+ # @!macro executor_service_method_can_overflow_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:74
+ def can_overflow?; end
+
+ # @!macro thread_pool_executor_attr_reader_completed_task_count
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:62
+ def completed_task_count; end
+
+ # @!macro thread_pool_executor_attr_reader_idletime
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:38
+ def idletime; end
+
+ # @!macro thread_pool_executor_attr_reader_largest_length
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:52
+ def largest_length; end
+
+ # @!macro thread_pool_executor_attr_reader_length
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:79
+ def length; end
+
+ # @!macro thread_pool_executor_attr_reader_max_length
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:32
+ def max_length; end
+
+ # @!macro thread_pool_executor_attr_reader_max_queue
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:41
+ def max_queue; end
+
+ # @!macro thread_pool_executor_attr_reader_min_length
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:35
+ def min_length; end
+
+ # @!macro thread_pool_executor_method_prune_pool
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:139
+ def prune_pool; end
+
+ # removes the worker if it can be pruned
+ #
+ # @return [true, false] if the worker was pruned
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:104
+ def prune_worker(worker); end
+
+ # @!macro thread_pool_executor_attr_reader_queue_length
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:84
+ def queue_length; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:124
+ def ready_worker(worker, last_message); end
+
+ # @!macro thread_pool_executor_attr_reader_remaining_capacity
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:89
+ def remaining_capacity; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:116
+ def remove_worker(worker); end
+
+ # @!macro thread_pool_executor_attr_reader_scheduled_task_count
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:57
+ def scheduled_task_count; end
+
+ # @!macro thread_pool_executor_attr_reader_synchronous
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:44
+ def synchronous; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:129
+ def worker_died(worker); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:134
+ def worker_task_completed; end
+
+ private
+
+ # creates new worker which has to receive work to do after it's added
+ # @return [nil, Worker] nil of max capacity is reached
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:257
+ def ns_add_busy_worker; end
+
+ # tries to assign task to a worker, tries to get one from @ready or to create new one
+ # @return [true, false] if task is assigned to a worker
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:217
+ def ns_assign_worker(*args, &task); end
+
+ # tries to enqueue task
+ # @return [true, false] if enqueued
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:235
+ def ns_enqueue(*args, &task); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:178
+ def ns_execute(*args, &task); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:146
+ def ns_initialize(opts); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:205
+ def ns_kill_execution; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:173
+ def ns_limited_queue?; end
+
+ # @return [Integer] number of excess idle workers which can be removed without
+ # going below min_length, or all workers if not running
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:305
+ def ns_prunable_capacity; end
+
+ # handle ready worker, giving it new job or assigning back to @ready
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:269
+ def ns_ready_worker(worker, last_message, success = T.unsafe(nil)); end
+
+ # removes a worker which is not tracked in @ready
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:287
+ def ns_remove_busy_worker(worker); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:294
+ def ns_remove_ready_worker(worker); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:314
+ def ns_reset_if_forked; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:190
+ def ns_shutdown_execution; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:247
+ def ns_worker_died(worker); end
+end
+
+# @!macro thread_pool_executor_constant_default_max_pool_size
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:17
+Concurrent::RubyThreadPoolExecutor::DEFAULT_MAX_POOL_SIZE = T.let(T.unsafe(nil), Integer)
+
+# @!macro thread_pool_executor_constant_default_max_queue_size
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:23
+Concurrent::RubyThreadPoolExecutor::DEFAULT_MAX_QUEUE_SIZE = T.let(T.unsafe(nil), Integer)
+
+# @!macro thread_pool_executor_constant_default_min_pool_size
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:20
+Concurrent::RubyThreadPoolExecutor::DEFAULT_MIN_POOL_SIZE = T.let(T.unsafe(nil), Integer)
+
+# @!macro thread_pool_executor_constant_default_synchronous
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:29
+Concurrent::RubyThreadPoolExecutor::DEFAULT_SYNCHRONOUS = T.let(T.unsafe(nil), FalseClass)
+
+# @!macro thread_pool_executor_constant_default_thread_timeout
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:26
+Concurrent::RubyThreadPoolExecutor::DEFAULT_THREAD_IDLETIMEOUT = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:328
+class Concurrent::RubyThreadPoolExecutor::Worker
+ include ::Concurrent::Concern::Logging
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:331
+ def initialize(pool, id); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:342
+ def <<(message); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:350
+ def kill; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:346
+ def stop; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:356
+ def create_worker(queue, pool, idletime); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/ruby_thread_pool_executor.rb:381
+ def run_task(pool, task, args); end
+end
+
+# A simple utility class that executes a callable and returns and array of three elements:
+# success - indicating if the callable has been executed without errors
+# value - filled by the callable result if it has been executed without errors, nil otherwise
+# reason - the error risen by the callable if it has been executed with errors, nil otherwise
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/safe_task_executor.rb:9
+class Concurrent::SafeTaskExecutor < ::Concurrent::Synchronization::LockableObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/safe_task_executor.rb:11
+ def initialize(task, opts = T.unsafe(nil)); end
+
+ # @return [Array]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/safe_task_executor.rb:18
+ def execute(*args); end
+end
+
+# `ScheduledTask` is a close relative of `Concurrent::Future` but with one
+# important difference: A `Future` is set to execute as soon as possible
+# whereas a `ScheduledTask` is set to execute after a specified delay. This
+# implementation is loosely based on Java's
+# [ScheduledExecutorService](http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ScheduledExecutorService.html).
+# It is a more feature-rich variant of {Concurrent.timer}.
+#
+# The *intended* schedule time of task execution is set on object construction
+# with the `delay` argument. The delay is a numeric (floating point or integer)
+# representing a number of seconds in the future. Any other value or a numeric
+# equal to or less than zero will result in an exception. The *actual* schedule
+# time of task execution is set when the `execute` method is called.
+#
+# The constructor can also be given zero or more processing options. Currently
+# the only supported options are those recognized by the
+# [Dereferenceable](Dereferenceable) module.
+#
+# The final constructor argument is a block representing the task to be performed.
+# If no block is given an `ArgumentError` will be raised.
+#
+# **States**
+#
+# `ScheduledTask` mixes in the [Obligation](Obligation) module thus giving it
+# "future" behavior. This includes the expected lifecycle states. `ScheduledTask`
+# has one additional state, however. While the task (block) is being executed the
+# state of the object will be `:processing`. This additional state is necessary
+# because it has implications for task cancellation.
+#
+# **Cancellation**
+#
+# A `:pending` task can be cancelled using the `#cancel` method. A task in any
+# other state, including `:processing`, cannot be cancelled. The `#cancel`
+# method returns a boolean indicating the success of the cancellation attempt.
+# A cancelled `ScheduledTask` cannot be restarted. It is immutable.
+#
+# **Obligation and Observation**
+#
+# The result of a `ScheduledTask` can be obtained either synchronously or
+# asynchronously. `ScheduledTask` mixes in both the [Obligation](Obligation)
+# module and the
+# [Observable](http://ruby-doc.org/stdlib-2.0/libdoc/observer/rdoc/Observable.html)
+# module from the Ruby standard library. With one exception `ScheduledTask`
+# behaves identically to [Future](Observable) with regard to these modules.
+#
+# @!macro copy_options
+#
+# @example Basic usage
+#
+# require 'concurrent/scheduled_task'
+# require 'csv'
+# require 'open-uri'
+#
+# class Ticker
+# def get_year_end_closing(symbol, year, api_key)
+# uri = "https://www.alphavantage.co/query?function=TIME_SERIES_MONTHLY&symbol=#{symbol}&apikey=#{api_key}&datatype=csv"
+# data = []
+# csv = URI.parse(uri).read
+# if csv.include?('call frequency')
+# return :rate_limit_exceeded
+# end
+# CSV.parse(csv, headers: true) do |row|
+# data << row['close'].to_f if row['timestamp'].include?(year.to_s)
+# end
+# year_end = data.first
+# year_end
+# rescue => e
+# p e
+# end
+# end
+#
+# api_key = ENV['ALPHAVANTAGE_KEY']
+# abort(error_message) unless api_key
+#
+# # Future
+# price = Concurrent::Future.execute{ Ticker.new.get_year_end_closing('TWTR', 2013, api_key) }
+# price.state #=> :pending
+# price.pending? #=> true
+# price.value(0) #=> nil (does not block)
+#
+# sleep(1) # do other stuff
+#
+# price.value #=> 63.65 (after blocking if necessary)
+# price.state #=> :fulfilled
+# price.fulfilled? #=> true
+# price.value #=> 63.65
+#
+# @example Successful task execution
+#
+# task = Concurrent::ScheduledTask.new(2){ 'What does the fox say?' }
+# task.state #=> :unscheduled
+# task.execute
+# task.state #=> pending
+#
+# # wait for it...
+# sleep(3)
+#
+# task.unscheduled? #=> false
+# task.pending? #=> false
+# task.fulfilled? #=> true
+# task.rejected? #=> false
+# task.value #=> 'What does the fox say?'
+#
+# @example One line creation and execution
+#
+# task = Concurrent::ScheduledTask.new(2){ 'What does the fox say?' }.execute
+# task.state #=> pending
+#
+# task = Concurrent::ScheduledTask.execute(2){ 'What do you get when you multiply 6 by 9?' }
+# task.state #=> pending
+#
+# @example Failed task execution
+#
+# task = Concurrent::ScheduledTask.execute(2){ raise StandardError.new('Call me maybe?') }
+# task.pending? #=> true
+#
+# # wait for it...
+# sleep(3)
+#
+# task.unscheduled? #=> false
+# task.pending? #=> false
+# task.fulfilled? #=> false
+# task.rejected? #=> true
+# task.value #=> nil
+# task.reason #=> #
+#
+# @example Task execution with observation
+#
+# observer = Class.new{
+# def update(time, value, reason)
+# puts "The task completed at #{time} with value '#{value}'"
+# end
+# }.new
+#
+# task = Concurrent::ScheduledTask.new(2){ 'What does the fox say?' }
+# task.add_observer(observer)
+# task.execute
+# task.pending? #=> true
+#
+# # wait for it...
+# sleep(3)
+#
+# #>> The task completed at 2013-11-07 12:26:09 -0500 with value 'What does the fox say?'
+#
+# @!macro monotonic_clock_warning
+#
+# @see Concurrent.timer
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:158
+class Concurrent::ScheduledTask < ::Concurrent::IVar
+ include ::Comparable
+
+ # Schedule a task for execution at a specified future time.
+ #
+ # @param [Float] delay the number of seconds to wait for before executing the task
+ #
+ # @yield the task to be performed
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @option opts [object, Array] :args zero or more arguments to be passed the task
+ # block on execution
+ #
+ # @raise [ArgumentError] When no block is given
+ # @raise [ArgumentError] When given a time that is in the past
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:178
+ def initialize(delay, opts = T.unsafe(nil), &task); end
+
+ # Comparator which orders by schedule time.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:213
+ def <=>(other); end
+
+ # Cancel this task and prevent it from executing. A task can only be
+ # cancelled if it is pending or unscheduled.
+ #
+ # @return [Boolean] true if successfully cancelled else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:235
+ def cancel; end
+
+ # Has the task been cancelled?
+ #
+ # @return [Boolean] true if the task is in the given state else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:220
+ def cancelled?; end
+
+ # Execute an `:unscheduled` `ScheduledTask`. Immediately sets the state to `:pending`
+ # and starts counting down toward execution. Does nothing if the `ScheduledTask` is
+ # in any state other than `:unscheduled`.
+ #
+ # @return [ScheduledTask] a reference to `self`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:273
+ def execute; end
+
+ # The executor on which to execute the task.
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:163
+ def executor; end
+
+ # The `delay` value given at instantiation.
+ #
+ # @return [Float] the initial delay.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:199
+ def initial_delay; end
+
+ # Execute the task.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:297
+ def process_task; end
+
+ # In the task execution in progress?
+ #
+ # @return [Boolean] true if the task is in the given state else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:227
+ def processing?; end
+
+ # Reschedule the task using the given delay and the current time.
+ # A task can only be reset while it is `:pending`.
+ #
+ # @param [Float] delay the number of seconds to wait for before executing the task
+ #
+ # @return [Boolean] true if successfully rescheduled else false
+ #
+ # @raise [ArgumentError] When given a time that is in the past
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:262
+ def reschedule(delay); end
+
+ # Reschedule the task using the original delay and the current time.
+ # A task can only be reset while it is `:pending`.
+ #
+ # @return [Boolean] true if successfully rescheduled else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:250
+ def reset; end
+
+ # The monotonic time at which the the task is scheduled to be executed.
+ #
+ # @return [Float] the schedule time or nil if `unscheduled`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:206
+ def schedule_time; end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:301
+ def fail(reason = T.unsafe(nil)); end
+
+ # Reschedule the task using the given delay and the current time.
+ # A task can only be reset while it is `:pending`.
+ #
+ # @param [Float] delay the number of seconds to wait for before executing the task
+ #
+ # @return [Boolean] true if successfully rescheduled else false
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:326
+ def ns_reschedule(delay); end
+
+ # Schedule the task using the given delay and the current time.
+ #
+ # @param [Float] delay the number of seconds to wait for before executing the task
+ #
+ # @return [Boolean] true if successfully rescheduled else false
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:312
+ def ns_schedule(delay); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:301
+ def set(value = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:301
+ def try_set(value = T.unsafe(nil), &block); end
+
+ class << self
+ # Create a new `ScheduledTask` object with the given block, execute it, and return the
+ # `:pending` object.
+ #
+ # @param [Float] delay the number of seconds to wait for before executing the task
+ #
+ # @!macro executor_and_deref_options
+ #
+ # @return [ScheduledTask] the newly created `ScheduledTask` in the `:pending` state
+ #
+ # @raise [ArgumentError] if no block is given
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/scheduled_task.rb:290
+ def execute(delay, opts = T.unsafe(nil), &task); end
+ end
+end
+
+# @!macro semaphore
+#
+# A counting semaphore. Conceptually, a semaphore maintains a set of
+# permits. Each {#acquire} blocks if necessary until a permit is
+# available, and then takes it. Each {#release} adds a permit, potentially
+# releasing a blocking acquirer.
+# However, no actual permit objects are used; the Semaphore just keeps a
+# count of the number available and acts accordingly.
+# Alternatively, permits may be acquired within a block, and automatically
+# released after the block finishes executing.
+#
+# @!macro semaphore_public_api
+# @example
+# semaphore = Concurrent::Semaphore.new(2)
+#
+# t1 = Thread.new do
+# semaphore.acquire
+# puts "Thread 1 acquired semaphore"
+# end
+#
+# t2 = Thread.new do
+# semaphore.acquire
+# puts "Thread 2 acquired semaphore"
+# end
+#
+# t3 = Thread.new do
+# semaphore.acquire
+# puts "Thread 3 acquired semaphore"
+# end
+#
+# t4 = Thread.new do
+# sleep(2)
+# puts "Thread 4 releasing semaphore"
+# semaphore.release
+# end
+#
+# [t1, t2, t3, t4].each(&:join)
+#
+# # prints:
+# # Thread 3 acquired semaphore
+# # Thread 2 acquired semaphore
+# # Thread 4 releasing semaphore
+# # Thread 1 acquired semaphore
+#
+# @example
+# semaphore = Concurrent::Semaphore.new(1)
+#
+# puts semaphore.available_permits
+# semaphore.acquire do
+# puts semaphore.available_permits
+# end
+# puts semaphore.available_permits
+#
+# # prints:
+# # 1
+# # 0
+# # 1
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/semaphore.rb:161
+class Concurrent::Semaphore < ::Concurrent::MutexSemaphore; end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/semaphore.rb:96
+Concurrent::SemaphoreImplementation = Concurrent::MutexSemaphore
+
+# Indicates that the including `ExecutorService` guarantees
+# that all operations will occur in the order they are post and that no
+# two operations may occur simultaneously. This module provides no
+# functionality and provides no guarantees. That is the responsibility
+# of the including class. This module exists solely to allow the including
+# object to be interrogated for its serialization status.
+#
+# @example
+# class Foo
+# include Concurrent::SerialExecutor
+# end
+#
+# foo = Foo.new
+#
+# foo.is_a? Concurrent::ExecutorService #=> true
+# foo.is_a? Concurrent::SerialExecutor #=> true
+# foo.serialized? #=> true
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serial_executor_service.rb:24
+module Concurrent::SerialExecutorService
+ include ::Concurrent::Concern::Logging
+ include ::Concurrent::ExecutorService
+
+ # @!macro executor_service_method_serialized_question
+ #
+ # @note Always returns `true`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serial_executor_service.rb:30
+ def serialized?; end
+end
+
+# Ensures passed jobs in a serialized order never running at the same time.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:8
+class Concurrent::SerializedExecution < ::Concurrent::Synchronization::LockableObject
+ include ::Concurrent::Concern::Logging
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:11
+ def initialize; end
+
+ # Submit a task to the executor for asynchronous processing.
+ #
+ # @param [Executor] executor to be used for this job
+ #
+ # @param [Array] args zero or more arguments to be passed to the task
+ #
+ # @yield the asynchronous task to perform
+ #
+ # @return [Boolean] `true` if the task is queued, `false` if the executor
+ # is not running
+ #
+ # @raise [ArgumentError] if no task is given
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:34
+ def post(executor, *args, &task); end
+
+ # As {#post} but allows to submit multiple tasks at once, it's guaranteed that they will not
+ # be interleaved by other tasks.
+ #
+ # @param [Array, Proc)>] posts array of triplets where
+ # first is a {ExecutorService}, second is array of args for task, third is a task (Proc)
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:44
+ def posts(posts); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:75
+ def call_job(job); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:70
+ def ns_initialize; end
+
+ # ensures next job is executed if any is stashed
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:95
+ def work(job); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+class Concurrent::SerializedExecution::Job < ::Struct
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def args; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def args=(_); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def block; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def block=(_); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:17
+ def call; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def executor; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def executor=(_); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def [](*_arg0); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def keyword_init?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def members; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution.rb:16
+ def new(*_arg0); end
+ end
+end
+
+# A wrapper/delegator for any `ExecutorService` that
+# guarantees serialized execution of tasks.
+#
+# @see [SimpleDelegator](http://www.ruby-doc.org/stdlib-2.1.2/libdoc/delegate/rdoc/SimpleDelegator.html)
+# @see Concurrent::SerializedExecution
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution_delegator.rb:12
+class Concurrent::SerializedExecutionDelegator < ::SimpleDelegator
+ include ::Concurrent::Concern::Logging
+ include ::Concurrent::ExecutorService
+ include ::Concurrent::SerialExecutorService
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution_delegator.rb:15
+ def initialize(executor); end
+
+ # @!macro executor_service_method_post
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/serialized_execution_delegator.rb:22
+ def post(*args, &task); end
+end
+
+# @!macro concurrent_set
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:61
+class Concurrent::Set < ::Concurrent::CRubySet; end
+
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/set.rb:23
+Concurrent::SetImplementation = Concurrent::CRubySet
+
+# An thread-safe, write-once variation of Ruby's standard `Struct`.
+# Each member can have its value set at most once, either at construction
+# or any time thereafter. Attempting to assign a value to a member
+# that has already been set will result in a `Concurrent::ImmutabilityError`.
+#
+# @see http://ruby-doc.org/core/Struct.html Ruby standard library `Struct`
+# @see http://en.wikipedia.org/wiki/Final_(Java) Java `final` keyword
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:14
+module Concurrent::SettableStruct
+ include ::Concurrent::Synchronization::AbstractStruct
+
+ # @!macro struct_equality
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:50
+ def ==(other); end
+
+ # @!macro struct_get
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:45
+ def [](member); end
+
+ # @!macro struct_set
+ #
+ # @raise [Concurrent::ImmutabilityError] if the given member has already been set
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:75
+ def []=(member, value); end
+
+ # @!macro struct_each
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:55
+ def each(&block); end
+
+ # @!macro struct_each_pair
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:61
+ def each_pair(&block); end
+
+ # @!macro struct_inspect
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:29
+ def inspect; end
+
+ # @!macro struct_merge
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:35
+ def merge(other, &block); end
+
+ # @!macro struct_select
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:67
+ def select(&block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:21
+ def to_a; end
+
+ # @!macro struct_to_h
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:40
+ def to_h; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:32
+ def to_s; end
+
+ # @!macro struct_values
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:18
+ def values; end
+
+ # @!macro struct_values_at
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:24
+ def values_at(*indexes); end
+
+ private
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:97
+ def initialize_copy(original); end
+
+ class << self
+ # @!macro struct_new
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:105
+ def new(*args, &block); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/settable_struct.rb:115
+Concurrent::SettableStruct::FACTORY = T.let(T.unsafe(nil), T.untyped)
+
+# An executor service in which every operation spawns a new,
+# independently operating thread.
+#
+# This is perhaps the most inefficient executor service in this
+# library. It exists mainly for testing an debugging. Thread creation
+# and management is expensive in Ruby and this executor performs no
+# resource pooling. This can be very beneficial during testing and
+# debugging because it decouples the using code from the underlying
+# executor implementation. In production this executor will likely
+# lead to suboptimal performance.
+#
+# @note Intended for use primarily in testing and debugging.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:21
+class Concurrent::SimpleExecutorService < ::Concurrent::RubyExecutorService
+ # @!macro executor_service_method_left_shift
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:56
+ def <<(task); end
+
+ # @!macro executor_service_method_kill
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:84
+ def kill; end
+
+ # @!macro executor_service_method_post
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:40
+ def post(*args, &task); end
+
+ # @!macro executor_service_method_running_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:62
+ def running?; end
+
+ # @!macro executor_service_method_shutdown
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:77
+ def shutdown; end
+
+ # @!macro executor_service_method_shutdown_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:72
+ def shutdown?; end
+
+ # @!macro executor_service_method_shuttingdown_question
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:67
+ def shuttingdown?; end
+
+ # @!macro executor_service_method_wait_for_termination
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:91
+ def wait_for_termination(timeout = T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:97
+ def ns_initialize(*args); end
+
+ class << self
+ # @!macro executor_service_method_left_shift
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:34
+ def <<(task); end
+
+ # @!macro executor_service_method_post
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/simple_executor_service.rb:24
+ def post(*args); end
+ end
+end
+
+# @!macro single_thread_executor
+#
+# A thread pool with a single thread an unlimited queue. Should the thread
+# die for any reason it will be removed and replaced, thus ensuring that
+# the executor will always remain viable and available to process jobs.
+#
+# A common pattern for background processing is to create a single thread
+# on which an infinite loop is run. The thread's loop blocks on an input
+# source (perhaps blocking I/O or a queue) and processes each input as it
+# is received. This pattern has several issues. The thread itself is highly
+# susceptible to errors during processing. Also, the thread itself must be
+# constantly monitored and restarted should it die. `SingleThreadExecutor`
+# encapsulates all these behaviors. The task processor is highly resilient
+# to errors from within tasks. Also, should the thread die it will
+# automatically be restarted.
+#
+# The API and behavior of this class are based on Java's `SingleThreadExecutor`.
+#
+# @!macro abstract_executor_service_public_api
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/single_thread_executor.rb:37
+class Concurrent::SingleThreadExecutor < ::Concurrent::RubySingleThreadExecutor; end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/single_thread_executor.rb:10
+Concurrent::SingleThreadExecutorImplementation = Concurrent::RubySingleThreadExecutor
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_object.rb:2
+module Concurrent::Synchronization
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/full_memory_barrier.rb:7
+ def full_memory_barrier; end
+ end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_lockable_object.rb:9
+class Concurrent::Synchronization::AbstractLockableObject < ::Concurrent::Synchronization::Object
+ protected
+
+ # @!macro synchronization_object_method_ns_broadcast
+ #
+ # Broadcast to all waiting threads.
+ # @return [self]
+ # @note only to be used inside synchronized block
+ # @note to provide direct access to this method in a descendant add method
+ # ```
+ # def broadcast
+ # synchronize { ns_broadcast }
+ # end
+ # ```
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_lockable_object.rb:96
+ def ns_broadcast; end
+
+ # @!macro synchronization_object_method_ns_signal
+ #
+ # Signal one waiting thread.
+ # @return [self]
+ # @note only to be used inside synchronized block
+ # @note to provide direct access to this method in a descendant add method
+ # ```
+ # def signal
+ # synchronize { ns_signal }
+ # end
+ # ```
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_lockable_object.rb:81
+ def ns_signal; end
+
+ # @!macro synchronization_object_method_ns_wait
+ #
+ # Wait until another thread calls #signal or #broadcast,
+ # spurious wake-ups can happen.
+ #
+ # @param [Numeric, nil] timeout in seconds, `nil` means no timeout
+ # @return [self]
+ # @note only to be used inside synchronized block
+ # @note to provide direct access to this method in a descendant add method
+ # ```
+ # def wait(timeout = nil)
+ # synchronize { ns_wait(timeout) }
+ # end
+ # ```
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_lockable_object.rb:66
+ def ns_wait(timeout = T.unsafe(nil)); end
+
+ # @!macro synchronization_object_method_ns_wait_until
+ #
+ # Wait until condition is met or timeout passes,
+ # protects against spurious wake-ups.
+ # @param [Numeric, nil] timeout in seconds, `nil` means no timeout
+ # @yield condition to be met
+ # @yieldreturn [true, false]
+ # @return [true, false] if condition met
+ # @note only to be used inside synchronized block
+ # @note to provide direct access to this method in a descendant add method
+ # ```
+ # def wait_until(timeout = nil, &condition)
+ # synchronize { ns_wait_until(timeout, &condition) }
+ # end
+ # ```
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_lockable_object.rb:37
+ def ns_wait_until(timeout = T.unsafe(nil), &condition); end
+
+ # @!macro synchronization_object_method_synchronize
+ #
+ # @yield runs the block synchronized against this object,
+ # equivalent of java's `synchronize(this) {}`
+ # @note can by made public in descendants if required by `public :synchronize`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_lockable_object.rb:18
+ def synchronize; end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_object.rb:6
+class Concurrent::Synchronization::AbstractObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_object.rb:7
+ def initialize; end
+
+ # @!visibility private
+ # @abstract
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_object.rb:13
+ def full_memory_barrier; end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_object.rb:17
+ def attr_volatile(*names); end
+ end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:6
+module Concurrent::Synchronization::AbstractStruct
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:9
+ def initialize(*values); end
+
+ # @!macro struct_length
+ #
+ # Returns the number of struct members.
+ #
+ # @return [Fixnum] the number of struct members
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:19
+ def length; end
+
+ # @!macro struct_members
+ #
+ # Returns the struct members as an array of symbols.
+ #
+ # @return [Array] the struct members as an array of symbols
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:29
+ def members; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:22
+ def size; end
+
+ protected
+
+ # @!macro struct_each
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:82
+ def ns_each; end
+
+ # @!macro struct_each_pair
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:89
+ def ns_each_pair; end
+
+ # @!macro struct_equality
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:75
+ def ns_equality(other); end
+
+ # @!macro struct_get
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:59
+ def ns_get(member); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:119
+ def ns_initialize_copy; end
+
+ # @!macro struct_inspect
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:105
+ def ns_inspect; end
+
+ # @!macro struct_merge
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:114
+ def ns_merge(other, &block); end
+
+ # @!macro struct_select
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:98
+ def ns_select; end
+
+ # @!macro struct_to_h
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:52
+ def ns_to_h; end
+
+ # @!macro struct_values
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:38
+ def ns_values; end
+
+ # @!macro struct_values_at
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:45
+ def ns_values_at(indexes); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:130
+ def pr_underscore(clazz); end
+
+ class << self
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/abstract_struct.rb:141
+ def define_struct_class(parent, base, name, members, &block); end
+ end
+end
+
+# @!visibility private
+# TODO (pitr-ch 04-Dec-2016): should be in edge
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:8
+class Concurrent::Synchronization::Condition < ::Concurrent::Synchronization::LockableObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:18
+ def initialize(lock); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:47
+ def broadcast; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:51
+ def ns_broadcast; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:43
+ def ns_signal; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:27
+ def ns_wait(timeout = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:35
+ def ns_wait_until(timeout = T.unsafe(nil), &condition); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:39
+ def signal; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:23
+ def wait(timeout = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:31
+ def wait_until(timeout = T.unsafe(nil), &condition); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:15
+ def private_new(*args, &block); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:16
+ def new(*args, &block); end
+ end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:8
+module Concurrent::Synchronization::ConditionSignalling
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:16
+ def ns_broadcast; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:11
+ def ns_signal; end
+end
+
+# @!visibility private
+# TODO (pitr-ch 04-Dec-2016): should be in edge
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:8
+class Concurrent::Synchronization::Lock < ::Concurrent::Synchronization::LockableObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:31
+ def broadcast; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:35
+ def ns_broadcast; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:29
+ def ns_signal; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:17
+ def ns_wait(timeout = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:23
+ def ns_wait_until(timeout = T.unsafe(nil), &condition); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:25
+ def signal; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:11
+ def synchronize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:13
+ def wait(timeout = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lock.rb:19
+ def wait_until(timeout = T.unsafe(nil), &condition); end
+end
+
+# Safe synchronization under any Ruby implementation.
+# It provides methods like {#synchronize}, {#wait}, {#signal} and {#broadcast}.
+# Provides a single layer which can improve its implementation over time without changes needed to
+# the classes using it. Use {Synchronization::Object} not this abstract class.
+#
+# @note this object does not support usage together with
+# [`Thread#wakeup`](http://ruby-doc.org/core/Thread.html#method-i-wakeup)
+# and [`Thread#raise`](http://ruby-doc.org/core/Thread.html#method-i-raise).
+# `Thread#sleep` and `Thread#wakeup` will work as expected but mixing `Synchronization::Object#wait` and
+# `Thread#wakeup` will not work on all platforms.
+#
+# @see Event implementation as an example of this class use
+#
+# @example simple
+# class AnClass < Synchronization::Object
+# def initialize
+# super
+# synchronize { @value = 'asd' }
+# end
+#
+# def value
+# synchronize { @value }
+# end
+# end
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lockable_object.rb:50
+class Concurrent::Synchronization::LockableObject < ::Concurrent::Synchronization::MutexLockableObject
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/condition.rb:57
+ def new_condition; end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/lockable_object.rb:11
+Concurrent::Synchronization::LockableObjectImplementation = Concurrent::Synchronization::MutexLockableObject
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:60
+class Concurrent::Synchronization::MonitorLockableObject < ::Concurrent::Synchronization::AbstractLockableObject
+ include ::Concurrent::Synchronization::ConditionSignalling
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:65
+ def initialize; end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:83
+ def ns_wait(timeout = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:79
+ def synchronize; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:71
+ def initialize_copy(other); end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:25
+class Concurrent::Synchronization::MutexLockableObject < ::Concurrent::Synchronization::AbstractLockableObject
+ include ::Concurrent::Synchronization::ConditionSignalling
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:30
+ def initialize; end
+
+ protected
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:52
+ def ns_wait(timeout = T.unsafe(nil)); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:44
+ def synchronize; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/mutex_lockable_object.rb:36
+ def initialize_copy(other); end
+end
+
+# Abstract object providing final, volatile, ans CAS extensions to build other concurrent abstractions.
+# - final instance variables see {Object.safe_initialization!}
+# - volatile instance variables see {Object.attr_volatile}
+# - volatile instance variables see {Object.attr_atomic}
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:15
+class Concurrent::Synchronization::Object < ::Concurrent::Synchronization::AbstractObject
+ include ::Concurrent::Synchronization::Volatile
+ extend ::Concurrent::Synchronization::Volatile::ClassMethods
+
+ # Has to be called by children.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:28
+ def initialize; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:146
+ def __initialize_atomic_fields__; end
+
+ class << self
+ # @return [true, false] is the attribute with name atomic?
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:125
+ def atomic_attribute?(name); end
+
+ # @param [true, false] inherited should inherited volatile with CAS fields be returned?
+ # @return [::Array] Returns defined volatile with CAS fields on this class.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:119
+ def atomic_attributes(inherited = T.unsafe(nil)); end
+
+ # Creates methods for reading and writing to a instance variable with
+ # volatile (Java) semantic as {.attr_volatile} does.
+ # The instance variable should be accessed only through generated methods.
+ # This method generates following methods: `value`, `value=(new_value) #=> new_value`,
+ # `swap_value(new_value) #=> old_value`,
+ # `compare_and_set_value(expected, value) #=> true || false`, `update_value(&block)`.
+ # @param [::Array] names of the instance variables to be volatile with CAS.
+ # @return [::Array] names of defined method names.
+ # @!macro attr_atomic
+ # @!method $1
+ # @return [Object] The $1.
+ # @!method $1=(new_$1)
+ # Set the $1.
+ # @return [Object] new_$1.
+ # @!method swap_$1(new_$1)
+ # Set the $1 to new_$1 and return the old $1.
+ # @return [Object] old $1
+ # @!method compare_and_set_$1(expected_$1, new_$1)
+ # Sets the $1 to new_$1 if the current $1 is expected_$1
+ # @return [true, false]
+ # @!method update_$1(&block)
+ # Updates the $1 using the block.
+ # @yield [Object] Calculate a new $1 using given (old) $1
+ # @yieldparam [Object] old $1
+ # @return [Object] new $1
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:84
+ def attr_atomic(*names); end
+
+ # For testing purposes, quite slow. Injects assert code to new method which will raise if class instance contains
+ # any instance variables with CamelCase names and isn't {.safe_initialization?}.
+ # @raise when offend found
+ # @return [true]
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:45
+ def ensure_safe_initialization_when_final_fields_are_present; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:33
+ def safe_initialization!; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:37
+ def safe_initialization?; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/object.rb:131
+ def define_initialize_atomic_fields; end
+ end
+end
+
+# @!visibility private
+# @!macro internal_implementation_note
+#
+# By extending this module, a class and all its children are marked to be constructed safely. Meaning that
+# all writes (ivar initializations) are made visible to all readers of newly constructed object. It ensures
+# same behaviour as Java's final fields.
+#
+# Due to using Kernel#extend, the module is not included again if already present in the ancestors,
+# which avoids extra overhead.
+#
+# @example
+# class AClass < Concurrent::Synchronization::Object
+# extend Concurrent::Synchronization::SafeInitialization
+#
+# def initialize
+# @AFinalValue = 'value' # published safely, #foo will never return nil
+# end
+#
+# def foo
+# @AFinalValue
+# end
+# end
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/safe_initialization.rb:28
+module Concurrent::Synchronization::SafeInitialization
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/safe_initialization.rb:29
+ def new(*args, &block); end
+end
+
+# Volatile adds the attr_volatile class method when included.
+#
+# @example
+# class Foo
+# include Concurrent::Synchronization::Volatile
+#
+# attr_volatile :bar
+#
+# def initialize
+# self.bar = 1
+# end
+# end
+#
+# foo = Foo.new
+# foo.bar
+# => 1
+# foo.bar = 2
+# => 2
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/volatile.rb:28
+module Concurrent::Synchronization::Volatile
+ mixes_in_class_methods ::Concurrent::Synchronization::Volatile::ClassMethods
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/volatile.rb:33
+ def full_memory_barrier; end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/volatile.rb:29
+ def included(base); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/volatile.rb:37
+module Concurrent::Synchronization::Volatile::ClassMethods
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/synchronization/volatile.rb:39
+ def attr_volatile(*names); end
+end
+
+# This class provides a trivial way to synchronize all calls to a given object
+# by wrapping it with a `Delegator` that performs `Monitor#enter/exit` calls
+# around the delegated `#send`. Example:
+#
+# array = [] # not thread-safe on many impls
+# array = SynchronizedDelegator.new([]) # thread-safe
+#
+# A simple `Monitor` provides a very coarse-grained way to synchronize a given
+# object, in that it will cause synchronization for methods that have no need
+# for it, but this is a trivial way to get thread-safety where none may exist
+# currently on some implementations.
+#
+# This class is currently being considered for inclusion into stdlib, via
+# https://bugs.ruby-lang.org/issues/8556
+#
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/synchronized_delegator.rb:21
+class Concurrent::SynchronizedDelegator < ::SimpleDelegator
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/synchronized_delegator.rb:31
+ def initialize(obj); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/synchronized_delegator.rb:36
+ def method_missing(method, *args, &block); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/synchronized_delegator.rb:22
+ def setup; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/synchronized_delegator.rb:27
+ def teardown; end
+end
+
+# A `TVar` is a transactional variable - a single-element container that
+# is used as part of a transaction - see `Concurrent::atomically`.
+#
+# @!macro thread_safe_variable_comparison
+#
+# {include:file:docs-source/tvar.md}
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:12
+class Concurrent::TVar < ::Concurrent::Synchronization::Object
+ extend ::Concurrent::Synchronization::SafeInitialization
+
+ # Create a new `TVar` with an initial value.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:16
+ def initialize(value); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:46
+ def unsafe_lock; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:36
+ def unsafe_value; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:41
+ def unsafe_value=(value); end
+
+ # Get the value of a `TVar`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:22
+ def value; end
+
+ # Set the value of a `TVar`.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:29
+ def value=(value); end
+end
+
+# A `ThreadLocalVar` is a variable where the value is different for each thread.
+# Each variable may have a default value, but when you modify the variable only
+# the current thread will ever see that change.
+#
+# This is similar to Ruby's built-in thread-local variables (`Thread#thread_variable_get`),
+# but with these major advantages:
+# * `ThreadLocalVar` has its own identity, it doesn't need a Symbol.
+# * Each Ruby's built-in thread-local variable leaks some memory forever (it's a Symbol held forever on the thread),
+# so it's only OK to create a small amount of them.
+# `ThreadLocalVar` has no such issue and it is fine to create many of them.
+# * Ruby's built-in thread-local variables leak forever the value set on each thread (unless set to nil explicitly).
+# `ThreadLocalVar` automatically removes the mapping for each thread once the `ThreadLocalVar` instance is GC'd.
+#
+# @!macro thread_safe_variable_comparison
+#
+# @example
+# v = ThreadLocalVar.new(14)
+# v.value #=> 14
+# v.value = 2
+# v.value #=> 2
+#
+# @example
+# v = ThreadLocalVar.new(14)
+#
+# t1 = Thread.new do
+# v.value #=> 14
+# v.value = 1
+# v.value #=> 1
+# end
+#
+# t2 = Thread.new do
+# v.value #=> 14
+# v.value = 2
+# v.value #=> 2
+# end
+#
+# v.value #=> 14
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:43
+class Concurrent::ThreadLocalVar
+ # Creates a thread local variable.
+ #
+ # @param [Object] default the default value when otherwise unset
+ # @param [Proc] default_block Optional block that gets called to obtain the
+ # default value for each thread
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:51
+ def initialize(default = T.unsafe(nil), &default_block); end
+
+ # Bind the given value to thread local storage during
+ # execution of the given block.
+ #
+ # @param [Object] value the value to bind
+ # @yield the operation to be performed with the bound variable
+ # @return [Object] the value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:88
+ def bind(value); end
+
+ # Returns the value in the current thread's copy of this thread-local variable.
+ #
+ # @return [Object] the current value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:70
+ def value; end
+
+ # Sets the current thread's copy of this thread-local variable to the specified value.
+ #
+ # @param [Object] value the value to set
+ # @return [Object] the new value
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:78
+ def value=(value); end
+
+ protected
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:103
+ def default; end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/thread_local_var.rb:44
+Concurrent::ThreadLocalVar::LOCALS = T.let(T.unsafe(nil), Concurrent::ThreadLocals)
+
+# @!visibility private
+# @!macro internal_implementation_note
+# An array-backed storage of indexed variables per thread.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:141
+class Concurrent::ThreadLocals < ::Concurrent::AbstractLocals
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:142
+ def locals; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/atomic/locals.rb:146
+ def locals!; end
+end
+
+# @!macro thread_pool_executor
+#
+# An abstraction composed of one or more threads and a task queue. Tasks
+# (blocks or `proc` objects) are submitted to the pool and added to the queue.
+# The threads in the pool remove the tasks and execute them in the order
+# they were received.
+#
+# A `ThreadPoolExecutor` will automatically adjust the pool size according
+# to the bounds set by `min-threads` and `max-threads`. When a new task is
+# submitted and fewer than `min-threads` threads are running, a new thread
+# is created to handle the request, even if other worker threads are idle.
+# If there are more than `min-threads` but less than `max-threads` threads
+# running, a new thread will be created only if the queue is full.
+#
+# Threads that are idle for too long will be garbage collected, down to the
+# configured minimum options. Should a thread crash it, too, will be garbage collected.
+#
+# `ThreadPoolExecutor` is based on the Java class of the same name. From
+# the official Java documentation;
+#
+# > Thread pools address two different problems: they usually provide
+# > improved performance when executing large numbers of asynchronous tasks,
+# > due to reduced per-task invocation overhead, and they provide a means
+# > of bounding and managing the resources, including threads, consumed
+# > when executing a collection of tasks. Each ThreadPoolExecutor also
+# > maintains some basic statistics, such as the number of completed tasks.
+# >
+# > To be useful across a wide range of contexts, this class provides many
+# > adjustable parameters and extensibility hooks. However, programmers are
+# > urged to use the more convenient Executors factory methods
+# > [CachedThreadPool] (unbounded thread pool, with automatic thread reclamation),
+# > [FixedThreadPool] (fixed size thread pool) and [SingleThreadExecutor] (single
+# > background thread), that preconfigure settings for the most common usage
+# > scenarios.
+#
+# @!macro thread_pool_options
+#
+# @!macro thread_pool_executor_public_api
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/thread_pool_executor.rb:56
+class Concurrent::ThreadPoolExecutor < ::Concurrent::RubyThreadPoolExecutor; end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/thread_pool_executor.rb:10
+Concurrent::ThreadPoolExecutorImplementation = Concurrent::RubyThreadPoolExecutor
+
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util.rb:4
+module Concurrent::ThreadSafe; end
+
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util.rb:7
+module Concurrent::ThreadSafe::Util
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util/data_structures.rb:16
+ def make_synchronized_on_cruby(klass); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util/data_structures.rb:41
+ def make_synchronized_on_truffleruby(klass); end
+ end
+end
+
+# TODO (pitr-ch 15-Oct-2016): migrate to Utility::ProcessorCounter
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util.rb:13
+Concurrent::ThreadSafe::Util::CPU_COUNT = T.let(T.unsafe(nil), Integer)
+
+# TODO (pitr-ch 15-Oct-2016): migrate to Utility::NativeInteger
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util.rb:10
+Concurrent::ThreadSafe::Util::FIXNUM_BIT_SIZE = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/thread_safe/util.rb:11
+Concurrent::ThreadSafe::Util::MAX_INT = T.let(T.unsafe(nil), Integer)
+
+# Raised when an operation times out.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/errors.rb:55
+class Concurrent::TimeoutError < ::Concurrent::Error; end
+
+# Executes a collection of tasks, each after a given delay. A master task
+# monitors the set and schedules each task for execution at the appropriate
+# time. Tasks are run on the global thread pool or on the supplied executor.
+# Each task is represented as a `ScheduledTask`.
+#
+# @see Concurrent::ScheduledTask
+#
+# @!macro monotonic_clock_warning
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:19
+class Concurrent::TimerSet < ::Concurrent::RubyExecutorService
+ # Create a new set of timed tasks.
+ #
+ # @!macro executor_options
+ #
+ # @param [Hash] opts the options used to specify the executor on which to perform actions
+ # @option opts [Executor] :executor when set use the given `Executor` instance.
+ # Three special values are also supported: `:task` returns the global task pool,
+ # `:operation` returns the global operation pool, and `:immediate` returns a new
+ # `ImmediateExecutor` object.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:30
+ def initialize(opts = T.unsafe(nil)); end
+
+ # Begin an immediate shutdown. In-progress tasks will be allowed to
+ # complete but enqueued tasks will be dismissed and no new tasks
+ # will be accepted. Has no additional effect if the thread pool is
+ # not running.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:62
+ def kill; end
+
+ # Post a task to be execute run after a given delay (in seconds). If the
+ # delay is less than 1/100th of a second the task will be immediately post
+ # to the executor.
+ #
+ # @param [Float] delay the number of seconds to wait for before executing the task.
+ # @param [Array] args the arguments passed to the task on execution.
+ #
+ # @yield the task to be performed.
+ #
+ # @return [Concurrent::ScheduledTask, false] IVar representing the task if the post
+ # is successful; false after shutdown.
+ #
+ # @raise [ArgumentError] if the intended execution time is not in the future.
+ # @raise [ArgumentError] if no block is given.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:48
+ def post(delay, *args, &task); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:67
+ def <<(task); end
+
+ # Initialize the object.
+ #
+ # @param [Hash] opts the options to create the object with.
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:75
+ def ns_initialize(opts); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:95
+ def ns_post_task(task); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:132
+ def ns_reset_if_forked; end
+
+ # `ExecutorService` callback called during shutdown.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:123
+ def ns_shutdown_execution; end
+
+ # Post the task to the internal queue.
+ #
+ # @note This is intended as a callback method from ScheduledTask
+ # only. It is not intended to be used directly. Post a task
+ # by using the `SchedulesTask#execute` method.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:90
+ def post_task(task); end
+
+ # Run a loop and execute tasks in the scheduled order and at the approximate
+ # scheduled time. If no tasks remain the thread will exit gracefully so that
+ # garbage collection can occur. If there are no ready tasks it will sleep
+ # for up to 60 seconds waiting for the next scheduled task.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:146
+ def process_tasks; end
+
+ # Remove the given task from the queue.
+ #
+ # @note This is intended as a callback method from `ScheduledTask`
+ # only. It is not intended to be used directly. Cancel a task
+ # by using the `ScheduledTask#cancel` method.
+ #
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/executor/timer_set.rb:116
+ def remove_task(task); end
+end
+
+# A very common concurrency pattern is to run a thread that performs a task at
+# regular intervals. The thread that performs the task sleeps for the given
+# interval then wakes up and performs the task. Lather, rinse, repeat... This
+# pattern causes two problems. First, it is difficult to test the business
+# logic of the task because the task itself is tightly coupled with the
+# concurrency logic. Second, an exception raised while performing the task can
+# cause the entire thread to abend. In a long-running application where the
+# task thread is intended to run for days/weeks/years a crashed task thread
+# can pose a significant problem. `TimerTask` alleviates both problems.
+#
+# When a `TimerTask` is launched it starts a thread for monitoring the
+# execution interval. The `TimerTask` thread does not perform the task,
+# however. Instead, the TimerTask launches the task on a separate thread.
+# Should the task experience an unrecoverable crash only the task thread will
+# crash. This makes the `TimerTask` very fault tolerant. Additionally, the
+# `TimerTask` thread can respond to the success or failure of the task,
+# performing logging or ancillary operations.
+#
+# One other advantage of `TimerTask` is that it forces the business logic to
+# be completely decoupled from the concurrency logic. The business logic can
+# be tested separately then passed to the `TimerTask` for scheduling and
+# running.
+#
+# A `TimerTask` supports two different types of interval calculations.
+# A fixed delay will always wait the same amount of time between the
+# completion of one task and the start of the next. A fixed rate will
+# attempt to maintain a constant rate of execution regardless of the
+# duration of the task. For example, if a fixed rate task is scheduled
+# to run every 60 seconds but the task itself takes 10 seconds to
+# complete, the next task will be scheduled to run 50 seconds after
+# the start of the previous task. If the task takes 70 seconds to
+# complete, the next task will be start immediately after the previous
+# task completes. Tasks will not be executed concurrently.
+#
+# In some cases it may be necessary for a `TimerTask` to affect its own
+# execution cycle. To facilitate this, a reference to the TimerTask instance
+# is passed as an argument to the provided block every time the task is
+# executed.
+#
+# The `TimerTask` class includes the `Dereferenceable` mixin module so the
+# result of the last execution is always available via the `#value` method.
+# Dereferencing options can be passed to the `TimerTask` during construction or
+# at any later time using the `#set_deref_options` method.
+#
+# `TimerTask` supports notification through the Ruby standard library
+# {http://ruby-doc.org/stdlib-2.0/libdoc/observer/rdoc/Observable.html
+# Observable} module. On execution the `TimerTask` will notify the observers
+# with three arguments: time of execution, the result of the block (or nil on
+# failure), and any raised exceptions (or nil on success).
+#
+# @!macro copy_options
+#
+# @example Basic usage
+# task = Concurrent::TimerTask.new{ puts 'Boom!' }
+# task.execute
+#
+# task.execution_interval #=> 60 (default)
+#
+# # wait 60 seconds...
+# #=> 'Boom!'
+#
+# task.shutdown #=> true
+#
+# @example Configuring `:execution_interval`
+# task = Concurrent::TimerTask.new(execution_interval: 5) do
+# puts 'Boom!'
+# end
+#
+# task.execution_interval #=> 5
+#
+# @example Immediate execution with `:run_now`
+# task = Concurrent::TimerTask.new(run_now: true){ puts 'Boom!' }
+# task.execute
+#
+# #=> 'Boom!'
+#
+# @example Configuring `:interval_type` with either :fixed_delay or :fixed_rate, default is :fixed_delay
+# task = Concurrent::TimerTask.new(execution_interval: 5, interval_type: :fixed_rate) do
+# puts 'Boom!'
+# end
+# task.interval_type #=> :fixed_rate
+#
+# @example Last `#value` and `Dereferenceable` mixin
+# task = Concurrent::TimerTask.new(
+# dup_on_deref: true,
+# execution_interval: 5
+# ){ Time.now }
+#
+# task.execute
+# Time.now #=> 2013-11-07 18:06:50 -0500
+# sleep(10)
+# task.value #=> 2013-11-07 18:06:55 -0500
+#
+# @example Controlling execution from within the block
+# timer_task = Concurrent::TimerTask.new(execution_interval: 1) do |task|
+# task.execution_interval.to_i.times{ print 'Boom! ' }
+# print "\n"
+# task.execution_interval += 1
+# if task.execution_interval > 5
+# puts 'Stopping...'
+# task.shutdown
+# end
+# end
+#
+# timer_task.execute
+# #=> Boom!
+# #=> Boom! Boom!
+# #=> Boom! Boom! Boom!
+# #=> Boom! Boom! Boom! Boom!
+# #=> Boom! Boom! Boom! Boom! Boom!
+# #=> Stopping...
+#
+# @example Observation
+# class TaskObserver
+# def update(time, result, ex)
+# if result
+# print "(#{time}) Execution successfully returned #{result}\n"
+# else
+# print "(#{time}) Execution failed with error #{ex}\n"
+# end
+# end
+# end
+#
+# task = Concurrent::TimerTask.new(execution_interval: 1){ 42 }
+# task.add_observer(TaskObserver.new)
+# task.execute
+# sleep 4
+#
+# #=> (2013-10-13 19:08:58 -0400) Execution successfully returned 42
+# #=> (2013-10-13 19:08:59 -0400) Execution successfully returned 42
+# #=> (2013-10-13 19:09:00 -0400) Execution successfully returned 42
+# task.shutdown
+#
+# task = Concurrent::TimerTask.new(execution_interval: 1){ sleep }
+# task.add_observer(TaskObserver.new)
+# task.execute
+#
+# #=> (2013-10-13 19:07:25 -0400) Execution timed out
+# #=> (2013-10-13 19:07:27 -0400) Execution timed out
+# #=> (2013-10-13 19:07:29 -0400) Execution timed out
+# task.shutdown
+#
+# task = Concurrent::TimerTask.new(execution_interval: 1){ raise StandardError }
+# task.add_observer(TaskObserver.new)
+# task.execute
+#
+# #=> (2013-10-13 19:09:37 -0400) Execution failed with error StandardError
+# #=> (2013-10-13 19:09:38 -0400) Execution failed with error StandardError
+# #=> (2013-10-13 19:09:39 -0400) Execution failed with error StandardError
+# task.shutdown
+#
+# @see http://ruby-doc.org/stdlib-2.0/libdoc/observer/rdoc/Observable.html
+# @see http://docs.oracle.com/javase/7/docs/api/java/util/TimerTask.html
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:166
+class Concurrent::TimerTask < ::Concurrent::RubyExecutorService
+ include ::Concurrent::Concern::Dereferenceable
+ include ::Concurrent::Concern::Observable
+
+ # Create a new TimerTask with the given task and configuration.
+ #
+ # @!macro timer_task_initialize
+ # @param [Hash] opts the options defining task execution.
+ # @option opts [Float] :execution_interval number of seconds between
+ # task executions (default: EXECUTION_INTERVAL)
+ # @option opts [Boolean] :run_now Whether to run the task immediately
+ # upon instantiation or to wait until the first # execution_interval
+ # has passed (default: false)
+ # @options opts [Symbol] :interval_type method to calculate the interval
+ # between executions, can be either :fixed_rate or :fixed_delay.
+ # (default: :fixed_delay)
+ # @option opts [Executor] executor, default is `global_io_executor`
+ #
+ # @!macro deref_options
+ #
+ # @raise ArgumentError when no block is given.
+ #
+ # @yield to the block after :execution_interval seconds have passed since
+ # the last yield
+ # @yieldparam task a reference to the `TimerTask` instance so that the
+ # block can control its own lifecycle. Necessary since `self` will
+ # refer to the execution context of the block rather than the running
+ # `TimerTask`.
+ #
+ # @return [TimerTask] the new `TimerTask`
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:210
+ def initialize(opts = T.unsafe(nil), &task); end
+
+ # Execute a previously created `TimerTask`.
+ #
+ # @return [TimerTask] a reference to `self`
+ #
+ # @example Instance and execute in separate steps
+ # task = Concurrent::TimerTask.new(execution_interval: 10){ print "Hello World\n" }
+ # task.running? #=> false
+ # task.execute
+ # task.running? #=> true
+ #
+ # @example Instance and execute in one line
+ # task = Concurrent::TimerTask.new(execution_interval: 10){ print "Hello World\n" }.execute
+ # task.running? #=> true
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:236
+ def execute; end
+
+ # @!attribute [rw] execution_interval
+ # @return [Fixnum] Number of seconds after the task completes before the
+ # task is performed again.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:261
+ def execution_interval; end
+
+ # @!attribute [rw] execution_interval
+ # @return [Fixnum] Number of seconds after the task completes before the
+ # task is performed again.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:268
+ def execution_interval=(value); end
+
+ # @!attribute [r] interval_type
+ # @return [Symbol] method to calculate the interval between executions
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:278
+ def interval_type; end
+
+ # Is the executor running?
+ #
+ # @return [Boolean] `true` when running, `false` when shutting down or shutdown
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:219
+ def running?; end
+
+ # @!attribute [rw] timeout_interval
+ # @return [Fixnum] Number of seconds the task can run before it is
+ # considered to have failed.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:283
+ def timeout_interval; end
+
+ # @!attribute [rw] timeout_interval
+ # @return [Fixnum] Number of seconds the task can run before it is
+ # considered to have failed.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:290
+ def timeout_interval=(value); end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:294
+ def <<(task); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:357
+ def calculate_next_interval(start_time); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:339
+ def execute_task(completion, age_when_scheduled); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:298
+ def ns_initialize(opts, &task); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:327
+ def ns_kill_execution; end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:321
+ def ns_shutdown_execution; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:294
+ def post(*args, &task); end
+
+ # @!visibility private
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:333
+ def schedule_next_task(interval = T.unsafe(nil)); end
+
+ class << self
+ # Create and execute a new `TimerTask`.
+ #
+ # @!macro timer_task_initialize
+ #
+ # @example
+ # task = Concurrent::TimerTask.execute(execution_interval: 10){ print "Hello World\n" }
+ # task.running? #=> true
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:254
+ def execute(opts = T.unsafe(nil), &task); end
+ end
+end
+
+# Default `:interval_type`
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:182
+Concurrent::TimerTask::DEFAULT_INTERVAL_TYPE = T.let(T.unsafe(nil), Symbol)
+
+# Default `:execution_interval` in seconds.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:171
+Concurrent::TimerTask::EXECUTION_INTERVAL = T.let(T.unsafe(nil), Integer)
+
+# Maintain the interval between the end of one execution and the start of the next execution.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:174
+Concurrent::TimerTask::FIXED_DELAY = T.let(T.unsafe(nil), Symbol)
+
+# Maintain the interval between the start of one execution and the start of the next.
+# If execution time exceeds the interval, the next execution will start immediately
+# after the previous execution finishes. Executions will not run concurrently.
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/timer_task.rb:179
+Concurrent::TimerTask::FIXED_RATE = T.let(T.unsafe(nil), Symbol)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:153
+class Concurrent::Transaction
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:162
+ def initialize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:192
+ def abort; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:196
+ def commit; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:177
+ def open(tvar); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:166
+ def read(tvar); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:206
+ def unlock; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:171
+ def write(tvar, value); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:212
+ def current; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:216
+ def current=(transaction); end
+ end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:155
+Concurrent::Transaction::ABORTED = T.let(T.unsafe(nil), Object)
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:159
+class Concurrent::Transaction::AbortError < ::StandardError; end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:160
+class Concurrent::Transaction::LeaveError < ::StandardError; end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+class Concurrent::Transaction::OpenEntry < ::Struct
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def modified; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def modified=(_); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def value; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def value=(_); end
+
+ class << self
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def [](*_arg0); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def inspect; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def keyword_init?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def members; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tvar.rb:157
+ def new(*_arg0); end
+ end
+end
+
+# A fixed size array with volatile (synchronized, thread safe) getters/setters.
+# Mixes in Ruby's `Enumerable` module for enhanced search, sort, and traversal.
+#
+# @example
+# tuple = Concurrent::Tuple.new(16)
+#
+# tuple.set(0, :foo) #=> :foo | volatile write
+# tuple.get(0) #=> :foo | volatile read
+# tuple.compare_and_set(0, :foo, :bar) #=> true | strong CAS
+# tuple.cas(0, :foo, :baz) #=> false | strong CAS
+# tuple.get(0) #=> :bar | volatile read
+#
+# @see https://en.wikipedia.org/wiki/Tuple Tuple entry at Wikipedia
+# @see http://www.erlang.org/doc/reference_manual/data_types.html#id70396 Erlang Tuple
+# @see http://ruby-doc.org/core-2.2.2/Enumerable.html Enumerable
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:20
+class Concurrent::Tuple
+ include ::Enumerable
+
+ # Create a new tuple of the given size.
+ #
+ # @param [Integer] size the number of elements in the tuple
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:29
+ def initialize(size); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:73
+ def cas(i, old_value, new_value); end
+
+ # Set the value at the given index to the new value if and only if the current
+ # value matches the given old value.
+ #
+ # @param [Integer] i the index for the element to set
+ # @param [Object] old_value the value to compare against the current value
+ # @param [Object] new_value the value to set at the given index
+ #
+ # @return [Boolean] true if the value at the given element was set else false
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:69
+ def compare_and_set(i, old_value, new_value); end
+
+ # Calls the given block once for each element in self, passing that element as a parameter.
+ #
+ # @yieldparam [Object] ref the `Concurrent::AtomicReference` object at the current index
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:78
+ def each; end
+
+ # Get the value of the element at the given index.
+ #
+ # @param [Integer] i the index from which to retrieve the value
+ # @return [Object] the value at the given index or nil if the index is out of bounds
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:43
+ def get(i); end
+
+ # Set the element at the given index to the given value
+ #
+ # @param [Integer] i the index for the element to set
+ # @param [Object] value the value to set at the given index
+ #
+ # @return [Object] the new value of the element at the given index or nil if the index is out of bounds
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:55
+ def set(i, value); end
+
+ # The (fixed) size of the tuple.
+ #
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:24
+ def size; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:47
+ def volatile_get(i); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/tuple.rb:59
+ def volatile_set(i, value); end
+end
+
+# @!visibility private
+# @!visibility private
+# @!visibility private
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:3
+module Concurrent::Utility; end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:6
+module Concurrent::Utility::EngineDetector
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:7
+ def on_cruby?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:11
+ def on_jruby?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:27
+ def on_linux?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:23
+ def on_osx?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:15
+ def on_truffleruby?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:19
+ def on_windows?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/engine.rb:31
+ def ruby_version(version = T.unsafe(nil), comparison, major, minor, patch); end
+end
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:9
+module Concurrent::Utility::NativeExtensionLoader
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:11
+ def allow_c_extensions?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:15
+ def c_extensions_loaded?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:19
+ def load_native_extensions; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:50
+ def java_extensions_loaded?; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:38
+ def load_error_path(error); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:46
+ def set_c_extensions_loaded; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:54
+ def set_java_extensions_loaded; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_extension_loader.rb:58
+ def try_load_c_extension(path); end
+end
+
+# @private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:5
+module Concurrent::Utility::NativeInteger
+ extend ::Concurrent::Utility::NativeInteger
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:24
+ def ensure_integer(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:31
+ def ensure_integer_and_bounds(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:17
+ def ensure_lower_bound(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:37
+ def ensure_positive(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:44
+ def ensure_positive_and_no_zero(value); end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:10
+ def ensure_upper_bound(value); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:8
+Concurrent::Utility::NativeInteger::MAX_VALUE = T.let(T.unsafe(nil), Integer)
+
+# http://stackoverflow.com/questions/535721/ruby-max-integer
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/native_integer.rb:7
+Concurrent::Utility::NativeInteger::MIN_VALUE = T.let(T.unsafe(nil), Integer)
+
+# @!visibility private
+#
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:10
+class Concurrent::Utility::ProcessorCounter
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:11
+ def initialize; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:26
+ def available_processor_count; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:41
+ def cpu_quota; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:45
+ def cpu_shares; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:22
+ def physical_processor_count; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:18
+ def processor_count; end
+
+ private
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:104
+ def compute_cpu_quota; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:124
+ def compute_cpu_shares; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:59
+ def compute_physical_processor_count; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:51
+ def compute_processor_count; end
+
+ # pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/utility/processor_counter.rb:99
+ def run(command); end
+end
+
+# pkg:gem/concurrent-ruby#lib/concurrent-ruby/concurrent/version.rb:2
+Concurrent::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/connection_pool@3.0.2.rbi b/sorbet/rbi/gems/connection_pool@3.0.2.rbi
new file mode 100644
index 0000000..3d9f595
--- /dev/null
+++ b/sorbet/rbi/gems/connection_pool@3.0.2.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `connection_pool` gem.
+# Please instead update this file by running `bin/tapioca gem connection_pool`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/constant_resolver@0.3.0.rbi b/sorbet/rbi/gems/constant_resolver@0.3.0.rbi
new file mode 100644
index 0000000..921a1f2
--- /dev/null
+++ b/sorbet/rbi/gems/constant_resolver@0.3.0.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `constant_resolver` gem.
+# Please instead update this file by running `bin/tapioca gem constant_resolver`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/crass@1.0.7.rbi b/sorbet/rbi/gems/crass@1.0.7.rbi
new file mode 100644
index 0000000..099fd1c
--- /dev/null
+++ b/sorbet/rbi/gems/crass@1.0.7.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `crass` gem.
+# Please instead update this file by running `bin/tapioca gem crass`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/diff-lcs@1.6.2.rbi b/sorbet/rbi/gems/diff-lcs@1.6.2.rbi
new file mode 100644
index 0000000..fded7ac
--- /dev/null
+++ b/sorbet/rbi/gems/diff-lcs@1.6.2.rbi
@@ -0,0 +1,1067 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `diff-lcs` gem.
+# Please instead update this file by running `bin/tapioca gem diff-lcs`.
+
+
+# pkg:gem/diff-lcs#lib/diff/lcs.rb:3
+module Diff; end
+
+# == How Diff Works (by Mark-Jason Dominus)
+#
+# I once read an article written by the authors of +diff+; they said that they
+# hard worked very hard on the algorithm until they found the right one.
+#
+# I think what they ended up using (and I hope someone will correct me, because
+# I am not very confident about this) was the `longest common subsequence'
+# method. In the LCS problem, you have two sequences of items:
+#
+# a b c d f g h j q z
+# a b c d e f g i j k r x y z
+#
+# and you want to find the longest sequence of items that is present in both
+# original sequences in the same order. That is, you want to find a new
+# sequence *S* which can be obtained from the first sequence by deleting some
+# items, and from the second sequence by deleting other items. You also want
+# *S* to be as long as possible. In this case *S* is:
+#
+# a b c d f g j z
+#
+# From there it's only a small step to get diff-like output:
+#
+# e h i k q r x y
+# + - + + - + + +
+#
+# This module solves the LCS problem. It also includes a canned function to
+# generate +diff+-like output.
+#
+# It might seem from the example above that the LCS of two sequences is always
+# pretty obvious, but that's not always the case, especially when the two
+# sequences have many repeated elements. For example, consider
+#
+# a x b y c z p d q
+# a b c a x b y c z
+#
+# A naive approach might start by matching up the +a+ and +b+ that appear at
+# the beginning of each sequence, like this:
+#
+# a x b y c z p d q
+# a b c a b y c z
+#
+# This finds the common subsequence +a b c z+. But actually, the LCS is +a x b
+# y c z+:
+#
+# a x b y c z p d q
+# a b c a x b y c z
+#
+# pkg:gem/diff-lcs#lib/diff/lcs.rb:51
+module Diff::LCS
+ # Returns the difference set between +self+ and +other+. See Diff::LCS#diff.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:76
+ def diff(other, callbacks = T.unsafe(nil), &block); end
+
+ # Returns an Array containing the longest common subsequence(s) between
+ # +self+ and +other+. See Diff::LCS#lcs.
+ #
+ # lcs = seq1.lcs(seq2)
+ #
+ # A note when using objects: Diff::LCS only works properly when each object
+ # can be used as a key in a Hash. This means that those objects must implement
+ # the methods +#hash+ and +#eql?+ such that two objects containing identical values
+ # compare identically for key purposes. That is:
+ #
+ # O.new('a').eql?(O.new('a')) == true &&
+ # O.new('a').hash == O.new('a').hash
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:71
+ def lcs(other, &block); end
+
+ # Attempts to patch +self+ with the provided +patchset+. A new sequence based
+ # on +self+ and the +patchset+ will be created. See Diff::LCS#patch. Attempts
+ # to autodiscover the direction of the patch.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:102
+ def patch(patchset); end
+
+ # Attempts to patch +self+ with the provided +patchset+. A new sequence based
+ # on +self+ and the +patchset+ will be created. See Diff::LCS#patch. Does no
+ # patch direction autodiscovery.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:110
+ def patch!(patchset); end
+
+ # Attempts to patch +self+ with the provided +patchset+, using #patch!. If
+ # the sequence this is used on supports #replace, the value of +self+ will be
+ # replaced. See Diff::LCS#patch. Does no patch direction autodiscovery.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:124
+ def patch_me(patchset); end
+
+ # Returns the balanced ("side-by-side") difference set between +self+ and
+ # +other+. See Diff::LCS#sdiff.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:82
+ def sdiff(other, callbacks = T.unsafe(nil), &block); end
+
+ # Traverses the discovered longest common subsequences between +self+ and
+ # +other+ using the alternate, balanced algorithm. See
+ # Diff::LCS#traverse_balanced.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:95
+ def traverse_balanced(other, callbacks = T.unsafe(nil), &block); end
+
+ # Traverses the discovered longest common subsequences between +self+ and
+ # +other+. See Diff::LCS#traverse_sequences.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:88
+ def traverse_sequences(other, callbacks = T.unsafe(nil), &block); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:105
+ def unpatch(patchset); end
+
+ # Attempts to unpatch +self+ with the provided +patchset+. A new sequence
+ # based on +self+ and the +patchset+ will be created. See Diff::LCS#unpatch.
+ # Does no patch direction autodiscovery.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:117
+ def unpatch!(patchset); end
+
+ # Attempts to unpatch +self+ with the provided +patchset+, using #unpatch!.
+ # If the sequence this is used on supports #replace, the value of +self+ will
+ # be replaced. See Diff::LCS#unpatch. Does no patch direction autodiscovery.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:135
+ def unpatch_me(patchset); end
+
+ class << self
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:158
+ def LCS(seq1, seq2, &block); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:52
+ def callbacks_for(callbacks); end
+
+ # #diff computes the smallest set of additions and deletions necessary to
+ # turn the first sequence into the second, and returns a description of these
+ # changes.
+ #
+ # See Diff::LCS::DiffCallbacks for the default behaviour. An alternate
+ # behaviour may be implemented with Diff::LCS::ContextDiffCallbacks. If a
+ # Class argument is provided for +callbacks+, #diff will attempt to
+ # initialise it. If the +callbacks+ object (possibly initialised) responds to
+ # #finish, it will be called.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:169
+ def diff(seq1, seq2, callbacks = T.unsafe(nil), &block); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:145
+ def lcs(seq1, seq2, &block); end
+
+ # Applies a +patchset+ to the sequence +src+ according to the +direction+
+ # (:patch or :unpatch ), producing a new sequence.
+ #
+ # If the +direction+ is not specified, Diff::LCS::patch will attempt to
+ # discover the direction of the +patchset+.
+ #
+ # A +patchset+ can be considered to apply forward (:patch ) if the
+ # following expression is true:
+ #
+ # patch(s1, diff(s1, s2)) -> s2
+ #
+ # A +patchset+ can be considered to apply backward (:unpatch ) if the
+ # following expression is true:
+ #
+ # patch(s2, diff(s1, s2)) -> s1
+ #
+ # If the +patchset+ contains no changes, the +src+ value will be returned as
+ # either src.dup or +src+. A +patchset+ can be deemed as having no
+ # changes if the following predicate returns true:
+ #
+ # patchset.empty? or
+ # patchset.flatten(1).all? { |change| change.unchanged? }
+ #
+ # === Patchsets
+ #
+ # A +patchset+ is always an enumerable sequence of changes, hunks of changes,
+ # or a mix of the two. A hunk of changes is an enumerable sequence of
+ # changes:
+ #
+ # [ # patchset
+ # # change
+ # [ # hunk
+ # # change
+ # ]
+ # ]
+ #
+ # The +patch+ method accepts patchset s that are enumerable sequences
+ # containing either Diff::LCS::Change objects (or a subclass) or the array
+ # representations of those objects. Prior to application, array
+ # representations of Diff::LCS::Change objects will be reified.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:627
+ def patch(src, patchset, direction = T.unsafe(nil)); end
+
+ # Given a set of patchset, convert the current version to the next version.
+ # Does no auto-discovery.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:737
+ def patch!(src, patchset); end
+
+ # #sdiff computes all necessary components to show two sequences and their
+ # minimized differences side by side, just like the Unix utility
+ # sdiff does:
+ #
+ # old < -
+ # same same
+ # before | after
+ # - > new
+ #
+ # See Diff::LCS::SDiffCallbacks for the default behaviour. An alternate
+ # behaviour may be implemented with Diff::LCS::ContextDiffCallbacks. If a
+ # Class argument is provided for +callbacks+, #diff will attempt to
+ # initialise it. If the +callbacks+ object (possibly initialised) responds to
+ # #finish, it will be called.
+ #
+ # Each element of a returned array is a Diff::LCS::ContextChange object,
+ # which can be implicitly converted to an array.
+ #
+ # Diff::LCS.sdiff(a, b).each do |action, (old_pos, old_element), (new_pos, new_element)|
+ # case action
+ # when '!'
+ # # replace
+ # when '-'
+ # # delete
+ # when '+'
+ # # insert
+ # end
+ # end
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:201
+ def sdiff(seq1, seq2, callbacks = T.unsafe(nil), &block); end
+
+ # #traverse_balanced is an alternative to #traverse_sequences. It uses a
+ # different algorithm to iterate through the entries in the computed longest
+ # common subsequence. Instead of viewing the changes as insertions or
+ # deletions from one of the sequences, #traverse_balanced will report
+ # changes between the sequences.
+ #
+ # The arguments to #traverse_balanced are the two sequences to traverse and a
+ # callback object, like this:
+ #
+ # traverse_balanced(seq1, seq2, Diff::LCS::ContextDiffCallbacks.new)
+ #
+ # #sdiff is implemented with #traverse_balanced.
+ #
+ # == Callback Methods
+ #
+ # Optional callback methods are emphasized .
+ #
+ # callbacks#match:: Called when +a+ and +b+ are pointing to
+ # common elements in +A+ and +B+.
+ # callbacks#discard_a:: Called when +a+ is pointing to an
+ # element not in +B+.
+ # callbacks#discard_b:: Called when +b+ is pointing to an
+ # element not in +A+.
+ # callbacks#change :: Called when +a+ and +b+ are pointing to
+ # the same relative position, but
+ # A[a] and B[b] are not
+ # the same; a change has
+ # occurred.
+ #
+ # #traverse_balanced might be a bit slower than #traverse_sequences,
+ # noticeable only while processing huge amounts of data.
+ #
+ # == Algorithm
+ #
+ # a---+
+ # v
+ # A = a b c e h j l m n p
+ # B = b c d e f j k l m r s t
+ # ^
+ # b---+
+ #
+ # === Matches
+ #
+ # If there are two arrows (+a+ and +b+) pointing to elements of sequences +A+
+ # and +B+, the arrows will initially point to the first elements of their
+ # respective sequences. #traverse_sequences will advance the arrows through
+ # the sequences one element at a time, calling a method on the user-specified
+ # callback object before each advance. It will advance the arrows in such a
+ # way that if there are elements A[i] and B[j] which are
+ # both equal and part of the longest common subsequence, there will be some
+ # moment during the execution of #traverse_sequences when arrow +a+ is
+ # pointing to A[i] and arrow +b+ is pointing to B[j] . When
+ # this happens, #traverse_sequences will call callbacks#match and
+ # then it will advance both arrows.
+ #
+ # === Discards
+ #
+ # Otherwise, one of the arrows is pointing to an element of its sequence that
+ # is not part of the longest common subsequence. #traverse_sequences will
+ # advance that arrow and will call callbacks#discard_a or
+ # callbacks#discard_b , depending on which arrow it advanced.
+ #
+ # === Changes
+ #
+ # If both +a+ and +b+ point to elements that are not part of the longest
+ # common subsequence, then #traverse_sequences will try to call
+ # callbacks#change and advance both arrows. If
+ # callbacks#change is not implemented, then
+ # callbacks#discard_a and callbacks#discard_b will be
+ # called in turn.
+ #
+ # The methods for callbacks#match , callbacks#discard_a ,
+ # callbacks#discard_b , and callbacks#change are invoked
+ # with an event comprising the action ("=", "+", "-", or "!", respectively),
+ # the indexes +i+ and +j+, and the elements A[i] and B[j] .
+ # Return values are discarded by #traverse_balanced.
+ #
+ # === Context
+ #
+ # Note that +i+ and +j+ may not be the same index position, even if +a+ and
+ # +b+ are considered to be pointing to matching or changed elements.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:476
+ def traverse_balanced(seq1, seq2, callbacks = T.unsafe(nil)); end
+
+ # #traverse_sequences is the most general facility provided by this module;
+ # #diff and #lcs are implemented as calls to it.
+ #
+ # The arguments to #traverse_sequences are the two sequences to traverse, and
+ # a callback object, like this:
+ #
+ # traverse_sequences(seq1, seq2, Diff::LCS::ContextDiffCallbacks.new)
+ #
+ # == Callback Methods
+ #
+ # Optional callback methods are emphasized .
+ #
+ # callbacks#match:: Called when +a+ and +b+ are pointing to
+ # common elements in +A+ and +B+.
+ # callbacks#discard_a:: Called when +a+ is pointing to an
+ # element not in +B+.
+ # callbacks#discard_b:: Called when +b+ is pointing to an
+ # element not in +A+.
+ # callbacks#finished_a :: Called when +a+ has reached the end of
+ # sequence +A+.
+ # callbacks#finished_b :: Called when +b+ has reached the end of
+ # sequence +B+.
+ #
+ # == Algorithm
+ #
+ # a---+
+ # v
+ # A = a b c e h j l m n p
+ # B = b c d e f j k l m r s t
+ # ^
+ # b---+
+ #
+ # If there are two arrows (+a+ and +b+) pointing to elements of sequences +A+
+ # and +B+, the arrows will initially point to the first elements of their
+ # respective sequences. #traverse_sequences will advance the arrows through
+ # the sequences one element at a time, calling a method on the user-specified
+ # callback object before each advance. It will advance the arrows in such a
+ # way that if there are elements A[i] and B[j] which are
+ # both equal and part of the longest common subsequence, there will be some
+ # moment during the execution of #traverse_sequences when arrow +a+ is
+ # pointing to A[i] and arrow +b+ is pointing to B[j] . When
+ # this happens, #traverse_sequences will call callbacks#match and
+ # then it will advance both arrows.
+ #
+ # Otherwise, one of the arrows is pointing to an element of its sequence that
+ # is not part of the longest common subsequence. #traverse_sequences will
+ # advance that arrow and will call callbacks#discard_a or
+ # callbacks#discard_b , depending on which arrow it advanced. If both
+ # arrows point to elements that are not part of the longest common
+ # subsequence, then #traverse_sequences will advance arrow +a+ and call the
+ # appropriate callback, then it will advance arrow +b+ and call the appropriate
+ # callback.
+ #
+ # The methods for callbacks#match , callbacks#discard_a , and
+ # callbacks#discard_b are invoked with an event comprising the
+ # action ("=", "+", or "-", respectively), the indexes +i+ and +j+, and the
+ # elements A[i] and B[j] . Return values are discarded by
+ # #traverse_sequences.
+ #
+ # === End of Sequences
+ #
+ # If arrow +a+ reaches the end of its sequence before arrow +b+ does,
+ # #traverse_sequence will try to call callbacks#finished_a with the
+ # last index and element of +A+ (A[-1] ) and the current index and
+ # element of +B+ (B[j] ). If callbacks#finished_a does not
+ # exist, then callbacks#discard_b will be called on each element of
+ # +B+ until the end of the sequence is reached (the call will be done with
+ # A[-1] and B[j] for each element).
+ #
+ # If +b+ reaches the end of +B+ before +a+ reaches the end of +A+,
+ # callbacks#finished_b will be called with the current index and
+ # element of +A+ (A[i] ) and the last index and element of +B+
+ # (A[-1] ). Again, if callbacks#finished_b does not exist on
+ # the callback object, then callbacks#discard_a will be called on
+ # each element of +A+ until the end of the sequence is reached (A[i]
+ # and B[-1] ).
+ #
+ # There is a chance that one additional callbacks#discard_a or
+ # callbacks#discard_b will be called after the end of the sequence
+ # is reached, if +a+ has not yet reached the end of +A+ or +b+ has not yet
+ # reached the end of +B+.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:286
+ def traverse_sequences(seq1, seq2, callbacks = T.unsafe(nil)); end
+
+ # Given a set of patchset, convert the current version to the prior version.
+ # Does no auto-discovery.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs.rb:731
+ def unpatch!(src, patchset); end
+
+ private
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:4
+ def diff_traversal(method, seq1, seq2, callbacks, &block); end
+ end
+end
+
+# An alias for DefaultCallbacks that is used in
+# Diff::LCS#traverse_balanced.
+#
+# Diff::LCS.LCS(seq1, seq2, Diff::LCS::BalancedCallbacks)
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:50
+Diff::LCS::BalancedCallbacks = Diff::LCS::DefaultCallbacks
+
+# A block is an operation removing, adding, or changing a group of items.
+# Basically, this is just a list of changes, where each change adds or
+# deletes a single item. Used by bin/ldiff.
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/block.rb:6
+class Diff::LCS::Block
+ # pkg:gem/diff-lcs#lib/diff/lcs/block.rb:9
+ def initialize(chunk); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/block.rb:7
+ def changes; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/block.rb:21
+ def diff_size; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/block.rb:7
+ def insert; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/block.rb:25
+ def op; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/block.rb:7
+ def remove; end
+end
+
+# Represents a simplistic (non-contextual) change. Represents the removal or
+# addition of an element from either the old or the new sequenced
+# enumerable.
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/change.rb:6
+class Diff::LCS::Change
+ include ::Comparable
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:27
+ def initialize(*args); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:65
+ def <=>(other); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:58
+ def ==(other); end
+
+ # Returns the action this Change represents.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:20
+ def action; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:72
+ def adding?; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:84
+ def changed?; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:76
+ def deleting?; end
+
+ # Returns the sequence element of the Change.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:25
+ def element; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:88
+ def finished_a?; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:92
+ def finished_b?; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:34
+ def inspect(*_args); end
+
+ # Returns the position of the Change.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:23
+ def position; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:38
+ def to_a; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:42
+ def to_ary; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:80
+ def unchanged?; end
+
+ class << self
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:44
+ def from_a(arr); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:15
+ def valid_action?(action); end
+ end
+end
+
+# pkg:gem/diff-lcs#lib/diff/lcs/change.rb:7
+Diff::LCS::Change::IntClass = Integer
+
+# The only actions valid for changes are '+' (add), '-' (delete), '='
+# (no change), '!' (changed), '<' (tail changes from first sequence), or
+# '>' (tail changes from second sequence). The last two ('<>') are only
+# found with Diff::LCS::diff and Diff::LCS::sdiff.
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/change.rb:13
+Diff::LCS::Change::VALID_ACTIONS = T.let(T.unsafe(nil), Array)
+
+# Represents a contextual change. Contains the position and values of the
+# elements in the old and the new sequenced enumerables as well as the action
+# taken.
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/change.rb:100
+class Diff::LCS::ContextChange < ::Diff::LCS::Change
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:114
+ def initialize(*args); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:166
+ def <=>(other); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:157
+ def ==(other); end
+
+ # Returns the new element being changed.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:112
+ def new_element; end
+
+ # Returns the new position being changed.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:108
+ def new_position; end
+
+ # Returns the old element being changed.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:110
+ def old_element; end
+
+ # Returns the old position being changed.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:106
+ def old_position; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:122
+ def to_a; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:130
+ def to_ary; end
+
+ class << self
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:132
+ def from_a(arr); end
+
+ # Simplifies a context change for use in some diff callbacks. '<' actions
+ # are converted to '-' and '>' actions are converted to '+'.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/change.rb:138
+ def simplify(event); end
+ end
+end
+
+# This will produce a compound array of contextual diff change objects. Each
+# element in the #diffs array is a "hunk" array, where each element in each
+# "hunk" array is a single change. Each change is a Diff::LCS::ContextChange
+# that contains both the old index and new index values for the change. The
+# "hunk" provides the full context for the changes. Both old and new objects
+# will be presented for changed objects. +nil+ will be substituted for a
+# discarded object.
+#
+# seq1 = %w(a b c e h j l m n p)
+# seq2 = %w(b c d e f j k l m r s t)
+#
+# diffs = Diff::LCS.diff(seq1, seq2, Diff::LCS::ContextDiffCallbacks)
+# # This example shows a simplified array format.
+# # [ [ [ '-', [ 0, 'a' ], [ 0, nil ] ] ], # 1
+# # [ [ '+', [ 3, nil ], [ 2, 'd' ] ] ], # 2
+# # [ [ '-', [ 4, 'h' ], [ 4, nil ] ], # 3
+# # [ '+', [ 5, nil ], [ 4, 'f' ] ] ],
+# # [ [ '+', [ 6, nil ], [ 6, 'k' ] ] ], # 4
+# # [ [ '-', [ 8, 'n' ], [ 9, nil ] ], # 5
+# # [ '+', [ 9, nil ], [ 9, 'r' ] ],
+# # [ '-', [ 9, 'p' ], [ 10, nil ] ],
+# # [ '+', [ 10, nil ], [ 10, 's' ] ],
+# # [ '+', [ 10, nil ], [ 11, 't' ] ] ] ]
+#
+# The five hunks shown are comprised of individual changes; if there is a
+# related set of changes, they are still shown individually.
+#
+# This callback can also be used with Diff::LCS#sdiff, which will produce
+# results like:
+#
+# diffs = Diff::LCS.sdiff(seq1, seq2, Diff::LCS::ContextCallbacks)
+# # This example shows a simplified array format.
+# # [ [ [ "-", [ 0, "a" ], [ 0, nil ] ] ], # 1
+# # [ [ "+", [ 3, nil ], [ 2, "d" ] ] ], # 2
+# # [ [ "!", [ 4, "h" ], [ 4, "f" ] ] ], # 3
+# # [ [ "+", [ 6, nil ], [ 6, "k" ] ] ], # 4
+# # [ [ "!", [ 8, "n" ], [ 9, "r" ] ], # 5
+# # [ "!", [ 9, "p" ], [ 10, "s" ] ],
+# # [ "+", [ 10, nil ], [ 11, "t" ] ] ] ]
+#
+# The five hunks are still present, but are significantly shorter in total
+# presentation, because changed items are shown as changes ("!") instead of
+# potentially "mismatched" pairs of additions and deletions.
+#
+# The result of this operation is similar to that of
+# Diff::LCS::SDiffCallbacks. They may be compared as:
+#
+# s = Diff::LCS.sdiff(seq1, seq2).reject { |e| e.action == "=" }
+# c = Diff::LCS.sdiff(seq1, seq2, Diff::LCS::ContextDiffCallbacks).flatten(1)
+#
+# s == c # -> true
+#
+# === Use
+#
+# This callback object must be initialised and can be used by the
+# Diff::LCS#diff or Diff::LCS#sdiff methods.
+#
+# cbo = Diff::LCS::ContextDiffCallbacks.new
+# Diff::LCS.LCS(seq1, seq2, cbo)
+# cbo.finish
+#
+# Note that the call to #finish is absolutely necessary, or the last set of
+# changes will not be visible. Alternatively, can be used as:
+#
+# cbo = Diff::LCS::ContextDiffCallbacks.new { |tcbo| Diff::LCS.LCS(seq1, seq2, tcbo) }
+#
+# The necessary #finish call will be made.
+#
+# === Simplified Array Format
+#
+# The simplified array format used in the example above can be obtained
+# with:
+#
+# require 'pp'
+# pp diffs.map { |e| e.map { |f| f.to_a } }
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:225
+class Diff::LCS::ContextDiffCallbacks < ::Diff::LCS::DiffCallbacks
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:234
+ def change(event); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:226
+ def discard_a(event); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:230
+ def discard_b(event); end
+end
+
+# This callback object implements the default set of callback events,
+# which only returns the event itself. Note that #finished_a and
+# #finished_b are not implemented -- I haven't yet figured out where they
+# would be useful.
+#
+# Note that this is intended to be called as is, e.g.,
+#
+# Diff::LCS.LCS(seq1, seq2, Diff::LCS::DefaultCallbacks)
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:14
+class Diff::LCS::DefaultCallbacks
+ class << self
+ # Called when both the old and new values have changed.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:32
+ def change(event); end
+
+ # Called when the old value is discarded in favour of the new value.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:22
+ def discard_a(event); end
+
+ # Called when the new value is discarded in favour of the old value.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:27
+ def discard_b(event); end
+
+ # Called when two items match.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:17
+ def match(event); end
+
+ private
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:36
+ def new(*_arg0); end
+ end
+end
+
+# This will produce a compound array of simple diff change objects. Each
+# element in the #diffs array is a +hunk+ or +hunk+ array, where each
+# element in each +hunk+ array is a single Change object representing the
+# addition or removal of a single element from one of the two tested
+# sequences. The +hunk+ provides the full context for the changes.
+#
+# diffs = Diff::LCS.diff(seq1, seq2)
+# # This example shows a simplified array format.
+# # [ [ [ '-', 0, 'a' ] ], # 1
+# # [ [ '+', 2, 'd' ] ], # 2
+# # [ [ '-', 4, 'h' ], # 3
+# # [ '+', 4, 'f' ] ],
+# # [ [ '+', 6, 'k' ] ], # 4
+# # [ [ '-', 8, 'n' ], # 5
+# # [ '-', 9, 'p' ],
+# # [ '+', 9, 'r' ],
+# # [ '+', 10, 's' ],
+# # [ '+', 11, 't' ] ] ]
+#
+# There are five hunks here. The first hunk says that the +a+ at position 0
+# of the first sequence should be deleted ('-' ). The second hunk
+# says that the +d+ at position 2 of the second sequence should be inserted
+# ('+' ). The third hunk says that the +h+ at position 4 of the
+# first sequence should be removed and replaced with the +f+ from position 4
+# of the second sequence. The other two hunks are described similarly.
+#
+# === Use
+#
+# This callback object must be initialised and is used by the Diff::LCS#diff
+# method.
+#
+# cbo = Diff::LCS::DiffCallbacks.new
+# Diff::LCS.LCS(seq1, seq2, cbo)
+# cbo.finish
+#
+# Note that the call to #finish is absolutely necessary, or the last set of
+# changes will not be visible. Alternatively, can be used as:
+#
+# cbo = Diff::LCS::DiffCallbacks.new { |tcbo| Diff::LCS.LCS(seq1, seq2, tcbo) }
+#
+# The necessary #finish call will be made.
+#
+# === Simplified Array Format
+#
+# The simplified array format used in the example above can be obtained
+# with:
+#
+# require 'pp'
+# pp diffs.map { |e| e.map { |f| f.to_a } }
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:108
+class Diff::LCS::DiffCallbacks
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:112
+ def initialize; end
+
+ # Returns the difference set collected during the diff process.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:110
+ def diffs; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:135
+ def discard_a(event); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:139
+ def discard_b(event); end
+
+ # Finalizes the diff process. If an unprocessed hunk still exists, then it
+ # is appended to the diff list.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:127
+ def finish; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:131
+ def match(_event); end
+
+ private
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:143
+ def finish_hunk; end
+end
+
+# A Hunk is a group of Blocks which overlap because of the context surrounding
+# each block. (So if we're not using context, every hunk will contain one
+# block.) Used in the diff program (bin/ldiff).
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:8
+class Diff::LCS::Hunk
+ # Create a hunk using references to both the old and new data, as well as the
+ # piece of data.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:16
+ def initialize(data_old, data_new, piece, flag_context, file_length_difference); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:64
+ def blocks; end
+
+ # Returns a diff string based on a format.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:115
+ def diff(format, last = T.unsafe(nil)); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:66
+ def end_new; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:66
+ def end_old; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:67
+ def file_length_difference; end
+
+ # Change the "start" and "end" fields to note that context should be added
+ # to this hunk.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:71
+ def flag_context; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:71
+ def flag_context=(context); end
+
+ # Merges this hunk and the provided hunk together if they overlap. Returns
+ # a truthy value so that if there is no overlap, you can know the merge
+ # was skipped.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:97
+ def merge(hunk); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:347
+ def missing_last_newline?(data); end
+
+ # Determines whether there is an overlap between this hunk and the
+ # provided hunk. This will be true if the difference between the two hunks
+ # start or end positions is within one position of each other.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:109
+ def overlaps?(hunk); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:65
+ def start_new; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:65
+ def start_old; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:104
+ def unshift(hunk); end
+
+ private
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:222
+ def context_diff(last = T.unsafe(nil)); end
+
+ # Generate a range of item numbers to print. Only print 1 number if the
+ # range has only one item in it. Otherwise, it's 'start,end'
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:316
+ def context_range(mode, op); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:284
+ def ed_diff(format, last); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:360
+ def encode(literal, target_encoding = T.unsafe(nil)); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:364
+ def encode_as(string, *args); end
+
+ # Note that an old diff can't have any context. Therefore, we know that
+ # there's only one block in the hunk.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:134
+ def old_diff(last = T.unsafe(nil)); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:167
+ def unified_diff(last = T.unsafe(nil)); end
+
+ # Generate a range of item numbers to print for unified diff. Print number
+ # where block starts, followed by number of lines in the block
+ # (don't print number of lines if it's 1)
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:331
+ def unified_range(mode); end
+end
+
+# pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:10
+Diff::LCS::Hunk::ED_DIFF_OP_ACTION = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/diff-lcs#lib/diff/lcs/hunk.rb:9
+Diff::LCS::Hunk::OLD_DIFF_OP_ACTION = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:29
+module Diff::LCS::Internals
+ class << self
+ # This method will analyze the provided patchset to provide a single-pass
+ # normalization (conversion of the array form of Diff::LCS::Change objects to
+ # the object form of same) and detection of whether the patchset represents
+ # changes to be made.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:102
+ def analyze_patchset(patchset, depth = T.unsafe(nil)); end
+
+ # Examine the patchset and the source to see in which direction the
+ # patch should be applied.
+ #
+ # WARNING: By default, this examines the whole patch, so this could take
+ # some time. This also works better with Diff::LCS::ContextChange or
+ # Diff::LCS::Change as its source, as an array will cause the creation
+ # of one of the above.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:147
+ def intuit_diff_direction(src, patchset, limit = T.unsafe(nil)); end
+
+ # Compute the longest common subsequence between the sequenced
+ # Enumerables +a+ and +b+. The result is an array whose contents is such
+ # that
+ #
+ # result = Diff::LCS::Internals.lcs(a, b)
+ # result.each_with_index do |e, i|
+ # assert_equal(a[i], b[e]) unless e.nil?
+ # end
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:41
+ def lcs(a, b); end
+
+ private
+
+ # If +vector+ maps the matching elements of another collection onto this
+ # Enumerable, compute the inverse of +vector+ that maps this Enumerable
+ # onto the collection. (Currently unused.)
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:286
+ def inverse_vector(a, vector); end
+
+ # Returns a hash mapping each element of an Enumerable to the set of
+ # positions it occupies in the Enumerable, optionally restricted to the
+ # elements specified in the range of indexes specified by +interval+.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:298
+ def position_hash(enum, interval); end
+
+ # Find the place at which +value+ would normally be inserted into the
+ # Enumerable. If that place is already occupied by +value+, do nothing
+ # and return +nil+. If the place does not exist (i.e., it is off the end
+ # of the Enumerable), add it to the end. Otherwise, replace the element
+ # at that point with +value+. It is assumed that the Enumerable's values
+ # are numeric.
+ #
+ # This operation preserves the sort order.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/internals.rb:252
+ def replace_next_larger(enum, value, last_index = T.unsafe(nil)); end
+ end
+end
+
+# This will produce a simple array of diff change objects. Each element in
+# the #diffs array is a single ContextChange. In the set of #diffs provided
+# by SDiffCallbacks, both old and new objects will be presented for both
+# changed and unchanged objects. +nil+ will be substituted
+# for a discarded object.
+#
+# The diffset produced by this callback, when provided to Diff::LCS#sdiff,
+# will compute and display the necessary components to show two sequences
+# and their minimized differences side by side, just like the Unix utility
+# +sdiff+.
+#
+# same same
+# before | after
+# old < -
+# - > new
+#
+# seq1 = %w(a b c e h j l m n p)
+# seq2 = %w(b c d e f j k l m r s t)
+#
+# diffs = Diff::LCS.sdiff(seq1, seq2)
+# # This example shows a simplified array format.
+# # [ [ "-", [ 0, "a"], [ 0, nil ] ],
+# # [ "=", [ 1, "b"], [ 0, "b" ] ],
+# # [ "=", [ 2, "c"], [ 1, "c" ] ],
+# # [ "+", [ 3, nil], [ 2, "d" ] ],
+# # [ "=", [ 3, "e"], [ 3, "e" ] ],
+# # [ "!", [ 4, "h"], [ 4, "f" ] ],
+# # [ "=", [ 5, "j"], [ 5, "j" ] ],
+# # [ "+", [ 6, nil], [ 6, "k" ] ],
+# # [ "=", [ 6, "l"], [ 7, "l" ] ],
+# # [ "=", [ 7, "m"], [ 8, "m" ] ],
+# # [ "!", [ 8, "n"], [ 9, "r" ] ],
+# # [ "!", [ 9, "p"], [ 10, "s" ] ],
+# # [ "+", [ 10, nil], [ 11, "t" ] ] ]
+#
+# The result of this operation is similar to that of
+# Diff::LCS::ContextDiffCallbacks. They may be compared as:
+#
+# s = Diff::LCS.sdiff(seq1, seq2).reject { |e| e.action == "=" }
+# c = Diff::LCS.sdiff(seq1, seq2, Diff::LCS::ContextDiffCallbacks).flatten(1)
+#
+# s == c # -> true
+#
+# === Use
+#
+# This callback object must be initialised and is used by the Diff::LCS#sdiff
+# method.
+#
+# cbo = Diff::LCS::SDiffCallbacks.new
+# Diff::LCS.LCS(seq1, seq2, cbo)
+#
+# As with the other initialisable callback objects,
+# Diff::LCS::SDiffCallbacks can be initialised with a block. As there is no
+# "fininishing" to be done, this has no effect on the state of the object.
+#
+# cbo = Diff::LCS::SDiffCallbacks.new { |tcbo| Diff::LCS.LCS(seq1, seq2, tcbo) }
+#
+# === Simplified Array Format
+#
+# The simplified array format used in the example above can be obtained
+# with:
+#
+# require 'pp'
+# pp diffs.map { |e| e.to_a }
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:303
+class Diff::LCS::SDiffCallbacks
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:307
+ def initialize; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:324
+ def change(event); end
+
+ # Returns the difference set collected during the diff process.
+ #
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:305
+ def diffs; end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:316
+ def discard_a(event); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:320
+ def discard_b(event); end
+
+ # pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:312
+ def match(event); end
+end
+
+# An alias for DefaultCallbacks that is used in
+# Diff::LCS#traverse_sequences.
+#
+# Diff::LCS.LCS(seq1, seq2, Diff::LCS::SequenceCallbacks)
+#
+# pkg:gem/diff-lcs#lib/diff/lcs/callbacks.rb:44
+Diff::LCS::SequenceCallbacks = Diff::LCS::DefaultCallbacks
+
+# pkg:gem/diff-lcs#lib/diff/lcs/version.rb:5
+Diff::LCS::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/dogapi@1.45.0.rbi b/sorbet/rbi/gems/dogapi@1.45.0.rbi
index 8cf465a..dc72aaf 100644
--- a/sorbet/rbi/gems/dogapi@1.45.0.rbi
+++ b/sorbet/rbi/gems/dogapi@1.45.0.rbi
@@ -1,551 +1,2075 @@
-# DO NOT EDIT MANUALLY
-# This is an autogenerated file for types exported from the `dogapi` gem.
-# Please instead update this file by running `bin/tapioca sync`.
-
# typed: true
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `dogapi` gem.
+# Please instead update this file by running `bin/tapioca gem dogapi`.
+
+
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+# Unless explicitly stated otherwise all files in this repository are licensed under the BSD-3-Clause License.
+# This product includes software developed at Datadog (https://www.datadoghq.com/).
+# Copyright 2011-Present Datadog, Inc.
+#
+# pkg:gem/dogapi#lib/dogapi/version.rb:5
module Dogapi
class << self
+ # pkg:gem/dogapi#lib/dogapi/common.rb:208
def find_datadog_host; end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:216
def find_localhost; end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:230
def find_proxy; end
+
+ # Very simplified hash with indifferent access - access to string or symbol
+ # keys via symbols. E.g.:
+ # my_hash = { 'foo' => 1 }
+ # Dogapi.symbolized_access(my_hash)
+ # my_hash[:foo] # => 1
+ #
+ # pkg:gem/dogapi#lib/dogapi/common.rb:250
def symbolized_access(hash); end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:236
def validate_tags(tags); end
end
end
+# Superclass that deals with the details of communicating with the DataDog API
+#
+# pkg:gem/dogapi#lib/dogapi/common.rb:87
class Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/common.rb:89
def initialize(api_key, application_key, silent = T.unsafe(nil), timeout = T.unsafe(nil), endpoint = T.unsafe(nil), skip_ssl_validation = T.unsafe(nil)); end
+ # pkg:gem/dogapi#lib/dogapi/common.rb:88
def api_key; end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:88
def application_key; end
+
+ # Manages the HTTP connection
+ #
+ # pkg:gem/dogapi#lib/dogapi/common.rb:99
def connect; end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:198
def handle_redirect(conn, req, resp, retries = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:185
def handle_response(resp); end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:167
def prepare_params(extra_params, url, with_app_key); end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:152
def prepare_request(method, url, params, body, send_json, with_app_key); end
+
+ # Prepares the request and handles the response
+ #
+ # +method+ is an implementation of Net::HTTP::Request (e.g. Net::HTTP::Post)
+ #
+ # +params+ is a Hash that will be converted to request parameters
+ #
+ # pkg:gem/dogapi#lib/dogapi/common.rb:135
def request(method, url, extra_params, body, send_json, with_app_key = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:180
def should_set_api_and_app_keys_in_params?(url); end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:123
def suppress_error_if_silent(e); end
end
+# A simple DogAPI client
+#
+# See Dogapi::V1 for the thick underlying clients
+#
+# Class methods return a tuple of (+response_code+, +response_body+). Unless
+# otherwise noted, the response body is deserialized JSON. Up-to-date
+# information about the JSON object structure is available in the HTTP API
+# documentation, here[https://github.com/DataDog/dogapi/wiki].
+#
+# pkg:gem/dogapi#lib/dogapi/facade.rb:62
class Dogapi::Client
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:68
def initialize(api_key, application_key = T.unsafe(nil), host = T.unsafe(nil), device = T.unsafe(nil), silent = T.unsafe(nil), timeout = T.unsafe(nil), endpoint = T.unsafe(nil), skip_ssl_validation = T.unsafe(nil)); end
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:406
def add_items_to_dashboard_list(dashboard_list_id, dashboards); end
+
+ # Add the tags to the given host
+ #
+ # +host_id+ can be the host's numeric id or string name
+ #
+ # +tags+ is and Array of Strings
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:298
def add_tags(host_id, tags, source = T.unsafe(nil)); end
+
+ # ALERTS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:426
def alert(query, options = T.unsafe(nil)); end
+
+ # Get all tags and their associated hosts at your org
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:282
def all_tags(source = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:818
def aws_integration_create(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:822
def aws_integration_delete(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:830
def aws_integration_generate_external_id(config); end
+
+ # AWS INTEGRATION
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:814
def aws_integration_list; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:826
def aws_integration_list_namespaces; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:834
def aws_integration_update(config, new_config); end
+
+ # AWS Logs Integration
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:842
def aws_logs_add_lambda(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:862
def aws_logs_check_lambda(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:866
def aws_logs_check_services(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:858
def aws_logs_integration_delete(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:854
def aws_logs_integrations_list; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:846
def aws_logs_list_services; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:850
def aws_logs_save_services(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:878
def azure_integration_create(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:882
def azure_integration_delete(config); end
+
+ # AZURE INTEGRATION
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:874
def azure_integration_list; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:890
def azure_integration_update(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:886
def azure_integration_update_host_filters(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:176
def batch_metrics; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:597
def can_delete_monitors(monitor_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:705
def can_delete_service_level_objective(slo_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:657
def cancel_downtime(downtime_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:661
def cancel_downtime_by_scope(scope); end
+
+ # Post a comment
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:254
def comment(message, options = T.unsafe(nil)); end
+
+ # Create a dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:358
def create_board(title, widgets, layout_type, options = T.unsafe(nil)); end
+
+ # Create a dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:329
def create_dashboard(title, description, graphs, template_variables = T.unsafe(nil), read_only = T.unsafe(nil)); end
+
+ # DASHBOARD LISTS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:386
def create_dashboard_list(name); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:495
def create_embed(graph_json, description = T.unsafe(nil)); end
+
+ # INTEGRATIONS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:795
def create_integration(source_type_name, config); end
+
+ # LOGS PIPELINES
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:725
def create_logs_pipeline(name, filter, options = T.unsafe(nil)); end
+
+ # SCREENBOARD
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:510
def create_screenboard(description); end
+
+ # SERVICE LEVEL OBJECTIVES
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:685
def create_service_level_objective(type, slo_name, thresholds, options = T.unsafe(nil)); end
+
+ # SYNTHETICS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:541
def create_synthetics_test(type, config, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:459
def create_user(description = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:63
def datadog_host; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:63
def datadog_host=(_arg0); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:438
def delete_alert(alert_id); end
+
+ # Delete the given dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:378
def delete_board(dashboard_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:263
def delete_comment(comment_id); end
+
+ # Delete the given dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:349
def delete_dashboard(dash_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:402
def delete_dashboard_list(dashboard_list_id); end
+
+ # Delete an event
+ #
+ # +id+ of the event to delete
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:217
def delete_event(id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:807
def delete_integration(source_type_name); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:414
def delete_items_from_dashboard_list(dashboard_list_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:741
def delete_logs_pipeline(pipeline_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:713
def delete_many_service_level_objective(slo_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:601
def delete_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:526
def delete_screenboard(board_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:709
def delete_service_level_objective(slo_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:549
def delete_synthetics_tests(test_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:717
def delete_timeframes_service_level_objective(ops); end
+
+ # Remove all tags from the given host
+ #
+ # +host_id+ can be the host's numeric id or string name
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:320
def detach_tags(host_id, source = T.unsafe(nil)); end
+
+ # DEPRECATED: Spelling mistake temporarily preserved as an alias.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:312
def detatch_tags(host_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:475
def disable_user(handle); end
+
+ # Record an event
+ #
+ # Optional arguments:
+ # :host => String
+ # :device => String
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:201
def emit_event(event, options = T.unsafe(nil)); end
+
+ # Record a single point of metric data
+ #
+ # Optional arguments:
+ # :timestamp => Ruby stdlib Time
+ # :host => String
+ # :device => String
+ # :options => Map
+ #
+ # options[:type] = "count" to specify a counter metric
+ # options[:tags] = ["tag1", "tag2"] to tag the point
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:132
def emit_point(metric, value, options = T.unsafe(nil)); end
+
+ # Record a set of points of metric data
+ #
+ # +points+ is an array of [Time, value] doubles
+ #
+ # Optional arguments:
+ # :host => String
+ # :device => String
+ # :options => Map
+ #
+ # options[:type] = "count" to specify a counter metric
+ # options[:tags] = ["tag1", "tag2"] to tag the point
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:154
def emit_points(metric, points, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:499
def enable_embed(embed_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:905
def gcp_integration_create(config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:901
def gcp_integration_delete(config); end
+
+ # GCP INTEGRATION
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:897
def gcp_integration_list; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:909
def gcp_integration_update(config); end
+
+ # Get a list of active metrics since a given time
+ # +from+ The seconds since the unix epoch [Time, Integer]
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:189
def get_active_metrics(from); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:434
def get_alert(alert_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:442
def get_all_alerts; end
+
+ # Fetch all dashboards.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:373
def get_all_boards; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:398
def get_all_dashboard_lists; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:665
def get_all_downtimes(options = T.unsafe(nil)); end
+
+ # EMBEDS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:487
def get_all_embeds; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:733
def get_all_logs_pipelines; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:605
def get_all_monitors(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:522
def get_all_screenboards; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:557
def get_all_synthetics_tests; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:463
def get_all_users; end
+
+ # Fetch the given dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:368
def get_board(dashboard_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:932
def get_custom_metrics_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Fetch the given dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:339
def get_dashboard(dash_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:394
def get_dashboard_list(dashboard_list_id); end
+
+ # Fetch all of the dashboards.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:344
def get_dashboards; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:653
def get_downtime(downtime_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:491
def get_embed(embed_id, description = T.unsafe(nil)); end
+
+ # Get the details of an event
+ #
+ # +id+ of the event to get
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:210
def get_event(id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:944
def get_fargate_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Get hourly usage information for different datadog service
+ # Usage data is delayed by up to 72 hours from when it was incurred. It is retained for the past 15 months.#
+ # format of dates is ISO-8601 UTC YYYY-MM-DDThh
+ # ex:
+ # require 'time'
+ # Time.now.utc.strftime('%Y-%m-%dT%H')
+ # => "2019-05-05T13"
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:924
def get_hosts_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:803
def get_integration(source_type_name); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:418
def get_items_of_dashboard_list(dashboard_list_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:729
def get_logs_pipeline(pipeline_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:928
def get_logs_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Get metadata information on an existing Datadog metric
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:758
def get_metadata(metric); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:593
def get_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # Get a set of points by query between from and to
+ #
+ # +from+ The seconds since the unix epoch [Time, Integer]
+ # +to+ The seconds since the unix epoch [Time, Integer]
+ # +query+ The query string [String]
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:172
def get_points(query, from, to); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:518
def get_screenboard(board_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:693
def get_service_level_objective(slo_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:697
def get_service_level_objective_history(slo_id, from_ts, to_ts); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:573
def get_synthetics_devices; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:577
def get_synthetics_locations; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:569
def get_synthetics_result(test_id, result_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:565
def get_synthetics_results(test_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:561
def get_synthetics_test(test_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:940
def get_synthetics_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:936
def get_traces_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:467
def get_user(handle); end
+
+ # Graph snapshot
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:480
def graph_snapshot(metric_query, start_ts, end_ts, event_query = T.unsafe(nil)); end
+
+ # Get all tags for the given host
+ #
+ # +host_id+ can be the host's numeric id or string name
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:289
def host_tags(host_id, source = T.unsafe(nil), by_source = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:787
def host_totals; end
+
+ # User invite
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:455
def invite(emails, options = T.unsafe(nil)); end
+
+ # MONITORS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:585
def monitor(type, query, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:446
def mute_alerts; end
+
+ # HOST MUTING
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:673
def mute_host(hostname, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:621
def mute_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:613
def mute_monitors; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:629
def resolve_monitors(monitor_groups = T.unsafe(nil), options = T.unsafe(nil), version = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:503
def revoke_embed(embed_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:534
def revoke_screenboard(board_id); end
+
+ # MONITOR DOWNTIME
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:645
def schedule_downtime(scope, options = T.unsafe(nil)); end
+
+ # Run the given search query.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:272
def search(query); end
+
+ # HOSTS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:783
def search_hosts(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:637
def search_monitor_groups(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:633
def search_monitors(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:701
def search_service_level_objective(slo_ids = T.unsafe(nil), query = T.unsafe(nil), offset = T.unsafe(nil), limit = T.unsafe(nil)); end
+
+ # SERVICE CHECKS
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:749
def service_check(check, host, status, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:530
def share_screenboard(board_id); end
+
+ # DEPRECATED: Recording events with a duration has been deprecated.
+ # The functionality will be removed in a later release.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:237
def start_event(event, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:553
def start_pause_synthetics_test(test_id, new_status); end
+
+ # Get an optionally filtered event stream
+ #
+ # +start+ is a Time object for when to start the stream
+ #
+ # +stop+ is a Time object for when to end the stream
+ #
+ # Optional arguments:
+ # :priority => "normal" or "low"
+ # :sources => String, see https://github.com/DataDog/dogapi/wiki/Event for a current list of sources
+ # :tags => Array of Strings
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:231
def stream(start, stop, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:450
def unmute_alerts; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:677
def unmute_host(hostname); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:625
def unmute_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:617
def unmute_monitors; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:430
def update_alert(alert_id, query, options = T.unsafe(nil)); end
+
+ # Update a dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:363
def update_board(dashboard_id, title, widgets, layout_type, options = T.unsafe(nil)); end
+
+ # Post a comment
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:259
def update_comment(comment_id, options = T.unsafe(nil)); end
+
+ # Update a dashboard.
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:334
def update_dashboard(dash_id, title, description, graphs, template_variables = T.unsafe(nil), read_only = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:390
def update_dashboard_list(dashboard_list_id, name); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:649
def update_downtime(downtime_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:799
def update_integration(source_type_name, config); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:410
def update_items_of_dashboard_list(dashboard_list_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:737
def update_logs_pipeline(pipeline_id, name, filter, options = T.unsafe(nil)); end
+
+ # Update metadata fields for an existing Datadog metric.
+ # If the metadata does not exist for the metric it is created by
+ # the update.
+ # Optional arguments:
+ # :type => String, type of the metric (ex. "gauge", "rate", etc.)
+ # see http://docs.datadoghq.com/metrictypes/
+ # :description => String, description of the metric
+ # :short_name => String, short name of the metric
+ # :unit => String, unit type associated with the metric (ex. "byte", "operation")
+ # see http://docs.datadoghq.com/units/ for full list
+ # :per_unit => String, per unit type (ex. "second" as in "queries per second")
+ # see http://docs.datadoghq.com/units/ for full
+ # :statsd_interval => Integer, statsd flush interval for metric in seconds (if applicable)
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:775
def update_metadata(metric, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:589
def update_monitor(monitor_id, query, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:514
def update_screenboard(board_id, description); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:689
def update_service_level_objective(slo_id, type, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:545
def update_synthetics_test(test_id, type, config, options = T.unsafe(nil)); end
+
+ # Replace the tags on the given host
+ #
+ # +host_id+ can be the host's numeric id or string name
+ #
+ # +tags+ is and Array of Strings
+ #
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:307
def update_tags(host_id, tags, source = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:471
def update_user(handle, description = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:64
def v2; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:64
def v2=(_arg0); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:609
def validate_monitor(type, query, options = T.unsafe(nil)); end
private
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:950
def override_scope(options = T.unsafe(nil)); end
end
+# A simple DogAPI client supporting the version 2.
+#
+# See Dogapi::V2 for the thick underlying clients
+#
+# pkg:gem/dogapi#lib/dogapi/facade.rb:14
class Dogapi::ClientV2
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:16
def initialize(api_key, application_key = T.unsafe(nil), host = T.unsafe(nil), device = T.unsafe(nil), silent = T.unsafe(nil), timeout = T.unsafe(nil), endpoint = T.unsafe(nil), skip_ssl_validation = T.unsafe(nil)); end
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:36
def add_items_to_dashboard_list(dashboard_list_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:15
def datadog_host; end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:15
def datadog_host=(_arg0); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:44
def delete_items_from_dashboard_list(dashboard_list_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:48
def get_items_of_dashboard_list(dashboard_list_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/facade.rb:40
def update_items_of_dashboard_list(dashboard_list_id, dashboards); end
end
+# Metadata class for storing the details of an event
+#
+# pkg:gem/dogapi#lib/dogapi/event.rb:13
class Dogapi::Event
+ # Optional arguments:
+ # :date_happened => time in seconds since the epoch (defaults to now)
+ # :msg_title => String
+ # :priority => String
+ # :parent => event ID (integer)
+ # :tags => array of Strings
+ # :event_object => String
+ # :alert_type => 'success', 'error'
+ # :event_type => String
+ # :source_type_name => String
+ # :aggregation_key => String
+ #
+ # pkg:gem/dogapi#lib/dogapi/event.rb:33
def initialize(msg_text, options = T.unsafe(nil)); end
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def aggregation_key; end
+
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def date_happened; end
+
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def msg_text; end
+
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def msg_title; end
+
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def parent; end
+
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def priority; end
+
+ # pkg:gem/dogapi#lib/dogapi/event.rb:14
def tags; end
+
+ # Copy and pasted from the internets
+ # http://stackoverflow.com/a/5031637/25276
+ #
+ # pkg:gem/dogapi#lib/dogapi/event.rb:58
def to_hash; end
end
+# DEPRECATED: Going forward, use the V1 services. This legacy service will be
+# removed in an upcoming release.
+#
+# pkg:gem/dogapi#lib/dogapi/event.rb:67
class Dogapi::EventService < ::Dogapi::Service
+ # DEPRECATED: Going forward, use the V1 services. This legacy service will be
+ # removed in an upcoming release.
+ #
+ # pkg:gem/dogapi#lib/dogapi/event.rb:105
def start(api_key, event, scope, source_type = T.unsafe(nil)); end
+
+ # DEPRECATED: Going forward, use the V1 services. This legacy service will be
+ # removed in an upcoming release.
+ #
+ # pkg:gem/dogapi#lib/dogapi/event.rb:75
def submit(api_key, event, scope = T.unsafe(nil), source_type = T.unsafe(nil)); end
private
+ # pkg:gem/dogapi#lib/dogapi/event.rb:124
def finish(api_key, event_id, successful = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/event.rb:69
Dogapi::EventService::API_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/event.rb:70
Dogapi::EventService::MAX_BODY_LENGTH = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/dogapi#lib/dogapi/event.rb:71
Dogapi::EventService::MAX_TITLE_LENGTH = T.let(T.unsafe(nil), Integer)
+# DEPRECATED: Going forward, use the V1 services. This legacy service will be
+# removed in an upcoming release.
+#
+# pkg:gem/dogapi#lib/dogapi/metric.rb:14
class Dogapi::MetricService < ::Dogapi::Service
+ # DEPRECATED: Going forward, use the V1 services. This legacy service will be
+ # removed in an upcoming release.
+ #
+ # pkg:gem/dogapi#lib/dogapi/metric.rb:20
def submit(api_key, scope, metric, points); end
end
+# pkg:gem/dogapi#lib/dogapi/metric.rb:16
Dogapi::MetricService::API_VERSION = T.let(T.unsafe(nil), String)
+# Metadata class to hold the scope of an API call
+#
+# pkg:gem/dogapi#lib/dogapi/common.rb:29
class Dogapi::Scope
+ # pkg:gem/dogapi#lib/dogapi/common.rb:31
def initialize(host = T.unsafe(nil), device = T.unsafe(nil)); end
+ # pkg:gem/dogapi#lib/dogapi/common.rb:30
def device; end
+
+ # pkg:gem/dogapi#lib/dogapi/common.rb:30
def host; end
end
+# DEPRECATED: Going forward, use the newer APIService.
+#
+# pkg:gem/dogapi#lib/dogapi/common.rb:38
class Dogapi::Service
+ # DEPRECATED: Going forward, use the newer APIService.
+ #
+ # pkg:gem/dogapi#lib/dogapi/common.rb:40
def initialize(api_key, api_host = T.unsafe(nil)); end
+ # DEPRECATED: Going forward, use the newer APIService.
+ #
+ # pkg:gem/dogapi#lib/dogapi/common.rb:46
def connect; end
+
+ # DEPRECATED: Going forward, use the newer APIService.
+ #
+ # pkg:gem/dogapi#lib/dogapi/common.rb:59
def request(method, url, params); end
end
+# pkg:gem/dogapi#lib/dogapi/common.rb:20
Dogapi::USER_AGENT = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v1/alert.rb:6
class Dogapi::V1; end
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/alert.rb:8
class Dogapi::V1::AlertService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:12
def alert(query, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:32
def delete_alert(alert_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:28
def get_alert(alert_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:36
def get_all_alerts; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:40
def mute_alerts; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:44
def unmute_alerts; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/alert.rb:20
def update_alert(alert_id, query, options); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/alert.rb:10
Dogapi::V1::AlertService::API_VERSION = T.let(T.unsafe(nil), String)
+# AwsIntegrationService for user interaction with AWS configs.
+#
+# pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:9
class Dogapi::V1::AwsIntegrationService < ::Dogapi::APIService
+ # Create an AWS integration
+ # :config => Hash: integration config.
+ # config = {
+ # :account_id => '',
+ # :host_tags => ['api:example'],
+ # :role_name => ''
+ # }
+ #
+ # Access Key/Secret Access Key based accounts (GovCloud and China only)
+ #
+ # config = {
+ # :access_key_id => '',
+ # :host_tags => ['api:example'],
+ # :secret_access_key => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.aws_integration_create(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:37
def aws_integration_create(config); end
+
+ # Delete an integration
+ # :config => Hash: integration config.
+ # config = {
+ # :account_id => '',
+ # :role_name => ''
+ # }
+ # Access Key/Secret Access Key based accounts (GovCloud and China only)
+ #
+ # config = {
+ # :access_key_id => '',
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.aws_integration_delete(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:56
def aws_integration_delete(config); end
+
+ # Generate new AWS external ID for a specific integrated account
+ # :config => Hash: integration config.
+ # config = {
+ # :account_id => '',
+ # :role_name => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.aws_integration_generate_external_id(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:75
def aws_integration_generate_external_id(config); end
+
+ # Retrieve AWS integration information
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:14
def aws_integration_list; end
+
+ # List available AWS namespaces
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:61
def aws_integration_list_namespaces; end
+
+ # puts dog.aws_integration_update(config, new_config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:108
def aws_integration_update(config, new_config); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/aws_integration.rb:11
Dogapi::V1::AwsIntegrationService::API_VERSION = T.let(T.unsafe(nil), String)
+# AwsLogsService for user interaction with AWS configs.
+#
+# pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:9
class Dogapi::V1::AwsLogsService < ::Dogapi::APIService
+ # Create an AWS integration
+ # :config => Hash: integration config.
+ # config = {
+ # :account_id => '',
+ # :lambda_arn => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.aws_logs_add_lambda(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:30
def aws_logs_add_lambda(config); end
+
+ # contents of config should be
+ # >>> :account_id => ''
+ # >>> :lambda_arn => ''
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:81
def aws_logs_check_lambda(config); end
+
+ # contents of config should be
+ # :account_id => ''
+ # :services => ['s3', 'elb', 'elbv2', 'cloudfront', 'redshift', 'lambda']
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:98
def aws_logs_check_services(config); end
+
+ # Delete an AWS Logs integration
+ # :config => Hash: integration config.
+ # config = {
+ # :account_id => '',
+ # :lambda_arn => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.aws_logs_integration_delete(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:63
def aws_logs_integration_delete(config); end
+
+ # List all Datadog-AWS Logs integrations configured in your Datadog account.
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:35
def aws_logs_integrations_list; end
+
+ # Get the list of current AWS services for which Datadog offers automatic log collection.
+ # Use returned service IDs with the services parameter for the Enable
+ # an AWS service log collection API endpoint.
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:16
def aws_logs_list_services; end
+
+ # Enable automatic log collection for a list of services.
+ # This should be run after running 'aws_logs_add_lambda' to save the config.
+ # config = {
+ # :account_id => '',
+ # :services => ['s3', 'elb', 'elbv2', 'cloudfront', 'redshift', 'lambda']
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.aws_logs_save_services(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:49
def aws_logs_save_services(config); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/aws_logs.rb:11
Dogapi::V1::AwsLogsService::API_VERSION = T.let(T.unsafe(nil), String)
+# AzureIntegrationService for user interaction with Azure configs.
+#
+# pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:9
class Dogapi::V1::AzureIntegrationService < ::Dogapi::APIService
+ # Create an Azure integration
+ # :config => Hash: integration config.
+ # config = {
+ # :tenant_name => '',
+ # :host_filters => 'new:filter',
+ # :client_id => '',
+ # :client_secret => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.azure_integration_create(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:44
def azure_integration_create(config); end
+
+ # Delete an Azure integration
+ # :config => Hash: integration config.
+ # config = {
+ # :tenant_name => '',
+ # :client_id => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.azure_integration_delete(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:28
def azure_integration_delete(config); end
+
+ # Retrieve Azure integration information
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:14
def azure_integration_list; end
+
+ # Update a configured Azure account.
+ # :config => Hash: integration config.
+ # config = {
+ # :tenant_name => '',
+ # :new_tenant_name => '',
+ # :host_filters => ':,:',
+ # :client_id => '',
+ # :new_client_id => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.azure_integration_update(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:76
def azure_integration_update(config); end
+
+ # Update an Azure integrations host filters
+ # :config => Hash: integration config.
+ # config = {
+ # :tenant_name => '',
+ # :host_filters => 'new:filter',
+ # :client_id => ''
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.azure_integration_update_host_filters(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:59
def azure_integration_update_host_filters(config); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/azure_integration.rb:11
Dogapi::V1::AzureIntegrationService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/comment.rb:8
class Dogapi::V1::CommentService < ::Dogapi::APIService
+ # Submit a comment.
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/comment.rb:13
def comment(message, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/comment.rb:26
def delete_comment(comment_id); end
+
+ # Update a comment.
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/comment.rb:22
def update_comment(comment_id, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/comment.rb:10
Dogapi::V1::CommentService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/dash.rb:8
class Dogapi::V1::DashService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/dash.rb:12
def create_dashboard(title, description, graphs, template_variables = T.unsafe(nil), read_only = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dash.rb:44
def delete_dashboard(dash_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dash.rb:36
def get_dashboard(dash_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dash.rb:40
def get_dashboards; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dash.rb:24
def update_dashboard(dash_id, title, description, graphs, template_variables = T.unsafe(nil), read_only = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/dash.rb:10
Dogapi::V1::DashService::API_VERSION = T.let(T.unsafe(nil), String)
+# Dashboard List API
+#
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:9
class Dogapi::V1::DashboardListService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:53
def add_items(resource_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:35
def all; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:15
def create(name); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:39
def delete(resource_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:81
def delete_items(resource_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:31
def get(resource_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:43
def get_items(resource_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:23
def update(resource_id, name); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:67
def update_items(resource_id, dashboards); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:11
Dogapi::V1::DashboardListService::API_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:12
Dogapi::V1::DashboardListService::RESOURCE_NAME = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard_list.rb:13
Dogapi::V1::DashboardListService::SUB_RESOURCE_NAME = T.let(T.unsafe(nil), String)
+# Dashboard API
+#
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:9
class Dogapi::V1::DashboardService < ::Dogapi::APIService
+ # Create new dashboard
+ #
+ # Required arguments:
+ # :title => String: Title of the dashboard
+ # :widgets => JSON: List of widgets to display on the dashboard
+ # :layout_type => String: Layout type of the dashboard.
+ # Allowed values: 'ordered' or 'free'
+ # Optional arguments:
+ # :description => String: Description of the dashboard
+ # :is_read_only => Boolean: Whether this dashboard is read-only.
+ # If True, only the author and admins can make changes to it.
+ # :notify_list => JSON: List of handles of users to notify when changes are made to this dashboard
+ # e.g. '["user1@domain.com", "user2@domain.com"]'
+ # :template_variables => JSON: List of template variables for this dashboard.
+ # e.g. [{"name": "host", "prefix": "host", "default": "my-host"}]
+ # :template_variable_presets => JSON: List of template variables saved views
+ # e.g. {
+ # "name": "my_template_variable_preset",
+ # "template_variables": [{"name": "host", "prefix": "host", "default": "my-host"}]
+ # }
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:34
def create_board(title, widgets, layout_type, options); end
+
+ # Delete the given dashboard
+ #
+ # Required argument:
+ # :dashboard_id => String: ID of the dashboard
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:106
def delete_board(dashboard_id); end
+
+ # Fetch all custom dashboards
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:98
def get_all_boards; end
+
+ # Fetch the given dashboard
+ #
+ # Required argument:
+ # :dashboard_id => String: ID of the dashboard
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:93
def get_board(dashboard_id); end
+
+ # Update a dashboard
+ #
+ # Required arguments:
+ # :dashboard_id => String: ID of the dashboard
+ # :title => String: Title of the dashboard
+ # :widgets => JSON: List of widgets to display on the dashboard
+ # :layout_type => String: Layout type of the dashboard.
+ # Allowed values: 'ordered' or 'free'
+ # Optional arguments:
+ # :description => String: Description of the dashboard
+ # :is_read_only => Boolean: Whether this dashboard is read-only.
+ # If True, only the author and admins can make changes to it.
+ # :notify_list => JSON: List of handles of users to notify when changes are made to this dashboard
+ # e.g. '["user1@domain.com", "user2@domain.com"]'
+ # :template_variables => JSON: List of template variables for this dashboard.
+ # e.g. [{"name": "host", "prefix": "host", "default": "my-host"}]
+ # :template_variable_presets => JSON: List of template variables saved views
+ # e.g. {
+ # "name": "my_template_variable_preset",
+ # "template_variables": [{"name": "host", "prefix": "host", "default": "my-host"}]
+ # }
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:72
def update_board(dashboard_id, title, widgets, layout_type, options); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:11
Dogapi::V1::DashboardService::API_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v1/dashboard.rb:12
Dogapi::V1::DashboardService::RESOURCE_NAME = T.let(T.unsafe(nil), String)
+# ================
+# EMBED API
+# ================
+#
+# pkg:gem/dogapi#lib/dogapi/v1/embed.rb:11
class Dogapi::V1::EmbedService < ::Dogapi::APIService
+ # Create an embeddable graph
+ #
+ # :graph_json => JSON: graph definition
+ # :timeframe => String: representing the interval of the graph. Default is "1_hour"
+ # :size => String: representing the size of the graph. Default is "medium".
+ # :legend => String: flag representing whether a legend is displayed. Default is "no".
+ # :title => String: represents title of the graph. Default is "Embed created through API."
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/embed.rb:37
def create_embed(graph_json, description = T.unsafe(nil)); end
+
+ # Enable a specific embed
+ #
+ # :embed_id => String: embed token for a specific embed
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/embed.rb:48
def enable_embed(embed_id); end
+
+ # Get all embeds for the API user's org
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/embed.rb:16
def get_all_embeds; end
+
+ # Get a specific embed
+ #
+ # :embed_id => String: embed token for a specific embed
+ # :size => String: "small", "medium"(defualt), "large", or "xlarge".
+ # :legend => String: "yes" or "no"(default)
+ # :template_vars => String: variable name => variable value (any number of template vars)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/embed.rb:26
def get_embed(embed_id, description = T.unsafe(nil)); end
+
+ # Revoke a specific embed
+ #
+ # :embed_id => String: embed token for a specific embed
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/embed.rb:55
def revoke_embed(embed_id); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/embed.rb:13
Dogapi::V1::EmbedService::API_VERSION = T.let(T.unsafe(nil), String)
+# Event-specific client affording more granular control than the simple Dogapi::Client
+#
+# pkg:gem/dogapi#lib/dogapi/v1/event.rb:9
class Dogapi::V1::EventService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/event.rb:34
def delete(id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/event.rb:30
def get(id); end
+
+ # Records an Event with no duration
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/event.rb:16
def post(event, scope = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/event.rb:38
def stream(start, stop, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/event.rb:11
Dogapi::V1::EventService::API_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v1/event.rb:12
Dogapi::V1::EventService::MAX_BODY_LENGTH = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/dogapi#lib/dogapi/v1/event.rb:13
Dogapi::V1::EventService::MAX_TITLE_LENGTH = T.let(T.unsafe(nil), Integer)
+# GcpIntegrationService for user interaction with gcp configs.
+#
+# pkg:gem/dogapi#lib/dogapi/v1/gcp_integration.rb:9
class Dogapi::V1::GcpIntegrationService < ::Dogapi::APIService
+ # Create an gcp integration
+ # :config => Hash: integration config.
+ # config = {
+ # :type => 'service_account',
+ # :project_id => '',
+ # :private_key_id => '',
+ # :private_key => '',
+ # :client_email => '',
+ # :client_id => '',
+ # :auth_uri => '',
+ # :token_uri => '',
+ # :auth_provider_x509_cert_url => '',
+ # :client_x509_cert_url => '',
+ # :host_filters => ':,:,'
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.gcp_integration_create(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/gcp_integration.rb:51
def gcp_integration_create(config); end
+
+ # Delete an gcp integration
+ # :config => Hash: integration config.
+ # config = {
+ # :project_id => 'datadog-sandbox',
+ # :client_email => 'email@example.com'
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.gcp_integration_delete(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/gcp_integration.rb:28
def gcp_integration_delete(config); end
+
+ # Retrieve gcp integration information
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/gcp_integration.rb:14
def gcp_integration_list; end
+
+ # Update a configured gcp account.
+ # :config => Hash: integration config.
+ # config = {
+ # :project_id => '',
+ # :client_email => '',
+ # :host_filters => ':,:,'
+ # :automute => true # takes a boolean and toggles GCE automuting
+ # }
+ #
+ # dog = Dogapi::Client.new(api_key, app_key)
+ #
+ # puts dog.gcp_integration_update(config)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/gcp_integration.rb:67
def gcp_integration_update(config); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/gcp_integration.rb:11
Dogapi::V1::GcpIntegrationService::API_VERSION = T.let(T.unsafe(nil), String)
+# Hosts API
+#
+# pkg:gem/dogapi#lib/dogapi/v1/hosts.rb:9
class Dogapi::V1::HostsService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/hosts.rb:13
def search(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/hosts.rb:17
def totals; end
end
+# pkg:gem/dogapi#lib/dogapi/v1/hosts.rb:11
Dogapi::V1::HostsService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/integration.rb:8
class Dogapi::V1::IntegrationService < ::Dogapi::APIService
+ # Create an integration
+ #
+ # :source_type_name => String: the name of an integration source
+ # :config => Hash: integration config that varies based on the source type.
+ # See https://docs.datadoghq.com/api/#integrations.
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/integration.rb:17
def create_integration(source_type_name, config); end
+
+ # Delete an integration
+ #
+ # :source_type_name => String: the name of an integration source
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/integration.rb:40
def delete_integration(source_type_name); end
+
+ # Retrieve integration information
+ #
+ # :source_type_name => String: the name of an integration source
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/integration.rb:33
def get_integration(source_type_name); end
+
+ # Update an integration
+ #
+ # :source_type_name => String: the name of an integration source
+ # :config => Hash: integration config that varies based on the source type.
+ # source type (https://docs.datadoghq.com/api/#integrations)
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/integration.rb:26
def update_integration(source_type_name, config); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/integration.rb:10
Dogapi::V1::IntegrationService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:7
class Dogapi::V1::LogsPipelineService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:10
def create_logs_pipeline(name, filter, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:36
def delete_logs_pipeline(pipeline_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:23
def get_all_logs_pipelines; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:19
def get_logs_pipeline(pipeline_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:27
def update_logs_pipeline(pipeline_id, name, filter, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/logs_pipeline.rb:8
Dogapi::V1::LogsPipelineService::API_VERSION = T.let(T.unsafe(nil), String)
+# pkg:gem/dogapi#lib/dogapi/v1/metadata.rb:8
class Dogapi::V1::MetadataService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/metadata.rb:12
def get(metric_name); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metadata.rb:16
def update(metric_name, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/metadata.rb:10
Dogapi::V1::MetadataService::API_VERSION = T.let(T.unsafe(nil), String)
+# Event-specific client affording more granular control than the simple Dogapi::Client
+#
+# pkg:gem/dogapi#lib/dogapi/v1/metric.rb:9
class Dogapi::V1::MetricService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:40
def flush_buffer; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:13
def get(query, from, to); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:89
def get_active_metrics(from); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:62
def make_metric_payload(metric, points, scope, options); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:46
def submit(*args); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:29
def submit_to_api(metric, points, scope, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:34
def submit_to_buffer(metric, points, scope, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:54
def switch_to_batched; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:58
def switch_to_single; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/metric.rb:22
def upload(metrics); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/metric.rb:11
Dogapi::V1::MetricService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:7
class Dogapi::V1::MonitorService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:45
def can_delete_monitors(monitor_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:140
def cancel_downtime(downtime_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:144
def cancel_downtime_by_scope(scope); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:56
def delete_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:148
def get_all_downtimes(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:60
def get_all_monitors(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:136
def get_downtime(downtime_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:32
def get_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:10
def monitor(type, query, options = T.unsafe(nil)); end
+
+ # HOST MUTING
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:155
def mute_host(hostname, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:94
def mute_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:86
def mute_monitors; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:102
def resolve_monitors(monitor_groups = T.unsafe(nil), options = T.unsafe(nil), version = T.unsafe(nil)); end
+
+ # DOWNTIMES
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:124
def schedule_downtime(scope, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:117
def search_monitor_groups(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:113
def search_monitors(options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:159
def unmute_host(hostname); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:98
def unmute_monitor(monitor_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:90
def unmute_monitors; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:132
def update_downtime(downtime_id, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:19
def update_monitor(monitor_id, query = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:77
def validate_monitor(type, query, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/monitor.rb:8
Dogapi::V1::MonitorService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:8
class Dogapi::V1::ScreenboardService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:12
def create_screenboard(description); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:28
def delete_screenboard(board_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:24
def get_all_screenboards; end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:20
def get_screenboard(board_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:36
def revoke_screenboard(board_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:32
def share_screenboard(board_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:16
def update_screenboard(board_id, description); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/screenboard.rb:10
Dogapi::V1::ScreenboardService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/search.rb:8
class Dogapi::V1::SearchService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/search.rb:12
def search(query); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/search.rb:10
Dogapi::V1::SearchService::API_VERSION = T.let(T.unsafe(nil), String)
+# pkg:gem/dogapi#lib/dogapi/v1/service_check.rb:8
class Dogapi::V1::ServiceCheckService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/service_check.rb:12
def service_check(check, host, status, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/service_check.rb:10
Dogapi::V1::ServiceCheckService::API_VERSION = T.let(T.unsafe(nil), String)
+# Implements Service Level Objectives endpoints
+#
+# pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:9
class Dogapi::V1::ServiceLevelObjectiveService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:103
def can_delete_service_level_objective(slo_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:13
def create_service_level_objective(type, slo_name, thresholds, options = T.unsafe(nil)); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:83
def delete_many_service_level_objective(slo_ids); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:79
def delete_service_level_objective(slo_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:90
def delete_timeframes_service_level_objective(ops); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:62
def get_service_level_objective(slo_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:95
def get_service_level_objective_history(slo_id, from_ts, to_ts); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:66
def search_service_level_objective(slo_ids, query, offset, limit); end
+
+ # pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:37
def update_service_level_objective(slo_id, type, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/service_level_objective.rb:11
Dogapi::V1::ServiceLevelObjectiveService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/snapshot.rb:8
class Dogapi::V1::SnapshotService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v1/snapshot.rb:12
def snapshot(metric_query, start_ts, end_ts, event_query = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/snapshot.rb:10
Dogapi::V1::SnapshotService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+# SyntheticsService is the class responsible for dealing with the synthetics
+#
+# pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:8
class Dogapi::V1::SyntheticsService < ::Dogapi::APIService
+ # Create a synthetics test: POST /v1/synthetics/tests/
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:13
def create_synthetics_test(type, config, options = T.unsafe(nil)); end
+
+ # Delete synthetics tests
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:33
def delete_synthetics_tests(test_ids); end
+
+ # Get all synthetics tests: GET /v1/synthetics/tests
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:49
def get_all_synthetics_tests; end
+
+ # Get devices for browser checks: GET /v1/synthetics/browser/devices
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:70
def get_synthetics_devices; end
+
+ # Get available locations: GET /v1/synthetics/locations
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:75
def get_synthetics_locations; end
+
+ # Get a specific result for a synthetics test:
+ # GET /v1/synthetics/tests//results/
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:65
def get_synthetics_result(test_id, result_id); end
+
+ # Get the most recent results for a synthetics test: GET /v1/synthetics/tests//results
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:59
def get_synthetics_results(test_id); end
+
+ # Get info on a synthetics test: GET /v1/synthetics/tests/
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:54
def get_synthetics_test(test_id); end
+
+ # Start of pause a synthetics test: POST /v1/synthetics/tests//status
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:41
def start_pause_synthetics_test(test_id, new_status); end
+
+ # Edit a synthetics test: PUT /v1/synthetics/tests/
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:23
def update_synthetics_test(test_id, type, config, options = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/synthetics.rb:10
Dogapi::V1::SyntheticsService::API_VERSION = T.let(T.unsafe(nil), String)
+# pkg:gem/dogapi#lib/dogapi/v1/tag.rb:9
class Dogapi::V1::TagService < ::Dogapi::APIService
+ # Adds a list of tags to a host
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/tag.rb:37
def add(host_id, tags, source = T.unsafe(nil)); end
+
+ # Remove all tags from a host
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/tag.rb:71
def detach(host_id, source = T.unsafe(nil)); end
+
+ # DEPRECATED: Spelling mistake temporarily preserved as an alias.
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/tag.rb:65
def detatch(host_id); end
+
+ # Gets all tags for a given host
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/tag.rb:24
def get(host_id, source = T.unsafe(nil), by_source = T.unsafe(nil)); end
+
+ # Gets all tags in your org and the hosts tagged with them
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/tag.rb:14
def get_all(source = T.unsafe(nil)); end
+
+ # Remove all tags from a host and replace them with a new list
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/tag.rb:51
def update(host_id, tags, source = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/tag.rb:11
Dogapi::V1::TagService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/usage.rb:8
class Dogapi::V1::UsageService < ::Dogapi::APIService
+ # Retrieve hourly custom metrics usage information
+ #
+ # :start_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, for usage beginning at this hour
+ # :end_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, default start_hr+1d, for usage ending BEFORE this hour
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/usage.rb:44
def get_custom_metrics_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Retrieve hourly fargate usage information
+ #
+ # :start_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, for usage beginning at this hour
+ # :end_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, default start_hr+1d, for usage ending BEFORE this hour
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/usage.rb:86
def get_fargate_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Retrieve hourly host usage information
+ #
+ # :start_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, for usage beginning at this hour
+ # :end_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, default start_hr+1d, for usage ending BEFORE this hour
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/usage.rb:16
def get_hosts_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Retrieve hourly logs usage information
+ #
+ # :start_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, for usage beginning at this hour
+ # :end_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, default start_hr+1d, for usage ending BEFORE this hour
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/usage.rb:30
def get_logs_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Retrieve hourly synthetics usage information
+ #
+ # :start_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, for usage beginning at this hour
+ # :end_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, default start_hr+1d, for usage ending BEFORE this hour
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/usage.rb:72
def get_synthetics_usage(start_hr, end_hr = T.unsafe(nil)); end
+
+ # Retrieve hourly trace search usage information
+ #
+ # :start_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, for usage beginning at this hour
+ # :end_hr => String: Datetime ISO-8601 UTC YYYY-MM-DDThh, default start_hr+1d, for usage ending BEFORE this hour
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/usage.rb:58
def get_traces_usage(start_hr, end_hr = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/usage.rb:10
Dogapi::V1::UsageService::API_VERSION = T.let(T.unsafe(nil), String)
+# for namespacing
+#
+# pkg:gem/dogapi#lib/dogapi/v1/user.rb:8
class Dogapi::V1::UserService < ::Dogapi::APIService
+ # Create a user
+ #
+ # :description => Hash: user description containing 'handle' and 'name' properties
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/user.rb:27
def create_user(description = T.unsafe(nil)); end
+
+ # Disable a user
+ #
+ # :handle => String: user handle
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/user.rb:55
def disable_user(handle); end
+
+ # Retrieve all users
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/user.rb:39
def get_all_users; end
+
+ # Retrieve user information
+ #
+ # :handle => String: user handle
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/user.rb:34
def get_user(handle); end
+
+ # DEPRECATED: Going forward, we're using a new and more restful API,
+ # the new methods are get_user, create_user, update_user, disable_user
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/user.rb:14
def invite(emails, options = T.unsafe(nil)); end
+
+ # Update a user
+ #
+ # :handle => String: user handle
+ # :description => Hash: user description optionally containing 'name', 'email',
+ # 'is_admin', 'disabled' properties
+ #
+ # pkg:gem/dogapi#lib/dogapi/v1/user.rb:48
def update_user(handle, description = T.unsafe(nil)); end
end
+# pkg:gem/dogapi#lib/dogapi/v1/user.rb:10
Dogapi::V1::UserService::API_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:6
class Dogapi::V2; end
+# Dashboard List API
+#
+# pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:9
class Dogapi::V2::DashboardListService < ::Dogapi::APIService
+ # pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:25
def add_items(resource_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:53
def delete_items(resource_id, dashboards); end
+
+ # pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:15
def get_items(resource_id); end
+
+ # pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:39
def update_items(resource_id, dashboards); end
end
+# pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:11
Dogapi::V2::DashboardListService::API_VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:12
Dogapi::V2::DashboardListService::RESOURCE_NAME = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/v2/dashboard_list.rb:13
Dogapi::V2::DashboardListService::SUB_RESOURCE_NAME = T.let(T.unsafe(nil), String)
+
+# pkg:gem/dogapi#lib/dogapi/version.rb:6
Dogapi::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/erubi@1.13.1.rbi b/sorbet/rbi/gems/erubi@1.13.1.rbi
new file mode 100644
index 0000000..dcc2f23
--- /dev/null
+++ b/sorbet/rbi/gems/erubi@1.13.1.rbi
@@ -0,0 +1,153 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `erubi` gem.
+# Please instead update this file by running `bin/tapioca gem erubi`.
+
+
+# pkg:gem/erubi#lib/erubi.rb:3
+module Erubi
+ private
+
+ # Escape characters with their HTML/XML equivalents.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:22
+ def h(_arg0); end
+
+ class << self
+ # pkg:gem/erubi#lib/erubi.rb:49
+ def h(_arg0); end
+ end
+end
+
+# pkg:gem/erubi#lib/erubi.rb:51
+class Erubi::Engine
+ # Initialize a new Erubi::Engine. Options:
+ # +:bufval+ :: The value to use for the buffer variable, as a string (default '::String.new' ).
+ # +:bufvar+ :: The variable name to use for the buffer variable, as a string.
+ # +:chain_appends+ :: Whether to chain << calls to the buffer variable. Offers better
+ # performance, but can cause issues when the buffer variable is reassigned during
+ # template rendering (default +false+).
+ # +:ensure+ :: Wrap the template in a begin/ensure block restoring the previous value of bufvar.
+ # +:escapefunc+ :: The function to use for escaping, as a string (default: '::Erubi.h' ).
+ # +:escape+ :: Whether to make <%= escape by default, and <%== not escape by default.
+ # +:escape_html+ :: Same as +:escape+, with lower priority.
+ # +:filename+ :: The filename for the template.
+ # the resulting source code. Note this may cause problems if you are wrapping the resulting
+ # source code in other code, because the magic comment only has an effect at the beginning of
+ # the file, and having the magic comment later in the file can trigger warnings.
+ # +:freeze_template_literals+ :: Whether to suffix all literal strings for template code with .freeze
+ # (default: +true+ on Ruby 2.1+, +false+ on Ruby 2.0 and older).
+ # Can be set to +false+ on Ruby 2.3+ when frozen string literals are enabled
+ # in order to improve performance.
+ # +:literal_prefix+ :: The prefix to output when using escaped tag delimiters (default '<%' ).
+ # +:literal_postfix+ :: The postfix to output when using escaped tag delimiters (default '%>' ).
+ # +:outvar+ :: Same as +:bufvar+, with lower priority.
+ # +:postamble+ :: The postamble for the template, by default returns the resulting source code.
+ # +:preamble+ :: The preamble for the template, by default initializes the buffer variable.
+ # +:regexp+ :: The regexp to use for scanning.
+ # +:src+ :: The initial value to use for the source code, an empty string by default.
+ # +:trim+ :: Whether to trim leading and trailing whitespace, true by default.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:91
+ def initialize(input, properties = T.unsafe(nil)); end
+
+ # The variable name used for the buffer variable.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:62
+ def bufvar; end
+
+ # The filename of the template, if one was given.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:59
+ def filename; end
+
+ # The frozen ruby source code generated from the template, which can be evaled.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:56
+ def src; end
+
+ private
+
+ # pkg:gem/erubi#lib/erubi.rb:209
+ def _dup_string_if_frozen(string); end
+
+ # Add ruby code to the template
+ #
+ # pkg:gem/erubi#lib/erubi.rb:232
+ def add_code(code); end
+
+ # Add the given ruby expression result to the template,
+ # escaping it based on the indicator given and escape flag.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:241
+ def add_expression(indicator, code); end
+
+ # Add the result of Ruby expression to the template
+ #
+ # pkg:gem/erubi#lib/erubi.rb:250
+ def add_expression_result(code); end
+
+ # Add the escaped result of Ruby expression to the template
+ #
+ # pkg:gem/erubi#lib/erubi.rb:255
+ def add_expression_result_escaped(code); end
+
+ # Add the given postamble to the src. Can be overridden in subclasses
+ # to make additional changes to src that depend on the current state.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:261
+ def add_postamble(postamble); end
+
+ # Add raw text to the template. Modifies argument if argument is mutable as a memory optimization.
+ # Must be called with a string, cannot be called with nil (Rails's subclass depends on it).
+ #
+ # pkg:gem/erubi#lib/erubi.rb:222
+ def add_text(text); end
+
+ # Raise an exception, as the base engine class does not support handling other indicators.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:267
+ def handle(indicator, code, tailch, rspace, lspace); end
+
+ # Make sure that any current expression has been terminated.
+ # The default is to terminate all expressions, but when
+ # the chain_appends option is used, expressions may not be
+ # terminated.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:295
+ def terminate_expression; end
+
+ # Make sure the buffer variable is the target of the next append
+ # before yielding to the block. Mark that the buffer is the target
+ # of the next append after the block executes.
+ #
+ # This method should only be called if the block will result in
+ # code where << will append to the bufvar.
+ #
+ # pkg:gem/erubi#lib/erubi.rb:277
+ def with_buffer; end
+end
+
+# The default regular expression used for scanning.
+#
+# pkg:gem/erubi#lib/erubi.rb:53
+Erubi::Engine::DEFAULT_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/erubi#lib/erubi.rb:17
+Erubi::FREEZE_TEMPLATE_LITERALS = T.let(T.unsafe(nil), TrueClass)
+
+# pkg:gem/erubi#lib/erubi.rb:15
+Erubi::MATCH_METHOD = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/erubi#lib/erubi.rb:8
+Erubi::RANGE_FIRST = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/erubi#lib/erubi.rb:9
+Erubi::RANGE_LAST = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/erubi#lib/erubi.rb:16
+Erubi::SKIP_DEFINED_FOR_INSTANCE_VARIABLE = T.let(T.unsafe(nil), TrueClass)
+
+# pkg:gem/erubi#lib/erubi.rb:4
+Erubi::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/i18n@1.15.2.rbi b/sorbet/rbi/gems/i18n@1.15.2.rbi
new file mode 100644
index 0000000..b5ab2cc
--- /dev/null
+++ b/sorbet/rbi/gems/i18n@1.15.2.rbi
@@ -0,0 +1,2285 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `i18n` gem.
+# Please instead update this file by running `bin/tapioca gem i18n`.
+
+
+# pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:15
+module GetText; end
+
+# pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:17
+class GetText::PoParser < ::Racc::Parser
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:19
+ def _(x); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:282
+ def _reduce_10(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:295
+ def _reduce_12(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:302
+ def _reduce_13(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:309
+ def _reduce_14(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:316
+ def _reduce_15(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:235
+ def _reduce_5(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:246
+ def _reduce_8(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:264
+ def _reduce_9(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:323
+ def _reduce_none(val, _values, result); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:23
+ def next_token; end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:23
+ def on_comment(comment); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:23
+ def on_message(msgid, msgstr); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:23
+ def parse(str, data, ignore_fuzzy = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:23
+ def unescape(orig); end
+end
+
+# pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:184
+GetText::PoParser::Racc_arg = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:221
+GetText::PoParser::Racc_debug_parser = T.let(T.unsafe(nil), TrueClass)
+
+# pkg:gem/i18n#lib/i18n/gettext/po_parser.rb:200
+GetText::PoParser::Racc_token_to_s_table = T.let(T.unsafe(nil), Array)
+
+# This module allows you to easily cache all responses from the backend - thus
+# speeding up the I18n aspects of your application quite a bit.
+#
+# To enable caching you can simply include the Cache module to the Simple
+# backend - or whatever other backend you are using:
+#
+# I18n::Backend::Simple.send(:include, I18n::Backend::Cache)
+#
+# You will also need to set a cache store implementation that you want to use:
+#
+# I18n.cache_store = ActiveSupport::Cache.lookup_store(:memory_store)
+#
+# You can use any cache implementation you want that provides the same API as
+# ActiveSupport::Cache (only the methods #fetch and #write are being used).
+#
+# The cache_key implementation by default assumes you pass values that return
+# a valid key from #hash (see
+# https://www.ruby-doc.org/core/classes/Object.html#M000337). However, you can
+# configure your own digest method via which responds to #hexdigest (see
+# https://ruby-doc.org/stdlib/libdoc/openssl/rdoc/OpenSSL/Digest.html):
+#
+# I18n.cache_key_digest = OpenSSL::Digest::SHA256.new
+#
+# If you use a lambda as a default value in your translation like this:
+#
+# I18n.t(:"date.order", :default => lambda {[:month, :day, :year]})
+#
+# Then you will always have a cache miss, because each time this method
+# is called the lambda will have a different hash value. If you know
+# the result of the lambda is a constant as in the example above, then
+# to cache this you can make the lambda a constant, like this:
+#
+# DEFAULT_DATE_ORDER = lambda {[:month, :day, :year]}
+# ...
+# I18n.t(:"date.order", :default => DEFAULT_DATE_ORDER)
+#
+# If the lambda may result in different values for each call then consider
+# also using the Memoize backend.
+#
+# The Cascade module adds the ability to do cascading lookups to backends that
+# are compatible to the Simple backend.
+#
+# By cascading lookups we mean that for any key that can not be found the
+# Cascade module strips one segment off the scope part of the key and then
+# tries to look up the key in that scope.
+#
+# E.g. when a lookup for the key :"foo.bar.baz" does not yield a result then
+# the segment :bar will be stripped off the scope part :"foo.bar" and the new
+# scope :foo will be used to look up the key :baz. If that does not succeed
+# then the remaining scope segment :foo will be omitted, too, and again the
+# key :baz will be looked up (now with no scope).
+#
+# To enable a cascading lookup one passes the :cascade option:
+#
+# I18n.t(:'foo.bar.baz', :cascade => true)
+#
+# This will return the first translation found for :"foo.bar.baz", :"foo.baz"
+# or :baz in this order.
+#
+# The cascading lookup takes precedence over resolving any given defaults.
+# I.e. defaults will kick in after the cascading lookups haven't succeeded.
+#
+# This behavior is useful for libraries like ActiveRecord validations where
+# the library wants to give users a bunch of more or less fine-grained options
+# of scopes for a particular key.
+#
+# Thanks to Clemens Kofler for the initial idea and implementation! See
+# http://github.com/clemens/i18n-cascading-backend
+# I18n locale fallbacks are useful when you want your application to use
+# translations from other locales when translations for the current locale are
+# missing. E.g. you might want to use :en translations when translations in
+# your applications main locale :de are missing.
+#
+# To enable locale fallbacks you can simply include the Fallbacks module to
+# the Simple backend - or whatever other backend you are using:
+#
+# I18n::Backend::Simple.include(I18n::Backend::Fallbacks)
+# The InterpolationCompiler module contains optimizations that can tremendously
+# speed up the interpolation process on the Simple backend.
+#
+# It works by defining a pre-compiled method on stored translation Strings that
+# already bring all the knowledge about contained interpolation variables etc.
+# so that the actual recurring interpolation will be very fast.
+#
+# To enable pre-compiled interpolations you can simply include the
+# InterpolationCompiler module to the Simple backend:
+#
+# I18n::Backend::Simple.include(I18n::Backend::InterpolationCompiler)
+#
+# Note that InterpolationCompiler does not yield meaningful results and consequently
+# should not be used with Ruby 1.9 (YARV) but improves performance everywhere else
+# (jRuby, Rubinius).
+# Memoize module simply memoizes the values returned by lookup using
+# a flat hash and can tremendously speed up the lookup process in a backend.
+#
+# To enable it you can simply include the Memoize module to your backend:
+#
+# I18n::Backend::Simple.include(I18n::Backend::Memoize)
+#
+# Notice that it's the responsibility of the backend to define whenever the
+# cache should be cleaned.
+# I18n translation metadata is useful when you want to access information
+# about how a translation was looked up, pluralized or interpolated in
+# your application.
+#
+# msg = I18n.t(:message, :default => 'Hi!', :scope => :foo)
+# msg.translation_metadata
+# # => { :key => :message, :scope => :foo, :default => 'Hi!' }
+#
+# If a :count option was passed to #translate it will be set to the metadata.
+# Likewise, if any interpolation variables were passed they will also be set.
+#
+# To enable translation metadata you can simply include the Metadata module
+# into the Simple backend class - or whatever other backend you are using:
+#
+# I18n::Backend::Simple.include(I18n::Backend::Metadata)
+#
+# I18n Pluralization are useful when you want your application to
+# customize pluralization rules.
+#
+# To enable locale specific pluralizations you can simply include the
+# Pluralization module to the Simple backend - or whatever other backend you
+# are using.
+#
+# I18n::Backend::Simple.include(I18n::Backend::Pluralization)
+#
+# You also need to make sure to provide pluralization algorithms to the
+# backend, i.e. include them to your I18n.load_path accordingly.
+# heavily based on Masao Mutoh's gettext String interpolation extension
+# http://github.com/mutoh/gettext/blob/f6566738b981fe0952548c421042ad1e0cdfb31e/lib/gettext/core_ext/string.rb
+# Locale Fallbacks
+#
+# Extends the I18n module to hold a fallbacks instance which is set to an
+# instance of I18n::Locale::Fallbacks by default but can be swapped with a
+# different implementation.
+#
+# Locale fallbacks will compute a number of fallback locales for a given locale.
+# For example:
+#
+#
+# I18n.fallbacks[:"es-MX"] # => [:"es-MX", :es, :en] e.g. , :short in :'date.formats' ).
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:78
+ def localize(locale, object, format = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:101
+ def reload!; end
+
+ # This method receives a locale, a data hash and options for storing translations.
+ # Should be implemented
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:24
+ def store_translations(locale, data, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:28
+ def translate(locale, key, options = T.unsafe(nil)); end
+
+ protected
+
+ # Deep interpolation
+ #
+ # deep_interpolate { people: { ann: "Ann is %{ann}", john: "John is %{john}" } },
+ # ann: 'good', john: 'big'
+ # #=> { people: { ann: "Ann is good", john: "John is big" } }
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:217
+ def deep_interpolate(locale, data, values = T.unsafe(nil)); end
+
+ # Evaluates defaults.
+ # If given subject is an Array, it walks the array and returns the
+ # first translation that can be resolved. Otherwise it tries to resolve
+ # the translation directly.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:128
+ def default(locale, object, subject, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:111
+ def eager_loaded?; end
+
+ # Interpolates values into a given subject.
+ #
+ # if the given subject is a string then:
+ # method interpolates "file %{file} opened by %%{user}", :file => 'test.txt', :user => 'Mr. X'
+ # # => "file test.txt opened by %{user}"
+ #
+ # if the given subject is an array then:
+ # each element of the array is recursively interpolated (until it finds a string)
+ # method interpolates ["yes, %{user}", ["maybe no, %{user}", "no, %{user}"]], :user => "bartuz"
+ # # => ["yes, bartuz", ["maybe no, bartuz", "no, bartuz"]]
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:201
+ def interpolate(locale, subject, values = T.unsafe(nil)); end
+
+ # Loads a single translations file by delegating to #load_rb or
+ # #load_yml depending on the file extension and directly merges the
+ # data to the existing translations. Raises I18n::UnknownFileType
+ # for all other file extensions.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:240
+ def load_file(filename); end
+
+ # Loads a JSON translations file. The data must have locales as
+ # toplevel keys.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:276
+ def load_json(filename); end
+
+ # Loads a plain Ruby translations file. eval'ing the file must yield
+ # a Hash containing translation data with locales as toplevel keys.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:254
+ def load_rb(filename); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:272
+ def load_yaml(filename); end
+
+ # Loads a YAML translations file. The data must have locales as
+ # toplevel keys.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:261
+ def load_yml(filename); end
+
+ # The method which actually looks up for the translation in the store.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:116
+ def lookup(locale, key, scope = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:308
+ def pluralization_key(entry, count); end
+
+ # Picks a translation from a pluralized mnemonic subkey according to English
+ # pluralization rules :
+ # - It will pick the :one subkey if count is equal to 1.
+ # - It will pick the :other subkey otherwise.
+ # - It will pick the :zero subkey in the special case where count is
+ # equal to 0 and there is a :zero subkey present. This behaviour is
+ # not standard with regards to the CLDR pluralization rules.
+ # Other backends can implement more flexible or complex pluralization rules.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:182
+ def pluralize(locale, entry, count); end
+
+ # Resolves a translation.
+ # If the given subject is a Symbol, it will be translated with the
+ # given options. If it is a Proc then it will be evaluated. All other
+ # subjects will be returned directly.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:150
+ def resolve(locale, object, subject, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:172
+ def resolve_entry(locale, object, subject, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:120
+ def subtrees?; end
+
+ # pkg:gem/i18n#lib/i18n/backend/base.rb:289
+ def translate_localization_format(locale, object, format, options); end
+end
+
+# TODO Should the cache be cleared if new translations are stored?
+#
+# pkg:gem/i18n#lib/i18n/backend/cache.rb:79
+module I18n::Backend::Cache
+ # pkg:gem/i18n#lib/i18n/backend/cache.rb:80
+ def translate(locale, key, options = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/cache.rb:93
+ def _fetch(cache_key, &block); end
+
+ # pkg:gem/i18n#lib/i18n/backend/cache.rb:101
+ def cache_key(locale, key, options); end
+
+ # pkg:gem/i18n#lib/i18n/backend/cache.rb:86
+ def fetch(cache_key, &block); end
+
+ private
+
+ # pkg:gem/i18n#lib/i18n/backend/cache.rb:108
+ def digest_item(key); end
+end
+
+# Overwrites the Base load_file method to cache loaded file contents.
+#
+# pkg:gem/i18n#lib/i18n/backend/cache_file.rb:8
+module I18n::Backend::CacheFile
+ # Optionally provide path_roots array to normalize filename paths,
+ # to make the cached i18n data portable across environments.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/cache_file.rb:11
+ def path_roots; end
+
+ # Optionally provide path_roots array to normalize filename paths,
+ # to make the cached i18n data portable across environments.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/cache_file.rb:11
+ def path_roots=(_arg0); end
+
+ protected
+
+ # Track loaded translation files in the `i18n.load_file` scope,
+ # and skip loading the file if its contents are still up-to-date.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/cache_file.rb:17
+ def load_file(filename); end
+
+ # Translate absolute filename to relative path for i18n key.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/cache_file.rb:28
+ def normalized_path(file); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/cascade.rb:35
+module I18n::Backend::Cascade
+ # pkg:gem/i18n#lib/i18n/backend/cascade.rb:36
+ def lookup(locale, key, scope = T.unsafe(nil), options = T.unsafe(nil)); end
+end
+
+# Backend that chains multiple other backends and checks each of them when
+# a translation needs to be looked up. This is useful when you want to use
+# standard translations with a Simple backend but store custom application
+# translations in a database or other backends.
+#
+# To use the Chain backend instantiate it and set it to the I18n module.
+# You can add chained backends through the initializer or backends
+# accessor:
+#
+# # preserves the existing Simple backend set to I18n.backend
+# I18n.backend = I18n::Backend::Chain.new(I18n::Backend::ActiveRecord.new, I18n.backend)
+#
+# The implementation assumes that all backends added to the Chain implement
+# a lookup method with the same API as Simple backend does.
+#
+# Fallback translations using the :default option are only used by the last backend of a chain.
+#
+# pkg:gem/i18n#lib/i18n/backend/chain.rb:21
+class I18n::Backend::Chain
+ include ::I18n::Backend::Transliterator
+ include ::I18n::Backend::Base
+ include ::I18n::Backend::Chain::Implementation
+end
+
+# pkg:gem/i18n#lib/i18n/backend/chain.rb:22
+module I18n::Backend::Chain::Implementation
+ include ::I18n::Backend::Transliterator
+ include ::I18n::Backend::Base
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:27
+ def initialize(*backends); end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:52
+ def available_locales; end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:25
+ def backends; end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:25
+ def backends=(_arg0); end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:44
+ def eager_load!; end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:76
+ def exists?(locale, key, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:31
+ def initialized?; end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:82
+ def localize(locale, object, format = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:40
+ def reload!; end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:48
+ def store_translations(locale, data, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:56
+ def translate(locale, key, default_options = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:92
+ def init_translations; end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:108
+ def namespace_lookup?(result, options); end
+
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:98
+ def translations; end
+
+ private
+
+ # This is approximately what gets used in ActiveSupport.
+ # However since we are not guaranteed to run in an ActiveSupport context
+ # it is wise to have our own copy. We underscore it
+ # to not pollute the namespace of the including class.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/chain.rb:117
+ def _deep_merge(hash, other_hash); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/fallbacks.rb:38
+module I18n::Backend::Fallbacks
+ # pkg:gem/i18n#lib/i18n/backend/fallbacks.rb:106
+ def exists?(locale, key, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/fallbacks.rb:97
+ def extract_non_symbol_default!(options); end
+
+ # pkg:gem/i18n#lib/i18n/backend/fallbacks.rb:75
+ def resolve_entry(locale, object, subject, options = T.unsafe(nil)); end
+
+ # Overwrites the Base backend translate method so that it will try each
+ # locale given by I18n.fallbacks for the given locale. E.g. for the
+ # locale :"de-DE" it might try the locales :"de-DE", :de and :en
+ # (depends on the fallbacks implementation) until it finds a result with
+ # the given options. If it does not find any result for any of the
+ # locales it will then throw MissingTranslation as usual.
+ #
+ # The default option takes precedence over fallback locales only when
+ # it's a Symbol. When the default contains a String, Proc or Hash
+ # it is evaluated last after all the fallback locales have been tried.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/fallbacks.rb:49
+ def translate(locale, key, options = T.unsafe(nil)); end
+
+ private
+
+ # Overwrite on_fallback to add specified logic when the fallback succeeds.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/fallbacks.rb:122
+ def on_fallback(_original_locale, _fallback_locale, _key, _options); end
+end
+
+# This module contains several helpers to assist flattening translations.
+# You may want to flatten translations for:
+#
+# 1) speed up lookups, as in the Memoize backend;
+# 2) In case you want to store translations in a data store, as in ActiveRecord backend;
+#
+# You can check both backends above for some examples.
+# This module also keeps all links in a hash so they can be properly resolved when flattened.
+#
+# pkg:gem/i18n#lib/i18n/backend/flatten.rb:13
+module I18n::Backend::Flatten
+ # Flatten keys for nested Hashes by chaining up keys:
+ #
+ # >> { "a" => { "b" => { "c" => "d", "e" => "f" }, "g" => "h" }, "i" => "j"}.wind
+ # => { "a.b.c" => "d", "a.b.e" => "f", "a.g" => "h", "i" => "j" }
+ #
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:59
+ def flatten_keys(hash, escape, prev_key = T.unsafe(nil), &block); end
+
+ # Receives a hash of translations (where the key is a locale and
+ # the value is another hash) and return a hash with all
+ # translations flattened.
+ #
+ # Nested hashes are included in the flattened hash just if subtree
+ # is true and Symbols are automatically stored as links.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:74
+ def flatten_translations(locale, data, escape, subtree); end
+
+ # Store flattened links.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:50
+ def links; end
+
+ # Shortcut to I18n::Backend::Flatten.normalize_flat_keys
+ # and then resolve_links.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:44
+ def normalize_flat_keys(locale, key, scope, separator); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:112
+ def escape_default_separator(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:106
+ def find_link(locale, key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:93
+ def resolve_link(locale, key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:89
+ def store_link(locale, key, link); end
+
+ class << self
+ # Receives a string and escape the default separator.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:38
+ def escape_default_separator(key); end
+
+ # normalize_keys the flatten way. This method is significantly faster
+ # and creates way less objects than the one at I18n.normalize_keys.
+ # It also handles escaping the translation keys.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/flatten.rb:20
+ def normalize_flat_keys(locale, key, scope, separator); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/flatten.rb:15
+I18n::Backend::Flatten::FLATTEN_SEPARATOR = T.let(T.unsafe(nil), String)
+
+# pkg:gem/i18n#lib/i18n/backend/flatten.rb:14
+I18n::Backend::Flatten::SEPARATOR_ESCAPE_CHAR = T.let(T.unsafe(nil), String)
+
+# Experimental support for using Gettext po files to store translations.
+#
+# To use this you can simply include the module to the Simple backend - or
+# whatever other backend you are using.
+#
+# I18n::Backend::Simple.include(I18n::Backend::Gettext)
+#
+# Now you should be able to include your Gettext translation (*.po) files to
+# the +I18n.load_path+ so they're loaded to the backend and you can use them as
+# usual:
+#
+# I18n.load_path += Dir["path/to/locales/*.po"]
+#
+# Following the Gettext convention this implementation expects that your
+# translation files are named by their locales. E.g. the file en.po would
+# contain the translations for the English locale.
+#
+# To translate text you must use one of the translate methods provided by
+# I18n::Gettext::Helpers.
+#
+# include I18n::Gettext::Helpers
+# puts _("some string")
+#
+# Without it strings containing periods (".") will not be translated.
+#
+# pkg:gem/i18n#lib/i18n/backend/gettext.rb:33
+module I18n::Backend::Gettext
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/gettext.rb:41
+ def load_po(filename); end
+
+ # pkg:gem/i18n#lib/i18n/backend/gettext.rb:51
+ def normalize(locale, data); end
+
+ # pkg:gem/i18n#lib/i18n/backend/gettext.rb:68
+ def normalize_pluralization(locale, key, value); end
+
+ # pkg:gem/i18n#lib/i18n/backend/gettext.rb:47
+ def parse(filename); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/gettext.rb:34
+class I18n::Backend::Gettext::PoData < ::Hash
+ # pkg:gem/i18n#lib/i18n/backend/gettext.rb:35
+ def set_comment(msgid_or_sym, comment); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:20
+module I18n::Backend::InterpolationCompiler
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:98
+ def interpolate(locale, string, values); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:108
+ def store_translations(locale, data, options = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:114
+ def compile_all_strings_in(data); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:21
+module I18n::Backend::InterpolationCompiler::Compiler
+ extend ::I18n::Backend::InterpolationCompiler::Compiler
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:26
+ def compile_if_an_interpolation(string); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:39
+ def interpolated_str?(str); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:59
+ def compile_interpolation_token(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:49
+ def compiled_interpolation_body(str); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:72
+ def direct_key(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:92
+ def escape_key_sym(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:88
+ def escape_plain_str(str); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:55
+ def handle_interpolation_token(token); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:68
+ def interpolate_key(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:63
+ def interpolate_or_raise_missing(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:80
+ def missing_key(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:76
+ def nil_key(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:84
+ def reserved_key(key); end
+
+ # tokenize("foo %{bar} baz %%{buz}") # => ["foo ", "%{bar}", " baz ", "%%{buz}"]
+ #
+ # pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:45
+ def tokenize(str); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/interpolation_compiler.rb:24
+I18n::Backend::InterpolationCompiler::Compiler::TOKENIZER = T.let(T.unsafe(nil), Regexp)
+
+# This is a basic backend for key value stores. It receives on
+# initialization the store, which should respond to three methods:
+#
+# * store#[](key) - Used to get a value
+# * store#[]=(key, value) - Used to set a value
+# * store#keys - Used to get all keys
+#
+# Since these stores only supports string, all values are converted
+# to JSON before being stored, allowing it to also store booleans,
+# hashes and arrays. However, this store does not support Procs.
+#
+# As the ActiveRecord backend, Symbols are just supported when loading
+# translations from the filesystem or through explicit store translations.
+#
+# Also, avoid calling I18n.available_locales since it's a somehow
+# expensive operation in most stores.
+#
+# == Example
+#
+# To setup I18n to use TokyoCabinet in memory is quite straightforward:
+#
+# require 'rufus/tokyo/cabinet' # gem install rufus-tokyo
+# I18n.backend = I18n::Backend::KeyValue.new(Rufus::Tokyo::Cabinet.new('*'))
+#
+# == Performance
+#
+# You may make this backend even faster by including the Memoize module.
+# However, notice that you should properly clear the cache if you change
+# values directly in the key-store.
+#
+# == Subtrees
+#
+# In most backends, you are allowed to retrieve part of a translation tree:
+#
+# I18n.backend.store_translations :en, :foo => { :bar => :baz }
+# I18n.t "foo" #=> { :bar => :baz }
+#
+# This backend supports this feature by default, but it slows down the storage
+# of new data considerably and makes hard to delete entries. That said, you are
+# allowed to disable the storage of subtrees on initialization:
+#
+# I18n::Backend::KeyValue.new(@store, false)
+#
+# This is useful if you are using a KeyValue backend chained to a Simple backend.
+#
+# pkg:gem/i18n#lib/i18n/backend/key_value.rb:69
+class I18n::Backend::KeyValue
+ include ::I18n::Backend::Flatten
+ include ::I18n::Backend::Transliterator
+ include ::I18n::Backend::Base
+ include ::I18n::Backend::KeyValue::Implementation
+end
+
+# pkg:gem/i18n#lib/i18n/backend/key_value.rb:70
+module I18n::Backend::KeyValue::Implementation
+ include ::I18n::Backend::Flatten
+ include ::I18n::Backend::Transliterator
+ include ::I18n::Backend::Base
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:75
+ def initialize(store, subtrees = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:102
+ def available_locales; end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:79
+ def initialized?; end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:71
+ def store; end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:71
+ def store=(_arg0); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:83
+ def store_translations(locale, data, options = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:124
+ def init_translations; end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:136
+ def lookup(locale, key, scope = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:150
+ def pluralize(locale, entry, count); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:132
+ def subtrees?; end
+
+ # Queries the translations from the key-value store and converts
+ # them into a hash such as the one returned from loading the
+ # haml files
+ #
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:115
+ def translations; end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/key_value.rb:161
+class I18n::Backend::KeyValue::SubtreeProxy
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:162
+ def initialize(master_key, store); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:172
+ def [](key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:168
+ def has_key?(key); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:196
+ def inspect; end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:188
+ def instance_of?(klass); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:183
+ def is_a?(klass); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:186
+ def kind_of?(klass); end
+
+ # pkg:gem/i18n#lib/i18n/backend/key_value.rb:192
+ def nil?; end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:65
+class I18n::Backend::LazyLoadable < ::I18n::Backend::Simple
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:66
+ def initialize(lazy_load: T.unsafe(nil)); end
+
+ # Parse the load path and extract all locales.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:99
+ def available_locales; end
+
+ # Eager loading is not supported in the lazy context.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:90
+ def eager_load!; end
+
+ # Returns whether the current locale is initialized.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:71
+ def initialized?; end
+
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:107
+ def lookup(locale, key, scope = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # Clean up translations and uninitialize all locales.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:80
+ def reload!; end
+
+ protected
+
+ # Load translations from files that belong to the current locale.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:121
+ def init_translations; end
+
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:133
+ def initialized_locales; end
+
+ private
+
+ # Checks if a filename is named in correspondence to the translations it loaded.
+ # The locale extracted from the path must be the single locale loaded in the translations.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:175
+ def assert_file_named_correctly!(file, translations); end
+
+ # Select all files from I18n load path that belong to current locale.
+ # These files must start with the locale identifier (ie. "en", "pt-BR"),
+ # followed by an "_" demarcation to separate proceeding text.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:167
+ def filenames_for_current_locale; end
+
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:139
+ def lazy_load?; end
+
+ # Loads each file supplied and asserts that the file only loads
+ # translations as expected by the name. The method returns a list of
+ # errors corresponding to offending files.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:152
+ def load_translations_and_collect_file_errors(files); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:143
+class I18n::Backend::LazyLoadable::FilenameIncorrect < ::StandardError
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:144
+ def initialize(file, expected_locale, unexpected_locales); end
+end
+
+# Backend that lazy loads translations based on the current locale. This
+# implementation avoids loading all translations up front. Instead, it only
+# loads the translations that belong to the current locale. This offers a
+# performance incentive in local development and test environments for
+# applications with many translations for many different locales. It's
+# particularly useful when the application only refers to a single locales'
+# translations at a time (ex. A Rails workload). The implementation
+# identifies which translation files from the load path belong to the
+# current locale by pattern matching against their path name.
+#
+# Specifically, a translation file is considered to belong to a locale if:
+# a) the filename is in the I18n load path
+# b) the filename ends in a supported extension (ie. .yml, .json, .po, .rb)
+# c) the filename starts with the locale identifier
+# d) the locale identifier and optional proceeding text is separated by an underscore, ie. "_".
+#
+# Examples:
+# Valid files that will be selected by this backend:
+#
+# "files/locales/en_translation.yml" (Selected for locale "en")
+# "files/locales/fr.po" (Selected for locale "fr")
+#
+# Invalid files that won't be selected by this backend:
+#
+# "files/locales/translation-file"
+# "files/locales/en-translation.unsupported"
+# "files/locales/french/translation.yml"
+# "files/locales/fr/translation.yml"
+#
+# The implementation uses this assumption to defer the loading of
+# translation files until the current locale actually requires them.
+#
+# The backend has two working modes: lazy_load and eager_load.
+#
+# Note: This backend should only be enabled in test environments!
+# When the mode is set to false, the backend behaves exactly like the
+# Simple backend, with an additional check that the paths being loaded
+# abide by the format. If paths can't be matched to the format, an error is raised.
+#
+# You can configure lazy loaded backends through the initializer or backends
+# accessor:
+#
+# # In test environments
+#
+# I18n.backend = I18n::Backend::LazyLoadable.new(lazy_load: true)
+#
+# # In other environments, such as production and CI
+#
+# I18n.backend = I18n::Backend::LazyLoadable.new(lazy_load: false) # default
+#
+# pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:55
+class I18n::Backend::LocaleExtractor
+ class << self
+ # pkg:gem/i18n#lib/i18n/backend/lazy_loadable.rb:57
+ def locale_from_path(path); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/memoize.rb:14
+module I18n::Backend::Memoize
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:15
+ def available_locales; end
+
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:29
+ def eager_load!; end
+
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:24
+ def reload!; end
+
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:19
+ def store_translations(locale, data, options = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:37
+ def lookup(locale, key, scope = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:44
+ def memoized_lookup; end
+
+ # pkg:gem/i18n#lib/i18n/backend/memoize.rb:48
+ def reset_memoizations!(locale = T.unsafe(nil)); end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/metadata.rb:21
+module I18n::Backend::Metadata
+ # pkg:gem/i18n#lib/i18n/backend/metadata.rb:52
+ def interpolate(locale, entry, values = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/metadata.rb:57
+ def pluralize(locale, entry, count); end
+
+ # pkg:gem/i18n#lib/i18n/backend/metadata.rb:40
+ def translate(locale, key, options = T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/metadata.rb:63
+ def with_metadata(metadata, &block); end
+
+ class << self
+ # pkg:gem/i18n#lib/i18n/backend/metadata.rb:23
+ def included(base); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/pluralization.rb:16
+module I18n::Backend::Pluralization
+ # Overwrites the Base backend translate method so that it will check the
+ # translation meta data space (:i18n) for a locale specific pluralization
+ # rule and use it to pluralize the given entry. I.e., the library expects
+ # pluralization rules to be stored at I18n.t(:'i18n.plural.rule')
+ #
+ # Pluralization rules are expected to respond to #call(count) and
+ # return a pluralization key. Valid keys depend on the pluralization
+ # rules for the locale, as defined in the CLDR.
+ # As of v41, 6 locale-specific plural categories are defined:
+ # :few, :many, :one, :other, :two, :zero
+ #
+ # n.b., The :one plural category does not imply the number 1.
+ # Instead, :one is a category for any number that behaves like 1 in
+ # that locale. For example, in some locales, :one is used for numbers
+ # that end in "1" (like 1, 21, 151) but that don't end in
+ # 11 (like 11, 111, 10311).
+ # Similar notes apply to the :two, and :zero plural categories.
+ #
+ # If you want to have different strings for the categories of count == 0
+ # (e.g. "I don't have any cars") or count == 1 (e.g. "I have a single car")
+ # use the explicit `"0"` and `"1"` keys.
+ # https://unicode-org.github.io/cldr/ldml/tr35-numbers.html#Explicit_0_1_rules
+ #
+ # pkg:gem/i18n#lib/i18n/backend/pluralization.rb:39
+ def pluralize(locale, entry, count); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/pluralization.rb:81
+ def pluralizer(locale); end
+
+ # pkg:gem/i18n#lib/i18n/backend/pluralization.rb:77
+ def pluralizers; end
+
+ private
+
+ # Normalizes categories of 0.0 and 1.0
+ # and returns the symbolic version
+ #
+ # pkg:gem/i18n#lib/i18n/backend/pluralization.rb:89
+ def symbolic_count(count); end
+end
+
+# A simple backend that reads translations from YAML files and stores them in
+# an in-memory hash. Relies on the Base backend.
+#
+# The implementation is provided by a Implementation module allowing to easily
+# extend Simple backend's behavior by including modules. E.g.:
+#
+# module I18n::Backend::Pluralization
+# def pluralize(*args)
+# # extended pluralization logic
+# super
+# end
+# end
+#
+# I18n::Backend::Simple.include(I18n::Backend::Pluralization)
+#
+# pkg:gem/i18n#lib/i18n/backend/simple.rb:21
+class I18n::Backend::Simple
+ include ::I18n::Backend::Transliterator
+ include ::I18n::Backend::Base
+ include ::I18n::Backend::Simple::Implementation
+end
+
+# pkg:gem/i18n#lib/i18n/backend/simple.rb:22
+module I18n::Backend::Simple::Implementation
+ include ::I18n::Backend::Transliterator
+ include ::I18n::Backend::Base
+
+ # Get available locales from the translations hash
+ #
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:49
+ def available_locales; end
+
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:64
+ def eager_load!; end
+
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:28
+ def initialized?; end
+
+ # Clean up translations hash and set initialized to false on reload!
+ #
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:58
+ def reload!; end
+
+ # Stores translations for the given locale in memory.
+ # This uses a deep merge for the translations hash, so existing
+ # translations will be overwritten by new ones only at the deepest
+ # level of the hash.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:36
+ def store_translations(locale, data, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:69
+ def translations(do_init: T.unsafe(nil)); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:83
+ def init_translations; end
+
+ # Looks up a translation from the translations hash. Returns nil if
+ # either key is nil, or locale, scope or key do not exist as a key in the
+ # nested translations hash. Splits keys or scopes containing dots
+ # into multiple keys, i.e. currency.format is regarded the same as
+ # %w(currency format) .
+ #
+ # pkg:gem/i18n#lib/i18n/backend/simple.rb:93
+ def lookup(locale, key, scope = T.unsafe(nil), options = T.unsafe(nil)); end
+end
+
+# Mutex to ensure that concurrent translations loading will be thread-safe
+#
+# pkg:gem/i18n#lib/i18n/backend/simple.rb:26
+I18n::Backend::Simple::Implementation::MUTEX = T.let(T.unsafe(nil), Thread::Mutex)
+
+# pkg:gem/i18n#lib/i18n/backend/transliterator.rb:6
+module I18n::Backend::Transliterator
+ # Given a locale and a UTF-8 string, return the locale's ASCII
+ # approximation for the string.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:11
+ def transliterate(locale, string, replacement = T.unsafe(nil)); end
+
+ class << self
+ # Get a transliterator instance.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:19
+ def get(rule = T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/transliterator.rb:7
+I18n::Backend::Transliterator::DEFAULT_REPLACEMENT_CHAR = T.let(T.unsafe(nil), String)
+
+# A transliterator which accepts a Hash of characters as its translation
+# rule.
+#
+# pkg:gem/i18n#lib/i18n/backend/transliterator.rb:42
+class I18n::Backend::Transliterator::HashTransliterator
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:75
+ def initialize(rule = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:81
+ def transliterate(string, replacement = T.unsafe(nil)); end
+
+ private
+
+ # Add transliteration rules to the approximations hash.
+ #
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:101
+ def add(hash); end
+
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:94
+ def add_default_approximations; end
+
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:90
+ def approximations; end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/transliterator.rb:43
+I18n::Backend::Transliterator::HashTransliterator::DEFAULT_APPROXIMATIONS = T.let(T.unsafe(nil), Hash)
+
+# A transliterator which accepts a Proc as its transliteration rule.
+#
+# pkg:gem/i18n#lib/i18n/backend/transliterator.rb:30
+class I18n::Backend::Transliterator::ProcTransliterator
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:31
+ def initialize(rule); end
+
+ # pkg:gem/i18n#lib/i18n/backend/transliterator.rb:35
+ def transliterate(string, replacement = T.unsafe(nil)); end
+end
+
+# pkg:gem/i18n#lib/i18n.rb:55
+module I18n::Base
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def available_locales; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def available_locales=(value); end
+
+ # pkg:gem/i18n#lib/i18n.rb:416
+ def available_locales_initialized?; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def backend; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def backend=(value); end
+
+ # Gets I18n configuration object.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:57
+ def config; end
+
+ # Sets I18n configuration object.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:87
+ def config=(value); end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def default_locale; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def default_locale=(value); end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def default_separator; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def default_separator=(value); end
+
+ # Tells the backend to load translations now. Used in situations like the
+ # Rails production environment. Backends can implement whatever strategy
+ # is useful.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:121
+ def eager_load!; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def enforce_available_locales; end
+
+ # Raises an InvalidLocale exception when the passed locale is not available.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:410
+ def enforce_available_locales!(locale); end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def enforce_available_locales=(value); end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def exception_handler; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def exception_handler=(value); end
+
+ # Returns true if a translation exists for a given key, otherwise returns false.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:295
+ def exists?(key, _locale = T.unsafe(nil), locale: T.unsafe(nil), **options); end
+
+ # Returns an array of interpolation keys for the given translation key
+ #
+ # *Examples*
+ #
+ # Suppose we have the following:
+ # I18n.t 'example.zero' == 'Zero interpolations'
+ # I18n.t 'example.one' == 'One interpolation %{foo}'
+ # I18n.t 'example.two' == 'Two interpolations %{foo} %{bar}'
+ # I18n.t 'example.three' == ['One %{foo}', 'Two %{bar}', 'Three %{baz}']
+ # I18n.t 'example.one', locale: :other == 'One interpolation %{baz}'
+ #
+ # Then we can expect the following results:
+ # I18n.interpolation_keys('example.zero') #=> []
+ # I18n.interpolation_keys('example.one') #=> ['foo']
+ # I18n.interpolation_keys('example.two') #=> ['foo', 'bar']
+ # I18n.interpolation_keys('example.three') #=> ['foo', 'bar', 'baz']
+ # I18n.interpolation_keys('one', scope: 'example', locale: :other) #=> ['baz']
+ # I18n.interpolation_keys('does-not-exist') #=> []
+ # I18n.interpolation_keys('example') #=> []
+ #
+ # pkg:gem/i18n#lib/i18n.rb:284
+ def interpolation_keys(key, **options); end
+
+ # pkg:gem/i18n#lib/i18n.rb:373
+ def l(object, locale: T.unsafe(nil), format: T.unsafe(nil), **options); end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def load_path; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def load_path=(value); end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def locale; end
+
+ # pkg:gem/i18n#lib/i18n.rb:99
+ def locale=(value); end
+
+ # Returns true when the passed locale, which can be either a String or a
+ # Symbol, is in the list of available locales. Returns false otherwise.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:405
+ def locale_available?(locale); end
+
+ # Localizes certain objects, such as dates and numbers to local formatting.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:365
+ def localize(object, locale: T.unsafe(nil), format: T.unsafe(nil), **options); end
+
+ # Merges the given locale, key and scope into a single array of keys.
+ # Splits keys that contain dots into multiple keys. Makes sure all
+ # keys are Symbols.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:393
+ def normalize_keys(locale, key, scope, separator = T.unsafe(nil)); end
+
+ # Tells the backend to reload translations. Used in situations like the
+ # Rails development environment. Backends can implement whatever strategy
+ # is useful.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:113
+ def reload!; end
+
+ # pkg:gem/i18n#lib/i18n.rb:256
+ def t(key = T.unsafe(nil), throw: T.unsafe(nil), raise: T.unsafe(nil), locale: T.unsafe(nil), **options); end
+
+ # pkg:gem/i18n#lib/i18n.rb:263
+ def t!(key, **options); end
+
+ # Translates, pluralizes and interpolates a given key using a given locale,
+ # scope, and default, as well as interpolation values.
+ #
+ # *LOOKUP*
+ #
+ # Translation data is organized as a nested hash using the upper-level keys
+ # as namespaces. E.g. , ActionView ships with the translation:
+ # :date => {:formats => {:short => "%b %d"}} .
+ #
+ # Translations can be looked up at any level of this hash using the key argument
+ # and the scope option. E.g. , in this example I18n.t :date
+ # returns the whole translations hash {:formats => {:short => "%b %d"}} .
+ #
+ # Key can be either a single key or a dot-separated key (both Strings and Symbols
+ # work). E.g. , the short format can be looked up using both:
+ # I18n.t 'date.formats.short'
+ # I18n.t :'date.formats.short'
+ #
+ # Scope can be either a single key, a dot-separated key or an array of keys
+ # or dot-separated keys. Keys and scopes can be combined freely. So these
+ # examples will all look up the same short date format:
+ # I18n.t 'date.formats.short'
+ # I18n.t 'formats.short', :scope => 'date'
+ # I18n.t 'short', :scope => 'date.formats'
+ # I18n.t 'short', :scope => %w(date formats)
+ #
+ # *INTERPOLATION*
+ #
+ # Translations can contain interpolation variables which will be replaced by
+ # values passed to #translate as part of the options hash, with the keys matching
+ # the interpolation variable names.
+ #
+ # E.g. , with a translation :foo => "foo %{bar}" the option
+ # value for the key +bar+ will be interpolated into the translation:
+ # I18n.t :foo, :bar => 'baz' # => 'foo baz'
+ #
+ # *PLURALIZATION*
+ #
+ # Translation data can contain pluralized translations. Pluralized translations
+ # are arrays of singular/plural versions of translations like ['Foo', 'Foos'] .
+ #
+ # Note that I18n::Backend::Simple only supports an algorithm for English
+ # pluralization rules. Other algorithms can be supported by custom backends.
+ #
+ # This returns the singular version of a pluralized translation:
+ # I18n.t :foo, :count => 1 # => 'Foo'
+ #
+ # These both return the plural version of a pluralized translation:
+ # I18n.t :foo, :count => 0 # => 'Foos'
+ # I18n.t :foo, :count => 2 # => 'Foos'
+ #
+ # The :count option can be used both for pluralization and interpolation.
+ # E.g. , with the translation
+ # :foo => ['%{count} foo', '%{count} foos'] , count will
+ # be interpolated to the pluralized translation:
+ # I18n.t :foo, :count => 1 # => '1 foo'
+ #
+ # *DEFAULTS*
+ #
+ # This returns the translation for :foo or default if no translation was found:
+ # I18n.t :foo, :default => 'default'
+ #
+ # This returns the translation for :foo or the translation for :bar if no
+ # translation for :foo was found:
+ # I18n.t :foo, :default => :bar
+ #
+ # Returns the translation for :foo or the translation for :bar
+ # or default if no translations for :foo and :bar were found.
+ # I18n.t :foo, :default => [:bar, 'default']
+ #
+ # BULK LOOKUP
+ #
+ # This returns an array with the translations for :foo and :bar .
+ # I18n.t [:foo, :bar]
+ #
+ # Can be used with dot-separated nested keys:
+ # I18n.t [:'baz.foo', :'baz.bar']
+ #
+ # Which is the same as using a scope option:
+ # I18n.t [:foo, :bar], :scope => :baz
+ #
+ # *LAMBDAS*
+ #
+ # Both translations and defaults can be given as Ruby lambdas. Lambdas will be
+ # called and passed the key and options.
+ #
+ # E.g. assuming the key :salutation resolves to:
+ # lambda { |key, options| options[:gender] == 'm' ? "Mr. #{options[:name]}" : "Mrs. #{options[:name]}" }
+ #
+ # Then I18n.t(:salutation, :gender => 'w', :name => 'Smith') will result in "Mrs. Smith".
+ #
+ # Note that the string returned by lambda will go through string interpolation too,
+ # so the following lambda would give the same result:
+ # lambda { |key, options| options[:gender] == 'm' ? "Mr. %{name}" : "Mrs. %{name}" }
+ #
+ # It is recommended to use/implement lambdas in an "idempotent" way. E.g. when
+ # a cache layer is put in front of I18n.translate it will generate a cache key
+ # from the argument values passed to #translate. Therefore your lambdas should
+ # always return the same translations/values per unique combination of argument
+ # values.
+ #
+ # Ruby 2.7+ keyword arguments warning
+ #
+ # This method uses keyword arguments.
+ # There is a breaking change in ruby that produces warning with ruby 2.7 and won't work as expected with ruby 3.0
+ # The "hash" parameter must be passed as keyword argument.
+ #
+ # Good:
+ # I18n.t(:salutation, :gender => 'w', :name => 'Smith')
+ # I18n.t(:salutation, **{ :gender => 'w', :name => 'Smith' })
+ # I18n.t(:salutation, **any_hash)
+ #
+ # Bad:
+ # I18n.t(:salutation, { :gender => 'w', :name => 'Smith' })
+ # I18n.t(:salutation, any_hash)
+ #
+ # pkg:gem/i18n#lib/i18n.rb:241
+ def translate(key = T.unsafe(nil), throw: T.unsafe(nil), raise: T.unsafe(nil), locale: T.unsafe(nil), **options); end
+
+ # Wrapper for translate that adds :raise => true . With
+ # this option, if no translation is found, it will raise I18n::MissingTranslationData
+ #
+ # pkg:gem/i18n#lib/i18n.rb:260
+ def translate!(key, **options); end
+
+ # Transliterates UTF-8 characters to ASCII. By default this method will
+ # transliterate only Latin strings to an ASCII approximation:
+ #
+ # I18n.transliterate("Ærøskøbing")
+ # # => "AEroskobing"
+ #
+ # I18n.transliterate("日本語")
+ # # => "???"
+ #
+ # It's also possible to add support for per-locale transliterations. I18n
+ # expects transliteration rules to be stored at
+ # i18n.transliterate.rule .
+ #
+ # Transliteration rules can either be a Hash or a Proc. Procs must accept a
+ # single string argument. Hash rules inherit the default transliteration
+ # rules, while Procs do not.
+ #
+ # *Examples*
+ #
+ # Setting a Hash in .yml:
+ #
+ # i18n:
+ # transliterate:
+ # rule:
+ # ü: "ue"
+ # ö: "oe"
+ #
+ # Setting a Hash using Ruby:
+ #
+ # store_translations(:de, i18n: {
+ # transliterate: {
+ # rule: {
+ # 'ü' => 'ue',
+ # 'ö' => 'oe'
+ # }
+ # }
+ # })
+ #
+ # Setting a Proc:
+ #
+ # translit = lambda {|string| MyTransliterator.transliterate(string) }
+ # store_translations(:xx, :i18n => {:transliterate => {:rule => translit})
+ #
+ # Transliterating strings:
+ #
+ # I18n.locale = :en
+ # I18n.transliterate("Jürgen") # => "Jurgen"
+ # I18n.locale = :de
+ # I18n.transliterate("Jürgen") # => "Juergen"
+ # I18n.transliterate("Jürgen", :locale => :en) # => "Jurgen"
+ # I18n.transliterate("Jürgen", :locale => :de) # => "Juergen"
+ #
+ # pkg:gem/i18n#lib/i18n.rb:354
+ def transliterate(key, throw: T.unsafe(nil), raise: T.unsafe(nil), locale: T.unsafe(nil), replacement: T.unsafe(nil), **options); end
+
+ # Executes block with given I18n.locale set.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:376
+ def with_locale(tmp_locale = T.unsafe(nil)); end
+
+ # Gets a mutable I18n configuration object.
+ #
+ # pkg:gem/i18n#lib/i18n.rb:73
+ def writable_config; end
+
+ private
+
+ # Any exceptions thrown in translate will be sent to the @@exception_handler
+ # which can be a Symbol, a Proc or any other Object unless they're forced to
+ # be raised or thrown (MissingTranslation).
+ #
+ # If exception_handler is a Symbol then it will simply be sent to I18n as
+ # a method call. A Proc will simply be called. In any other case the
+ # method #call will be called on the exception_handler object.
+ #
+ # Examples:
+ #
+ # I18n.exception_handler = :custom_exception_handler # this is the default
+ # I18n.custom_exception_handler(exception, locale, key, options) # will be called like this
+ #
+ # I18n.exception_handler = lambda { |*args| ... } # a lambda
+ # I18n.exception_handler.call(exception, locale, key, options) # will be called like this
+ #
+ # I18n.exception_handler = I18nExceptionHandler.new # an object
+ # I18n.exception_handler.call(exception, locale, key, options) # will be called like this
+ #
+ # pkg:gem/i18n#lib/i18n.rb:452
+ def handle_exception(handling, exception, locale, key, options); end
+
+ # pkg:gem/i18n#lib/i18n.rb:494
+ def interpolation_keys_from_translation(translation); end
+
+ # pkg:gem/i18n#lib/i18n.rb:470
+ def normalize_key(key, separator); end
+
+ # pkg:gem/i18n#lib/i18n.rb:422
+ def translate_key(key, throw, raise, locale, backend, options); end
+end
+
+# pkg:gem/i18n#lib/i18n/config.rb:6
+class I18n::Config
+ # pkg:gem/i18n#lib/i18n/config.rb:13
+ def initialize; end
+
+ # Returns an array of locales for which translations are available.
+ # Unless you explicitly set these through I18n.available_locales=
+ # the call will be delegated to the backend.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:77
+ def available_locales; end
+
+ # Sets the available locales.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:91
+ def available_locales=(locales); end
+
+ # Returns true if the available_locales have been initialized
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:98
+ def available_locales_initialized?; end
+
+ # Caches the available locales list as both strings and symbols in a Set, so
+ # that we can have faster lookups to do the available locales enforce check.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:84
+ def available_locales_set; end
+
+ # Returns the current backend. Defaults to +Backend::Simple+.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:54
+ def backend; end
+
+ # Sets the current backend. Used to set a custom backend.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:59
+ def backend=(backend); end
+
+ # Clears the available locales set so it can be recomputed again after I18n
+ # gets reloaded.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:104
+ def clear_available_locales_set; end
+
+ # Returns the current default locale. Defaults to :'en'
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:64
+ def default_locale; end
+
+ # Sets the current default locale. Used to set a custom default locale.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:69
+ def default_locale=(locale); end
+
+ # Returns the current default scope separator. Defaults to '.'
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:109
+ def default_separator; end
+
+ # Sets the current default scope separator.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:114
+ def default_separator=(separator); end
+
+ # pkg:gem/i18n#lib/i18n/config.rb:175
+ def enforce_available_locales; end
+
+ # pkg:gem/i18n#lib/i18n/config.rb:179
+ def enforce_available_locales=(enforce_available_locales); end
+
+ # Returns the current exception handler. Defaults to an instance of
+ # I18n::ExceptionHandler.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:120
+ def exception_handler; end
+
+ # Sets the exception handler.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:125
+ def exception_handler=(exception_handler); end
+
+ # Returns the current interpolation patterns. Defaults to
+ # I18n::DEFAULT_INTERPOLATION_PATTERNS.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:185
+ def interpolation_patterns; end
+
+ # Sets the current interpolation patterns. Used to set a interpolation
+ # patterns.
+ #
+ # E.g. using {{}} as a placeholder like "{{hello}}, world!":
+ #
+ # I18n.config.interpolation_patterns << /\{\{(\w+)\}\}/
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:195
+ def interpolation_patterns=(interpolation_patterns); end
+
+ # Allow clients to register paths providing translation data sources. The
+ # backend defines acceptable sources.
+ #
+ # E.g. the provided SimpleBackend accepts a list of paths to translation
+ # files which are either named *.rb and contain plain Ruby Hashes or are
+ # named *.yml and contain YAML data. So for the SimpleBackend clients may
+ # register translation files like this:
+ # I18n.load_path << 'path/to/locale/en.yml'
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:160
+ def load_path; end
+
+ # Sets the load path instance. Custom implementations are expected to
+ # behave like a Ruby Array.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:166
+ def load_path=(load_path); end
+
+ # The only configuration value that is not global and scoped to thread is :locale.
+ # It defaults to the default_locale.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:9
+ def locale; end
+
+ # Sets the current locale pseudo-globally, i.e. in the Thread.current or Fiber local hash.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:48
+ def locale=(locale); end
+
+ # Returns the current handler for situations when interpolation argument
+ # is missing. MissingInterpolationArgument will be raised by default.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:131
+ def missing_interpolation_argument_handler; end
+
+ # Sets the missing interpolation argument handler. It can be any
+ # object that responds to #call. The arguments that will be passed to #call
+ # are the same as for MissingInterpolationArgument initializer. Use +Proc.new+
+ # if you don't care about arity.
+ #
+ # == Example:
+ # You can suppress raising an exception and return string instead:
+ #
+ # I18n.config.missing_interpolation_argument_handler = Proc.new do |key|
+ # "#{key} is missing"
+ # end
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:148
+ def missing_interpolation_argument_handler=(exception_handler); end
+
+ # pkg:gem/i18n#lib/i18n/config.rb:17
+ def owned_by?(fiber); end
+
+ # pkg:gem/i18n#lib/i18n/config.rb:21
+ def owner=(fiber); end
+
+ # Sets this configuration as the current one for the active execution context.
+ # The stored configuration is frozen to avoid sharing mutable state between fibers.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:40
+ def set!; end
+
+ # Returns a copied configuration with the provided attributes set.
+ #
+ # pkg:gem/i18n#lib/i18n/config.rb:30
+ def with(**attrs); end
+
+ private
+
+ # pkg:gem/i18n#lib/i18n/config.rb:25
+ def initialize_copy(other); end
+end
+
+# pkg:gem/i18n#lib/i18n/interpolate/ruby.rb:7
+I18n::DEFAULT_INTERPOLATION_PATTERNS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:16
+class I18n::Disabled < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:17
+ def initialize(method); end
+end
+
+# pkg:gem/i18n#lib/i18n.rb:36
+I18n::EMPTY_HASH = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:4
+class I18n::ExceptionHandler
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:5
+ def call(exception, _locale, _key, _options); end
+end
+
+# pkg:gem/i18n#lib/i18n/gettext.rb:4
+module I18n::Gettext
+ class << self
+ # pkg:gem/i18n#lib/i18n/gettext.rb:21
+ def extract_scope(msgid, separator); end
+
+ # returns an array of plural keys for the given locale or the whole hash
+ # of locale mappings to plural keys so that we can convert from gettext's
+ # integer-index based style
+ # TODO move this information to the pluralization module
+ #
+ # pkg:gem/i18n#lib/i18n/gettext.rb:17
+ def plural_keys(*args); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/gettext.rb:6
+I18n::Gettext::CONTEXT_SEPARATOR = T.let(T.unsafe(nil), String)
+
+# Implements classical Gettext style accessors. To use this include the
+# module to the global namespace or wherever you want to use it.
+#
+# include I18n::Gettext::Helpers
+#
+# pkg:gem/i18n#lib/i18n/gettext/helpers.rb:11
+module I18n::Gettext::Helpers
+ # Makes dynamic translation messages readable for the gettext parser.
+ # _(fruit) cannot be understood by the gettext parser. To help the parser find all your translations,
+ # you can add fruit = N_("Apple") which does not translate, but tells the parser: "Apple" needs translation.
+ # * msgid: the message id.
+ # * Returns: msgid.
+ #
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:17
+ def N_(msgsid); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:24
+ def _(msgid, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:21
+ def gettext(msgid, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:41
+ def n_(msgid, msgid_plural, n = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:38
+ def ngettext(msgid, msgid_plural, n = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:72
+ def np_(msgctxt, msgid, msgid_plural, n = T.unsafe(nil)); end
+
+ # Method signatures:
+ # npgettext('Fruits', 'apple', 'apples', 2)
+ # npgettext('Fruits', ['apple', 'apples'], 2)
+ #
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:61
+ def npgettext(msgctxt, msgid, msgid_plural, n = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:56
+ def ns_(msgid, msgid_plural, n = T.unsafe(nil), separator = T.unsafe(nil)); end
+
+ # Method signatures:
+ # nsgettext('Fruits|apple', 'apples', 2)
+ # nsgettext(['Fruits|apple', 'apples'], 2)
+ #
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:46
+ def nsgettext(msgid, msgid_plural, n = T.unsafe(nil), separator = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:36
+ def p_(msgctxt, msgid); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:32
+ def pgettext(msgctxt, msgid); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:30
+ def s_(msgid, separator = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/gettext/helpers.rb:26
+ def sgettext(msgid, separator = T.unsafe(nil)); end
+end
+
+# pkg:gem/i18n#lib/i18n/gettext.rb:5
+I18n::Gettext::PLURAL_SEPARATOR = T.let(T.unsafe(nil), String)
+
+# pkg:gem/i18n#lib/i18n/interpolate/ruby.rb:12
+I18n::INTERPOLATION_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/i18n#lib/i18n/interpolate/ruby.rb:15
+I18n::INTERPOLATION_PATTERNS_CACHE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:132
+class I18n::InvalidFilenames < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:134
+ def initialize(file_errors); end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:133
+I18n::InvalidFilenames::NUMBER_OF_ERRORS_SHOWN = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:30
+class I18n::InvalidLocale < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:32
+ def initialize(locale); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:31
+ def locale; end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:38
+class I18n::InvalidLocaleData < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:40
+ def initialize(filename, exception_message); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:39
+ def filename; end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:90
+class I18n::InvalidPluralizationData < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:92
+ def initialize(entry, count, key); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:91
+ def count; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:91
+ def entry; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:91
+ def key; end
+end
+
+# pkg:gem/i18n#lib/i18n/backend/key_value.rb:21
+I18n::JSON = ActiveSupport::JSON
+
+# pkg:gem/i18n#lib/i18n/locale.rb:4
+module I18n::Locale; end
+
+# pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:48
+class I18n::Locale::Fallbacks < ::Hash
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:49
+ def initialize(*mappings); end
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:60
+ def [](locale); end
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:58
+ def defaults; end
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:55
+ def defaults=(defaults); end
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:82
+ def empty?; end
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:86
+ def inspect; end
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:67
+ def map(*args, &block); end
+
+ protected
+
+ # pkg:gem/i18n#lib/i18n/locale/fallbacks.rb:92
+ def compute(tags, include_defaults = T.unsafe(nil), exclude = T.unsafe(nil)); end
+end
+
+# pkg:gem/i18n#lib/i18n/locale/tag.rb:5
+module I18n::Locale::Tag
+ class << self
+ # Returns the current locale tag implementation. Defaults to +I18n::Locale::Tag::Simple+.
+ #
+ # pkg:gem/i18n#lib/i18n/locale/tag.rb:12
+ def implementation; end
+
+ # Sets the current locale tag implementation. Use this to set a different locale tag implementation.
+ #
+ # pkg:gem/i18n#lib/i18n/locale/tag.rb:17
+ def implementation=(implementation); end
+
+ # Factory method for locale tags. Delegates to the current locale tag implementation.
+ #
+ # pkg:gem/i18n#lib/i18n/locale/tag.rb:22
+ def tag(tag); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/locale/tag/parents.rb:4
+module I18n::Locale::Tag::Parents
+ # pkg:gem/i18n#lib/i18n/locale/tag/parents.rb:5
+ def parent; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/parents.rb:18
+ def parents; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/parents.rb:14
+ def self_and_parents; end
+end
+
+# pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:12
+I18n::Locale::Tag::RFC4646_FORMATS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:11
+I18n::Locale::Tag::RFC4646_SUBTAGS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:14
+class I18n::Locale::Tag::Rfc4646 < ::Struct
+ include ::I18n::Locale::Tag::Parents
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:35
+ def language; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:35
+ def region; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:35
+ def script; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:46
+ def to_a; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:42
+ def to_s; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:38
+ def to_sym; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:35
+ def variant; end
+
+ class << self
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:23
+ def parser; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:27
+ def parser=(parser); end
+
+ # Parses the given tag and returns a Tag instance if it is valid.
+ # Returns false if the given tag is not valid according to RFC 4646.
+ #
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:18
+ def tag(tag); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:50
+module I18n::Locale::Tag::Rfc4646::Parser
+ class << self
+ # pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:63
+ def match(tag); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/locale/tag/rfc4646.rb:51
+I18n::Locale::Tag::Rfc4646::Parser::PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:6
+class I18n::Locale::Tag::Simple
+ include ::I18n::Locale::Tag::Parents
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:17
+ def initialize(*tag); end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:21
+ def subtags; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:15
+ def tag; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:33
+ def to_a; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:29
+ def to_s; end
+
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:25
+ def to_sym; end
+
+ class << self
+ # pkg:gem/i18n#lib/i18n/locale/tag/simple.rb:8
+ def tag(tag); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/middleware.rb:4
+class I18n::Middleware
+ # pkg:gem/i18n#lib/i18n/middleware.rb:6
+ def initialize(app); end
+
+ # pkg:gem/i18n#lib/i18n/middleware.rb:10
+ def call(env); end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:98
+class I18n::MissingInterpolationArgument < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:100
+ def initialize(key, values, string); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:99
+ def key; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:99
+ def string; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:99
+ def values; end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:46
+class I18n::MissingTranslation < ::I18n::ArgumentError
+ include ::I18n::MissingTranslation::Base
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:47
+module I18n::MissingTranslation::Base
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:52
+ def initialize(locale, key, options = T.unsafe(nil)); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:50
+ def key; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:57
+ def keys; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:50
+ def locale; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:63
+ def message; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:72
+ def normalized_option(key); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:50
+ def options; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:78
+ def to_exception; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:76
+ def to_s; end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:48
+I18n::MissingTranslation::Base::PERMITTED_KEYS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:86
+class I18n::MissingTranslationData < ::I18n::ArgumentError
+ include ::I18n::MissingTranslation::Base
+end
+
+# pkg:gem/i18n#lib/i18n.rb:19
+I18n::RESERVED_KEYS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:106
+class I18n::ReservedInterpolationKey < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:108
+ def initialize(key, string); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:107
+ def key; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:107
+ def string; end
+end
+
+# pkg:gem/i18n#lib/i18n/tests.rb:4
+module I18n::Tests; end
+
+# pkg:gem/i18n#lib/i18n/tests/localization.rb:3
+module I18n::Tests::Localization
+ class << self
+ # pkg:gem/i18n#lib/i18n/tests/localization.rb:9
+ def included(base); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:114
+class I18n::UnknownFileType < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:116
+ def initialize(type, filename); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:115
+ def filename; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:115
+ def type; end
+end
+
+# pkg:gem/i18n#lib/i18n/exceptions.rb:122
+class I18n::UnsupportedMethod < ::I18n::ArgumentError
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:124
+ def initialize(method, backend_klass, msg); end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:123
+ def backend_klass; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:123
+ def method; end
+
+ # pkg:gem/i18n#lib/i18n/exceptions.rb:123
+ def msg; end
+end
+
+# pkg:gem/i18n#lib/i18n/utils.rb:4
+module I18n::Utils
+ class << self
+ # pkg:gem/i18n#lib/i18n/utils.rb:18
+ def deep_merge(hash, other_hash, &block); end
+
+ # pkg:gem/i18n#lib/i18n/utils.rb:22
+ def deep_merge!(hash, other_hash, &block); end
+
+ # pkg:gem/i18n#lib/i18n/utils.rb:34
+ def deep_symbolize_keys(hash); end
+
+ # pkg:gem/i18n#lib/i18n/utils.rb:7
+ def except(hash, *keys); end
+
+ private
+
+ # pkg:gem/i18n#lib/i18n/utils.rb:43
+ def deep_symbolize_keys_in_object(value); end
+ end
+end
+
+# pkg:gem/i18n#lib/i18n/version.rb:4
+I18n::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/io-console@0.8.2.rbi b/sorbet/rbi/gems/io-console@0.8.2.rbi
new file mode 100644
index 0000000..73616ab
--- /dev/null
+++ b/sorbet/rbi/gems/io-console@0.8.2.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `io-console` gem.
+# Please instead update this file by running `bin/tapioca gem io-console`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/language_server-protocol@3.17.0.6.rbi b/sorbet/rbi/gems/language_server-protocol@3.17.0.6.rbi
new file mode 100644
index 0000000..5f91e74
--- /dev/null
+++ b/sorbet/rbi/gems/language_server-protocol@3.17.0.6.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `language_server-protocol` gem.
+# Please instead update this file by running `bin/tapioca gem language_server-protocol`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/lint_roller@1.1.0.rbi b/sorbet/rbi/gems/lint_roller@1.1.0.rbi
new file mode 100644
index 0000000..b6e9bd4
--- /dev/null
+++ b/sorbet/rbi/gems/lint_roller@1.1.0.rbi
@@ -0,0 +1,189 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `lint_roller` gem.
+# Please instead update this file by running `bin/tapioca gem lint_roller`.
+
+
+# pkg:gem/lint_roller#lib/lint_roller/context.rb:1
+module LintRoller; end
+
+# pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+class LintRoller::About < ::Struct
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def description; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def description=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def homepage; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def homepage=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def name; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def name=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def version; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def version=(_); end
+
+ class << self
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def [](*_arg0); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def inspect; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def keyword_init?; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def members; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/about.rb:2
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+class LintRoller::Context < ::Struct
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def engine; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def engine=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def engine_version; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def engine_version=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def rule_format; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def rule_format=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def runner; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def runner=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def runner_version; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def runner_version=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def target_ruby_version; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def target_ruby_version=(_); end
+
+ class << self
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def [](*_arg0); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def inspect; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def keyword_init?; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def members; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/context.rb:2
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/lint_roller#lib/lint_roller/error.rb:2
+class LintRoller::Error < ::StandardError; end
+
+# pkg:gem/lint_roller#lib/lint_roller/plugin.rb:2
+class LintRoller::Plugin
+ # `config' is a Hash of options passed to the plugin by the user
+ #
+ # pkg:gem/lint_roller#lib/lint_roller/plugin.rb:4
+ def initialize(config = T.unsafe(nil)); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/plugin.rb:8
+ def about; end
+
+ # `context' is an instance of LintRoller::Context provided by the runner
+ #
+ # pkg:gem/lint_roller#lib/lint_roller/plugin.rb:18
+ def rules(context); end
+
+ # `context' is an instance of LintRoller::Context provided by the runner
+ #
+ # pkg:gem/lint_roller#lib/lint_roller/plugin.rb:13
+ def supported?(context); end
+end
+
+# pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+class LintRoller::Rules < ::Struct
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def config_format; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def config_format=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def error; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def error=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def type; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def type=(_); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def value; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def value=(_); end
+
+ class << self
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def [](*_arg0); end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def inspect; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def keyword_init?; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def members; end
+
+ # pkg:gem/lint_roller#lib/lint_roller/rules.rb:2
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/lint_roller#lib/lint_roller/support/merges_upstream_metadata.rb:2
+module LintRoller::Support; end
+
+# pkg:gem/lint_roller#lib/lint_roller/support/merges_upstream_metadata.rb:3
+class LintRoller::Support::MergesUpstreamMetadata
+ # pkg:gem/lint_roller#lib/lint_roller/support/merges_upstream_metadata.rb:4
+ def merge(plugin_yaml, upstream_yaml); end
+end
+
+# pkg:gem/lint_roller#lib/lint_roller/version.rb:2
+LintRoller::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/loofah@2.25.2.rbi b/sorbet/rbi/gems/loofah@2.25.2.rbi
new file mode 100644
index 0000000..35eec9f
--- /dev/null
+++ b/sorbet/rbi/gems/loofah@2.25.2.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `loofah` gem.
+# Please instead update this file by running `bin/tapioca gem loofah`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/manual.rbi b/sorbet/rbi/gems/manual.rbi
deleted file mode 100644
index c81088e..0000000
--- a/sorbet/rbi/gems/manual.rbi
+++ /dev/null
@@ -1,4 +0,0 @@
-class Pathname
- def glob(glob)
- end
-end
diff --git a/sorbet/rbi/gems/method_source@1.1.0.rbi b/sorbet/rbi/gems/method_source@1.1.0.rbi
new file mode 100644
index 0000000..feaff62
--- /dev/null
+++ b/sorbet/rbi/gems/method_source@1.1.0.rbi
@@ -0,0 +1,293 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `method_source` gem.
+# Please instead update this file by running `bin/tapioca gem method_source`.
+
+
+# pkg:gem/method_source#lib/method_source.rb:163
+class Method
+ include ::MethodSource::SourceLocation::MethodExtensions
+ include ::MethodSource::MethodExtensions
+end
+
+# pkg:gem/method_source#lib/method_source/version.rb:1
+module MethodSource
+ extend ::MethodSource::CodeHelpers
+
+ class << self
+ # Clear cache.
+ #
+ # pkg:gem/method_source#lib/method_source.rb:59
+ def clear_cache; end
+
+ # Helper method responsible for opening source file and buffering up
+ # the comments for a specified method. Defined here to avoid polluting
+ # `Method` class.
+ # @param [Array] source_location The array returned by Method#source_location
+ # @param [String] method_name
+ # @return [String] The comments up to the point of the method.
+ #
+ # pkg:gem/method_source#lib/method_source.rb:38
+ def comment_helper(source_location, name = T.unsafe(nil)); end
+
+ # @deprecated — use MethodSource::CodeHelpers#expression_at
+ #
+ # pkg:gem/method_source#lib/method_source.rb:71
+ def extract_code(source_location); end
+
+ # Load a memoized copy of the lines in a file.
+ #
+ # @param [String] file_name
+ # @param [String] method_name
+ # @return [Array] the contents of the file
+ # @raise [SourceNotFoundError]
+ #
+ # pkg:gem/method_source#lib/method_source.rb:51
+ def lines_for(file_name, name = T.unsafe(nil)); end
+
+ # Helper method responsible for extracting method body.
+ # Defined here to avoid polluting `Method` class.
+ # @param [Array] source_location The array returned by Method#source_location
+ # @param [String] method_name
+ # @return [String] The method body
+ #
+ # pkg:gem/method_source#lib/method_source.rb:23
+ def source_helper(source_location, name = T.unsafe(nil)); end
+
+ # @deprecated — use MethodSource::CodeHelpers#complete_expression?
+ #
+ # pkg:gem/method_source#lib/method_source.rb:64
+ def valid_expression?(str); end
+ end
+end
+
+# pkg:gem/method_source#lib/method_source/code_helpers.rb:3
+module MethodSource::CodeHelpers
+ # Retrieve the comment describing the expression on the given line of the given file.
+ #
+ # This is useful to get module or method documentation.
+ #
+ # @param [Array, File, String] file The file to parse, either as a File or as
+ # a String or an Array of lines.
+ # @param [Integer] line_number The line number at which to look.
+ # NOTE: The first line in a file is line 1!
+ # @return [String] The comment
+ #
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:52
+ def comment_describing(file, line_number); end
+
+ # Determine if a string of code is a complete Ruby expression.
+ # @param [String] code The code to validate.
+ # @return [Boolean] Whether or not the code is a complete Ruby expression.
+ # @raise [SyntaxError] Any SyntaxError that does not represent incompleteness.
+ # @example
+ # complete_expression?("class Hello") #=> false
+ # complete_expression?("class Hello; end") #=> true
+ # complete_expression?("class 123") #=> SyntaxError: unexpected tINTEGER
+ #
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:66
+ def complete_expression?(str); end
+
+ # Retrieve the first expression starting on the given line of the given file.
+ #
+ # This is useful to get module or method source code.
+ #
+ # @param [Array, File, String] file The file to parse, either as a File or as
+ # @param [Integer] line_number The line number at which to look.
+ # NOTE: The first line in a file is
+ # line 1!
+ # @param [Hash] options The optional configuration parameters.
+ # @option options [Boolean] :strict If set to true, then only completely
+ # valid expressions are returned. Otherwise heuristics are used to extract
+ # expressions that may have been valid inside an eval.
+ # @option options [Integer] :consume A number of lines to automatically
+ # consume (add to the expression buffer) without checking for validity.
+ # @return [String] The first complete expression
+ # @raise [SyntaxError] If the first complete expression can't be identified
+ #
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:20
+ def expression_at(file, line_number, options = T.unsafe(nil)); end
+
+ private
+
+ # Get the first expression from the input.
+ #
+ # @param [Array] lines
+ # @param [Integer] consume A number of lines to automatically
+ # consume (add to the expression buffer) without checking for validity.
+ # @yield a clean-up function to run before checking for complete_expression
+ # @return [String] a valid ruby expression
+ # @raise [SyntaxError]
+ #
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:92
+ def extract_first_expression(lines, consume = T.unsafe(nil), &block); end
+
+ # Get the last comment from the input.
+ #
+ # @param [Array] lines
+ # @return [String]
+ #
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:106
+ def extract_last_comment(lines); end
+end
+
+# An exception matcher that matches only subsets of SyntaxErrors that can be
+# fixed by adding more input to the buffer.
+#
+# pkg:gem/method_source#lib/method_source/code_helpers.rb:124
+module MethodSource::CodeHelpers::IncompleteExpression
+ class << self
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:137
+ def ===(ex); end
+
+ # pkg:gem/method_source#lib/method_source/code_helpers.rb:149
+ def rbx?; end
+ end
+end
+
+# pkg:gem/method_source#lib/method_source/code_helpers.rb:125
+MethodSource::CodeHelpers::IncompleteExpression::GENERIC_REGEXPS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/method_source#lib/method_source/code_helpers.rb:133
+MethodSource::CodeHelpers::IncompleteExpression::RBX_ONLY_REGEXPS = T.let(T.unsafe(nil), Array)
+
+# This module is to be included by `Method` and `UnboundMethod` and
+# provides the `#source` functionality
+#
+# pkg:gem/method_source#lib/method_source.rb:77
+module MethodSource::MethodExtensions
+ # Return the comments associated with the method class/module.
+ # @return [String] The method's comments as a string
+ # @raise SourceNotFoundException
+ #
+ # @example
+ # MethodSource::MethodExtensions.method(:included).module_comment
+ # =>
+ # # This module is to be included by `Method` and `UnboundMethod` and
+ # # provides the `#source` functionality
+ #
+ # pkg:gem/method_source#lib/method_source.rb:139
+ def class_comment; end
+
+ # Return the comments associated with the method as a string.
+ # @return [String] The method's comments as a string
+ # @raise SourceNotFoundException
+ #
+ # @example
+ # Set.instance_method(:clear).comment.display
+ # =>
+ # # Removes all elements and returns self.
+ #
+ # pkg:gem/method_source#lib/method_source.rb:126
+ def comment; end
+
+ # pkg:gem/method_source#lib/method_source.rb:159
+ def module_comment; end
+
+ # Return the sourcecode for the method as a string
+ # @return [String] The method sourcecode as a string
+ # @raise SourceNotFoundException
+ #
+ # @example
+ # Set.instance_method(:clear).source.display
+ # =>
+ # def clear
+ # @hash.clear
+ # self
+ # end
+ #
+ # pkg:gem/method_source#lib/method_source.rb:114
+ def source; end
+
+ class << self
+ # We use the included hook to patch Method#source on rubinius.
+ # We need to use the included hook as Rubinius defines a `source`
+ # on Method so including a module will have no effect (as it's
+ # higher up the MRO).
+ # @param [Class] klass The class that includes the module.
+ #
+ # pkg:gem/method_source#lib/method_source.rb:84
+ def included(klass); end
+ end
+end
+
+# pkg:gem/method_source#lib/method_source/source_location.rb:2
+module MethodSource::ReeSourceLocation
+ # Ruby enterprise edition provides all the information that's
+ # needed, in a slightly different way.
+ #
+ # pkg:gem/method_source#lib/method_source/source_location.rb:5
+ def source_location; end
+end
+
+# pkg:gem/method_source#lib/method_source/source_location.rb:10
+module MethodSource::SourceLocation; end
+
+# pkg:gem/method_source#lib/method_source/source_location.rb:11
+module MethodSource::SourceLocation::MethodExtensions
+ # JRuby version source_location hack
+ # @return [Array] A two element array containing the source location of the method
+ # Return the source location of a method for Ruby 1.8.
+ # @return [Array] A two element array. First element is the
+ # file, second element is the line in the file where the
+ # method definition is found.
+ #
+ # pkg:gem/method_source#lib/method_source/source_location.rb:40
+ def source_location; end
+
+ private
+
+ # pkg:gem/method_source#lib/method_source/source_location.rb:26
+ def trace_func(event, file, line, id, binding, classname); end
+end
+
+# pkg:gem/method_source#lib/method_source/source_location.rb:54
+module MethodSource::SourceLocation::ProcExtensions
+ # Return the source location for a Proc (Rubinius only)
+ # @return [Array] A two element array. First element is the
+ # file, second element is the line in the file where the
+ # proc definition is found.
+ # Return the source location for a Proc (in implementations
+ # without Proc#source_location)
+ # @return [Array] A two element array. First element is the
+ # file, second element is the line in the file where the
+ # proc definition is found.
+ #
+ # pkg:gem/method_source#lib/method_source/source_location.rb:74
+ def source_location; end
+end
+
+# pkg:gem/method_source#lib/method_source/source_location.rb:81
+module MethodSource::SourceLocation::UnboundMethodExtensions
+ # JRuby version source_location hack
+ # @return [Array] A two element array containing the source location of the method
+ # Return the source location of an instance method for Ruby 1.8.
+ # @return [Array] A two element array. First element is the
+ # file, second element is the line in the file where the
+ # method definition is found.
+ #
+ # pkg:gem/method_source#lib/method_source/source_location.rb:101
+ def source_location; end
+end
+
+# An Exception to mark errors that were raised trying to find the source from
+# a given source_location.
+#
+# pkg:gem/method_source#lib/method_source.rb:16
+class MethodSource::SourceNotFoundError < ::StandardError; end
+
+# pkg:gem/method_source#lib/method_source/version.rb:2
+MethodSource::VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/method_source#lib/method_source.rb:173
+class Proc
+ include ::MethodSource::SourceLocation::ProcExtensions
+ include ::MethodSource::MethodExtensions
+end
+
+# pkg:gem/method_source#lib/method_source.rb:168
+class UnboundMethod
+ include ::MethodSource::SourceLocation::UnboundMethodExtensions
+ include ::MethodSource::MethodExtensions
+end
diff --git a/sorbet/rbi/gems/minitest@6.0.6.rbi b/sorbet/rbi/gems/minitest@6.0.6.rbi
new file mode 100644
index 0000000..3433366
--- /dev/null
+++ b/sorbet/rbi/gems/minitest@6.0.6.rbi
@@ -0,0 +1,1482 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `minitest` gem.
+# Please instead update this file by running `bin/tapioca gem minitest`.
+
+
+# The top-level namespace for Minitest. Also the location of the main
+# runtime. See +Minitest.run+ for more information.
+# this is gonna break some shit?
+# for ruby 3
+# :stopdoc:
+# :stopdoc:
+# :startdoc:
+#
+# pkg:gem/minitest#lib/minitest/parallel.rb:3
+module Minitest
+ class << self
+ # A simple hook allowing you to run a block of code after everything
+ # is done running. Eg:
+ #
+ # Minitest.after_run { p $debugging_info }
+ #
+ # pkg:gem/minitest#lib/minitest.rb:95
+ def after_run(&block); end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def allow_fork; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def allow_fork=(_arg0); end
+
+ # Registers Minitest to run at process exit
+ #
+ # pkg:gem/minitest#lib/minitest.rb:69
+ def autorun; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def backtrace_filter; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def backtrace_filter=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:19
+ def cattr_accessor(name); end
+
+ # pkg:gem/minitest#lib/minitest.rb:1209
+ def clock_time; end
+
+ # pkg:gem/minitest#lib/minitest.rb:332
+ def empty_run!(options); end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def extensions; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def extensions=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:365
+ def filter_backtrace(bt); end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def info_signal; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def info_signal=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:134
+ def init_plugins(options); end
+
+ # Manually load plugins by name.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:102
+ def load(*names); end
+
+ # pkg:gem/minitest#lib/minitest.rb:118
+ def load_plugins; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def parallel_executor; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def parallel_executor=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:152
+ def process_args(args = T.unsafe(nil)); end
+
+ # Register a plugin to be used. Does NOT require / load it.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:113
+ def register_plugin(name_or_mod); end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def reporter; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def reporter=(_arg0); end
+
+ # This is the top-level run method. Everything starts from here. It
+ # tells each Runnable sub-class to run, and each of those are
+ # responsible for doing whatever they do.
+ #
+ # The overall structure of a run looks like this:
+ #
+ # [Minitest.load_plugins] optional, called by user, or require what you want
+ # Minitest.autorun
+ # Minitest.run(args)
+ # Minitest.process_args
+ # Minitest.init_plugins
+ # Minitest.run_all_suites(reporter, options)
+ # Runnable.runnables.each |runnable_klass|
+ # runnable_klass.run_suite(reporter, options)
+ # filtered_methods = runnable_klass.filter_runnable_methods options
+ # filtered_methods.each |runnable_method|
+ # runnable_klass.run(self, runnable_method, reporter)
+ # runnable_klass.new(runnable_method).run
+ #
+ # pkg:gem/minitest#lib/minitest.rb:299
+ def run(args = T.unsafe(nil)); end
+
+ # Internal run method. Responsible for telling all Runnable
+ # sub-classes to run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:352
+ def run_all_suites(reporter, options); end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def seed; end
+
+ # pkg:gem/minitest#lib/minitest.rb:20
+ def seed=(_arg0); end
+ end
+end
+
+# Defines the API for Reporters. Subclass this and override whatever
+# you want. Go nuts.
+#
+# pkg:gem/minitest#lib/minitest.rb:707
+class Minitest::AbstractReporter
+ # pkg:gem/minitest#lib/minitest.rb:709
+ def initialize; end
+
+ # Did this run pass?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:744
+ def passed?; end
+
+ # About to start running a test. This allows a reporter to show
+ # that it is starting or that we are in the middle of a test run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:723
+ def prerecord(klass, name); end
+
+ # Output and record the result of the test. Call
+ # {result#result_code}[rdoc-ref:Runnable#result_code] to get the
+ # result character string. Stores the result of the run if the run
+ # did not pass.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:732
+ def record(result); end
+
+ # Outputs the summary of the run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:738
+ def report; end
+
+ # Starts reporting on the run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:716
+ def start; end
+
+ # pkg:gem/minitest#lib/minitest.rb:748
+ def synchronize(&block); end
+end
+
+# Represents run failures.
+#
+# pkg:gem/minitest#lib/minitest.rb:1039
+class Minitest::Assertion < ::Exception
+ # pkg:gem/minitest#lib/minitest.rb:1042
+ def error; end
+
+ # Where was this run before an assertion was raised?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1049
+ def location; end
+
+ # pkg:gem/minitest#lib/minitest.rb:1057
+ def result_code; end
+
+ # pkg:gem/minitest#lib/minitest.rb:1061
+ def result_label; end
+end
+
+# pkg:gem/minitest#lib/minitest.rb:1040
+Minitest::Assertion::RE = T.let(T.unsafe(nil), Regexp)
+
+# Minitest Assertions. All assertion methods accept a +msg+ which is
+# printed if the assertion fails.
+#
+# Protocol: Nearly everything here boils up to +assert+, which
+# expects to be able to increment an instance accessor named
+# +assertions+. This is not provided by Assertions and must be
+# provided by the thing including Assertions. See Minitest::Runnable
+# for an example.
+#
+# pkg:gem/minitest#lib/minitest/assertions.rb:16
+module Minitest::Assertions
+ # pkg:gem/minitest#lib/minitest/assertions.rb:181
+ def _synchronize; end
+
+ # Fails unless +test+ is truthy.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:171
+ def assert(test, msg = T.unsafe(nil)); end
+
+ # Fails unless +obj+ is empty.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:188
+ def assert_empty(obj, msg = T.unsafe(nil)); end
+
+ # Fails unless exp == act printing the difference between
+ # the two, if possible.
+ #
+ # If there is no visible difference but the assertion fails, you
+ # should suspect that your #== is buggy, or your inspect output is
+ # missing crucial details. For nicer structural diffing, set
+ # Minitest::Test.make_my_diffs_pretty!
+ #
+ # For floats use assert_in_delta.
+ #
+ # See also: Minitest::Assertions.diff
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:206
+ def assert_equal(exp, act, msg = T.unsafe(nil)); end
+
+ # For comparing Floats. Fails unless +exp+ and +act+ are within +delta+
+ # of each other.
+ #
+ # assert_in_delta Math::PI, (22.0 / 7.0), 0.01
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:220
+ def assert_in_delta(exp, act, delta = T.unsafe(nil), msg = T.unsafe(nil)); end
+
+ # For comparing Floats. Fails unless +exp+ and +act+ have a relative
+ # error less than +epsilon+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:232
+ def assert_in_epsilon(exp, act, epsilon = T.unsafe(nil), msg = T.unsafe(nil)); end
+
+ # Fails unless +collection+ includes +obj+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:239
+ def assert_includes(collection, obj, msg = T.unsafe(nil)); end
+
+ # Fails unless +obj+ is an instance of +cls+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:249
+ def assert_instance_of(cls, obj, msg = T.unsafe(nil)); end
+
+ # Fails unless +obj+ is a kind of +cls+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:260
+ def assert_kind_of(cls, obj, msg = T.unsafe(nil)); end
+
+ # Fails unless +matcher+ =~ +obj+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:271
+ def assert_match(matcher, obj, msg = T.unsafe(nil)); end
+
+ # Fails unless +obj+ is nil
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:283
+ def assert_nil(obj, msg = T.unsafe(nil)); end
+
+ # For testing with binary operators. Eg:
+ #
+ # assert_operator 5, :<=, 4
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:293
+ def assert_operator(o1, op, o2 = T.unsafe(nil), msg = T.unsafe(nil)); end
+
+ # Fails if stdout or stderr do not output the expected results.
+ # Pass in nil if you don't care about that streams output. Pass in
+ # "" if you require it to be silent. Pass in a regexp if you want
+ # to pattern match.
+ #
+ # assert_output(/hey/) { method_with_output }
+ #
+ # NOTE: this uses #capture_io, not #capture_subprocess_io.
+ #
+ # See also: #assert_silent
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:312
+ def assert_output(stdout = T.unsafe(nil), stderr = T.unsafe(nil)); end
+
+ # Fails unless +path+ exists.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:336
+ def assert_path_exists(path, msg = T.unsafe(nil)); end
+
+ # For testing with pattern matching (only supported with Ruby 3.0 and later)
+ #
+ # # pass
+ # assert_pattern { [1,2,3] => [Integer, Integer, Integer] }
+ #
+ # # fail "length mismatch (given 3, expected 1)"
+ # assert_pattern { [1,2,3] => [Integer] }
+ #
+ # The bare => pattern will raise a NoMatchingPatternError on failure, which would
+ # normally be counted as a test error. This assertion rescues NoMatchingPatternError and
+ # generates a test failure. Any other exception will be raised as normal and generate a test
+ # error.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:355
+ def assert_pattern; end
+
+ # For testing with predicates. Eg:
+ #
+ # assert_predicate str, :empty?
+ #
+ # This is really meant for specs and is front-ended by assert_operator:
+ #
+ # str.must_be :empty?
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:373
+ def assert_predicate(o1, op, msg = T.unsafe(nil)); end
+
+ # Fails unless the block raises one of +exp+. Returns the
+ # exception matched so you can check the message, attributes, etc.
+ #
+ # +exp+ takes an optional message on the end to help explain
+ # failures and defaults to StandardError if no exception class is
+ # passed. Eg:
+ #
+ # assert_raises(CustomError) { method_with_custom_error }
+ #
+ # With custom error message:
+ #
+ # assert_raises(CustomError, 'This should have raised CustomError') { method_with_custom_error }
+ #
+ # Using the returned object:
+ #
+ # error = assert_raises(CustomError) do
+ # raise CustomError, 'This is really bad'
+ # end
+ #
+ # assert_equal 'This is really bad', error.message
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:403
+ def assert_raises(*exp); end
+
+ # Fails unless +obj+ responds to +meth+.
+ # include_all defaults to false to match Object#respond_to?
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:438
+ def assert_respond_to(obj, meth, msg = T.unsafe(nil), include_all: T.unsafe(nil)); end
+
+ # Fails unless +exp+ and +act+ are #equal?
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:446
+ def assert_same(exp, act, msg = T.unsafe(nil)); end
+
+ # Fails if the block outputs anything to stderr or stdout.
+ #
+ # See also: #assert_output
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:462
+ def assert_silent; end
+
+ # Fails unless the block throws +sym+
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:471
+ def assert_throws(sym, msg = T.unsafe(nil)); end
+
+ # Captures $stdout and $stderr into strings:
+ #
+ # out, err = capture_io do
+ # puts "Some info"
+ # warn "You did a bad thing"
+ # end
+ #
+ # assert_match %r%info%, out
+ # assert_match %r%bad%, err
+ #
+ # NOTE: For efficiency, this method uses StringIO and does not
+ # capture IO for subprocesses. Use #capture_subprocess_io for
+ # that.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:507
+ def capture_io; end
+
+ # Captures $stdout and $stderr into strings, using Tempfile to
+ # ensure that subprocess IO is captured as well.
+ #
+ # out, err = capture_subprocess_io do
+ # system "echo Some info"
+ # system "echo You did a bad thing 1>&2"
+ # end
+ #
+ # assert_match %r%info%, out
+ # assert_match %r%bad%, err
+ #
+ # NOTE: This method is approximately 10x slower than #capture_io so
+ # only use it when you need to test the output of a subprocess.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:540
+ def capture_subprocess_io; end
+
+ # Returns a diff between +exp+ and +act+. If there is no known
+ # diff command or if it doesn't make sense to diff the output
+ # (single line, short output), then it simply returns a basic
+ # comparison between the two.
+ #
+ # See +things_to_diff+ for more info.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:57
+ def diff(exp, act); end
+
+ # Returns details for exception +e+
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:572
+ def exception_details(e, msg); end
+
+ # Fails after a given date (in the local time zone). This allows
+ # you to put time-bombs in your tests if you need to keep
+ # something around until a later date lest you forget about it.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:588
+ def fail_after(y, m, d, msg); end
+
+ # Fails with +msg+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:595
+ def flunk(msg = T.unsafe(nil)); end
+
+ # Returns a proc that delays generation of an output message. If
+ # +msg+ is a proc (eg, from another +message+ call) return +msg+
+ # as-is. Otherwise, return a proc that will output +msg+ along
+ # with the value of the result of the block passed to +message+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:606
+ def message(msg = T.unsafe(nil), ending = T.unsafe(nil), &default); end
+
+ # This returns a human-readable version of +obj+. By default
+ # #inspect is called. You can override this to use #pretty_inspect
+ # if you want.
+ #
+ # See Minitest::Test.make_my_diffs_pretty!
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:127
+ def mu_pp(obj); end
+
+ # This returns a diff-able more human-readable version of +obj+.
+ # This differs from the regular mu_pp because it expands escaped
+ # newlines and makes hex-values (like object_ids) generic. This
+ # uses mu_pp to do the first pass and then cleans it up.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:145
+ def mu_pp_for_diff(obj); end
+
+ # used for counting assertions
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:617
+ def pass(_msg = T.unsafe(nil)); end
+
+ # Fails if +test+ is truthy.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:624
+ def refute(test, msg = T.unsafe(nil)); end
+
+ # Fails if +obj+ is empty.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:632
+ def refute_empty(obj, msg = T.unsafe(nil)); end
+
+ # Fails if exp == act .
+ #
+ # For floats use refute_in_delta.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:642
+ def refute_equal(exp, act, msg = T.unsafe(nil)); end
+
+ # For comparing Floats. Fails if +exp+ is within +delta+ of +act+.
+ #
+ # refute_in_delta Math::PI, (22.0 / 7.0)
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:654
+ def refute_in_delta(exp, act, delta = T.unsafe(nil), msg = T.unsafe(nil)); end
+
+ # For comparing Floats. Fails if +exp+ and +act+ have a relative error
+ # less than +epsilon+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:666
+ def refute_in_epsilon(exp, act, epsilon = T.unsafe(nil), msg = T.unsafe(nil)); end
+
+ # Fails if +obj+ includes +sub+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:673
+ def refute_includes(obj, sub, msg = T.unsafe(nil)); end
+
+ # Fails if +obj+ is an instance of +cls+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:681
+ def refute_instance_of(cls, obj, msg = T.unsafe(nil)); end
+
+ # Fails if +obj+ is a kind of +cls+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:691
+ def refute_kind_of(cls, obj, msg = T.unsafe(nil)); end
+
+ # Fails if +matcher+ =~ +obj+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:699
+ def refute_match(matcher, obj, msg = T.unsafe(nil)); end
+
+ # Fails if +obj+ is nil.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:708
+ def refute_nil(obj, msg = T.unsafe(nil)); end
+
+ # Fails if +o1+ is not +op+ +o2+. Eg:
+ #
+ # refute_operator 1, :>, 2 #=> pass
+ # refute_operator 1, :<, 2 #=> fail
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:740
+ def refute_operator(o1, op, o2 = T.unsafe(nil), msg = T.unsafe(nil)); end
+
+ # Fails if +path+ exists.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:750
+ def refute_path_exists(path, msg = T.unsafe(nil)); end
+
+ # For testing with pattern matching (only supported with Ruby 3.0 and later)
+ #
+ # # pass
+ # refute_pattern { [1,2,3] => [String] }
+ #
+ # # fail "NoMatchingPatternError expected, but nothing was raised."
+ # refute_pattern { [1,2,3] => [Integer, Integer, Integer] }
+ #
+ # This assertion expects a NoMatchingPatternError exception, and will fail if none is raised. Any
+ # other exceptions will be raised as normal and generate a test error.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:725
+ def refute_pattern; end
+
+ # For testing with predicates.
+ #
+ # refute_predicate str, :empty?
+ #
+ # This is really meant for specs and is front-ended by refute_operator:
+ #
+ # str.wont_be :empty?
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:764
+ def refute_predicate(o1, op, msg = T.unsafe(nil)); end
+
+ # Fails if +obj+ responds to the message +meth+.
+ # include_all defaults to false to match Object#respond_to?
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:774
+ def refute_respond_to(obj, meth, msg = T.unsafe(nil), include_all: T.unsafe(nil)); end
+
+ # Fails if +exp+ is the same (by object identity) as +act+.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:783
+ def refute_same(exp, act, msg = T.unsafe(nil)); end
+
+ # Skips the current run. If run in verbose-mode, the skipped run
+ # gets listed at the end of the run but doesn't cause a failure
+ # exit code.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:796
+ def skip(msg = T.unsafe(nil), _ignored = T.unsafe(nil)); end
+
+ # Skips the current run until a given date (in the local time
+ # zone). This allows you to put some fixes on hold until a later
+ # date, but still holds you accountable and prevents you from
+ # forgetting it.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:808
+ def skip_until(y, m, d, msg); end
+
+ # Was this testcase skipped? Meant for #teardown.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:817
+ def skipped?; end
+
+ # Returns things to diff [expect, butwas], or [nil, nil] if nothing to diff.
+ #
+ # Criterion:
+ #
+ # 1. Strings include newlines or escaped newlines, but not both.
+ # 2. or: String lengths are > 30 characters.
+ # 3. or: Strings are equal to each other (but maybe different encodings?).
+ # 4. and: we found a diff executable.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:102
+ def things_to_diff(exp, act); end
+
+ class << self
+ # Returns the diff command to use in #diff. Tries to intelligently
+ # figure out what diff to use.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:27
+ def diff; end
+
+ # Set the diff command to use in #diff.
+ #
+ # pkg:gem/minitest#lib/minitest/assertions.rb:45
+ def diff=(o); end
+ end
+end
+
+# pkg:gem/minitest#lib/minitest/assertions.rb:379
+Minitest::Assertions::NO_RE_MSG = T.let(T.unsafe(nil), String)
+
+# pkg:gem/minitest#lib/minitest/assertions.rb:17
+Minitest::Assertions::UNDEFINED = T.let(T.unsafe(nil), Object)
+
+# The standard backtrace filter for minitest.
+#
+# See Minitest.backtrace_filter=.
+#
+# pkg:gem/minitest#lib/minitest.rb:1174
+class Minitest::BacktraceFilter
+ # pkg:gem/minitest#lib/minitest.rb:1183
+ def initialize(regexp = T.unsafe(nil)); end
+
+ # Filter +bt+ to something useful. Returns the whole thing if
+ # $DEBUG (ruby) or $MT_DEBUG (env).
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1191
+ def filter(bt); end
+
+ # The regular expression to use to filter backtraces. Defaults to +MT_RE+.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1181
+ def regexp; end
+
+ # The regular expression to use to filter backtraces. Defaults to +MT_RE+.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1181
+ def regexp=(_arg0); end
+end
+
+# pkg:gem/minitest#lib/minitest.rb:1176
+Minitest::BacktraceFilter::MT_RE = T.let(T.unsafe(nil), Regexp)
+
+# Dispatch to multiple reporters as one.
+#
+# pkg:gem/minitest#lib/minitest.rb:989
+class Minitest::CompositeReporter < ::Minitest::AbstractReporter
+ # pkg:gem/minitest#lib/minitest.rb:995
+ def initialize(*reporters); end
+
+ # Add another reporter to the mix.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1007
+ def <<(reporter); end
+
+ # pkg:gem/minitest#lib/minitest.rb:1000
+ def io; end
+
+ # pkg:gem/minitest#lib/minitest.rb:1011
+ def passed?; end
+
+ # pkg:gem/minitest#lib/minitest.rb:1019
+ def prerecord(klass, name); end
+
+ # pkg:gem/minitest#lib/minitest.rb:1025
+ def record(result); end
+
+ # pkg:gem/minitest#lib/minitest.rb:1031
+ def report; end
+
+ # The list of reporters to dispatch to.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:993
+ def reporters; end
+
+ # The list of reporters to dispatch to.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:993
+ def reporters=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:1015
+ def start; end
+end
+
+# Compresses backtraces.
+#
+# pkg:gem/minitest#lib/minitest/compress.rb:5
+module Minitest::Compress
+ # Takes a backtrace (array of strings) and compresses repeating
+ # cycles in it to make it more readable.
+ #
+ # pkg:gem/minitest#lib/minitest/compress.rb:11
+ def compress(orig); end
+end
+
+# Provides a simple set of guards that you can use in your tests
+# to skip execution if it is not applicable. These methods are
+# mixed into Test as both instance and class methods so you
+# can use them inside or outside of the test methods.
+#
+# def test_something_for_mri
+# skip "bug 1234" if jruby?
+# # ...
+# end
+#
+# if windows? then
+# # ... lots of test methods ...
+# end
+#
+# pkg:gem/minitest#lib/minitest.rb:1138
+module Minitest::Guard
+ # Is this running on jruby?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1143
+ def jruby?(platform = T.unsafe(nil)); end
+
+ # Is this running on mri?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1150
+ def mri?(platform = T.unsafe(nil)); end
+
+ # Is this running on macOS?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1157
+ def osx?(platform = T.unsafe(nil)); end
+
+ # Is this running on windows?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1164
+ def windows?(platform = T.unsafe(nil)); end
+end
+
+# pkg:gem/minitest#lib/minitest/parallel.rb:4
+module Minitest::Parallel; end
+
+# The engine used to run multiple tests in parallel.
+#
+# pkg:gem/minitest#lib/minitest/parallel.rb:9
+class Minitest::Parallel::Executor
+ # Create a parallel test executor of with +size+ workers.
+ #
+ # pkg:gem/minitest#lib/minitest/parallel.rb:19
+ def initialize(size); end
+
+ # Add a job to the queue
+ #
+ # pkg:gem/minitest#lib/minitest/parallel.rb:45
+ def <<(work); end
+
+ # Shuts down the pool of workers by signalling them to quit and
+ # waiting for them all to finish what they're currently working
+ # on.
+ #
+ # pkg:gem/minitest#lib/minitest/parallel.rb:52
+ def shutdown; end
+
+ # The size of the pool of workers.
+ #
+ # pkg:gem/minitest#lib/minitest/parallel.rb:14
+ def size; end
+
+ # Start the executor
+ #
+ # pkg:gem/minitest#lib/minitest/parallel.rb:28
+ def start; end
+end
+
+# pkg:gem/minitest#lib/minitest/parallel.rb:58
+module Minitest::Parallel::Test
+ # pkg:gem/minitest#lib/minitest/parallel.rb:59
+ def _synchronize; end
+end
+
+# pkg:gem/minitest#lib/minitest/parallel.rb:61
+module Minitest::Parallel::Test::ClassMethods
+ # pkg:gem/minitest#lib/minitest/parallel.rb:62
+ def run(klass, method_name, reporter); end
+
+ # pkg:gem/minitest#lib/minitest/parallel.rb:66
+ def run_order; end
+end
+
+# A very simple reporter that prints the "dots" during the run.
+#
+# This is added to the top-level CompositeReporter at the start of
+# the run. If you want to change the output of minitest via a
+# plugin, pull this out of the composite and replace it with your
+# own.
+#
+# pkg:gem/minitest#lib/minitest.rb:779
+class Minitest::ProgressReporter < ::Minitest::Reporter
+ # pkg:gem/minitest#lib/minitest.rb:780
+ def prerecord(klass, name); end
+
+ # pkg:gem/minitest#lib/minitest.rb:787
+ def record(result); end
+end
+
+# Shared code for anything that can get passed to a Reporter. See
+# Minitest::Test & Minitest::Result.
+#
+# pkg:gem/minitest#lib/minitest.rb:604
+module Minitest::Reportable
+ # pkg:gem/minitest#lib/minitest.rb:626
+ def class_name; end
+
+ # Did this run error?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:647
+ def error?; end
+
+ # The location identifier of this test. Depends on a method
+ # existing called class_name.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:621
+ def location; end
+
+ # Did this run pass?
+ #
+ # Note: skipped runs are not considered passing, but they don't
+ # cause the process to exit non-zero.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:611
+ def passed?; end
+
+ # Returns ".", "F", or "E" based on the result of the run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:633
+ def result_code; end
+
+ # Was this run skipped?
+ #
+ # pkg:gem/minitest#lib/minitest.rb:640
+ def skipped?; end
+end
+
+# pkg:gem/minitest#lib/minitest.rb:615
+Minitest::Reportable::BASE_DIR = T.let(T.unsafe(nil), String)
+
+# AbstractReportera
+#
+# pkg:gem/minitest#lib/minitest.rb:755
+class Minitest::Reporter < ::Minitest::AbstractReporter
+ # pkg:gem/minitest#lib/minitest.rb:764
+ def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # The IO used to report.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:757
+ def io; end
+
+ # The IO used to report.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:757
+ def io=(_arg0); end
+
+ # Command-line options for this run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:762
+ def options; end
+
+ # Command-line options for this run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:762
+ def options=(_arg0); end
+end
+
+# This represents a test result in a clean way that can be
+# marshalled over a wire. Tests can do anything they want to the
+# test instance and can create conditions that cause Marshal.dump to
+# blow up. By using Result.from(a_test) you can be reasonably sure
+# that the test result can be marshalled.
+#
+# pkg:gem/minitest#lib/minitest.rb:659
+class Minitest::Result < ::Minitest::Runnable
+ include ::Minitest::Reportable
+
+ # pkg:gem/minitest#lib/minitest.rb:690
+ def class_name; end
+
+ # The class name of the test result.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:665
+ def klass; end
+
+ # The class name of the test result.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:665
+ def klass=(_arg0); end
+
+ # The location of the test method.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:670
+ def source_location; end
+
+ # The location of the test method.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:670
+ def source_location=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:694
+ def to_s; end
+
+ class << self
+ # Create a new test result from a Runnable instance.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:675
+ def from(runnable); end
+ end
+end
+
+# Represents anything "runnable", like Test, Spec, Benchmark, or
+# whatever you can dream up.
+#
+# Subclasses of this are automatically registered and available in
+# Runnable.runnables.
+#
+# pkg:gem/minitest#lib/minitest.rb:378
+class Minitest::Runnable
+ # pkg:gem/minitest#lib/minitest.rb:535
+ def initialize(name); end
+
+ # Number of assertions executed in this run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:382
+ def assertions; end
+
+ # Number of assertions executed in this run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:382
+ def assertions=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:531
+ def failure; end
+
+ # An assertion raised during the run, if any.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:387
+ def failures; end
+
+ # An assertion raised during the run, if any.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:387
+ def failures=(_arg0); end
+
+ # Metadata you attach to the test results that get sent to the reporter.
+ #
+ # Lazily initializes to a hash, to keep memory down.
+ #
+ # NOTE: this data *must* be plain (read: marshal-able) data!
+ # Hashes! Arrays! Strings!
+ #
+ # Sets metadata, mainly used for +Result.from+.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:550
+ def metadata; end
+
+ # Metadata you attach to the test results that get sent to the reporter.
+ #
+ # Lazily initializes to a hash, to keep memory down.
+ #
+ # NOTE: this data *must* be plain (read: marshal-able) data!
+ # Hashes! Arrays! Strings!
+ #
+ # Sets metadata, mainly used for +Result.from+.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:557
+ def metadata=(_arg0); end
+
+ # Returns true if metadata exists.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:562
+ def metadata?; end
+
+ # Name of the run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:405
+ def name; end
+
+ # Set the name of the run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:412
+ def name=(o); end
+
+ # Did this run pass?
+ #
+ # Note: skipped runs are not considered passing, but they don't
+ # cause the process to exit non-zero.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:579
+ def passed?; end
+
+ # Returns a single character string to print based on the result
+ # of the run. One of "." , "F" ,
+ # "E" or "S" .
+ #
+ # pkg:gem/minitest#lib/minitest.rb:588
+ def result_code; end
+
+ # Runs a single method. Needs to return self.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:569
+ def run; end
+
+ # Was this run skipped? See #passed? for more information.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:595
+ def skipped?; end
+
+ # The time it took to run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:392
+ def time; end
+
+ # The time it took to run.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:392
+ def time=(_arg0); end
+
+ # pkg:gem/minitest#lib/minitest.rb:394
+ def time_it; end
+
+ class << self
+ # Returns an array of filtered +runnable_methods+. Uses
+ # options[:include] (--include arguments) and options[:exclude]
+ # (--exclude arguments) values to filter.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:434
+ def filter_runnable_methods(options = T.unsafe(nil)); end
+
+ # re-open
+ #
+ # pkg:gem/minitest#lib/minitest.rb:1219
+ def inherited(klass); end
+
+ # Returns all instance methods matching the pattern +re+.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:419
+ def methods_matching(re); end
+
+ # pkg:gem/minitest#lib/minitest.rb:503
+ def on_signal(name, action); end
+
+ # pkg:gem/minitest#lib/minitest.rb:423
+ def reset; end
+
+ # Runs a single method and has the reporter record the result.
+ # This was considered internal API but is factored out of run so
+ # that subclasses can specialize the running of an individual
+ # test. See Minitest::ParallelTest::ClassMethods for an example.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:484
+ def run(klass, method_name, reporter); end
+
+ # Defines the order to run tests (:random by default). Override
+ # this or use a convenience method to change it for your tests.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:493
+ def run_order; end
+
+ # Responsible for running all runnable methods in a given class,
+ # each in its own instance. Each instance is passed to the
+ # reporter to record.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:452
+ def run_suite(reporter, options = T.unsafe(nil)); end
+
+ # Each subclass of Runnable is responsible for overriding this
+ # method to return all runnable methods. See #methods_matching.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:520
+ def runnable_methods; end
+
+ # Returns all subclasses of Runnable.
+ #
+ # pkg:gem/minitest#lib/minitest.rb:527
+ def runnables; end
+
+ # pkg:gem/minitest#lib/minitest.rb:497
+ def with_info_handler(_reporter = T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/minitest#lib/minitest.rb:501
+Minitest::Runnable::SIGNALS = T.let(T.unsafe(nil), Hash)
+
+# Assertion raised when skipping a run.
+#
+# pkg:gem/minitest#lib/minitest.rb:1069
+class Minitest::Skip < ::Minitest::Assertion
+ # pkg:gem/minitest#lib/minitest.rb:1070
+ def result_label; end
+end
+
+# A reporter that gathers statistics about a test run. Does not do
+# any IO because meant to be used as a parent class for a reporter
+# that does.
+#
+# If you want to create an entirely different type of output (eg,
+# CI, HTML, etc), this is the place to start.
+#
+# Example:
+#
+# class JenkinsCIReporter < StatisticsReporter
+# def report
+# super # Needed to calculate some statistics
+#
+# print " {"foo" => "bar"}
+# MultiJSON.generate({foo: "bar"}) #=> '{"foo":"bar"}'
+#
+# @example Specifying an adapter
+# MultiJSON.use(:oj)
+# MultiJSON.parse('{"foo":"bar"}', adapter: :json_gem)
+#
+# @api public
+# Deprecated public API kept around for one major release
+#
+# Each method here emits a one-time deprecation warning on first call and
+# delegates to its current-API counterpart. The whole file is loaded by
+# {MultiJSON} so the deprecation surface stays out of the main module
+# definition.
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/concurrency.rb:3
+module MultiJSON
+ extend ::MultiJSON::Options
+ extend ::MultiJSON::AdapterSelector
+
+ # Returns the current adapter class
+ #
+ # Honors a fiber-local override set by {.with_adapter} so concurrent
+ # blocks observe their own adapter without clobbering the process-wide
+ # default. Falls back to the process default when no override is set.
+ #
+ # @api public
+ # @return [Class] the current adapter class
+ # @example
+ # MultiJSON.adapter #=> MultiJSON::Adapters::Oj
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:127
+ def adapter; end
+
+ # Sets the adapter to use for JSON operations
+ #
+ # @api public
+ # @return [Class] the loaded adapter class
+ # @example
+ # MultiJSON.adapter = :json_gem
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:159
+ def adapter=(new_adapter); end
+
+ # Returns the adapter to use for the given options
+ #
+ # ``nil`` is accepted as a no-options sentinel — explicit
+ # ``current_adapter(nil)`` calls fall through to the process default
+ # adapter without raising.
+ #
+ # @api public
+ # @param options [Hash, nil] options that may contain :adapter key, or
+ # nil to use the process default
+ # @return [Class] adapter class
+ # @example
+ # MultiJSON.current_adapter(adapter: :oj) #=> MultiJSON::Adapters::Oj
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:200
+ def current_adapter(options = T.unsafe(nil)); end
+
+ # Serializes a Ruby object to a JSON string
+ #
+ # @api public
+ # @param object [Object] object to serialize
+ # @param options [Hash] serialization options (adapter-specific)
+ # @return [String] JSON string
+ # @example
+ # MultiJSON.generate({foo: "bar"}) #=> '{"foo":"bar"}'
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:214
+ def generate(object, options = T.unsafe(nil)); end
+
+ # Parses a JSON string into a Ruby object
+ #
+ # Returns ``nil`` for ``nil``, empty, and whitespace-only inputs
+ # instead of raising. Pass an explicit non-blank string if you want
+ # to surface a {ParseError} for empty payloads at the call site.
+ #
+ # @api public
+ # @param string [String, #read] JSON string or IO-like object
+ # @param options [Hash] parsing options (adapter-specific)
+ # @return [Object, nil] parsed Ruby object, or nil for blank input
+ # @raise [ParseError] if parsing fails
+ # @raise [AdapterError] if the adapter doesn't define a ``ParseError`` constant
+ # @example
+ # MultiJSON.parse('{"foo":"bar"}') #=> {"foo" => "bar"}
+ # MultiJSON.parse("") #=> nil
+ # MultiJSON.parse(" \n") #=> nil
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:178
+ def parse(string, options = T.unsafe(nil)); end
+
+ # Sets the adapter to use for JSON operations
+ #
+ # The merged-options cache is only reset when the new adapter loads
+ # successfully. A failed ``use(:nonexistent)`` leaves the cache in
+ # place so the previously-active adapter keeps its cached entries.
+ #
+ # @api public
+ # @param new_adapter [Symbol, String, Module, nil] adapter specification
+ # @return [Class] the loaded adapter class
+ # @example
+ # MultiJSON.use(:oj)
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:145
+ def use(new_adapter); end
+
+ private
+
+ # Instance-method delegate for the deprecated default_options getter
+ #
+ # @api private
+ # @deprecated Use {MultiJSON.load_options} or {MultiJSON.dump_options} instead
+ # @return [Hash] the current load options
+ # @example
+ # class Foo; include MultiJSON; end
+ # Foo.new.send(:default_options)
+ #
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:110
+ def default_options; end
+
+ # Instance-method delegate for the deprecated default_options setter
+ #
+ # @api private
+ # @deprecated Use {MultiJSON.load_options=} and {MultiJSON.dump_options=} instead
+ # @param value [Hash] options hash
+ # @return [Hash] the options hash
+ # @example
+ # class Foo; include MultiJSON; end
+ # Foo.new.send(:default_options=, symbolize_keys: true)
+ #
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:98
+ def default_options=(value); end
+
+ # Instance-method delegate for {MultiJSON.with_adapter}
+ #
+ # @api private
+ # @param new_adapter [Symbol, String, Module] adapter to use
+ # @yield block to execute with the temporary adapter
+ # @return [Object] result of the block
+ # @example
+ # class Foo; include MultiJSON; end
+ # Foo.new.send(:with_adapter, :json_gem) { ... }
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:264
+ def with_adapter(new_adapter, &_arg1); end
+
+ class << self
+ # Returns the current adapter class
+ #
+ # Honors a fiber-local override set by {.with_adapter} so concurrent
+ # blocks observe their own adapter without clobbering the process-wide
+ # default. Falls back to the process default when no override is set.
+ #
+ # @api public
+ # @return [Class] the current adapter class
+ # @example
+ # MultiJSON.adapter #=> MultiJSON::Adapters::Oj
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:127
+ def adapter; end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:160
+ def adapter=(new_adapter); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:55
+ def cached_options(*args, **kwargs); end
+
+ # Returns the adapter to use for the given options
+ #
+ # ``nil`` is accepted as a no-options sentinel — explicit
+ # ``current_adapter(nil)`` calls fall through to the process default
+ # adapter without raising.
+ #
+ # @api public
+ # @param options [Hash, nil] options that may contain :adapter key, or
+ # nil to use the process default
+ # @return [Class] adapter class
+ # @example
+ # MultiJSON.current_adapter(adapter: :oj) #=> MultiJSON::Adapters::Oj
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:200
+ def current_adapter(options = T.unsafe(nil)); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def decode(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def default_engine(*args, **kwargs, &block); end
+
+ # Instance-method delegate for the deprecated default_options getter
+ #
+ # @api private
+ # @deprecated Use {MultiJSON.load_options} or {MultiJSON.dump_options} instead
+ # @return [Hash] the current load options
+ # @example
+ # class Foo; include MultiJSON; end
+ # Foo.new.send(:default_options)
+ #
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:55
+ def default_options(*args, **kwargs); end
+
+ # Instance-method delegate for the deprecated default_options setter
+ #
+ # @api private
+ # @deprecated Use {MultiJSON.load_options=} and {MultiJSON.dump_options=} instead
+ # @param value [Hash] options hash
+ # @return [Hash] the options hash
+ # @example
+ # class Foo; include MultiJSON; end
+ # Foo.new.send(:default_options=, symbolize_keys: true)
+ #
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:55
+ def default_options=(*args, **kwargs); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def dump(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def encode(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def engine(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def engine=(*args, **kwargs, &block); end
+
+ # Serializes a Ruby object to a JSON string
+ #
+ # @api public
+ # @param object [Object] object to serialize
+ # @param options [Hash] serialization options (adapter-specific)
+ # @return [String] JSON string
+ # @example
+ # MultiJSON.generate({foo: "bar"}) #=> '{"foo":"bar"}'
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:214
+ def generate(object, options = T.unsafe(nil)); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def load(*args, **kwargs, &block); end
+
+ # Parses a JSON string into a Ruby object
+ #
+ # Returns ``nil`` for ``nil``, empty, and whitespace-only inputs
+ # instead of raising. Pass an explicit non-blank string if you want
+ # to surface a {ParseError} for empty payloads at the call site.
+ #
+ # @api public
+ # @param string [String, #read] JSON string or IO-like object
+ # @param options [Hash] parsing options (adapter-specific)
+ # @return [Object, nil] parsed Ruby object, or nil for blank input
+ # @raise [ParseError] if parsing fails
+ # @raise [AdapterError] if the adapter doesn't define a ``ParseError`` constant
+ # @example
+ # MultiJSON.parse('{"foo":"bar"}') #=> {"foo" => "bar"}
+ # MultiJSON.parse("") #=> nil
+ # MultiJSON.parse(" \n") #=> nil
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:178
+ def parse(string, options = T.unsafe(nil)); end
+
+ # Resolve the ``ParseError`` constant for an adapter class
+ #
+ # The result is memoized on the adapter class itself in a
+ # ``@_multi_json_parse_error`` ivar so subsequent ``MultiJSON.load``
+ # calls skip the constant lookup entirely. The lookup is performed
+ # with ``inherit: false`` so a stray top-level ``::ParseError``
+ # constant in the host process is correctly ignored on every
+ # supported Ruby implementation — TruffleRuby's ``::`` operator
+ # walks the ancestor chain and would otherwise pick up the top-level
+ # constant. Custom adapters that don't define their own
+ # ``ParseError`` get a clear {AdapterError} instead of the bare
+ # ``NameError`` Ruby would raise from the rescue clause.
+ #
+ # @api private
+ # @param adapter_class [Class] adapter class to inspect
+ # @return [Class] the adapter's ParseError class
+ # @raise [AdapterError] when the adapter doesn't define ParseError
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:100
+ def parse_error_class_for(adapter_class); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:55
+ def reset_cached_options!(*args, **kwargs); end
+
+ # Sets the adapter to use for JSON operations
+ #
+ # The merged-options cache is only reset when the new adapter loads
+ # successfully. A failed ``use(:nonexistent)`` leaves the cache in
+ # place so the previously-active adapter keeps its cached entries.
+ #
+ # @api public
+ # @param new_adapter [Symbol, String, Module, nil] adapter specification
+ # @return [Class] the loaded adapter class
+ # @example
+ # MultiJSON.use(:oj)
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:145
+ def use(new_adapter); end
+
+ # Emit a deprecation warning at most once per process for the given key
+ #
+ # Defined as a singleton method (rather than via module_function) so
+ # there is exactly one definition for mutation tests to target.
+ # Public so the deprecated ``load_options`` / ``dump_options``
+ # aliases on the {Options} mixin can invoke it without routing
+ # through ``MultiJSON.send(...)``.
+ #
+ # The warning is tagged with the ``:deprecated`` category so callers
+ # can silence the whole set with ``Warning[:deprecated] = false`` or
+ # surface it via ``ruby -W:deprecated`` — the standard Ruby idiom for
+ # library deprecations since 2.7.
+ #
+ # @api private
+ # @param key [Symbol] identifier for the deprecation (typically the method name)
+ # @param message [String] warning message to emit on first call
+ # @return [void]
+ # @example
+ # MultiJSON.warn_deprecation_once(:foo, "MultiJSON.foo is deprecated")
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:74
+ def warn_deprecation_once(key, message); end
+
+ # Executes a block using the specified adapter
+ #
+ # Defined as a singleton method so mutation testing has exactly one
+ # definition to target. The override is stored in fiber-local storage
+ # so concurrent fibers and threads each see their own adapter without
+ # racing on a shared module variable; nested calls save and restore
+ # the previous fiber-local value.
+ #
+ # @api public
+ # @param new_adapter [Symbol, String, Module] adapter to use
+ # @yield block to execute with the temporary adapter
+ # @return [Object] result of the block
+ # @example
+ # MultiJSON.with_adapter(:json_gem) { MultiJSON.dump({}) }
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:241
+ def with_adapter(new_adapter); end
+
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:32
+ def with_engine(*args, **kwargs, &block); end
+
+ private
+
+ # Define a deprecated alias that delegates to a new method name
+ #
+ # The generated singleton method emits a one-time deprecation
+ # warning naming the replacement, then forwards all positional and
+ # keyword arguments plus any block to ``replacement``. Used for the
+ # ``load`` / ``dump`` / ``decode`` / ``encode`` / ``engine*`` /
+ # ``with_engine`` / ``default_engine`` aliases that are scheduled
+ # for removal in v2.0.
+ #
+ # @api private
+ # @param name [Symbol] deprecated method name
+ # @param replacement [Symbol] current-API method to delegate to
+ # @return [Symbol] the defined method name
+ # @example
+ # deprecate_alias :load, :parse
+ #
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:30
+ def deprecate_alias(name, replacement); end
+
+ # Define a deprecated method whose body needs custom delegation
+ #
+ # Used for the ``default_options`` / ``default_options=`` pair
+ # whose body fans out to multiple replacement methods, and for the
+ # ``cached_options`` / ``reset_cached_options!`` no-op stubs that
+ # have no current-API counterpart at all. The block runs in its
+ # own lexical ``self``, which is the ``MultiJSON`` module since
+ # every call site sits inside ``module MultiJSON`` below.
+ #
+ # @api private
+ # @param name [Symbol] deprecated method name
+ # @param message [String] warning to emit on first call
+ # @yield body to evaluate after the warning
+ # @return [Symbol] the defined method name
+ # @example
+ # deprecate_method(:cached_options, "...") { nil }
+ #
+ # pkg:gem/multi_json#lib/multi_json/deprecated.rb:54
+ def deprecate_method(name, message, &body); end
+ end
+end
+
+# Raised when an adapter cannot be loaded or is not recognized
+#
+# @api public
+#
+# pkg:gem/multi_json#lib/multi_json/adapter_error.rb:7
+class MultiJSON::AdapterError < ::ArgumentError
+ # Create a new AdapterError
+ #
+ # @api public
+ # @param message [String, nil] error message
+ # @param cause [Exception, nil] the original exception
+ # @return [AdapterError] new error instance
+ # @example
+ # AdapterError.new("Unknown adapter", cause: original_error)
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_error.rb:16
+ def initialize(message = T.unsafe(nil), cause: T.unsafe(nil)); end
+
+ class << self
+ # Build an AdapterError from an original exception
+ #
+ # The original exception's class name is included in the message
+ # so a downstream consumer reading just the AdapterError can tell
+ # whether the underlying failure was a `LoadError`, an
+ # `ArgumentError` from the spec validator, or some other class
+ # without having to look at `error.cause` separately.
+ #
+ # @api public
+ # @param original_exception [Exception] the original load error
+ # @return [AdapterError] new error with formatted message
+ # @example
+ # AdapterError.build(LoadError.new("cannot load such file"))
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_error.rb:34
+ def build(original_exception); end
+ end
+end
+
+# Handles adapter discovery, loading, and selection
+#
+# Adapters can be specified as:
+# - Symbol/String: adapter name (e.g., :oj, "json_gem")
+# - Module: adapter class directly
+# - nil/false: use default adapter
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:12
+module MultiJSON::AdapterSelector
+ extend ::MultiJSON::AdapterSelector
+
+ # Returns the default adapter to use
+ #
+ # @api private
+ # @return [Symbol] adapter name
+ # @example
+ # AdapterSelector.default_adapter #=> :oj
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:61
+ def default_adapter; end
+
+ # Returns the default adapter class, excluding the given adapter name
+ #
+ # Used by adapters that only implement one direction (e.g.
+ # FastJsonparser only parses) so the other direction can be delegated
+ # to whichever library MultiJSON would otherwise pick.
+ #
+ # @api private
+ # @param excluded [Symbol] adapter name to skip during detection
+ # @return [Class] the adapter class
+ # @example
+ # AdapterSelector.default_adapter_excluding(:fast_jsonparser) #=> MultiJSON::Adapters::Oj
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:76
+ def default_adapter_excluding(excluded); end
+
+ private
+
+ # Detects the best available JSON adapter
+ #
+ # @api private
+ # @return [Symbol] adapter name
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:91
+ def detect_best_adapter; end
+
+ # Returns the fallback adapter when no others available
+ #
+ # The json gem is a Ruby default gem since Ruby 1.9, so in practice
+ # the installable-adapter step always succeeds before reaching this
+ # fallback on any supported Ruby version. The warning below only
+ # fires in tests that deliberately break the require path.
+ #
+ # @api private
+ # @return [Symbol] the json_gem adapter name
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:142
+ def fallback_adapter; end
+
+ # Tries to require and use an installable adapter
+ #
+ # @api private
+ # @param excluding [Symbol, nil] adapter name to skip during detection
+ # @return [Symbol, nil] adapter name if successfully required
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:113
+ def installable_adapter(excluding: T.unsafe(nil)); end
+
+ # Loads an adapter from a specification
+ #
+ # @api private
+ # @param adapter_spec [Symbol, String, Module, nil, false] adapter specification
+ # @return [Class] the adapter class
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:164
+ def load_adapter(adapter_spec); end
+
+ # Loads an adapter by its string name
+ #
+ # ``jrjackson`` (the JrJackson gem's name) is normalized to
+ # ``jr_jackson`` (the adapter file/class name) for backwards
+ # compatibility with the original gem-name alias.
+ #
+ # @api private
+ # @param name [String] adapter name
+ # @return [Class] the adapter class
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:186
+ def load_adapter_by_name(name); end
+
+ # Finds an already-loaded JSON library
+ #
+ # @api private
+ # @param excluding [Symbol, nil] adapter name to skip during detection
+ # @return [Symbol, nil] adapter name if found
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:100
+ def loaded_adapter(excluding: T.unsafe(nil)); end
+
+ # Attempts to require a JSON library
+ #
+ # @api private
+ # @param adapter_name [Symbol] adapter to require
+ # @return [Boolean] true if require succeeded
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:126
+ def try_require(adapter_name); end
+
+ # Validate that an adapter satisfies the documented contract
+ #
+ # Custom adapters are accepted as modules/classes, so fail fast
+ # during adapter resolution rather than later on the first load or
+ # dump call.
+ #
+ # @api private
+ # @param adapter [Module] adapter class or module
+ # @return [Module] the validated adapter
+ # @raise [AdapterError] when the adapter is missing a required class method
+ # or ParseError constant
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:206
+ def validate_adapter!(adapter); end
+
+ # Warns the user about reaching the last-resort fallback
+ #
+ # @api private
+ # @return [void]
+ #
+ # pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:152
+ def warn_about_fallback; end
+end
+
+# Per-adapter metadata, in preference order (fastest first). Each
+# entry maps the adapter symbol to its ``require`` path and the
+# constant whose presence indicates the backing library is already
+# loaded. ``loaded`` is a ``::``-separated path so we can walk it
+# without an explicit ``defined?`` check.
+#
+# The hash order is split per platform: on MRI/TruffleRuby the
+# bundled benchmark suite ranks json_gem ahead of fast_jsonparser/
+# oj/yajl on Ruby 3.4+; on JRuby the FFI-vs-pure-Ruby tradeoff
+# hasn't been re-benchmarked yet, so jr_jackson stays first there.
+# CI re-runs the benchmark with ``--verify-preference`` to fail
+# if the observed ranking diverges.
+# :nocov:
+#
+# pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:28
+MultiJSON::AdapterSelector::ADAPTERS = T.let(T.unsafe(nil), Hash)
+
+# Backwards-compatible view of {ADAPTERS} that exposes only the
+# require paths. Tests still poke at this constant to stub or break
+# the require step.
+#
+# pkg:gem/multi_json#lib/multi_json/adapter_selector.rb:53
+MultiJSON::AdapterSelector::REQUIREMENT_MAP = T.let(T.unsafe(nil), Hash)
+
+# Catalog of process-wide mutexes used to serialize MultiJSON's lazy
+# initializers and adapter swaps. Each mutex protects a distinct
+# piece of mutable state. Callers go through {.synchronize} rather
+# than touching the mutex constants directly so the constants
+# themselves can stay {.private_constant} and the surface of the
+# module is documented in one place.
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/concurrency.rb:12
+module MultiJSON::Concurrency
+ class << self
+ # Run a block while holding the named mutex
+ #
+ # The ``name`` symbol must be one of the keys in the internal
+ # ``MUTEXES`` table; an unknown name raises ``KeyError`` so a
+ # typo at the call site fails fast instead of silently dropping
+ # synchronization on the floor.
+ #
+ # @api private
+ # @param name [Symbol] mutex identifier
+ # @yield block to execute while holding the mutex
+ # @return [Object] the block's return value
+ # @raise [KeyError] when ``name`` does not match a known mutex
+ # @example
+ # MultiJSON::Concurrency.synchronize(:adapter) { ... }
+ #
+ # pkg:gem/multi_json#lib/multi_json/concurrency.rb:53
+ def synchronize(name, &_arg1); end
+ end
+end
+
+# Catalog of mutexes keyed by symbolic name. Each entry maps the
+# public name passed to {.synchronize} to the underlying mutex
+# instance. The names are documented inline so callers can find
+# what each mutex protects without leaving this file.
+#
+# pkg:gem/multi_json#lib/multi_json/concurrency.rb:17
+MultiJSON::Concurrency::MUTEXES = T.let(T.unsafe(nil), Hash)
+
+# Tracks which deprecation warnings have already been emitted so each one
+# fires at most once per process. Stored as a Set rather than a Hash so
+# presence checks have unambiguous semantics for mutation tests.
+#
+# pkg:gem/multi_json#lib/multi_json.rb:52
+MultiJSON::DEPRECATION_WARNINGS_SHOWN = T.let(T.unsafe(nil), Set)
+
+# Legacy aliases for backward compatibility
+#
+# pkg:gem/multi_json#lib/multi_json/parse_error.rb:102
+MultiJSON::DecodeError = MultiJSON::ParseError
+
+# pkg:gem/multi_json#lib/multi_json/parse_error.rb:102
+MultiJSON::LoadError = MultiJSON::ParseError
+
+# Mixin providing configurable parse/generate options
+#
+# Supports static hashes or dynamic callables (procs/lambdas).
+# Extended by both MultiJSON (global options) and Adapter classes.
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/options.rb:10
+module MultiJSON::Options
+ # Get default generate options
+ #
+ # @api private
+ # @deprecated Use {#default_generate_options} instead. Will be removed in v2.0.
+ # @return [Hash] frozen empty hash
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:155
+ def default_dump_options; end
+
+ # Get default generate options
+ #
+ # @api private
+ # @return [Hash] frozen empty hash
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:81
+ def default_generate_options; end
+
+ # Get default parse options
+ #
+ # @api private
+ # @deprecated Use {#default_parse_options} instead. Will be removed in v2.0.
+ # @return [Hash] frozen empty hash
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:146
+ def default_load_options; end
+
+ # Get default parse options
+ #
+ # @api private
+ # @return [Hash] frozen empty hash
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:73
+ def default_parse_options; end
+
+ # Get options for generate operations
+ #
+ # @api public
+ # @deprecated Use {#generate_options} instead. Will be removed in v2.0.
+ # @param args [Array] forwarded to the callable, ignored otherwise
+ # @return [Hash] resolved options hash
+ # @example
+ # MultiJSON.dump_options #=> {}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:135
+ def dump_options(*args); end
+
+ # Set options for generate operations
+ #
+ # @api public
+ # @deprecated Use {#generate_options=} instead. Will be removed in v2.0.
+ # @param options [Hash, Proc] options hash or callable
+ # @return [Hash, Proc] the options
+ # @example
+ # MultiJSON.dump_options = {pretty: true}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:107
+ def dump_options=(options); end
+
+ # Get options for generate operations
+ #
+ # @api public
+ # @param args [Array] forwarded to the callable, ignored otherwise
+ # @return [Hash] resolved options hash
+ # @example
+ # MultiJSON.generate_options #=> {}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:65
+ def generate_options(*args); end
+
+ # Set options for generate operations
+ #
+ # @api public
+ # @param options [Hash, Proc] options hash or callable
+ # @return [Hash, Proc] the options
+ # @example
+ # MultiJSON.generate_options = {pretty: true}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:37
+ def generate_options=(options); end
+
+ # Get options for parse operations
+ #
+ # @api public
+ # @deprecated Use {#parse_options} instead. Will be removed in v2.0.
+ # @param args [Array] forwarded to the callable, ignored otherwise
+ # @return [Hash] resolved options hash
+ # @example
+ # MultiJSON.load_options #=> {}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:121
+ def load_options(*args); end
+
+ # Set options for parse operations
+ #
+ # @api public
+ # @deprecated Use {#parse_options=} instead. Will be removed in v2.0.
+ # @param options [Hash, Proc] options hash or callable
+ # @return [Hash, Proc] the options
+ # @example
+ # MultiJSON.load_options = {symbolize_keys: true}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:93
+ def load_options=(options); end
+
+ # Get options for parse operations
+ #
+ # When `@parse_options` is a callable (proc/lambda), it's invoked
+ # with `args` as positional arguments — typically the merged
+ # options hash from `Adapter.merged_parse_options`. When it's a
+ # plain hash, `args` is ignored.
+ #
+ # @api public
+ # @param args [Array] forwarded to the callable, ignored otherwise
+ # @return [Hash] resolved options hash
+ # @example
+ # MultiJSON.parse_options #=> {}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:54
+ def parse_options(*args); end
+
+ # Set options for parse operations
+ #
+ # @api public
+ # @param options [Hash, Proc] options hash or callable
+ # @return [Hash, Proc] the options
+ # @example
+ # MultiJSON.parse_options = {symbolize_keys: true}
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:25
+ def parse_options=(options); end
+
+ private
+
+ # Invokes a callable options provider
+ #
+ # @api private
+ # @param callable [Proc] options provider
+ # @param args [Array] arguments forwarded when the callable is non-arity-zero
+ # @return [Hash] options returned by the callable
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:182
+ def invoke_callable(callable, *args); end
+
+ # Resolves options from a hash or callable
+ #
+ # @api private
+ # @param options [Hash, Proc, nil] options configuration
+ # @param args [Array] arguments forwarded to a callable provider
+ # @return [Hash, nil] resolved options hash
+ #
+ # pkg:gem/multi_json#lib/multi_json/options.rb:167
+ def resolve_options(options, *args); end
+end
+
+# Steep needs an inline `#:` annotation here because `{}.freeze`
+# would be inferred as `Hash[untyped, untyped]` and trip
+# `UnannotatedEmptyCollection`. The annotation requires
+# `Hash.new.freeze` (not the `{}.freeze` rubocop would prefer)
+# because the `#:` cast only applies to method-call results.
+#
+# pkg:gem/multi_json#lib/multi_json/options.rb:16
+MultiJSON::Options::EMPTY_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# Thread-safe bounded cache for merged options hashes
+#
+# Caches are separated for load and dump operations. Each cache is
+# bounded to prevent unbounded memory growth when options are
+# generated dynamically. The ``Store`` backend is chosen at load time
+# based on ``RUBY_ENGINE``: JRuby uses Concurrent::Map (shipped as a
+# runtime dependency of the java-platform gem); MRI and TruffleRuby
+# use a Hash guarded by a Mutex.
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/options_cache.rb:14
+module MultiJSON::OptionsCache
+ class << self
+ # Get the dump options cache
+ #
+ # @api private
+ # @return [Store] dump cache store
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache.rb:25
+ def dump; end
+
+ # Get the load options cache
+ #
+ # @api private
+ # @return [Store] load cache store
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache.rb:31
+ def load; end
+
+ # Maximum number of entries per cache store
+ #
+ # Applies to both the dump and load caches. Existing entries are
+ # left in place until normal eviction trims them below a lowered
+ # limit; call {.reset} if you need to evict immediately.
+ #
+ # @api public
+ # @return [Integer] current cache size limit
+ # @example
+ # MultiJSON::OptionsCache.max_cache_size = 5000
+ # MultiJSON::OptionsCache.max_cache_size #=> 5000
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache.rb:44
+ def max_cache_size; end
+
+ # Set the maximum number of entries per cache store
+ #
+ # @api public
+ # @param value [Integer] positive entry cap
+ # @return [Integer] the validated value
+ # @raise [ArgumentError] when value is not a positive Integer
+ # @example
+ # MultiJSON::OptionsCache.max_cache_size = 5000
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache.rb:54
+ def max_cache_size=(value); end
+
+ # Reset both caches
+ #
+ # @api private
+ # @return [void]
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache.rb:64
+ def reset; end
+ end
+end
+
+# Dynamic require path so MRI (mutex_store) and JRuby
+# (concurrent_store) execute the same physical line, avoiding a
+# dead-branch ``require_relative`` that would otherwise drop
+# JRuby's line coverage below 100%.
+#
+# pkg:gem/multi_json#lib/multi_json/options_cache.rb:80
+MultiJSON::OptionsCache::BACKENDS = T.let(T.unsafe(nil), Hash)
+
+# Default bound on the number of cached entries per store. Applications
+# that dynamically generate many distinct option hashes can raise this
+# via {.max_cache_size=}.
+#
+# pkg:gem/multi_json#lib/multi_json/options_cache.rb:18
+MultiJSON::OptionsCache::DEFAULT_MAX_CACHE_SIZE = T.let(T.unsafe(nil), Integer)
+
+# Thread-safe cache store backed by a Hash guarded by a Mutex
+#
+# Used on MRI and TruffleRuby, where a runtime dependency on
+# concurrent-ruby would be overkill: the GVL on MRI makes single
+# lookups atomic, and locking on both reads and writes keeps the
+# small perf cost predictable across engines without adding a
+# runtime dependency.
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/options_cache/mutex_store.rb:14
+class MultiJSON::OptionsCache::Store
+ # Create a new cache store
+ #
+ # @api private
+ # @return [Store] new store instance
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache/mutex_store.rb:19
+ def initialize; end
+
+ # Fetch a value from cache or compute it
+ #
+ # When called with a block, returns the cached value or computes a
+ # new one. When called without a block, returns the cached value or
+ # the supplied default if the key is missing. Nil cached values are
+ # preserved because ``Hash#fetch`` only falls through to the default
+ # block when the key is truly missing. The ``block_given?`` check
+ # is hoisted out of the mutex so the no-block read path runs the
+ # check once per call instead of once inside the critical section.
+ #
+ # @api private
+ # @param key [Object] cache key
+ # @param default [Object] value to return when key is missing and no
+ # block is given
+ # @yield block to compute value if not cached
+ # @return [Object] cached, computed, or default value
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache/mutex_store.rb:53
+ def fetch(key, default = T.unsafe(nil)); end
+
+ # Clear all cached entries
+ #
+ # Held under the mutex because TruffleRuby (which also uses this
+ # backend via the ruby-platform gem) has true parallelism: a
+ # concurrent ``fetch`` racing with ``Hash#clear`` could corrupt
+ # iteration in a way that MRI's GVL would otherwise prevent.
+ #
+ # @api private
+ # @return [void]
+ #
+ # pkg:gem/multi_json#lib/multi_json/options_cache/mutex_store.rb:33
+ def reset; end
+end
+
+# Raised when JSON parsing fails
+#
+# Wraps the underlying adapter's parse error with the original input
+# data, plus best-effort line and column extraction from the adapter's
+# error message. Line/column are populated for adapters that include
+# them in their messages (Oj, the json gem) and remain nil for
+# adapters that don't (Yajl, fast_jsonparser).
+#
+# @api public
+#
+# pkg:gem/multi_json#lib/multi_json/parse_error.rb:13
+class MultiJSON::ParseError < ::StandardError
+ # Create a new ParseError
+ #
+ # @api public
+ # @param message [String, nil] error message
+ # @param data [String, nil] the input that failed to parse
+ # @param cause [Exception, nil] the original exception
+ # @return [ParseError] new error instance
+ # @example
+ # ParseError.new("unexpected token at line 1 column 2", data: "{}")
+ #
+ # pkg:gem/multi_json#lib/multi_json/parse_error.rb:57
+ def initialize(message = T.unsafe(nil), data: T.unsafe(nil), cause: T.unsafe(nil)); end
+
+ # The 1-based column reported by the adapter
+ #
+ # @api public
+ # @return [Integer, nil] column number, or nil if the adapter's message
+ # did not include one
+ # @example
+ # error.column #=> 3
+ #
+ # pkg:gem/multi_json#lib/multi_json/parse_error.rb:46
+ def column; end
+
+ # The input string that failed to parse
+ #
+ # @api public
+ # @return [String, nil] the original input data
+ # @example
+ # error.data #=> "{invalid json}"
+ #
+ # pkg:gem/multi_json#lib/multi_json/parse_error.rb:28
+ def data; end
+
+ # The 1-based line number reported by the adapter
+ #
+ # @api public
+ # @return [Integer, nil] line number, or nil if the adapter's message
+ # did not include one
+ # @example
+ # error.line #=> 1
+ #
+ # pkg:gem/multi_json#lib/multi_json/parse_error.rb:37
+ def line; end
+
+ private
+
+ # Match an adapter error message against the line/column pattern
+ #
+ # Adapter error messages sometimes embed bytes from the failing
+ # input (e.g., the json gem's ``"invalid byte sequence in UTF-8"``
+ # error). The pattern is pure ASCII so it's compatible with any
+ # encoding, but a UTF-8 string with invalid bytes still trips the
+ # regex engine — ``String#scrub`` replaces those bytes so the
+ # match can proceed. Strings in binary (ASCII-8BIT) or any valid
+ # encoding pass through scrub untouched.
+ #
+ # @api private
+ # @param message [String, nil] the adapter's error message
+ # @return [MatchData, nil] the regex match, or nil if no message or
+ # no location fragment was found
+ #
+ # pkg:gem/multi_json#lib/multi_json/parse_error.rb:94
+ def location_match(message); end
+
+ class << self
+ # Build a ParseError from an original exception
+ #
+ # @api public
+ # @param original_exception [Exception] the adapter's parse error
+ # @param data [String] the input that failed to parse
+ # @return [ParseError] new error with formatted message
+ # @example
+ # ParseError.build(JSON::ParserError.new("..."), "{bad json}")
+ #
+ # pkg:gem/multi_json#lib/multi_json/parse_error.rb:74
+ def build(original_exception, data); end
+ end
+end
+
+# Regex that matches the "line N[, ]column M" fragment inside an
+# adapter error message. The separator between line and column is
+# permissive — Oj emits ``"line 1, column 3"`` while the json gem
+# emits ``"line 1 column 2"`` — so ``[,\s]+`` covers both. Column
+# is optional so messages like ``"at line 5"`` still yield a line.
+#
+# pkg:gem/multi_json#lib/multi_json/parse_error.rb:19
+MultiJSON::ParseError::LOCATION_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# Current version string in semver format
+#
+# pkg:gem/multi_json#lib/multi_json/version.rb:29
+MultiJSON::VERSION = T.let(T.unsafe(nil), String)
+
+# Version information for MultiJSON
+#
+# @api private
+#
+# pkg:gem/multi_json#lib/multi_json/version.rb:7
+class MultiJSON::Version
+ class << self
+ # Return the version string
+ #
+ # @api private
+ # @return [String] version in semver format
+ #
+ # pkg:gem/multi_json#lib/multi_json/version.rb:22
+ def to_s; end
+ end
+end
+
+# Major version number
+#
+# pkg:gem/multi_json#lib/multi_json/version.rb:9
+MultiJSON::Version::MAJOR = T.let(T.unsafe(nil), Integer)
+
+# Minor version number
+#
+# pkg:gem/multi_json#lib/multi_json/version.rb:11
+MultiJSON::Version::MINOR = T.let(T.unsafe(nil), Integer)
+
+# Patch version number
+#
+# pkg:gem/multi_json#lib/multi_json/version.rb:13
+MultiJSON::Version::PATCH = T.let(T.unsafe(nil), Integer)
+
+# Pre-release version suffix
+#
+# pkg:gem/multi_json#lib/multi_json/version.rb:15
+MultiJSON::Version::PRE = T.let(T.unsafe(nil), T.untyped)
+
+# Backward-compatible alias for the legacy ``MultiJson`` constant name
+#
+# Downstream code that still writes ``MultiJson.parse(...)`` or
+# ``rescue MultiJson::ParseError`` continues to work, but emits a
+# one-time deprecation warning pointing at ``MultiJSON``. Each public
+# method on {MultiJSON} gets an explicit forwarder defined on this
+# module, and constant access resolves via {.const_missing}, so both
+# dotted calls and ``::`` constant lookups (including rescue clauses)
+# route through the canonical module.
+#
+# @api public
+# @deprecated Use {MultiJSON} (all-caps) instead. Will be removed in v2.0.
+#
+# pkg:gem/multi_json#lib/multi_json.rb:283
+module MultiJson
+ class << self
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def adapter(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def adapter=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def append_features(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def cached_options(*args, **kwargs, &block); end
+
+ # Resolve missing constants to their {MultiJSON} counterparts
+ #
+ # Enables ``rescue MultiJson::ParseError`` and
+ # ``MultiJson::Adapters::Oj`` to keep working during the
+ # deprecation cycle.
+ #
+ # @api public
+ # @param name [Symbol] constant name
+ # @return [Object] the resolved constant from {MultiJSON}
+ # @example
+ # MultiJson::ParseError # returns MultiJSON::ParseError
+ #
+ # pkg:gem/multi_json#lib/multi_json.rb:314
+ def const_missing(name); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def current_adapter(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def decode(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_adapter(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_adapter_excluding(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_dump_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_engine(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_generate_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_load_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_options=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def default_parse_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def dump(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def dump_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def dump_options=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def encode(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def engine(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def engine=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def extend_object(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def generate(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def generate_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def generate_options=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def load(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def load_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def load_options=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def parse(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def parse_error_class_for(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def parse_options(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def parse_options=(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def prepend_features(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def reset_cached_options!(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def use(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def warn_deprecation_once(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def with_adapter(*args, **kwargs, &block); end
+
+ # pkg:gem/multi_json#lib/multi_json.rb:295
+ def with_engine(*args, **kwargs, &block); end
+ end
+end
diff --git a/sorbet/rbi/gems/netrc@0.11.0.rbi b/sorbet/rbi/gems/netrc@0.11.0.rbi
new file mode 100644
index 0000000..b1ad683
--- /dev/null
+++ b/sorbet/rbi/gems/netrc@0.11.0.rbi
@@ -0,0 +1,147 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `netrc` gem.
+# Please instead update this file by running `bin/tapioca gem netrc`.
+
+
+# pkg:gem/netrc#lib/netrc.rb:3
+class Netrc
+ # pkg:gem/netrc#lib/netrc.rb:166
+ def initialize(path, data); end
+
+ # pkg:gem/netrc#lib/netrc.rb:180
+ def [](k); end
+
+ # pkg:gem/netrc#lib/netrc.rb:188
+ def []=(k, info); end
+
+ # pkg:gem/netrc#lib/netrc.rb:200
+ def delete(key); end
+
+ # pkg:gem/netrc#lib/netrc.rb:211
+ def each(&block); end
+
+ # pkg:gem/netrc#lib/netrc.rb:196
+ def length; end
+
+ # pkg:gem/netrc#lib/netrc.rb:215
+ def new_item(m, l, p); end
+
+ # pkg:gem/netrc#lib/netrc.rb:178
+ def new_item_prefix; end
+
+ # pkg:gem/netrc#lib/netrc.rb:178
+ def new_item_prefix=(_arg0); end
+
+ # pkg:gem/netrc#lib/netrc.rb:219
+ def save; end
+
+ # pkg:gem/netrc#lib/netrc.rb:233
+ def unparse; end
+
+ class << self
+ # pkg:gem/netrc#lib/netrc.rb:42
+ def check_permissions(path); end
+
+ # pkg:gem/netrc#lib/netrc.rb:33
+ def config; end
+
+ # pkg:gem/netrc#lib/netrc.rb:37
+ def configure; end
+
+ # pkg:gem/netrc#lib/netrc.rb:10
+ def default_path; end
+
+ # pkg:gem/netrc#lib/netrc.rb:14
+ def home_path; end
+
+ # pkg:gem/netrc#lib/netrc.rb:85
+ def lex(lines); end
+
+ # pkg:gem/netrc#lib/netrc.rb:29
+ def netrc_filename; end
+
+ # Returns two values, a header and a list of items.
+ # Each item is a tuple, containing some or all of:
+ # - machine keyword (including trailing whitespace+comments)
+ # - machine name
+ # - login keyword (including surrounding whitespace+comments)
+ # - login
+ # - password keyword (including surrounding whitespace+comments)
+ # - password
+ # - trailing chars
+ # This lets us change individual fields, then write out the file
+ # with all its original formatting.
+ #
+ # pkg:gem/netrc#lib/netrc.rb:129
+ def parse(ts); end
+
+ # Reads path and parses it as a .netrc file. If path doesn't
+ # exist, returns an empty object. Decrypt paths ending in .gpg.
+ #
+ # pkg:gem/netrc#lib/netrc.rb:51
+ def read(path = T.unsafe(nil)); end
+
+ # pkg:gem/netrc#lib/netrc.rb:112
+ def skip?(s); end
+ end
+end
+
+# pkg:gem/netrc#lib/netrc.rb:8
+Netrc::CYGWIN = T.let(T.unsafe(nil), T.untyped)
+
+# pkg:gem/netrc#lib/netrc.rb:244
+class Netrc::Entry < ::Struct
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def login; end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def login=(_); end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def password; end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def password=(_); end
+
+ # pkg:gem/netrc#lib/netrc.rb:245
+ def to_ary; end
+
+ class << self
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def [](*_arg0); end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def inspect; end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def keyword_init?; end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def members; end
+
+ # pkg:gem/netrc#lib/netrc.rb:244
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/netrc#lib/netrc.rb:250
+class Netrc::Error < ::StandardError; end
+
+# pkg:gem/netrc#lib/netrc.rb:68
+class Netrc::TokenArray < ::Array
+ # pkg:gem/netrc#lib/netrc.rb:76
+ def readto; end
+
+ # pkg:gem/netrc#lib/netrc.rb:69
+ def take; end
+end
+
+# pkg:gem/netrc#lib/netrc.rb:4
+Netrc::VERSION = T.let(T.unsafe(nil), String)
+
+# see http://stackoverflow.com/questions/4871309/what-is-the-correct-way-to-detect-if-ruby-is-running-on-windows
+#
+# pkg:gem/netrc#lib/netrc.rb:7
+Netrc::WINDOWS = T.let(T.unsafe(nil), T.untyped)
diff --git a/sorbet/rbi/gems/nokogiri@1.19.4.rbi b/sorbet/rbi/gems/nokogiri@1.19.4.rbi
new file mode 100644
index 0000000..7b99d0f
--- /dev/null
+++ b/sorbet/rbi/gems/nokogiri@1.19.4.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `nokogiri` gem.
+# Please instead update this file by running `bin/tapioca gem nokogiri`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/packs-specification@0.0.11.rbi b/sorbet/rbi/gems/packs-specification@0.0.11.rbi
new file mode 100644
index 0000000..bc2a1e4
--- /dev/null
+++ b/sorbet/rbi/gems/packs-specification@0.0.11.rbi
@@ -0,0 +1,160 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `packs-specification` gem.
+# Please instead update this file by running `bin/tapioca gem packs-specification`.
+
+
+# pkg:gem/packs-specification#lib/packs/rspec/fixture_helper.rb:4
+module FixtureHelper
+ # pkg:gem/packs-specification#lib/packs/rspec/fixture_helper.rb:30
+ sig { params(path: ::String).void }
+ def delete_app_file(path); end
+
+ # pkg:gem/packs-specification#lib/packs/rspec/fixture_helper.rb:8
+ sig { params(path: ::String, content: ::String).returns(::String) }
+ def write_file(path, content = T.unsafe(nil)); end
+
+ # pkg:gem/packs-specification#lib/packs/rspec/fixture_helper.rb:21
+ sig { params(pack_name: ::String, config: T::Hash[T.untyped, T.untyped]).void }
+ def write_pack(pack_name, config = T.unsafe(nil)); end
+end
+
+# We let `packs-specification` define some API methods such as all, find, and for_file,
+# because this allows a production environment to require `packs-specification` only and get some simple functionality, without
+# needing to load all of `packs`.
+#
+# pkg:gem/packs-specification#lib/packs/pack.rb:3
+module Packs
+ class << self
+ # pkg:gem/packs-specification#lib/packs-specification.rb:19
+ sig { returns(T::Array[::Packs::Pack]) }
+ def all; end
+
+ # pkg:gem/packs-specification#lib/packs-specification.rb:24
+ sig { params(name: ::String).returns(T.nilable(::Packs::Pack)) }
+ def find(name); end
+
+ # pkg:gem/packs-specification#lib/packs-specification.rb:29
+ sig { params(file_path: T.any(::Pathname, ::String)).returns(T.nilable(::Packs::Pack)) }
+ def for_file(file_path); end
+ end
+end
+
+# pkg:gem/packs-specification#lib/packs-specification.rb:13
+Packs::PACKAGE_FILE = T.let(T.unsafe(nil), String)
+
+# pkg:gem/packs-specification#lib/packs/pack.rb:4
+class Packs::Pack
+ # pkg:gem/packs-specification#lib/packs/pack.rb:17
+ sig { params(name: ::String, path: ::Pathname, relative_path: ::Pathname).void }
+ def initialize(name:, path:, relative_path:); end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:69
+ sig { returns(::String) }
+ def inspect; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:55
+ sig { returns(T::Boolean) }
+ def is_gem?; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:50
+ sig { returns(::String) }
+ def last_name; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:60
+ sig { returns(T::Hash[T.untyped, T.untyped]) }
+ def metadata; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:8
+ sig { returns(::String) }
+ def name; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:11
+ sig { returns(::Pathname) }
+ def path; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:39
+ sig { returns(T::Hash[T.untyped, T.untyped]) }
+ def raw_hash; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:14
+ sig { returns(::Pathname) }
+ def relative_path; end
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:44
+ sig { params(relative: T::Boolean).returns(::Pathname) }
+ def yml(relative: T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/packs-specification#lib/packs/pack.rb:65
+ sig { returns(T::Array[::Symbol]) }
+ def instance_variables_to_inspect; end
+
+ class << self
+ # pkg:gem/packs-specification#lib/packs/pack.rb:26
+ sig { params(package_yml_absolute_path: ::Pathname).returns(::Packs::Pack) }
+ def from(package_yml_absolute_path); end
+ end
+end
+
+# pkg:gem/packs-specification#lib/packs/specification/configuration.rb:4
+module Packs::Specification
+ class << self
+ # pkg:gem/packs-specification#lib/packs/specification.rb:31
+ sig { returns(T::Array[::Packs::Pack]) }
+ def all; end
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:24
+ sig { void }
+ def bust_cache!; end
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:18
+ sig { returns(::Packs::Specification::Configuration) }
+ def config; end
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:36
+ sig { params(name: ::String).returns(T.nilable(::Packs::Pack)) }
+ def find(name); end
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:41
+ sig { params(file_path: T.any(::Pathname, ::String)).returns(T.nilable(::Packs::Pack)) }
+ def for_file(file_path); end
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:13
+ sig { returns(::Pathname) }
+ def root; end
+
+ private
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:65
+ sig { returns(T::Array[::Pathname]) }
+ def package_glob_patterns; end
+
+ # pkg:gem/packs-specification#lib/packs/specification.rb:51
+ sig { returns(T::Hash[::String, ::Packs::Pack]) }
+ def packs_by_name; end
+ end
+end
+
+# pkg:gem/packs-specification#lib/packs/specification/configuration.rb:5
+class Packs::Specification::Configuration < ::T::Struct
+ prop :pack_paths, T::Array[::String]
+
+ class << self
+ # pkg:gem/packs-specification#lib/packs/specification/configuration.rb:17
+ sig { returns(::Packs::Specification::Configuration) }
+ def fetch; end
+
+ # pkg:gem/packs-specification#lib/packs/specification/configuration.rb:26
+ sig { params(config_hash: T::Hash[T.untyped, T.untyped]).returns(T::Array[::String]) }
+ def pack_paths(config_hash); end
+ end
+end
+
+# pkg:gem/packs-specification#lib/packs/specification/configuration.rb:7
+Packs::Specification::Configuration::CONFIGURATION_PATHNAME = T.let(T.unsafe(nil), Pathname)
+
+# pkg:gem/packs-specification#lib/packs/specification/configuration.rb:9
+Packs::Specification::Configuration::DEFAULT_PACK_PATHS = T.let(T.unsafe(nil), Array)
diff --git a/sorbet/rbi/gems/packs@0.0.5.rbi b/sorbet/rbi/gems/packs@0.0.5.rbi
deleted file mode 100644
index 71c2005..0000000
--- a/sorbet/rbi/gems/packs@0.0.5.rbi
+++ /dev/null
@@ -1,111 +0,0 @@
-# typed: true
-
-# DO NOT EDIT MANUALLY
-# This is an autogenerated file for types exported from the `packs` gem.
-# Please instead update this file by running `bin/tapioca gem packs`.
-
-# source://packs//lib/packs/pack.rb#3
-module Packs
- class << self
- # source://packs//lib/packs.rb#16
- sig { returns(T::Array[::Packs::Pack]) }
- def all; end
-
- # source://packs//lib/packs.rb#34
- sig { void }
- def bust_cache!; end
-
- # source://packs//lib/packs.rb#41
- sig { returns(::Packs::Private::Configuration) }
- def config; end
-
- # @yield [config]
- #
- # source://packs//lib/packs.rb#47
- sig { params(blk: T.proc.params(arg0: ::Packs::Private::Configuration).void).void }
- def configure(&blk); end
-
- # source://packs//lib/packs.rb#21
- sig { params(name: ::String).returns(T.nilable(::Packs::Pack)) }
- def find(name); end
-
- # source://packs//lib/packs.rb#26
- sig { params(file_path: T.any(::Pathname, ::String)).returns(T.nilable(::Packs::Pack)) }
- def for_file(file_path); end
-
- private
-
- # source://packs//lib/packs.rb#73
- sig { returns(T::Array[::Pathname]) }
- def package_glob_patterns; end
-
- # source://packs//lib/packs.rb#59
- sig { returns(T::Hash[::String, ::Packs::Pack]) }
- def packs_by_name; end
- end
-end
-
-# source://packs//lib/packs.rb#10
-Packs::PACKAGE_FILE = T.let(T.unsafe(nil), String)
-
-# source://packs//lib/packs/pack.rb#4
-class Packs::Pack < ::T::Struct
- const :name, ::String
- const :path, ::Pathname
- const :raw_hash, T::Hash[T.untyped, T.untyped]
- const :relative_path, ::Pathname
-
- # source://packs//lib/packs/pack.rb#34
- sig { returns(::String) }
- def last_name; end
-
- # source://packs//lib/packs/pack.rb#39
- sig { returns(T::Hash[T.untyped, T.untyped]) }
- def metadata; end
-
- # source://packs//lib/packs/pack.rb#28
- sig { params(relative: T::Boolean).returns(::Pathname) }
- def yml(relative: T.unsafe(nil)); end
-
- class << self
- # source://packs//lib/packs/pack.rb#13
- sig { params(package_yml_absolute_path: ::Pathname).returns(::Packs::Pack) }
- def from(package_yml_absolute_path); end
-
- # source://sorbet-runtime/0.5.9924/lib/types/struct.rb#13
- def inherited(s); end
- end
-end
-
-# source://packs//lib/packs/private/configuration.rb#4
-module Packs::Private
- class << self
- # source://packs//lib/packs/private.rb#10
- sig { returns(::Pathname) }
- def root; end
- end
-end
-
-# source://packs//lib/packs/private/configuration.rb#5
-class Packs::Private::Configuration < ::T::Struct
- prop :pack_paths, T::Array[::String]
-
- class << self
- # source://packs//lib/packs/private/configuration.rb#17
- sig { returns(::Packs::Private::Configuration) }
- def fetch; end
-
- # source://sorbet-runtime/0.5.9924/lib/types/struct.rb#13
- def inherited(s); end
-
- # source://packs//lib/packs/private/configuration.rb#26
- sig { params(config_hash: T::Hash[T.untyped, T.untyped]).returns(T::Array[::String]) }
- def pack_paths(config_hash); end
- end
-end
-
-# source://packs//lib/packs/private/configuration.rb#7
-Packs::Private::Configuration::CONFIGURATION_PATHNAME = T.let(T.unsafe(nil), Pathname)
-
-# source://packs//lib/packs/private/configuration.rb#9
-Packs::Private::Configuration::DEFAULT_PACK_PATHS = T.let(T.unsafe(nil), Array)
diff --git a/sorbet/rbi/gems/packs@0.3.0.rbi b/sorbet/rbi/gems/packs@0.3.0.rbi
new file mode 100644
index 0000000..098b1fd
--- /dev/null
+++ b/sorbet/rbi/gems/packs@0.3.0.rbi
@@ -0,0 +1,886 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `packs` gem.
+# Please instead update this file by running `bin/tapioca gem packs`.
+
+
+# pkg:gem/packs#lib/packs/private/file_move_operation.rb:3
+module Packs
+ class << self
+ # pkg:gem/packs#lib/packs.rb:146
+ sig { params(pack_name: ::String, dependency_name: ::String).void }
+ def add_dependency!(pack_name:, dependency_name:); end
+
+ # pkg:gem/packs#lib/packs.rb:261
+ sig { void }
+ def bust_cache!; end
+
+ # pkg:gem/packs#lib/packs.rb:52
+ sig { params(files: T::Array[::String]).returns(T::Boolean) }
+ def check(files); end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:69
+ sig { returns(::Packs::Configuration) }
+ def config; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:75
+ sig { params(blk: T.proc.params(arg0: ::Packs::Configuration).void).void }
+ def configure(&blk); end
+
+ # pkg:gem/packs#lib/packs.rb:69
+ sig do
+ params(
+ pack_name: ::String,
+ enforce_privacy: T::Boolean,
+ enforce_layers: T::Boolean,
+ enforce_dependencies: T.nilable(T::Boolean),
+ team: T.nilable(::CodeTeams::Team)
+ ).void
+ end
+ def create_pack!(pack_name:, enforce_privacy: T.unsafe(nil), enforce_layers: T.unsafe(nil), enforce_dependencies: T.unsafe(nil), team: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs.rb:267
+ sig { void }
+ def lint_package_todo_yml_files!; end
+
+ # pkg:gem/packs#lib/packs.rb:272
+ sig { params(packs: T::Array[::Packs::Pack]).void }
+ def lint_package_yml_files!(packs); end
+
+ # pkg:gem/packs#lib/packs.rb:233
+ sig { params(type: ::String, pack_name: T.nilable(::String), limit: ::Integer).void }
+ def list_top_violations(type:, pack_name:, limit:); end
+
+ # pkg:gem/packs#lib/packs.rb:120
+ sig do
+ params(
+ paths_relative_to_root: T::Array[::String],
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def make_public!(paths_relative_to_root: T.unsafe(nil), per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs.rb:203
+ sig do
+ params(
+ pack_name: ::String,
+ destination: ::String,
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def move_to_folder!(pack_name:, destination:, per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs.rb:92
+ sig do
+ params(
+ pack_name: ::String,
+ paths_relative_to_root: T::Array[::String],
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def move_to_pack!(pack_name:, paths_relative_to_root: T.unsafe(nil), per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs.rb:173
+ sig do
+ params(
+ pack_name: ::String,
+ parent_name: ::String,
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def move_to_parent!(pack_name:, parent_name:, per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs.rb:252
+ sig { params(file: ::String, find: ::Pathname, replace_with: ::Pathname).void }
+ def replace_in_file(file:, find:, replace_with:); end
+
+ # pkg:gem/packs#lib/packs.rb:29
+ sig { void }
+ def start_interactive_mode!; end
+
+ # pkg:gem/packs#lib/packs.rb:34
+ sig { returns(T::Boolean) }
+ def update; end
+
+ # pkg:gem/packs#lib/packs.rb:43
+ sig { returns(T::Boolean) }
+ def validate; end
+ end
+end
+
+# pkg:gem/packs#lib/packs/cli.rb:6
+class Packs::CLI < ::Thor
+ # pkg:gem/packs#lib/packs/cli.rb:34
+ sig { params(from_pack: ::String, to_pack: ::String).void }
+ def add_dependency(from_pack, to_pack); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:121
+ sig { params(paths: ::String).void }
+ def check(*paths); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:14
+ sig { params(pack_name: ::String).void }
+ def create(pack_name); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:136
+ sig { params(pack_names: ::String).void }
+ def get_info(*pack_names); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:103
+ sig { void }
+ def lint_package_todo_yml_files; end
+
+ # pkg:gem/packs#lib/packs/cli.rb:109
+ sig { params(pack_names: ::String).void }
+ def lint_package_yml_files(*pack_names); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:62
+ sig { params(type: ::String, pack_name: T.nilable(::String)).void }
+ def list_top_violations(type, pack_name = T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:80
+ sig { params(paths: ::String).void }
+ def make_public(*paths); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:93
+ sig { params(pack_name: ::String, paths: ::String).void }
+ def move(pack_name, *paths); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:169
+ sig { params(pack_name: ::String, destination: ::String).void }
+ def move_to_folder(pack_name, destination); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:159
+ sig { params(child_pack_name: ::String, parent_pack_name: ::String).void }
+ def move_to_parent(child_pack_name, parent_pack_name); end
+
+ # pkg:gem/packs#lib/packs/cli.rb:152
+ sig { void }
+ def rename; end
+
+ # pkg:gem/packs#lib/packs/cli.rb:127
+ sig { void }
+ def update; end
+
+ # pkg:gem/packs#lib/packs/cli.rb:115
+ sig { void }
+ def validate; end
+
+ private
+
+ # pkg:gem/packs#lib/packs/cli.rb:185
+ sig { void }
+ def exit_successfully; end
+
+ # pkg:gem/packs#lib/packs/cli.rb:180
+ sig { params(pack_names: T::Array[::String]).returns(T::Array[::Packs::Pack]) }
+ def parse_pack_names(pack_names); end
+end
+
+# pkg:gem/packs#lib/packs/cli.rb:42
+Packs::CLI::POSSIBLE_TYPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/packs#lib/packs/code_ownership_post_processor.rb:4
+class Packs::CodeOwnershipPostProcessor
+ include ::Packs::PerFileProcessorInterface
+
+ # pkg:gem/packs#lib/packs/code_ownership_post_processor.rb:9
+ sig { void }
+ def initialize; end
+
+ # pkg:gem/packs#lib/packs/code_ownership_post_processor.rb:44
+ sig { override.params(file_move_operations: T::Array[::Packs::Private::FileMoveOperation]).void }
+ def after_move_files!(file_move_operations); end
+
+ # pkg:gem/packs#lib/packs/code_ownership_post_processor.rb:15
+ sig { override.params(file_move_operation: ::Packs::Private::FileMoveOperation).void }
+ def before_move_file!(file_move_operation); end
+end
+
+# pkg:gem/packs#lib/packs/configuration.rb:7
+class Packs::Configuration
+ # pkg:gem/packs#lib/packs/configuration.rb:30
+ sig { void }
+ def initialize; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:43
+ sig { void }
+ def bust_cache!; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:48
+ sig { returns(T::Boolean) }
+ def default_enforce_dependencies; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:38
+ sig { returns(T::Boolean) }
+ def enforce_dependencies; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:14
+ sig { params(enforce_dependencies: T::Boolean).void }
+ def enforce_dependencies=(enforce_dependencies); end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:27
+ sig { returns(T.proc.params(output: ::String).void) }
+ def on_package_todo_lint_failure; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:27
+ def on_package_todo_lint_failure=(_arg0); end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:53
+ sig { returns(::Pathname) }
+ def readme_template_pathname; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:20
+ sig { returns(T::Boolean) }
+ def use_pks; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:20
+ def use_pks=(_arg0); end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:17
+ sig { returns(::Packs::UserEventLogger) }
+ def user_event_logger; end
+
+ # pkg:gem/packs#lib/packs/configuration.rb:17
+ def user_event_logger=(_arg0); end
+end
+
+# pkg:gem/packs#lib/packs/configuration.rb:10
+Packs::Configuration::CONFIGURATION_PATHNAME = T.let(T.unsafe(nil), Pathname)
+
+# pkg:gem/packs#lib/packs/configuration.rb:11
+Packs::Configuration::DEFAULT_README_TEMPLATE_PATHNAME = T.let(T.unsafe(nil), Pathname)
+
+# pkg:gem/packs#lib/packs/configuration.rb:22
+Packs::Configuration::OnPackageTodoLintFailure = T.type_alias { T.proc.params(output: ::String).void }
+
+# pkg:gem/packs#lib/packs/default_user_event_logger.rb:4
+class Packs::DefaultUserEventLogger
+ include ::Packs::UserEventLogger
+end
+
+# pkg:gem/packs#lib/packs/logging.rb:6
+module Packs::Logging
+ class << self
+ # pkg:gem/packs#lib/packs/logging.rb:33
+ sig { params(str: ::String).void }
+ def out(str); end
+
+ # pkg:gem/packs#lib/packs/logging.rb:23
+ sig { params(text: ::String).void }
+ def print(text); end
+
+ # pkg:gem/packs#lib/packs/logging.rb:18
+ sig { params(text: ::String).void }
+ def print_bold_green(text); end
+
+ # pkg:gem/packs#lib/packs/logging.rb:28
+ sig { void }
+ def print_divider; end
+
+ # pkg:gem/packs#lib/packs/logging.rb:10
+ sig { params(title: ::String, block: T.proc.void).void }
+ def section(title, &block); end
+ end
+end
+
+# pkg:gem/packs#lib/packs/per_file_processor_interface.rb:4
+module Packs::PerFileProcessorInterface
+ abstract!
+
+ # pkg:gem/packs#lib/packs/per_file_processor_interface.rb:15
+ sig { overridable.params(file_move_operations: T::Array[::Packs::Private::FileMoveOperation]).void }
+ def after_move_files!(file_move_operations); end
+
+ # pkg:gem/packs#lib/packs/per_file_processor_interface.rb:11
+ sig { abstract.params(file_move_operation: ::Packs::Private::FileMoveOperation).void }
+ def before_move_file!(file_move_operation); end
+end
+
+# pkg:gem/packs#lib/packs/private/file_move_operation.rb:4
+module Packs::Private
+ class << self
+ # pkg:gem/packs#lib/packs/private.rb:384
+ sig { params(pack_name: ::String, dependency_name: ::String).void }
+ def add_dependency!(pack_name:, dependency_name:); end
+
+ # pkg:gem/packs#lib/packs/private.rb:446
+ sig { params(package: ::ParsePackwerk::Package).void }
+ def add_public_directory(package); end
+
+ # pkg:gem/packs#lib/packs/private.rb:457
+ sig { params(package: ::ParsePackwerk::Package).void }
+ def add_readme(package); end
+
+ # pkg:gem/packs#lib/packs/private.rb:532
+ sig { void }
+ def bust_cache!; end
+
+ # pkg:gem/packs#lib/packs/private.rb:20
+ sig { params(pack_name: ::String).returns(::String) }
+ def clean_pack_name(pack_name); end
+
+ # pkg:gem/packs#lib/packs/private.rb:58
+ sig do
+ params(
+ pack_name: ::String,
+ enforce_dependencies: T.nilable(T::Boolean),
+ enforce_privacy: T::Boolean,
+ enforce_layers: T::Boolean,
+ team: T.nilable(::CodeTeams::Team)
+ ).void
+ end
+ def create_pack!(pack_name:, enforce_dependencies:, enforce_privacy:, enforce_layers:, team:); end
+
+ # pkg:gem/packs#lib/packs/private.rb:479
+ sig do
+ params(
+ pack_name: ::String,
+ enforce_dependencies: T.nilable(T::Boolean),
+ enforce_privacy: T::Boolean,
+ enforce_layers: T::Boolean,
+ team: T.nilable(::CodeTeams::Team)
+ ).returns(::ParsePackwerk::Package)
+ end
+ def create_pack_if_not_exists!(pack_name:, enforce_dependencies:, enforce_privacy:, enforce_layers:, team: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs/private.rb:557
+ sig do
+ params(
+ before: T::Hash[::String, T.nilable(::String)],
+ after: T::Hash[::String, T.nilable(::String)]
+ ).returns(::String)
+ end
+ def diff_package_todo_yml(before, after); end
+
+ # This function exists to give us something to stub in test
+ #
+ # pkg:gem/packs#lib/packs/private.rb:782
+ sig { params(code: T::Boolean).void }
+ def exit_with(code); end
+
+ # pkg:gem/packs#lib/packs/private.rb:609
+ sig do
+ params(
+ packs: T::Array[::Packs::Pack],
+ format: ::Symbol,
+ types: T::Array[::Symbol],
+ include_date: T::Boolean
+ ).void
+ end
+ def get_info(packs: T.unsafe(nil), format: T.unsafe(nil), types: T.unsafe(nil), include_date: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs/private.rb:540
+ sig { returns(T::Hash[::String, ::String]) }
+ def get_package_todo_contents; end
+
+ # pkg:gem/packs#lib/packs/private.rb:427
+ sig { params(origin: ::Pathname, destination: ::Pathname).void }
+ def idempotent_mv(origin, destination); end
+
+ # pkg:gem/packs#lib/packs/private.rb:699
+ sig { void }
+ def lint_package_todo_yml_files!; end
+
+ # pkg:gem/packs#lib/packs/private.rb:734
+ sig { params(packs: T::Array[::Packs::Pack]).void }
+ def lint_package_yml_files!(packs); end
+
+ # pkg:gem/packs#lib/packs/private.rb:522
+ sig { void }
+ def load_client_configuration; end
+
+ # pkg:gem/packs#lib/packs/private.rb:337
+ sig do
+ params(
+ paths_relative_to_root: T::Array[::String],
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def make_public!(paths_relative_to_root:, per_file_processors:); end
+
+ # pkg:gem/packs#lib/packs/private.rb:159
+ sig do
+ params(
+ pack_name: ::String,
+ destination: ::String,
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def move_to_folder!(pack_name:, destination:, per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs/private.rb:90
+ sig do
+ params(
+ pack_name: ::String,
+ paths_relative_to_root: T::Array[::String],
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def move_to_pack!(pack_name:, paths_relative_to_root:, per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs/private.rb:238
+ sig do
+ params(
+ pack_name: ::String,
+ parent_name: ::String,
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def move_to_parent!(pack_name:, parent_name:, per_file_processors: T.unsafe(nil)); end
+
+ # pkg:gem/packs#lib/packs/private.rb:414
+ sig do
+ params(
+ file_move_operation: ::Packs::Private::FileMoveOperation,
+ per_file_processors: T::Array[::Packs::PerFileProcessorInterface]
+ ).void
+ end
+ def package_filepath(file_move_operation, per_file_processors); end
+
+ # pkg:gem/packs#lib/packs/private.rb:597
+ sig { params(package: ::ParsePackwerk::Package).returns(T.nilable(::Packs::Pack)) }
+ def packwerk_package_to_pack(package); end
+
+ # pkg:gem/packs#lib/packs/private.rb:586
+ sig { params(packages: T::Array[::ParsePackwerk::Package]).returns(T::Array[::Packs::Pack]) }
+ def packwerk_packages_to_packs(packages); end
+
+ # pkg:gem/packs#lib/packs/private.rb:767
+ sig { returns(::String) }
+ def rename_pack; end
+
+ # pkg:gem/packs#lib/packs/private.rb:35
+ sig { params(file: ::String, find: ::Pathname, replace_with: ::Pathname).void }
+ def replace_in_file(file:, find:, replace_with:); end
+
+ # pkg:gem/packs#lib/packs/private.rb:761
+ sig { params(config: T::Hash[T.anything, T.anything]).returns(T::Hash[T.anything, T.anything]) }
+ def sort_keys(config); end
+
+ # This function exists to give us something to stub in test
+ #
+ # pkg:gem/packs#lib/packs/private.rb:788
+ sig { params(command: ::String).returns(T::Boolean) }
+ def system_with(command); end
+
+ # pkg:gem/packs#lib/packs/private.rb:574
+ sig { params(package_todo_files: T::Hash[::String, T.nilable(::String)], tmp_folder: ::String).void }
+ def write_package_todo_to_tmp_folder(package_todo_files, tmp_folder); end
+ end
+end
+
+# pkg:gem/packs#lib/packs/private/file_move_operation.rb:5
+class Packs::Private::FileMoveOperation < ::T::Struct
+ const :origin_pathname, ::Pathname
+ const :destination_pathname, ::Pathname
+ const :destination_pack, ::ParsePackwerk::Package
+
+ # pkg:gem/packs#lib/packs/private/file_move_operation.rb:13
+ sig { returns(T.nilable(::Packs::Pack)) }
+ def origin_pack; end
+
+ # pkg:gem/packs#lib/packs/private/file_move_operation.rb:55
+ sig { returns(T::Array[::Packs::Private::FileMoveOperation]) }
+ def spec_file_move_operations; end
+
+ private
+
+ # pkg:gem/packs#lib/packs/private/file_move_operation.rb:98
+ sig { returns(::String) }
+ def filepath_without_pack_name; end
+
+ # Maps app/controllers/]
+#
+# pkg:gem/parser#lib/parser/diagnostic.rb:31
+class Parser::Diagnostic
+ # @param [Symbol] level
+ # @param [Symbol] reason
+ # @param [Hash] arguments
+ # @param [Parser::Source::Range] location
+ # @param [Array] highlights
+ #
+ # pkg:gem/parser#lib/parser/diagnostic.rb:49
+ def initialize(level, reason, arguments, location, highlights = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/diagnostic.rb:39
+ def arguments; end
+
+ # pkg:gem/parser#lib/parser/diagnostic.rb:40
+ def highlights; end
+
+ # pkg:gem/parser#lib/parser/diagnostic.rb:39
+ def level; end
+
+ # pkg:gem/parser#lib/parser/diagnostic.rb:40
+ def location; end
+
+ # @return [String] the rendered message.
+ #
+ # pkg:gem/parser#lib/parser/diagnostic.rb:69
+ def message; end
+
+ # pkg:gem/parser#lib/parser/diagnostic.rb:39
+ def reason; end
+
+ # Renders the diagnostic message as a clang-like diagnostic.
+ #
+ # @example
+ # diagnostic.render # =>
+ # # [
+ # # "(fragment:0):1:5: error: unexpected token $end",
+ # # "foo +",
+ # # " ^"
+ # # ]
+ #
+ # @return [Array]
+ #
+ # pkg:gem/parser#lib/parser/diagnostic.rb:86
+ def render; end
+
+ private
+
+ # If necessary, shrink a `Range` so as to include only the first line.
+ #
+ # @return [Parser::Source::Range]
+ #
+ # pkg:gem/parser#lib/parser/diagnostic.rb:142
+ def first_line_only(range); end
+
+ # If necessary, shrink a `Range` so as to include only the last line.
+ #
+ # @return [Parser::Source::Range]
+ #
+ # pkg:gem/parser#lib/parser/diagnostic.rb:155
+ def last_line_only(range); end
+
+ # Renders one source line in clang diagnostic style, with highlights.
+ #
+ # @return [Array]
+ #
+ # pkg:gem/parser#lib/parser/diagnostic.rb:110
+ def render_line(range, ellipsis = T.unsafe(nil), range_end = T.unsafe(nil)); end
+end
+
+# {Parser::Diagnostic::Engine} provides a basic API for dealing with
+# diagnostics by delegating them to registered consumers.
+#
+# @example
+# buffer = Parser::Source::Buffer.new(__FILE__, source: 'foobar')
+#
+# consumer = lambda do |diagnostic|
+# puts diagnostic.message
+# end
+#
+# engine = Parser::Diagnostic::Engine.new(consumer)
+# diagnostic = Parser::Diagnostic.new(
+# :warning, :unexpected_token, { :token => 'abc' }, buffer, 1..2)
+#
+# engine.process(diagnostic) # => "unexpected token abc"
+#
+# @api public
+#
+# @!attribute [rw] consumer
+# @return [#call(Diagnostic)]
+#
+# @!attribute [rw] all_errors_are_fatal
+# When set to `true` any error that is encountered will result in
+# {Parser::SyntaxError} being raised.
+# @return [Boolean]
+#
+# @!attribute [rw] ignore_warnings
+# When set to `true` warnings will be ignored.
+# @return [Boolean]
+#
+# pkg:gem/parser#lib/parser/diagnostic/engine.rb:36
+class Parser::Diagnostic::Engine
+ # @param [#call(Diagnostic)] consumer
+ #
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:45
+ def initialize(consumer = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:39
+ def all_errors_are_fatal; end
+
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:39
+ def all_errors_are_fatal=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:37
+ def consumer; end
+
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:37
+ def consumer=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:40
+ def ignore_warnings; end
+
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:40
+ def ignore_warnings=(_arg0); end
+
+ # Processes a `diagnostic`:
+ # * Passes the diagnostic to the consumer, if it's not a warning when
+ # `ignore_warnings` is set.
+ # * After that, raises {Parser::SyntaxError} when `all_errors_are_fatal`
+ # is set to true.
+ #
+ # @param [Parser::Diagnostic] diagnostic
+ # @return [Parser::Diagnostic::Engine]
+ # @see ignore?
+ # @see raise?
+ #
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:64
+ def process(diagnostic); end
+
+ protected
+
+ # Checks whether `diagnostic` should be ignored.
+ #
+ # @param [Parser::Diagnostic] diagnostic
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:86
+ def ignore?(diagnostic); end
+
+ # Checks whether `diagnostic` should be raised as an exception.
+ #
+ # @param [Parser::Diagnostic] diagnostic
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/diagnostic/engine.rb:97
+ def raise?(diagnostic); end
+end
+
+# Collection of the available diagnostic levels.
+#
+# @return [Array]
+#
+# pkg:gem/parser#lib/parser/diagnostic.rb:37
+Parser::Diagnostic::LEVELS = T.let(T.unsafe(nil), Array)
+
+# line 3 "lib/parser/lexer.rl"
+#
+# === BEFORE YOU START ===
+#
+# Read the Ruby Hacking Guide chapter 11, available in English at
+# http://whitequark.org/blog/2013/04/01/ruby-hacking-guide-ch-11-finite-state-lexer/
+#
+# Remember two things about Ragel scanners:
+#
+# 1) Longest match wins.
+#
+# 2) If two matches have the same length, the first
+# in source code wins.
+#
+# General rules of making Ragel and Bison happy:
+#
+# * `p` (position) and `@te` contain the index of the character
+# they're pointing to ("current"), plus one. `@ts` contains the index
+# of the corresponding character. The code for extracting matched token is:
+#
+# @source_buffer.slice(@ts...@te)
+#
+# * If your input is `foooooooobar` and the rule is:
+#
+# 'f' 'o'+
+#
+# the result will be:
+#
+# foooooooobar
+# ^ ts=0 ^ p=te=9
+#
+# * A Ragel lexer action should not emit more than one token, unless
+# you know what you are doing.
+#
+# * All Ragel commands (fnext, fgoto, ...) end with a semicolon.
+#
+# * If an action emits the token and transitions to another state, use
+# these Ragel commands:
+#
+# emit($whatever)
+# fnext $next_state; fbreak;
+#
+# If you perform `fgoto` in an action which does not emit a token nor
+# rewinds the stream pointer, the parser's side-effectful,
+# context-sensitive lookahead actions will break in a hard to detect
+# and debug way.
+#
+# * If an action does not emit a token:
+#
+# fgoto $next_state;
+#
+# * If an action features lookbehind, i.e. matches characters with the
+# intent of passing them to another action:
+#
+# p = @ts - 1
+# fgoto $next_state;
+#
+# or, if the lookbehind consists of a single character:
+#
+# fhold; fgoto $next_state;
+#
+# * Ragel merges actions. So, if you have `e_lparen = '(' %act` and
+# `c_lparen = '('` and a lexer action `e_lparen | c_lparen`, the result
+# _will_ invoke the action `act`.
+#
+# e_something stands for "something with **e**mbedded action".
+#
+# * EOF is explicit and is matched by `c_eof`. If you want to introspect
+# the state of the lexer, add this rule to the state:
+#
+# c_eof => do_eof;
+#
+# * If you proceed past EOF, the lexer will complain:
+#
+# NoMethodError: undefined method `ord' for nil:NilClass
+#
+# line 3 "lib/parser/lexer.rl"
+#
+# === BEFORE YOU START ===
+#
+# Read the Ruby Hacking Guide chapter 11, available in English at
+# http://whitequark.org/blog/2013/04/01/ruby-hacking-guide-ch-11-finite-state-lexer/
+#
+# Remember two things about Ragel scanners:
+#
+# 1) Longest match wins.
+#
+# 2) If two matches have the same length, the first
+# in source code wins.
+#
+# General rules of making Ragel and Bison happy:
+#
+# * `p` (position) and `@te` contain the index of the character
+# they're pointing to ("current"), plus one. `@ts` contains the index
+# of the corresponding character. The code for extracting matched token is:
+#
+# @source_buffer.slice(@ts...@te)
+#
+# * If your input is `foooooooobar` and the rule is:
+#
+# 'f' 'o'+
+#
+# the result will be:
+#
+# foooooooobar
+# ^ ts=0 ^ p=te=9
+#
+# * A Ragel lexer action should not emit more than one token, unless
+# you know what you are doing.
+#
+# * All Ragel commands (fnext, fgoto, ...) end with a semicolon.
+#
+# * If an action emits the token and transitions to another state, use
+# these Ragel commands:
+#
+# emit($whatever)
+# fnext $next_state; fbreak;
+#
+# If you perform `fgoto` in an action which does not emit a token nor
+# rewinds the stream pointer, the parser's side-effectful,
+# context-sensitive lookahead actions will break in a hard to detect
+# and debug way.
+#
+# * If an action does not emit a token:
+#
+# fgoto $next_state;
+#
+# * If an action features lookbehind, i.e. matches characters with the
+# intent of passing them to another action:
+#
+# p = @ts - 1
+# fgoto $next_state;
+#
+# or, if the lookbehind consists of a single character:
+#
+# fhold; fgoto $next_state;
+#
+# * Ragel merges actions. So, if you have `e_lparen = '(' %act` and
+# `c_lparen = '('` and a lexer action `e_lparen | c_lparen`, the result
+# _will_ invoke the action `act`.
+#
+# e_something stands for "something with **e**mbedded action".
+#
+# * EOF is explicit and is matched by `c_eof`. If you want to introspect
+# the state of the lexer, add this rule to the state:
+#
+# c_eof => do_eof;
+#
+# * If you proceed past EOF, the lexer will complain:
+#
+# NoMethodError: undefined method `ord' for nil:NilClass
+#
+# pkg:gem/parser#lib/parser/lexer-F1.rb:82
+class Parser::Lexer
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8250
+ def initialize(version); end
+
+ # Return next token: [type, value].
+ # Return next token: [type, value].
+ #
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8419
+ def advance; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def cmdarg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def cmdarg=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8248
+ def cmdarg_stack; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def command_start; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def command_start=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8246
+ def comments; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8246
+ def comments=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def cond; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def cond=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8248
+ def cond_stack; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8281
+ def construct_float(chars); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def context; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8244
+ def context=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8414
+ def dedent_level; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8240
+ def diagnostics; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8240
+ def diagnostics=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8367
+ def encoding; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8242
+ def force_utf32; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8242
+ def force_utf32=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8248
+ def lambda_stack; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8248
+ def paren_nest; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8401
+ def pop_cmdarg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8410
+ def pop_cond; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8396
+ def push_cmdarg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8405
+ def push_cond; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8290
+ def reset(reset_state = T.unsafe(nil)); end
+
+ # line 82 "lib/parser/lexer.rl"
+ # %
+ # line 82 "lib/parser/lexer.rl"
+ # %
+ #
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8238
+ def source_buffer; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8343
+ def source_buffer=(source_buffer); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8388
+ def state; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8392
+ def state=(state); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8241
+ def static_env; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8241
+ def static_env=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8246
+ def tokens; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8246
+ def tokens=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8248
+ def version; end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14701
+ def arg_or_cmdarg(cmd_state); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14763
+ def check_ambiguous_slash(tm); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14725
+ def diagnostic(type, reason, arguments = T.unsafe(nil), location = T.unsafe(nil), highlights = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14731
+ def e_lbrace; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14675
+ def emit(type, value = T.unsafe(nil), s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14784
+ def emit_class_var(ts = T.unsafe(nil), te = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14812
+ def emit_colon_with_digits(p, tm, diag_msg); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14709
+ def emit_comment(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14721
+ def emit_comment_from_range(p, pe); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14691
+ def emit_do(do_block = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14774
+ def emit_global_var(ts = T.unsafe(nil), te = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14792
+ def emit_instance_var(ts = T.unsafe(nil), te = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14800
+ def emit_rbrace_rparen_rbrack; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14822
+ def emit_singleton_class; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14685
+ def emit_table(table, s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14740
+ def numeric_literal_int; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14759
+ def on_newline(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14671
+ def range(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14662
+ def stack_pop; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14667
+ def tok(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:14658
+ def version?(*versions); end
+
+ class << self
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8186
+ def lex_en_expr_arg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8186
+ def lex_en_expr_arg=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8202
+ def lex_en_expr_beg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8202
+ def lex_en_expr_beg=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8190
+ def lex_en_expr_cmdarg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8190
+ def lex_en_expr_cmdarg=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8182
+ def lex_en_expr_dot; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8182
+ def lex_en_expr_dot=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8214
+ def lex_en_expr_end; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8214
+ def lex_en_expr_end=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8194
+ def lex_en_expr_endarg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8194
+ def lex_en_expr_endarg=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8178
+ def lex_en_expr_endfn; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8178
+ def lex_en_expr_endfn=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8174
+ def lex_en_expr_fname; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8174
+ def lex_en_expr_fname=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8206
+ def lex_en_expr_labelarg; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8206
+ def lex_en_expr_labelarg=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8198
+ def lex_en_expr_mid; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8198
+ def lex_en_expr_mid=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8210
+ def lex_en_expr_value; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8210
+ def lex_en_expr_value=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8170
+ def lex_en_expr_variable; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8170
+ def lex_en_expr_variable=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8230
+ def lex_en_inside_string; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8230
+ def lex_en_inside_string=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8218
+ def lex_en_leading_dot; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8218
+ def lex_en_leading_dot=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8226
+ def lex_en_line_begin; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8226
+ def lex_en_line_begin=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8222
+ def lex_en_line_comment; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8222
+ def lex_en_line_comment=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8165
+ def lex_error; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8165
+ def lex_error=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8161
+ def lex_start; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8161
+ def lex_start=(_arg0); end
+
+ private
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8064
+ def _lex_eof_trans; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:8064
+ def _lex_eof_trans=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7967
+ def _lex_from_state_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7967
+ def _lex_from_state_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:461
+ def _lex_index_offsets; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:461
+ def _lex_index_offsets=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:558
+ def _lex_indicies; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:558
+ def _lex_indicies=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:364
+ def _lex_key_spans; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:364
+ def _lex_key_spans=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7870
+ def _lex_to_state_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7870
+ def _lex_to_state_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7722
+ def _lex_trans_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7722
+ def _lex_trans_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:87
+ def _lex_trans_keys; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:87
+ def _lex_trans_keys=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7574
+ def _lex_trans_targs; end
+
+ # pkg:gem/parser#lib/parser/lexer-F1.rb:7574
+ def _lex_trans_targs=(_arg0); end
+ end
+end
+
+# pkg:gem/parser#lib/parser/lexer/dedenter.rb:5
+class Parser::Lexer::Dedenter
+ # pkg:gem/parser#lib/parser/lexer/dedenter.rb:9
+ def initialize(dedent_level); end
+
+ # For a heredoc like
+ # <<-HERE
+ # a
+ # b
+ # HERE
+ # this method gets called with " a\n" and " b\n"
+ #
+ # However, the following heredoc:
+ #
+ # <<-HERE
+ # a\
+ # b
+ # HERE
+ # calls this method only once with a string " a\\\n b\n"
+ #
+ # This is important because technically it's a single line,
+ # but it has to be concatenated __after__ dedenting.
+ #
+ # It has no effect for non-squiggly heredocs, i.e. it simply removes "\\\n"
+ # Of course, lexer could do it but once again: it's all because of dedenting.
+ #
+ # pkg:gem/parser#lib/parser/lexer/dedenter.rb:36
+ def dedent(string); end
+
+ # pkg:gem/parser#lib/parser/lexer/dedenter.rb:83
+ def interrupt; end
+end
+
+# Tab (\t) counts as 8 spaces
+#
+# pkg:gem/parser#lib/parser/lexer/dedenter.rb:7
+Parser::Lexer::Dedenter::TAB_WIDTH = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/parser#lib/parser/lexer-F1.rb:14869
+Parser::Lexer::ESCAPE_WHITESPACE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-F1.rb:14855
+Parser::Lexer::KEYWORDS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-F1.rb:14862
+Parser::Lexer::KEYWORDS_BEGIN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-F1.rb:8371
+Parser::Lexer::LEX_STATES = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer/literal.rb:6
+class Parser::Lexer::Literal
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:42
+ def initialize(lexer, str_type, delimiter, str_s, heredoc_e = T.unsafe(nil), indent = T.unsafe(nil), dedent_body = T.unsafe(nil), label_allowed = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:116
+ def backslash_delimited?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:39
+ def dedent_level; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:191
+ def end_interp_brace_and_try_closing; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:218
+ def extend_content; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:222
+ def extend_space(ts, te); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:197
+ def extend_string(string, ts, te); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:204
+ def flush_string; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:104
+ def heredoc?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:39
+ def heredoc_e; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:168
+ def infer_indent_level(line); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:91
+ def interpolate?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:124
+ def munge_escape?(character); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:134
+ def nest_and_try_closing(delimiter, ts, te, lookahead = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:108
+ def plain_heredoc?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:100
+ def regexp?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:40
+ def saved_herebody_s; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:40
+ def saved_herebody_s=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:112
+ def squiggly_heredoc?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:187
+ def start_interp_brace; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:39
+ def str_s; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:232
+ def supports_line_continuation_via_slash?; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:120
+ def type; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:95
+ def words?; end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:263
+ def clear_buffer; end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:259
+ def coerce_encoding(string); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:238
+ def delimiter?(delimiter); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:279
+ def emit(token, type, s, e); end
+
+ # pkg:gem/parser#lib/parser/lexer/literal.rb:274
+ def emit_start_tok; end
+end
+
+# pkg:gem/parser#lib/parser/lexer/literal.rb:7
+Parser::Lexer::Literal::DELIMITERS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer/literal.rb:8
+Parser::Lexer::Literal::SPACE = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/parser#lib/parser/lexer/literal.rb:9
+Parser::Lexer::Literal::TAB = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/parser#lib/parser/lexer/literal.rb:11
+Parser::Lexer::Literal::TYPES = T.let(T.unsafe(nil), Hash)
+
+# Mapping of strings to parser tokens.
+# Mapping of strings to parser tokens.
+#
+# pkg:gem/parser#lib/parser/lexer-F1.rb:14829
+Parser::Lexer::PUNCTUATION = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-F1.rb:14849
+Parser::Lexer::PUNCTUATION_BEGIN = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer/stack_state.rb:5
+class Parser::Lexer::StackState
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:6
+ def initialize(name); end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:34
+ def active?; end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:11
+ def clear; end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:38
+ def empty?; end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:46
+ def inspect; end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:29
+ def lexpop; end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:22
+ def pop; end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:15
+ def push(bit); end
+
+ # pkg:gem/parser#lib/parser/lexer/stack_state.rb:42
+ def to_s; end
+end
+
+# line 3 "lib/parser/lexer-strings.rl"
+#
+# pkg:gem/parser#lib/parser/lexer-strings.rb:6
+class Parser::LexerStrings
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3300
+ def initialize(lexer, version); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3339
+ def advance(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5069
+ def close_interp_on_current_literal(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5043
+ def continue_lexing(current_literal); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5092
+ def dedent_level; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3295
+ def herebody_s; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3295
+ def herebody_s=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5047
+ def literal; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5015
+ def next_state_for_literal(literal); end
+
+ # This hook is triggered by "main" lexer on every newline character
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5100
+ def on_newline(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5051
+ def pop_literal; end
+
+ # === LITERAL STACK ===
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5009
+ def push_literal(*args); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:4999
+ def read_character_constant(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3314
+ def reset; end
+
+ # Set by "main" lexer
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3298
+ def source_buffer; end
+
+ # Set by "main" lexer
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3298
+ def source_buffer=(_arg0); end
+
+ # Set by "main" lexer
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3298
+ def source_pts; end
+
+ # Set by "main" lexer
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3298
+ def source_pts=(_arg0); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5406
+ def check_ambiguous_slash(tm); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5417
+ def check_invalid_escapes(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5136
+ def cond; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5132
+ def diagnostic(type, reason, arguments = T.unsafe(nil), location = T.unsafe(nil), highlights = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5128
+ def emit(type, value = T.unsafe(nil), s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5396
+ def emit_character_constant; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5373
+ def emit_interp_var(interp_var_kind); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5140
+ def emit_invalid_escapes?; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5291
+ def encode_escape(ord); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5384
+ def encode_escaped_char(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5112
+ def eof_codepoint?(point); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5210
+ def extend_interp_code(current_literal); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5225
+ def extend_interp_digit_var; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5364
+ def extend_interp_var(current_literal); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5234
+ def extend_string_eol_check_eof(current_literal, pe); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5251
+ def extend_string_eol_heredoc_intertwined(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5241
+ def extend_string_eol_heredoc_line; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5267
+ def extend_string_eol_words(current_literal, p); end
+
+ # String escaping
+ #
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5154
+ def extend_string_escaped; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5287
+ def extend_string_for_token_range(current_literal, string); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5279
+ def extend_string_slice_end(lookahead); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5124
+ def range(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5356
+ def read_post_meta_or_ctrl_char(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5388
+ def slash_c_char; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5392
+ def slash_m_char; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5120
+ def tok(s = T.unsafe(nil), e = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5295
+ def unescape_char(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5307
+ def unicode_points(p); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:5116
+ def version?(*versions); end
+
+ class << self
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3275
+ def lex_en_character; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3275
+ def lex_en_character=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3255
+ def lex_en_interp_backslash_delimited; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3255
+ def lex_en_interp_backslash_delimited=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3263
+ def lex_en_interp_backslash_delimited_words; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3263
+ def lex_en_interp_backslash_delimited_words=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3243
+ def lex_en_interp_string; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3243
+ def lex_en_interp_string=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3239
+ def lex_en_interp_words; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3239
+ def lex_en_interp_words=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3259
+ def lex_en_plain_backslash_delimited; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3259
+ def lex_en_plain_backslash_delimited=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3267
+ def lex_en_plain_backslash_delimited_words; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3267
+ def lex_en_plain_backslash_delimited_words=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3251
+ def lex_en_plain_string; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3251
+ def lex_en_plain_string=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3247
+ def lex_en_plain_words; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3247
+ def lex_en_plain_words=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3271
+ def lex_en_regexp_modifiers; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3271
+ def lex_en_regexp_modifiers=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3279
+ def lex_en_unknown; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3279
+ def lex_en_unknown=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3234
+ def lex_error; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3234
+ def lex_error=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3230
+ def lex_start; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3230
+ def lex_start=(_arg0); end
+
+ private
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:11
+ def _lex_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:11
+ def _lex_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3184
+ def _lex_eof_trans; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3184
+ def _lex_eof_trans=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3138
+ def _lex_from_state_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3138
+ def _lex_from_state_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:244
+ def _lex_index_offsets; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:244
+ def _lex_index_offsets=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:290
+ def _lex_indicies; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:290
+ def _lex_indicies=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:198
+ def _lex_key_spans; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:198
+ def _lex_key_spans=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3092
+ def _lex_to_state_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3092
+ def _lex_to_state_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3029
+ def _lex_trans_actions; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:3029
+ def _lex_trans_actions=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:76
+ def _lex_trans_keys; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:76
+ def _lex_trans_keys=(_arg0); end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:2966
+ def _lex_trans_targs; end
+
+ # pkg:gem/parser#lib/parser/lexer-strings.rb:2966
+ def _lex_trans_targs=(_arg0); end
+ end
+end
+
+# line 6 "lib/parser/lexer-strings.rl"
+# %
+#
+# pkg:gem/parser#lib/parser/lexer-strings.rb:3287
+Parser::LexerStrings::ESCAPES = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-strings.rb:5423
+Parser::LexerStrings::ESCAPE_WHITESPACE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-strings.rb:3332
+Parser::LexerStrings::LEX_STATES = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/lexer-strings.rb:3293
+Parser::LexerStrings::REGEXP_META_CHARACTERS = T.let(T.unsafe(nil), Regexp)
+
+# Diagnostic messages (errors, warnings and notices) that can be generated.
+#
+# @see Diagnostic
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/messages.rb:11
+Parser::MESSAGES = T.let(T.unsafe(nil), Hash)
+
+# Holds p->max_numparam from parse.y
+#
+# @api private
+#
+# pkg:gem/parser#lib/parser/max_numparam_stack.rb:8
+class Parser::MaxNumparamStack
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:13
+ def initialize; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:17
+ def empty?; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:29
+ def has_numparams?; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:21
+ def has_ordinary_params!; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:25
+ def has_ordinary_params?; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:45
+ def pop; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:41
+ def push(static:); end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:33
+ def register(numparam); end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:9
+ def stack; end
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:37
+ def top; end
+
+ private
+
+ # pkg:gem/parser#lib/parser/max_numparam_stack.rb:51
+ def set(value); end
+end
+
+# pkg:gem/parser#lib/parser/max_numparam_stack.rb:11
+Parser::MaxNumparamStack::ORDINARY_PARAMS = T.let(T.unsafe(nil), Integer)
+
+# @api private
+#
+# pkg:gem/parser#lib/parser/messages.rb:112
+module Parser::Messages
+ class << self
+ # Formats the message, returns a raw template if there's nothing to interpolate
+ #
+ # Code like `format("", {})` gives a warning, and so this method tries interpolating
+ # only if `arguments` hash is not empty.
+ #
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/messages.rb:119
+ def compile(reason, arguments); end
+ end
+end
+
+# Parser metadata
+#
+# pkg:gem/parser#lib/parser/meta.rb:5
+module Parser::Meta; end
+
+# All node types that parser can produce. Not all parser versions
+# will be able to produce every possible node.
+# Includes node types that are only emitted by the prism parser translator.
+#
+# pkg:gem/parser#lib/parser/meta.rb:17
+Parser::Meta::NODE_TYPES = T.let(T.unsafe(nil), Set)
+
+# These are node types required by `Prism::Translation::Parser`,
+# which has advanced syntax support ahead of the Parser gem.
+#
+# pkg:gem/parser#lib/parser/meta.rb:9
+Parser::Meta::PRISM_TRANSLATION_PARSER_NODE_TYPES = T.let(T.unsafe(nil), Array)
+
+# {Parser::Rewriter} is deprecated. Use {Parser::TreeRewriter} instead.
+# It has a backwards compatible API and uses {Parser::Source::TreeRewriter}
+# instead of {Parser::Source::Rewriter}.
+# Please check the documentation for {Parser::Source::Rewriter} for details.
+#
+# @api public
+# @deprecated Use {Parser::TreeRewriter}
+#
+# pkg:gem/parser#lib/parser/rewriter.rb:14
+class Parser::Rewriter < ::Parser::AST::Processor
+ extend ::Parser::Deprecation
+
+ # pkg:gem/parser#lib/parser/rewriter.rb:98
+ def initialize(*_arg0); end
+
+ # Returns `true` if the specified node is an assignment node, returns false
+ # otherwise.
+ #
+ # @param [Parser::AST::Node] node
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:38
+ def assignment?(node); end
+
+ # Inserts new code after the given source range.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:77
+ def insert_after(range, content); end
+
+ # Inserts new code before the given source range.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:67
+ def insert_before(range, content); end
+
+ # Removes the source range.
+ #
+ # @param [Parser::Source::Range] range
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:47
+ def remove(range); end
+
+ # Replaces the code of the source range `range` with `content`.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:87
+ def replace(range, content); end
+
+ # Rewrites the AST/source buffer and returns a String containing the new
+ # version.
+ #
+ # @param [Parser::Source::Buffer] source_buffer
+ # @param [Parser::AST::Node] ast
+ # @return [String]
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:23
+ def rewrite(source_buffer, ast); end
+
+ # Wraps the given source range with the given values.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/rewriter.rb:57
+ def wrap(range, before, after); end
+end
+
+# pkg:gem/parser#lib/parser/rewriter.rb:91
+Parser::Rewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String)
+
+# pkg:gem/parser#lib/parser.rb:30
+module Parser::Source; end
+
+# A buffer with source code. {Buffer} contains the source code itself,
+# associated location information (name and first line), and takes care
+# of encoding.
+#
+# A source buffer is immutable once populated.
+#
+# @!attribute [r] name
+# Buffer name. If the buffer was created from a file, the name corresponds
+# to relative path to the file.
+# @return [String] buffer name
+#
+# @!attribute [r] first_line
+# First line of the buffer, 1 by default.
+# @return [Integer] first line
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/source/buffer.rb:25
+class Parser::Source::Buffer
+ # pkg:gem/parser#lib/parser/source/buffer.rb:110
+ def initialize(name, first_line = T.unsafe(nil), source: T.unsafe(nil)); end
+
+ # Convert a character index into the source to a column number.
+ #
+ # @param [Integer] position
+ # @return [Integer] column
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:247
+ def column_for_position(position); end
+
+ # Convert a character index into the source to a `[line, column]` tuple.
+ #
+ # @param [Integer] position
+ # @return [[Integer, Integer]] `[line, column]`
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:222
+ def decompose_position(position); end
+
+ # pkg:gem/parser#lib/parser/source/buffer.rb:26
+ def first_line; end
+
+ # pkg:gem/parser#lib/parser/source/buffer.rb:317
+ def freeze; end
+
+ # pkg:gem/parser#lib/parser/source/buffer.rb:323
+ def inspect; end
+
+ # Number of last line in the buffer
+ #
+ # @return [Integer]
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:312
+ def last_line; end
+
+ # Convert a character index into the source to a line number.
+ #
+ # @param [Integer] position
+ # @return [Integer] line
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:236
+ def line_for_position(position); end
+
+ # Extract line `lineno` as a new `Range`, taking `first_line` into account.
+ #
+ # @param [Integer] lineno
+ # @return [Range]
+ # @raise [IndexError] if `lineno` is out of bounds
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:289
+ def line_range(lineno); end
+
+ # pkg:gem/parser#lib/parser/source/buffer.rb:26
+ def name; end
+
+ # Populate this buffer from a string without encoding autodetection.
+ #
+ # @param [String] input
+ # @raise [ArgumentError] if already populated
+ # @return [String]
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:185
+ def raw_source=(input); end
+
+ # Populate this buffer from correspondingly named file.
+ #
+ # @example
+ # Parser::Source::Buffer.new('foo/bar.rb').read
+ #
+ # @return [Buffer] self
+ # @raise [ArgumentError] if already populated
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:136
+ def read; end
+
+ # pkg:gem/parser#lib/parser/source/buffer.rb:199
+ def slice(start, length = T.unsafe(nil)); end
+
+ # Source code contained in this buffer.
+ #
+ # @return [String] source code
+ # @raise [RuntimeError] if buffer is not populated yet
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:150
+ def source; end
+
+ # Populate this buffer from a string with encoding autodetection.
+ # `input` is mutated if not frozen.
+ #
+ # @param [String] input
+ # @raise [ArgumentError] if already populated
+ # @raise [EncodingError] if `input` includes invalid byte sequence for the encoding
+ # @return [String]
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:167
+ def source=(input); end
+
+ # Extract line `lineno` from source, taking `first_line` into account.
+ #
+ # @param [Integer] lineno
+ # @return [String]
+ # @raise [IndexError] if `lineno` is out of bounds
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:278
+ def source_line(lineno); end
+
+ # Return an `Array` of source code lines.
+ #
+ # @return [Array]
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:257
+ def source_lines; end
+
+ # @return [Range] A range covering the whole source
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:303
+ def source_range; end
+
+ private
+
+ # RUBY_VERSION >= 2.3
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:353
+ def bsearch(line_begins, position); end
+
+ # @returns [0, line_begin_of_line_1, ..., source.size + 1]
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:330
+ def line_begins; end
+
+ # @returns 0-based line index of position
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:344
+ def line_index_for_position(position); end
+
+ class << self
+ # Try to recognize encoding of `string` as Ruby would, i.e. by looking for
+ # magic encoding comment or UTF-8 BOM. `string` can be in any encoding.
+ #
+ # @param [String] string
+ # @raise [Parser::UnknownEncodingInMagicComment] if the encoding is not recognized
+ # @return [String, nil] encoding name, if recognized
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:52
+ def recognize_encoding(string); end
+
+ # Recognize encoding of `input` and process it so it could be lexed.
+ #
+ # * If `input` does not contain BOM or magic encoding comment, it is
+ # kept in the original encoding.
+ # * If the detected encoding is binary, `input` is kept in binary.
+ # * Otherwise, `input` is re-encoded into UTF-8 and returned as a
+ # new string.
+ #
+ # This method mutates the encoding of `input`, but not its content.
+ #
+ # @param [String] input
+ # @return [String]
+ # @raise [EncodingError]
+ #
+ # pkg:gem/parser#lib/parser/source/buffer.rb:95
+ def reencode_string(input); end
+ end
+end
+
+# @api private
+#
+# pkg:gem/parser#lib/parser/source/buffer.rb:31
+Parser::Source::Buffer::ENCODING_RE = T.let(T.unsafe(nil), Regexp)
+
+# A comment in the source code.
+#
+# @!attribute [r] text
+# @return [String]
+#
+# @!attribute [r] location
+# @return [Parser::Source::Range]
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/source/comment.rb:17
+class Parser::Source::Comment
+ # @param [Parser::Source::Range] range
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:67
+ def initialize(range); end
+
+ # Compares comments. Two comments are equal if they
+ # correspond to the same source range.
+ #
+ # @param [Object] other
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:120
+ def ==(other); end
+
+ # @see #type
+ # @return [Boolean] true if this is a block comment.
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:109
+ def document?; end
+
+ # @see #type
+ # @return [Boolean] true if this is an inline comment.
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:101
+ def inline?; end
+
+ # @return [String] a human-readable representation of this comment
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:128
+ def inspect; end
+
+ # pkg:gem/parser#lib/parser/source/comment.rb:21
+ def loc; end
+
+ # pkg:gem/parser#lib/parser/source/comment.rb:20
+ def location; end
+
+ # pkg:gem/parser#lib/parser/source/comment.rb:18
+ def text; end
+
+ # Type of this comment.
+ #
+ # * Inline comments correspond to `:inline`:
+ #
+ # # whatever
+ #
+ # * Block comments correspond to `:document`:
+ #
+ # =begin
+ # hi i am a document
+ # =end
+ #
+ # @return [Symbol]
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:89
+ def type; end
+
+ class << self
+ # Associate `comments` with `ast` nodes by their corresponding node.
+ #
+ # @param [Parser::AST::Node] ast
+ # @param [Array] comments
+ # @return [Hash>]
+ # @see Parser::Source::Comment::Associator#associate
+ # @deprecated Use {associate_locations}.
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:32
+ def associate(ast, comments); end
+
+ # Associate `comments` with `ast` nodes using identity.
+ #
+ # @param [Parser::AST::Node] ast
+ # @param [Array] comments
+ # @return [Hash>]
+ # @see Parser::Source::Comment::Associator#associate_by_identity
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:59
+ def associate_by_identity(ast, comments); end
+
+ # Associate `comments` with `ast` nodes by their location in the
+ # source.
+ #
+ # @param [Parser::AST::Node] ast
+ # @param [Array] comments
+ # @return [Hash>]
+ # @see Parser::Source::Comment::Associator#associate_locations
+ #
+ # pkg:gem/parser#lib/parser/source/comment.rb:46
+ def associate_locations(ast, comments); end
+ end
+end
+
+# A processor which associates AST nodes with comments based on their
+# location in source code. It may be used, for example, to implement
+# rdoc-style processing.
+#
+# @example
+# require 'parser/current'
+#
+# ast, comments = Parser::CurrentRuby.parse_with_comments(<<-CODE)
+# # Class stuff
+# class Foo
+# # Attr stuff
+# # @see bar
+# attr_accessor :foo
+# end
+# CODE
+#
+# p Parser::Source::Comment.associate(ast, comments)
+# # => {
+# # (class (const nil :Foo) ...) =>
+# # [#],
+# # (send nil :attr_accessor (sym :foo)) =>
+# # [#,
+# # #]
+# # }
+#
+# @see {associate}
+#
+# @!attribute skip_directives
+# Skip file processing directives disguised as comments.
+# Namely:
+#
+# * Shebang line,
+# * Magic encoding comment.
+#
+# @return [Boolean]
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/source/comment/associator.rb:45
+class Parser::Source::Comment::Associator
+ # @param [Parser::AST::Node] ast
+ # @param [Array] comments
+ #
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:51
+ def initialize(ast, comments); end
+
+ # Compute a mapping between AST nodes and comments. Comment is
+ # associated with the node, if it is one of the following types:
+ #
+ # - preceding comment, it ends before the node start
+ # - sparse comment, it is located inside the node, after all child nodes
+ # - decorating comment, it starts at the same line, where the node ends
+ #
+ # This rule is unambiguous and produces the result
+ # one could reasonably expect; for example, this code
+ #
+ # # foo
+ # hoge # bar
+ # + fuga
+ #
+ # will result in the following association:
+ #
+ # {
+ # (send (lvar :hoge) :+ (lvar :fuga)) =>
+ # [#],
+ # (lvar :fuga) =>
+ # [#]
+ # }
+ #
+ # Note that comments after the end of the end of a passed tree range are
+ # ignored (except root decorating comment).
+ #
+ # Note that {associate} produces unexpected result for nodes which are
+ # equal but have distinct locations; comments for these nodes are merged.
+ # You may prefer using {associate_by_identity} or {associate_locations}.
+ #
+ # @return [Hash>]
+ # @deprecated Use {associate_locations}.
+ #
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:92
+ def associate; end
+
+ # Same as {associate}, but compares by identity, thus producing an unambiguous
+ # result even in presence of equal nodes.
+ #
+ # @return [Hash>]
+ #
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:115
+ def associate_by_identity; end
+
+ # Same as {associate}, but uses `node.loc` instead of `node` as
+ # the hash key, thus producing an unambiguous result even in presence
+ # of equal nodes.
+ #
+ # @return [Hash>]
+ #
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:104
+ def associate_locations; end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:46
+ def skip_directives; end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:46
+ def skip_directives=(_arg0); end
+
+ private
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:182
+ def advance_comment; end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:214
+ def advance_through_directives; end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:206
+ def associate_and_advance_comment(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:123
+ def children_in_source_order(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:187
+ def current_comment_before?(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:194
+ def current_comment_before_end?(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:201
+ def current_comment_decorates?(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:135
+ def do_associate; end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:166
+ def process_leading_comments(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:173
+ def process_trailing_comments(node); end
+
+ # pkg:gem/parser#lib/parser/source/comment/associator.rb:148
+ def visit(node); end
+end
+
+# pkg:gem/parser#lib/parser/source/comment/associator.rb:212
+Parser::Source::Comment::Associator::MAGIC_COMMENT_RE = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/parser#lib/parser/source/comment/associator.rb:122
+Parser::Source::Comment::Associator::POSTFIX_TYPES = T.let(T.unsafe(nil), Set)
+
+# {Map} relates AST nodes to the source code they were parsed from.
+# More specifically, a {Map} or its subclass contains a set of ranges:
+#
+# * `expression`: smallest range which includes all source corresponding
+# to the node and all `expression` ranges of its children.
+# * other ranges (`begin`, `end`, `operator`, ...): node-specific ranges
+# pointing to various interesting tokens corresponding to the node.
+#
+# Note that the {Map::Heredoc} map is the only one whose `expression` does
+# not include other ranges. It only covers the heredoc marker (`< 2]').children[0].loc
+# # => >
+#
+# The {file:doc/AST_FORMAT.md} document describes how ranges associated to source
+# code tokens. For example, the entry
+#
+# (array (int 1) (int 2))
+#
+# "[1, 2]"
+# ^ begin
+# ^ end
+# ~~~~~~ expression
+#
+# means that if `node` is an {Parser::AST::Node} `(array (int 1) (int 2))`,
+# then `node.loc` responds to `begin`, `end` and `expression`, and
+# `node.loc.begin` returns a range pointing at the opening bracket, and so on.
+#
+# If you want to write code polymorphic by the source map (i.e. accepting
+# several subclasses of {Map}), use `respond_to?` instead of `is_a?` to
+# check whether the map features the range you need. Concrete {Map}
+# subclasses may not be preserved between versions, but their interfaces
+# will be kept compatible.
+#
+# You can visualize the source maps with `ruby-parse -E` command-line tool.
+#
+# @example
+# require 'parser/current'
+#
+# p Parser::CurrentRuby.parse('[1, 2]').loc
+# # => #,
+# # @begin=#,
+# # @expression=#>
+#
+# @!attribute [r] node
+# The node that is described by this map. Nodes and maps have 1:1 correspondence.
+# @return [Parser::AST::Node]
+#
+# @!attribute [r] expression
+# @return [Range]
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/source/map.rb:70
+class Parser::Source::Map
+ # @param [Range] expression
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:76
+ def initialize(expression); end
+
+ # Compares source maps.
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:140
+ def ==(other); end
+
+ # A shortcut for `self.expression.column`.
+ # @return [Integer]
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:109
+ def column; end
+
+ # pkg:gem/parser#lib/parser/source/map.rb:72
+ def expression; end
+
+ # pkg:gem/parser#lib/parser/source/map.rb:103
+ def first_line; end
+
+ # A shortcut for `self.expression.last_column`.
+ # @return [Integer]
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:125
+ def last_column; end
+
+ # A shortcut for `self.expression.last_line`.
+ # @return [Integer]
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:117
+ def last_line; end
+
+ # A shortcut for `self.expression.line`.
+ # @return [Integer]
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:99
+ def line; end
+
+ # pkg:gem/parser#lib/parser/source/map.rb:71
+ def node; end
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:89
+ def node=(node); end
+
+ # Converts this source map to a hash with keys corresponding to
+ # ranges. For example, if called on an instance of {Collection},
+ # which adds the `begin` and `end` ranges, the resulting hash
+ # will contain keys `:expression`, `:begin` and `:end`.
+ #
+ # @example
+ # require 'parser/current'
+ #
+ # p Parser::CurrentRuby.parse('[1, 2]').loc.to_hash
+ # # => {
+ # # :begin => #,
+ # # :end => #,
+ # # :expression => #
+ # # }
+ #
+ # @return [Hash]
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:166
+ def to_hash; end
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:132
+ def with_expression(expression_l); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/source/map.rb:180
+ def update_expression(expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map.rb:176
+ def with(&block); end
+
+ private
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map.rb:82
+ def initialize_copy(other); end
+end
+
+# pkg:gem/parser#lib/parser/source/map/collection.rb:6
+class Parser::Source::Map::Collection < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/collection.rb:10
+ def initialize(begin_l, end_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/collection.rb:7
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/collection.rb:8
+ def end; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/condition.rb:6
+class Parser::Source::Map::Condition < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/condition.rb:12
+ def initialize(keyword_l, begin_l, else_l, end_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/condition.rb:8
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/condition.rb:9
+ def else; end
+
+ # pkg:gem/parser#lib/parser/source/map/condition.rb:10
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/condition.rb:7
+ def keyword; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/constant.rb:6
+class Parser::Source::Map::Constant < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/constant.rb:11
+ def initialize(double_colon, name, expression); end
+
+ # pkg:gem/parser#lib/parser/source/map/constant.rb:7
+ def double_colon; end
+
+ # pkg:gem/parser#lib/parser/source/map/constant.rb:8
+ def name; end
+
+ # pkg:gem/parser#lib/parser/source/map/constant.rb:9
+ def operator; end
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map/constant.rb:20
+ def with_operator(operator_l); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/source/map/constant.rb:26
+ def update_operator(operator_l); end
+end
+
+# pkg:gem/parser#lib/parser/source/map/definition.rb:6
+class Parser::Source::Map::Definition < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/definition.rb:12
+ def initialize(keyword_l, operator_l, name_l, end_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/definition.rb:10
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/definition.rb:7
+ def keyword; end
+
+ # pkg:gem/parser#lib/parser/source/map/definition.rb:9
+ def name; end
+
+ # pkg:gem/parser#lib/parser/source/map/definition.rb:8
+ def operator; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/for.rb:6
+class Parser::Source::Map::For < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/for.rb:10
+ def initialize(keyword_l, in_l, begin_l, end_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/for.rb:8
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/for.rb:8
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/for.rb:7
+ def in; end
+
+ # pkg:gem/parser#lib/parser/source/map/for.rb:7
+ def keyword; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/heredoc.rb:6
+class Parser::Source::Map::Heredoc < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/heredoc.rb:10
+ def initialize(begin_l, body_l, end_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/heredoc.rb:7
+ def heredoc_body; end
+
+ # pkg:gem/parser#lib/parser/source/map/heredoc.rb:8
+ def heredoc_end; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/index.rb:6
+class Parser::Source::Map::Index < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/index.rb:11
+ def initialize(begin_l, end_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/index.rb:7
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/index.rb:8
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/index.rb:9
+ def operator; end
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map/index.rb:21
+ def with_operator(operator_l); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/source/map/index.rb:27
+ def update_operator(operator_l); end
+end
+
+# pkg:gem/parser#lib/parser/source/map/keyword.rb:6
+class Parser::Source::Map::Keyword < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/keyword.rb:11
+ def initialize(keyword_l, begin_l, end_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/keyword.rb:8
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/keyword.rb:9
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/keyword.rb:7
+ def keyword; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/method_definition.rb:6
+class Parser::Source::Map::MethodDefinition < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/method_definition.rb:13
+ def initialize(keyword_l, operator_l, name_l, end_l, assignment_l, body_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/method_definition.rb:11
+ def assignment; end
+
+ # pkg:gem/parser#lib/parser/source/map/method_definition.rb:10
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/method_definition.rb:7
+ def keyword; end
+
+ # pkg:gem/parser#lib/parser/source/map/method_definition.rb:9
+ def name; end
+
+ # pkg:gem/parser#lib/parser/source/map/method_definition.rb:8
+ def operator; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/objc_kwarg.rb:6
+class Parser::Source::Map::ObjcKwarg < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/objc_kwarg.rb:11
+ def initialize(keyword_l, operator_l, argument_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/objc_kwarg.rb:9
+ def argument; end
+
+ # pkg:gem/parser#lib/parser/source/map/objc_kwarg.rb:7
+ def keyword; end
+
+ # pkg:gem/parser#lib/parser/source/map/objc_kwarg.rb:8
+ def operator; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/operator.rb:6
+class Parser::Source::Map::Operator < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/operator.rb:9
+ def initialize(operator, expression); end
+
+ # pkg:gem/parser#lib/parser/source/map/operator.rb:7
+ def operator; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/rescue_body.rb:6
+class Parser::Source::Map::RescueBody < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/rescue_body.rb:11
+ def initialize(keyword_l, assoc_l, begin_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/rescue_body.rb:8
+ def assoc; end
+
+ # pkg:gem/parser#lib/parser/source/map/rescue_body.rb:9
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/rescue_body.rb:7
+ def keyword; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/send.rb:6
+class Parser::Source::Map::Send < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/send.rb:13
+ def initialize(dot_l, selector_l, begin_l, end_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/send.rb:10
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/map/send.rb:7
+ def dot; end
+
+ # pkg:gem/parser#lib/parser/source/map/send.rb:11
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/map/send.rb:9
+ def operator; end
+
+ # pkg:gem/parser#lib/parser/source/map/send.rb:8
+ def selector; end
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map/send.rb:24
+ def with_operator(operator_l); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/source/map/send.rb:30
+ def update_operator(operator_l); end
+end
+
+# pkg:gem/parser#lib/parser/source/map/ternary.rb:6
+class Parser::Source::Map::Ternary < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/ternary.rb:10
+ def initialize(question_l, colon_l, expression_l); end
+
+ # pkg:gem/parser#lib/parser/source/map/ternary.rb:8
+ def colon; end
+
+ # pkg:gem/parser#lib/parser/source/map/ternary.rb:7
+ def question; end
+end
+
+# pkg:gem/parser#lib/parser/source/map/variable.rb:6
+class Parser::Source::Map::Variable < ::Parser::Source::Map
+ # pkg:gem/parser#lib/parser/source/map/variable.rb:10
+ def initialize(name_l, expression_l = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/source/map/variable.rb:7
+ def name; end
+
+ # pkg:gem/parser#lib/parser/source/map/variable.rb:8
+ def operator; end
+
+ # @api private
+ #
+ # pkg:gem/parser#lib/parser/source/map/variable.rb:19
+ def with_operator(operator_l); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/source/map/variable.rb:25
+ def update_operator(operator_l); end
+end
+
+# A range of characters in a particular source buffer.
+#
+# The range is always exclusive, i.e. a range with `begin_pos` of 3 and
+# `end_pos` of 5 will contain the following characters:
+#
+# example
+# ^^
+#
+# @!attribute [r] source_buffer
+# @return [Parser::Source::Buffer]
+#
+# @!attribute [r] begin_pos
+# @return [Integer] index of the first character in the range
+#
+# @!attribute [r] end_pos
+# @return [Integer] index of the character after the last character in the range
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/source/range.rb:26
+class Parser::Source::Range
+ include ::Comparable
+
+ # @param [Buffer] source_buffer
+ # @param [Integer] begin_pos
+ # @param [Integer] end_pos
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:37
+ def initialize(source_buffer, begin_pos, end_pos); end
+
+ # Compare ranges, first by begin_pos, then by end_pos.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:301
+ def <=>(other); end
+
+ # @param [Hash] Endpoint(s) to change, any combination of :begin_pos or :end_pos
+ # @return [Range] the same range as this range but with the given end point(s) adjusted
+ # by the given amount(s)
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:193
+ def adjust(begin_pos: T.unsafe(nil), end_pos: T.unsafe(nil)); end
+
+ # @return [Range] a zero-length range located just before the beginning
+ # of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:55
+ def begin; end
+
+ # pkg:gem/parser#lib/parser/source/range.rb:30
+ def begin_pos; end
+
+ # @return [Integer] zero-based column number of the beginning of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:92
+ def column; end
+
+ # @return [::Range] a range of columns spanned by this range.
+ # @raise RangeError
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:114
+ def column_range; end
+
+ # Return `other.contains?(self)`
+ #
+ # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+ #
+ # @param [Range] other
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:274
+ def contained?(other); end
+
+ # Returns true iff this range contains (strictly) `other`.
+ #
+ # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+ #
+ # @param [Range] other
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:262
+ def contains?(other); end
+
+ # Returns true iff both ranges intersect and also have different elements from one another.
+ #
+ # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+ #
+ # @param [Range] other
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:286
+ def crossing?(other); end
+
+ # Return `true` iff this range and `other` are disjoint.
+ #
+ # Two ranges must be one and only one of ==, disjoint?, contains?, contained? or crossing?
+ #
+ # @param [Range] other
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:236
+ def disjoint?(other); end
+
+ # Checks if a range is empty; if it contains no characters
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:294
+ def empty?; end
+
+ # @return [Range] a zero-length range located just after the end
+ # of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:63
+ def end; end
+
+ # pkg:gem/parser#lib/parser/source/range.rb:30
+ def end_pos; end
+
+ # pkg:gem/parser#lib/parser/source/range.rb:308
+ def eql?(_arg0); end
+
+ # pkg:gem/parser#lib/parser/source/range.rb:87
+ def first_line; end
+
+ # Support for Ranges be used in as Hash indices and in Sets.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:313
+ def hash; end
+
+ # @return [String] a human-readable representation of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:320
+ def inspect; end
+
+ # @param [Range] other
+ # @return [Range] overlapping region of this range and `other`, or `nil`
+ # if they do not overlap
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:220
+ def intersect(other); end
+
+ # `is?` provides a concise way to compare the source corresponding to this range.
+ # For example, `r.source == '(' || r.source == 'begin'` is equivalent to
+ # `r.is?('(', 'begin')`.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:141
+ def is?(*what); end
+
+ # @param [Range] other
+ # @return [Range] smallest possible range spanning both this range and `other`.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:209
+ def join(other); end
+
+ # @return [Integer] zero-based column number of the end of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:106
+ def last_column; end
+
+ # @return [Integer] line number of the end of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:99
+ def last_line; end
+
+ # pkg:gem/parser#lib/parser/source/range.rb:74
+ def length; end
+
+ # Line number of the beginning of this range. By default, the first line
+ # of a buffer is 1; as such, line numbers are most commonly one-based.
+ #
+ # @see Buffer
+ # @return [Integer] line number of the beginning of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:83
+ def line; end
+
+ # Return `true` iff this range is not disjoint from `other`.
+ #
+ # @param [Range] other
+ # @return [Boolean] `true` if this range and `other` overlap
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:250
+ def overlaps?(other); end
+
+ # @param [Integer] new_size
+ # @return [Range] a range beginning at the same point as this range and length `new_size`.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:201
+ def resize(new_size); end
+
+ # @return [Integer] amount of characters included in this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:70
+ def size; end
+
+ # @return [String] all source code covered by this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:132
+ def source; end
+
+ # pkg:gem/parser#lib/parser/source/range.rb:29
+ def source_buffer; end
+
+ # @return [String] a line of source code containing the beginning of this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:125
+ def source_line; end
+
+ # @return [Array] a set of character indexes contained in this range.
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:148
+ def to_a; end
+
+ # @return [Range] a Ruby range with the same `begin_pos` and `end_pos`
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:155
+ def to_range; end
+
+ # Composes a GNU/Clang-style string representation of the beginning of this
+ # range.
+ #
+ # For example, for the following range in file `foo.rb`,
+ #
+ # def foo
+ # ^^^
+ #
+ # `to_s` will return `foo.rb:1:5`.
+ # Note that the column index is one-based.
+ #
+ # @return [String]
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:173
+ def to_s; end
+
+ # @param [Hash] Endpoint(s) to change, any combination of :begin_pos or :end_pos
+ # @return [Range] the same range as this range but with the given end point(s) changed
+ # to the given value(s).
+ #
+ # pkg:gem/parser#lib/parser/source/range.rb:184
+ def with(begin_pos: T.unsafe(nil), end_pos: T.unsafe(nil)); end
+end
+
+# {Rewriter} is deprecated. Use {TreeRewriter} instead.
+#
+# TreeRewriter has simplified semantics, and customizable policies
+# with regards to clobbering. Please read the documentation.
+#
+# Keep in mind:
+# - Rewriter was discarding the `end_pos` of the given range for `insert_before`,
+# and the `begin_pos` for `insert_after`. These are meaningful in TreeRewriter.
+# - TreeRewriter's wrap/insert_before/insert_after are multiple by default, while
+# Rewriter would raise clobbering errors if the non '_multi' version was called.
+# - The TreeRewriter policy closest to Rewriter's behavior is:
+# different_replacements: :raise,
+# swallowed_insertions: :raise,
+# crossing_deletions: :accept
+#
+# @!attribute [r] source_buffer
+# @return [Source::Buffer]
+#
+# @!attribute [r] diagnostics
+# @return [Diagnostic::Engine]
+#
+# @api public
+# @deprecated Use {TreeRewriter}
+#
+# pkg:gem/parser#lib/parser/source/rewriter.rb:31
+class Parser::Source::Rewriter
+ extend ::Parser::Deprecation
+
+ # @param [Source::Buffer] source_buffer
+ # @deprecated Use {TreeRewriter}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:39
+ def initialize(source_buffer); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:33
+ def diagnostics; end
+
+ # Inserts new code after the given source range.
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#insert_after}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:131
+ def insert_after(range, content); end
+
+ # Inserts new code after the given source range by allowing other
+ # insertions at the same position.
+ # Note that an insertion with latter invocation comes _after_ earlier
+ # insertion at the same position in the rewritten source.
+ #
+ # @example Inserting ')]'
+ # rewriter.
+ # insert_after_multi(range, ')').
+ # insert_after_multi(range, ']').
+ # process
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#insert_after}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:153
+ def insert_after_multi(range, content); end
+
+ # Inserts new code before the given source range.
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#insert_before}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:80
+ def insert_before(range, content); end
+
+ # Inserts new code before the given source range by allowing other
+ # insertions at the same position.
+ # Note that an insertion with latter invocation comes _before_ earlier
+ # insertion at the same position in the rewritten source.
+ #
+ # @example Inserting '[('
+ # rewriter.
+ # insert_before_multi(range, '(').
+ # insert_before_multi(range, '[').
+ # process
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#insert_before}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:117
+ def insert_before_multi(range, content); end
+
+ # Applies all scheduled changes to the `source_buffer` and returns
+ # modified source as a new string.
+ #
+ # @return [String]
+ # @deprecated Use {TreeRewriter#process}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:178
+ def process; end
+
+ # Removes the source range.
+ #
+ # @param [Range] range
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#remove}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:67
+ def remove(range); end
+
+ # Replaces the code of the source range `range` with `content`.
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#replace}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:167
+ def replace(range, content); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:32
+ def source_buffer; end
+
+ # Provides a protected block where a sequence of multiple rewrite actions
+ # are handled atomically. If any of the actions failed by clobbering,
+ # all the actions are rolled back.
+ #
+ # @example
+ # begin
+ # rewriter.transaction do
+ # rewriter.insert_before(range_of_something, '(')
+ # rewriter.insert_after(range_of_something, ')')
+ # end
+ # rescue Parser::ClobberingError
+ # end
+ #
+ # @raise [RuntimeError] when no block is passed
+ # @raise [RuntimeError] when already in a transaction
+ # @deprecated Use {TreeRewriter#transaction}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:216
+ def transaction; end
+
+ # Inserts new code before and after the given source range.
+ #
+ # @param [Range] range
+ # @param [String] before
+ # @param [String] after
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ # @deprecated Use {TreeRewriter#wrap}
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:94
+ def wrap(range, before, after); end
+
+ private
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:476
+ def active_clobber; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:484
+ def active_clobber=(value); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:480
+ def active_insertions; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:492
+ def active_insertions=(value); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:472
+ def active_queue; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:500
+ def adjacent?(range1, range2); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:351
+ def adjacent_insertion_mask(range); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:366
+ def adjacent_insertions?(range); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:347
+ def adjacent_position_mask(range); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:377
+ def adjacent_updates?(range); end
+
+ # Schedule a code update. If it overlaps with another update, check
+ # whether they conflict, and raise a clobbering error if they do.
+ # (As a special case, zero-length ranges at the same position are
+ # considered to "overlap".) Otherwise, merge them.
+ #
+ # Updates which are adjacent to each other, but do not overlap, are also
+ # merged.
+ #
+ # RULES:
+ #
+ # - Insertion ("replacing" a zero-length range):
+ # - Two insertions at the same point conflict. This is true even
+ # if the earlier insertion has already been merged with an adjacent
+ # update, and even if they are both inserting the same text.
+ # - An insertion never conflicts with a replace or remove operation
+ # on its right or left side, which does not overlap it (in other
+ # words, which does not update BOTH its right and left sides).
+ # - An insertion always conflicts with a remove operation which spans
+ # both its sides.
+ # - An insertion conflicts with a replace operation which spans both its
+ # sides, unless the replacement text is longer than the replaced text
+ # by the size of the insertion (or more), and the portion of
+ # replacement text immediately after the insertion position is
+ # identical to the inserted text.
+ #
+ # - Removal operations never conflict with each other.
+ #
+ # - Replacement operations:
+ # - Take the portion of each replacement text which falls within:
+ # - The other operation's replaced region
+ # - The other operation's replacement text, if it extends past the
+ # end of its own replaced region (in other words, if the replacement
+ # text is longer than the text it replaces)
+ # - If and only if the taken texts are identical for both operations,
+ # they do not conflict.
+ #
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:280
+ def append(action); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:389
+ def can_merge?(action, existing); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:355
+ def clobbered_insertion?(insertion); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:343
+ def clobbered_position_mask(range); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:468
+ def in_transaction?; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:410
+ def merge_actions(action, existing); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:419
+ def merge_actions!(action, existing); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:425
+ def merge_replacements(actions); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:450
+ def raise_clobber_error(action, existing); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:335
+ def record_insertion(range); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:339
+ def record_replace(range); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:445
+ def replace_actions(old, updated); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter.rb:383
+ def replace_compatible_with_insertion?(replace, insertion); end
+end
+
+# @api private
+#
+# pkg:gem/parser#lib/parser/source/rewriter/action.rb:9
+class Parser::Source::Rewriter::Action
+ include ::Comparable
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:15
+ def initialize(range, replacement = T.unsafe(nil), allow_multiple_insertions = T.unsafe(nil), order = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:24
+ def <=>(other); end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:12
+ def allow_multiple_insertions; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:13
+ def allow_multiple_insertions?; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:12
+ def order; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:12
+ def range; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:12
+ def replacement; end
+
+ # pkg:gem/parser#lib/parser/source/rewriter/action.rb:30
+ def to_s; end
+end
+
+# pkg:gem/parser#lib/parser/source/rewriter.rb:504
+Parser::Source::Rewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String)
+
+# {TreeRewriter} performs the heavy lifting in the source rewriting process.
+# It schedules code updates to be performed in the correct order.
+#
+# For simple cases, the resulting source will be obvious.
+#
+# Examples for more complex cases follow. Assume these examples are acting on
+# the source `'puts(:hello, :world)`. The methods #wrap, #remove, etc.
+# receive a Range as first argument; for clarity, examples below use english
+# sentences and a string of raw code instead.
+#
+# ## Overlapping ranges:
+#
+# Any two rewriting actions on overlapping ranges will fail and raise
+# a `ClobberingError`, unless they are both deletions (covered next).
+#
+# * wrap ':hello, ' with '(' and ')'
+# * wrap ', :world' with '(' and ')'
+# => CloberringError
+#
+# ## Overlapping deletions:
+#
+# * remove ':hello, '
+# * remove ', :world'
+#
+# The overlapping ranges are merged and `':hello, :world'` will be removed.
+# This policy can be changed. `:crossing_deletions` defaults to `:accept`
+# but can be set to `:warn` or `:raise`.
+#
+# ## Multiple actions at the same end points:
+#
+# Results will always be independent on the order they were given.
+# Exception: rewriting actions done on exactly the same range (covered next).
+#
+# Example:
+# * replace ', ' by ' => '
+# * wrap ':hello, :world' with '{' and '}'
+# * replace ':world' with ':everybody'
+# * wrap ':world' with '[', ']'
+#
+# The resulting string will be `'puts({:hello => [:everybody]})'`
+# and this result is independent on the order the instructions were given in.
+#
+# Note that if the two "replace" were given as a single replacement of ', :world'
+# for ' => :everybody', the result would be a `ClobberingError` because of the wrap
+# in square brackets.
+#
+# ## Multiple wraps on same range:
+# * wrap ':hello' with '(' and ')'
+# * wrap ':hello' with '[' and ']'
+#
+# The wraps are combined in order given and results would be `'puts([(:hello)], :world)'`.
+#
+# ## Multiple replacements on same range:
+# * replace ':hello' by ':hi', then
+# * replace ':hello' by ':hey'
+#
+# The replacements are made in the order given, so the latter replacement
+# supersedes the former and ':hello' will be replaced by ':hey'.
+#
+# This policy can be changed. `:different_replacements` defaults to `:accept`
+# but can be set to `:warn` or `:raise`.
+#
+# ## Swallowed insertions:
+# wrap 'world' by '__', '__'
+# replace ':hello, :world' with ':hi'
+#
+# A containing replacement will swallow the contained rewriting actions
+# and `':hello, :world'` will be replaced by `':hi'`.
+#
+# This policy can be changed for swallowed insertions. `:swallowed_insertions`
+# defaults to `:accept` but can be set to `:warn` or `:raise`
+#
+# ## Implementation
+# The updates are organized in a tree, according to the ranges they act on
+# (where children are strictly contained by their parent), hence the name.
+#
+# @!attribute [r] source_buffer
+# @return [Source::Buffer]
+#
+# @!attribute [r] diagnostics
+# @return [Diagnostic::Engine]
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/source/tree_rewriter.rb:91
+class Parser::Source::TreeRewriter
+ extend ::Parser::Deprecation
+
+ # @param [Source::Buffer] source_buffer
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:98
+ def initialize(source_buffer, crossing_deletions: T.unsafe(nil), different_replacements: T.unsafe(nil), swallowed_insertions: T.unsafe(nil)); end
+
+ # Returns a representation of the rewriter as nested insertions (:wrap) and replacements.
+ #
+ # rewriter.as_actions # =>[ [:wrap, 1...10, '(', ')'],
+ # [:wrap, 2...6, '', '!'], # aka "insert_after"
+ # [:replace, 2...4, 'foo'],
+ # [:replace, 5...6, ''], # aka "removal"
+ # ],
+ #
+ # Contrary to `as_replacements`, this representation is sufficient to recreate exactly
+ # the rewriter.
+ #
+ # @return [Array<(Symbol, Range, String{, String})>]
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:299
+ def as_nested_actions; end
+
+ # Returns a representation of the rewriter as an ordered list of replacements.
+ #
+ # rewriter.as_replacements # => [ [1...1, '('],
+ # [2...4, 'foo'],
+ # [5...6, ''],
+ # [6...6, '!'],
+ # [10...10, ')'],
+ # ]
+ #
+ # This representation is sufficient to recreate the result of `process` but it is
+ # not sufficient to recreate completely the rewriter for further merging/actions.
+ # See `as_nested_actions`
+ #
+ # @return [Array] an ordered list of pairs of range & replacement
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:281
+ def as_replacements; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:93
+ def diagnostics; end
+
+ # Returns true iff no (non trivial) update has been recorded
+ #
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:125
+ def empty?; end
+
+ # For special cases where one needs to merge a rewriter attached to a different source_buffer
+ # or that needs to be offset. Policies of the receiver are used.
+ #
+ # @param [TreeRewriter] rewriter from different source_buffer
+ # @param [Integer] offset
+ # @return [Rewriter] self
+ # @raise [IndexError] if action ranges (once offset) don't fit the current buffer
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:168
+ def import!(foreign_rewriter, offset: T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:329
+ def in_transaction?; end
+
+ # Shortcut for `wrap(range, nil, content)`
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:242
+ def insert_after(range, content); end
+
+ # @api private
+ # @deprecated Use insert_after or wrap
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:351
+ def insert_after_multi(range, text); end
+
+ # Shortcut for `wrap(range, content, nil)`
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:230
+ def insert_before(range, content); end
+
+ # @api private
+ # @deprecated Use insert_after or wrap
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:342
+ def insert_before_multi(range, text); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:334
+ def inspect; end
+
+ # Returns a new rewriter that consists of the updates of the received
+ # and the given argument. Policies of the receiver are used.
+ #
+ # @param [Rewriter] with
+ # @return [Rewriter] merge of receiver and argument
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:155
+ def merge(with); end
+
+ # Merges the updates of argument with the receiver.
+ # Policies of the receiver are used.
+ # This action is atomic in that it won't change the receiver
+ # unless it succeeds.
+ #
+ # @param [Rewriter] with
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:139
+ def merge!(with); end
+
+ # Applies all scheduled changes to the `source_buffer` and returns
+ # modified source as a new string.
+ #
+ # @return [String]
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:252
+ def process; end
+
+ # Shortcut for `replace(range, '')`
+ #
+ # @param [Range] range
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:217
+ def remove(range); end
+
+ # Replaces the code of the source range `range` with `content`.
+ #
+ # @param [Range] range
+ # @param [String] content
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:193
+ def replace(range, content); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:92
+ def source_buffer; end
+
+ # Provides a protected block where a sequence of multiple rewrite actions
+ # are handled atomically. If any of the actions failed by clobbering,
+ # all the actions are rolled back. Transactions can be nested.
+ #
+ # @raise [RuntimeError] when no block is passed
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:310
+ def transaction; end
+
+ # Inserts the given strings before and after the given range.
+ #
+ # @param [Range] range
+ # @param [String, nil] insert_before
+ # @param [String, nil] insert_after
+ # @return [Rewriter] self
+ # @raise [ClobberingError] when clobbering is detected
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:206
+ def wrap(range, insert_before, insert_after); end
+
+ protected
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:365
+ def action_root; end
+
+ private
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:369
+ def action_summary; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:392
+ def check_policy_validity; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:404
+ def check_range_validity(range); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:397
+ def combine(range, attributes); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:411
+ def enforce_policy(event); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter.rb:418
+ def trigger_policy(event, range: T.unsafe(nil), conflict: T.unsafe(nil), **arguments); end
+end
+
+# pkg:gem/parser#lib/parser/source/tree_rewriter.rb:391
+Parser::Source::TreeRewriter::ACTIONS = T.let(T.unsafe(nil), Array)
+
+# @api private
+#
+# Actions are arranged in a tree and get combined so that:
+#
+# * Children are strictly contained by their parent
+# * Siblings are all disjointed from one another and ordered
+# * Only actions with `replacement == nil` may have children
+#
+# pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:14
+class Parser::Source::TreeRewriter::Action
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:17
+ def initialize(range, enforcer, insert_before: T.unsafe(nil), replacement: T.unsafe(nil), insert_after: T.unsafe(nil), children: T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:29
+ def combine(action); end
+
+ # A root action has its range set to the whole source range, even
+ # though it typically does not act on that range.
+ # This method returns the action as if it was a child action with
+ # its range contracted.
+ # @return [Action]
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:68
+ def contract; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:34
+ def empty?; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:15
+ def insert_after; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:15
+ def insert_before; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:58
+ def insertion?; end
+
+ # @return [Action] that has been moved to the given source_buffer and with the given offset
+ # No check is done on validity of resulting range.
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:81
+ def moved(source_buffer, offset); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:50
+ def nested_actions; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:41
+ def ordered_replacements; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:15
+ def range; end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:15
+ def replacement; end
+
+ protected
+
+ # Returns the children in a hierarchy with respect to `action`:
+ # :sibbling_left, sibbling_right (for those that are disjoint from `action`)
+ # :parent (in case one of our children contains `action`)
+ # :child (in case `action` strictly contains some of our children)
+ # :fusible (in case `action` overlaps some children but they can be fused in one deletion)
+ # or raises a `CloberingError`
+ # In case a child has equal range to `action`, it is returned as `:parent`
+ # Reminder: an empty range 1...1 is considered disjoint from 1...10
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:159
+ def analyse_hierarchy(action); end
+
+ # Similar to @children.bsearch_index || size
+ # except allows for a starting point
+ # and `bsearch_index` is only Ruby 2.3+
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:146
+ def bsearch_child_index(from = T.unsafe(nil)); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:225
+ def call_enforcer_for_merge(action); end
+
+ # @param [Array(Action | nil)] fusible
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:205
+ def check_fusible(action, *fusible); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:95
+ def children; end
+
+ # Assumes `more_children` all contained within `@range`
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:130
+ def combine_children(more_children); end
+
+ # Assumes range.contains?(action.range) && action.children.empty?
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:103
+ def do_combine(action); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:136
+ def fuse_deletions(action, fusible, other_sibblings); end
+
+ # Assumes action.range == range && action.children.empty?
+ #
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:216
+ def merge(action); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:111
+ def place_in_hierarchy(action); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:233
+ def swallow(children); end
+
+ # pkg:gem/parser#lib/parser/source/tree_rewriter/action.rb:97
+ def with(range: T.unsafe(nil), enforcer: T.unsafe(nil), children: T.unsafe(nil), insert_before: T.unsafe(nil), replacement: T.unsafe(nil), insert_after: T.unsafe(nil)); end
+end
+
+# pkg:gem/parser#lib/parser/source/tree_rewriter.rb:356
+Parser::Source::TreeRewriter::DEPRECATION_WARNING = T.let(T.unsafe(nil), String)
+
+# pkg:gem/parser#lib/parser/source/tree_rewriter.rb:417
+Parser::Source::TreeRewriter::POLICY_TO_LEVEL = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:5
+class Parser::StaticEnvironment
+ # pkg:gem/parser#lib/parser/static_environment.rb:17
+ def initialize; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:55
+ def declare(name); end
+
+ # Anonymous blockarg
+ #
+ # pkg:gem/parser#lib/parser/static_environment.rb:77
+ def declare_anonymous_blockarg; end
+
+ # Anonymous kwresarg
+ #
+ # pkg:gem/parser#lib/parser/static_environment.rb:113
+ def declare_anonymous_kwrestarg; end
+
+ # Anonymous restarg
+ #
+ # pkg:gem/parser#lib/parser/static_environment.rb:95
+ def declare_anonymous_restarg; end
+
+ # Forward args
+ #
+ # pkg:gem/parser#lib/parser/static_environment.rb:67
+ def declare_forward_args; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:61
+ def declared?(name); end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:81
+ def declared_anonymous_blockarg?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:85
+ def declared_anonymous_blockarg_in_current_scpe?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:117
+ def declared_anonymous_kwrestarg?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:121
+ def declared_anonymous_kwrestarg_in_current_scope?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:99
+ def declared_anonymous_restarg?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:103
+ def declared_anonymous_restarg_in_current_scope?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:71
+ def declared_forward_args?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:129
+ def empty?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:33
+ def extend_dynamic; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:26
+ def extend_static; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:89
+ def parent_has_anonymous_blockarg?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:125
+ def parent_has_anonymous_kwrestarg?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:107
+ def parent_has_anonymous_restarg?; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:21
+ def reset; end
+
+ # pkg:gem/parser#lib/parser/static_environment.rb:49
+ def unextend; end
+end
+
+# pkg:gem/parser#lib/parser/static_environment.rb:15
+Parser::StaticEnvironment::ANONYMOUS_BLOCKARG_INHERITED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:14
+Parser::StaticEnvironment::ANONYMOUS_BLOCKARG_IN_CURRENT_SCOPE = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:12
+Parser::StaticEnvironment::ANONYMOUS_KWRESTARG_INHERITED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:11
+Parser::StaticEnvironment::ANONYMOUS_KWRESTARG_IN_CURRENT_SCOPE = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:9
+Parser::StaticEnvironment::ANONYMOUS_RESTARG_INHERITED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:8
+Parser::StaticEnvironment::ANONYMOUS_RESTARG_IN_CURRENT_SCOPE = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/parser#lib/parser/static_environment.rb:6
+Parser::StaticEnvironment::FORWARD_ARGS = T.let(T.unsafe(nil), Symbol)
+
+# {Parser::SyntaxError} is raised whenever parser detects a syntax error,
+# similar to the standard SyntaxError class.
+#
+# @api public
+#
+# @!attribute [r] diagnostic
+# @return [Parser::Diagnostic]
+#
+# pkg:gem/parser#lib/parser/syntax_error.rb:13
+class Parser::SyntaxError < ::StandardError
+ # pkg:gem/parser#lib/parser/syntax_error.rb:16
+ def initialize(diagnostic); end
+
+ # pkg:gem/parser#lib/parser/syntax_error.rb:14
+ def diagnostic; end
+end
+
+# {Parser::TreeRewriter} offers a basic API that makes it easy to rewrite
+# existing ASTs. It's built on top of {Parser::AST::Processor} and
+# {Parser::Source::TreeRewriter}
+#
+# For example, assume you want to remove `do` tokens from a while statement.
+# You can do this as following:
+#
+# require 'parser/current'
+#
+# class RemoveDo < Parser::TreeRewriter
+# def on_while(node)
+# # Check if the statement starts with "do"
+# if node.location.begin.is?('do')
+# remove(node.location.begin)
+# end
+# end
+# end
+#
+# code = <<-EOF
+# while true do
+# puts 'hello'
+# end
+# EOF
+#
+# ast = Parser::CurrentRuby.parse code
+# buffer = Parser::Source::Buffer.new('(example)', source: code)
+# rewriter = RemoveDo.new
+#
+# # Rewrite the AST, returns a String with the new form.
+# puts rewriter.rewrite(buffer, ast)
+#
+# This would result in the following Ruby code:
+#
+# while true
+# puts 'hello'
+# end
+#
+# Keep in mind that {Parser::TreeRewriter} does not take care of indentation when
+# inserting/replacing code so you'll have to do this yourself.
+#
+# See also [a blog entry](http://whitequark.org/blog/2013/04/26/lets-play-with-ruby-code/)
+# describing rewriters in greater detail.
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/tree_rewriter.rb:51
+class Parser::TreeRewriter < ::Parser::AST::Processor
+ # Returns `true` if the specified node is an assignment node, returns false
+ # otherwise.
+ #
+ # @param [Parser::AST::Node] node
+ # @return [Boolean]
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:79
+ def assignment?(node); end
+
+ # Inserts new code after the given source range.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:118
+ def insert_after(range, content); end
+
+ # Inserts new code before the given source range.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:108
+ def insert_before(range, content); end
+
+ # Removes the source range.
+ #
+ # @param [Parser::Source::Range] range
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:88
+ def remove(range); end
+
+ # Replaces the code of the source range `range` with `content`.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:128
+ def replace(range, content); end
+
+ # Rewrites the AST/source buffer and returns a String containing the new
+ # version.
+ #
+ # @param [Parser::Source::Buffer] source_buffer
+ # @param [Parser::AST::Node] ast
+ # @param [Symbol] crossing_deletions:, different_replacements:, swallowed_insertions:
+ # policy arguments for TreeRewriter (optional)
+ # @return [String]
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:62
+ def rewrite(source_buffer, ast, **policy); end
+
+ # Wraps the given source range with the given values.
+ #
+ # @param [Parser::Source::Range] range
+ # @param [String] content
+ #
+ # pkg:gem/parser#lib/parser/tree_rewriter.rb:98
+ def wrap(range, before, after); end
+end
+
+# {Parser::UnknownEncodingInMagicComment} is raised when a magic encoding
+# comment is encountered that the currently running Ruby version doesn't
+# recognize. It inherits from {ArgumentError} since that is the exception
+# Ruby itself raises when trying to execute a file with an unknown encoding.
+# As such, it is also not a {Parser::SyntaxError}.
+#
+# @api public
+#
+# pkg:gem/parser#lib/parser/unknown_encoding_in_magic_comment_error.rb:13
+class Parser::UnknownEncodingInMagicComment < ::ArgumentError; end
+
+# pkg:gem/parser#lib/parser/version.rb:4
+Parser::VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/parser#lib/parser/variables_stack.rb:5
+class Parser::VariablesStack
+ # pkg:gem/parser#lib/parser/variables_stack.rb:6
+ def initialize; end
+
+ # pkg:gem/parser#lib/parser/variables_stack.rb:27
+ def declare(name); end
+
+ # pkg:gem/parser#lib/parser/variables_stack.rb:31
+ def declared?(name); end
+
+ # pkg:gem/parser#lib/parser/variables_stack.rb:11
+ def empty?; end
+
+ # pkg:gem/parser#lib/parser/variables_stack.rb:19
+ def pop; end
+
+ # pkg:gem/parser#lib/parser/variables_stack.rb:15
+ def push; end
+
+ # pkg:gem/parser#lib/parser/variables_stack.rb:23
+ def reset; end
+end
diff --git a/sorbet/rbi/gems/pastel@0.8.0.rbi b/sorbet/rbi/gems/pastel@0.8.0.rbi
new file mode 100644
index 0000000..bdffc13
--- /dev/null
+++ b/sorbet/rbi/gems/pastel@0.8.0.rbi
@@ -0,0 +1,760 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `pastel` gem.
+# Please instead update this file by running `bin/tapioca gem pastel`.
+
+
+# pkg:gem/pastel#lib/pastel/alias_importer.rb:3
+module Pastel
+ private
+
+ # Create Pastel chainable API
+ #
+ # @example
+ # pastel = Pastel.new enabled: true
+ #
+ # @param [Boolean] :enabled
+ # whether or not to disable coloring
+ # @param [Boolean] :eachline
+ # whether or not to wrap eachline with separate coloring
+ #
+ # @return [Delegator]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel.rb:31
+ def new(enabled: T.unsafe(nil), eachline: T.unsafe(nil)); end
+
+ class << self
+ # pkg:gem/pastel#lib/pastel.rb:41
+ def new(enabled: T.unsafe(nil), eachline: T.unsafe(nil)); end
+ end
+end
+
+# Mixin that provides ANSI codes
+#
+# pkg:gem/pastel#lib/pastel/ansi.rb:5
+module Pastel::ANSI
+ private
+
+ # pkg:gem/pastel#lib/pastel/ansi.rb:62
+ def background?(code); end
+
+ # pkg:gem/pastel#lib/pastel/ansi.rb:58
+ def foreground?(code); end
+
+ # pkg:gem/pastel#lib/pastel/ansi.rb:66
+ def style?(code); end
+
+ class << self
+ # pkg:gem/pastel#lib/pastel/ansi.rb:62
+ def background?(code); end
+
+ # pkg:gem/pastel#lib/pastel/ansi.rb:58
+ def foreground?(code); end
+
+ # pkg:gem/pastel#lib/pastel/ansi.rb:66
+ def style?(code); end
+ end
+end
+
+# pkg:gem/pastel#lib/pastel/ansi.rb:6
+Pastel::ANSI::ATTRIBUTES = T.let(T.unsafe(nil), Hash)
+
+# A class responsible for importing color aliases
+#
+# pkg:gem/pastel#lib/pastel/alias_importer.rb:5
+class Pastel::AliasImporter
+ # Create alias importer
+ #
+ # @example
+ # importer = Pastel::AliasImporter.new(Pastel::Color.new, {})
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/alias_importer.rb:12
+ def initialize(color, env, output = T.unsafe(nil)); end
+
+ # Import aliases from the environment
+ #
+ # @example
+ # importer = Pastel::AliasImporter.new(Pastel::Color.new, {})
+ # importer.import
+ #
+ # @return [nil]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/alias_importer.rb:27
+ def import; end
+
+ protected
+
+ # pkg:gem/pastel#lib/pastel/alias_importer.rb:44
+ def color; end
+
+ # pkg:gem/pastel#lib/pastel/alias_importer.rb:44
+ def env; end
+
+ # pkg:gem/pastel#lib/pastel/alias_importer.rb:44
+ def output; end
+end
+
+# A class responsible for coloring strings.
+#
+# pkg:gem/pastel#lib/pastel/color.rb:7
+class Pastel::Color
+ include ::Pastel::ANSI
+
+ # Initialize a Terminal Color
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:24
+ def initialize(enabled: T.unsafe(nil), eachline: T.unsafe(nil)); end
+
+ # Compare colors for equivalence of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:235
+ def ==(other); end
+
+ # Define a new colors alias
+ #
+ # @param [String] alias_name
+ # the colors alias to define
+ # @param [Array[Symbol,String]] color
+ # the colors the alias will correspond to
+ #
+ # @return [Array[String]]
+ # the standard color values of the alias
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:206
+ def alias_color(alias_name, *colors); end
+
+ # Apply escape codes to the string
+ #
+ # @param [String] string
+ # the string to apply escapes to
+ # @param [Strin] ansi_colors
+ # the ansi colors to apply
+ #
+ # @return [String]
+ # return the string surrounded by escape codes
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:78
+ def apply_codes(string, ansi_colors); end
+
+ # Reset sequence
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:85
+ def clear; end
+
+ # Return raw color code without embeding it into a string.
+ #
+ # @return [Array[String]]
+ # ANSI escape codes
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:148
+ def code(*colors); end
+
+ # Check if string has color escape codes
+ #
+ # @param [String] string
+ # the string to check for color strings
+ #
+ # @return [Boolean]
+ # true when string contains color codes, false otherwise
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:117
+ def colored?(string); end
+
+ # Apply ANSI color to the given string.
+ #
+ # Wraps eachline with clear escape.
+ #
+ # @param [String] string
+ # text to add ANSI strings
+ #
+ # @param [Array[Symbol]] colors
+ # the color names
+ #
+ # @example
+ # color.decorate "text", :yellow, :on_green, :underline
+ #
+ # @return [String]
+ # the colored string
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:54
+ def decorate(string, *colors); end
+
+ # Disable coloring of this terminal session
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:33
+ def disable!; end
+
+ # pkg:gem/pastel#lib/pastel/color.rb:19
+ def eachline; end
+
+ # pkg:gem/pastel#lib/pastel/color.rb:16
+ def enabled; end
+
+ # pkg:gem/pastel#lib/pastel/color.rb:17
+ def enabled?; end
+
+ # Compare colors for equality of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:225
+ def eql?(other); end
+
+ # Hash for this instance and its attributes
+ #
+ # @return [Numeric]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:254
+ def hash; end
+
+ # Inspect this instance attributes
+ #
+ # @return [String]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:245
+ def inspect; end
+
+ # Find the escape code for a given set of color attributes
+ #
+ # @example
+ # color.lookup(:red, :on_green) # => "\e[31;42m"
+ #
+ # @param [Array[Symbol]] colors
+ # the list of color name(s) to lookup
+ #
+ # @return [String]
+ # the ANSI code(s)
+ #
+ # @raise [InvalidAttributeNameError]
+ # exception raised for any invalid color name
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:136
+ def lookup(*colors); end
+
+ # Strip ANSI color codes from a string.
+ #
+ # Only ANSI color codes are removed, not movement codes or
+ # other escapes sequences are stripped.
+ #
+ # @param [Array[String]] strings
+ # a string or array of strings to sanitize
+ #
+ # @example
+ # strip("foo\e[1mbar\e[0m") # => "foobar"
+ #
+ # @return [String]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:103
+ def strip(*strings); end
+
+ # List all available style names
+ #
+ # @return [Array[Symbol]]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:175
+ def style_names; end
+
+ # Expose all ANSI color names and their codes
+ #
+ # @return [Hash[Symbol]]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:166
+ def styles; end
+
+ # Check if provided colors are known colors
+ #
+ # @param [Array[Symbol,String]]
+ # the list of colors to check
+ #
+ # @example
+ # valid?(:red) # => true
+ #
+ # @return [Boolean]
+ # true if all colors are valid, false otherwise
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:191
+ def valid?(*colors); end
+
+ private
+
+ # Check if value contains anything to style
+ #
+ # @return [Boolean]
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:265
+ def blank?(value); end
+
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color.rb:270
+ def validate(*colors); end
+end
+
+# All color aliases
+#
+# pkg:gem/pastel#lib/pastel/color.rb:11
+Pastel::Color::ALIASES = T.let(T.unsafe(nil), Hash)
+
+# Match all color escape sequences
+#
+# pkg:gem/pastel#lib/pastel/color.rb:14
+Pastel::Color::ANSI_COLOR_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# Responsible for parsing color symbols out of text with color escapes
+#
+# Used internally by {Color}.
+#
+# @api private
+#
+# pkg:gem/pastel#lib/pastel/color_parser.rb:13
+class Pastel::ColorParser
+ include ::Pastel::ANSI
+
+ class << self
+ # Decide attribute name for ansi
+ #
+ # @param [Integer] ansi
+ # the ansi escape code
+ #
+ # @return [Symbol]
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color_parser.rb:104
+ def attribute_name(ansi); end
+
+ # Convert ANSI code to color name
+ #
+ # @return [String]
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color_parser.rb:119
+ def color_name(ansi_code); end
+
+ # Parse color escape sequences into a list of hashes
+ # corresponding to the color attributes being set by these
+ # sequences
+ #
+ # @example
+ # parse("\e[32mfoo\e[0m")
+ # # => [{foreground: :green, text: "foo"}
+ #
+ # @param [String] text
+ # the text to parse for presence of color ansi codes
+ #
+ # @return [Array[Hash[Symbol,String]]]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color_parser.rb:33
+ def parse(text); end
+
+ # Remove from current stack all ansi codes
+ #
+ # @param [Array[Integer]] ansi_stack
+ # the stack with all the ansi codes
+ #
+ # @yield [Symbol, Symbol] attr, name
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color_parser.rb:90
+ def unpack_ansi(ansi_stack); end
+ end
+end
+
+# pkg:gem/pastel#lib/pastel/color_parser.rb:17
+Pastel::ColorParser::CSI = T.let(T.unsafe(nil), String)
+
+# pkg:gem/pastel#lib/pastel/color_parser.rb:16
+Pastel::ColorParser::ESC = T.let(T.unsafe(nil), String)
+
+# Contains logic for resolving styles applied to component
+#
+# Used internally by {Delegator}.
+#
+# @api private
+#
+# pkg:gem/pastel#lib/pastel/color_resolver.rb:11
+class Pastel::ColorResolver
+ # Initialize ColorResolver
+ #
+ # @param [Color] color
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color_resolver.rb:21
+ def initialize(color); end
+
+ # The color instance
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/color_resolver.rb:14
+ def color; end
+
+ # Resolve uncolored string
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/color_resolver.rb:28
+ def resolve(base, unprocessed_string); end
+end
+
+# Collects a list of decorators for styling a string
+#
+# @api private
+#
+# pkg:gem/pastel#lib/pastel/decorator_chain.rb:7
+class Pastel::DecoratorChain
+ include ::Enumerable
+
+ # Create a decorator chain
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:22
+ def initialize(decorators = T.unsafe(nil)); end
+
+ # Compare colors for equivalence of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:60
+ def ==(other); end
+
+ # Add decorator
+ #
+ # @param [String] decorator
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:31
+ def add(decorator); end
+
+ # Iterate over list of decorators
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:42
+ def each(&block); end
+
+ # Compare colors for equality of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:51
+ def eql?(other); end
+
+ # Hash for this instance and its attributes
+ #
+ # @return [Numeric]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:78
+ def hash; end
+
+ # Inspect this instance attributes
+ #
+ # @return [String]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:69
+ def inspect; end
+
+ protected
+
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:84
+ def decorators; end
+
+ class << self
+ # Create an empty decorator chain
+ #
+ # @return [DecoratorChain]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/decorator_chain.rb:15
+ def empty; end
+ end
+end
+
+# Wrapes the {DecoratorChain} to allow for easy resolution
+# of string coloring.
+#
+# @api private
+#
+# pkg:gem/pastel#lib/pastel/delegator.rb:13
+class Pastel::Delegator
+ extend ::Forwardable
+
+ # Create Delegator
+ #
+ # Used internally by {Pastel}
+ #
+ # @param [ColorResolver] resolver
+ #
+ # @param [DecoratorChain] chain
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:38
+ def initialize(resolver, chain); end
+
+ # Compare delegated objects for equivalence of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:57
+ def ==(other); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def alias_color(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def colored?(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def decorate(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def enabled?(*args, **_arg1, &block); end
+
+ # Compare delegated objects for equality of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:48
+ def eql?(other); end
+
+ # Hash for this instance and its attributes
+ #
+ # @return [Numeric]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:76
+ def hash; end
+
+ # Object string representation
+ #
+ # @return [String]
+ #
+ # @api
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:66
+ def inspect; end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def lookup(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:19
+ def parse(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def strip(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def styles(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:69
+ def to_s; end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:20
+ def undecorate(*args, **_arg1, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:16
+ def valid?(*args, **_arg1, &block); end
+
+ protected
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:82
+ def chain; end
+
+ # Evaluate color block
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:112
+ def evaluate_block(&block); end
+
+ # Handles color method calls
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:89
+ def method_missing(method_name, *args, &block); end
+
+ # pkg:gem/pastel#lib/pastel/delegator.rb:84
+ def resolver; end
+
+ private
+
+ # Check if color is valid
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:104
+ def respond_to_missing?(name, include_all = T.unsafe(nil)); end
+
+ class << self
+ # Wrap resolver and chain
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/delegator.rb:25
+ def wrap(resolver, chain = T.unsafe(nil)); end
+ end
+end
+
+# A class representing detached color
+#
+# pkg:gem/pastel#lib/pastel/detached.rb:5
+class Pastel::Detached
+ # Initialize a detached object
+ #
+ # @param [Pastel::Color] color
+ # the color instance
+ # @param [Array[Symbol]] styles
+ # the styles to be applied
+ #
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:14
+ def initialize(color, *styles); end
+
+ # Compare detached objects for equivalence of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:57
+ def ==(other); end
+
+ # pkg:gem/pastel#lib/pastel/detached.rb:36
+ def [](*args); end
+
+ # Decorate the values corresponding to styles
+ #
+ # @example
+ # Detached(Color.new, :red, :bold).call("hello")
+ # # => "\e[31mhello\e[0m"
+ #
+ # @param [String] value
+ # the stirng to decorate with styles
+ #
+ # @return [String]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:32
+ def call(*args); end
+
+ # Compare detached objects for equality of attributes
+ #
+ # @return [Boolean]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:48
+ def eql?(other); end
+
+ # Hash for this instance and its attributes
+ #
+ # @return [Numeric]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:75
+ def hash; end
+
+ # Inspect this instance attributes
+ #
+ # @return [String]
+ #
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:66
+ def inspect; end
+
+ # @api public
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:39
+ def to_proc; end
+
+ protected
+
+ # @api private
+ #
+ # pkg:gem/pastel#lib/pastel/detached.rb:82
+ def styles; end
+end
+
+# Raised when the color alias is not supported
+#
+# pkg:gem/pastel#lib/pastel.rb:16
+class Pastel::InvalidAliasNameError < ::ArgumentError; end
+
+# Raised when the style attribute is not supported
+#
+# pkg:gem/pastel#lib/pastel.rb:13
+class Pastel::InvalidAttributeNameError < ::ArgumentError; end
+
+# pkg:gem/pastel#lib/pastel/version.rb:4
+Pastel::VERSION = T.let(T.unsafe(nil), String)
diff --git a/sorbet/rbi/gems/prism@1.9.0.rbi b/sorbet/rbi/gems/prism@1.9.0.rbi
new file mode 100644
index 0000000..5a9940e
--- /dev/null
+++ b/sorbet/rbi/gems/prism@1.9.0.rbi
@@ -0,0 +1,42226 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `prism` gem.
+# Please instead update this file by running `bin/tapioca gem prism`.
+
+
+# typed: strict
+
+# =begin
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/rbi/prism/dsl.rbi.erb
+# if you are looking to modify the template
+# =end
+# =begin
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/rbi/prism/node.rbi.erb
+# if you are looking to modify the template
+# =end
+# =begin
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/rbi/prism/visitor.rbi.erb
+# if you are looking to modify the template
+# =end
+
+# We keep these shims in here because our client libraries might not have parser
+# in their bundle.
+module Parser; end
+
+class Parser::Base; end
+
+# pkg:gem/prism#lib/prism/translation/parser.rb:30
+class Parser::Diagnostic; end
+
+# The Prism Ruby parser.
+#
+# "Parsing Ruby is suddenly manageable!"
+# - You, hopefully
+#
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/compiler.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# :markup: markdown
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/dispatcher.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/dsl.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/inspect_visitor.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# :markup: markdown
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/mutation_compiler.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/node.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# --
+# Here we are reopening the prism module to provide methods on nodes that aren't
+# templated and are meant as convenience methods.
+# ++
+#
+# :markup: markdown
+# :markup: markdown
+# :markup: markdown
+# :markup: markdown
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/reflection.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+# :markup: markdown
+# :markup: markdown
+# :markup: markdown
+# :markup: markdown
+# :markup: markdown
+#
+# :markup: markdown
+# :markup: markdown
+# =begin
+# --
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/visitor.rb.erb
+# if you are looking to modify the template
+# ++
+# =end
+#
+# pkg:gem/prism#lib/prism.rb:9
+module Prism
+ class << self
+ # Mirror the Prism.dump API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def dump(*_arg0); end
+
+ # Mirror the Prism.dump_file API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def dump_file(*_arg0); end
+
+ # Mirror the Prism.lex API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def lex(*_arg0); end
+
+ # :call-seq:
+ # Prism::lex_compat(source, **options) -> LexCompat::Result
+ #
+ # Returns a parse result whose value is an array of tokens that closely
+ # resembles the return value of Ripper::lex.
+ #
+ # For supported options, see Prism::parse.
+ #
+ # pkg:gem/prism#lib/prism.rb:65
+ sig { params(source: String, options: T::Hash[Symbol, T.untyped]).returns(Prism::LexCompat::Result) }
+ def lex_compat(source, **options); end
+
+ # Mirror the Prism.lex_file API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def lex_file(*_arg0); end
+
+ # :call-seq:
+ # Prism::load(source, serialized, freeze) -> ParseResult
+ #
+ # Load the serialized AST using the source as a reference into a tree.
+ #
+ # pkg:gem/prism#lib/prism.rb:73
+ sig { params(source: String, serialized: String, freeze: T.nilable(T::Boolean)).returns(Prism::ParseResult) }
+ def load(source, serialized, freeze = false); end
+
+ # Mirror the Prism.parse API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse(*_arg0); end
+
+ # Mirror the Prism.parse_comments API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_comments(*_arg0); end
+
+ # Mirror the Prism.parse_failure? API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_failure?(*_arg0); end
+
+ # Mirror the Prism.parse_file API by using the serialization API. This uses
+ # native strings instead of Ruby strings because it allows us to use mmap
+ # when it is available.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_file(*_arg0); end
+
+ # Mirror the Prism.parse_file_comments API by using the serialization
+ # API. This uses native strings instead of Ruby strings because it allows us
+ # to use mmap when it is available.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_file_comments(*_arg0); end
+
+ # Mirror the Prism.parse_file_failure? API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_file_failure?(*_arg0); end
+
+ # Mirror the Prism.parse_file_success? API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_file_success?(*_arg0); end
+
+ # Mirror the Prism.parse_lex API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_lex(*_arg0); end
+
+ # Mirror the Prism.parse_lex_file API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_lex_file(*_arg0); end
+
+ # Mirror the Prism.parse_stream API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_stream(*_arg0); end
+
+ # Mirror the Prism.parse_success? API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse_success?(*_arg0); end
+
+ # Mirror the Prism.profile API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def profile(*_arg0); end
+
+ # Mirror the Prism.profile_file API by using the serialization API.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ def profile_file(*_arg0); end
+
+ # Create a new scope with the given locals and forwarding options that is
+ # suitable for passing into one of the Prism.* methods that accepts the
+ # `scopes` option.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:904
+ sig { params(locals: T::Array[Symbol], forwarding: T::Array[Symbol]).returns(Prism::Scope) }
+ def scope(locals: [], forwarding: []); end
+ end
+end
+
+# Specialized version of Prism::Source for source code that includes ASCII
+# characters only. This class is used to apply performance optimizations that
+# cannot be applied to sources that include multibyte characters.
+#
+# In the extremely rare case that a source includes multi-byte characters but
+# is marked as binary because of a magic encoding comment and it cannot be
+# eagerly converted to UTF-8, this class will be used as well. This is because
+# at that point we will treat everything as single-byte characters.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:250
+class Prism::ASCIISource < ::Prism::Source
+ # Return the column number in characters for the given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:257
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def character_column(byte_offset); end
+
+ # Return the character offset for the given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:252
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def character_offset(byte_offset); end
+
+ # Returns a cache that is the identity function in order to maintain the
+ # same interface. We can do this because code units are always equivalent to
+ # byte offsets for ASCII-only sources.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:274
+ sig do
+ params(
+ encoding: Encoding
+ ).returns(T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)))
+ end
+ def code_units_cache(encoding); end
+
+ # Specialized version of `code_units_column` that does not depend on
+ # `code_units_offset`, which is a more expensive operation. This is
+ # essentially the same as `Prism::Source#column`.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:281
+ sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
+ def code_units_column(byte_offset, encoding); end
+
+ # Returns the offset from the start of the file for the given byte offset
+ # counting in code units for the given encoding.
+ #
+ # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the
+ # concept of code units that differs from the number of characters in other
+ # encodings, it is not captured here.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:267
+ sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
+ def code_units_offset(byte_offset, encoding); end
+end
+
+# Represents the use of the `alias` keyword to alias a global variable.
+#
+# alias $foo $bar
+# ^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:334
+class Prism::AliasGlobalVariableNode < ::Prism::Node
+ # Initialize a new AliasGlobalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:336
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ new_name: T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode),
+ old_name: T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::SymbolNode, Prism::MissingNode),
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, new_name, old_name, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:437
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:347
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:352
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:370
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:365
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?new_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode, ?old_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | SymbolNode | MissingNode, ?keyword_loc: Location) -> AliasGlobalVariableNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:375
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ new_name: T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode),
+ old_name: T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::SymbolNode, Prism::MissingNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::AliasGlobalVariableNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, new_name: self.new_name, old_name: self.old_name, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:380
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, new_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode, old_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | SymbolNode | MissingNode, keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:383
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:357
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:421
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:416
+ sig { returns(String) }
+ def keyword; end
+
+ # The location of the `alias` keyword.
+ #
+ # alias $foo $bar
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:403
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # Represents the new name of the global variable that can be used after aliasing.
+ #
+ # alias $foo $bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:391
+ sig { returns(T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)) }
+ def new_name; end
+
+ # Represents the old name of the global variable that can be used before aliasing.
+ #
+ # alias $foo $bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:397
+ sig do
+ returns(T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::SymbolNode, Prism::MissingNode))
+ end
+ def old_name; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:411
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:426
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:431
+ def type; end
+ end
+end
+
+# Represents the use of the `alias` keyword to alias a method.
+#
+# alias foo bar
+# ^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:449
+class Prism::AliasMethodNode < ::Prism::Node
+ # Initialize a new AliasMethodNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:451
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ new_name: T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode),
+ old_name: T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode, Prism::GlobalVariableReadNode, Prism::MissingNode),
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, new_name, old_name, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:564
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:462
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:467
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:485
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:480
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?new_name: SymbolNode | InterpolatedSymbolNode, ?old_name: SymbolNode | InterpolatedSymbolNode | GlobalVariableReadNode | MissingNode, ?keyword_loc: Location) -> AliasMethodNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:490
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ new_name: T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode),
+ old_name: T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode, Prism::GlobalVariableReadNode, Prism::MissingNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::AliasMethodNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, new_name: self.new_name, old_name: self.old_name, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:495
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, new_name: SymbolNode | InterpolatedSymbolNode, old_name: SymbolNode | InterpolatedSymbolNode | GlobalVariableReadNode | MissingNode, keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:498
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:472
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:548
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:543
+ sig { returns(String) }
+ def keyword; end
+
+ # Represents the location of the `alias` keyword.
+ #
+ # alias foo bar
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:530
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # Represents the new name of the method that will be aliased.
+ #
+ # alias foo bar
+ # ^^^
+ #
+ # alias :foo :bar
+ # ^^^^
+ #
+ # alias :"#{foo}" :"#{bar}"
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:512
+ sig { returns(T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)) }
+ def new_name; end
+
+ # Represents the old name of the method that will be aliased.
+ #
+ # alias foo bar
+ # ^^^
+ #
+ # alias :foo :bar
+ # ^^^^
+ #
+ # alias :"#{foo}" :"#{bar}"
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:524
+ sig do
+ returns(T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode, Prism::GlobalVariableReadNode, Prism::MissingNode))
+ end
+ def old_name; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:538
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:553
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:558
+ def type; end
+ end
+end
+
+# Represents an alternation pattern in pattern matching.
+#
+# foo => bar | baz
+# ^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:576
+class Prism::AlternationPatternNode < ::Prism::Node
+ # Initialize a new AlternationPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:578
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, left, right, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:679
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:589
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:594
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:612
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:607
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> AlternationPatternNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:617
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::AlternationPatternNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:622
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:625
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:599
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:663
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the left side of the expression.
+ #
+ # foo => bar | baz
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:633
+ sig { returns(Prism::Node) }
+ def left; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:658
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the alternation operator location.
+ #
+ # foo => bar | baz
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:645
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents the right side of the expression.
+ #
+ # foo => bar | baz
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:639
+ sig { returns(Prism::Node) }
+ def right; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:653
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:668
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:673
+ def type; end
+ end
+end
+
+# Represents the use of the `&&` operator or the `and` keyword.
+#
+# left and right
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:691
+class Prism::AndNode < ::Prism::Node
+ # Initialize a new AndNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:693
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, left, right, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:800
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:704
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:709
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:727
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:722
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> AndNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:732
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::AndNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:737
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:740
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:714
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:784
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the left side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # left and right
+ # ^^^^
+ #
+ # 1 && 2
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:751
+ sig { returns(Prism::Node) }
+ def left; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:779
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `and` keyword or the `&&` operator.
+ #
+ # left and right
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:766
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents the right side of the expression.
+ #
+ # left && right
+ # ^^^^^
+ #
+ # 1 and 2
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:760
+ sig { returns(Prism::Node) }
+ def right; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:774
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:789
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:794
+ def type; end
+ end
+end
+
+# Represents a set of arguments to a method or a keyword.
+#
+# return foo, bar, baz
+# ^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:812
+class Prism::ArgumentsNode < ::Prism::Node
+ # Initialize a new ArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:814
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T::Array[Prism::Node]
+ ).void
+ end
+ def initialize(source, node_id, location, flags, arguments); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:910
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:823
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # The list of arguments, if present. These can be any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo(bar, baz)
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:891
+ sig { returns(T::Array[Prism::Node]) }
+ def arguments; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:828
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:845
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:840
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def contains_forwarding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:863
+ sig { returns(T::Boolean) }
+ def contains_forwarding?; end
+
+ # def contains_keyword_splat?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:873
+ sig { returns(T::Boolean) }
+ def contains_keyword_splat?; end
+
+ # def contains_keywords?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:868
+ sig { returns(T::Boolean) }
+ def contains_keywords?; end
+
+ # def contains_multiple_splats?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:883
+ sig { returns(T::Boolean) }
+ def contains_multiple_splats?; end
+
+ # def contains_splat?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:878
+ sig { returns(T::Boolean) }
+ def contains_splat?; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: Array[Prism::node]) -> ArgumentsNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:850
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T::Array[Prism::Node]
+ ).returns(Prism::ArgumentsNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, arguments: self.arguments); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:855
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: Array[Prism::node] }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:858
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:833
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:894
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:899
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:904
+ def type; end
+ end
+end
+
+# Flags for arguments nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19780
+module Prism::ArgumentsNodeFlags; end
+
+# if the arguments contain forwarding
+#
+# pkg:gem/prism#lib/prism/node.rb:19782
+Prism::ArgumentsNodeFlags::CONTAINS_FORWARDING = T.let(T.unsafe(nil), Integer)
+
+# if the arguments contain keywords
+#
+# pkg:gem/prism#lib/prism/node.rb:19785
+Prism::ArgumentsNodeFlags::CONTAINS_KEYWORDS = T.let(T.unsafe(nil), Integer)
+
+# if the arguments contain a keyword splat
+#
+# pkg:gem/prism#lib/prism/node.rb:19788
+Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT = T.let(T.unsafe(nil), Integer)
+
+# if the arguments contain multiple splats
+#
+# pkg:gem/prism#lib/prism/node.rb:19794
+Prism::ArgumentsNodeFlags::CONTAINS_MULTIPLE_SPLATS = T.let(T.unsafe(nil), Integer)
+
+# if the arguments contain a splat
+#
+# pkg:gem/prism#lib/prism/node.rb:19791
+Prism::ArgumentsNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
+
+# Represents an array literal. This can be a regular array using brackets or a special array using % like %w or %i.
+#
+# [1, 2, 3]
+# ^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:922
+class Prism::ArrayNode < ::Prism::Node
+ # Initialize a new ArrayNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:924
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ elements: T::Array[Prism::Node],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, elements, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1057
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:935
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:940
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1036
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # Represents the optional source location for the closing token.
+ #
+ # [1,2,3] # "]"
+ # %w[foo bar baz] # "]"
+ # %I(apple orange banana) # ")"
+ # foo = 1, 2, 3 # nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1012
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:957
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:952
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def contains_splat?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:975
+ sig { returns(T::Boolean) }
+ def contains_splat?; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:962
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ elements: T::Array[Prism::Node],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::ArrayNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:967
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[Prism::node], opening_loc: Location?, closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:970
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:945
+ def each_child_node; end
+
+ # Represent the list of zero or more [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression) within the array.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:980
+ sig { returns(T::Array[Prism::Node]) }
+ def elements; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1041
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1031
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # Represents the optional source location for the opening token.
+ #
+ # [1,2,3] # "["
+ # %w[foo bar baz] # "%w["
+ # %I(apple orange banana) # "%I("
+ # foo = 1, 2, 3 # nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:988
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1026
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1002
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1046
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1051
+ def type; end
+ end
+end
+
+# Flags for array nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19798
+module Prism::ArrayNodeFlags; end
+
+# if array contains splat nodes
+#
+# pkg:gem/prism#lib/prism/node.rb:19800
+Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
+
+# Represents an array pattern in pattern matching.
+#
+# foo in 1, 2
+# ^^^^^^^^^^^
+#
+# foo in [1, 2]
+# ^^^^^^^^^^^^^
+#
+# foo in *bar
+# ^^^^^^^^^^^
+#
+# foo in Bar[]
+# ^^^^^^^^^^^^
+#
+# foo in Bar[1, 2, 3]
+# ^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1083
+class Prism::ArrayPatternNode < ::Prism::Node
+ # Initialize a new ArrayPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1085
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ requireds: T::Array[Prism::Node],
+ rest: T.nilable(Prism::Node),
+ posts: T::Array[Prism::Node],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, constant, requireds, rest, posts, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1247
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1099
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1104
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1226
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # Represents the closing location of the array pattern.
+ #
+ # foo in [1, 2]
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1202
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1129
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1119
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Represents the optional constant preceding the Array
+ #
+ # foo in Bar[]
+ # ^^^
+ #
+ # foo in Bar[1, 2, 3]
+ # ^^^
+ #
+ # foo in Bar::Baz[1, 2, 3]
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1156
+ sig { returns(T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode))) }
+ def constant; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantPathNode | ConstantReadNode | nil, ?requireds: Array[Prism::node], ?rest: Prism::node?, ?posts: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayPatternNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1134
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ requireds: T::Array[Prism::Node],
+ rest: T.nilable(Prism::Node),
+ posts: T::Array[Prism::Node],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::ArrayPatternNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, constant: self.constant, requireds: self.requireds, rest: self.rest, posts: self.posts, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1139
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantPathNode | ConstantReadNode | nil, requireds: Array[Prism::node], rest: Prism::node?, posts: Array[Prism::node], opening_loc: Location?, closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1142
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1109
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1231
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1221
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # Represents the opening location of the array pattern.
+ #
+ # foo in [1, 2]
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1180
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Represents the elements after the rest element of the array pattern.
+ #
+ # foo in *bar, baz
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1174
+ sig { returns(T::Array[Prism::Node]) }
+ def posts; end
+
+ # Represents the required elements of the array pattern.
+ #
+ # foo in [1, 2]
+ # ^ ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1162
+ sig { returns(T::Array[Prism::Node]) }
+ def requireds; end
+
+ # Represents the rest element of the array pattern.
+ #
+ # foo in *bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1168
+ sig { returns(T.nilable(Prism::Node)) }
+ def rest; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1216
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1194
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1236
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1241
+ def type; end
+ end
+end
+
+# Represents a hash key/value pair.
+#
+# { a => b }
+# ^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1264
+class Prism::AssocNode < ::Prism::Node
+ # Initialize a new AssocNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1266
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ key: Prism::Node,
+ value: Prism::Node,
+ operator_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, key, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1382
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1277
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1282
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1300
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1295
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?key: Prism::node, ?value: Prism::node, ?operator_loc: Location?) -> AssocNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1305
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ key: Prism::Node,
+ value: Prism::Node,
+ operator_loc: T.nilable(Prism::Location)
+ ).returns(Prism::AssocNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, key: self.key, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1310
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, key: Prism::node, value: Prism::node, operator_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1313
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1287
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1366
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The key of the association. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # { a: b }
+ # ^
+ #
+ # { foo => bar }
+ # ^^^
+ #
+ # { def a; end => 1 }
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1327
+ sig { returns(Prism::Node) }
+ def key; end
+
+ # def operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1361
+ sig { returns(T.nilable(String)) }
+ def operator; end
+
+ # The location of the `=>` operator, if present.
+ #
+ # { foo => bar }
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1342
+ sig { returns(T.nilable(Prism::Location)) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1356
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1371
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value of the association, if present. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # { foo => bar }
+ # ^^^
+ #
+ # { x: 1 }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1336
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1376
+ def type; end
+ end
+end
+
+# Represents a splat in a hash literal.
+#
+# { **foo }
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1394
+class Prism::AssocSplatNode < ::Prism::Node
+ # Initialize a new AssocSplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1396
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1491
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1406
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1411
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1430
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1423
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node?, ?operator_loc: Location) -> AssocSplatNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1435
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::AssocSplatNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1440
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1443
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1416
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1475
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1470
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `**` operator.
+ #
+ # { **x }
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1457
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1465
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1480
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to be splatted, if present. Will be missing when keyword rest argument forwarding is used.
+ #
+ # { **foo }
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1451
+ sig { returns(T.nilable(Prism::Node)) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1485
+ def type; end
+ end
+end
+
+# pkg:gem/prism#lib/prism.rb:90
+Prism::BACKEND = T.let(T.unsafe(nil), Symbol)
+
+# Represents reading a reference to a field in the previous match.
+#
+# $'
+# ^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1502
+class Prism::BackReferenceReadNode < ::Prism::Node
+ # Initialize a new BackReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1504
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1575
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1513
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1518
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1534
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1529
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> BackReferenceReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1539
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::BackReferenceReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1544
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1547
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1523
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1559
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the back-reference variable, including the leading `$`.
+ #
+ # $& # name `:$&`
+ #
+ # $+ # name `:$+`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1556
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1564
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1569
+ def type; end
+ end
+end
+
+# A class that knows how to walk down the tree. None of the individual visit
+# methods are implemented on this visitor, so it forces the consumer to
+# implement each one that they need. For a default implementation that
+# continues walking the tree, see the Visitor class.
+#
+# pkg:gem/prism#lib/prism/visitor.rb:17
+class Prism::BasicVisitor
+ # Calls `accept` on the given node if it is not `nil`, which in turn should
+ # call back into this visitor by calling the appropriate `visit_*` method.
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:20
+ sig { params(node: T.nilable(Prism::Node)).void }
+ def visit(node); end
+
+ # Visits each node in `nodes` by calling `accept` on each one.
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:26
+ sig { params(nodes: T::Array[T.nilable(Prism::Node)]).void }
+ def visit_all(nodes); end
+
+ # Visits the child nodes of `node` by calling `accept` on each one.
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:32
+ sig { params(node: Prism::Node).void }
+ def visit_child_nodes(node); end
+end
+
+# Represents a begin statement.
+#
+# begin
+# foo
+# end
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1587
+class Prism::BeginNode < ::Prism::Node
+ # Initialize a new BeginNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1589
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ begin_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ rescue_clause: T.nilable(Prism::RescueNode),
+ else_clause: T.nilable(Prism::ElseNode),
+ ensure_clause: T.nilable(Prism::EnsureNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, begin_keyword_loc, statements, rescue_clause, else_clause, ensure_clause, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1745
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1603
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def begin_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1719
+ sig { returns(T.nilable(String)) }
+ def begin_keyword; end
+
+ # Represents the location of the `begin` keyword.
+ #
+ # begin x end
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1654
+ sig { returns(T.nilable(Prism::Location)) }
+ def begin_keyword_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1608
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1633
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1623
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?begin_keyword_loc: Location?, ?statements: StatementsNode?, ?rescue_clause: RescueNode?, ?else_clause: ElseNode?, ?ensure_clause: EnsureNode?, ?end_keyword_loc: Location?) -> BeginNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1638
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ begin_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ rescue_clause: T.nilable(Prism::RescueNode),
+ else_clause: T.nilable(Prism::ElseNode),
+ ensure_clause: T.nilable(Prism::EnsureNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::BeginNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, begin_keyword_loc: self.begin_keyword_loc, statements: self.statements, rescue_clause: self.rescue_clause, else_clause: self.else_clause, ensure_clause: self.ensure_clause, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1643
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, begin_keyword_loc: Location?, statements: StatementsNode?, rescue_clause: RescueNode?, else_clause: ElseNode?, ensure_clause: EnsureNode?, end_keyword_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1646
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1613
+ def each_child_node; end
+
+ # Represents the else clause within the begin block.
+ #
+ # begin x; rescue y; else z; end
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1688
+ sig { returns(T.nilable(Prism::ElseNode)) }
+ def else_clause; end
+
+ # def end_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1724
+ sig { returns(T.nilable(String)) }
+ def end_keyword; end
+
+ # Represents the location of the `end` keyword.
+ #
+ # begin x end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1700
+ sig { returns(T.nilable(Prism::Location)) }
+ def end_keyword_loc; end
+
+ # Represents the ensure clause within the begin block.
+ #
+ # begin x; ensure y; end
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1694
+ sig { returns(T.nilable(Prism::EnsureNode)) }
+ def ensure_clause; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1729
+ sig { override.returns(String) }
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:80
+ def newline_flag!(lines); end
+
+ # Represents the rescue clause within the begin block.
+ #
+ # begin x; rescue y; end
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1682
+ sig { returns(T.nilable(Prism::RescueNode)) }
+ def rescue_clause; end
+
+ # Save the begin_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1668
+ def save_begin_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1714
+ def save_end_keyword_loc(repository); end
+
+ # Represents the statements within the begin block.
+ #
+ # begin x end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1676
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1734
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1739
+ def type; end
+ end
+end
+
+# Represents a block argument using `&`.
+#
+# bar(&args)
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1760
+class Prism::BlockArgumentNode < ::Prism::Node
+ # Initialize a new BlockArgumentNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1762
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, expression, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1857
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1772
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1777
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1796
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1789
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node?, ?operator_loc: Location) -> BlockArgumentNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1801
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::BlockArgumentNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, expression: self.expression, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1806
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1809
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1782
+ def each_child_node; end
+
+ # The expression that is being passed as a block argument. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo(&args)
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1817
+ sig { returns(T.nilable(Prism::Node)) }
+ def expression; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1841
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1836
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the location of the `&` operator.
+ #
+ # foo(&args)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1823
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1831
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1846
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1851
+ def type; end
+ end
+end
+
+# Represents a block local variable.
+#
+# a { |; b| }
+# ^
+#
+# pkg:gem/prism#lib/prism/node.rb:1868
+class Prism::BlockLocalVariableNode < ::Prism::Node
+ # Initialize a new BlockLocalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1870
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1945
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1879
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1884
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1900
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1895
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> BlockLocalVariableNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1905
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::BlockLocalVariableNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1910
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1913
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1889
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1929
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the block local variable.
+ #
+ # a { |; b| } # name `:b`
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1926
+ sig { returns(Symbol) }
+ def name; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1918
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1934
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1939
+ def type; end
+ end
+end
+
+# Represents a block of ruby code.
+#
+# [1, 2, 3].each { |i| puts x }
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:1956
+class Prism::BlockNode < ::Prism::Node
+ # Initialize a new BlockNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1958
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ parameters: T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode)),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, locals, parameters, body, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2095
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1971
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # The body of the block.
+ #
+ # [1, 2, 3].each { |i| puts x }
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2034
+ sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1976
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2074
+ sig { returns(String) }
+ def closing; end
+
+ # Represents the location of the closing `}` or `end`.
+ #
+ # [1, 2, 3].each { |i| puts x }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2056
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1997
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1989
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, ?body: StatementsNode | BeginNode | nil, ?opening_loc: Location, ?closing_loc: Location) -> BlockNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2002
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ parameters: T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode)),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::BlockNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, parameters: self.parameters, body: self.body, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2007
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, body: StatementsNode | BeginNode | nil, opening_loc: Location, closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2010
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:1981
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2079
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The local variables declared in the block.
+ #
+ # [1, 2, 3].each { |i| puts x } # locals: [:i]
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2018
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2069
+ sig { returns(String) }
+ def opening; end
+
+ # Represents the location of the opening `{` or `do`.
+ #
+ # [1, 2, 3].each { |i| puts x }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2040
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # The parameters of the block.
+ #
+ # [1, 2, 3].each { |i| puts x }
+ # ^^^
+ # [1, 2, 3].each { puts _1 }
+ # ^^^^^^^^^^^
+ # [1, 2, 3].each { puts it }
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2028
+ sig { returns(T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode))) }
+ def parameters; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2064
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2048
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2084
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2089
+ def type; end
+ end
+end
+
+# Represents a block parameter of a method, block, or lambda definition.
+#
+# def a(&b)
+# ^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:2111
+class Prism::BlockParameterNode < ::Prism::Node
+ # Initialize a new BlockParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2113
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2235
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2124
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2129
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2145
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2140
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> BlockParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2150
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).returns(Prism::BlockParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2155
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2158
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2134
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2219
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the block parameter.
+ #
+ # def a(&b) # name `:b`
+ # ^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2172
+ sig { returns(T.nilable(Symbol)) }
+ def name; end
+
+ # Represents the location of the block parameter name.
+ #
+ # def a(&b)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2178
+ sig { returns(T.nilable(Prism::Location)) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2214
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the location of the `&` operator.
+ #
+ # def a(&b)
+ # ^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2201
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2163
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2192
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2209
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2224
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2229
+ def type; end
+ end
+end
+
+# Represents a block's parameters declaration.
+#
+# -> (a, b = 1; local) { }
+# ^^^^^^^^^^^^^^^^^
+#
+# foo do |a, b = 1; local|
+# ^^^^^^^^^^^^^^^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:2252
+class Prism::BlockParametersNode < ::Prism::Node
+ # Initialize a new BlockParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2254
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parameters: T.nilable(Prism::ParametersNode),
+ locals: T::Array[Prism::BlockLocalVariableNode],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, parameters, locals, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2408
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2266
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2271
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2387
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # Represents the closing location of the block parameters.
+ #
+ # -> (a, b = 1; local) { }
+ # ^
+ #
+ # foo do |a, b = 1; local|
+ # ^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2363
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2292
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2284
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parameters: ParametersNode?, ?locals: Array[BlockLocalVariableNode], ?opening_loc: Location?, ?closing_loc: Location?) -> BlockParametersNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2297
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parameters: T.nilable(Prism::ParametersNode),
+ locals: T::Array[Prism::BlockLocalVariableNode],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::BlockParametersNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, parameters: self.parameters, locals: self.locals, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2302
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parameters: ParametersNode?, locals: Array[BlockLocalVariableNode], opening_loc: Location?, closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2305
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2276
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2392
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the local variables of the block.
+ #
+ # -> (a, b = 1; local) { }
+ # ^^^^^
+ #
+ # foo do |a, b = 1; local|
+ # ^^^^^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2327
+ sig { returns(T::Array[Prism::BlockLocalVariableNode]) }
+ def locals; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2382
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # Represents the opening location of the block parameters.
+ #
+ # -> (a, b = 1; local) { }
+ # ^
+ #
+ # foo do |a, b = 1; local|
+ # ^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2337
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Represents the parameters of the block.
+ #
+ # -> (a, b = 1; local) { }
+ # ^^^^^^^^
+ #
+ # foo do |a, b = 1; local|
+ # ^^^^^^^^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2317
+ sig { returns(T.nilable(Prism::ParametersNode)) }
+ def parameters; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2377
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2351
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2397
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2402
+ def type; end
+ end
+end
+
+# Represents the use of the `break` keyword.
+#
+# break foo
+# ^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:2422
+class Prism::BreakNode < ::Prism::Node
+ # Initialize a new BreakNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2424
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, arguments, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2519
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2434
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # The arguments to the break statement, if present. These can be any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # break foo
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2479
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2439
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2458
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2451
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: ArgumentsNode?, ?keyword_loc: Location) -> BreakNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2463
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::BreakNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, arguments: self.arguments, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2468
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: ArgumentsNode?, keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2471
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2444
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2503
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2498
+ sig { returns(String) }
+ def keyword; end
+
+ # The location of the `break` keyword.
+ #
+ # break foo
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2485
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2493
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2508
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2513
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator on a call.
+#
+# foo.bar &&= value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:2530
+class Prism::CallAndWriteNode < ::Prism::Node
+ # Initialize a new CallAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2532
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2726
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2547
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2601
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2695
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # Represents the location of the call operator.
+ #
+ # foo.bar &&= value
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2620
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2552
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2573
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2565
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node) -> CallAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2578
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::CallAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, message_loc: self.message_loc, read_name: self.read_name, write_name: self.write_name, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2583
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2586
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2557
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2606
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2710
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def message: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2700
+ sig { returns(T.nilable(String)) }
+ def message; end
+
+ # Represents the location of the message.
+ #
+ # foo.bar &&= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2642
+ sig { returns(T.nilable(Prism::Location)) }
+ def message_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2705
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the location of the operator.
+ #
+ # foo.bar &&= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2676
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents the name of the method being called.
+ #
+ # foo.bar &&= value # read_name `:bar`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2664
+ sig { returns(Symbol) }
+ def read_name; end
+
+ # The object that the method is being called on. This can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo.bar &&= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2614
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2591
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2634
+ def save_call_operator_loc(repository); end
+
+ # Save the message_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2656
+ def save_message_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2684
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2715
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Represents the value being assigned.
+ #
+ # foo.bar &&= value
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2692
+ sig { returns(Prism::Node) }
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2596
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ # Represents the name of the method being written to.
+ #
+ # foo.bar &&= value # write_name `:bar=`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2670
+ sig { returns(Symbol) }
+ def write_name; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2720
+ def type; end
+ end
+end
+
+# Represents a method call, in all of the various forms that can take.
+#
+# foo
+# ^^^
+#
+# foo()
+# ^^^^^
+#
+# +foo
+# ^^^^
+#
+# foo + bar
+# ^^^^^^^^^
+#
+# foo.bar
+# ^^^^^^^
+#
+# foo&.bar
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:2758
+class Prism::CallNode < ::Prism::Node
+ # Initialize a new CallNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2760
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ name: Symbol,
+ message_loc: T.nilable(Prism::Location),
+ opening_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: T.nilable(Prism::Location),
+ equal_loc: T.nilable(Prism::Location),
+ block: T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, name, message_loc, opening_loc, arguments, closing_loc, equal_loc, block); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3029
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2777
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # Represents the arguments to the method call. These can be any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo(bar)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2932
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2833
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # Represents the block that is being passed to the method.
+ #
+ # foo { |a| a }
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2985
+ sig { returns(T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))) }
+ def block; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2988
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # Represents the location of the call operator.
+ #
+ # foo.bar
+ # ^
+ #
+ # foo&.bar
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2861
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2782
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3003
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # Represents the location of the right parenthesis.
+ #
+ # foo(bar)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2938
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2805
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2796
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?name: Symbol, ?message_loc: Location?, ?opening_loc: Location?, ?arguments: ArgumentsNode?, ?closing_loc: Location?, ?equal_loc: Location?, ?block: BlockNode | BlockArgumentNode | nil) -> CallNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2810
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ name: Symbol,
+ message_loc: T.nilable(Prism::Location),
+ opening_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: T.nilable(Prism::Location),
+ equal_loc: T.nilable(Prism::Location),
+ block: T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))
+ ).returns(Prism::CallNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, name: self.name, message_loc: self.message_loc, opening_loc: self.opening_loc, arguments: self.arguments, closing_loc: self.closing_loc, equal_loc: self.equal_loc, block: self.block); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2815
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, name: Symbol, message_loc: Location?, opening_loc: Location?, arguments: ArgumentsNode?, closing_loc: Location?, equal_loc: Location?, block: BlockNode | BlockArgumentNode | nil }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2818
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2787
+ def each_child_node; end
+
+ # def equal: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3008
+ sig { returns(T.nilable(String)) }
+ def equal; end
+
+ # Represents the location of the equal sign, in the case that this is an attribute write.
+ #
+ # foo.bar = value
+ # ^
+ #
+ # foo[bar] = value
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2963
+ sig { returns(T.nilable(Prism::Location)) }
+ def equal_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # When a call node has the attribute_write flag set, it means that the call
+ # is using the attribute write syntax. This is either a method call to []=
+ # or a method call to a method that ends with =. Either way, the = sign is
+ # present in the source.
+ #
+ # Prism returns the message_loc _without_ the = sign attached, because there
+ # can be any amount of space between the message and the = sign. However,
+ # sometimes you want the location of the full message including the inner
+ # space and the = sign. This method provides that.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:334
+ sig { returns(T.nilable(Prism::Location)) }
+ def full_message_loc; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2838
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3013
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def message: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2993
+ sig { returns(T.nilable(String)) }
+ def message; end
+
+ # Represents the location of the message.
+ #
+ # foo.bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2889
+ sig { returns(T.nilable(Prism::Location)) }
+ def message_loc; end
+
+ # Represents the name of the method being called.
+ #
+ # foo.bar # name `:foo`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2883
+ sig { returns(Symbol) }
+ def name; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2998
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # Represents the location of the left parenthesis.
+ # foo(bar)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2910
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # The object that the method is being called on. This can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo.bar
+ # ^^^
+ #
+ # +foo
+ # ^^^
+ #
+ # foo + bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2852
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2823
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2875
+ def save_call_operator_loc(repository); end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2952
+ def save_closing_loc(repository); end
+
+ # Save the equal_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2977
+ def save_equal_loc(repository); end
+
+ # Save the message_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2903
+ def save_message_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2924
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3018
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:2828
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3023
+ def type; end
+ end
+end
+
+# Flags for call nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19804
+module Prism::CallNodeFlags; end
+
+# a call that is an attribute write, so the value being written should be returned
+#
+# pkg:gem/prism#lib/prism/node.rb:19812
+Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer)
+
+# a call that ignores method visibility
+#
+# pkg:gem/prism#lib/prism/node.rb:19815
+Prism::CallNodeFlags::IGNORE_VISIBILITY = T.let(T.unsafe(nil), Integer)
+
+# &. operator
+#
+# pkg:gem/prism#lib/prism/node.rb:19806
+Prism::CallNodeFlags::SAFE_NAVIGATION = T.let(T.unsafe(nil), Integer)
+
+# a call that could have been a local variable
+#
+# pkg:gem/prism#lib/prism/node.rb:19809
+Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer)
+
+# Represents the use of an assignment operator on a call.
+#
+# foo.bar += baz
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:3048
+class Prism::CallOperatorWriteNode < ::Prism::Node
+ # Initialize a new CallOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3050
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ binary_operator: Symbol,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, message_loc, read_name, write_name, binary_operator, binary_operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3246
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3066
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3120
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # Represents the binary operator being used.
+ #
+ # foo.bar += value # binary_operator `:+`
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3195
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # Represents the location of the binary operator.
+ #
+ # foo.bar += value
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3201
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3220
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # Represents the location of the call operator.
+ #
+ # foo.bar += value
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3139
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3071
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3092
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3084
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node) -> CallOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3097
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ binary_operator: Symbol,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::CallOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, message_loc: self.message_loc, read_name: self.read_name, write_name: self.write_name, binary_operator: self.binary_operator, binary_operator_loc: self.binary_operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3102
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3105
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3076
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3125
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3230
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def message: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3225
+ sig { returns(T.nilable(String)) }
+ def message; end
+
+ # Represents the location of the message.
+ #
+ # foo.bar += value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3161
+ sig { returns(T.nilable(Prism::Location)) }
+ def message_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:342
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:349
+ def operator_loc; end
+
+ # Represents the name of the method being called.
+ #
+ # foo.bar += value # read_name `:bar`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3183
+ sig { returns(Symbol) }
+ def read_name; end
+
+ # The object that the method is being called on. This can be either `nil` or any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo.bar += value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3133
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3110
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3209
+ def save_binary_operator_loc(repository); end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3153
+ def save_call_operator_loc(repository); end
+
+ # Save the message_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3175
+ def save_message_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3235
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Represents the value being assigned.
+ #
+ # foo.bar += value
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3217
+ sig { returns(Prism::Node) }
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3115
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ # Represents the name of the method being written to.
+ #
+ # foo.bar += value # write_name `:bar=`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3189
+ sig { returns(Symbol) }
+ def write_name; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3240
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator on a call.
+#
+# foo.bar ||= value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:3264
+class Prism::CallOrWriteNode < ::Prism::Node
+ # Initialize a new CallOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3266
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3460
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3281
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3335
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3429
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # Represents the location of the call operator.
+ #
+ # foo.bar ||= value
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3354
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3286
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3307
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3299
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node) -> CallOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3312
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::CallOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, message_loc: self.message_loc, read_name: self.read_name, write_name: self.write_name, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3317
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3320
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3291
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3340
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3444
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def message: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3434
+ sig { returns(T.nilable(String)) }
+ def message; end
+
+ # Represents the location of the message.
+ #
+ # foo.bar ||= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3376
+ sig { returns(T.nilable(Prism::Location)) }
+ def message_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3439
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the location of the operator.
+ #
+ # foo.bar ||= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3410
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents the name of the method being called.
+ #
+ # foo.bar ||= value # read_name `:bar`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3398
+ sig { returns(Symbol) }
+ def read_name; end
+
+ # The object that the method is being called on. This can be either `nil` or any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo.bar ||= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3348
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3325
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3368
+ def save_call_operator_loc(repository); end
+
+ # Save the message_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3390
+ def save_message_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3418
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3449
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Represents the value being assigned.
+ #
+ # foo.bar ||= value
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3426
+ sig { returns(Prism::Node) }
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3330
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ # Represents the name of the method being written to.
+ #
+ # foo.bar ||= value # write_name `:bar=`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3404
+ sig { returns(Symbol) }
+ def write_name; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3454
+ def type; end
+ end
+end
+
+# Represents assigning to a method call.
+#
+# foo.bar, = 1
+# ^^^^^^^
+#
+# begin
+# rescue => foo.bar
+# ^^^^^^^
+# end
+#
+# for foo.bar in baz do end
+# ^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:3485
+class Prism::CallTargetNode < ::Prism::Node
+ # Initialize a new CallTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3487
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: Prism::Node,
+ call_operator_loc: Prism::Location,
+ name: Symbol,
+ message_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, name, message_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3629
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3499
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3549
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # def call_operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3603
+ sig { returns(String) }
+ def call_operator; end
+
+ # Represents the location of the call operator.
+ #
+ # foo.bar = 1
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3568
+ sig { returns(Prism::Location) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3504
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3521
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3516
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node, ?call_operator_loc: Location, ?name: Symbol, ?message_loc: Location) -> CallTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3526
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: Prism::Node,
+ call_operator_loc: Prism::Location,
+ name: Symbol,
+ message_loc: Prism::Location
+ ).returns(Prism::CallTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, name: self.name, message_loc: self.message_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3531
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node, call_operator_loc: Location, name: Symbol, message_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3534
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3509
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3554
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3613
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def message: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3608
+ sig { returns(String) }
+ def message; end
+
+ # Represents the location of the message.
+ #
+ # foo.bar = 1
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3590
+ sig { returns(Prism::Location) }
+ def message_loc; end
+
+ # Represents the name of the method being called.
+ #
+ # foo.bar = 1 # name `:foo`
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3584
+ sig { returns(Symbol) }
+ def name; end
+
+ # The object that the method is being called on. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo.bar = 1
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3562
+ sig { returns(Prism::Node) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3539
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3576
+ def save_call_operator_loc(repository); end
+
+ # Save the message_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3598
+ def save_message_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3618
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3544
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3623
+ def type; end
+ end
+end
+
+# Represents assigning to a local variable in pattern matching.
+#
+# foo => [bar => baz]
+# ^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:3643
+class Prism::CapturePatternNode < ::Prism::Node
+ # Initialize a new CapturePatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3645
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ target: Prism::LocalVariableTargetNode,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, value, target, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3746
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3656
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3661
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3679
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3674
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?target: LocalVariableTargetNode, ?operator_loc: Location) -> CapturePatternNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3684
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ target: Prism::LocalVariableTargetNode,
+ operator_loc: Prism::Location
+ ).returns(Prism::CapturePatternNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value, target: self.target, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3689
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, target: LocalVariableTargetNode, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3692
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3666
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3730
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3725
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the location of the `=>` operator.
+ #
+ # foo => bar
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3712
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3720
+ def save_operator_loc(repository); end
+
+ # Represents the target of the capture.
+ #
+ # foo => bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3706
+ sig { returns(Prism::LocalVariableTargetNode) }
+ def target; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3735
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Represents the value to capture.
+ #
+ # foo => bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3700
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3740
+ def type; end
+ end
+end
+
+# Represents the use of a case statement for pattern matching.
+#
+# case true
+# in false
+# end
+# ^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:3760
+class Prism::CaseMatchNode < ::Prism::Node
+ # Initialize a new CaseMatchNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3762
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ predicate: T.nilable(Prism::Node),
+ conditions: T::Array[Prism::InNode],
+ else_clause: T.nilable(Prism::ElseNode),
+ case_keyword_loc: Prism::Location,
+ end_keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, predicate, conditions, else_clause, case_keyword_loc, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3897
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3775
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def case_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3871
+ sig { returns(String) }
+ def case_keyword; end
+
+ # Represents the location of the `case` keyword.
+ #
+ # case true; in false; end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3842
+ sig { returns(Prism::Location) }
+ def case_keyword_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3780
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3803
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3794
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Represents the conditions of the case match.
+ #
+ # case true; in false; end
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3830
+ sig { returns(T::Array[Prism::InNode]) }
+ def conditions; end
+
+ # Returns the else clause of the case match node. This method is deprecated
+ # in favor of #else_clause.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:470
+ def consequent; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?predicate: Prism::node?, ?conditions: Array[InNode], ?else_clause: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location) -> CaseMatchNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3808
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ predicate: T.nilable(Prism::Node),
+ conditions: T::Array[Prism::InNode],
+ else_clause: T.nilable(Prism::ElseNode),
+ case_keyword_loc: Prism::Location,
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::CaseMatchNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, predicate: self.predicate, conditions: self.conditions, else_clause: self.else_clause, case_keyword_loc: self.case_keyword_loc, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3813
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, predicate: Prism::node?, conditions: Array[InNode], else_clause: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3816
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3785
+ def each_child_node; end
+
+ # Represents the else clause of the case match.
+ #
+ # case true; in false; else; end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3836
+ sig { returns(T.nilable(Prism::ElseNode)) }
+ def else_clause; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3876
+ sig { returns(String) }
+ def end_keyword; end
+
+ # Represents the location of the `end` keyword.
+ #
+ # case true; in false; end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3858
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3881
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the predicate of the case match. This can be either `nil` or any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # case true; in false; end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3824
+ sig { returns(T.nilable(Prism::Node)) }
+ def predicate; end
+
+ # Save the case_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3850
+ def save_case_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3866
+ def save_end_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3886
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3891
+ def type; end
+ end
+end
+
+# Represents the use of a case statement.
+#
+# case true
+# when false
+# end
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:3914
+class Prism::CaseNode < ::Prism::Node
+ # Initialize a new CaseNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3916
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ predicate: T.nilable(Prism::Node),
+ conditions: T::Array[Prism::WhenNode],
+ else_clause: T.nilable(Prism::ElseNode),
+ case_keyword_loc: Prism::Location,
+ end_keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, predicate, conditions, else_clause, case_keyword_loc, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4051
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3929
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def case_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4025
+ sig { returns(String) }
+ def case_keyword; end
+
+ # Represents the location of the `case` keyword.
+ #
+ # case true; when false; end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3996
+ sig { returns(Prism::Location) }
+ def case_keyword_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3934
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3957
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3948
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Represents the conditions of the case statement.
+ #
+ # case true; when false; end
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3984
+ sig { returns(T::Array[Prism::WhenNode]) }
+ def conditions; end
+
+ # Returns the else clause of the case node. This method is deprecated in
+ # favor of #else_clause.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:479
+ def consequent; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?predicate: Prism::node?, ?conditions: Array[WhenNode], ?else_clause: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location) -> CaseNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3962
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ predicate: T.nilable(Prism::Node),
+ conditions: T::Array[Prism::WhenNode],
+ else_clause: T.nilable(Prism::ElseNode),
+ case_keyword_loc: Prism::Location,
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::CaseNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, predicate: self.predicate, conditions: self.conditions, else_clause: self.else_clause, case_keyword_loc: self.case_keyword_loc, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3967
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, predicate: Prism::node?, conditions: Array[WhenNode], else_clause: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3970
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3939
+ def each_child_node; end
+
+ # Represents the else clause of the case statement.
+ #
+ # case true; when false; else; end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3990
+ sig { returns(T.nilable(Prism::ElseNode)) }
+ def else_clause; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4030
+ sig { returns(String) }
+ def end_keyword; end
+
+ # Represents the location of the `end` keyword.
+ #
+ # case true; when false; end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4012
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4035
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the predicate of the case statement. This can be either `nil` or any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # case true; when false; end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:3978
+ sig { returns(T.nilable(Prism::Node)) }
+ def predicate; end
+
+ # Save the case_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4004
+ def save_case_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4020
+ def save_end_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4040
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4045
+ def type; end
+ end
+end
+
+# Represents a class declaration involving the `class` keyword.
+#
+# class Foo end
+# ^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4066
+class Prism::ClassNode < ::Prism::Node
+ # Initialize a new ClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4068
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ class_keyword_loc: Prism::Location,
+ constant_path: T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::CallNode),
+ inheritance_operator_loc: T.nilable(Prism::Location),
+ superclass: T.nilable(Prism::Node),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location,
+ name: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4239
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4084
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # Represents the body of the class.
+ #
+ # class Foo
+ # foo
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4184
+ sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4089
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def class_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4208
+ sig { returns(String) }
+ def class_keyword; end
+
+ # Represents the location of the `class` keyword.
+ #
+ # class Foo end
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4136
+ sig { returns(Prism::Location) }
+ def class_keyword_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4112
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4103
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # attr_reader constant_path: ConstantReadNode | ConstantPathNode | CallNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4149
+ sig { returns(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::CallNode)) }
+ def constant_path; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?class_keyword_loc: Location, ?constant_path: ConstantReadNode | ConstantPathNode | CallNode, ?inheritance_operator_loc: Location?, ?superclass: Prism::node?, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location, ?name: Symbol) -> ClassNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4117
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ class_keyword_loc: Prism::Location,
+ constant_path: T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::CallNode),
+ inheritance_operator_loc: T.nilable(Prism::Location),
+ superclass: T.nilable(Prism::Node),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location,
+ name: Symbol
+ ).returns(Prism::ClassNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, class_keyword_loc: self.class_keyword_loc, constant_path: self.constant_path, inheritance_operator_loc: self.inheritance_operator_loc, superclass: self.superclass, body: self.body, end_keyword_loc: self.end_keyword_loc, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4122
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], class_keyword_loc: Location, constant_path: ConstantReadNode | ConstantPathNode | CallNode, inheritance_operator_loc: Location?, superclass: Prism::node?, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4125
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4094
+ def each_child_node; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4218
+ sig { returns(String) }
+ def end_keyword; end
+
+ # Represents the location of the `end` keyword.
+ #
+ # class Foo end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4190
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inheritance_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4213
+ sig { returns(T.nilable(String)) }
+ def inheritance_operator; end
+
+ # Represents the location of the `<` operator.
+ #
+ # class Foo < Bar
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4155
+ sig { returns(T.nilable(Prism::Location)) }
+ def inheritance_operator_loc; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4223
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4130
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # The name of the class.
+ #
+ # class Foo end # name `:Foo`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4205
+ sig { returns(Symbol) }
+ def name; end
+
+ # Save the class_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4144
+ def save_class_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4198
+ def save_end_keyword_loc(repository); end
+
+ # Save the inheritance_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4169
+ def save_inheritance_operator_loc(repository); end
+
+ # Represents the superclass of the class.
+ #
+ # class Foo < Bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4177
+ sig { returns(T.nilable(Prism::Node)) }
+ def superclass; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4228
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4233
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator for assignment to a class variable.
+#
+# @@target &&= value
+# ^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4257
+class Prism::ClassVariableAndWriteNode < ::Prism::Node
+ # Initialize a new ClassVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4259
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4376
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4271
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4276
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4293
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4288
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ClassVariableAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4298
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ClassVariableAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4303
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4306
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:165
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4281
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4360
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # @@target &&= value # name `:@@target`
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4314
+ sig { returns(Symbol) }
+ def name; end
+
+ # Represents the location of the variable name.
+ #
+ # @@target &&= value
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4320
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4355
+ sig { returns(String) }
+ def operator; end
+
+ # Represents the location of the `&&=` operator.
+ #
+ # @@target &&= value
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4336
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4328
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4344
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4365
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Represents the value being assigned. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # @@target &&= value
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4352
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4370
+ def type; end
+ end
+end
+
+# Represents assigning to a class variable using an operator that isn't `=`.
+#
+# @@target += value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4389
+class Prism::ClassVariableOperatorWriteNode < ::Prism::Node
+ # Initialize a new ClassVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4391
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, binary_operator_loc, value, binary_operator); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4495
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4404
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4476
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4460
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4409
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4426
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4421
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ClassVariableOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4431
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::ClassVariableOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, binary_operator: self.binary_operator); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4436
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4439
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:177
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4414
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4479
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4444
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4447
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:358
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:365
+ def operator_loc; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4468
+ def save_binary_operator_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4455
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4484
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4473
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4489
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a class variable.
+#
+# @@target ||= value
+# ^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4509
+class Prism::ClassVariableOrWriteNode < ::Prism::Node
+ # Initialize a new ClassVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4511
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4616
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4523
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4528
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4545
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4540
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ClassVariableOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4550
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ClassVariableOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4555
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4558
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:171
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4533
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4600
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4563
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4566
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4595
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4579
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4574
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4587
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4605
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4592
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4610
+ def type; end
+ end
+end
+
+# Represents referencing a class variable.
+#
+# @@foo
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4629
+class Prism::ClassVariableReadNode < ::Prism::Node
+ # Initialize a new ClassVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4631
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4702
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4640
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4645
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4661
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4656
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ClassVariableReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4666
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ClassVariableReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4671
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4674
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4650
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4686
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # @@abc # name `:@@abc`
+ #
+ # @@_test # name `:@@_test`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4683
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4691
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4696
+ def type; end
+ end
+end
+
+# Represents writing to a class variable in a context that doesn't have an explicit value.
+#
+# @@foo, @@bar = baz
+# ^^^^^ ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4712
+class Prism::ClassVariableTargetNode < ::Prism::Node
+ # Initialize a new ClassVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4714
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4781
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4723
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4728
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4744
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4739
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ClassVariableTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4749
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ClassVariableTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4754
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4757
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4733
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4765
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4762
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4770
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4775
+ def type; end
+ end
+end
+
+# Represents writing to a class variable.
+#
+# @@foo = 1
+# ^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4791
+class Prism::ClassVariableWriteNode < ::Prism::Node
+ # Initialize a new ClassVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4793
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4914
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4805
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4810
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4827
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4822
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> ClassVariableWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4832
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::ClassVariableWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4837
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4840
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4815
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4898
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # @@abc = 123 # name `@@abc`
+ #
+ # @@_test = :test # name `@@_test`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4849
+ sig { returns(Symbol) }
+ def name; end
+
+ # The location of the variable name.
+ #
+ # @@foo = :bar
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4855
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4893
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `=` operator.
+ #
+ # @@foo = :bar
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4880
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4863
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4888
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4903
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the class variable. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # @@foo = :bar
+ # ^^^^
+ #
+ # @@_xyz = 123
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4874
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4908
+ def type; end
+ end
+end
+
+# A cache that can be used to quickly compute code unit offsets from byte
+# offsets. It purposefully provides only a single #[] method to access the
+# cache in order to minimize surface area.
+#
+# Note that there are some known issues here that may or may not be addressed
+# in the future:
+#
+# * The first is that there are issues when the cache computes values that are
+# not on character boundaries. This can result in subsequent computations
+# being off by one or more code units.
+# * The second is that this cache is currently unbounded. In theory we could
+# introduce some kind of LRU cache to limit the number of entries, but this
+# has not yet been implemented.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:186
+class Prism::CodeUnitsCache
+ # Initialize a new cache with the given source and encoding.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:212
+ sig { params(source: String, encoding: Encoding).void }
+ def initialize(source, encoding); end
+
+ # Retrieve the code units offset from the given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:226
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def [](byte_offset); end
+end
+
+# pkg:gem/prism#lib/prism/parse_result.rb:198
+class Prism::CodeUnitsCache::LengthCounter
+ # pkg:gem/prism#lib/prism/parse_result.rb:199
+ def initialize(source, encoding); end
+
+ # pkg:gem/prism#lib/prism/parse_result.rb:204
+ def count(byte_offset, byte_length); end
+end
+
+# pkg:gem/prism#lib/prism/parse_result.rb:187
+class Prism::CodeUnitsCache::UTF16Counter
+ # pkg:gem/prism#lib/prism/parse_result.rb:188
+ def initialize(source, encoding); end
+
+ # pkg:gem/prism#lib/prism/parse_result.rb:193
+ def count(byte_offset, byte_length); end
+end
+
+# This represents a comment that was encountered during parsing. It is the
+# base class for all comment types.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:521
+class Prism::Comment
+ abstract!
+
+ # Create a new comment object with the given location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:526
+ sig { params(location: Prism::Location).void }
+ def initialize(location); end
+
+ # Implement the hash pattern matching interface for Comment.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:531
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # The location of this comment in the source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:523
+ sig { returns(Prism::Location) }
+ def location; end
+
+ # Returns the content of the comment by slicing it from the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:536
+ sig { returns(String) }
+ def slice; end
+
+ sig { abstract.returns(T::Boolean) }
+ def trailing?; end
+end
+
+# A compiler is a visitor that returns the value of each node as it visits.
+# This is as opposed to a visitor which will only walk the tree. This can be
+# useful when you are trying to compile a tree into a different format.
+#
+# For example, to build a representation of the tree as s-expressions, you
+# could write:
+#
+# class SExpressions < Prism::Compiler
+# def visit_arguments_node(node) = [:arguments, super]
+# def visit_call_node(node) = [:call, super]
+# def visit_integer_node(node) = [:integer]
+# def visit_program_node(node) = [:program, super]
+# end
+#
+# Prism.parse("1 + 2").value.accept(SExpressions.new)
+# # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]]
+#
+# pkg:gem/prism#lib/prism/compiler.rb:30
+class Prism::Compiler < ::Prism::Visitor
+ # Visit an individual node.
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:32
+ sig { params(node: T.nilable(Prism::Node)).returns(T.untyped) }
+ def visit(node); end
+
+ # Compile a AliasGlobalVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:47
+ def visit_alias_global_variable_node(node); end
+
+ # Compile a AliasMethodNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:52
+ def visit_alias_method_node(node); end
+
+ # Visit a list of nodes.
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:37
+ sig { params(nodes: T::Array[T.nilable(Prism::Node)]).returns(T::Array[T.untyped]) }
+ def visit_all(nodes); end
+
+ # Compile a AlternationPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:57
+ def visit_alternation_pattern_node(node); end
+
+ # Compile a AndNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:62
+ def visit_and_node(node); end
+
+ # Compile a ArgumentsNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:67
+ def visit_arguments_node(node); end
+
+ # Compile a ArrayNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:72
+ def visit_array_node(node); end
+
+ # Compile a ArrayPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:77
+ def visit_array_pattern_node(node); end
+
+ # Compile a AssocNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:82
+ def visit_assoc_node(node); end
+
+ # Compile a AssocSplatNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:87
+ def visit_assoc_splat_node(node); end
+
+ # Compile a BackReferenceReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:92
+ def visit_back_reference_read_node(node); end
+
+ # Compile a BeginNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:97
+ def visit_begin_node(node); end
+
+ # Compile a BlockArgumentNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:102
+ def visit_block_argument_node(node); end
+
+ # Compile a BlockLocalVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:107
+ def visit_block_local_variable_node(node); end
+
+ # Compile a BlockNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:112
+ def visit_block_node(node); end
+
+ # Compile a BlockParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:117
+ def visit_block_parameter_node(node); end
+
+ # Compile a BlockParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:122
+ def visit_block_parameters_node(node); end
+
+ # Compile a BreakNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:127
+ def visit_break_node(node); end
+
+ # Compile a CallAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:132
+ def visit_call_and_write_node(node); end
+
+ # Compile a CallNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:137
+ def visit_call_node(node); end
+
+ # Compile a CallOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:142
+ def visit_call_operator_write_node(node); end
+
+ # Compile a CallOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:147
+ def visit_call_or_write_node(node); end
+
+ # Compile a CallTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:152
+ def visit_call_target_node(node); end
+
+ # Compile a CapturePatternNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:157
+ def visit_capture_pattern_node(node); end
+
+ # Compile a CaseMatchNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:162
+ def visit_case_match_node(node); end
+
+ # Compile a CaseNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:167
+ def visit_case_node(node); end
+
+ # Visit the child nodes of the given node.
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:42
+ sig { params(node: Prism::Node).returns(T::Array[T.untyped]) }
+ def visit_child_nodes(node); end
+
+ # Compile a ClassNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:172
+ def visit_class_node(node); end
+
+ # Compile a ClassVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:177
+ def visit_class_variable_and_write_node(node); end
+
+ # Compile a ClassVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:182
+ def visit_class_variable_operator_write_node(node); end
+
+ # Compile a ClassVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:187
+ def visit_class_variable_or_write_node(node); end
+
+ # Compile a ClassVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:192
+ def visit_class_variable_read_node(node); end
+
+ # Compile a ClassVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:197
+ def visit_class_variable_target_node(node); end
+
+ # Compile a ClassVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:202
+ def visit_class_variable_write_node(node); end
+
+ # Compile a ConstantAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:207
+ def visit_constant_and_write_node(node); end
+
+ # Compile a ConstantOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:212
+ def visit_constant_operator_write_node(node); end
+
+ # Compile a ConstantOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:217
+ def visit_constant_or_write_node(node); end
+
+ # Compile a ConstantPathAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:222
+ def visit_constant_path_and_write_node(node); end
+
+ # Compile a ConstantPathNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:227
+ def visit_constant_path_node(node); end
+
+ # Compile a ConstantPathOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:232
+ def visit_constant_path_operator_write_node(node); end
+
+ # Compile a ConstantPathOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:237
+ def visit_constant_path_or_write_node(node); end
+
+ # Compile a ConstantPathTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:242
+ def visit_constant_path_target_node(node); end
+
+ # Compile a ConstantPathWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:247
+ def visit_constant_path_write_node(node); end
+
+ # Compile a ConstantReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:252
+ def visit_constant_read_node(node); end
+
+ # Compile a ConstantTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:257
+ def visit_constant_target_node(node); end
+
+ # Compile a ConstantWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:262
+ def visit_constant_write_node(node); end
+
+ # Compile a DefNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:267
+ def visit_def_node(node); end
+
+ # Compile a DefinedNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:272
+ def visit_defined_node(node); end
+
+ # Compile a ElseNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:277
+ def visit_else_node(node); end
+
+ # Compile a EmbeddedStatementsNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:282
+ def visit_embedded_statements_node(node); end
+
+ # Compile a EmbeddedVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:287
+ def visit_embedded_variable_node(node); end
+
+ # Compile a EnsureNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:292
+ def visit_ensure_node(node); end
+
+ # Compile a FalseNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:297
+ def visit_false_node(node); end
+
+ # Compile a FindPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:302
+ def visit_find_pattern_node(node); end
+
+ # Compile a FlipFlopNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:307
+ def visit_flip_flop_node(node); end
+
+ # Compile a FloatNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:312
+ def visit_float_node(node); end
+
+ # Compile a ForNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:317
+ def visit_for_node(node); end
+
+ # Compile a ForwardingArgumentsNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:322
+ def visit_forwarding_arguments_node(node); end
+
+ # Compile a ForwardingParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:327
+ def visit_forwarding_parameter_node(node); end
+
+ # Compile a ForwardingSuperNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:332
+ def visit_forwarding_super_node(node); end
+
+ # Compile a GlobalVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:337
+ def visit_global_variable_and_write_node(node); end
+
+ # Compile a GlobalVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:342
+ def visit_global_variable_operator_write_node(node); end
+
+ # Compile a GlobalVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:347
+ def visit_global_variable_or_write_node(node); end
+
+ # Compile a GlobalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:352
+ def visit_global_variable_read_node(node); end
+
+ # Compile a GlobalVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:357
+ def visit_global_variable_target_node(node); end
+
+ # Compile a GlobalVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:362
+ def visit_global_variable_write_node(node); end
+
+ # Compile a HashNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:367
+ def visit_hash_node(node); end
+
+ # Compile a HashPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:372
+ def visit_hash_pattern_node(node); end
+
+ # Compile a IfNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:377
+ def visit_if_node(node); end
+
+ # Compile a ImaginaryNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:382
+ def visit_imaginary_node(node); end
+
+ # Compile a ImplicitNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:387
+ def visit_implicit_node(node); end
+
+ # Compile a ImplicitRestNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:392
+ def visit_implicit_rest_node(node); end
+
+ # Compile a InNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:397
+ def visit_in_node(node); end
+
+ # Compile a IndexAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:402
+ def visit_index_and_write_node(node); end
+
+ # Compile a IndexOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:407
+ def visit_index_operator_write_node(node); end
+
+ # Compile a IndexOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:412
+ def visit_index_or_write_node(node); end
+
+ # Compile a IndexTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:417
+ def visit_index_target_node(node); end
+
+ # Compile a InstanceVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:422
+ def visit_instance_variable_and_write_node(node); end
+
+ # Compile a InstanceVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:427
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Compile a InstanceVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:432
+ def visit_instance_variable_or_write_node(node); end
+
+ # Compile a InstanceVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:437
+ def visit_instance_variable_read_node(node); end
+
+ # Compile a InstanceVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:442
+ def visit_instance_variable_target_node(node); end
+
+ # Compile a InstanceVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:447
+ def visit_instance_variable_write_node(node); end
+
+ # Compile a IntegerNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:452
+ def visit_integer_node(node); end
+
+ # Compile a InterpolatedMatchLastLineNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:457
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Compile a InterpolatedRegularExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:462
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Compile a InterpolatedStringNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:467
+ def visit_interpolated_string_node(node); end
+
+ # Compile a InterpolatedSymbolNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:472
+ def visit_interpolated_symbol_node(node); end
+
+ # Compile a InterpolatedXStringNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:477
+ def visit_interpolated_x_string_node(node); end
+
+ # Compile a ItLocalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:482
+ def visit_it_local_variable_read_node(node); end
+
+ # Compile a ItParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:487
+ def visit_it_parameters_node(node); end
+
+ # Compile a KeywordHashNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:492
+ def visit_keyword_hash_node(node); end
+
+ # Compile a KeywordRestParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:497
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Compile a LambdaNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:502
+ def visit_lambda_node(node); end
+
+ # Compile a LocalVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:507
+ def visit_local_variable_and_write_node(node); end
+
+ # Compile a LocalVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:512
+ def visit_local_variable_operator_write_node(node); end
+
+ # Compile a LocalVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:517
+ def visit_local_variable_or_write_node(node); end
+
+ # Compile a LocalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:522
+ def visit_local_variable_read_node(node); end
+
+ # Compile a LocalVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:527
+ def visit_local_variable_target_node(node); end
+
+ # Compile a LocalVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:532
+ def visit_local_variable_write_node(node); end
+
+ # Compile a MatchLastLineNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:537
+ def visit_match_last_line_node(node); end
+
+ # Compile a MatchPredicateNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:542
+ def visit_match_predicate_node(node); end
+
+ # Compile a MatchRequiredNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:547
+ def visit_match_required_node(node); end
+
+ # Compile a MatchWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:552
+ def visit_match_write_node(node); end
+
+ # Compile a MissingNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:557
+ def visit_missing_node(node); end
+
+ # Compile a ModuleNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:562
+ def visit_module_node(node); end
+
+ # Compile a MultiTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:567
+ def visit_multi_target_node(node); end
+
+ # Compile a MultiWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:572
+ def visit_multi_write_node(node); end
+
+ # Compile a NextNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:577
+ def visit_next_node(node); end
+
+ # Compile a NilNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:582
+ def visit_nil_node(node); end
+
+ # Compile a NoKeywordsParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:587
+ def visit_no_keywords_parameter_node(node); end
+
+ # Compile a NumberedParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:592
+ def visit_numbered_parameters_node(node); end
+
+ # Compile a NumberedReferenceReadNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:597
+ def visit_numbered_reference_read_node(node); end
+
+ # Compile a OptionalKeywordParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:602
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Compile a OptionalParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:607
+ def visit_optional_parameter_node(node); end
+
+ # Compile a OrNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:612
+ def visit_or_node(node); end
+
+ # Compile a ParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:617
+ def visit_parameters_node(node); end
+
+ # Compile a ParenthesesNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:622
+ def visit_parentheses_node(node); end
+
+ # Compile a PinnedExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:627
+ def visit_pinned_expression_node(node); end
+
+ # Compile a PinnedVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:632
+ def visit_pinned_variable_node(node); end
+
+ # Compile a PostExecutionNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:637
+ def visit_post_execution_node(node); end
+
+ # Compile a PreExecutionNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:642
+ def visit_pre_execution_node(node); end
+
+ # Compile a ProgramNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:647
+ def visit_program_node(node); end
+
+ # Compile a RangeNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:652
+ def visit_range_node(node); end
+
+ # Compile a RationalNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:657
+ def visit_rational_node(node); end
+
+ # Compile a RedoNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:662
+ def visit_redo_node(node); end
+
+ # Compile a RegularExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:667
+ def visit_regular_expression_node(node); end
+
+ # Compile a RequiredKeywordParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:672
+ def visit_required_keyword_parameter_node(node); end
+
+ # Compile a RequiredParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:677
+ def visit_required_parameter_node(node); end
+
+ # Compile a RescueModifierNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:682
+ def visit_rescue_modifier_node(node); end
+
+ # Compile a RescueNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:687
+ def visit_rescue_node(node); end
+
+ # Compile a RestParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:692
+ def visit_rest_parameter_node(node); end
+
+ # Compile a RetryNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:697
+ def visit_retry_node(node); end
+
+ # Compile a ReturnNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:702
+ def visit_return_node(node); end
+
+ # Compile a SelfNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:707
+ def visit_self_node(node); end
+
+ # Compile a ShareableConstantNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:712
+ def visit_shareable_constant_node(node); end
+
+ # Compile a SingletonClassNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:717
+ def visit_singleton_class_node(node); end
+
+ # Compile a SourceEncodingNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:722
+ def visit_source_encoding_node(node); end
+
+ # Compile a SourceFileNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:727
+ def visit_source_file_node(node); end
+
+ # Compile a SourceLineNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:732
+ def visit_source_line_node(node); end
+
+ # Compile a SplatNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:737
+ def visit_splat_node(node); end
+
+ # Compile a StatementsNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:742
+ def visit_statements_node(node); end
+
+ # Compile a StringNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:747
+ def visit_string_node(node); end
+
+ # Compile a SuperNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:752
+ def visit_super_node(node); end
+
+ # Compile a SymbolNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:757
+ def visit_symbol_node(node); end
+
+ # Compile a TrueNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:762
+ def visit_true_node(node); end
+
+ # Compile a UndefNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:767
+ def visit_undef_node(node); end
+
+ # Compile a UnlessNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:772
+ def visit_unless_node(node); end
+
+ # Compile a UntilNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:777
+ def visit_until_node(node); end
+
+ # Compile a WhenNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:782
+ def visit_when_node(node); end
+
+ # Compile a WhileNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:787
+ def visit_while_node(node); end
+
+ # Compile a XStringNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:792
+ def visit_x_string_node(node); end
+
+ # Compile a YieldNode node
+ #
+ # pkg:gem/prism#lib/prism/compiler.rb:797
+ def visit_yield_node(node); end
+end
+
+# Represents the use of the `&&=` operator for assignment to a constant.
+#
+# Target &&= value
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:4927
+class Prism::ConstantAndWriteNode < ::Prism::Node
+ # Initialize a new ConstantAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4929
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5034
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4941
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4946
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4963
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4958
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ConstantAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4968
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4973
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4976
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:183
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4951
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5018
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4981
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4984
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5013
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4997
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:4992
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5005
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5023
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5010
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5028
+ def type; end
+ end
+end
+
+# Represents assigning to a constant using an operator that isn't `=`.
+#
+# Target += value
+# ^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5047
+class Prism::ConstantOperatorWriteNode < ::Prism::Node
+ # Initialize a new ConstantOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5049
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, binary_operator_loc, value, binary_operator); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5153
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5062
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5134
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5118
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5067
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5084
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5079
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ConstantOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5089
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::ConstantOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, binary_operator: self.binary_operator); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5094
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5097
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:195
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5072
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5137
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5102
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5105
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:374
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:381
+ def operator_loc; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5126
+ def save_binary_operator_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5113
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5142
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5131
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5147
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a constant.
+#
+# Target ||= value
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5167
+class Prism::ConstantOrWriteNode < ::Prism::Node
+ # Initialize a new ConstantOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5169
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5274
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5181
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5186
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5203
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5198
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ConstantOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5208
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5213
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5216
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:189
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5191
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5258
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5221
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5224
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5253
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5237
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5232
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5245
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5263
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5250
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5268
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator for assignment to a constant path.
+#
+# Parent::Child &&= value
+# ^^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5287
+class Prism::ConstantPathAndWriteNode < ::Prism::Node
+ # Initialize a new ConstantPathAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5289
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, target, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5381
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5300
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5305
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5323
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5318
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5328
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantPathAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, target: self.target, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5333
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5336
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5310
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5365
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5360
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5344
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5352
+ def save_operator_loc(repository); end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5341
+ sig { returns(Prism::ConstantPathNode) }
+ def target; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5370
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5357
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5375
+ def type; end
+ end
+end
+
+# Represents accessing a constant through a path of `::` operators.
+#
+# Foo::Bar
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5393
+class Prism::ConstantPathNode < ::Prism::Node
+ # Initialize a new ConstantPathNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5395
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parent: T.nilable(Prism::Node),
+ name: T.nilable(Symbol),
+ delimiter_loc: Prism::Location,
+ name_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, parent, name, delimiter_loc, name_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5523
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5407
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # Previously, we had a child node on this class that contained either a
+ # constant read or a missing node. To not cause a breaking change, we
+ # continue to supply that API.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:205
+ def child; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5412
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5431
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5424
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location) -> ConstantPathNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5436
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parent: T.nilable(Prism::Node),
+ name: T.nilable(Symbol),
+ delimiter_loc: Prism::Location,
+ name_loc: Prism::Location
+ ).returns(Prism::ConstantPathNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, parent: self.parent, name: self.name, delimiter_loc: self.delimiter_loc, name_loc: self.name_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5441
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5444
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def delimiter: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5502
+ sig { returns(String) }
+ def delimiter; end
+
+ # The location of the `::` delimiter.
+ #
+ # ::Foo
+ # ^^
+ #
+ # One::Two
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5470
+ sig { returns(Prism::Location) }
+ def delimiter_loc; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5417
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # Returns the full name of this constant path. For example: "Foo::Bar"
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:198
+ sig { returns(String) }
+ def full_name; end
+
+ # Returns the list of parts for the full name of this constant path.
+ # For example: [:Foo, :Bar]
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:176
+ sig { returns(T::Array[Symbol]) }
+ def full_name_parts; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5507
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the constant being accessed. This could be `nil` in the event of a syntax error.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5461
+ sig { returns(T.nilable(Symbol)) }
+ def name; end
+
+ # The location of the name of the constant.
+ #
+ # ::Foo
+ # ^^^
+ #
+ # One::Two
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5489
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # The left-hand node of the path, if present. It can be `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). It will be `nil` when the constant lookup is at the root of the module tree.
+ #
+ # Foo::Bar
+ # ^^^
+ #
+ # self::Test
+ # ^^^^
+ #
+ # a.b::C
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5458
+ sig { returns(T.nilable(Prism::Node)) }
+ def parent; end
+
+ # Save the delimiter_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5478
+ def save_delimiter_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5497
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5512
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5517
+ def type; end
+ end
+end
+
+# An error class raised when dynamic parts are found while computing a
+# constant path's full name. For example:
+# Foo::Bar::Baz -> does not raise because all parts of the constant path are
+# simple constants
+# var::Bar::Baz -> raises because the first part of the constant path is a
+# local variable
+#
+# pkg:gem/prism#lib/prism/node_ext.rb:167
+class Prism::ConstantPathNode::DynamicPartsInConstantPathError < ::StandardError; end
+
+# An error class raised when missing nodes are found while computing a
+# constant path's full name. For example:
+# Foo:: -> raises because the constant path is missing the last part
+#
+# pkg:gem/prism#lib/prism/node_ext.rb:172
+class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError; end
+
+# Represents assigning to a constant path using an operator that isn't `=`.
+#
+# Parent::Child += value
+# ^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5536
+class Prism::ConstantPathOperatorWriteNode < ::Prism::Node
+ # Initialize a new ConstantPathOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5538
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, target, binary_operator_loc, value, binary_operator); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5629
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5550
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5610
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5594
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5555
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5573
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5568
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ConstantPathOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5578
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::ConstantPathOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, target: self.target, binary_operator_loc: self.binary_operator_loc, value: self.value, binary_operator: self.binary_operator); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5583
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5586
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5560
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5613
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:390
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:397
+ def operator_loc; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5602
+ def save_binary_operator_loc(repository); end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5591
+ sig { returns(Prism::ConstantPathNode) }
+ def target; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5618
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5607
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5623
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a constant path.
+#
+# Parent::Child ||= value
+# ^^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5642
+class Prism::ConstantPathOrWriteNode < ::Prism::Node
+ # Initialize a new ConstantPathOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5644
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, target, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5736
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5655
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5660
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5678
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5673
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5683
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantPathOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, target: self.target, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5688
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5691
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5665
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5720
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5715
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5699
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5707
+ def save_operator_loc(repository); end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5696
+ sig { returns(Prism::ConstantPathNode) }
+ def target; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5725
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5712
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5730
+ def type; end
+ end
+end
+
+# Represents writing to a constant path in a context that doesn't have an explicit value.
+#
+# Foo::Foo, Bar::Bar = baz
+# ^^^^^^^^ ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5748
+class Prism::ConstantPathTargetNode < ::Prism::Node
+ # Initialize a new ConstantPathTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5750
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parent: T.nilable(Prism::Node),
+ name: T.nilable(Symbol),
+ delimiter_loc: Prism::Location,
+ name_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, parent, name, delimiter_loc, name_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5857
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5762
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # Previously, we had a child node on this class that contained either a
+ # constant read or a missing node. To not cause a breaking change, we
+ # continue to supply that API.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:246
+ def child; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5767
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5786
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5779
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location) -> ConstantPathTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5791
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parent: T.nilable(Prism::Node),
+ name: T.nilable(Symbol),
+ delimiter_loc: Prism::Location,
+ name_loc: Prism::Location
+ ).returns(Prism::ConstantPathTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, parent: self.parent, name: self.name, delimiter_loc: self.delimiter_loc, name_loc: self.name_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5796
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5799
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def delimiter: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5836
+ sig { returns(String) }
+ def delimiter; end
+
+ # attr_reader delimiter_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5810
+ sig { returns(Prism::Location) }
+ def delimiter_loc; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5772
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # Returns the full name of this constant path. For example: "Foo::Bar"
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:239
+ sig { returns(String) }
+ def full_name; end
+
+ # Returns the list of parts for the full name of this constant path.
+ # For example: [:Foo, :Bar]
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:219
+ sig { returns(T::Array[Symbol]) }
+ def full_name_parts; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5841
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5807
+ sig { returns(T.nilable(Symbol)) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5823
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # attr_reader parent: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5804
+ sig { returns(T.nilable(Prism::Node)) }
+ def parent; end
+
+ # Save the delimiter_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5818
+ def save_delimiter_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5831
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5846
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5851
+ def type; end
+ end
+end
+
+# Represents writing to a constant path.
+#
+# ::Foo = 1
+# ^^^^^^^^^
+#
+# Foo::Bar = 1
+# ^^^^^^^^^^^^
+#
+# ::Foo::Bar = 1
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5876
+class Prism::ConstantPathWriteNode < ::Prism::Node
+ # Initialize a new ConstantPathWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5878
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, target, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5982
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5889
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5894
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5912
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5907
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5917
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantPathWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, target: self.target, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5922
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5925
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5899
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5966
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5961
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `=` operator.
+ #
+ # ::ABC = 123
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5942
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5950
+ def save_operator_loc(repository); end
+
+ # A node representing the constant path being written to.
+ #
+ # Foo::Bar = 1
+ # ^^^^^^^^
+ #
+ # ::Foo = :abc
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5936
+ sig { returns(Prism::ConstantPathNode) }
+ def target; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5971
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the constant path. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # FOO::BAR = :abc
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5958
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5976
+ def type; end
+ end
+end
+
+# Represents referencing a constant.
+#
+# Foo
+# ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:5994
+class Prism::ConstantReadNode < ::Prism::Node
+ # Initialize a new ConstantReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:5996
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6067
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6005
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6010
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6026
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6021
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ConstantReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6031
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ConstantReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6036
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6039
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6015
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # Returns the full name of this constant. For example: "Foo"
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:142
+ sig { returns(String) }
+ def full_name; end
+
+ # Returns the list of parts for the full name of this constant.
+ # For example: [:Foo]
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:137
+ sig { returns(T::Array[Symbol]) }
+ def full_name_parts; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6051
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the [constant](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#constants).
+ #
+ # X # name `:X`
+ #
+ # SOME_CONSTANT # name `:SOME_CONSTANT`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6048
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6056
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6061
+ def type; end
+ end
+end
+
+# Represents writing to a constant in a context that doesn't have an explicit value.
+#
+# Foo, Bar = baz
+# ^^^ ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6077
+class Prism::ConstantTargetNode < ::Prism::Node
+ # Initialize a new ConstantTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6079
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6146
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6088
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6093
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6109
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6104
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ConstantTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6114
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ConstantTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6119
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6122
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6098
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # Returns the full name of this constant. For example: "Foo"
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:265
+ sig { returns(String) }
+ def full_name; end
+
+ # Returns the list of parts for the full name of this constant.
+ # For example: [:Foo]
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:260
+ sig { returns(T::Array[Symbol]) }
+ def full_name_parts; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6130
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6127
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6135
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6140
+ def type; end
+ end
+end
+
+# Represents writing to a constant.
+#
+# Foo = 1
+# ^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6156
+class Prism::ConstantWriteNode < ::Prism::Node
+ # Initialize a new ConstantWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6158
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6279
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6170
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6175
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6192
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6187
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> ConstantWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6197
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::ConstantWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6202
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6205
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6180
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # Returns the full name of this constant. For example: "Foo"
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:155
+ sig { returns(String) }
+ def full_name; end
+
+ # Returns the list of parts for the full name of this constant.
+ # For example: [:Foo]
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:150
+ sig { returns(T::Array[Symbol]) }
+ def full_name_parts; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6263
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the [constant](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#constants).
+ #
+ # Foo = :bar # name `:Foo`
+ #
+ # XYZ = 1 # name `:XYZ`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6214
+ sig { returns(Symbol) }
+ def name; end
+
+ # The location of the constant name.
+ #
+ # FOO = 1
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6220
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6258
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `=` operator.
+ #
+ # FOO = :bar
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6245
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6228
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6253
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6268
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the constant. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # FOO = :bar
+ # ^^^^
+ #
+ # MyClass = Class.new
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6239
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6273
+ def type; end
+ end
+end
+
+# Raised when requested to parse as the currently running Ruby version but Prism has no support for it.
+#
+# pkg:gem/prism#lib/prism.rb:39
+class Prism::CurrentVersionError < ::ArgumentError
+ # Initialize a new exception for the given ruby version string.
+ #
+ # pkg:gem/prism#lib/prism.rb:41
+ def initialize(version); end
+end
+
+# The DSL module provides a set of methods that can be used to create prism
+# nodes in a more concise manner. For example, instead of writing:
+#
+# source = Prism::Source.for("[1]")
+#
+# Prism::ArrayNode.new(
+# source,
+# 0,
+# Prism::Location.new(source, 0, 3),
+# 0,
+# [
+# Prism::IntegerNode.new(
+# source,
+# 0,
+# Prism::Location.new(source, 1, 1),
+# Prism::IntegerBaseFlags::DECIMAL,
+# 1
+# )
+# ],
+# Prism::Location.new(source, 0, 1),
+# Prism::Location.new(source, 2, 1)
+# )
+#
+# you could instead write:
+#
+# class Builder
+# include Prism::DSL
+#
+# attr_reader :default_source
+#
+# def initialize
+# @default_source = source("[1]")
+# end
+#
+# def build
+# array_node(
+# location: location(start_offset: 0, length: 3),
+# elements: [
+# integer_node(
+# location: location(start_offset: 1, length: 1),
+# flags: integer_base_flag(:decimal),
+# value: 1
+# )
+# ],
+# opening_loc: location(start_offset: 0, length: 1),
+# closing_loc: location(start_offset: 2, length: 1)
+# )
+# end
+# end
+#
+# This is mostly helpful in the context of generating trees programmatically.
+#
+# pkg:gem/prism#lib/prism/dsl.rb:64
+module Prism::DSL
+ extend ::Prism::DSL
+
+ # Create a new AliasGlobalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:80
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ new_name: T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode),
+ old_name: T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::SymbolNode, Prism::MissingNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::AliasGlobalVariableNode)
+ end
+ def alias_global_variable_node(source: default_source, node_id: 0, location: default_location, flags: 0, new_name: global_variable_read_node(source: source), old_name: global_variable_read_node(source: source), keyword_loc: location); end
+
+ # Create a new AliasMethodNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:85
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ new_name: T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode),
+ old_name: T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode, Prism::GlobalVariableReadNode, Prism::MissingNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::AliasMethodNode)
+ end
+ def alias_method_node(source: default_source, node_id: 0, location: default_location, flags: 0, new_name: symbol_node(source: source), old_name: symbol_node(source: source), keyword_loc: location); end
+
+ # Create a new AlternationPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:90
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::AlternationPatternNode)
+ end
+ def alternation_pattern_node(source: default_source, node_id: 0, location: default_location, flags: 0, left: default_node(source, location), right: default_node(source, location), operator_loc: location); end
+
+ # Create a new AndNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:95
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::AndNode)
+ end
+ def and_node(source: default_source, node_id: 0, location: default_location, flags: 0, left: default_node(source, location), right: default_node(source, location), operator_loc: location); end
+
+ # Create a new ArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:100
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T::Array[Prism::Node]
+ ).returns(Prism::ArgumentsNode)
+ end
+ def arguments_node(source: default_source, node_id: 0, location: default_location, flags: 0, arguments: []); end
+
+ # Retrieve the value of one of the ArgumentsNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:835
+ sig { params(name: Symbol).returns(Integer) }
+ def arguments_node_flag(name); end
+
+ # Create a new ArrayNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:105
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ elements: T::Array[Prism::Node],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::ArrayNode)
+ end
+ def array_node(source: default_source, node_id: 0, location: default_location, flags: 0, elements: [], opening_loc: nil, closing_loc: nil); end
+
+ # Retrieve the value of one of the ArrayNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:847
+ sig { params(name: Symbol).returns(Integer) }
+ def array_node_flag(name); end
+
+ # Create a new ArrayPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:110
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ requireds: T::Array[Prism::Node],
+ rest: T.nilable(Prism::Node),
+ posts: T::Array[Prism::Node],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::ArrayPatternNode)
+ end
+ def array_pattern_node(source: default_source, node_id: 0, location: default_location, flags: 0, constant: nil, requireds: [], rest: nil, posts: [], opening_loc: nil, closing_loc: nil); end
+
+ # Create a new AssocNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:115
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ key: Prism::Node,
+ value: Prism::Node,
+ operator_loc: T.nilable(Prism::Location)
+ ).returns(Prism::AssocNode)
+ end
+ def assoc_node(source: default_source, node_id: 0, location: default_location, flags: 0, key: default_node(source, location), value: default_node(source, location), operator_loc: nil); end
+
+ # Create a new AssocSplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:120
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::AssocSplatNode)
+ end
+ def assoc_splat_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: nil, operator_loc: location); end
+
+ # Create a new BackReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:125
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::BackReferenceReadNode)
+ end
+ def back_reference_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new BeginNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:130
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ begin_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ rescue_clause: T.nilable(Prism::RescueNode),
+ else_clause: T.nilable(Prism::ElseNode),
+ ensure_clause: T.nilable(Prism::EnsureNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::BeginNode)
+ end
+ def begin_node(source: default_source, node_id: 0, location: default_location, flags: 0, begin_keyword_loc: nil, statements: nil, rescue_clause: nil, else_clause: nil, ensure_clause: nil, end_keyword_loc: nil); end
+
+ # Create a new BlockArgumentNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:135
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::BlockArgumentNode)
+ end
+ def block_argument_node(source: default_source, node_id: 0, location: default_location, flags: 0, expression: nil, operator_loc: location); end
+
+ # Create a new BlockLocalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:140
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::BlockLocalVariableNode)
+ end
+ def block_local_variable_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new BlockNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:145
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ parameters: T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode)),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::BlockNode)
+ end
+ def block_node(source: default_source, node_id: 0, location: default_location, flags: 0, locals: [], parameters: nil, body: nil, opening_loc: location, closing_loc: location); end
+
+ # Create a new BlockParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:150
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).returns(Prism::BlockParameterNode)
+ end
+ def block_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: nil, name_loc: nil, operator_loc: location); end
+
+ # Create a new BlockParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:155
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parameters: T.nilable(Prism::ParametersNode),
+ locals: T::Array[Prism::BlockLocalVariableNode],
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::BlockParametersNode)
+ end
+ def block_parameters_node(source: default_source, node_id: 0, location: default_location, flags: 0, parameters: nil, locals: [], opening_loc: nil, closing_loc: nil); end
+
+ # Create a new BreakNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:160
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::BreakNode)
+ end
+ def break_node(source: default_source, node_id: 0, location: default_location, flags: 0, arguments: nil, keyword_loc: location); end
+
+ # Create a new CallAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:165
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::CallAndWriteNode)
+ end
+ def call_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, message_loc: nil, read_name: :"", write_name: :"", operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new CallNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:170
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ name: Symbol,
+ message_loc: T.nilable(Prism::Location),
+ opening_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: T.nilable(Prism::Location),
+ equal_loc: T.nilable(Prism::Location),
+ block: T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))
+ ).returns(Prism::CallNode)
+ end
+ def call_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, name: :"", message_loc: nil, opening_loc: nil, arguments: nil, closing_loc: nil, equal_loc: nil, block: nil); end
+
+ # Retrieve the value of one of the CallNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:855
+ sig { params(name: Symbol).returns(Integer) }
+ def call_node_flag(name); end
+
+ # Create a new CallOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:175
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ binary_operator: Symbol,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::CallOperatorWriteNode)
+ end
+ def call_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, message_loc: nil, read_name: :"", write_name: :"", binary_operator: :"", binary_operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new CallOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:180
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ message_loc: T.nilable(Prism::Location),
+ read_name: Symbol,
+ write_name: Symbol,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::CallOrWriteNode)
+ end
+ def call_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, message_loc: nil, read_name: :"", write_name: :"", operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new CallTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:185
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: Prism::Node,
+ call_operator_loc: Prism::Location,
+ name: Symbol,
+ message_loc: Prism::Location
+ ).returns(Prism::CallTargetNode)
+ end
+ def call_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: default_node(source, location), call_operator_loc: location, name: :"", message_loc: location); end
+
+ # Create a new CapturePatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:190
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ target: Prism::LocalVariableTargetNode,
+ operator_loc: Prism::Location
+ ).returns(Prism::CapturePatternNode)
+ end
+ def capture_pattern_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: default_node(source, location), target: local_variable_target_node(source: source), operator_loc: location); end
+
+ # Create a new CaseMatchNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:195
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ predicate: T.nilable(Prism::Node),
+ conditions: T::Array[Prism::InNode],
+ else_clause: T.nilable(Prism::ElseNode),
+ case_keyword_loc: Prism::Location,
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::CaseMatchNode)
+ end
+ def case_match_node(source: default_source, node_id: 0, location: default_location, flags: 0, predicate: nil, conditions: [], else_clause: nil, case_keyword_loc: location, end_keyword_loc: location); end
+
+ # Create a new CaseNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:200
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ predicate: T.nilable(Prism::Node),
+ conditions: T::Array[Prism::WhenNode],
+ else_clause: T.nilable(Prism::ElseNode),
+ case_keyword_loc: Prism::Location,
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::CaseNode)
+ end
+ def case_node(source: default_source, node_id: 0, location: default_location, flags: 0, predicate: nil, conditions: [], else_clause: nil, case_keyword_loc: location, end_keyword_loc: location); end
+
+ # Create a new ClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:205
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ class_keyword_loc: Prism::Location,
+ constant_path: T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::CallNode),
+ inheritance_operator_loc: T.nilable(Prism::Location),
+ superclass: T.nilable(Prism::Node),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location,
+ name: Symbol
+ ).returns(Prism::ClassNode)
+ end
+ def class_node(source: default_source, node_id: 0, location: default_location, flags: 0, locals: [], class_keyword_loc: location, constant_path: constant_read_node(source: source), inheritance_operator_loc: nil, superclass: nil, body: nil, end_keyword_loc: location, name: :""); end
+
+ # Create a new ClassVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:210
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ClassVariableAndWriteNode)
+ end
+ def class_variable_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ClassVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:215
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::ClassVariableOperatorWriteNode)
+ end
+ def class_variable_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, binary_operator_loc: location, value: default_node(source, location), binary_operator: :""); end
+
+ # Create a new ClassVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:220
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ClassVariableOrWriteNode)
+ end
+ def class_variable_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ClassVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:225
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ClassVariableReadNode)
+ end
+ def class_variable_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new ClassVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:230
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ClassVariableTargetNode)
+ end
+ def class_variable_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new ClassVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:235
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::ClassVariableWriteNode)
+ end
+ def class_variable_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, value: default_node(source, location), operator_loc: location); end
+
+ # Create a new ConstantAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:240
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantAndWriteNode)
+ end
+ def constant_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ConstantOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:245
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::ConstantOperatorWriteNode)
+ end
+ def constant_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, binary_operator_loc: location, value: default_node(source, location), binary_operator: :""); end
+
+ # Create a new ConstantOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:250
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantOrWriteNode)
+ end
+ def constant_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ConstantPathAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:255
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantPathAndWriteNode)
+ end
+ def constant_path_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, target: constant_path_node(source: source), operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ConstantPathNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:260
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parent: T.nilable(Prism::Node),
+ name: T.nilable(Symbol),
+ delimiter_loc: Prism::Location,
+ name_loc: Prism::Location
+ ).returns(Prism::ConstantPathNode)
+ end
+ def constant_path_node(source: default_source, node_id: 0, location: default_location, flags: 0, parent: nil, name: nil, delimiter_loc: location, name_loc: location); end
+
+ # Create a new ConstantPathOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:265
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::ConstantPathOperatorWriteNode)
+ end
+ def constant_path_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, target: constant_path_node(source: source), binary_operator_loc: location, value: default_node(source, location), binary_operator: :""); end
+
+ # Create a new ConstantPathOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:270
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantPathOrWriteNode)
+ end
+ def constant_path_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, target: constant_path_node(source: source), operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ConstantPathTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:275
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ parent: T.nilable(Prism::Node),
+ name: T.nilable(Symbol),
+ delimiter_loc: Prism::Location,
+ name_loc: Prism::Location
+ ).returns(Prism::ConstantPathTargetNode)
+ end
+ def constant_path_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, parent: nil, name: nil, delimiter_loc: location, name_loc: location); end
+
+ # Create a new ConstantPathWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:280
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ target: Prism::ConstantPathNode,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::ConstantPathWriteNode)
+ end
+ def constant_path_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, target: constant_path_node(source: source), operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new ConstantReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:285
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ConstantReadNode)
+ end
+ def constant_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new ConstantTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:290
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::ConstantTargetNode)
+ end
+ def constant_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new ConstantWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:295
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::ConstantWriteNode)
+ end
+ def constant_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, value: default_node(source, location), operator_loc: location); end
+
+ # Create a new DefNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:300
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ receiver: T.nilable(Prism::Node),
+ parameters: T.nilable(Prism::ParametersNode),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ locals: T::Array[Symbol],
+ def_keyword_loc: Prism::Location,
+ operator_loc: T.nilable(Prism::Location),
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location),
+ equal_loc: T.nilable(Prism::Location),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::DefNode)
+ end
+ def def_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, receiver: nil, parameters: nil, body: nil, locals: [], def_keyword_loc: location, operator_loc: nil, lparen_loc: nil, rparen_loc: nil, equal_loc: nil, end_keyword_loc: nil); end
+
+ # Create a new DefinedNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:305
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lparen_loc: T.nilable(Prism::Location),
+ value: Prism::Node,
+ rparen_loc: T.nilable(Prism::Location),
+ keyword_loc: Prism::Location
+ ).returns(Prism::DefinedNode)
+ end
+ def defined_node(source: default_source, node_id: 0, location: default_location, flags: 0, lparen_loc: nil, value: default_node(source, location), rparen_loc: nil, keyword_loc: location); end
+
+ # Create a new ElseNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:310
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ else_keyword_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::ElseNode)
+ end
+ def else_node(source: default_source, node_id: 0, location: default_location, flags: 0, else_keyword_loc: location, statements: nil, end_keyword_loc: nil); end
+
+ # Create a new EmbeddedStatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:315
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ closing_loc: Prism::Location
+ ).returns(Prism::EmbeddedStatementsNode)
+ end
+ def embedded_statements_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, statements: nil, closing_loc: location); end
+
+ # Create a new EmbeddedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:320
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ variable: T.any(Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)
+ ).returns(Prism::EmbeddedVariableNode)
+ end
+ def embedded_variable_node(source: default_source, node_id: 0, location: default_location, flags: 0, operator_loc: location, variable: instance_variable_read_node(source: source)); end
+
+ # Retrieve the value of one of the EncodingFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:866
+ sig { params(name: Symbol).returns(Integer) }
+ def encoding_flag(name); end
+
+ # Create a new EnsureNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:325
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ ensure_keyword_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::EnsureNode)
+ end
+ def ensure_node(source: default_source, node_id: 0, location: default_location, flags: 0, ensure_keyword_loc: location, statements: nil, end_keyword_loc: location); end
+
+ # Create a new FalseNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:330
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::FalseNode)
+ end
+ def false_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new FindPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:335
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ left: Prism::SplatNode,
+ requireds: T::Array[Prism::Node],
+ right: T.any(Prism::SplatNode, Prism::MissingNode),
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::FindPatternNode)
+ end
+ def find_pattern_node(source: default_source, node_id: 0, location: default_location, flags: 0, constant: nil, left: splat_node(source: source), requireds: [], right: splat_node(source: source), opening_loc: nil, closing_loc: nil); end
+
+ # Create a new FlipFlopNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:340
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: T.nilable(Prism::Node),
+ right: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::FlipFlopNode)
+ end
+ def flip_flop_node(source: default_source, node_id: 0, location: default_location, flags: 0, left: nil, right: nil, operator_loc: location); end
+
+ # Create a new FloatNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:345
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Float
+ ).returns(Prism::FloatNode)
+ end
+ def float_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: 0.0); end
+
+ # Create a new ForNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:350
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ index: T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode),
+ collection: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode),
+ for_keyword_loc: Prism::Location,
+ in_keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::ForNode)
+ end
+ def for_node(source: default_source, node_id: 0, location: default_location, flags: 0, index: local_variable_target_node(source: source), collection: default_node(source, location), statements: nil, for_keyword_loc: location, in_keyword_loc: location, do_keyword_loc: nil, end_keyword_loc: location); end
+
+ # Create a new ForwardingArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:355
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::ForwardingArgumentsNode)
+ end
+ def forwarding_arguments_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new ForwardingParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:360
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::ForwardingParameterNode)
+ end
+ def forwarding_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new ForwardingSuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:365
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ block: T.nilable(Prism::BlockNode)
+ ).returns(Prism::ForwardingSuperNode)
+ end
+ def forwarding_super_node(source: default_source, node_id: 0, location: default_location, flags: 0, block: nil); end
+
+ # Create a new GlobalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:370
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::GlobalVariableAndWriteNode)
+ end
+ def global_variable_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new GlobalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:375
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::GlobalVariableOperatorWriteNode)
+ end
+ def global_variable_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, binary_operator_loc: location, value: default_node(source, location), binary_operator: :""); end
+
+ # Create a new GlobalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:380
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::GlobalVariableOrWriteNode)
+ end
+ def global_variable_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new GlobalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:385
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::GlobalVariableReadNode)
+ end
+ def global_variable_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new GlobalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:390
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::GlobalVariableTargetNode)
+ end
+ def global_variable_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new GlobalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:395
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::GlobalVariableWriteNode)
+ end
+ def global_variable_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, value: default_node(source, location), operator_loc: location); end
+
+ # Create a new HashNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:400
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::HashNode)
+ end
+ def hash_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, elements: [], closing_loc: location); end
+
+ # Create a new HashPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:405
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ elements: T::Array[Prism::AssocNode],
+ rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)),
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::HashPatternNode)
+ end
+ def hash_pattern_node(source: default_source, node_id: 0, location: default_location, flags: 0, constant: nil, elements: [], rest: nil, opening_loc: nil, closing_loc: nil); end
+
+ # Create a new IfNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:410
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ if_keyword_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ subsequent: T.nilable(T.any(Prism::ElseNode, Prism::IfNode)),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::IfNode)
+ end
+ def if_node(source: default_source, node_id: 0, location: default_location, flags: 0, if_keyword_loc: nil, predicate: default_node(source, location), then_keyword_loc: nil, statements: nil, subsequent: nil, end_keyword_loc: nil); end
+
+ # Create a new ImaginaryNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:415
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ numeric: T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)
+ ).returns(Prism::ImaginaryNode)
+ end
+ def imaginary_node(source: default_source, node_id: 0, location: default_location, flags: 0, numeric: float_node(source: source)); end
+
+ # Create a new ImplicitNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:420
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: T.any(Prism::LocalVariableReadNode, Prism::CallNode, Prism::ConstantReadNode, Prism::LocalVariableTargetNode)
+ ).returns(Prism::ImplicitNode)
+ end
+ def implicit_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: local_variable_read_node(source: source)); end
+
+ # Create a new ImplicitRestNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:425
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::ImplicitRestNode)
+ end
+ def implicit_rest_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new InNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:430
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ pattern: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode),
+ in_loc: Prism::Location,
+ then_loc: T.nilable(Prism::Location)
+ ).returns(Prism::InNode)
+ end
+ def in_node(source: default_source, node_id: 0, location: default_location, flags: 0, pattern: default_node(source, location), statements: nil, in_loc: location, then_loc: nil); end
+
+ # Create a new IndexAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:435
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::IndexAndWriteNode)
+ end
+ def index_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, opening_loc: location, arguments: nil, closing_loc: location, block: nil, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new IndexOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:440
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ binary_operator: Symbol,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::IndexOperatorWriteNode)
+ end
+ def index_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, opening_loc: location, arguments: nil, closing_loc: location, block: nil, binary_operator: :"", binary_operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new IndexOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:445
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::IndexOrWriteNode)
+ end
+ def index_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: nil, call_operator_loc: nil, opening_loc: location, arguments: nil, closing_loc: location, block: nil, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new IndexTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:450
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: Prism::Node,
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode)
+ ).returns(Prism::IndexTargetNode)
+ end
+ def index_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, receiver: default_node(source, location), opening_loc: location, arguments: nil, closing_loc: location, block: nil); end
+
+ # Create a new InstanceVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:455
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::InstanceVariableAndWriteNode)
+ end
+ def instance_variable_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new InstanceVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:460
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::InstanceVariableOperatorWriteNode)
+ end
+ def instance_variable_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, binary_operator_loc: location, value: default_node(source, location), binary_operator: :""); end
+
+ # Create a new InstanceVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:465
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::InstanceVariableOrWriteNode)
+ end
+ def instance_variable_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new InstanceVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:470
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::InstanceVariableReadNode)
+ end
+ def instance_variable_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new InstanceVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:475
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::InstanceVariableTargetNode)
+ end
+ def instance_variable_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new InstanceVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:480
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::InstanceVariableWriteNode)
+ end
+ def instance_variable_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, value: default_node(source, location), operator_loc: location); end
+
+ # Retrieve the value of one of the IntegerBaseFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:875
+ sig { params(name: Symbol).returns(Integer) }
+ def integer_base_flag(name); end
+
+ # Create a new IntegerNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:485
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Integer
+ ).returns(Prism::IntegerNode)
+ end
+ def integer_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: 0); end
+
+ # Create a new InterpolatedMatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:490
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::InterpolatedMatchLastLineNode)
+ end
+ def interpolated_match_last_line_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, parts: [], closing_loc: location); end
+
+ # Create a new InterpolatedRegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:495
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::InterpolatedRegularExpressionNode)
+ end
+ def interpolated_regular_expression_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, parts: [], closing_loc: location); end
+
+ # Create a new InterpolatedStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:500
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode, Prism::XStringNode, Prism::InterpolatedXStringNode, Prism::SymbolNode, Prism::InterpolatedSymbolNode)],
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::InterpolatedStringNode)
+ end
+ def interpolated_string_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: nil, parts: [], closing_loc: nil); end
+
+ # Retrieve the value of one of the InterpolatedStringNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:886
+ sig { params(name: Symbol).returns(Integer) }
+ def interpolated_string_node_flag(name); end
+
+ # Create a new InterpolatedSymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:505
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::InterpolatedSymbolNode)
+ end
+ def interpolated_symbol_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: nil, parts: [], closing_loc: nil); end
+
+ # Create a new InterpolatedXStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:510
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::InterpolatedXStringNode)
+ end
+ def interpolated_x_string_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, parts: [], closing_loc: location); end
+
+ # Create a new ItLocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:515
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::ItLocalVariableReadNode)
+ end
+ def it_local_variable_read_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new ItParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:520
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::ItParametersNode)
+ end
+ def it_parameters_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new KeywordHashNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:525
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]
+ ).returns(Prism::KeywordHashNode)
+ end
+ def keyword_hash_node(source: default_source, node_id: 0, location: default_location, flags: 0, elements: []); end
+
+ # Retrieve the value of one of the KeywordHashNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:895
+ sig { params(name: Symbol).returns(Integer) }
+ def keyword_hash_node_flag(name); end
+
+ # Create a new KeywordRestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:530
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).returns(Prism::KeywordRestParameterNode)
+ end
+ def keyword_rest_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: nil, name_loc: nil, operator_loc: location); end
+
+ # Create a new LambdaNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:535
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ operator_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ parameters: T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode)),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))
+ ).returns(Prism::LambdaNode)
+ end
+ def lambda_node(source: default_source, node_id: 0, location: default_location, flags: 0, locals: [], operator_loc: location, opening_loc: location, closing_loc: location, parameters: nil, body: nil); end
+
+ # Create a new LocalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:540
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableAndWriteNode)
+ end
+ def local_variable_and_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name_loc: location, operator_loc: location, value: default_node(source, location), name: :"", depth: 0); end
+
+ # Create a new LocalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:545
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ binary_operator: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableOperatorWriteNode)
+ end
+ def local_variable_operator_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name_loc: location, binary_operator_loc: location, value: default_node(source, location), name: :"", binary_operator: :"", depth: 0); end
+
+ # Create a new LocalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:550
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableOrWriteNode)
+ end
+ def local_variable_or_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name_loc: location, operator_loc: location, value: default_node(source, location), name: :"", depth: 0); end
+
+ # Create a new LocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:555
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableReadNode)
+ end
+ def local_variable_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", depth: 0); end
+
+ # Create a new LocalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:560
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableTargetNode)
+ end
+ def local_variable_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", depth: 0); end
+
+ # Create a new LocalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:565
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::LocalVariableWriteNode)
+ end
+ def local_variable_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", depth: 0, name_loc: location, value: default_node(source, location), operator_loc: location); end
+
+ # Create a new Location object.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:75
+ sig { params(source: Prism::Source, start_offset: Integer, length: Integer).returns(Prism::Location) }
+ def location(source: default_source, start_offset: 0, length: 0); end
+
+ # Retrieve the value of one of the LoopFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:903
+ sig { params(name: Symbol).returns(Integer) }
+ def loop_flag(name); end
+
+ # Create a new MatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:570
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).returns(Prism::MatchLastLineNode)
+ end
+ def match_last_line_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, content_loc: location, closing_loc: location, unescaped: ""); end
+
+ # Create a new MatchPredicateNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:575
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ pattern: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::MatchPredicateNode)
+ end
+ def match_predicate_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: default_node(source, location), pattern: default_node(source, location), operator_loc: location); end
+
+ # Create a new MatchRequiredNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:580
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ pattern: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::MatchRequiredNode)
+ end
+ def match_required_node(source: default_source, node_id: 0, location: default_location, flags: 0, value: default_node(source, location), pattern: default_node(source, location), operator_loc: location); end
+
+ # Create a new MatchWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:585
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ call: Prism::CallNode,
+ targets: T::Array[Prism::LocalVariableTargetNode]
+ ).returns(Prism::MatchWriteNode)
+ end
+ def match_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, call: call_node(source: source), targets: []); end
+
+ # Create a new MissingNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:590
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::MissingNode)
+ end
+ def missing_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new ModuleNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:595
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ module_keyword_loc: Prism::Location,
+ constant_path: T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::MissingNode),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location,
+ name: Symbol
+ ).returns(Prism::ModuleNode)
+ end
+ def module_node(source: default_source, node_id: 0, location: default_location, flags: 0, locals: [], module_keyword_loc: location, constant_path: constant_read_node(source: source), body: nil, end_keyword_loc: location, name: :""); end
+
+ # Create a new MultiTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:600
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ rest: T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode)),
+ rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location)
+ ).returns(Prism::MultiTargetNode)
+ end
+ def multi_target_node(source: default_source, node_id: 0, location: default_location, flags: 0, lefts: [], rest: nil, rights: [], lparen_loc: nil, rparen_loc: nil); end
+
+ # Create a new MultiWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:605
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ rest: T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode)),
+ rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::MultiWriteNode)
+ end
+ def multi_write_node(source: default_source, node_id: 0, location: default_location, flags: 0, lefts: [], rest: nil, rights: [], lparen_loc: nil, rparen_loc: nil, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new NextNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:610
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::NextNode)
+ end
+ def next_node(source: default_source, node_id: 0, location: default_location, flags: 0, arguments: nil, keyword_loc: location); end
+
+ # Create a new NilNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:615
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::NilNode)
+ end
+ def nil_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new NoKeywordsParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:620
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ keyword_loc: Prism::Location
+ ).returns(Prism::NoKeywordsParameterNode)
+ end
+ def no_keywords_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, operator_loc: location, keyword_loc: location); end
+
+ # Create a new NumberedParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:625
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ maximum: Integer
+ ).returns(Prism::NumberedParametersNode)
+ end
+ def numbered_parameters_node(source: default_source, node_id: 0, location: default_location, flags: 0, maximum: 0); end
+
+ # Create a new NumberedReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:630
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ number: Integer
+ ).returns(Prism::NumberedReferenceReadNode)
+ end
+ def numbered_reference_read_node(source: default_source, node_id: 0, location: default_location, flags: 0, number: 0); end
+
+ # Create a new OptionalKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:635
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::OptionalKeywordParameterNode)
+ end
+ def optional_keyword_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, value: default_node(source, location)); end
+
+ # Create a new OptionalParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:640
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::OptionalParameterNode)
+ end
+ def optional_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location, operator_loc: location, value: default_node(source, location)); end
+
+ # Create a new OrNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:645
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::OrNode)
+ end
+ def or_node(source: default_source, node_id: 0, location: default_location, flags: 0, left: default_node(source, location), right: default_node(source, location), operator_loc: location); end
+
+ # Retrieve the value of one of the ParameterFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:911
+ sig { params(name: Symbol).returns(Integer) }
+ def parameter_flag(name); end
+
+ # Create a new ParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:650
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ requireds: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)],
+ optionals: T::Array[Prism::OptionalParameterNode],
+ rest: T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode)),
+ posts: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)],
+ keywords: T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)],
+ keyword_rest: T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)),
+ block: T.nilable(Prism::BlockParameterNode)
+ ).returns(Prism::ParametersNode)
+ end
+ def parameters_node(source: default_source, node_id: 0, location: default_location, flags: 0, requireds: [], optionals: [], rest: nil, posts: [], keywords: [], keyword_rest: nil, block: nil); end
+
+ # Create a new ParenthesesNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:655
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ body: T.nilable(Prism::Node),
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::ParenthesesNode)
+ end
+ def parentheses_node(source: default_source, node_id: 0, location: default_location, flags: 0, body: nil, opening_loc: location, closing_loc: location); end
+
+ # Retrieve the value of one of the ParenthesesNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:919
+ sig { params(name: Symbol).returns(Integer) }
+ def parentheses_node_flag(name); end
+
+ # Create a new PinnedExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:660
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: Prism::Node,
+ operator_loc: Prism::Location,
+ lparen_loc: Prism::Location,
+ rparen_loc: Prism::Location
+ ).returns(Prism::PinnedExpressionNode)
+ end
+ def pinned_expression_node(source: default_source, node_id: 0, location: default_location, flags: 0, expression: default_node(source, location), operator_loc: location, lparen_loc: location, rparen_loc: location); end
+
+ # Create a new PinnedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:665
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ variable: T.any(Prism::LocalVariableReadNode, Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::ItLocalVariableReadNode, Prism::MissingNode),
+ operator_loc: Prism::Location
+ ).returns(Prism::PinnedVariableNode)
+ end
+ def pinned_variable_node(source: default_source, node_id: 0, location: default_location, flags: 0, variable: local_variable_read_node(source: source), operator_loc: location); end
+
+ # Create a new PostExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:670
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ statements: T.nilable(Prism::StatementsNode),
+ keyword_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::PostExecutionNode)
+ end
+ def post_execution_node(source: default_source, node_id: 0, location: default_location, flags: 0, statements: nil, keyword_loc: location, opening_loc: location, closing_loc: location); end
+
+ # Create a new PreExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:675
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ statements: T.nilable(Prism::StatementsNode),
+ keyword_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::PreExecutionNode)
+ end
+ def pre_execution_node(source: default_source, node_id: 0, location: default_location, flags: 0, statements: nil, keyword_loc: location, opening_loc: location, closing_loc: location); end
+
+ # Create a new ProgramNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:680
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ statements: Prism::StatementsNode
+ ).returns(Prism::ProgramNode)
+ end
+ def program_node(source: default_source, node_id: 0, location: default_location, flags: 0, locals: [], statements: statements_node(source: source)); end
+
+ # Retrieve the value of one of the RangeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:927
+ sig { params(name: Symbol).returns(Integer) }
+ def range_flag(name); end
+
+ # Create a new RangeNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:685
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: T.nilable(Prism::Node),
+ right: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::RangeNode)
+ end
+ def range_node(source: default_source, node_id: 0, location: default_location, flags: 0, left: nil, right: nil, operator_loc: location); end
+
+ # Create a new RationalNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:690
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ numerator: Integer,
+ denominator: Integer
+ ).returns(Prism::RationalNode)
+ end
+ def rational_node(source: default_source, node_id: 0, location: default_location, flags: 0, numerator: 0, denominator: 0); end
+
+ # Create a new RedoNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:695
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::RedoNode)
+ end
+ def redo_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Retrieve the value of one of the RegularExpressionFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:935
+ sig { params(name: Symbol).returns(Integer) }
+ def regular_expression_flag(name); end
+
+ # Create a new RegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:700
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).returns(Prism::RegularExpressionNode)
+ end
+ def regular_expression_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, content_loc: location, closing_loc: location, unescaped: ""); end
+
+ # Create a new RequiredKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:705
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location
+ ).returns(Prism::RequiredKeywordParameterNode)
+ end
+ def required_keyword_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :"", name_loc: location); end
+
+ # Create a new RequiredParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:710
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::RequiredParameterNode)
+ end
+ def required_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: :""); end
+
+ # Create a new RescueModifierNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:715
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: Prism::Node,
+ keyword_loc: Prism::Location,
+ rescue_expression: Prism::Node
+ ).returns(Prism::RescueModifierNode)
+ end
+ def rescue_modifier_node(source: default_source, node_id: 0, location: default_location, flags: 0, expression: default_node(source, location), keyword_loc: location, rescue_expression: default_node(source, location)); end
+
+ # Create a new RescueNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:720
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ exceptions: T::Array[Prism::Node],
+ operator_loc: T.nilable(Prism::Location),
+ reference: T.nilable(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode)),
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ subsequent: T.nilable(Prism::RescueNode)
+ ).returns(Prism::RescueNode)
+ end
+ def rescue_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, exceptions: [], operator_loc: nil, reference: nil, then_keyword_loc: nil, statements: nil, subsequent: nil); end
+
+ # Create a new RestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:725
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).returns(Prism::RestParameterNode)
+ end
+ def rest_parameter_node(source: default_source, node_id: 0, location: default_location, flags: 0, name: nil, name_loc: nil, operator_loc: location); end
+
+ # Create a new RetryNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:730
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::RetryNode)
+ end
+ def retry_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new ReturnNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:735
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode)
+ ).returns(Prism::ReturnNode)
+ end
+ def return_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, arguments: nil); end
+
+ # Create a new SelfNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:740
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::SelfNode)
+ end
+ def self_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new ShareableConstantNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:745
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ write: T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode)
+ ).returns(Prism::ShareableConstantNode)
+ end
+ def shareable_constant_node(source: default_source, node_id: 0, location: default_location, flags: 0, write: constant_write_node(source: source)); end
+
+ # Retrieve the value of one of the ShareableConstantNodeFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:953
+ sig { params(name: Symbol).returns(Integer) }
+ def shareable_constant_node_flag(name); end
+
+ # Create a new SingletonClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:750
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ class_keyword_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ expression: Prism::Node,
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::SingletonClassNode)
+ end
+ def singleton_class_node(source: default_source, node_id: 0, location: default_location, flags: 0, locals: [], class_keyword_loc: location, operator_loc: location, expression: default_node(source, location), body: nil, end_keyword_loc: location); end
+
+ # Create a new Source object.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:70
+ sig { params(string: String).returns(Prism::Source) }
+ def source(string); end
+
+ # Create a new SourceEncodingNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:755
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::SourceEncodingNode)
+ end
+ def source_encoding_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new SourceFileNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:760
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ filepath: String
+ ).returns(Prism::SourceFileNode)
+ end
+ def source_file_node(source: default_source, node_id: 0, location: default_location, flags: 0, filepath: ""); end
+
+ # Create a new SourceLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:765
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::SourceLineNode)
+ end
+ def source_line_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new SplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:770
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ expression: T.nilable(Prism::Node)
+ ).returns(Prism::SplatNode)
+ end
+ def splat_node(source: default_source, node_id: 0, location: default_location, flags: 0, operator_loc: location, expression: nil); end
+
+ # Create a new StatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:775
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ body: T::Array[Prism::Node]
+ ).returns(Prism::StatementsNode)
+ end
+ def statements_node(source: default_source, node_id: 0, location: default_location, flags: 0, body: []); end
+
+ # Retrieve the value of one of the StringFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:963
+ sig { params(name: Symbol).returns(Integer) }
+ def string_flag(name); end
+
+ # Create a new StringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:780
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ content_loc: Prism::Location,
+ closing_loc: T.nilable(Prism::Location),
+ unescaped: String
+ ).returns(Prism::StringNode)
+ end
+ def string_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: nil, content_loc: location, closing_loc: nil, unescaped: ""); end
+
+ # Create a new SuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:785
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ lparen_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ rparen_loc: T.nilable(Prism::Location),
+ block: T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))
+ ).returns(Prism::SuperNode)
+ end
+ def super_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, lparen_loc: nil, arguments: nil, rparen_loc: nil, block: nil); end
+
+ # Retrieve the value of one of the SymbolFlags flags.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:974
+ sig { params(name: Symbol).returns(Integer) }
+ def symbol_flag(name); end
+
+ # Create a new SymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:790
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ value_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ unescaped: String
+ ).returns(Prism::SymbolNode)
+ end
+ def symbol_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: nil, value_loc: nil, closing_loc: nil, unescaped: ""); end
+
+ # Create a new TrueNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:795
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer
+ ).returns(Prism::TrueNode)
+ end
+ def true_node(source: default_source, node_id: 0, location: default_location, flags: 0); end
+
+ # Create a new UndefNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:800
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ names: T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)],
+ keyword_loc: Prism::Location
+ ).returns(Prism::UndefNode)
+ end
+ def undef_node(source: default_source, node_id: 0, location: default_location, flags: 0, names: [], keyword_loc: location); end
+
+ # Create a new UnlessNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:805
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ predicate: Prism::Node,
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ else_clause: T.nilable(Prism::ElseNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::UnlessNode)
+ end
+ def unless_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, predicate: default_node(source, location), then_keyword_loc: nil, statements: nil, else_clause: nil, end_keyword_loc: nil); end
+
+ # Create a new UntilNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:810
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode)
+ ).returns(Prism::UntilNode)
+ end
+ def until_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, do_keyword_loc: nil, closing_loc: nil, predicate: default_node(source, location), statements: nil); end
+
+ # Create a new WhenNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:815
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ conditions: T::Array[Prism::Node],
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode)
+ ).returns(Prism::WhenNode)
+ end
+ def when_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, conditions: [], then_keyword_loc: nil, statements: nil); end
+
+ # Create a new WhileNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:820
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode)
+ ).returns(Prism::WhileNode)
+ end
+ def while_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, do_keyword_loc: nil, closing_loc: nil, predicate: default_node(source, location), statements: nil); end
+
+ # Create a new XStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:825
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).returns(Prism::XStringNode)
+ end
+ def x_string_node(source: default_source, node_id: 0, location: default_location, flags: 0, opening_loc: location, content_loc: location, closing_loc: location, unescaped: ""); end
+
+ # Create a new YieldNode node.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:830
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ lparen_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ rparen_loc: T.nilable(Prism::Location)
+ ).returns(Prism::YieldNode)
+ end
+ def yield_node(source: default_source, node_id: 0, location: default_location, flags: 0, keyword_loc: location, lparen_loc: nil, arguments: nil, rparen_loc: nil); end
+
+ private
+
+ # The default location object that gets attached to nodes if no location is
+ # specified, which uses the given source.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:993
+ sig { returns(Prism::Location) }
+ def default_location; end
+
+ # The default node that gets attached to nodes if no node is specified for a
+ # required node field.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:999
+ sig { params(source: Prism::Source, location: Prism::Location).returns(Prism::Node) }
+ def default_node(source, location); end
+
+ # The default source object that gets attached to nodes and locations if no
+ # source is specified.
+ #
+ # pkg:gem/prism#lib/prism/dsl.rb:987
+ sig { returns(Prism::Source) }
+ def default_source; end
+end
+
+# Represents a method definition.
+#
+# def method
+# end
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6293
+class Prism::DefNode < ::Prism::Node
+ # Initialize a new DefNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6295
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ receiver: T.nilable(Prism::Node),
+ parameters: T.nilable(Prism::ParametersNode),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ locals: T::Array[Symbol],
+ def_keyword_loc: Prism::Location,
+ operator_loc: T.nilable(Prism::Location),
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location),
+ equal_loc: T.nilable(Prism::Location),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, receiver, parameters, body, locals, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6543
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6315
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader body: StatementsNode | BeginNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6383
+ sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6320
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6343
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6334
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?receiver: Prism::node?, ?parameters: ParametersNode?, ?body: StatementsNode | BeginNode | nil, ?locals: Array[Symbol], ?def_keyword_loc: Location, ?operator_loc: Location?, ?lparen_loc: Location?, ?rparen_loc: Location?, ?equal_loc: Location?, ?end_keyword_loc: Location?) -> DefNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6348
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ receiver: T.nilable(Prism::Node),
+ parameters: T.nilable(Prism::ParametersNode),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ locals: T::Array[Symbol],
+ def_keyword_loc: Prism::Location,
+ operator_loc: T.nilable(Prism::Location),
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location),
+ equal_loc: T.nilable(Prism::Location),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::DefNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, receiver: self.receiver, parameters: self.parameters, body: self.body, locals: self.locals, def_keyword_loc: self.def_keyword_loc, operator_loc: self.operator_loc, lparen_loc: self.lparen_loc, rparen_loc: self.rparen_loc, equal_loc: self.equal_loc, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6353
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, receiver: Prism::node?, parameters: ParametersNode?, body: StatementsNode | BeginNode | nil, locals: Array[Symbol], def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6356
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def def_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6497
+ sig { returns(String) }
+ def def_keyword; end
+
+ # attr_reader def_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6389
+ sig { returns(Prism::Location) }
+ def def_keyword_loc; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6325
+ def each_child_node; end
+
+ # def end_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6522
+ sig { returns(T.nilable(String)) }
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6478
+ sig { returns(T.nilable(Prism::Location)) }
+ def end_keyword_loc; end
+
+ # def equal: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6517
+ sig { returns(T.nilable(String)) }
+ def equal; end
+
+ # attr_reader equal_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6459
+ sig { returns(T.nilable(Prism::Location)) }
+ def equal_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6527
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6386
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # def lparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6507
+ sig { returns(T.nilable(String)) }
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6421
+ sig { returns(T.nilable(Prism::Location)) }
+ def lparen_loc; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6361
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6364
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6502
+ sig { returns(T.nilable(String)) }
+ def operator; end
+
+ # attr_reader operator_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6402
+ sig { returns(T.nilable(Prism::Location)) }
+ def operator_loc; end
+
+ # attr_reader parameters: ParametersNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6380
+ sig { returns(T.nilable(Prism::ParametersNode)) }
+ def parameters; end
+
+ # attr_reader receiver: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6377
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def rparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6512
+ sig { returns(T.nilable(String)) }
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6440
+ sig { returns(T.nilable(Prism::Location)) }
+ def rparen_loc; end
+
+ # Save the def_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6397
+ def save_def_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6492
+ def save_end_keyword_loc(repository); end
+
+ # Save the equal_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6473
+ def save_equal_loc(repository); end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6435
+ def save_lparen_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6372
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6416
+ def save_operator_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6454
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6532
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6537
+ def type; end
+ end
+end
+
+# Represents the use of the `defined?` keyword.
+#
+# defined?(a)
+# ^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6565
+class Prism::DefinedNode < ::Prism::Node
+ # Initialize a new DefinedNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6567
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lparen_loc: T.nilable(Prism::Location),
+ value: Prism::Node,
+ rparen_loc: T.nilable(Prism::Location),
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, lparen_loc, value, rparen_loc, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6704
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6579
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6584
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6601
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6596
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lparen_loc: Location?, ?value: Prism::node, ?rparen_loc: Location?, ?keyword_loc: Location) -> DefinedNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6606
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lparen_loc: T.nilable(Prism::Location),
+ value: Prism::Node,
+ rparen_loc: T.nilable(Prism::Location),
+ keyword_loc: Prism::Location
+ ).returns(Prism::DefinedNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, lparen_loc: self.lparen_loc, value: self.value, rparen_loc: self.rparen_loc, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6611
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lparen_loc: Location?, value: Prism::node, rparen_loc: Location?, keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6614
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6589
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6688
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6683
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6660
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def lparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6673
+ sig { returns(T.nilable(String)) }
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6619
+ sig { returns(T.nilable(Prism::Location)) }
+ def lparen_loc; end
+
+ # def rparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6678
+ sig { returns(T.nilable(String)) }
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6641
+ sig { returns(T.nilable(Prism::Location)) }
+ def rparen_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6668
+ def save_keyword_loc(repository); end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6633
+ def save_lparen_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6655
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6693
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6638
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6698
+ def type; end
+ end
+end
+
+# pkg:gem/prism#lib/prism/desugar_compiler.rb:5
+class Prism::DesugarAndWriteNode
+ include ::Prism::DSL
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:10
+ def initialize(node, default_source, read_class, write_class, **arguments); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:8
+ def arguments; end
+
+ # Desugar `x &&= y` to `x && x = y`
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:19
+ def compile; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:8
+ def default_source; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:8
+ def node; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:8
+ def read_class; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:8
+ def write_class; end
+end
+
+# DesugarCompiler is a compiler that desugars Ruby code into a more primitive
+# form. This is useful for consumers that want to deal with fewer node types.
+#
+# pkg:gem/prism#lib/prism/desugar_compiler.rb:256
+class Prism::DesugarCompiler < ::Prism::MutationCompiler
+ # @@foo &&= bar
+ #
+ # becomes
+ #
+ # @@foo && @@foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:262
+ def visit_class_variable_and_write_node(node); end
+
+ # @@foo += bar
+ #
+ # becomes
+ #
+ # @@foo = @@foo + bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:280
+ def visit_class_variable_operator_write_node(node); end
+
+ # @@foo ||= bar
+ #
+ # becomes
+ #
+ # defined?(@@foo) ? @@foo : @@foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:271
+ def visit_class_variable_or_write_node(node); end
+
+ # Foo &&= bar
+ #
+ # becomes
+ #
+ # Foo && Foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:289
+ def visit_constant_and_write_node(node); end
+
+ # Foo += bar
+ #
+ # becomes
+ #
+ # Foo = Foo + bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:307
+ def visit_constant_operator_write_node(node); end
+
+ # Foo ||= bar
+ #
+ # becomes
+ #
+ # defined?(Foo) ? Foo : Foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:298
+ def visit_constant_or_write_node(node); end
+
+ # $foo &&= bar
+ #
+ # becomes
+ #
+ # $foo && $foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:316
+ def visit_global_variable_and_write_node(node); end
+
+ # $foo += bar
+ #
+ # becomes
+ #
+ # $foo = $foo + bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:334
+ def visit_global_variable_operator_write_node(node); end
+
+ # $foo ||= bar
+ #
+ # becomes
+ #
+ # defined?($foo) ? $foo : $foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:325
+ def visit_global_variable_or_write_node(node); end
+
+ # @foo &&= bar
+ #
+ # becomes
+ #
+ # @foo && @foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:343
+ def visit_instance_variable_and_write_node(node); end
+
+ # @foo += bar
+ #
+ # becomes
+ #
+ # @foo = @foo + bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:361
+ def visit_instance_variable_operator_write_node(node); end
+
+ # @foo ||= bar
+ #
+ # becomes
+ #
+ # @foo || @foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:352
+ def visit_instance_variable_or_write_node(node); end
+
+ # foo &&= bar
+ #
+ # becomes
+ #
+ # foo && foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:370
+ def visit_local_variable_and_write_node(node); end
+
+ # foo += bar
+ #
+ # becomes
+ #
+ # foo = foo + bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:388
+ def visit_local_variable_operator_write_node(node); end
+
+ # foo ||= bar
+ #
+ # becomes
+ #
+ # foo || foo = bar
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:379
+ def visit_local_variable_or_write_node(node); end
+end
+
+# pkg:gem/prism#lib/prism/desugar_compiler.rb:87
+class Prism::DesugarOperatorWriteNode
+ include ::Prism::DSL
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:92
+ def initialize(node, default_source, read_class, write_class, **arguments); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:90
+ def arguments; end
+
+ # Desugar `x += y` to `x = x + y`
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:101
+ def compile; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:90
+ def default_source; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:90
+ def node; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:90
+ def read_class; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:90
+ def write_class; end
+end
+
+# pkg:gem/prism#lib/prism/desugar_compiler.rb:36
+class Prism::DesugarOrWriteDefinedNode
+ include ::Prism::DSL
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:41
+ def initialize(node, default_source, read_class, write_class, **arguments); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:39
+ def arguments; end
+
+ # Desugar `x ||= y` to `defined?(x) ? x : x = y`
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:50
+ def compile; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:39
+ def default_source; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:39
+ def node; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:39
+ def read_class; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:39
+ def write_class; end
+end
+
+# pkg:gem/prism#lib/prism/desugar_compiler.rb:131
+class Prism::DesugarOrWriteNode
+ include ::Prism::DSL
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:136
+ def initialize(node, default_source, read_class, write_class, **arguments); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:134
+ def arguments; end
+
+ # Desugar `x ||= y` to `x || x = y`
+ #
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:145
+ def compile; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:134
+ def default_source; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:134
+ def node; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:134
+ def read_class; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:134
+ def write_class; end
+end
+
+# The dispatcher class fires events for nodes that are found while walking an
+# AST to all registered listeners. It's useful for performing different types
+# of analysis on the AST while only having to walk the tree once.
+#
+# To use the dispatcher, you would first instantiate it and register listeners
+# for the events you're interested in:
+#
+# class OctalListener
+# def on_integer_node_enter(node)
+# if node.octal? && !node.slice.start_with?("0o")
+# warn("Octal integers should be written with the 0o prefix")
+# end
+# end
+# end
+#
+# listener = OctalListener.new
+# dispatcher = Prism::Dispatcher.new
+# dispatcher.register(listener, :on_integer_node_enter)
+#
+# Then, you can walk any number of trees and dispatch events to the listeners:
+#
+# result = Prism.parse("001 + 002 + 003")
+# dispatcher.dispatch(result.value)
+#
+# Optionally, you can also use `#dispatch_once` to dispatch enter and leave
+# events for a single node without recursing further down the tree. This can
+# be useful in circumstances where you want to reuse the listeners you already
+# have registers but want to stop walking the tree at a certain point.
+#
+# integer = result.value.statements.body.first.receiver.receiver
+# dispatcher.dispatch_once(integer)
+#
+# pkg:gem/prism#lib/prism/dispatcher.rb:45
+class Prism::Dispatcher < ::Prism::Visitor
+ # Initialize a new dispatcher.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:50
+ def initialize; end
+
+ # Walks `root` dispatching events to all registered listeners.
+ #
+ # def dispatch: (Node) -> void
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:77
+ def dispatch(node); end
+
+ # Dispatches a single event for `node` to all registered listeners.
+ #
+ # def dispatch_once: (Node) -> void
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:82
+ def dispatch_once(node); end
+
+ # attr_reader listeners: Hash[Symbol, Array[Listener]]
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:47
+ def listeners; end
+
+ # Register a listener for one or more events.
+ #
+ # def register: (Listener, *Symbol) -> void
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:57
+ def register(listener, *events); end
+
+ # Register all public methods of a listener that match the pattern
+ # `on__(enter|leave)`.
+ #
+ # def register_public_methods: (Listener) -> void
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:65
+ def register_public_methods(listener); end
+
+ # Dispatch enter and leave events for AliasGlobalVariableNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:88
+ def visit_alias_global_variable_node(node); end
+
+ # Dispatch enter and leave events for AliasMethodNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:96
+ def visit_alias_method_node(node); end
+
+ # Dispatch enter and leave events for AlternationPatternNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:104
+ def visit_alternation_pattern_node(node); end
+
+ # Dispatch enter and leave events for AndNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:112
+ def visit_and_node(node); end
+
+ # Dispatch enter and leave events for ArgumentsNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:120
+ def visit_arguments_node(node); end
+
+ # Dispatch enter and leave events for ArrayNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:128
+ def visit_array_node(node); end
+
+ # Dispatch enter and leave events for ArrayPatternNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:136
+ def visit_array_pattern_node(node); end
+
+ # Dispatch enter and leave events for AssocNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:144
+ def visit_assoc_node(node); end
+
+ # Dispatch enter and leave events for AssocSplatNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:152
+ def visit_assoc_splat_node(node); end
+
+ # Dispatch enter and leave events for BackReferenceReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:160
+ def visit_back_reference_read_node(node); end
+
+ # Dispatch enter and leave events for BeginNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:168
+ def visit_begin_node(node); end
+
+ # Dispatch enter and leave events for BlockArgumentNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:176
+ def visit_block_argument_node(node); end
+
+ # Dispatch enter and leave events for BlockLocalVariableNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:184
+ def visit_block_local_variable_node(node); end
+
+ # Dispatch enter and leave events for BlockNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:192
+ def visit_block_node(node); end
+
+ # Dispatch enter and leave events for BlockParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:200
+ def visit_block_parameter_node(node); end
+
+ # Dispatch enter and leave events for BlockParametersNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:208
+ def visit_block_parameters_node(node); end
+
+ # Dispatch enter and leave events for BreakNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:216
+ def visit_break_node(node); end
+
+ # Dispatch enter and leave events for CallAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:224
+ def visit_call_and_write_node(node); end
+
+ # Dispatch enter and leave events for CallNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:232
+ def visit_call_node(node); end
+
+ # Dispatch enter and leave events for CallOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:240
+ def visit_call_operator_write_node(node); end
+
+ # Dispatch enter and leave events for CallOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:248
+ def visit_call_or_write_node(node); end
+
+ # Dispatch enter and leave events for CallTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:256
+ def visit_call_target_node(node); end
+
+ # Dispatch enter and leave events for CapturePatternNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:264
+ def visit_capture_pattern_node(node); end
+
+ # Dispatch enter and leave events for CaseMatchNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:272
+ def visit_case_match_node(node); end
+
+ # Dispatch enter and leave events for CaseNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:280
+ def visit_case_node(node); end
+
+ # Dispatch enter and leave events for ClassNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:288
+ def visit_class_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:296
+ def visit_class_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:304
+ def visit_class_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:312
+ def visit_class_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:320
+ def visit_class_variable_read_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:328
+ def visit_class_variable_target_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:336
+ def visit_class_variable_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:344
+ def visit_constant_and_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:352
+ def visit_constant_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:360
+ def visit_constant_or_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:368
+ def visit_constant_path_and_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:376
+ def visit_constant_path_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:384
+ def visit_constant_path_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:392
+ def visit_constant_path_or_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:400
+ def visit_constant_path_target_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:408
+ def visit_constant_path_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:416
+ def visit_constant_read_node(node); end
+
+ # Dispatch enter and leave events for ConstantTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:424
+ def visit_constant_target_node(node); end
+
+ # Dispatch enter and leave events for ConstantWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:432
+ def visit_constant_write_node(node); end
+
+ # Dispatch enter and leave events for DefNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:440
+ def visit_def_node(node); end
+
+ # Dispatch enter and leave events for DefinedNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:448
+ def visit_defined_node(node); end
+
+ # Dispatch enter and leave events for ElseNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:456
+ def visit_else_node(node); end
+
+ # Dispatch enter and leave events for EmbeddedStatementsNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:464
+ def visit_embedded_statements_node(node); end
+
+ # Dispatch enter and leave events for EmbeddedVariableNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:472
+ def visit_embedded_variable_node(node); end
+
+ # Dispatch enter and leave events for EnsureNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:480
+ def visit_ensure_node(node); end
+
+ # Dispatch enter and leave events for FalseNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:488
+ def visit_false_node(node); end
+
+ # Dispatch enter and leave events for FindPatternNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:496
+ def visit_find_pattern_node(node); end
+
+ # Dispatch enter and leave events for FlipFlopNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:504
+ def visit_flip_flop_node(node); end
+
+ # Dispatch enter and leave events for FloatNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:512
+ def visit_float_node(node); end
+
+ # Dispatch enter and leave events for ForNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:520
+ def visit_for_node(node); end
+
+ # Dispatch enter and leave events for ForwardingArgumentsNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:528
+ def visit_forwarding_arguments_node(node); end
+
+ # Dispatch enter and leave events for ForwardingParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:536
+ def visit_forwarding_parameter_node(node); end
+
+ # Dispatch enter and leave events for ForwardingSuperNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:544
+ def visit_forwarding_super_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:552
+ def visit_global_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:560
+ def visit_global_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:568
+ def visit_global_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:576
+ def visit_global_variable_read_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:584
+ def visit_global_variable_target_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:592
+ def visit_global_variable_write_node(node); end
+
+ # Dispatch enter and leave events for HashNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:600
+ def visit_hash_node(node); end
+
+ # Dispatch enter and leave events for HashPatternNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:608
+ def visit_hash_pattern_node(node); end
+
+ # Dispatch enter and leave events for IfNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:616
+ def visit_if_node(node); end
+
+ # Dispatch enter and leave events for ImaginaryNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:624
+ def visit_imaginary_node(node); end
+
+ # Dispatch enter and leave events for ImplicitNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:632
+ def visit_implicit_node(node); end
+
+ # Dispatch enter and leave events for ImplicitRestNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:640
+ def visit_implicit_rest_node(node); end
+
+ # Dispatch enter and leave events for InNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:648
+ def visit_in_node(node); end
+
+ # Dispatch enter and leave events for IndexAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:656
+ def visit_index_and_write_node(node); end
+
+ # Dispatch enter and leave events for IndexOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:664
+ def visit_index_operator_write_node(node); end
+
+ # Dispatch enter and leave events for IndexOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:672
+ def visit_index_or_write_node(node); end
+
+ # Dispatch enter and leave events for IndexTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:680
+ def visit_index_target_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:688
+ def visit_instance_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:696
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:704
+ def visit_instance_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:712
+ def visit_instance_variable_read_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:720
+ def visit_instance_variable_target_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:728
+ def visit_instance_variable_write_node(node); end
+
+ # Dispatch enter and leave events for IntegerNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:736
+ def visit_integer_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:744
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:752
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedStringNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:760
+ def visit_interpolated_string_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedSymbolNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:768
+ def visit_interpolated_symbol_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedXStringNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:776
+ def visit_interpolated_x_string_node(node); end
+
+ # Dispatch enter and leave events for ItLocalVariableReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:784
+ def visit_it_local_variable_read_node(node); end
+
+ # Dispatch enter and leave events for ItParametersNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:792
+ def visit_it_parameters_node(node); end
+
+ # Dispatch enter and leave events for KeywordHashNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:800
+ def visit_keyword_hash_node(node); end
+
+ # Dispatch enter and leave events for KeywordRestParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:808
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Dispatch enter and leave events for LambdaNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:816
+ def visit_lambda_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableAndWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:824
+ def visit_local_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:832
+ def visit_local_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableOrWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:840
+ def visit_local_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:848
+ def visit_local_variable_read_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:856
+ def visit_local_variable_target_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:864
+ def visit_local_variable_write_node(node); end
+
+ # Dispatch enter and leave events for MatchLastLineNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:872
+ def visit_match_last_line_node(node); end
+
+ # Dispatch enter and leave events for MatchPredicateNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:880
+ def visit_match_predicate_node(node); end
+
+ # Dispatch enter and leave events for MatchRequiredNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:888
+ def visit_match_required_node(node); end
+
+ # Dispatch enter and leave events for MatchWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:896
+ def visit_match_write_node(node); end
+
+ # Dispatch enter and leave events for MissingNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:904
+ def visit_missing_node(node); end
+
+ # Dispatch enter and leave events for ModuleNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:912
+ def visit_module_node(node); end
+
+ # Dispatch enter and leave events for MultiTargetNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:920
+ def visit_multi_target_node(node); end
+
+ # Dispatch enter and leave events for MultiWriteNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:928
+ def visit_multi_write_node(node); end
+
+ # Dispatch enter and leave events for NextNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:936
+ def visit_next_node(node); end
+
+ # Dispatch enter and leave events for NilNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:944
+ def visit_nil_node(node); end
+
+ # Dispatch enter and leave events for NoKeywordsParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:952
+ def visit_no_keywords_parameter_node(node); end
+
+ # Dispatch enter and leave events for NumberedParametersNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:960
+ def visit_numbered_parameters_node(node); end
+
+ # Dispatch enter and leave events for NumberedReferenceReadNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:968
+ def visit_numbered_reference_read_node(node); end
+
+ # Dispatch enter and leave events for OptionalKeywordParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:976
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Dispatch enter and leave events for OptionalParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:984
+ def visit_optional_parameter_node(node); end
+
+ # Dispatch enter and leave events for OrNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:992
+ def visit_or_node(node); end
+
+ # Dispatch enter and leave events for ParametersNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1000
+ def visit_parameters_node(node); end
+
+ # Dispatch enter and leave events for ParenthesesNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1008
+ def visit_parentheses_node(node); end
+
+ # Dispatch enter and leave events for PinnedExpressionNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1016
+ def visit_pinned_expression_node(node); end
+
+ # Dispatch enter and leave events for PinnedVariableNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1024
+ def visit_pinned_variable_node(node); end
+
+ # Dispatch enter and leave events for PostExecutionNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1032
+ def visit_post_execution_node(node); end
+
+ # Dispatch enter and leave events for PreExecutionNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1040
+ def visit_pre_execution_node(node); end
+
+ # Dispatch enter and leave events for ProgramNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1048
+ def visit_program_node(node); end
+
+ # Dispatch enter and leave events for RangeNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1056
+ def visit_range_node(node); end
+
+ # Dispatch enter and leave events for RationalNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1064
+ def visit_rational_node(node); end
+
+ # Dispatch enter and leave events for RedoNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1072
+ def visit_redo_node(node); end
+
+ # Dispatch enter and leave events for RegularExpressionNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1080
+ def visit_regular_expression_node(node); end
+
+ # Dispatch enter and leave events for RequiredKeywordParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1088
+ def visit_required_keyword_parameter_node(node); end
+
+ # Dispatch enter and leave events for RequiredParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1096
+ def visit_required_parameter_node(node); end
+
+ # Dispatch enter and leave events for RescueModifierNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1104
+ def visit_rescue_modifier_node(node); end
+
+ # Dispatch enter and leave events for RescueNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1112
+ def visit_rescue_node(node); end
+
+ # Dispatch enter and leave events for RestParameterNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1120
+ def visit_rest_parameter_node(node); end
+
+ # Dispatch enter and leave events for RetryNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1128
+ def visit_retry_node(node); end
+
+ # Dispatch enter and leave events for ReturnNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1136
+ def visit_return_node(node); end
+
+ # Dispatch enter and leave events for SelfNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1144
+ def visit_self_node(node); end
+
+ # Dispatch enter and leave events for ShareableConstantNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1152
+ def visit_shareable_constant_node(node); end
+
+ # Dispatch enter and leave events for SingletonClassNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1160
+ def visit_singleton_class_node(node); end
+
+ # Dispatch enter and leave events for SourceEncodingNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1168
+ def visit_source_encoding_node(node); end
+
+ # Dispatch enter and leave events for SourceFileNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1176
+ def visit_source_file_node(node); end
+
+ # Dispatch enter and leave events for SourceLineNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1184
+ def visit_source_line_node(node); end
+
+ # Dispatch enter and leave events for SplatNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1192
+ def visit_splat_node(node); end
+
+ # Dispatch enter and leave events for StatementsNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1200
+ def visit_statements_node(node); end
+
+ # Dispatch enter and leave events for StringNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1208
+ def visit_string_node(node); end
+
+ # Dispatch enter and leave events for SuperNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1216
+ def visit_super_node(node); end
+
+ # Dispatch enter and leave events for SymbolNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1224
+ def visit_symbol_node(node); end
+
+ # Dispatch enter and leave events for TrueNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1232
+ def visit_true_node(node); end
+
+ # Dispatch enter and leave events for UndefNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1240
+ def visit_undef_node(node); end
+
+ # Dispatch enter and leave events for UnlessNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1248
+ def visit_unless_node(node); end
+
+ # Dispatch enter and leave events for UntilNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1256
+ def visit_until_node(node); end
+
+ # Dispatch enter and leave events for WhenNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1264
+ def visit_when_node(node); end
+
+ # Dispatch enter and leave events for WhileNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1272
+ def visit_while_node(node); end
+
+ # Dispatch enter and leave events for XStringNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1280
+ def visit_x_string_node(node); end
+
+ # Dispatch enter and leave events for YieldNode nodes and continue
+ # walking the tree.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1288
+ def visit_yield_node(node); end
+
+ private
+
+ # Register a listener for the given events.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:70
+ def register_events(listener, events); end
+end
+
+# pkg:gem/prism#lib/prism/dispatcher.rb:1294
+class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1297
+ def initialize(listeners); end
+
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1295
+ def listeners; end
+
+ # Dispatch enter and leave events for AliasGlobalVariableNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1302
+ def visit_alias_global_variable_node(node); end
+
+ # Dispatch enter and leave events for AliasMethodNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1308
+ def visit_alias_method_node(node); end
+
+ # Dispatch enter and leave events for AlternationPatternNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1314
+ def visit_alternation_pattern_node(node); end
+
+ # Dispatch enter and leave events for AndNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1320
+ def visit_and_node(node); end
+
+ # Dispatch enter and leave events for ArgumentsNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1326
+ def visit_arguments_node(node); end
+
+ # Dispatch enter and leave events for ArrayNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1332
+ def visit_array_node(node); end
+
+ # Dispatch enter and leave events for ArrayPatternNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1338
+ def visit_array_pattern_node(node); end
+
+ # Dispatch enter and leave events for AssocNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1344
+ def visit_assoc_node(node); end
+
+ # Dispatch enter and leave events for AssocSplatNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1350
+ def visit_assoc_splat_node(node); end
+
+ # Dispatch enter and leave events for BackReferenceReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1356
+ def visit_back_reference_read_node(node); end
+
+ # Dispatch enter and leave events for BeginNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1362
+ def visit_begin_node(node); end
+
+ # Dispatch enter and leave events for BlockArgumentNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1368
+ def visit_block_argument_node(node); end
+
+ # Dispatch enter and leave events for BlockLocalVariableNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1374
+ def visit_block_local_variable_node(node); end
+
+ # Dispatch enter and leave events for BlockNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1380
+ def visit_block_node(node); end
+
+ # Dispatch enter and leave events for BlockParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1386
+ def visit_block_parameter_node(node); end
+
+ # Dispatch enter and leave events for BlockParametersNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1392
+ def visit_block_parameters_node(node); end
+
+ # Dispatch enter and leave events for BreakNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1398
+ def visit_break_node(node); end
+
+ # Dispatch enter and leave events for CallAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1404
+ def visit_call_and_write_node(node); end
+
+ # Dispatch enter and leave events for CallNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1410
+ def visit_call_node(node); end
+
+ # Dispatch enter and leave events for CallOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1416
+ def visit_call_operator_write_node(node); end
+
+ # Dispatch enter and leave events for CallOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1422
+ def visit_call_or_write_node(node); end
+
+ # Dispatch enter and leave events for CallTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1428
+ def visit_call_target_node(node); end
+
+ # Dispatch enter and leave events for CapturePatternNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1434
+ def visit_capture_pattern_node(node); end
+
+ # Dispatch enter and leave events for CaseMatchNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1440
+ def visit_case_match_node(node); end
+
+ # Dispatch enter and leave events for CaseNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1446
+ def visit_case_node(node); end
+
+ # Dispatch enter and leave events for ClassNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1452
+ def visit_class_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1458
+ def visit_class_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1464
+ def visit_class_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1470
+ def visit_class_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1476
+ def visit_class_variable_read_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1482
+ def visit_class_variable_target_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1488
+ def visit_class_variable_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1494
+ def visit_constant_and_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1500
+ def visit_constant_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1506
+ def visit_constant_or_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1512
+ def visit_constant_path_and_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1518
+ def visit_constant_path_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1524
+ def visit_constant_path_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1530
+ def visit_constant_path_or_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1536
+ def visit_constant_path_target_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1542
+ def visit_constant_path_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1548
+ def visit_constant_read_node(node); end
+
+ # Dispatch enter and leave events for ConstantTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1554
+ def visit_constant_target_node(node); end
+
+ # Dispatch enter and leave events for ConstantWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1560
+ def visit_constant_write_node(node); end
+
+ # Dispatch enter and leave events for DefNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1566
+ def visit_def_node(node); end
+
+ # Dispatch enter and leave events for DefinedNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1572
+ def visit_defined_node(node); end
+
+ # Dispatch enter and leave events for ElseNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1578
+ def visit_else_node(node); end
+
+ # Dispatch enter and leave events for EmbeddedStatementsNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1584
+ def visit_embedded_statements_node(node); end
+
+ # Dispatch enter and leave events for EmbeddedVariableNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1590
+ def visit_embedded_variable_node(node); end
+
+ # Dispatch enter and leave events for EnsureNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1596
+ def visit_ensure_node(node); end
+
+ # Dispatch enter and leave events for FalseNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1602
+ def visit_false_node(node); end
+
+ # Dispatch enter and leave events for FindPatternNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1608
+ def visit_find_pattern_node(node); end
+
+ # Dispatch enter and leave events for FlipFlopNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1614
+ def visit_flip_flop_node(node); end
+
+ # Dispatch enter and leave events for FloatNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1620
+ def visit_float_node(node); end
+
+ # Dispatch enter and leave events for ForNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1626
+ def visit_for_node(node); end
+
+ # Dispatch enter and leave events for ForwardingArgumentsNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1632
+ def visit_forwarding_arguments_node(node); end
+
+ # Dispatch enter and leave events for ForwardingParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1638
+ def visit_forwarding_parameter_node(node); end
+
+ # Dispatch enter and leave events for ForwardingSuperNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1644
+ def visit_forwarding_super_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1650
+ def visit_global_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1656
+ def visit_global_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1662
+ def visit_global_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1668
+ def visit_global_variable_read_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1674
+ def visit_global_variable_target_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1680
+ def visit_global_variable_write_node(node); end
+
+ # Dispatch enter and leave events for HashNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1686
+ def visit_hash_node(node); end
+
+ # Dispatch enter and leave events for HashPatternNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1692
+ def visit_hash_pattern_node(node); end
+
+ # Dispatch enter and leave events for IfNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1698
+ def visit_if_node(node); end
+
+ # Dispatch enter and leave events for ImaginaryNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1704
+ def visit_imaginary_node(node); end
+
+ # Dispatch enter and leave events for ImplicitNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1710
+ def visit_implicit_node(node); end
+
+ # Dispatch enter and leave events for ImplicitRestNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1716
+ def visit_implicit_rest_node(node); end
+
+ # Dispatch enter and leave events for InNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1722
+ def visit_in_node(node); end
+
+ # Dispatch enter and leave events for IndexAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1728
+ def visit_index_and_write_node(node); end
+
+ # Dispatch enter and leave events for IndexOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1734
+ def visit_index_operator_write_node(node); end
+
+ # Dispatch enter and leave events for IndexOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1740
+ def visit_index_or_write_node(node); end
+
+ # Dispatch enter and leave events for IndexTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1746
+ def visit_index_target_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1752
+ def visit_instance_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1758
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1764
+ def visit_instance_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1770
+ def visit_instance_variable_read_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1776
+ def visit_instance_variable_target_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1782
+ def visit_instance_variable_write_node(node); end
+
+ # Dispatch enter and leave events for IntegerNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1788
+ def visit_integer_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1794
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1800
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedStringNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1806
+ def visit_interpolated_string_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedSymbolNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1812
+ def visit_interpolated_symbol_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedXStringNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1818
+ def visit_interpolated_x_string_node(node); end
+
+ # Dispatch enter and leave events for ItLocalVariableReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1824
+ def visit_it_local_variable_read_node(node); end
+
+ # Dispatch enter and leave events for ItParametersNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1830
+ def visit_it_parameters_node(node); end
+
+ # Dispatch enter and leave events for KeywordHashNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1836
+ def visit_keyword_hash_node(node); end
+
+ # Dispatch enter and leave events for KeywordRestParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1842
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Dispatch enter and leave events for LambdaNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1848
+ def visit_lambda_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableAndWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1854
+ def visit_local_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1860
+ def visit_local_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableOrWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1866
+ def visit_local_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1872
+ def visit_local_variable_read_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1878
+ def visit_local_variable_target_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1884
+ def visit_local_variable_write_node(node); end
+
+ # Dispatch enter and leave events for MatchLastLineNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1890
+ def visit_match_last_line_node(node); end
+
+ # Dispatch enter and leave events for MatchPredicateNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1896
+ def visit_match_predicate_node(node); end
+
+ # Dispatch enter and leave events for MatchRequiredNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1902
+ def visit_match_required_node(node); end
+
+ # Dispatch enter and leave events for MatchWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1908
+ def visit_match_write_node(node); end
+
+ # Dispatch enter and leave events for MissingNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1914
+ def visit_missing_node(node); end
+
+ # Dispatch enter and leave events for ModuleNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1920
+ def visit_module_node(node); end
+
+ # Dispatch enter and leave events for MultiTargetNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1926
+ def visit_multi_target_node(node); end
+
+ # Dispatch enter and leave events for MultiWriteNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1932
+ def visit_multi_write_node(node); end
+
+ # Dispatch enter and leave events for NextNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1938
+ def visit_next_node(node); end
+
+ # Dispatch enter and leave events for NilNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1944
+ def visit_nil_node(node); end
+
+ # Dispatch enter and leave events for NoKeywordsParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1950
+ def visit_no_keywords_parameter_node(node); end
+
+ # Dispatch enter and leave events for NumberedParametersNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1956
+ def visit_numbered_parameters_node(node); end
+
+ # Dispatch enter and leave events for NumberedReferenceReadNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1962
+ def visit_numbered_reference_read_node(node); end
+
+ # Dispatch enter and leave events for OptionalKeywordParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1968
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Dispatch enter and leave events for OptionalParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1974
+ def visit_optional_parameter_node(node); end
+
+ # Dispatch enter and leave events for OrNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1980
+ def visit_or_node(node); end
+
+ # Dispatch enter and leave events for ParametersNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1986
+ def visit_parameters_node(node); end
+
+ # Dispatch enter and leave events for ParenthesesNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1992
+ def visit_parentheses_node(node); end
+
+ # Dispatch enter and leave events for PinnedExpressionNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:1998
+ def visit_pinned_expression_node(node); end
+
+ # Dispatch enter and leave events for PinnedVariableNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2004
+ def visit_pinned_variable_node(node); end
+
+ # Dispatch enter and leave events for PostExecutionNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2010
+ def visit_post_execution_node(node); end
+
+ # Dispatch enter and leave events for PreExecutionNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2016
+ def visit_pre_execution_node(node); end
+
+ # Dispatch enter and leave events for ProgramNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2022
+ def visit_program_node(node); end
+
+ # Dispatch enter and leave events for RangeNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2028
+ def visit_range_node(node); end
+
+ # Dispatch enter and leave events for RationalNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2034
+ def visit_rational_node(node); end
+
+ # Dispatch enter and leave events for RedoNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2040
+ def visit_redo_node(node); end
+
+ # Dispatch enter and leave events for RegularExpressionNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2046
+ def visit_regular_expression_node(node); end
+
+ # Dispatch enter and leave events for RequiredKeywordParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2052
+ def visit_required_keyword_parameter_node(node); end
+
+ # Dispatch enter and leave events for RequiredParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2058
+ def visit_required_parameter_node(node); end
+
+ # Dispatch enter and leave events for RescueModifierNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2064
+ def visit_rescue_modifier_node(node); end
+
+ # Dispatch enter and leave events for RescueNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2070
+ def visit_rescue_node(node); end
+
+ # Dispatch enter and leave events for RestParameterNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2076
+ def visit_rest_parameter_node(node); end
+
+ # Dispatch enter and leave events for RetryNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2082
+ def visit_retry_node(node); end
+
+ # Dispatch enter and leave events for ReturnNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2088
+ def visit_return_node(node); end
+
+ # Dispatch enter and leave events for SelfNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2094
+ def visit_self_node(node); end
+
+ # Dispatch enter and leave events for ShareableConstantNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2100
+ def visit_shareable_constant_node(node); end
+
+ # Dispatch enter and leave events for SingletonClassNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2106
+ def visit_singleton_class_node(node); end
+
+ # Dispatch enter and leave events for SourceEncodingNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2112
+ def visit_source_encoding_node(node); end
+
+ # Dispatch enter and leave events for SourceFileNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2118
+ def visit_source_file_node(node); end
+
+ # Dispatch enter and leave events for SourceLineNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2124
+ def visit_source_line_node(node); end
+
+ # Dispatch enter and leave events for SplatNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2130
+ def visit_splat_node(node); end
+
+ # Dispatch enter and leave events for StatementsNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2136
+ def visit_statements_node(node); end
+
+ # Dispatch enter and leave events for StringNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2142
+ def visit_string_node(node); end
+
+ # Dispatch enter and leave events for SuperNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2148
+ def visit_super_node(node); end
+
+ # Dispatch enter and leave events for SymbolNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2154
+ def visit_symbol_node(node); end
+
+ # Dispatch enter and leave events for TrueNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2160
+ def visit_true_node(node); end
+
+ # Dispatch enter and leave events for UndefNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2166
+ def visit_undef_node(node); end
+
+ # Dispatch enter and leave events for UnlessNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2172
+ def visit_unless_node(node); end
+
+ # Dispatch enter and leave events for UntilNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2178
+ def visit_until_node(node); end
+
+ # Dispatch enter and leave events for WhenNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2184
+ def visit_when_node(node); end
+
+ # Dispatch enter and leave events for WhileNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2190
+ def visit_while_node(node); end
+
+ # Dispatch enter and leave events for XStringNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2196
+ def visit_x_string_node(node); end
+
+ # Dispatch enter and leave events for YieldNode nodes.
+ #
+ # pkg:gem/prism#lib/prism/dispatcher.rb:2202
+ def visit_yield_node(node); end
+end
+
+# This visitor provides the ability to call Node#to_dot, which converts a
+# subtree into a graphviz dot graph.
+#
+# pkg:gem/prism#lib/prism/dot_visitor.rb:18
+class Prism::DotVisitor < ::Prism::Visitor
+ # Initialize a new dot visitor.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:110
+ def initialize; end
+
+ # The digraph that is being built.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:107
+ def digraph; end
+
+ # Convert this visitor into a graphviz dot graph string.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:115
+ def to_dot; end
+
+ # Visit a AliasGlobalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:120
+ def visit_alias_global_variable_node(node); end
+
+ # Visit a AliasMethodNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:145
+ def visit_alias_method_node(node); end
+
+ # Visit a AlternationPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:170
+ def visit_alternation_pattern_node(node); end
+
+ # Visit a AndNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:195
+ def visit_and_node(node); end
+
+ # Visit a ArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:220
+ def visit_arguments_node(node); end
+
+ # Visit a ArrayNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:250
+ def visit_array_node(node); end
+
+ # Visit a ArrayPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:290
+ def visit_array_pattern_node(node); end
+
+ # Visit a AssocNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:352
+ def visit_assoc_node(node); end
+
+ # Visit a AssocSplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:379
+ def visit_assoc_splat_node(node); end
+
+ # Visit a BackReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:402
+ def visit_back_reference_read_node(node); end
+
+ # Visit a BeginNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:419
+ def visit_begin_node(node); end
+
+ # Visit a BlockArgumentNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:467
+ def visit_block_argument_node(node); end
+
+ # Visit a BlockLocalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:490
+ def visit_block_local_variable_node(node); end
+
+ # Visit a BlockNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:510
+ def visit_block_node(node); end
+
+ # Visit a BlockParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:545
+ def visit_block_parameter_node(node); end
+
+ # Visit a BlockParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:573
+ def visit_block_parameters_node(node); end
+
+ # Visit a BreakNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:616
+ def visit_break_node(node); end
+
+ # Visit a CallAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:639
+ def visit_call_and_write_node(node); end
+
+ # Visit a CallNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:685
+ def visit_call_node(node); end
+
+ # Visit a CallOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:748
+ def visit_call_operator_write_node(node); end
+
+ # Visit a CallOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:797
+ def visit_call_or_write_node(node); end
+
+ # Visit a CallTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:843
+ def visit_call_target_node(node); end
+
+ # Visit a CapturePatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:873
+ def visit_capture_pattern_node(node); end
+
+ # Visit a CaseMatchNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:898
+ def visit_case_match_node(node); end
+
+ # Visit a CaseNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:943
+ def visit_case_node(node); end
+
+ # Visit a ClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:988
+ def visit_class_node(node); end
+
+ # Visit a ClassVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1035
+ def visit_class_variable_and_write_node(node); end
+
+ # Visit a ClassVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1062
+ def visit_class_variable_operator_write_node(node); end
+
+ # Visit a ClassVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1092
+ def visit_class_variable_or_write_node(node); end
+
+ # Visit a ClassVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1119
+ def visit_class_variable_read_node(node); end
+
+ # Visit a ClassVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1136
+ def visit_class_variable_target_node(node); end
+
+ # Visit a ClassVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1153
+ def visit_class_variable_write_node(node); end
+
+ # Visit a ConstantAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1180
+ def visit_constant_and_write_node(node); end
+
+ # Visit a ConstantOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1207
+ def visit_constant_operator_write_node(node); end
+
+ # Visit a ConstantOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1237
+ def visit_constant_or_write_node(node); end
+
+ # Visit a ConstantPathAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1264
+ def visit_constant_path_and_write_node(node); end
+
+ # Visit a ConstantPathNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1289
+ def visit_constant_path_node(node); end
+
+ # Visit a ConstantPathOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1318
+ def visit_constant_path_operator_write_node(node); end
+
+ # Visit a ConstantPathOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1346
+ def visit_constant_path_or_write_node(node); end
+
+ # Visit a ConstantPathTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1371
+ def visit_constant_path_target_node(node); end
+
+ # Visit a ConstantPathWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1400
+ def visit_constant_path_write_node(node); end
+
+ # Visit a ConstantReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1425
+ def visit_constant_read_node(node); end
+
+ # Visit a ConstantTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1442
+ def visit_constant_target_node(node); end
+
+ # Visit a ConstantWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1459
+ def visit_constant_write_node(node); end
+
+ # Visit a DefNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1486
+ def visit_def_node(node); end
+
+ # Visit a DefinedNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1555
+ def visit_defined_node(node); end
+
+ # Visit a ElseNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1586
+ def visit_else_node(node); end
+
+ # Visit a EmbeddedStatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1614
+ def visit_embedded_statements_node(node); end
+
+ # Visit a EmbeddedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1640
+ def visit_embedded_variable_node(node); end
+
+ # Visit a EnsureNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1661
+ def visit_ensure_node(node); end
+
+ # Visit a FalseNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1687
+ def visit_false_node(node); end
+
+ # Visit a FindPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1701
+ def visit_find_pattern_node(node); end
+
+ # Visit a FlipFlopNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1752
+ def visit_flip_flop_node(node); end
+
+ # Visit a FloatNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1784
+ def visit_float_node(node); end
+
+ # Visit a ForNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1801
+ def visit_for_node(node); end
+
+ # Visit a ForwardingArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1843
+ def visit_forwarding_arguments_node(node); end
+
+ # Visit a ForwardingParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1857
+ def visit_forwarding_parameter_node(node); end
+
+ # Visit a ForwardingSuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1871
+ def visit_forwarding_super_node(node); end
+
+ # Visit a GlobalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1891
+ def visit_global_variable_and_write_node(node); end
+
+ # Visit a GlobalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1918
+ def visit_global_variable_operator_write_node(node); end
+
+ # Visit a GlobalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1948
+ def visit_global_variable_or_write_node(node); end
+
+ # Visit a GlobalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1975
+ def visit_global_variable_read_node(node); end
+
+ # Visit a GlobalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:1992
+ def visit_global_variable_target_node(node); end
+
+ # Visit a GlobalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2009
+ def visit_global_variable_write_node(node); end
+
+ # Visit a HashNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2036
+ def visit_hash_node(node); end
+
+ # Visit a HashPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2069
+ def visit_hash_pattern_node(node); end
+
+ # Visit a IfNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2118
+ def visit_if_node(node); end
+
+ # Visit a ImaginaryNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2163
+ def visit_imaginary_node(node); end
+
+ # Visit a ImplicitNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2181
+ def visit_implicit_node(node); end
+
+ # Visit a ImplicitRestNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2199
+ def visit_implicit_rest_node(node); end
+
+ # Visit a InNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2213
+ def visit_in_node(node); end
+
+ # Visit a IndexAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2245
+ def visit_index_and_write_node(node); end
+
+ # Visit a IndexOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2298
+ def visit_index_operator_write_node(node); end
+
+ # Visit a IndexOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2354
+ def visit_index_or_write_node(node); end
+
+ # Visit a IndexTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2407
+ def visit_index_target_node(node); end
+
+ # Visit a InstanceVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2446
+ def visit_instance_variable_and_write_node(node); end
+
+ # Visit a InstanceVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2473
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Visit a InstanceVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2503
+ def visit_instance_variable_or_write_node(node); end
+
+ # Visit a InstanceVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2530
+ def visit_instance_variable_read_node(node); end
+
+ # Visit a InstanceVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2547
+ def visit_instance_variable_target_node(node); end
+
+ # Visit a InstanceVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2564
+ def visit_instance_variable_write_node(node); end
+
+ # Visit a IntegerNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2591
+ def visit_integer_node(node); end
+
+ # Visit a InterpolatedMatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2611
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Visit a InterpolatedRegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2647
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Visit a InterpolatedStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2683
+ def visit_interpolated_string_node(node); end
+
+ # Visit a InterpolatedSymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2723
+ def visit_interpolated_symbol_node(node); end
+
+ # Visit a InterpolatedXStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2760
+ def visit_interpolated_x_string_node(node); end
+
+ # Visit a ItLocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2793
+ def visit_it_local_variable_read_node(node); end
+
+ # Visit a ItParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2807
+ def visit_it_parameters_node(node); end
+
+ # Visit a KeywordHashNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2821
+ def visit_keyword_hash_node(node); end
+
+ # Visit a KeywordRestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2851
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Visit a LambdaNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2879
+ def visit_lambda_node(node); end
+
+ # Visit a LocalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2917
+ def visit_local_variable_and_write_node(node); end
+
+ # Visit a LocalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2947
+ def visit_local_variable_operator_write_node(node); end
+
+ # Visit a LocalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:2980
+ def visit_local_variable_or_write_node(node); end
+
+ # Visit a LocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3010
+ def visit_local_variable_read_node(node); end
+
+ # Visit a LocalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3030
+ def visit_local_variable_target_node(node); end
+
+ # Visit a LocalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3050
+ def visit_local_variable_write_node(node); end
+
+ # Visit a MatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3080
+ def visit_match_last_line_node(node); end
+
+ # Visit a MatchPredicateNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3109
+ def visit_match_predicate_node(node); end
+
+ # Visit a MatchRequiredNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3134
+ def visit_match_required_node(node); end
+
+ # Visit a MatchWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3159
+ def visit_match_write_node(node); end
+
+ # Visit a MissingNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3190
+ def visit_missing_node(node); end
+
+ # Visit a ModuleNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3204
+ def visit_module_node(node); end
+
+ # Visit a MultiTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3240
+ def visit_multi_target_node(node); end
+
+ # Visit a MultiWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3296
+ def visit_multi_write_node(node); end
+
+ # Visit a NextNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3359
+ def visit_next_node(node); end
+
+ # Visit a NilNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3382
+ def visit_nil_node(node); end
+
+ # Visit a NoKeywordsParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3396
+ def visit_no_keywords_parameter_node(node); end
+
+ # Visit a NumberedParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3416
+ def visit_numbered_parameters_node(node); end
+
+ # Visit a NumberedReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3433
+ def visit_numbered_reference_read_node(node); end
+
+ # Visit a OptionalKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3450
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Visit a OptionalParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3477
+ def visit_optional_parameter_node(node); end
+
+ # Visit a OrNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3507
+ def visit_or_node(node); end
+
+ # Visit a ParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3532
+ def visit_parameters_node(node); end
+
+ # Visit a ParenthesesNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3616
+ def visit_parentheses_node(node); end
+
+ # Visit a PinnedExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3645
+ def visit_pinned_expression_node(node); end
+
+ # Visit a PinnedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3672
+ def visit_pinned_variable_node(node); end
+
+ # Visit a PostExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3693
+ def visit_post_execution_node(node); end
+
+ # Visit a PreExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3722
+ def visit_pre_execution_node(node); end
+
+ # Visit a ProgramNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3751
+ def visit_program_node(node); end
+
+ # Visit a RangeNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3772
+ def visit_range_node(node); end
+
+ # Visit a RationalNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3804
+ def visit_rational_node(node); end
+
+ # Visit a RedoNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3827
+ def visit_redo_node(node); end
+
+ # Visit a RegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3841
+ def visit_regular_expression_node(node); end
+
+ # Visit a RequiredKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3870
+ def visit_required_keyword_parameter_node(node); end
+
+ # Visit a RequiredParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3893
+ def visit_required_parameter_node(node); end
+
+ # Visit a RescueModifierNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3913
+ def visit_rescue_modifier_node(node); end
+
+ # Visit a RescueNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3938
+ def visit_rescue_node(node); end
+
+ # Visit a RestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:3996
+ def visit_rest_parameter_node(node); end
+
+ # Visit a RetryNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4024
+ def visit_retry_node(node); end
+
+ # Visit a ReturnNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4038
+ def visit_return_node(node); end
+
+ # Visit a SelfNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4061
+ def visit_self_node(node); end
+
+ # Visit a ShareableConstantNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4075
+ def visit_shareable_constant_node(node); end
+
+ # Visit a SingletonClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4096
+ def visit_singleton_class_node(node); end
+
+ # Visit a SourceEncodingNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4132
+ def visit_source_encoding_node(node); end
+
+ # Visit a SourceFileNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4146
+ def visit_source_file_node(node); end
+
+ # Visit a SourceLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4166
+ def visit_source_line_node(node); end
+
+ # Visit a SplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4180
+ def visit_splat_node(node); end
+
+ # Visit a StatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4203
+ def visit_statements_node(node); end
+
+ # Visit a StringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4230
+ def visit_string_node(node); end
+
+ # Visit a SuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4263
+ def visit_super_node(node); end
+
+ # Visit a SymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4302
+ def visit_symbol_node(node); end
+
+ # Visit a TrueNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4337
+ def visit_true_node(node); end
+
+ # Visit a UndefNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4351
+ def visit_undef_node(node); end
+
+ # Visit a UnlessNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4381
+ def visit_unless_node(node); end
+
+ # Visit a UntilNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4424
+ def visit_until_node(node); end
+
+ # Visit a WhenNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4464
+ def visit_when_node(node); end
+
+ # Visit a WhileNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4505
+ def visit_while_node(node); end
+
+ # Visit a XStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4545
+ def visit_x_string_node(node); end
+
+ # Visit a YieldNode node.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4574
+ def visit_yield_node(node); end
+
+ private
+
+ # Inspect a node that has arguments_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4620
+ def arguments_node_flags_inspect(node); end
+
+ # Inspect a node that has array_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4632
+ def array_node_flags_inspect(node); end
+
+ # Inspect a node that has call_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4640
+ def call_node_flags_inspect(node); end
+
+ # Inspect a node that has encoding_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4651
+ def encoding_flags_inspect(node); end
+
+ # Inspect a node that has integer_base_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4660
+ def integer_base_flags_inspect(node); end
+
+ # Inspect a node that has interpolated_string_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4671
+ def interpolated_string_node_flags_inspect(node); end
+
+ # Inspect a node that has keyword_hash_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4680
+ def keyword_hash_node_flags_inspect(node); end
+
+ # Inspect a location to display the start and end line and column numbers.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4614
+ def location_inspect(location); end
+
+ # Inspect a node that has loop_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4688
+ def loop_flags_inspect(node); end
+
+ # Generate a unique node ID for a node throughout the digraph.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4609
+ def node_id(node); end
+
+ # Inspect a node that has parameter_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4696
+ def parameter_flags_inspect(node); end
+
+ # Inspect a node that has parentheses_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4704
+ def parentheses_node_flags_inspect(node); end
+
+ # Inspect a node that has range_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4712
+ def range_flags_inspect(node); end
+
+ # Inspect a node that has regular_expression_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4720
+ def regular_expression_flags_inspect(node); end
+
+ # Inspect a node that has shareable_constant_node_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4738
+ def shareable_constant_node_flags_inspect(node); end
+
+ # Inspect a node that has string_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4748
+ def string_flags_inspect(node); end
+
+ # Inspect a node that has symbol_flags flags to display the flags as a
+ # comma-separated list.
+ #
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:4759
+ def symbol_flags_inspect(node); end
+end
+
+# pkg:gem/prism#lib/prism/dot_visitor.rb:63
+class Prism::DotVisitor::Digraph
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:66
+ def initialize; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:80
+ def edge(value); end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:64
+ def edges; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:72
+ def node(value); end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:64
+ def nodes; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:84
+ def to_dot; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:76
+ def waypoint(value); end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:64
+ def waypoints; end
+end
+
+# pkg:gem/prism#lib/prism/dot_visitor.rb:19
+class Prism::DotVisitor::Field
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:22
+ def initialize(name, value, port); end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:20
+ def name; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:20
+ def port; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:28
+ def to_dot; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:20
+ def value; end
+end
+
+# pkg:gem/prism#lib/prism/dot_visitor.rb:37
+class Prism::DotVisitor::Table
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:40
+ def initialize(name); end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:45
+ def field(name, value = T.unsafe(nil), port: T.unsafe(nil)); end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:38
+ def fields; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:38
+ def name; end
+
+ # pkg:gem/prism#lib/prism/dot_visitor.rb:49
+ def to_dot; end
+end
+
+# Represents an `else` clause in a `case`, `if`, or `unless` statement.
+#
+# if a then b else c end
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6717
+class Prism::ElseNode < ::Prism::Node
+ # Initialize a new ElseNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6719
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ else_keyword_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, else_keyword_loc, statements, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6833
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6730
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6735
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6754
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6747
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?else_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location?) -> ElseNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6759
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ else_keyword_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::ElseNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, else_keyword_loc: self.else_keyword_loc, statements: self.statements, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6764
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6767
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6740
+ def each_child_node; end
+
+ # def else_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6807
+ sig { returns(String) }
+ def else_keyword; end
+
+ # attr_reader else_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6772
+ sig { returns(Prism::Location) }
+ def else_keyword_loc; end
+
+ # def end_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6812
+ sig { returns(T.nilable(String)) }
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6788
+ sig { returns(T.nilable(Prism::Location)) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6817
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Save the else_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6780
+ def save_else_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6802
+ def save_end_keyword_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6785
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6822
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6827
+ def type; end
+ end
+end
+
+# EmbDocComment objects correspond to comments that are surrounded by =begin
+# and =end.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:558
+class Prism::EmbDocComment < ::Prism::Comment
+ # Returns a string representation of this comment.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:565
+ sig { returns(String) }
+ def inspect; end
+
+ # This can only be true for inline comments.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:560
+ sig { override.returns(T::Boolean) }
+ def trailing?; end
+end
+
+# Represents an interpolated set of statements.
+#
+# "foo #{bar}"
+# ^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6845
+class Prism::EmbeddedStatementsNode < ::Prism::Node
+ # Initialize a new EmbeddedStatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6847
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, statements, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6955
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6858
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6863
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6934
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6916
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6882
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6875
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?statements: StatementsNode?, ?closing_loc: Location) -> EmbeddedStatementsNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6887
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ closing_loc: Prism::Location
+ ).returns(Prism::EmbeddedStatementsNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, statements: self.statements, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6892
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, statements: StatementsNode?, closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6895
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6868
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6939
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6929
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6900
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6924
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6908
+ def save_opening_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6913
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6944
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6949
+ def type; end
+ end
+end
+
+# Represents an interpolated variable.
+#
+# "foo #@bar"
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:6967
+class Prism::EmbeddedVariableNode < ::Prism::Node
+ # Initialize a new EmbeddedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6969
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ variable: T.any(Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, operator_loc, variable); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7056
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6979
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6984
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7001
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6996
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode) -> EmbeddedVariableNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7006
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ variable: T.any(Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)
+ ).returns(Prism::EmbeddedVariableNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, operator_loc: self.operator_loc, variable: self.variable); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7011
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7014
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:6989
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7040
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7035
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7019
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7027
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7045
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7032
+ sig do
+ returns(T.any(Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode))
+ end
+ def variable; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7050
+ def type; end
+ end
+end
+
+# Flags for nodes that have unescaped content.
+#
+# pkg:gem/prism#lib/prism/node.rb:19819
+module Prism::EncodingFlags; end
+
+# internal bytes forced the encoding to binary
+#
+# pkg:gem/prism#lib/prism/node.rb:19824
+Prism::EncodingFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to UTF-8
+#
+# pkg:gem/prism#lib/prism/node.rb:19821
+Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# Represents an `ensure` clause in a `begin` statement.
+#
+# begin
+# foo
+# ensure
+# ^^^^^^
+# bar
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:7071
+class Prism::EnsureNode < ::Prism::Node
+ # Initialize a new EnsureNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7073
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ ensure_keyword_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ end_keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, ensure_keyword_loc, statements, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7181
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7084
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7089
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7108
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7101
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?ensure_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location) -> EnsureNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7113
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ ensure_keyword_loc: Prism::Location,
+ statements: T.nilable(Prism::StatementsNode),
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::EnsureNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, ensure_keyword_loc: self.ensure_keyword_loc, statements: self.statements, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7118
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7121
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7094
+ def each_child_node; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7160
+ sig { returns(String) }
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7142
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ # def ensure_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7155
+ sig { returns(String) }
+ def ensure_keyword; end
+
+ # attr_reader ensure_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7126
+ sig { returns(Prism::Location) }
+ def ensure_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7165
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7150
+ def save_end_keyword_loc(repository); end
+
+ # Save the ensure_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7134
+ def save_ensure_keyword_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7139
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7170
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7175
+ def type; end
+ end
+end
+
+# Represents the use of the literal `false` keyword.
+#
+# false
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:7193
+class Prism::FalseNode < ::Prism::Node
+ # Initialize a new FalseNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7195
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7258
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7203
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7208
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7224
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7219
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> FalseNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7229
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::FalseNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7234
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7237
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7213
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7242
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7247
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7252
+ def type; end
+ end
+end
+
+# Represents a find pattern in pattern matching.
+#
+# foo in *bar, baz, *qux
+# ^^^^^^^^^^^^^^^
+#
+# foo in [*bar, baz, *qux]
+# ^^^^^^^^^^^^^^^^^
+#
+# foo in Foo(*bar, baz, *qux)
+# ^^^^^^^^^^^^^^^^^^^^
+#
+# foo => *bar, baz, *qux
+# ^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:7276
+class Prism::FindPatternNode < ::Prism::Node
+ # Initialize a new FindPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7278
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ left: Prism::SplatNode,
+ requireds: T::Array[Prism::Node],
+ right: T.any(Prism::SplatNode, Prism::MissingNode),
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, constant, left, requireds, right, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7449
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7292
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7297
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7428
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # The location of the closing brace.
+ #
+ # foo in [*bar, baz, *qux]
+ # ^
+ #
+ # foo in Foo(*bar, baz, *qux)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7404
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7322
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7312
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Represents the optional constant preceding the pattern
+ #
+ # foo in Foo(*bar, baz, *qux)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7343
+ sig { returns(T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode))) }
+ def constant; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantPathNode | ConstantReadNode | nil, ?left: SplatNode, ?requireds: Array[Prism::node], ?right: SplatNode | MissingNode, ?opening_loc: Location?, ?closing_loc: Location?) -> FindPatternNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7327
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ left: Prism::SplatNode,
+ requireds: T::Array[Prism::Node],
+ right: T.any(Prism::SplatNode, Prism::MissingNode),
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::FindPatternNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, constant: self.constant, left: self.left, requireds: self.requireds, right: self.right, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7332
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantPathNode | ConstantReadNode | nil, left: SplatNode, requireds: Array[Prism::node], right: SplatNode | MissingNode, opening_loc: Location?, closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7335
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7302
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7433
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the first wildcard node in the pattern.
+ #
+ # foo in *bar, baz, *qux
+ # ^^^^
+ #
+ # foo in Foo(*bar, baz, *qux)
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7352
+ sig { returns(Prism::SplatNode) }
+ def left; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7423
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # The location of the opening brace.
+ #
+ # foo in [*bar, baz, *qux]
+ # ^
+ #
+ # foo in Foo(*bar, baz, *qux)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7379
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Represents the nodes in between the wildcards.
+ #
+ # foo in *bar, baz, *qux
+ # ^^^
+ #
+ # foo in Foo(*bar, baz, 1, *qux)
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7361
+ sig { returns(T::Array[Prism::Node]) }
+ def requireds; end
+
+ # Represents the second wildcard node in the pattern.
+ #
+ # foo in *bar, baz, *qux
+ # ^^^^
+ #
+ # foo in Foo(*bar, baz, *qux)
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7370
+ sig { returns(T.any(Prism::SplatNode, Prism::MissingNode)) }
+ def right; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7418
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7393
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7438
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7443
+ def type; end
+ end
+end
+
+# Represents the use of the `..` or `...` operators to create flip flops.
+#
+# baz if foo .. bar
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:7465
+class Prism::FlipFlopNode < ::Prism::Node
+ # Initialize a new FlipFlopNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7467
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: T.nilable(Prism::Node),
+ right: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, left, right, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7567
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7478
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7483
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7504
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7496
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location) -> FlipFlopNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7509
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: T.nilable(Prism::Node),
+ right: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::FlipFlopNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7514
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node?, right: Prism::node?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7517
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7488
+ def each_child_node; end
+
+ # def exclude_end?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7522
+ sig { returns(T::Boolean) }
+ def exclude_end?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7551
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader left: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7527
+ sig { returns(T.nilable(Prism::Node)) }
+ def left; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7546
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7533
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # attr_reader right: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7530
+ sig { returns(T.nilable(Prism::Node)) }
+ def right; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7541
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7556
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7561
+ def type; end
+ end
+end
+
+# Represents a floating point number literal.
+#
+# 1.0
+# ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:7580
+class Prism::FloatNode < ::Prism::Node
+ # Initialize a new FloatNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7582
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, value: Float).void }
+ def initialize(source, node_id, location, flags, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7649
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7591
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7596
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7612
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7607
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Float) -> FloatNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7617
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer, value: Float).returns(Prism::FloatNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7622
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Float }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7625
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7601
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7633
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7638
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value of the floating point number as a Float.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7630
+ sig { returns(Float) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7643
+ def type; end
+ end
+end
+
+# Represents the use of the `for` keyword.
+#
+# for i in a end
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:7659
+class Prism::ForNode < ::Prism::Node
+ # Initialize a new ForNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7661
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ index: T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode),
+ collection: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode),
+ for_keyword_loc: Prism::Location,
+ in_keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ end_keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, index, collection, statements, for_keyword_loc, in_keyword_loc, do_keyword_loc, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7848
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7676
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7681
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # The collection to iterate over.
+ #
+ # for i in a end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7731
+ sig { returns(Prism::Node) }
+ def collection; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7704
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7695
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?index: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode, ?collection: Prism::node, ?statements: StatementsNode?, ?for_keyword_loc: Location, ?in_keyword_loc: Location, ?do_keyword_loc: Location?, ?end_keyword_loc: Location) -> ForNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7709
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ index: T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode),
+ collection: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode),
+ for_keyword_loc: Prism::Location,
+ in_keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::ForNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, index: self.index, collection: self.collection, statements: self.statements, for_keyword_loc: self.for_keyword_loc, in_keyword_loc: self.in_keyword_loc, do_keyword_loc: self.do_keyword_loc, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7714
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, index: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode, collection: Prism::node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7717
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def do_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7822
+ sig { returns(T.nilable(String)) }
+ def do_keyword; end
+
+ # The location of the `do` keyword, if present.
+ #
+ # for i in a do end
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7777
+ sig { returns(T.nilable(Prism::Location)) }
+ def do_keyword_loc; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7686
+ def each_child_node; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7827
+ sig { returns(String) }
+ def end_keyword; end
+
+ # The location of the `end` keyword.
+ #
+ # for i in a end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7799
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def for_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7812
+ sig { returns(String) }
+ def for_keyword; end
+
+ # The location of the `for` keyword.
+ #
+ # for i in a end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7745
+ sig { returns(Prism::Location) }
+ def for_keyword_loc; end
+
+ # def in_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7817
+ sig { returns(String) }
+ def in_keyword; end
+
+ # The location of the `in` keyword.
+ #
+ # for i in a end
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7761
+ sig { returns(Prism::Location) }
+ def in_keyword_loc; end
+
+ # The index expression for `for` loops.
+ #
+ # for i in a end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7725
+ sig do
+ returns(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode))
+ end
+ def index; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7832
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Save the do_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7791
+ def save_do_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7807
+ def save_end_keyword_loc(repository); end
+
+ # Save the for_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7753
+ def save_for_keyword_loc(repository); end
+
+ # Save the in_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7769
+ def save_in_keyword_loc(repository); end
+
+ # Represents the body of statements to execute for each iteration of the loop.
+ #
+ # for i in a
+ # foo(i)
+ # ^^^^^^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7739
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7837
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7842
+ def type; end
+ end
+end
+
+# Represents forwarding all arguments to this method to another method.
+#
+# def foo(...)
+# bar(...)
+# ^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:7866
+class Prism::ForwardingArgumentsNode < ::Prism::Node
+ # Initialize a new ForwardingArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7868
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7931
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7876
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7881
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7897
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7892
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ForwardingArgumentsNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7902
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ForwardingArgumentsNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7907
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7910
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7886
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7915
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7920
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7925
+ def type; end
+ end
+end
+
+# Represents the use of the forwarding parameter in a method, block, or lambda declaration.
+#
+# def foo(...)
+# ^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:7941
+class Prism::ForwardingParameterNode < ::Prism::Node
+ # Initialize a new ForwardingParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7943
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8006
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7951
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7956
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7972
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7967
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ForwardingParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7977
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ForwardingParameterNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7982
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7985
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7961
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7990
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:7995
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8000
+ def type; end
+ end
+end
+
+# Represents the use of the `super` keyword without parentheses or arguments, but which might have a block.
+#
+# super
+# ^^^^^
+#
+# super { 123 }
+# ^^^^^^^^^^^^^
+#
+# If it has any other arguments, it would be a `SuperNode` instead.
+#
+# pkg:gem/prism#lib/prism/node.rb:8020
+class Prism::ForwardingSuperNode < ::Prism::Node
+ # Initialize a new ForwardingSuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8022
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ block: T.nilable(Prism::BlockNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, block); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8092
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8031
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # All other arguments are forwarded as normal, except the original block is replaced with the new block.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8073
+ sig { returns(T.nilable(Prism::BlockNode)) }
+ def block; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8036
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8055
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8048
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?block: BlockNode?) -> ForwardingSuperNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8060
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ block: T.nilable(Prism::BlockNode)
+ ).returns(Prism::ForwardingSuperNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, block: self.block); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8065
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, block: BlockNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8068
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8041
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8076
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8081
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8086
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator for assignment to a global variable.
+#
+# $target &&= value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8102
+class Prism::GlobalVariableAndWriteNode < ::Prism::Node
+ # Initialize a new GlobalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8104
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8209
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8116
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8121
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8138
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8133
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> GlobalVariableAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8143
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::GlobalVariableAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8148
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8151
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:201
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8126
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8193
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8156
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8159
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8188
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8172
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8167
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8180
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8198
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8185
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8203
+ def type; end
+ end
+end
+
+# Represents assigning to a global variable using an operator that isn't `=`.
+#
+# $target += value
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8222
+class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node
+ # Initialize a new GlobalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8224
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, binary_operator_loc, value, binary_operator); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8328
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8237
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8309
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8293
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8242
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8259
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8254
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> GlobalVariableOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8264
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::GlobalVariableOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, binary_operator: self.binary_operator); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8269
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8272
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:213
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8247
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8312
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8277
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8280
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:406
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:413
+ def operator_loc; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8301
+ def save_binary_operator_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8288
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8317
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8306
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8322
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a global variable.
+#
+# $target ||= value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8342
+class Prism::GlobalVariableOrWriteNode < ::Prism::Node
+ # Initialize a new GlobalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8344
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8449
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8356
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8361
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8378
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8373
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> GlobalVariableOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8383
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::GlobalVariableOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8388
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8391
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:207
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8366
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8433
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8396
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8399
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8428
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8412
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8407
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8420
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8438
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8425
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8443
+ def type; end
+ end
+end
+
+# Represents referencing a global variable.
+#
+# $foo
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8462
+class Prism::GlobalVariableReadNode < ::Prism::Node
+ # Initialize a new GlobalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8464
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8535
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8473
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8478
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8494
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8489
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> GlobalVariableReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8499
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::GlobalVariableReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8504
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8507
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8483
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8519
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the global variable, which is a `$` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifier). Alternatively, it can be one of the special global variables designated by a symbol.
+ #
+ # $foo # name `:$foo`
+ #
+ # $_Test # name `:$_Test`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8516
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8524
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8529
+ def type; end
+ end
+end
+
+# Represents writing to a global variable in a context that doesn't have an explicit value.
+#
+# $foo, $bar = baz
+# ^^^^ ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8545
+class Prism::GlobalVariableTargetNode < ::Prism::Node
+ # Initialize a new GlobalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8547
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8614
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8556
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8561
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8577
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8572
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> GlobalVariableTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8582
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::GlobalVariableTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8587
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8590
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8566
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8598
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8595
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8603
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8608
+ def type; end
+ end
+end
+
+# Represents writing to a global variable.
+#
+# $foo = 1
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8624
+class Prism::GlobalVariableWriteNode < ::Prism::Node
+ # Initialize a new GlobalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8626
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8747
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8638
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8643
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8660
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8655
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> GlobalVariableWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8665
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::GlobalVariableWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8670
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8673
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8648
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8731
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the global variable, which is a `$` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifier). Alternatively, it can be one of the special global variables designated by a symbol.
+ #
+ # $foo = :bar # name `:$foo`
+ #
+ # $_Test = 123 # name `:$_Test`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8682
+ sig { returns(Symbol) }
+ def name; end
+
+ # The location of the global variable's name.
+ #
+ # $foo = :bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8688
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8726
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `=` operator.
+ #
+ # $foo = :bar
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8713
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8696
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8721
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8736
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the global variable. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # $foo = :bar
+ # ^^^^
+ #
+ # $-xyz = 123
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8707
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8741
+ def type; end
+ end
+end
+
+# Represents a hash literal.
+#
+# { a => b }
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8760
+class Prism::HashNode < ::Prism::Node
+ # Initialize a new HashNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8762
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)],
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, elements, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8880
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8773
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8778
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8859
+ sig { returns(String) }
+ def closing; end
+
+ # The location of the closing brace.
+ #
+ # { a => b }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8841
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8795
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8790
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?elements: Array[AssocNode | AssocSplatNode], ?closing_loc: Location) -> HashNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8800
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::HashNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, elements: self.elements, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8805
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, elements: Array[AssocNode | AssocSplatNode], closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8808
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8783
+ def each_child_node; end
+
+ # The elements of the hash. These can be either `AssocNode`s or `AssocSplatNode`s.
+ #
+ # { a: b }
+ # ^^^^
+ #
+ # { **foo }
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8835
+ sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) }
+ def elements; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8864
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8854
+ sig { returns(String) }
+ def opening; end
+
+ # The location of the opening brace.
+ #
+ # { a => b }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8816
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8849
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8824
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8869
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8874
+ def type; end
+ end
+end
+
+# Represents a hash pattern in pattern matching.
+#
+# foo => { a: 1, b: 2 }
+# ^^^^^^^^^^^^^^
+#
+# foo => { a: 1, b: 2, **c }
+# ^^^^^^^^^^^^^^^^^^^
+#
+# foo => Bar[a: 1, b: 2]
+# ^^^^^^^^^^^^^^^
+#
+# foo in { a: 1, b: 2 }
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:8902
+class Prism::HashPatternNode < ::Prism::Node
+ # Initialize a new HashPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8904
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ elements: T::Array[Prism::AssocNode],
+ rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)),
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, constant, elements, rest, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9066
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8917
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8922
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9045
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # The location of the closing brace.
+ #
+ # foo => { a: 1 }
+ # ^
+ #
+ # foo => Bar[a: 1]
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9021
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8945
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8936
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Represents the optional constant preceding the Hash.
+ #
+ # foo => Bar[a: 1, b: 2]
+ # ^^^
+ #
+ # foo => Bar::Baz[a: 1, b: 2]
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8969
+ sig { returns(T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode))) }
+ def constant; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantPathNode | ConstantReadNode | nil, ?elements: Array[AssocNode], ?rest: AssocSplatNode | NoKeywordsParameterNode | nil, ?opening_loc: Location?, ?closing_loc: Location?) -> HashPatternNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8950
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)),
+ elements: T::Array[Prism::AssocNode],
+ rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)),
+ opening_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::HashPatternNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, constant: self.constant, elements: self.elements, rest: self.rest, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8955
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantPathNode | ConstantReadNode | nil, elements: Array[AssocNode], rest: AssocSplatNode | NoKeywordsParameterNode | nil, opening_loc: Location?, closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8958
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8927
+ def each_child_node; end
+
+ # Represents the explicit named hash keys and values.
+ #
+ # foo => { a: 1, b:, ** }
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8975
+ sig { returns(T::Array[Prism::AssocNode]) }
+ def elements; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9050
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9040
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # The location of the opening brace.
+ #
+ # foo => { a: 1 }
+ # ^
+ #
+ # foo => Bar[a: 1]
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8996
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Represents the rest of the Hash keys and values. This can be named, unnamed, or explicitly forbidden via `**nil`, this last one results in a `NoKeywordsParameterNode`.
+ #
+ # foo => { a: 1, b:, **c }
+ # ^^^
+ #
+ # foo => { a: 1, b:, ** }
+ # ^^
+ #
+ # foo => { a: 1, b:, **nil }
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:8987
+ sig { returns(T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode))) }
+ def rest; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9035
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9010
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9055
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9060
+ def type; end
+ end
+end
+
+# pkg:gem/prism#lib/prism/node_ext.rb:55
+module Prism::HeredocQuery
+ # Returns true if this node was represented as a heredoc in the source code.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:57
+ def heredoc?; end
+end
+
+# Represents the use of the `if` keyword, either in the block form or the modifier form, or a ternary expression.
+#
+# bar if foo
+# ^^^^^^^^^^
+#
+# if foo then bar end
+# ^^^^^^^^^^^^^^^^^^^
+#
+# foo ? bar : baz
+# ^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:9087
+class Prism::IfNode < ::Prism::Node
+ # Initialize a new IfNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9089
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ if_keyword_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ subsequent: T.nilable(T.any(Prism::ElseNode, Prism::IfNode)),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, if_keyword_loc, predicate, then_keyword_loc, statements, subsequent, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9292
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9103
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9108
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9131
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9122
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Returns the subsequent if/elsif/else clause of the if node. This method is
+ # deprecated in favor of #subsequent.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:488
+ def consequent; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?if_keyword_loc: Location?, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?subsequent: ElseNode | IfNode | nil, ?end_keyword_loc: Location?) -> IfNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9136
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ if_keyword_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ subsequent: T.nilable(T.any(Prism::ElseNode, Prism::IfNode)),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::IfNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, if_keyword_loc: self.if_keyword_loc, predicate: self.predicate, then_keyword_loc: self.then_keyword_loc, statements: self.statements, subsequent: self.subsequent, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9141
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, if_keyword_loc: Location?, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, subsequent: ElseNode | IfNode | nil, end_keyword_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9144
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9113
+ def each_child_node; end
+
+ # def end_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9271
+ sig { returns(T.nilable(String)) }
+ def end_keyword; end
+
+ # The location of the `end` keyword if present, `nil` otherwise.
+ #
+ # if foo
+ # bar
+ # end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9242
+ sig { returns(T.nilable(Prism::Location)) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def if_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9261
+ sig { returns(T.nilable(String)) }
+ def if_keyword; end
+
+ # The location of the `if` keyword if present.
+ #
+ # bar if foo
+ # ^^
+ #
+ # The `if_keyword_loc` field will be `nil` when the `IfNode` represents a ternary expression.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9154
+ sig { returns(T.nilable(Prism::Location)) }
+ def if_keyword_loc; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9276
+ sig { override.returns(String) }
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:92
+ def newline_flag!(lines); end
+
+ # The node for the condition the `IfNode` is testing.
+ #
+ # if foo
+ # ^^^
+ # bar
+ # end
+ #
+ # bar if foo
+ # ^^^
+ #
+ # foo ? bar : baz
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9184
+ sig { returns(Prism::Node) }
+ def predicate; end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9256
+ def save_end_keyword_loc(repository); end
+
+ # Save the if_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9168
+ def save_if_keyword_loc(repository); end
+
+ # Save the then_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9207
+ def save_then_keyword_loc(repository); end
+
+ # Represents the body of statements that will be executed when the predicate is evaluated as truthy. Will be `nil` when no body is provided.
+ #
+ # if foo
+ # bar
+ # ^^^
+ # baz
+ # ^^^
+ # end
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9219
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Represents an `ElseNode` or an `IfNode` when there is an `else` or an `elsif` in the `if` statement.
+ #
+ # if foo
+ # bar
+ # elsif baz
+ # ^^^^^^^^^
+ # qux
+ # ^^^
+ # end
+ # ^^^
+ #
+ # if foo then bar else baz end
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9234
+ sig { returns(T.nilable(T.any(Prism::ElseNode, Prism::IfNode))) }
+ def subsequent; end
+
+ # def then_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9266
+ sig { returns(T.nilable(String)) }
+ def then_keyword; end
+
+ # The location of the `then` keyword (if present) or the `?` in a ternary expression, `nil` otherwise.
+ #
+ # if foo then bar end
+ # ^^^^
+ #
+ # a ? b : c
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9193
+ sig { returns(T.nilable(Prism::Location)) }
+ def then_keyword_loc; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9281
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9286
+ def type; end
+ end
+end
+
+# Represents an imaginary number literal.
+#
+# 1.0i
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:9307
+class Prism::ImaginaryNode < ::Prism::Node
+ # Initialize a new ImaginaryNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9309
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ numeric: T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, numeric); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9377
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9318
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9323
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9340
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9335
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?numeric: FloatNode | IntegerNode | RationalNode) -> ImaginaryNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9345
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ numeric: T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)
+ ).returns(Prism::ImaginaryNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, numeric: self.numeric); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9350
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, numeric: FloatNode | IntegerNode | RationalNode }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9353
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9328
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9361
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader numeric: FloatNode | IntegerNode | RationalNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9358
+ sig { returns(T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)) }
+ def numeric; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9366
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Returns the value of the node as a Ruby Complex.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:110
+ sig { returns(Complex) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9371
+ def type; end
+ end
+end
+
+# Represents a node that is implicitly being added to the tree but doesn't correspond directly to a node in the source.
+#
+# { foo: }
+# ^^^^
+#
+# { Foo: }
+# ^^^^
+#
+# foo in { bar: }
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:9393
+class Prism::ImplicitNode < ::Prism::Node
+ # Initialize a new ImplicitNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9395
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: T.any(Prism::LocalVariableReadNode, Prism::CallNode, Prism::ConstantReadNode, Prism::LocalVariableTargetNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9463
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9404
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9409
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9426
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9421
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode) -> ImplicitNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9431
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: T.any(Prism::LocalVariableReadNode, Prism::CallNode, Prism::ConstantReadNode, Prism::LocalVariableTargetNode)
+ ).returns(Prism::ImplicitNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9436
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9439
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9414
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9447
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9452
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9444
+ sig do
+ returns(T.any(Prism::LocalVariableReadNode, Prism::CallNode, Prism::ConstantReadNode, Prism::LocalVariableTargetNode))
+ end
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9457
+ def type; end
+ end
+end
+
+# Represents using a trailing comma to indicate an implicit rest parameter.
+#
+# foo { |bar,| }
+# ^
+#
+# foo in [bar,]
+# ^
+#
+# for foo, in bar do end
+# ^
+#
+# foo, = bar
+# ^
+#
+# pkg:gem/prism#lib/prism/node.rb:9482
+class Prism::ImplicitRestNode < ::Prism::Node
+ # Initialize a new ImplicitRestNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9484
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9547
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9492
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9497
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9513
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9508
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ImplicitRestNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9518
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ImplicitRestNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9523
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9526
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9502
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9531
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9536
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9541
+ def type; end
+ end
+end
+
+# Represents the use of the `in` keyword in a case statement.
+#
+# case a; in b then c end
+# ^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:9556
+class Prism::InNode < ::Prism::Node
+ # Initialize a new InNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9558
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ pattern: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode),
+ in_loc: Prism::Location,
+ then_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, pattern, statements, in_loc, then_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9678
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9570
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9575
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9596
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9588
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?pattern: Prism::node, ?statements: StatementsNode?, ?in_loc: Location, ?then_loc: Location?) -> InNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9601
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ pattern: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode),
+ in_loc: Prism::Location,
+ then_loc: T.nilable(Prism::Location)
+ ).returns(Prism::InNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, pattern: self.pattern, statements: self.statements, in_loc: self.in_loc, then_loc: self.then_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9606
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, pattern: Prism::node, statements: StatementsNode?, in_loc: Location, then_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9609
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9580
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def in: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9652
+ sig { returns(String) }
+ def in; end
+
+ # attr_reader in_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9620
+ sig { returns(Prism::Location) }
+ def in_loc; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9662
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader pattern: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9614
+ sig { returns(Prism::Node) }
+ def pattern; end
+
+ # Save the in_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9628
+ def save_in_loc(repository); end
+
+ # Save the then_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9647
+ def save_then_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9617
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # def then: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9657
+ sig { returns(T.nilable(String)) }
+ def then; end
+
+ # attr_reader then_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9633
+ sig { returns(T.nilable(Prism::Location)) }
+ def then_loc; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9667
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9672
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator on a call to the `[]` method.
+#
+# foo.bar[baz] &&= value
+# ^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:9691
+class Prism::IndexAndWriteNode < ::Prism::Node
+ # Initialize a new IndexAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9693
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9883
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9709
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9812
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9767
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # attr_reader block: BlockArgumentNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9828
+ sig { returns(T.nilable(Prism::BlockArgumentNode)) }
+ def block; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9847
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9780
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9714
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9857
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9815
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9739
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9729
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9744
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::IndexAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, opening_loc: self.opening_loc, arguments: self.arguments, closing_loc: self.closing_loc, block: self.block, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9749
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9752
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9719
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9772
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9867
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9852
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9799
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9862
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9831
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # attr_reader receiver: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9777
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9757
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9794
+ def save_call_operator_loc(repository); end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9823
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9807
+ def save_opening_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9839
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9872
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9844
+ sig { returns(Prism::Node) }
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9762
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9877
+ def type; end
+ end
+end
+
+# Represents the use of an assignment operator on a call to `[]`.
+#
+# foo.bar[baz] += value
+# ^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:9901
+class Prism::IndexOperatorWriteNode < ::Prism::Node
+ # Initialize a new IndexOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9903
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ binary_operator: Symbol,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, binary_operator, binary_operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10092
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9920
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10023
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9978
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10042
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10045
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # attr_reader block: BlockArgumentNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10039
+ sig { returns(T.nilable(Prism::BlockArgumentNode)) }
+ def block; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10061
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9991
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9925
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10071
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10026
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9950
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9940
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node) -> IndexOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9955
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ binary_operator: Symbol,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::IndexOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, opening_loc: self.opening_loc, arguments: self.arguments, closing_loc: self.closing_loc, block: self.block, binary_operator: self.binary_operator, binary_operator_loc: self.binary_operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9960
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9963
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9930
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9983
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10076
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10066
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10010
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:422
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:429
+ def operator_loc; end
+
+ # attr_reader receiver: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9988
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9968
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10053
+ def save_binary_operator_loc(repository); end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10005
+ def save_call_operator_loc(repository); end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10034
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10018
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10081
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10058
+ sig { returns(Prism::Node) }
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:9973
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10086
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator on a call to `[]`.
+#
+# foo.bar[baz] ||= value
+# ^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10111
+class Prism::IndexOrWriteNode < ::Prism::Node
+ # Initialize a new IndexOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10113
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10303
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10129
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10232
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10187
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # attr_reader block: BlockArgumentNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10248
+ sig { returns(T.nilable(Prism::BlockArgumentNode)) }
+ def block; end
+
+ # def call_operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10267
+ sig { returns(T.nilable(String)) }
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10200
+ sig { returns(T.nilable(Prism::Location)) }
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10134
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10277
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10235
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10159
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10149
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10164
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: T.nilable(Prism::Node),
+ call_operator_loc: T.nilable(Prism::Location),
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::IndexOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, call_operator_loc: self.call_operator_loc, opening_loc: self.opening_loc, arguments: self.arguments, closing_loc: self.closing_loc, block: self.block, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10169
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10172
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10139
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10192
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10287
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10272
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10219
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10282
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10251
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # attr_reader receiver: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10197
+ sig { returns(T.nilable(Prism::Node)) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10177
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the call_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10214
+ def save_call_operator_loc(repository); end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10243
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10227
+ def save_opening_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10259
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10292
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10264
+ sig { returns(Prism::Node) }
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10182
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10297
+ def type; end
+ end
+end
+
+# Represents assigning to an index.
+#
+# foo[bar], = 1
+# ^^^^^^^^
+#
+# begin
+# rescue => foo[bar]
+# ^^^^^^^^
+# end
+#
+# for foo[bar] in baz do end
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10329
+class Prism::IndexTargetNode < ::Prism::Node
+ # Initialize a new IndexTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10331
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: Prism::Node,
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, receiver, opening_loc, arguments, closing_loc, block); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10471
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10344
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10426
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10400
+ sig { returns(T::Boolean) }
+ def attribute_write?; end
+
+ # attr_reader block: BlockArgumentNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10442
+ sig { returns(T.nilable(Prism::BlockArgumentNode)) }
+ def block; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10349
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10450
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10429
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10372
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10363
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?) -> IndexTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10377
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ receiver: Prism::Node,
+ opening_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ closing_loc: Prism::Location,
+ block: T.nilable(Prism::BlockArgumentNode)
+ ).returns(Prism::IndexTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, receiver: self.receiver, opening_loc: self.opening_loc, arguments: self.arguments, closing_loc: self.closing_loc, block: self.block); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10382
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10385
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10354
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def ignore_visibility?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10405
+ sig { returns(T::Boolean) }
+ def ignore_visibility?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10455
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10445
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10413
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # attr_reader receiver: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10410
+ sig { returns(Prism::Node) }
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10390
+ sig { returns(T::Boolean) }
+ def safe_navigation?; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10437
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10421
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10460
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # def variable_call?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10395
+ sig { returns(T::Boolean) }
+ def variable_call?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10465
+ def type; end
+ end
+end
+
+# InlineComment objects are the most common. They correspond to comments in
+# the source file like this one that start with #.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:543
+class Prism::InlineComment < ::Prism::Comment
+ # Returns a string representation of this comment.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:551
+ sig { returns(String) }
+ def inspect; end
+
+ # Returns true if this comment happens on the same line as other code and
+ # false if the comment is by itself.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:546
+ sig { override.returns(T::Boolean) }
+ def trailing?; end
+end
+
+# This visitor is responsible for composing the strings that get returned by
+# the various #inspect methods defined on each of the nodes.
+#
+# pkg:gem/prism#lib/prism/inspect_visitor.rb:15
+class Prism::InspectVisitor < ::Prism::Visitor
+ # Initializes a new instance of the InspectVisitor.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:38
+ sig { params(indent: String).void }
+ def initialize(indent = ""); end
+
+ # The list of commands that we need to execute in order to compose the
+ # final string.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:35
+ def commands; end
+
+ # Compose the final string.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:51
+ sig { returns(String) }
+ def compose; end
+
+ # The current prefix string.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:31
+ def indent; end
+
+ # Inspect a AliasGlobalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:80
+ def visit_alias_global_variable_node(node); end
+
+ # Inspect a AliasMethodNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:92
+ def visit_alias_method_node(node); end
+
+ # Inspect a AlternationPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:104
+ def visit_alternation_pattern_node(node); end
+
+ # Inspect a AndNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:116
+ def visit_and_node(node); end
+
+ # Inspect a ArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:128
+ def visit_arguments_node(node); end
+
+ # Inspect a ArrayNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:144
+ def visit_array_node(node); end
+
+ # Inspect a ArrayPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:162
+ def visit_array_pattern_node(node); end
+
+ # Inspect a AssocNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:201
+ def visit_assoc_node(node); end
+
+ # Inspect a AssocSplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:213
+ def visit_assoc_splat_node(node); end
+
+ # Inspect a BackReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:227
+ def visit_back_reference_read_node(node); end
+
+ # Inspect a BeginNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:235
+ def visit_begin_node(node); end
+
+ # Inspect a BlockArgumentNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:268
+ def visit_block_argument_node(node); end
+
+ # Inspect a BlockLocalVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:282
+ def visit_block_local_variable_node(node); end
+
+ # Inspect a BlockNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:290
+ def visit_block_node(node); end
+
+ # Inspect a BlockParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:312
+ def visit_block_parameter_node(node); end
+
+ # Inspect a BlockParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:326
+ def visit_block_parameters_node(node); end
+
+ # Inspect a BreakNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:350
+ def visit_break_node(node); end
+
+ # Inspect a CallAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:364
+ def visit_call_and_write_node(node); end
+
+ # Inspect a CallNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:384
+ def visit_call_node(node); end
+
+ # Inspect a CallOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:415
+ def visit_call_operator_write_node(node); end
+
+ # Inspect a CallOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:436
+ def visit_call_or_write_node(node); end
+
+ # Inspect a CallTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:456
+ def visit_call_target_node(node); end
+
+ # Inspect a CapturePatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:468
+ def visit_capture_pattern_node(node); end
+
+ # Inspect a CaseMatchNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:480
+ def visit_case_match_node(node); end
+
+ # Inspect a CaseNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:510
+ def visit_case_node(node); end
+
+ # Inspect a ClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:540
+ def visit_class_node(node); end
+
+ # Inspect a ClassVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:566
+ def visit_class_variable_and_write_node(node); end
+
+ # Inspect a ClassVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:578
+ def visit_class_variable_operator_write_node(node); end
+
+ # Inspect a ClassVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:591
+ def visit_class_variable_or_write_node(node); end
+
+ # Inspect a ClassVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:603
+ def visit_class_variable_read_node(node); end
+
+ # Inspect a ClassVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:611
+ def visit_class_variable_target_node(node); end
+
+ # Inspect a ClassVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:619
+ def visit_class_variable_write_node(node); end
+
+ # Inspect a ConstantAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:631
+ def visit_constant_and_write_node(node); end
+
+ # Inspect a ConstantOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:643
+ def visit_constant_operator_write_node(node); end
+
+ # Inspect a ConstantOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:656
+ def visit_constant_or_write_node(node); end
+
+ # Inspect a ConstantPathAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:668
+ def visit_constant_path_and_write_node(node); end
+
+ # Inspect a ConstantPathNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:680
+ def visit_constant_path_node(node); end
+
+ # Inspect a ConstantPathOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:700
+ def visit_constant_path_operator_write_node(node); end
+
+ # Inspect a ConstantPathOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:713
+ def visit_constant_path_or_write_node(node); end
+
+ # Inspect a ConstantPathTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:725
+ def visit_constant_path_target_node(node); end
+
+ # Inspect a ConstantPathWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:745
+ def visit_constant_path_write_node(node); end
+
+ # Inspect a ConstantReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:757
+ def visit_constant_read_node(node); end
+
+ # Inspect a ConstantTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:765
+ def visit_constant_target_node(node); end
+
+ # Inspect a ConstantWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:773
+ def visit_constant_write_node(node); end
+
+ # Inspect a DefNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:785
+ def visit_def_node(node); end
+
+ # Inspect a DefinedNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:819
+ def visit_defined_node(node); end
+
+ # Inspect a ElseNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:831
+ def visit_else_node(node); end
+
+ # Inspect a EmbeddedStatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:846
+ def visit_embedded_statements_node(node); end
+
+ # Inspect a EmbeddedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:861
+ def visit_embedded_variable_node(node); end
+
+ # Inspect a EnsureNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:871
+ def visit_ensure_node(node); end
+
+ # Inspect a FalseNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:886
+ def visit_false_node(node); end
+
+ # Inspect a FindPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:893
+ def visit_find_pattern_node(node); end
+
+ # Inspect a FlipFlopNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:921
+ def visit_flip_flop_node(node); end
+
+ # Inspect a FloatNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:941
+ def visit_float_node(node); end
+
+ # Inspect a ForNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:949
+ def visit_for_node(node); end
+
+ # Inspect a ForwardingArgumentsNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:970
+ def visit_forwarding_arguments_node(node); end
+
+ # Inspect a ForwardingParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:977
+ def visit_forwarding_parameter_node(node); end
+
+ # Inspect a ForwardingSuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:984
+ def visit_forwarding_super_node(node); end
+
+ # Inspect a GlobalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:997
+ def visit_global_variable_and_write_node(node); end
+
+ # Inspect a GlobalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1009
+ def visit_global_variable_operator_write_node(node); end
+
+ # Inspect a GlobalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1022
+ def visit_global_variable_or_write_node(node); end
+
+ # Inspect a GlobalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1034
+ def visit_global_variable_read_node(node); end
+
+ # Inspect a GlobalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1042
+ def visit_global_variable_target_node(node); end
+
+ # Inspect a GlobalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1050
+ def visit_global_variable_write_node(node); end
+
+ # Inspect a HashNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1062
+ def visit_hash_node(node); end
+
+ # Inspect a HashPatternNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1080
+ def visit_hash_pattern_node(node); end
+
+ # Inspect a IfNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1110
+ def visit_if_node(node); end
+
+ # Inspect a ImaginaryNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1134
+ def visit_imaginary_node(node); end
+
+ # Inspect a ImplicitNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1143
+ def visit_implicit_node(node); end
+
+ # Inspect a ImplicitRestNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1152
+ def visit_implicit_rest_node(node); end
+
+ # Inspect a InNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1159
+ def visit_in_node(node); end
+
+ # Inspect a IndexAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1176
+ def visit_index_and_write_node(node); end
+
+ # Inspect a IndexOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1207
+ def visit_index_operator_write_node(node); end
+
+ # Inspect a IndexOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1239
+ def visit_index_or_write_node(node); end
+
+ # Inspect a IndexTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1270
+ def visit_index_target_node(node); end
+
+ # Inspect a InstanceVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1293
+ def visit_instance_variable_and_write_node(node); end
+
+ # Inspect a InstanceVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1305
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Inspect a InstanceVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1318
+ def visit_instance_variable_or_write_node(node); end
+
+ # Inspect a InstanceVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1330
+ def visit_instance_variable_read_node(node); end
+
+ # Inspect a InstanceVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1338
+ def visit_instance_variable_target_node(node); end
+
+ # Inspect a InstanceVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1346
+ def visit_instance_variable_write_node(node); end
+
+ # Inspect a IntegerNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1358
+ def visit_integer_node(node); end
+
+ # Inspect a InterpolatedMatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1366
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Inspect a InterpolatedRegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1384
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Inspect a InterpolatedStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1402
+ def visit_interpolated_string_node(node); end
+
+ # Inspect a InterpolatedSymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1420
+ def visit_interpolated_symbol_node(node); end
+
+ # Inspect a InterpolatedXStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1438
+ def visit_interpolated_x_string_node(node); end
+
+ # Inspect a ItLocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1456
+ def visit_it_local_variable_read_node(node); end
+
+ # Inspect a ItParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1463
+ def visit_it_parameters_node(node); end
+
+ # Inspect a KeywordHashNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1470
+ def visit_keyword_hash_node(node); end
+
+ # Inspect a KeywordRestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1486
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Inspect a LambdaNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1500
+ def visit_lambda_node(node); end
+
+ # Inspect a LocalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1523
+ def visit_local_variable_and_write_node(node); end
+
+ # Inspect a LocalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1536
+ def visit_local_variable_operator_write_node(node); end
+
+ # Inspect a LocalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1550
+ def visit_local_variable_or_write_node(node); end
+
+ # Inspect a LocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1563
+ def visit_local_variable_read_node(node); end
+
+ # Inspect a LocalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1572
+ def visit_local_variable_target_node(node); end
+
+ # Inspect a LocalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1581
+ def visit_local_variable_write_node(node); end
+
+ # Inspect a MatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1594
+ def visit_match_last_line_node(node); end
+
+ # Inspect a MatchPredicateNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1605
+ def visit_match_predicate_node(node); end
+
+ # Inspect a MatchRequiredNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1617
+ def visit_match_required_node(node); end
+
+ # Inspect a MatchWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1629
+ def visit_match_write_node(node); end
+
+ # Inspect a MissingNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1647
+ def visit_missing_node(node); end
+
+ # Inspect a ModuleNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1654
+ def visit_module_node(node); end
+
+ # Inspect a MultiTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1673
+ def visit_multi_target_node(node); end
+
+ # Inspect a MultiWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1706
+ def visit_multi_write_node(node); end
+
+ # Inspect a NextNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1742
+ def visit_next_node(node); end
+
+ # Inspect a NilNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1756
+ def visit_nil_node(node); end
+
+ # Inspect a NoKeywordsParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1763
+ def visit_no_keywords_parameter_node(node); end
+
+ # Inspect a NumberedParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1772
+ def visit_numbered_parameters_node(node); end
+
+ # Inspect a NumberedReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1780
+ def visit_numbered_reference_read_node(node); end
+
+ # Inspect a OptionalKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1788
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Inspect a OptionalParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1799
+ def visit_optional_parameter_node(node); end
+
+ # Inspect a OrNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1811
+ def visit_or_node(node); end
+
+ # Inspect a ParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1823
+ def visit_parameters_node(node); end
+
+ # Inspect a ParenthesesNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1884
+ def visit_parentheses_node(node); end
+
+ # Inspect a PinnedExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1899
+ def visit_pinned_expression_node(node); end
+
+ # Inspect a PinnedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1911
+ def visit_pinned_variable_node(node); end
+
+ # Inspect a PostExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1921
+ def visit_post_execution_node(node); end
+
+ # Inspect a PreExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1937
+ def visit_pre_execution_node(node); end
+
+ # Inspect a ProgramNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1953
+ def visit_program_node(node); end
+
+ # Inspect a RangeNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1963
+ def visit_range_node(node); end
+
+ # Inspect a RationalNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1983
+ def visit_rational_node(node); end
+
+ # Inspect a RedoNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1992
+ def visit_redo_node(node); end
+
+ # Inspect a RegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:1999
+ def visit_regular_expression_node(node); end
+
+ # Inspect a RequiredKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2010
+ def visit_required_keyword_parameter_node(node); end
+
+ # Inspect a RequiredParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2019
+ def visit_required_parameter_node(node); end
+
+ # Inspect a RescueModifierNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2027
+ def visit_rescue_modifier_node(node); end
+
+ # Inspect a RescueNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2039
+ def visit_rescue_node(node); end
+
+ # Inspect a RestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2076
+ def visit_rest_parameter_node(node); end
+
+ # Inspect a RetryNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2090
+ def visit_retry_node(node); end
+
+ # Inspect a ReturnNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2097
+ def visit_return_node(node); end
+
+ # Inspect a SelfNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2111
+ def visit_self_node(node); end
+
+ # Inspect a ShareableConstantNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2118
+ def visit_shareable_constant_node(node); end
+
+ # Inspect a SingletonClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2127
+ def visit_singleton_class_node(node); end
+
+ # Inspect a SourceEncodingNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2146
+ def visit_source_encoding_node(node); end
+
+ # Inspect a SourceFileNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2153
+ def visit_source_file_node(node); end
+
+ # Inspect a SourceLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2161
+ def visit_source_line_node(node); end
+
+ # Inspect a SplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2168
+ def visit_splat_node(node); end
+
+ # Inspect a StatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2182
+ def visit_statements_node(node); end
+
+ # Inspect a StringNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2198
+ def visit_string_node(node); end
+
+ # Inspect a SuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2209
+ def visit_super_node(node); end
+
+ # Inspect a SymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2231
+ def visit_symbol_node(node); end
+
+ # Inspect a TrueNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2242
+ def visit_true_node(node); end
+
+ # Inspect a UndefNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2249
+ def visit_undef_node(node); end
+
+ # Inspect a UnlessNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2266
+ def visit_unless_node(node); end
+
+ # Inspect a UntilNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2290
+ def visit_until_node(node); end
+
+ # Inspect a WhenNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2308
+ def visit_when_node(node); end
+
+ # Inspect a WhileNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2332
+ def visit_while_node(node); end
+
+ # Inspect a XStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2350
+ def visit_x_string_node(node); end
+
+ # Inspect a YieldNode node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2361
+ def visit_yield_node(node); end
+
+ private
+
+ # Compose a string representing the given inner location field.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2385
+ def inspect_location(location); end
+
+ # Compose a header for the given node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:2379
+ def inspect_node(name, node); end
+
+ class << self
+ # Compose an inspect string for the given node.
+ #
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:44
+ sig { params(node: Prism::Node).returns(String) }
+ def compose(node); end
+ end
+end
+
+# Most of the time, we can simply pass down the indent to the next node.
+# However, when we are inside a list we want some extra special formatting
+# when we hit an element in that list. In this case, we have a special
+# command that replaces the subsequent indent with the given value.
+#
+# pkg:gem/prism#lib/prism/inspect_visitor.rb:20
+class Prism::InspectVisitor::Replace
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:23
+ def initialize(value); end
+
+ # pkg:gem/prism#lib/prism/inspect_visitor.rb:21
+ def value; end
+end
+
+# Represents the use of the `&&=` operator for assignment to an instance variable.
+#
+# @target &&= value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10486
+class Prism::InstanceVariableAndWriteNode < ::Prism::Node
+ # Initialize a new InstanceVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10488
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10593
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10500
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10505
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10522
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10517
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> InstanceVariableAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10527
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::InstanceVariableAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10532
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10535
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:219
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10510
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10577
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10540
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10543
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10572
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10556
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10551
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10564
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10582
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10569
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10587
+ def type; end
+ end
+end
+
+# Represents assigning to an instance variable using an operator that isn't `=`.
+#
+# @target += value
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10606
+class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node
+ # Initialize a new InstanceVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10608
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, binary_operator_loc, value, binary_operator); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10712
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10621
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10693
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10677
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10626
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10643
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10638
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> InstanceVariableOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10648
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ binary_operator: Symbol
+ ).returns(Prism::InstanceVariableOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, binary_operator: self.binary_operator); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10653
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10656
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:231
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10631
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10696
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10661
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10664
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:438
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:445
+ def operator_loc; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10685
+ def save_binary_operator_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10672
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10701
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10690
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10706
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to an instance variable.
+#
+# @target ||= value
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10726
+class Prism::InstanceVariableOrWriteNode < ::Prism::Node
+ # Initialize a new InstanceVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10728
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10833
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10740
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10745
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10762
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10757
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> InstanceVariableOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10767
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::InstanceVariableOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10772
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10775
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:225
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10750
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10817
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10780
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10783
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10812
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10796
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10791
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10804
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10822
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10809
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10827
+ def type; end
+ end
+end
+
+# Represents referencing an instance variable.
+#
+# @foo
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10846
+class Prism::InstanceVariableReadNode < ::Prism::Node
+ # Initialize a new InstanceVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10848
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10919
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10857
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10862
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10878
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10873
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> InstanceVariableReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10883
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::InstanceVariableReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10888
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10891
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10867
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10903
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the instance variable, which is a `@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # @x # name `:@x`
+ #
+ # @_test # name `:@_test`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10900
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10908
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10913
+ def type; end
+ end
+end
+
+# Represents writing to an instance variable in a context that doesn't have an explicit value.
+#
+# @foo, @bar = baz
+# ^^^^ ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:10929
+class Prism::InstanceVariableTargetNode < ::Prism::Node
+ # Initialize a new InstanceVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10931
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10998
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10940
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10945
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10961
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10956
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> InstanceVariableTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10966
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::InstanceVariableTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10971
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10974
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10950
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10982
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10979
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10987
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:10992
+ def type; end
+ end
+end
+
+# Represents writing to an instance variable.
+#
+# @foo = 1
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11008
+class Prism::InstanceVariableWriteNode < ::Prism::Node
+ # Initialize a new InstanceVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11010
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11131
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11022
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11027
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11044
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11039
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> InstanceVariableWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11049
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::InstanceVariableWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11054
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11057
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11032
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11115
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the instance variable, which is a `@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # @x = :y # name `:@x`
+ #
+ # @_foo = "bar" # name `@_foo`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11066
+ sig { returns(Symbol) }
+ def name; end
+
+ # The location of the variable name.
+ #
+ # @_x = 1
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11072
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11110
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `=` operator.
+ #
+ # @x = y
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11097
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11080
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11105
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11120
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the instance variable. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # @foo = :bar
+ # ^^^^
+ #
+ # @_x = 1234
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11091
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11125
+ def type; end
+ end
+end
+
+# Flags for integer nodes that correspond to the base of the integer.
+#
+# pkg:gem/prism#lib/prism/node.rb:19828
+module Prism::IntegerBaseFlags; end
+
+# 0b prefix
+#
+# pkg:gem/prism#lib/prism/node.rb:19830
+Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer)
+
+# 0d or no prefix
+#
+# pkg:gem/prism#lib/prism/node.rb:19833
+Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer)
+
+# 0x prefix
+#
+# pkg:gem/prism#lib/prism/node.rb:19839
+Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer)
+
+# 0o or 0 prefix
+#
+# pkg:gem/prism#lib/prism/node.rb:19836
+Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer)
+
+# Represents an integer number literal.
+#
+# 1
+# ^
+#
+# pkg:gem/prism#lib/prism/node.rb:11144
+class Prism::IntegerNode < ::Prism::Node
+ # Initialize a new IntegerNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11146
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11233
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11155
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def binary?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11194
+ sig { returns(T::Boolean) }
+ def binary?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11160
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11176
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11171
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Integer) -> IntegerNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11181
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Integer
+ ).returns(Prism::IntegerNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value); end
+
+ # def decimal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11199
+ sig { returns(T::Boolean) }
+ def decimal?; end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11186
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11189
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11165
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def hexadecimal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11209
+ sig { returns(T::Boolean) }
+ def hexadecimal?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11217
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def octal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11204
+ sig { returns(T::Boolean) }
+ def octal?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11222
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value of the integer literal as a number.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11214
+ sig { returns(Integer) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11227
+ def type; end
+ end
+end
+
+# Represents a regular expression literal that contains interpolation that is being used in the predicate of a conditional to implicitly match against the last line read by an IO object.
+#
+# if /foo #{bar} baz/ then end
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11244
+class Prism::InterpolatedMatchLastLineNode < ::Prism::Node
+ include ::Prism::RegularExpressionOptions
+
+ # Initialize a new InterpolatedMatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11246
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, parts, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11407
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11257
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11322
+ sig { returns(T::Boolean) }
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11262
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11386
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11368
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11279
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11274
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedMatchLastLineNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11284
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::InterpolatedMatchLastLineNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, parts: self.parts, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11289
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11292
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11267
+ def each_child_node; end
+
+ # def euc_jp?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11317
+ sig { returns(T::Boolean) }
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11302
+ sig { returns(T::Boolean) }
+ def extended?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11342
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11347
+ sig { returns(T::Boolean) }
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11337
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def ignore_case?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11297
+ sig { returns(T::Boolean) }
+ def ignore_case?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11391
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def multi_line?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11307
+ sig { returns(T::Boolean) }
+ def multi_line?; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:122
+ def newline_flag!(lines); end
+
+ # def once?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11312
+ sig { returns(T::Boolean) }
+ def once?; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11381
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11352
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ sig { returns(Integer) }
+ def options; end
+
+ # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11365
+ sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
+ def parts; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11376
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11360
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11396
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # def utf_8?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11332
+ sig { returns(T::Boolean) }
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11327
+ sig { returns(T::Boolean) }
+ def windows_31j?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11401
+ def type; end
+ end
+end
+
+# Represents a regular expression literal that contains interpolation.
+#
+# /foo #{bar} baz/
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11421
+class Prism::InterpolatedRegularExpressionNode < ::Prism::Node
+ include ::Prism::RegularExpressionOptions
+
+ # Initialize a new InterpolatedRegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11423
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, parts, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11584
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11434
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11499
+ sig { returns(T::Boolean) }
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11439
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11563
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11545
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11456
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11451
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedRegularExpressionNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11461
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::InterpolatedRegularExpressionNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, parts: self.parts, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11466
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11469
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11444
+ def each_child_node; end
+
+ # def euc_jp?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11494
+ sig { returns(T::Boolean) }
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11479
+ sig { returns(T::Boolean) }
+ def extended?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11519
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11524
+ sig { returns(T::Boolean) }
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11514
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def ignore_case?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11474
+ sig { returns(T::Boolean) }
+ def ignore_case?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11568
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def multi_line?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11484
+ sig { returns(T::Boolean) }
+ def multi_line?; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:129
+ def newline_flag!(lines); end
+
+ # def once?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11489
+ sig { returns(T::Boolean) }
+ def once?; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11558
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11529
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ sig { returns(Integer) }
+ def options; end
+
+ # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11542
+ sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
+ def parts; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11553
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11537
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11573
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # def utf_8?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11509
+ sig { returns(T::Boolean) }
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11504
+ sig { returns(T::Boolean) }
+ def windows_31j?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11578
+ def type; end
+ end
+end
+
+# Represents a string literal that contains interpolation.
+#
+# "foo #{bar} baz"
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11598
+class Prism::InterpolatedStringNode < ::Prism::Node
+ include ::Prism::HeredocQuery
+
+ # Initialize a new InterpolatedStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11600
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode, Prism::XStringNode, Prism::InterpolatedXStringNode, Prism::SymbolNode, Prism::InterpolatedSymbolNode)],
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, parts, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11728
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11611
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11616
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11707
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11683
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11633
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11628
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode | XStringNode | InterpolatedXStringNode | SymbolNode | InterpolatedSymbolNode], ?closing_loc: Location?) -> InterpolatedStringNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11638
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode, Prism::XStringNode, Prism::InterpolatedXStringNode, Prism::SymbolNode, Prism::InterpolatedSymbolNode)],
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::InterpolatedStringNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, parts: self.parts, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11643
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode | XStringNode | InterpolatedXStringNode | SymbolNode | InterpolatedSymbolNode], closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11646
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11621
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def frozen?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11651
+ sig { returns(T::Boolean) }
+ def frozen?; end
+
+ sig { returns(T::Boolean) }
+ def heredoc?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11712
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def mutable?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11656
+ sig { returns(T::Boolean) }
+ def mutable?; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:136
+ def newline_flag!(lines); end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11702
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11661
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode | XStringNode | InterpolatedXStringNode | SymbolNode | InterpolatedSymbolNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11680
+ sig do
+ returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode, Prism::XStringNode, Prism::InterpolatedXStringNode, Prism::SymbolNode, Prism::InterpolatedSymbolNode)])
+ end
+ def parts; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11697
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11675
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11717
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11722
+ def type; end
+ end
+end
+
+# Flags for interpolated string nodes that indicated mutability if they are also marked as literals.
+#
+# pkg:gem/prism#lib/prism/node.rb:19843
+module Prism::InterpolatedStringNodeFlags; end
+
+# pkg:gem/prism#lib/prism/node.rb:19845
+Prism::InterpolatedStringNodeFlags::FROZEN = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/node.rb:19848
+Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer)
+
+# Represents a symbol literal that contains interpolation.
+#
+# :"foo #{bar} baz"
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11742
+class Prism::InterpolatedSymbolNode < ::Prism::Node
+ # Initialize a new InterpolatedSymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11744
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, parts, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11862
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11755
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11760
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11841
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11817
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11777
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11772
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location?) -> InterpolatedSymbolNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11782
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: T.nilable(Prism::Location)
+ ).returns(Prism::InterpolatedSymbolNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, parts: self.parts, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11787
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11790
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11765
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11846
+ sig { override.returns(String) }
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:143
+ def newline_flag!(lines); end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11836
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11795
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11814
+ sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
+ def parts; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11831
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11809
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11851
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11856
+ def type; end
+ end
+end
+
+# Represents an xstring literal that contains interpolation.
+#
+# `foo #{bar} baz`
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11875
+class Prism::InterpolatedXStringNode < ::Prism::Node
+ include ::Prism::HeredocQuery
+
+ # Initialize a new InterpolatedXStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11877
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, parts, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11983
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11888
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11893
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11962
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11944
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11910
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11905
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedXStringNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11915
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)],
+ closing_loc: Prism::Location
+ ).returns(Prism::InterpolatedXStringNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, parts: self.parts, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11920
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11923
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11898
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ sig { returns(T::Boolean) }
+ def heredoc?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11967
+ sig { override.returns(String) }
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:150
+ def newline_flag!(lines); end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11957
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11928
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11941
+ sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) }
+ def parts; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11952
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11936
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11972
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11977
+ def type; end
+ end
+end
+
+# Represents reading from the implicit `it` local variable.
+#
+# -> { it }
+# ^^
+#
+# pkg:gem/prism#lib/prism/node.rb:11996
+class Prism::ItLocalVariableReadNode < ::Prism::Node
+ # Initialize a new ItLocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:11998
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12061
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12006
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12011
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12027
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12022
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ItLocalVariableReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12032
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ItLocalVariableReadNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12037
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12040
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12016
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12045
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12050
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12055
+ def type; end
+ end
+end
+
+# Represents an implicit set of parameters through the use of the `it` keyword within a block or lambda.
+#
+# -> { it + it }
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12070
+class Prism::ItParametersNode < ::Prism::Node
+ # Initialize a new ItParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12072
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12135
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12080
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12085
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12101
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12096
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ItParametersNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12106
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ItParametersNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12111
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12114
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12090
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12119
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12124
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12129
+ def type; end
+ end
+end
+
+# Represents a hash literal without opening and closing braces.
+#
+# foo(a: b)
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12144
+class Prism::KeywordHashNode < ::Prism::Node
+ # Initialize a new KeywordHashNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12146
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]
+ ).void
+ end
+ def initialize(source, node_id, location, flags, elements); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12219
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12155
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12160
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12177
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12172
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode]) -> KeywordHashNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12182
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]
+ ).returns(Prism::KeywordHashNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12187
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[AssocNode | AssocSplatNode] }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12190
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12165
+ def each_child_node; end
+
+ # attr_reader elements: Array[AssocNode | AssocSplatNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12200
+ sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) }
+ def elements; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12203
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def symbol_keys?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12195
+ sig { returns(T::Boolean) }
+ def symbol_keys?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12208
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12213
+ def type; end
+ end
+end
+
+# Flags for keyword hash nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19852
+module Prism::KeywordHashNodeFlags; end
+
+# a keyword hash which only has `AssocNode` elements all with symbol keys, which means the elements can be treated as keyword arguments
+#
+# pkg:gem/prism#lib/prism/node.rb:19854
+Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer)
+
+# Represents a keyword rest parameter to a method, block, or lambda definition.
+#
+# def a(**b)
+# ^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:12232
+class Prism::KeywordRestParameterNode < ::Prism::Node
+ # Initialize a new KeywordRestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12234
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12345
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12245
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12250
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12266
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12261
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> KeywordRestParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12271
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).returns(Prism::KeywordRestParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12276
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12279
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12255
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12329
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12289
+ sig { returns(T.nilable(Symbol)) }
+ def name; end
+
+ # attr_reader name_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12292
+ sig { returns(T.nilable(Prism::Location)) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12324
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12311
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12284
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12306
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12319
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12334
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12339
+ def type; end
+ end
+end
+
+# Represents using a lambda literal (not the lambda method call).
+#
+# ->(value) { value * 2 }
+# ^^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12358
+class Prism::LambdaNode < ::Prism::Node
+ # Initialize a new LambdaNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12360
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ operator_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ parameters: T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode)),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))
+ ).void
+ end
+ def initialize(source, node_id, location, flags, locals, operator_loc, opening_loc, closing_loc, parameters, body); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12497
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12374
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader body: StatementsNode | BeginNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12463
+ sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12379
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12476
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12447
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12400
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12392
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?operator_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, ?body: StatementsNode | BeginNode | nil) -> LambdaNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12405
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ operator_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ parameters: T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode)),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))
+ ).returns(Prism::LambdaNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, operator_loc: self.operator_loc, opening_loc: self.opening_loc, closing_loc: self.closing_loc, parameters: self.parameters, body: self.body); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12410
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, body: StatementsNode | BeginNode | nil }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12413
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12384
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12481
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12418
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12471
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12434
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12466
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12421
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # attr_reader parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12460
+ sig { returns(T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode))) }
+ def parameters; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12455
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12442
+ def save_opening_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12429
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12486
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12491
+ def type; end
+ end
+end
+
+# This class is responsible for lexing the source using prism and then
+# converting those tokens to be compatible with Ripper. In the vast majority
+# of cases, this is a one-to-one mapping of the token type. Everything else
+# generally lines up. However, there are a few cases that require special
+# handling.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:10
+class Prism::LexCompat
+ # pkg:gem/prism#lib/prism/lex_compat.rb:586
+ def initialize(code, **options); end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:828
+ def add_on_sp_tokens(tokens, source, data_loc, bom, eof_token); end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:584
+ def options; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:591
+ def result; end
+end
+
+# In previous versions of Ruby, Ripper wouldn't flush the bom before the
+# first token, so we had to have a hack in place to account for that.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:581
+Prism::LexCompat::BOM_FLUSHED = T.let(T.unsafe(nil), TrueClass)
+
+# A heredoc in this case is a list of tokens that belong to the body of the
+# heredoc that should be appended onto the list of tokens when the heredoc
+# closes.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:253
+module Prism::LexCompat::Heredoc
+ class << self
+ # Here we will split between the two types of heredocs and return the
+ # object that will store their tokens.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:565
+ def build(opening); end
+ end
+end
+
+# Dash heredocs are a little more complicated. They are a list of tokens
+# that need to be split on "\\\n" to mimic Ripper's behavior. We also need
+# to keep track of the state that the heredoc was opened in.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:277
+class Prism::LexCompat::Heredoc::DashHeredoc
+ # pkg:gem/prism#lib/prism/lex_compat.rb:280
+ def initialize(split); end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:285
+ def <<(token); end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:278
+ def split; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:289
+ def to_a; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:278
+ def tokens; end
+end
+
+# Heredocs that are dedenting heredocs are a little more complicated.
+# Ripper outputs on_ignored_sp tokens for the whitespace that is being
+# removed from the output. prism only modifies the node itself and keeps
+# the token the same. This simplifies prism, but makes comparing against
+# Ripper much harder because there is a length mismatch.
+#
+# Fortunately, we already have to pull out the heredoc tokens in order to
+# insert them into the stream in the correct order. As such, we can do
+# some extra manipulation on the tokens to make them match Ripper's
+# output by mirroring the dedent logic that Ripper uses.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:336
+class Prism::LexCompat::Heredoc::DedentingHeredoc
+ # pkg:gem/prism#lib/prism/lex_compat.rb:341
+ def initialize; end
+
+ # As tokens are coming in, we track the minimum amount of common leading
+ # whitespace on plain string content tokens. This allows us to later
+ # remove that amount of whitespace from the beginning of each line.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:352
+ def <<(token); end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:339
+ def dedent; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:339
+ def dedent_next; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:339
+ def embexpr_balance; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:389
+ def to_a; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:339
+ def tokens; end
+end
+
+# pkg:gem/prism#lib/prism/lex_compat.rb:337
+Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), Integer)
+
+# Heredocs that are no dash or tilde heredocs are just a list of tokens.
+# We need to keep them around so that we can insert them in the correct
+# order back into the token stream and set the state of the last token to
+# the state that the heredoc was opened in.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:258
+class Prism::LexCompat::Heredoc::PlainHeredoc
+ # pkg:gem/prism#lib/prism/lex_compat.rb:261
+ def initialize; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:265
+ def <<(token); end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:269
+ def to_a; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:259
+ def tokens; end
+end
+
+# Tokens where state should be ignored
+# used for :on_sp, :on_comment, :on_heredoc_end, :on_embexpr_end
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:244
+class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token
+ # pkg:gem/prism#lib/prism/lex_compat.rb:245
+ def ==(other); end
+end
+
+# This is a mapping of prism token types to Ripper token types. This is a
+# many-to-one mapping because we split up our token types, whereas Ripper
+# tends to group them.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:31
+Prism::LexCompat::RIPPER = T.let(T.unsafe(nil), Hash)
+
+# A result class specialized for holding tokens produced by the lexer.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:12
+class Prism::LexCompat::Result < ::Prism::Result
+ # Create a new lex compat result object with the given values.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:17
+ def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end
+
+ # Implement the hash pattern matching interface for Result.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:23
+ def deconstruct_keys(keys); end
+
+ # The list of tokens that were produced by the lexer.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:14
+ def value; end
+end
+
+# When we produce tokens, we produce the same arrays that Ripper does.
+# However, we add a couple of convenience methods onto them to make them a
+# little easier to work with. We delegate all other methods to the array.
+#
+# pkg:gem/prism#lib/prism/lex_compat.rb:202
+class Prism::LexCompat::Token < ::BasicObject
+ # Create a new token object with the given ripper-compatible array.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:204
+ def initialize(array); end
+
+ # We want to pretend that this is just an Array.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:229
+ def ==(other); end
+
+ # The type of the token.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:214
+ def event; end
+
+ # The location of the token in the source.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:209
+ def location; end
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:237
+ def method_missing(name, *_arg1, **_arg2, &_arg3); end
+
+ # The state of the lexer when this token was produced.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:224
+ def state; end
+
+ # The slice of the source that this token represents.
+ #
+ # pkg:gem/prism#lib/prism/lex_compat.rb:219
+ def value; end
+
+ private
+
+ # pkg:gem/prism#lib/prism/lex_compat.rb:233
+ def respond_to_missing?(name, include_private = T.unsafe(nil)); end
+end
+
+# This is a result specific to the `lex` and `lex_file` methods.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:778
+class Prism::LexResult < ::Prism::Result
+ # Create a new lex result object with the given values.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:783
+ sig do
+ params(
+ value: T::Array[T.untyped],
+ comments: T::Array[Prism::Comment],
+ magic_comments: T::Array[Prism::MagicComment],
+ data_loc: T.nilable(Prism::Location),
+ errors: T::Array[Prism::ParseError],
+ warnings: T::Array[Prism::ParseWarning],
+ source: Prism::Source
+ ).void
+ end
+ def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end
+
+ # Implement the hash pattern matching interface for LexResult.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:789
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # The list of tokens that were parsed from the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:780
+ sig { returns(T::Array[T.untyped]) }
+ def value; end
+end
+
+# Represents the use of the `&&=` operator for assignment to a local variable.
+#
+# target &&= value
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12513
+class Prism::LocalVariableAndWriteNode < ::Prism::Node
+ # Initialize a new LocalVariableAndWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12515
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ depth: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name_loc, operator_loc, value, name, depth); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12624
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12528
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12533
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12550
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12545
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer) -> LocalVariableAndWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12555
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableAndWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value, name: self.name, depth: self.depth); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12560
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12563
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12600
+ sig { returns(Integer) }
+ def depth; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:237
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12538
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12608
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12597
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12568
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12603
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12581
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12576
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12589
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12613
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12594
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12618
+ def type; end
+ end
+end
+
+# Represents assigning to a local variable using an operator that isn't `=`.
+#
+# target += value
+# ^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12638
+class Prism::LocalVariableOperatorWriteNode < ::Prism::Node
+ # Initialize a new LocalVariableOperatorWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12640
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ binary_operator: Symbol,
+ depth: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name_loc, binary_operator_loc, value, name, binary_operator, depth); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12748
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12654
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader binary_operator: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12726
+ sig { returns(Symbol) }
+ def binary_operator; end
+
+ # attr_reader binary_operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12707
+ sig { returns(Prism::Location) }
+ def binary_operator_loc; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12659
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12676
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12671
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?binary_operator: Symbol, ?depth: Integer) -> LocalVariableOperatorWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12681
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ binary_operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ binary_operator: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableOperatorWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name_loc: self.name_loc, binary_operator_loc: self.binary_operator_loc, value: self.value, name: self.name, binary_operator: self.binary_operator, depth: self.depth); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12686
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, binary_operator_loc: Location, value: Prism::node, name: Symbol, binary_operator: Symbol, depth: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12689
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12729
+ sig { returns(Integer) }
+ def depth; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:249
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12664
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12732
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12723
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12694
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # Returns the binary operator used to modify the receiver. This method is
+ # deprecated in favor of #binary_operator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:454
+ def operator; end
+
+ # Returns the location of the binary operator used to modify the receiver.
+ # This method is deprecated in favor of #binary_operator_loc.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:461
+ def operator_loc; end
+
+ # Save the binary_operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12715
+ def save_binary_operator_loc(repository); end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12702
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12737
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12720
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12742
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a local variable.
+#
+# target ||= value
+# ^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12763
+class Prism::LocalVariableOrWriteNode < ::Prism::Node
+ # Initialize a new LocalVariableOrWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12765
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ depth: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name_loc, operator_loc, value, name, depth); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12874
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12778
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12783
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12800
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12795
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer) -> LocalVariableOrWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12805
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableOrWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value, name: self.name, depth: self.depth); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12810
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12813
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12850
+ sig { returns(Integer) }
+ def depth; end
+
+ # pkg:gem/prism#lib/prism/desugar_compiler.rb:243
+ def desugar; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12788
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12858
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12847
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12818
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12853
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12831
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12826
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12839
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12863
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12844
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12868
+ def type; end
+ end
+end
+
+# Represents reading a local variable. Note that this requires that a local variable of the same name has already been written to in the same scope, otherwise it is parsed as a method call.
+#
+# foo
+# ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12888
+class Prism::LocalVariableReadNode < ::Prism::Node
+ # Initialize a new LocalVariableReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12890
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, depth); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12975
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12900
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12905
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12921
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12916
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer) -> LocalVariableReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12926
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, depth: self.depth); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12931
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12934
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # The number of visible scopes that should be searched to find the origin of this local variable.
+ #
+ # foo = 1; foo # depth 0
+ #
+ # bar = 2; tap { bar } # depth 1
+ #
+ # The specific rules for calculating the depth may differ from individual Ruby implementations, as they are not specified by the language. For more information, see [the Prism documentation](https://github.com/ruby/prism/blob/main/docs/local_variable_depth.md).
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12956
+ sig { returns(Integer) }
+ def depth; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12910
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12959
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the local variable, which is an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # x # name `:x`
+ #
+ # _Test # name `:_Test`
+ #
+ # Note that this can also be an underscore followed by a number for the default block parameters.
+ #
+ # _1 # name `:_1`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12947
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12964
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12969
+ def type; end
+ end
+end
+
+# Represents writing to a local variable in a context that doesn't have an explicit value.
+#
+# foo, bar = baz
+# ^^^ ^^^
+#
+# foo => baz
+# ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:12989
+class Prism::LocalVariableTargetNode < ::Prism::Node
+ # Initialize a new LocalVariableTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:12991
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, depth); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13062
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13001
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13006
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13022
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13017
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer) -> LocalVariableTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13027
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer
+ ).returns(Prism::LocalVariableTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, depth: self.depth); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13032
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13035
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13043
+ sig { returns(Integer) }
+ def depth; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13011
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13046
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13040
+ sig { returns(Symbol) }
+ def name; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13051
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13056
+ def type; end
+ end
+end
+
+# Represents writing to a local variable.
+#
+# foo = 1
+# ^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13073
+class Prism::LocalVariableWriteNode < ::Prism::Node
+ # Initialize a new LocalVariableWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13075
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, depth, name_loc, value, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13210
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13088
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13093
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13110
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13105
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> LocalVariableWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13115
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ depth: Integer,
+ name_loc: Prism::Location,
+ value: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::LocalVariableWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, depth: self.depth, name_loc: self.name_loc, value: self.value, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13120
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer, name_loc: Location, value: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13123
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # The number of semantic scopes we have to traverse to find the declaration of this variable.
+ #
+ # foo = 1 # depth 0
+ #
+ # tap { foo = 1 } # depth 1
+ #
+ # The specific rules for calculating the depth may differ from individual Ruby implementations, as they are not specified by the language. For more information, see [the Prism documentation](https://github.com/ruby/prism/blob/main/docs/local_variable_depth.md).
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13141
+ sig { returns(Integer) }
+ def depth; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13098
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13194
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The name of the local variable, which is an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers).
+ #
+ # foo = :bar # name `:foo`
+ #
+ # abc = 123 # name `:abc`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13132
+ sig { returns(Symbol) }
+ def name; end
+
+ # The location of the variable name.
+ #
+ # foo = :bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13147
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13189
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `=` operator.
+ #
+ # x = :y
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13176
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13155
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13184
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13199
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the local variable. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # foo = :bar
+ # ^^^^
+ #
+ # abc = 1234
+ # ^^^^
+ #
+ # Note that since the name of a local variable is known before the value is parsed, it is valid for a local variable to appear within the value of its own write.
+ #
+ # foo = foo
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13170
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13204
+ def type; end
+ end
+end
+
+# This represents a location in the source.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:287
+class Prism::Location
+ # Create a new location object with the given source, start byte offset, and
+ # byte length.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:302
+ sig { params(source: Prism::Source, start_offset: Integer, length: Integer).void }
+ def initialize(source, start_offset, length); end
+
+ # Returns true if the given other location is equal to this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:490
+ sig { params(other: T.untyped).returns(T::Boolean) }
+ def ==(other); end
+
+ # Join this location with the first occurrence of the string in the source
+ # that occurs after this location on the same line, and return the new
+ # location. This will raise an error if the string does not exist.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:509
+ sig { params(string: String).returns(Prism::Location) }
+ def adjoin(string); end
+
+ # The end column in code units using the given cache to fetch or calculate
+ # the value.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:475
+ sig do
+ params(
+ cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
+ ).returns(Integer)
+ end
+ def cached_end_code_units_column(cache); end
+
+ # The end offset from the start of the file in code units using the given
+ # cache to fetch or calculate the value.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:411
+ sig do
+ params(
+ cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
+ ).returns(Integer)
+ end
+ def cached_end_code_units_offset(cache); end
+
+ # The start column in code units using the given cache to fetch or calculate
+ # the value.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:451
+ sig do
+ params(
+ cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
+ ).returns(Integer)
+ end
+ def cached_start_code_units_column(cache); end
+
+ # The start offset from the start of the file in code units using the given
+ # cache to fetch or calculate the value.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:389
+ sig do
+ params(
+ cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer))
+ ).returns(Integer)
+ end
+ def cached_start_code_units_offset(cache); end
+
+ # Returns a new location that is the result of chopping off the last byte.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:348
+ sig { returns(Prism::Location) }
+ def chop; end
+
+ # Returns all comments that are associated with this location (both leading
+ # and trailing comments).
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:338
+ sig { returns(T::Array[Prism::Comment]) }
+ def comments; end
+
+ # Create a new location object with the given options.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:343
+ sig { params(source: Prism::Source, start_offset: Integer, length: Integer).returns(Prism::Location) }
+ def copy(source: self.source, start_offset: self.start_offset, length: self.length); end
+
+ # Implement the hash pattern matching interface for Location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:480
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # The column number in characters where this location ends from the start of
+ # the line.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:463
+ sig { returns(Integer) }
+ def end_character_column; end
+
+ # The character offset from the beginning of the source where this location
+ # ends.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:400
+ sig { returns(Integer) }
+ def end_character_offset; end
+
+ # The column number in code units of the given encoding where this location
+ # ends from the start of the line.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:469
+ sig { params(encoding: Encoding).returns(Integer) }
+ def end_code_units_column(encoding = Encoding::UTF_16LE); end
+
+ # The offset from the start of the file in code units of the given encoding.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:405
+ sig { params(encoding: Encoding).returns(Integer) }
+ def end_code_units_offset(encoding = Encoding::UTF_16LE); end
+
+ # The column number in bytes where this location ends from the start of the
+ # line.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:457
+ sig { returns(Integer) }
+ def end_column; end
+
+ # The line number where this location ends.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:427
+ sig { returns(Integer) }
+ def end_line; end
+
+ # The byte offset from the beginning of the source where this location ends.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:394
+ sig { returns(Integer) }
+ def end_offset; end
+
+ # Returns a string representation of this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:353
+ sig { returns(String) }
+ def inspect; end
+
+ # Returns a new location that stretches from this location to the given
+ # other location. Raises an error if this location is not before the other
+ # location or if they don't share the same source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:499
+ sig { params(other: Prism::Location).returns(Prism::Location) }
+ def join(other); end
+
+ # Attach a comment to the leading comments of this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:321
+ sig { params(comment: Prism::Comment).void }
+ def leading_comment(comment); end
+
+ # These are the comments that are associated with this location that exist
+ # before the start of this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:316
+ sig { returns(T::Array[Prism::Comment]) }
+ def leading_comments; end
+
+ # The length of this location in bytes.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:298
+ sig { returns(Integer) }
+ def length; end
+
+ # Implement the pretty print interface for Location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:485
+ sig { params(q: T.untyped).void }
+ def pretty_print(q); end
+
+ # The source code that this location represents.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:363
+ sig { returns(String) }
+ def slice; end
+
+ # The source code that this location represents starting from the beginning
+ # of the line that this location starts on to the end of the line that this
+ # location ends on.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:370
+ def slice_lines; end
+
+ # Returns all of the lines of the source code associated with this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:358
+ sig { returns(T::Array[String]) }
+ def source_lines; end
+
+ # The column number in characters where this location ends from the start of
+ # the line.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:439
+ sig { returns(Integer) }
+ def start_character_column; end
+
+ # The character offset from the beginning of the source where this location
+ # starts.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:378
+ sig { returns(Integer) }
+ def start_character_offset; end
+
+ # The column number in code units of the given encoding where this location
+ # starts from the start of the line.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:445
+ sig { params(encoding: Encoding).returns(Integer) }
+ def start_code_units_column(encoding = Encoding::UTF_16LE); end
+
+ # The offset from the start of the file in code units of the given encoding.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:383
+ sig { params(encoding: Encoding).returns(Integer) }
+ def start_code_units_offset(encoding = Encoding::UTF_16LE); end
+
+ # The column number in bytes where this location starts from the start of
+ # the line.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:433
+ sig { returns(Integer) }
+ def start_column; end
+
+ # The line number where this location starts.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:416
+ sig { returns(Integer) }
+ def start_line; end
+
+ # The content of the line where this location starts before this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:421
+ sig { returns(String) }
+ def start_line_slice; end
+
+ # The byte offset from the beginning of the source where this location
+ # starts.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:295
+ sig { returns(Integer) }
+ def start_offset; end
+
+ # Attach a comment to the trailing comments of this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:332
+ sig { params(comment: Prism::Comment).void }
+ def trailing_comment(comment); end
+
+ # These are the comments that are associated with this location that exist
+ # after the end of this location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:327
+ sig { returns(T::Array[Prism::Comment]) }
+ def trailing_comments; end
+
+ protected
+
+ # A Source object that is used to determine more information from the given
+ # offset and length.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:290
+ sig { returns(Prism::Source) }
+ def source; end
+end
+
+# Flags for while and until loop nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19858
+module Prism::LoopFlags; end
+
+# a loop after a begin statement, so the body is executed first before the condition
+#
+# pkg:gem/prism#lib/prism/node.rb:19860
+Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer)
+
+# This represents a magic comment that was encountered during parsing.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:571
+class Prism::MagicComment
+ # Create a new magic comment object with the given key and value locations.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:579
+ sig { params(key_loc: Prism::Location, value_loc: Prism::Location).void }
+ def initialize(key_loc, value_loc); end
+
+ # Implement the hash pattern matching interface for MagicComment.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:595
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # Returns a string representation of this magic comment.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:600
+ sig { returns(String) }
+ def inspect; end
+
+ # Returns the key of the magic comment by slicing it from the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:585
+ sig { returns(String) }
+ def key; end
+
+ # A Location object representing the location of the key in the source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:573
+ sig { returns(Prism::Location) }
+ def key_loc; end
+
+ # Returns the value of the magic comment by slicing it from the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:590
+ sig { returns(String) }
+ def value; end
+
+ # A Location object representing the location of the value in the source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:576
+ sig { returns(Prism::Location) }
+ def value_loc; end
+end
+
+# Represents a regular expression literal used in the predicate of a conditional to implicitly match against the last line read by an IO object.
+#
+# if /foo/i then end
+# ^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13224
+class Prism::MatchLastLineNode < ::Prism::Node
+ include ::Prism::RegularExpressionOptions
+
+ # Initialize a new MatchLastLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13226
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, content_loc, closing_loc, unescaped); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13405
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13238
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13302
+ sig { returns(T::Boolean) }
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13243
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13384
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13358
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13259
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13254
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13379
+ sig { returns(String) }
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13345
+ sig { returns(Prism::Location) }
+ def content_loc; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> MatchLastLineNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13264
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).returns(Prism::MatchLastLineNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, content_loc: self.content_loc, closing_loc: self.closing_loc, unescaped: self.unescaped); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13269
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13272
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13248
+ def each_child_node; end
+
+ # def euc_jp?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13297
+ sig { returns(T::Boolean) }
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13282
+ sig { returns(T::Boolean) }
+ def extended?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13322
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13327
+ sig { returns(T::Boolean) }
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13317
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def ignore_case?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13277
+ sig { returns(T::Boolean) }
+ def ignore_case?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13389
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def multi_line?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13287
+ sig { returns(T::Boolean) }
+ def multi_line?; end
+
+ # def once?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13292
+ sig { returns(T::Boolean) }
+ def once?; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13374
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13332
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ sig { returns(Integer) }
+ def options; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13366
+ def save_closing_loc(repository); end
+
+ # Save the content_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13353
+ def save_content_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13340
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13394
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13371
+ sig { returns(String) }
+ def unescaped; end
+
+ # def utf_8?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13312
+ sig { returns(T::Boolean) }
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13307
+ sig { returns(T::Boolean) }
+ def windows_31j?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13399
+ def type; end
+ end
+end
+
+# Represents the use of the modifier `in` operator.
+#
+# foo in bar
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13419
+class Prism::MatchPredicateNode < ::Prism::Node
+ # Initialize a new MatchPredicateNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13421
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ pattern: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, value, pattern, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13513
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13432
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13437
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13455
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13450
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location) -> MatchPredicateNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13460
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ pattern: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::MatchPredicateNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value, pattern: self.pattern, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13465
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, pattern: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13468
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13442
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13497
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13492
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13479
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # attr_reader pattern: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13476
+ sig { returns(Prism::Node) }
+ def pattern; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13487
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13502
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13473
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13507
+ def type; end
+ end
+end
+
+# Represents the use of the `=>` operator.
+#
+# foo => bar
+# ^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13525
+class Prism::MatchRequiredNode < ::Prism::Node
+ # Initialize a new MatchRequiredNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13527
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ pattern: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, value, pattern, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13667
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13538
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13543
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13561
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13556
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location) -> MatchRequiredNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13566
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ value: Prism::Node,
+ pattern: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::MatchRequiredNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, value: self.value, pattern: self.pattern, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13571
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, pattern: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13574
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13548
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13651
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13646
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the operator.
+ #
+ # foo => bar
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13633
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents the right-hand side of the operator. The type of the node depends on the expression.
+ #
+ # Anything that looks like a local variable name (including `_`) will result in a `LocalVariableTargetNode`.
+ #
+ # foo => a # This is equivalent to writing `a = foo`
+ # ^
+ #
+ # Using an explicit `Array` or combining expressions with `,` will result in a `ArrayPatternNode`. This can be preceded by a constant.
+ #
+ # foo => [a]
+ # ^^^
+ #
+ # foo => a, b
+ # ^^^^
+ #
+ # foo => Bar[a, b]
+ # ^^^^^^^^^
+ #
+ # If the array pattern contains at least two wildcard matches, a `FindPatternNode` is created instead.
+ #
+ # foo => *, 1, *a
+ # ^^^^^
+ #
+ # Using an explicit `Hash` or a constant with square brackets and hash keys in the square brackets will result in a `HashPatternNode`.
+ #
+ # foo => { a: 1, b: }
+ #
+ # foo => Bar[a: 1, b:]
+ #
+ # foo => Bar[**]
+ #
+ # To use any variable that needs run time evaluation, pinning is required. This results in a `PinnedVariableNode`
+ #
+ # foo => ^a
+ # ^^
+ #
+ # Similar, any expression can be used with pinning. This results in a `PinnedExpressionNode`.
+ #
+ # foo => ^(a + 1)
+ #
+ # Anything else will result in the regular node for that expression, for example a `ConstantReadNode`.
+ #
+ # foo => CONST
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13627
+ sig { returns(Prism::Node) }
+ def pattern; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13641
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13656
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Represents the left-hand side of the operator.
+ #
+ # foo => bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13582
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13661
+ def type; end
+ end
+end
+
+# Represents writing local variables using a regular expression match with named capture groups.
+#
+# /(?bar)/ =~ baz
+# ^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13679
+class Prism::MatchWriteNode < ::Prism::Node
+ # Initialize a new MatchWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13681
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ call: Prism::CallNode,
+ targets: T::Array[Prism::LocalVariableTargetNode]
+ ).void
+ end
+ def initialize(source, node_id, location, flags, call, targets); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13754
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13691
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader call: CallNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13732
+ sig { returns(Prism::CallNode) }
+ def call; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13696
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13714
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13709
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?call: CallNode, ?targets: Array[LocalVariableTargetNode]) -> MatchWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13719
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ call: Prism::CallNode,
+ targets: T::Array[Prism::LocalVariableTargetNode]
+ ).returns(Prism::MatchWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, call: self.call, targets: self.targets); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13724
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, call: CallNode, targets: Array[LocalVariableTargetNode] }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13727
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13701
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13738
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader targets: Array[LocalVariableTargetNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13735
+ sig { returns(T::Array[Prism::LocalVariableTargetNode]) }
+ def targets; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13743
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13748
+ def type; end
+ end
+end
+
+# Represents a node that is missing from the source and results in a syntax error.
+#
+# pkg:gem/prism#lib/prism/node.rb:13763
+class Prism::MissingNode < ::Prism::Node
+ # Initialize a new MissingNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13765
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13828
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13773
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13778
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13794
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13789
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> MissingNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13799
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::MissingNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13804
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13807
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13783
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13812
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13817
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13822
+ def type; end
+ end
+end
+
+# Represents a module declaration involving the `module` keyword.
+#
+# module Foo end
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13837
+class Prism::ModuleNode < ::Prism::Node
+ # Initialize a new ModuleNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13839
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ module_keyword_loc: Prism::Location,
+ constant_path: T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::MissingNode),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location,
+ name: Symbol
+ ).void
+ end
+ def initialize(source, node_id, location, flags, locals, module_keyword_loc, constant_path, body, end_keyword_loc, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13961
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13853
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader body: StatementsNode | BeginNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13916
+ sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13858
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13879
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13871
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # attr_reader constant_path: ConstantReadNode | ConstantPathNode | MissingNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13913
+ sig { returns(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::MissingNode)) }
+ def constant_path; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?module_keyword_loc: Location, ?constant_path: ConstantReadNode | ConstantPathNode | MissingNode, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location, ?name: Symbol) -> ModuleNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13884
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ module_keyword_loc: Prism::Location,
+ constant_path: T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::MissingNode),
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location,
+ name: Symbol
+ ).returns(Prism::ModuleNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, module_keyword_loc: self.module_keyword_loc, constant_path: self.constant_path, body: self.body, end_keyword_loc: self.end_keyword_loc, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13889
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], module_keyword_loc: Location, constant_path: ConstantReadNode | ConstantPathNode | MissingNode, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13892
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13863
+ def each_child_node; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13940
+ sig { returns(String) }
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13919
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13945
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13897
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # def module_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13935
+ sig { returns(String) }
+ def module_keyword; end
+
+ # attr_reader module_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13900
+ sig { returns(Prism::Location) }
+ def module_keyword_loc; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13932
+ sig { returns(Symbol) }
+ def name; end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13927
+ def save_end_keyword_loc(repository); end
+
+ # Save the module_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13908
+ def save_module_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13950
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13955
+ def type; end
+ end
+end
+
+# Represents a multi-target expression.
+#
+# a, (b, c) = 1, 2, 3
+# ^^^^^^
+#
+# This can be a part of `MultiWriteNode` as above, or the target of a `for` loop
+#
+# for a, b in [[1, 2], [3, 4]]
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:13982
+class Prism::MultiTargetNode < ::Prism::Node
+ # Initialize a new MultiTargetNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13984
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ rest: T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode)),
+ rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, lefts, rest, rights, lparen_loc, rparen_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14146
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:13997
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14002
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14025
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14016
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: ImplicitRestNode | SplatNode | nil, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?) -> MultiTargetNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14030
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ rest: T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode)),
+ rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location)
+ ).returns(Prism::MultiTargetNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, lefts: self.lefts, rest: self.rest, rights: self.rights, lparen_loc: self.lparen_loc, rparen_loc: self.rparen_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14035
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: ImplicitRestNode | SplatNode | nil, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], lparen_loc: Location?, rparen_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14038
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14007
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14130
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the targets expressions before a splat node.
+ #
+ # a, (b, c, *) = 1, 2, 3, 4, 5
+ # ^^^^
+ #
+ # The splat node can be absent, in that case all target expressions are in the left field.
+ #
+ # a, (b, c) = 1, 2, 3, 4, 5
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14051
+ sig do
+ returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
+ end
+ def lefts; end
+
+ # def lparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14120
+ sig { returns(T.nilable(String)) }
+ def lparen; end
+
+ # The location of the opening parenthesis.
+ #
+ # a, (b, c) = 1, 2, 3
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14079
+ sig { returns(T.nilable(Prism::Location)) }
+ def lparen_loc; end
+
+ # Represents a splat node in the target expression.
+ #
+ # a, (b, *c) = 1, 2, 3, 4
+ # ^^
+ #
+ # The variable can be empty, this results in a `SplatNode` with a `nil` expression field.
+ #
+ # a, (b, *) = 1, 2, 3, 4
+ # ^
+ #
+ # If the `*` is omitted, this field will contain an `ImplicitRestNode`
+ #
+ # a, (b,) = 1, 2, 3, 4
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14067
+ sig { returns(T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode))) }
+ def rest; end
+
+ # Represents the targets expressions after a splat node.
+ #
+ # a, (*, b, c) = 1, 2, 3, 4, 5
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14073
+ sig do
+ returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
+ end
+ def rights; end
+
+ # def rparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14125
+ sig { returns(T.nilable(String)) }
+ def rparen; end
+
+ # The location of the closing parenthesis.
+ #
+ # a, (b, c) = 1, 2, 3
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14101
+ sig { returns(T.nilable(Prism::Location)) }
+ def rparen_loc; end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14093
+ def save_lparen_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14115
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14135
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14140
+ def type; end
+ end
+end
+
+# Represents a write to a multi-target expression.
+#
+# a, b, c = 1, 2, 3
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:14162
+class Prism::MultiWriteNode < ::Prism::Node
+ # Initialize a new MultiWriteNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14164
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ rest: T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode)),
+ rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14357
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14179
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14184
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14209
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14199
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: ImplicitRestNode | SplatNode | nil, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?operator_loc: Location, ?value: Prism::node) -> MultiWriteNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14214
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ rest: T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode)),
+ rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)],
+ lparen_loc: T.nilable(Prism::Location),
+ rparen_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::MultiWriteNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, lefts: self.lefts, rest: self.rest, rights: self.rights, lparen_loc: self.lparen_loc, rparen_loc: self.rparen_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14219
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: ImplicitRestNode | SplatNode | nil, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14222
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14189
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14341
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the targets expressions before a splat node.
+ #
+ # a, b, * = 1, 2, 3, 4, 5
+ # ^^^^
+ #
+ # The splat node can be absent, in that case all target expressions are in the left field.
+ #
+ # a, b, c = 1, 2, 3, 4, 5
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14235
+ sig do
+ returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
+ end
+ def lefts; end
+
+ # def lparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14326
+ sig { returns(T.nilable(String)) }
+ def lparen; end
+
+ # The location of the opening parenthesis.
+ #
+ # (a, b, c) = 1, 2, 3
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14263
+ sig { returns(T.nilable(Prism::Location)) }
+ def lparen_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14336
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the operator.
+ #
+ # a, b, c = 1, 2, 3
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14307
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents a splat node in the target expression.
+ #
+ # a, b, *c = 1, 2, 3, 4
+ # ^^
+ #
+ # The variable can be empty, this results in a `SplatNode` with a `nil` expression field.
+ #
+ # a, b, * = 1, 2, 3, 4
+ # ^
+ #
+ # If the `*` is omitted, this field will contain an `ImplicitRestNode`
+ #
+ # a, b, = 1, 2, 3, 4
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14251
+ sig { returns(T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode))) }
+ def rest; end
+
+ # Represents the targets expressions after a splat node.
+ #
+ # a, *, b, c = 1, 2, 3, 4, 5
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14257
+ sig do
+ returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)])
+ end
+ def rights; end
+
+ # def rparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14331
+ sig { returns(T.nilable(String)) }
+ def rparen; end
+
+ # The location of the closing parenthesis.
+ #
+ # (a, b, c) = 1, 2, 3
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14285
+ sig { returns(T.nilable(Prism::Location)) }
+ def rparen_loc; end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14277
+ def save_lparen_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14315
+ def save_operator_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14299
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14346
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The value to write to the targets. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # a, b, c = 1, 2, 3
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14323
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14351
+ def type; end
+ end
+end
+
+# This visitor walks through the tree and copies each node as it is being
+# visited. This is useful for consumers that want to mutate the tree, as you
+# can change subtrees in place without effecting the rest of the tree.
+#
+# pkg:gem/prism#lib/prism/mutation_compiler.rb:16
+class Prism::MutationCompiler < ::Prism::Compiler
+ # Copy a AliasGlobalVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:18
+ def visit_alias_global_variable_node(node); end
+
+ # Copy a AliasMethodNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:23
+ def visit_alias_method_node(node); end
+
+ # Copy a AlternationPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:28
+ def visit_alternation_pattern_node(node); end
+
+ # Copy a AndNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:33
+ def visit_and_node(node); end
+
+ # Copy a ArgumentsNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:38
+ def visit_arguments_node(node); end
+
+ # Copy a ArrayNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:43
+ def visit_array_node(node); end
+
+ # Copy a ArrayPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:48
+ def visit_array_pattern_node(node); end
+
+ # Copy a AssocNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:53
+ def visit_assoc_node(node); end
+
+ # Copy a AssocSplatNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:58
+ def visit_assoc_splat_node(node); end
+
+ # Copy a BackReferenceReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:63
+ def visit_back_reference_read_node(node); end
+
+ # Copy a BeginNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:68
+ def visit_begin_node(node); end
+
+ # Copy a BlockArgumentNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:73
+ def visit_block_argument_node(node); end
+
+ # Copy a BlockLocalVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:78
+ def visit_block_local_variable_node(node); end
+
+ # Copy a BlockNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:83
+ def visit_block_node(node); end
+
+ # Copy a BlockParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:88
+ def visit_block_parameter_node(node); end
+
+ # Copy a BlockParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:93
+ def visit_block_parameters_node(node); end
+
+ # Copy a BreakNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:98
+ def visit_break_node(node); end
+
+ # Copy a CallAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:103
+ def visit_call_and_write_node(node); end
+
+ # Copy a CallNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:108
+ def visit_call_node(node); end
+
+ # Copy a CallOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:113
+ def visit_call_operator_write_node(node); end
+
+ # Copy a CallOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:118
+ def visit_call_or_write_node(node); end
+
+ # Copy a CallTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:123
+ def visit_call_target_node(node); end
+
+ # Copy a CapturePatternNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:128
+ def visit_capture_pattern_node(node); end
+
+ # Copy a CaseMatchNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:133
+ def visit_case_match_node(node); end
+
+ # Copy a CaseNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:138
+ def visit_case_node(node); end
+
+ # Copy a ClassNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:143
+ def visit_class_node(node); end
+
+ # Copy a ClassVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:148
+ def visit_class_variable_and_write_node(node); end
+
+ # Copy a ClassVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:153
+ def visit_class_variable_operator_write_node(node); end
+
+ # Copy a ClassVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:158
+ def visit_class_variable_or_write_node(node); end
+
+ # Copy a ClassVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:163
+ def visit_class_variable_read_node(node); end
+
+ # Copy a ClassVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:168
+ def visit_class_variable_target_node(node); end
+
+ # Copy a ClassVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:173
+ def visit_class_variable_write_node(node); end
+
+ # Copy a ConstantAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:178
+ def visit_constant_and_write_node(node); end
+
+ # Copy a ConstantOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:183
+ def visit_constant_operator_write_node(node); end
+
+ # Copy a ConstantOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:188
+ def visit_constant_or_write_node(node); end
+
+ # Copy a ConstantPathAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:193
+ def visit_constant_path_and_write_node(node); end
+
+ # Copy a ConstantPathNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:198
+ def visit_constant_path_node(node); end
+
+ # Copy a ConstantPathOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:203
+ def visit_constant_path_operator_write_node(node); end
+
+ # Copy a ConstantPathOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:208
+ def visit_constant_path_or_write_node(node); end
+
+ # Copy a ConstantPathTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:213
+ def visit_constant_path_target_node(node); end
+
+ # Copy a ConstantPathWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:218
+ def visit_constant_path_write_node(node); end
+
+ # Copy a ConstantReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:223
+ def visit_constant_read_node(node); end
+
+ # Copy a ConstantTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:228
+ def visit_constant_target_node(node); end
+
+ # Copy a ConstantWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:233
+ def visit_constant_write_node(node); end
+
+ # Copy a DefNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:238
+ def visit_def_node(node); end
+
+ # Copy a DefinedNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:243
+ def visit_defined_node(node); end
+
+ # Copy a ElseNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:248
+ def visit_else_node(node); end
+
+ # Copy a EmbeddedStatementsNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:253
+ def visit_embedded_statements_node(node); end
+
+ # Copy a EmbeddedVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:258
+ def visit_embedded_variable_node(node); end
+
+ # Copy a EnsureNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:263
+ def visit_ensure_node(node); end
+
+ # Copy a FalseNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:268
+ def visit_false_node(node); end
+
+ # Copy a FindPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:273
+ def visit_find_pattern_node(node); end
+
+ # Copy a FlipFlopNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:278
+ def visit_flip_flop_node(node); end
+
+ # Copy a FloatNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:283
+ def visit_float_node(node); end
+
+ # Copy a ForNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:288
+ def visit_for_node(node); end
+
+ # Copy a ForwardingArgumentsNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:293
+ def visit_forwarding_arguments_node(node); end
+
+ # Copy a ForwardingParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:298
+ def visit_forwarding_parameter_node(node); end
+
+ # Copy a ForwardingSuperNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:303
+ def visit_forwarding_super_node(node); end
+
+ # Copy a GlobalVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:308
+ def visit_global_variable_and_write_node(node); end
+
+ # Copy a GlobalVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:313
+ def visit_global_variable_operator_write_node(node); end
+
+ # Copy a GlobalVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:318
+ def visit_global_variable_or_write_node(node); end
+
+ # Copy a GlobalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:323
+ def visit_global_variable_read_node(node); end
+
+ # Copy a GlobalVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:328
+ def visit_global_variable_target_node(node); end
+
+ # Copy a GlobalVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:333
+ def visit_global_variable_write_node(node); end
+
+ # Copy a HashNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:338
+ def visit_hash_node(node); end
+
+ # Copy a HashPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:343
+ def visit_hash_pattern_node(node); end
+
+ # Copy a IfNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:348
+ def visit_if_node(node); end
+
+ # Copy a ImaginaryNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:353
+ def visit_imaginary_node(node); end
+
+ # Copy a ImplicitNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:358
+ def visit_implicit_node(node); end
+
+ # Copy a ImplicitRestNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:363
+ def visit_implicit_rest_node(node); end
+
+ # Copy a InNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:368
+ def visit_in_node(node); end
+
+ # Copy a IndexAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:373
+ def visit_index_and_write_node(node); end
+
+ # Copy a IndexOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:378
+ def visit_index_operator_write_node(node); end
+
+ # Copy a IndexOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:383
+ def visit_index_or_write_node(node); end
+
+ # Copy a IndexTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:388
+ def visit_index_target_node(node); end
+
+ # Copy a InstanceVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:393
+ def visit_instance_variable_and_write_node(node); end
+
+ # Copy a InstanceVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:398
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Copy a InstanceVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:403
+ def visit_instance_variable_or_write_node(node); end
+
+ # Copy a InstanceVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:408
+ def visit_instance_variable_read_node(node); end
+
+ # Copy a InstanceVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:413
+ def visit_instance_variable_target_node(node); end
+
+ # Copy a InstanceVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:418
+ def visit_instance_variable_write_node(node); end
+
+ # Copy a IntegerNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:423
+ def visit_integer_node(node); end
+
+ # Copy a InterpolatedMatchLastLineNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:428
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Copy a InterpolatedRegularExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:433
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Copy a InterpolatedStringNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:438
+ def visit_interpolated_string_node(node); end
+
+ # Copy a InterpolatedSymbolNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:443
+ def visit_interpolated_symbol_node(node); end
+
+ # Copy a InterpolatedXStringNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:448
+ def visit_interpolated_x_string_node(node); end
+
+ # Copy a ItLocalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:453
+ def visit_it_local_variable_read_node(node); end
+
+ # Copy a ItParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:458
+ def visit_it_parameters_node(node); end
+
+ # Copy a KeywordHashNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:463
+ def visit_keyword_hash_node(node); end
+
+ # Copy a KeywordRestParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:468
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Copy a LambdaNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:473
+ def visit_lambda_node(node); end
+
+ # Copy a LocalVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:478
+ def visit_local_variable_and_write_node(node); end
+
+ # Copy a LocalVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:483
+ def visit_local_variable_operator_write_node(node); end
+
+ # Copy a LocalVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:488
+ def visit_local_variable_or_write_node(node); end
+
+ # Copy a LocalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:493
+ def visit_local_variable_read_node(node); end
+
+ # Copy a LocalVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:498
+ def visit_local_variable_target_node(node); end
+
+ # Copy a LocalVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:503
+ def visit_local_variable_write_node(node); end
+
+ # Copy a MatchLastLineNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:508
+ def visit_match_last_line_node(node); end
+
+ # Copy a MatchPredicateNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:513
+ def visit_match_predicate_node(node); end
+
+ # Copy a MatchRequiredNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:518
+ def visit_match_required_node(node); end
+
+ # Copy a MatchWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:523
+ def visit_match_write_node(node); end
+
+ # Copy a MissingNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:528
+ def visit_missing_node(node); end
+
+ # Copy a ModuleNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:533
+ def visit_module_node(node); end
+
+ # Copy a MultiTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:538
+ def visit_multi_target_node(node); end
+
+ # Copy a MultiWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:543
+ def visit_multi_write_node(node); end
+
+ # Copy a NextNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:548
+ def visit_next_node(node); end
+
+ # Copy a NilNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:553
+ def visit_nil_node(node); end
+
+ # Copy a NoKeywordsParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:558
+ def visit_no_keywords_parameter_node(node); end
+
+ # Copy a NumberedParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:563
+ def visit_numbered_parameters_node(node); end
+
+ # Copy a NumberedReferenceReadNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:568
+ def visit_numbered_reference_read_node(node); end
+
+ # Copy a OptionalKeywordParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:573
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Copy a OptionalParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:578
+ def visit_optional_parameter_node(node); end
+
+ # Copy a OrNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:583
+ def visit_or_node(node); end
+
+ # Copy a ParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:588
+ def visit_parameters_node(node); end
+
+ # Copy a ParenthesesNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:593
+ def visit_parentheses_node(node); end
+
+ # Copy a PinnedExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:598
+ def visit_pinned_expression_node(node); end
+
+ # Copy a PinnedVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:603
+ def visit_pinned_variable_node(node); end
+
+ # Copy a PostExecutionNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:608
+ def visit_post_execution_node(node); end
+
+ # Copy a PreExecutionNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:613
+ def visit_pre_execution_node(node); end
+
+ # Copy a ProgramNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:618
+ def visit_program_node(node); end
+
+ # Copy a RangeNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:623
+ def visit_range_node(node); end
+
+ # Copy a RationalNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:628
+ def visit_rational_node(node); end
+
+ # Copy a RedoNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:633
+ def visit_redo_node(node); end
+
+ # Copy a RegularExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:638
+ def visit_regular_expression_node(node); end
+
+ # Copy a RequiredKeywordParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:643
+ def visit_required_keyword_parameter_node(node); end
+
+ # Copy a RequiredParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:648
+ def visit_required_parameter_node(node); end
+
+ # Copy a RescueModifierNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:653
+ def visit_rescue_modifier_node(node); end
+
+ # Copy a RescueNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:658
+ def visit_rescue_node(node); end
+
+ # Copy a RestParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:663
+ def visit_rest_parameter_node(node); end
+
+ # Copy a RetryNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:668
+ def visit_retry_node(node); end
+
+ # Copy a ReturnNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:673
+ def visit_return_node(node); end
+
+ # Copy a SelfNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:678
+ def visit_self_node(node); end
+
+ # Copy a ShareableConstantNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:683
+ def visit_shareable_constant_node(node); end
+
+ # Copy a SingletonClassNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:688
+ def visit_singleton_class_node(node); end
+
+ # Copy a SourceEncodingNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:693
+ def visit_source_encoding_node(node); end
+
+ # Copy a SourceFileNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:698
+ def visit_source_file_node(node); end
+
+ # Copy a SourceLineNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:703
+ def visit_source_line_node(node); end
+
+ # Copy a SplatNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:708
+ def visit_splat_node(node); end
+
+ # Copy a StatementsNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:713
+ def visit_statements_node(node); end
+
+ # Copy a StringNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:718
+ def visit_string_node(node); end
+
+ # Copy a SuperNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:723
+ def visit_super_node(node); end
+
+ # Copy a SymbolNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:728
+ def visit_symbol_node(node); end
+
+ # Copy a TrueNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:733
+ def visit_true_node(node); end
+
+ # Copy a UndefNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:738
+ def visit_undef_node(node); end
+
+ # Copy a UnlessNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:743
+ def visit_unless_node(node); end
+
+ # Copy a UntilNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:748
+ def visit_until_node(node); end
+
+ # Copy a WhenNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:753
+ def visit_when_node(node); end
+
+ # Copy a WhileNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:758
+ def visit_while_node(node); end
+
+ # Copy a XStringNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:763
+ def visit_x_string_node(node); end
+
+ # Copy a YieldNode node
+ #
+ # pkg:gem/prism#lib/prism/mutation_compiler.rb:768
+ def visit_yield_node(node); end
+end
+
+# Represents the use of the `next` keyword.
+#
+# next 1
+# ^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:14375
+class Prism::NextNode < ::Prism::Node
+ # Initialize a new NextNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14377
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, arguments, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14466
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14387
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14429
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14392
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14411
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14404
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: ArgumentsNode?, ?keyword_loc: Location) -> NextNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14416
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ arguments: T.nilable(Prism::ArgumentsNode),
+ keyword_loc: Prism::Location
+ ).returns(Prism::NextNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, arguments: self.arguments, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14421
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: ArgumentsNode?, keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14424
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14397
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14450
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14445
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14432
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14440
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14455
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14460
+ def type; end
+ end
+end
+
+# Represents the use of the `nil` keyword.
+#
+# nil
+# ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:14477
+class Prism::NilNode < ::Prism::Node
+ # Initialize a new NilNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14479
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14542
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14487
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14492
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14508
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14503
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> NilNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14513
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::NilNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14518
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14521
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14497
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14526
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14531
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14536
+ def type; end
+ end
+end
+
+# Represents the use of `**nil` inside method arguments.
+#
+# def a(**nil)
+# ^^^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:14552
+class Prism::NoKeywordsParameterNode < ::Prism::Node
+ # Initialize a new NoKeywordsParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14554
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, operator_loc, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14655
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14564
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14569
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14585
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14580
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?keyword_loc: Location) -> NoKeywordsParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14590
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ keyword_loc: Prism::Location
+ ).returns(Prism::NoKeywordsParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, operator_loc: self.operator_loc, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14595
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14598
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14574
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14639
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14634
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14616
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14629
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14603
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14624
+ def save_keyword_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14611
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14644
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14649
+ def type; end
+ end
+end
+
+# This represents a node in the tree. It is the parent class of all of the
+# various node types.
+#
+# pkg:gem/prism#lib/prism/node.rb:15
+class Prism::Node
+ abstract!
+
+ # Accepts a visitor and calls back into the specialized visit function.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:269
+ sig { abstract.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # Returns the first node that matches the given block when visited in a
+ # breadth-first search. This is useful for finding a node that matches a
+ # particular condition.
+ #
+ # node.breadth_first_search { |node| node.node_id == node_id }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:219
+ sig { params(block: T.proc.params(node: Prism::Node).returns(T::Boolean)).returns(T.nilable(Prism::Node)) }
+ def breadth_first_search(&block); end
+
+ # Returns all of the nodes that match the given block when visited in a
+ # breadth-first search. This is useful for finding all nodes that match a
+ # particular condition.
+ #
+ # node.breadth_first_search_all { |node| node.is_a?(Prism::CallNode) }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:237
+ sig { params(block: T.proc.params(node: Prism::Node).returns(T::Boolean)).returns(T::Array[Prism::Node]) }
+ def breadth_first_search_all(&block); end
+
+ # Delegates to the cached_end_code_units_column of the associated location
+ # object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:118
+ def cached_end_code_units_column(cache); end
+
+ # Delegates to the cached_end_code_units_offset of the associated location
+ # object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:86
+ def cached_end_code_units_offset(cache); end
+
+ # Delegates to the cached_start_code_units_column of the associated location
+ # object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:112
+ def cached_start_code_units_column(cache); end
+
+ # Delegates to the cached_start_code_units_offset of the associated location
+ # object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:80
+ def cached_start_code_units_offset(cache); end
+
+ # Returns an array of child nodes, including `nil`s in the place of optional
+ # nodes that were not present.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:275
+ sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # Returns an array of child nodes and locations that could potentially have
+ # comments attached to them.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:296
+ sig { abstract.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # Delegates to the comments of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:133
+ def comments; end
+
+ # Returns an array of child nodes, excluding any `nil`s in the place of
+ # optional nodes that were not present.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:290
+ sig { abstract.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # pkg:gem/prism#lib/prism/node.rb:279
+ sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # pkg:gem/prism#lib/prism/node_ext.rb:10
+ def deprecated(*replacements); end
+
+ # With a block given, yields each child node. Without a block, returns
+ # an enumerator that contains each child node. Excludes any `nil`s in
+ # the place of optional nodes that were not present.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:284
+ def each_child_node; end
+
+ # Delegates to the end_character_column of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:106
+ def end_character_column; end
+
+ # Delegates to the end_character_offset of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:74
+ def end_character_offset; end
+
+ # Delegates to the end_column of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:96
+ def end_column; end
+
+ # Delegates to the end_line of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:50
+ def end_line; end
+
+ # The end offset of the node in the source. This method is effectively a
+ # delegate method to the location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:63
+ sig { returns(Integer) }
+ def end_offset; end
+
+ sig { abstract.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # pkg:gem/prism#lib/prism/node.rb:229
+ def find(&block); end
+
+ # pkg:gem/prism#lib/prism/node.rb:248
+ def find_all(&block); end
+
+ # Returns a string representation of the node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:301
+ sig { abstract.returns(String) }
+ def inspect; end
+
+ # Delegates to the leading_comments of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:123
+ def leading_comments; end
+
+ # A Location instance that represents the location of this node in the
+ # source.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:33
+ sig { returns(Prism::Location) }
+ def location; end
+
+ # Returns true if the node has the newline flag set.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:164
+ sig { returns(T::Boolean) }
+ def newline?; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:70
+ def newline_flag!(lines); end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:66
+ def newline_flag?; end
+
+ # A unique identifier for this node. This is used in a very specific
+ # use case where you want to keep around a reference to a node without
+ # having to keep around the syntax tree in memory. This unique identifier
+ # will be consistent across multiple parses of the same source code.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:24
+ sig { returns(Integer) }
+ def node_id; end
+
+ # Similar to inspect, but respects the current level of indentation given by
+ # the pretty print object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:175
+ sig { params(q: T.untyped).void }
+ def pretty_print(q); end
+
+ # Save this node using a saved source so that it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:27
+ def save(repository); end
+
+ # Save the location using a saved source so that it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:40
+ def save_location(repository); end
+
+ # An alias for source_lines, used to mimic the API from
+ # RubyVM::AbstractSyntaxTree to make it easier to migrate.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:144
+ sig { returns(T::Array[String]) }
+ def script_lines; end
+
+ # Slice the location of the node from the source.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:147
+ sig { returns(String) }
+ def slice; end
+
+ # Slice the location of the node from the source, starting at the beginning
+ # of the line that the location starts on, ending at the end of the line
+ # that the location ends on.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:154
+ sig { returns(String) }
+ def slice_lines; end
+
+ # Returns all of the lines of the source code associated with this node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:138
+ sig { returns(T::Array[String]) }
+ def source_lines; end
+
+ # Delegates to the start_character_column of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:101
+ def start_character_column; end
+
+ # Delegates to the start_character_offset of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:69
+ def start_character_offset; end
+
+ # Delegates to the start_column of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:91
+ def start_column; end
+
+ # Delegates to the start_line of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:45
+ def start_line; end
+
+ # The start offset of the node in the source. This method is effectively a
+ # delegate method to the location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:56
+ sig { returns(Integer) }
+ def start_offset; end
+
+ # Returns true if the node has the static literal flag set.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:169
+ sig { returns(T::Boolean) }
+ def static_literal?; end
+
+ # Convert this node into a graphviz dot graph string.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:183
+ sig { returns(String) }
+ def to_dot; end
+
+ # Delegates to the trailing_comments of the associated location object.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:128
+ def trailing_comments; end
+
+ # Returns a list of nodes that are descendants of this node that contain the
+ # given line and column. This is useful for locating a node that is selected
+ # based on the line and column of the source code.
+ #
+ # Important to note is that the column given to this method should be in
+ # bytes, as opposed to characters or code units.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:194
+ sig { params(line: Integer, column: Integer).returns(T::Array[Prism::Node]) }
+ def tunnel(line, column); 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.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:317
+ sig { abstract.returns(Symbol) }
+ def type; end
+
+ protected
+
+ # An bitset of flags for this node. There are certain flags that are common
+ # for all nodes, and then some nodes have specific flags.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:160
+ sig { returns(Integer) }
+ def flags; end
+
+ private
+
+ # A pointer to the source that this node was created from.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17
+ sig { returns(Prism::Source) }
+ def source; end
+
+ class << self
+ # Returns a list of the fields that exist for this node class. Fields
+ # describe the structure of the node. This kind of reflection is useful for
+ # things like recursively visiting each node _and_ field in the tree.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:253
+ def fields; 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.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:325
+ def type; end
+ end
+end
+
+# The flags that are common to all nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19957
+module Prism::NodeFlags; end
+
+# A flag to indicate that the node is a candidate to emit a :line event
+# through tracepoint when compiled.
+#
+# pkg:gem/prism#lib/prism/node.rb:19960
+Prism::NodeFlags::NEWLINE = T.let(T.unsafe(nil), Integer)
+
+# A flag to indicate that the value that the node represents is a value that
+# can be determined at parse-time.
+#
+# pkg:gem/prism#lib/prism/node.rb:19964
+Prism::NodeFlags::STATIC_LITERAL = T.let(T.unsafe(nil), Integer)
+
+# Represents an implicit set of parameters through the use of numbered parameters within a block or lambda.
+#
+# -> { _1 + _2 }
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:14666
+class Prism::NumberedParametersNode < ::Prism::Node
+ # Initialize a new NumberedParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14668
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ maximum: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, maximum); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14735
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14677
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14682
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14698
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14693
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?maximum: Integer) -> NumberedParametersNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14703
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ maximum: Integer
+ ).returns(Prism::NumberedParametersNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, maximum: self.maximum); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14708
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, maximum: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14711
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14687
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14719
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader maximum: Integer
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14716
+ sig { returns(Integer) }
+ def maximum; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14724
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14729
+ def type; end
+ end
+end
+
+# Represents reading a numbered reference to a capture in the previous match.
+#
+# $1
+# ^^
+#
+# pkg:gem/prism#lib/prism/node.rb:14745
+class Prism::NumberedReferenceReadNode < ::Prism::Node
+ # Initialize a new NumberedReferenceReadNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14747
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ number: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, number); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14820
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14756
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14761
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14777
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14772
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?number: Integer) -> NumberedReferenceReadNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14782
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ number: Integer
+ ).returns(Prism::NumberedReferenceReadNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, number: self.number); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14787
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, number: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14790
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14766
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14804
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The (1-indexed, from the left) number of the capture group. Numbered references that are too large result in this value being `0`.
+ #
+ # $1 # number `1`
+ #
+ # $5432 # number `5432`
+ #
+ # $4294967296 # number `0`
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14801
+ sig { returns(Integer) }
+ def number; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14809
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14814
+ def type; end
+ end
+end
+
+# Represents an optional keyword parameter to a method, block, or lambda definition.
+#
+# def a(b: 1)
+# ^^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:14831
+class Prism::OptionalKeywordParameterNode < ::Prism::Node
+ # Initialize a new OptionalKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14833
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14924
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14844
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14849
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14866
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14861
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node) -> OptionalKeywordParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14871
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::OptionalKeywordParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14876
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14879
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14854
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14908
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14889
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14892
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14884
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14900
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14913
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14905
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14918
+ def type; end
+ end
+end
+
+# Represents an optional parameter to a method, block, or lambda definition.
+#
+# def a(b = 1)
+# ^^^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:14938
+class Prism::OptionalParameterNode < ::Prism::Node
+ # Initialize a new OptionalParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14940
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc, value); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15050
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14952
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14957
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14974
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14969
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> OptionalParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14979
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ value: Prism::Node
+ ).returns(Prism::OptionalParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc, value: self.value); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14984
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14987
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14962
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15034
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14997
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15000
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15029
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15013
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:14992
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15008
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15021
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15039
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader value: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15026
+ sig { returns(Prism::Node) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15044
+ def type; end
+ end
+end
+
+# Represents the use of the `||` operator or the `or` keyword.
+#
+# left or right
+# ^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:15064
+class Prism::OrNode < ::Prism::Node
+ # Initialize a new OrNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15066
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, left, right, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15173
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15077
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15082
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15100
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15095
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> OrNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15105
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: Prism::Node,
+ right: Prism::Node,
+ operator_loc: Prism::Location
+ ).returns(Prism::OrNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15110
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15113
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15087
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15157
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Represents the left side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # left or right
+ # ^^^^
+ #
+ # 1 || 2
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15124
+ sig { returns(Prism::Node) }
+ def left; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15152
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `or` keyword or the `||` operator.
+ #
+ # left or right
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15139
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Represents the right side of the expression.
+ #
+ # left || right
+ # ^^^^^
+ #
+ # 1 or 2
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15133
+ sig { returns(Prism::Node) }
+ def right; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15147
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15162
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15167
+ def type; end
+ end
+end
+
+# A parser for the pack template language.
+#
+# pkg:gem/prism#lib/prism/pack.rb:8
+module Prism::Pack
+ class << self
+ # pkg:gem/prism#lib/prism.rb:92
+ def parse(_arg0, _arg1, _arg2); end
+ end
+end
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::BER = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol)
+
+# A directive in the pack template language.
+#
+# pkg:gem/prism#lib/prism/pack.rb:62
+class Prism::Pack::Directive
+ # Initialize a new directive with the given values.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:91
+ def initialize(version, variant, source, type, signed, endian, size, length_type, length); end
+
+ # Provide a human-readable description of the directive.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:133
+ def describe; end
+
+ # The type of endianness of the directive.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:79
+ def endian; end
+
+ # The length of this directive (used for integers).
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:88
+ def length; end
+
+ # The length type of this directive (used for integers).
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:85
+ def length_type; end
+
+ # The type of signedness of the directive.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:76
+ def signed; end
+
+ # The size of the directive.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:82
+ def size; end
+
+ # A byteslice of the source string that this directive represents.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:70
+ def source; end
+
+ # The type of the directive.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:73
+ def type; end
+
+ # A symbol representing whether or not we are packing or unpacking.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:67
+ def variant; end
+
+ # A symbol representing the version of Ruby.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:64
+ def version; end
+end
+
+# The descriptions of the various types of endianness.
+#
+# pkg:gem/prism#lib/prism/pack.rb:104
+Prism::Pack::Directive::ENDIAN_DESCRIPTIONS = T.let(T.unsafe(nil), Hash)
+
+# The descriptions of the various types of signedness.
+#
+# pkg:gem/prism#lib/prism/pack.rb:113
+Prism::Pack::Directive::SIGNED_DESCRIPTIONS = T.let(T.unsafe(nil), Hash)
+
+# The descriptions of the various types of sizes.
+#
+# pkg:gem/prism#lib/prism/pack.rb:120
+Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol)
+
+# The result of parsing a pack template.
+#
+# pkg:gem/prism#lib/prism/pack.rb:200
+class Prism::Pack::Format
+ # Create a new Format with the given directives and encoding.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:208
+ def initialize(directives, encoding); end
+
+ # Provide a human-readable description of the format.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:214
+ def describe; end
+
+ # A list of the directives in the template.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:202
+ def directives; end
+
+ # The encoding of the template.
+ #
+ # pkg:gem/prism#lib/prism/pack.rb:205
+ def encoding; end
+end
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIGNED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIGNED_NA = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/prism#lib/prism/pack.rb:58
+Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol)
+
+# Flags for parameter nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19864
+module Prism::ParameterFlags; end
+
+# a parameter name that has been repeated in the method signature
+#
+# pkg:gem/prism#lib/prism/node.rb:19866
+Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer)
+
+# Represents the list of parameters on a method, block, or lambda definition.
+#
+# def a(b, c, d)
+# ^^^^^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:15186
+class Prism::ParametersNode < ::Prism::Node
+ # Initialize a new ParametersNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15188
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ requireds: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)],
+ optionals: T::Array[Prism::OptionalParameterNode],
+ rest: T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode)),
+ posts: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)],
+ keywords: T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)],
+ keyword_rest: T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)),
+ block: T.nilable(Prism::BlockParameterNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, requireds, optionals, rest, posts, keywords, keyword_rest, block); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15294
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15203
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader block: BlockParameterNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15275
+ sig { returns(T.nilable(Prism::BlockParameterNode)) }
+ def block; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15208
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15239
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15226
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?requireds: Array[RequiredParameterNode | MultiTargetNode], ?optionals: Array[OptionalParameterNode], ?rest: RestParameterNode | ImplicitRestNode | nil, ?posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], ?keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], ?keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, ?block: BlockParameterNode?) -> ParametersNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15244
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ requireds: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)],
+ optionals: T::Array[Prism::OptionalParameterNode],
+ rest: T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode)),
+ posts: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)],
+ keywords: T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)],
+ keyword_rest: T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)),
+ block: T.nilable(Prism::BlockParameterNode)
+ ).returns(Prism::ParametersNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, requireds: self.requireds, optionals: self.optionals, rest: self.rest, posts: self.posts, keywords: self.keywords, keyword_rest: self.keyword_rest, block: self.block); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15249
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, requireds: Array[RequiredParameterNode | MultiTargetNode], optionals: Array[OptionalParameterNode], rest: RestParameterNode | ImplicitRestNode | nil, posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, block: BlockParameterNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15252
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15213
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15278
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15272
+ sig do
+ returns(T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)))
+ end
+ def keyword_rest; end
+
+ # attr_reader keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15269
+ sig { returns(T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)]) }
+ def keywords; end
+
+ # attr_reader optionals: Array[OptionalParameterNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15260
+ sig { returns(T::Array[Prism::OptionalParameterNode]) }
+ def optionals; end
+
+ # attr_reader posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15266
+ sig do
+ returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)])
+ end
+ def posts; end
+
+ # attr_reader requireds: Array[RequiredParameterNode | MultiTargetNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15257
+ sig { returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)]) }
+ def requireds; end
+
+ # attr_reader rest: RestParameterNode | ImplicitRestNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15263
+ sig { returns(T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode))) }
+ def rest; end
+
+ # Mirrors the Method#parameters method.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:272
+ sig { returns(T::Array[T.any([Symbol, Symbol], [Symbol])]) }
+ def signature; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15283
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15288
+ def type; end
+ end
+end
+
+# Represents a parenthesized expression
+#
+# (10 + 34)
+# ^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:15314
+class Prism::ParenthesesNode < ::Prism::Node
+ # Initialize a new ParenthesesNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15316
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ body: T.nilable(Prism::Node),
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, body, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15429
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15327
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader body: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15374
+ sig { returns(T.nilable(Prism::Node)) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15332
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15408
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15390
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15351
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15344
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location) -> ParenthesesNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15356
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ body: T.nilable(Prism::Node),
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::ParenthesesNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, body: self.body, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15361
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Prism::node?, opening_loc: Location, closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15364
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15337
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15413
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def multiple_statements?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15369
+ sig { returns(T::Boolean) }
+ def multiple_statements?; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:86
+ def newline_flag!(lines); end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15403
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15377
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15398
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15385
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15418
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15423
+ def type; end
+ end
+end
+
+# Flags for parentheses nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19870
+module Prism::ParenthesesNodeFlags; end
+
+# parentheses that contain multiple potentially void statements
+#
+# pkg:gem/prism#lib/prism/node.rb:19872
+Prism::ParenthesesNodeFlags::MULTIPLE_STATEMENTS = T.let(T.unsafe(nil), Integer)
+
+# This represents an error that was encountered during parsing.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:606
+class Prism::ParseError
+ # Create a new error object with the given message and location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:621
+ sig { params(type: Symbol, message: String, location: Prism::Location, level: Symbol).void }
+ def initialize(type, message, location, level); end
+
+ # Implement the hash pattern matching interface for ParseError.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:629
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # Returns a string representation of this error.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:634
+ sig { returns(String) }
+ def inspect; end
+
+ # The level of this error.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:618
+ sig { returns(Symbol) }
+ def level; end
+
+ # A Location object representing the location of this error in the source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:615
+ sig { returns(Prism::Location) }
+ def location; end
+
+ # The message associated with this error.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:612
+ sig { returns(String) }
+ def message; end
+
+ # The type of error. This is an _internal_ symbol that is used for
+ # communicating with translation layers. It is not meant to be public API.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:609
+ sig { returns(Symbol) }
+ def type; end
+end
+
+# This is a result specific to the `parse_lex` and `parse_lex_file` methods.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:795
+class Prism::ParseLexResult < ::Prism::Result
+ # Create a new parse lex result object with the given values.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:801
+ sig do
+ params(
+ value: [Prism::ProgramNode, T::Array[T.untyped]],
+ comments: T::Array[Prism::Comment],
+ magic_comments: T::Array[Prism::MagicComment],
+ data_loc: T.nilable(Prism::Location),
+ errors: T::Array[Prism::ParseError],
+ warnings: T::Array[Prism::ParseWarning],
+ source: Prism::Source
+ ).void
+ end
+ def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end
+
+ # Implement the hash pattern matching interface for ParseLexResult.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:807
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # A tuple of the syntax tree and the list of tokens that were parsed from
+ # the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:798
+ sig { returns([Prism::ProgramNode, T::Array[T.untyped]]) }
+ def value; end
+end
+
+# This is a result specific to the `parse` and `parse_file` methods.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:736
+class Prism::ParseResult < ::Prism::Result
+ # Create a new parse result object with the given values.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:749
+ sig do
+ params(
+ value: Prism::ProgramNode,
+ comments: T::Array[Prism::Comment],
+ magic_comments: T::Array[Prism::MagicComment],
+ data_loc: T.nilable(Prism::Location),
+ errors: T::Array[Prism::ParseError],
+ warnings: T::Array[Prism::ParseWarning],
+ source: Prism::Source
+ ).void
+ end
+ def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end
+
+ # Attach the list of comments to their respective locations in the tree.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:760
+ def attach_comments!; end
+
+ # Implement the hash pattern matching interface for ParseResult.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:755
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # Returns a string representation of the syntax tree with the errors
+ # displayed inline.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:772
+ def errors_format; end
+
+ # Walk the tree and mark nodes that are on a new line, loosely emulating
+ # the behavior of CRuby's `:line` tracepoint event.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:766
+ def mark_newlines!; end
+
+ # The syntax tree that was parsed from the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:746
+ sig { returns(Prism::ProgramNode) }
+ def value; end
+end
+
+# When we've parsed the source, we have both the syntax tree and the list of
+# comments that we found in the source. This class is responsible for
+# walking the tree and finding the nearest location to attach each comment.
+#
+# It does this by first finding the nearest locations to each comment.
+# Locations can either come from nodes directly or from location fields on
+# nodes. For example, a `ClassNode` has an overall location encompassing the
+# entire class, but it also has a location for the `class` keyword.
+#
+# Once the nearest locations are found, it determines which one to attach
+# to. If it's a trailing comment (a comment on the same line as other source
+# code), it will favor attaching to the nearest location that occurs before
+# the comment. Otherwise it will favor attaching to the nearest location
+# that is after the comment.
+#
+# pkg:gem/prism#lib/prism/parse_result/comments.rb:20
+class Prism::ParseResult::Comments
+ # Create a new Comments object that will attach comments to the given
+ # parse result.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:87
+ def initialize(parse_result); end
+
+ # Attach the comments to their respective locations in the tree by
+ # mutating the parse result.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:93
+ def attach!; end
+
+ # The parse result that we are attaching comments to.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:83
+ def parse_result; end
+
+ private
+
+ # Responsible for finding the nearest targets to the given comment within
+ # the context of the given encapsulating node.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:120
+ def nearest_targets(node, comment); end
+end
+
+# A target for attaching comments that is based on a location field on a
+# node. For example, the `end` token of a ClassNode.
+#
+# pkg:gem/prism#lib/prism/parse_result/comments.rb:54
+class Prism::ParseResult::Comments::LocationTarget
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:57
+ def initialize(location); end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:69
+ def encloses?(comment); end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:65
+ def end_offset; end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:73
+ def leading_comment(comment); end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:55
+ def location; end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:61
+ def start_offset; end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:77
+ def trailing_comment(comment); end
+end
+
+# A target for attaching comments that is based on a specific node's
+# location.
+#
+# pkg:gem/prism#lib/prism/parse_result/comments.rb:23
+class Prism::ParseResult::Comments::NodeTarget
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:26
+ def initialize(node); end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:38
+ def encloses?(comment); end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:34
+ def end_offset; end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:43
+ def leading_comment(comment); end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:24
+ def node; end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:30
+ def start_offset; end
+
+ # pkg:gem/prism#lib/prism/parse_result/comments.rb:47
+ def trailing_comment(comment); end
+end
+
+# An object to represent the set of errors on a parse result. This object
+# can be used to format the errors in a human-readable way.
+#
+# pkg:gem/prism#lib/prism/parse_result/errors.rb:10
+class Prism::ParseResult::Errors
+ # Initialize a new set of errors from the given parse result.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/errors.rb:15
+ def initialize(parse_result); end
+
+ # Formats the errors in a human-readable way and return them as a string.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/errors.rb:20
+ def format; end
+
+ # The parse result that contains the errors.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/errors.rb:12
+ def parse_result; end
+end
+
+# The :line tracepoint event gets fired whenever the Ruby VM encounters an
+# expression on a new line. The types of expressions that can trigger this
+# event are:
+#
+# * if statements
+# * unless statements
+# * nodes that are children of statements lists
+#
+# In order to keep track of the newlines, we have a list of offsets that
+# come back from the parser. We assign these offsets to the first nodes that
+# we find in the tree that are on those lines.
+#
+# Note that the logic in this file should be kept in sync with the Java
+# MarkNewlinesVisitor, since that visitor is responsible for marking the
+# newlines for JRuby/TruffleRuby.
+#
+# This file is autoloaded only when `mark_newlines!` is called, so the
+# re-opening of the various nodes in this file will only be performed in
+# that case. We do that to avoid storing the extra `@newline` instance
+# variable on every node if we don't need it.
+#
+# pkg:gem/prism#lib/prism/parse_result/newlines.rb:26
+class Prism::ParseResult::Newlines < ::Prism::Visitor
+ # Create a new Newlines visitor with the given newline offsets.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:28
+ def initialize(lines); end
+
+ # Permit block/lambda nodes to mark newlines within themselves.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:34
+ def visit_block_node(node); end
+
+ # Mark if/unless nodes as newlines.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:48
+ def visit_if_node(node); end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:45
+ def visit_lambda_node(node); end
+
+ # Permit statements lists to mark newlines within themselves.
+ #
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:56
+ def visit_statements_node(node); end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:53
+ def visit_unless_node(node); end
+end
+
+# This represents a warning that was encountered during parsing.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:640
+class Prism::ParseWarning
+ # Create a new warning object with the given message and location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:655
+ sig { params(type: Symbol, message: String, location: Prism::Location, level: Symbol).void }
+ def initialize(type, message, location, level); end
+
+ # Implement the hash pattern matching interface for ParseWarning.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:663
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # Returns a string representation of this warning.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:668
+ sig { returns(String) }
+ def inspect; end
+
+ # The level of this warning.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:652
+ sig { returns(Symbol) }
+ def level; end
+
+ # A Location object representing the location of this warning in the source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:649
+ sig { returns(Prism::Location) }
+ def location; end
+
+ # The message associated with this warning.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:646
+ sig { returns(String) }
+ def message; end
+
+ # The type of warning. This is an _internal_ symbol that is used for
+ # communicating with translation layers. It is not meant to be public API.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:643
+ sig { returns(Symbol) }
+ def type; end
+end
+
+# A pattern is an object that wraps a Ruby pattern matching expression. The
+# expression would normally be passed to an `in` clause within a `case`
+# expression or a rightward assignment expression. For example, in the
+# following snippet:
+#
+# case node
+# in ConstantPathNode[ConstantReadNode[name: :Prism], ConstantReadNode[name: :Pattern]]
+# end
+#
+# the pattern is the ConstantPathNode[...] expression.
+#
+# The pattern gets compiled into an object that responds to #call by running
+# the #compile method. This method itself will run back through Prism to
+# parse the expression into a tree, then walk the tree to generate the
+# necessary callable objects. For example, if you wanted to compile the
+# expression above into a callable, you would:
+#
+# callable = Prism::Pattern.new("ConstantPathNode[ConstantReadNode[name: :Prism], ConstantReadNode[name: :Pattern]]").compile
+# callable.call(node)
+#
+# The callable object returned by #compile is guaranteed to respond to #call
+# with a single argument, which is the node to match against. It also is
+# guaranteed to respond to #===, which means it itself can be used in a `case`
+# expression, as in:
+#
+# case node
+# when callable
+# end
+#
+# If the query given to the initializer cannot be compiled into a valid
+# matcher (either because of a syntax error or because it is using syntax we
+# do not yet support) then a Prism::Pattern::CompilationError will be
+# raised.
+#
+# pkg:gem/prism#lib/prism/pattern.rb:38
+class Prism::Pattern
+ # Create a new pattern with the given query. The query should be a string
+ # containing a Ruby pattern matching expression.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:64
+ def initialize(query); end
+
+ # Compile the query into a callable object that can be used to match against
+ # nodes.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:71
+ def compile; end
+
+ # The query that this pattern was initialized with.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:60
+ def query; end
+
+ # Scan the given node and all of its children for nodes that match the
+ # pattern. If a block is given, it will be called with each node that
+ # matches the pattern. If no block is given, an enumerator will be returned
+ # that will yield each node that matches the pattern.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:87
+ def scan(root); end
+
+ private
+
+ # Shortcut for combining two procs into one that returns true if both return
+ # true.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:103
+ def combine_and(left, right); end
+
+ # Shortcut for combining two procs into one that returns true if either
+ # returns true.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:109
+ def combine_or(left, right); end
+
+ # in foo | bar
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:144
+ def compile_alternation_pattern_node(node); end
+
+ # in [foo, bar, baz]
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:119
+ def compile_array_pattern_node(node); end
+
+ # Compile a name associated with a constant.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:169
+ def compile_constant_name(node, name); end
+
+ # in Prism::ConstantReadNode
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:149
+ def compile_constant_path_node(node); end
+
+ # in ConstantReadNode
+ # in String
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:164
+ def compile_constant_read_node(node); end
+
+ # Raise an error because the given node is not supported.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:114
+ def compile_error(node); end
+
+ # in InstanceVariableReadNode[name: Symbol]
+ # in { name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:185
+ def compile_hash_pattern_node(node); end
+
+ # in nil
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:215
+ def compile_nil_node(node); end
+
+ # Compile any kind of node. Dispatch out to the individual compilation
+ # methods based on the type of node.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:244
+ def compile_node(node); end
+
+ # in /foo/
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:220
+ def compile_regular_expression_node(node); end
+
+ # in ""
+ # in "foo"
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:228
+ def compile_string_node(node); end
+
+ # in :+
+ # in :foo
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:236
+ def compile_symbol_node(node); end
+end
+
+# Raised when the query given to a pattern is either invalid Ruby syntax or
+# is using syntax that we don't yet support.
+#
+# pkg:gem/prism#lib/prism/pattern.rb:41
+class Prism::Pattern::CompilationError < ::StandardError
+ # Create a new CompilationError with the given representation of the node
+ # that caused the error.
+ #
+ # pkg:gem/prism#lib/prism/pattern.rb:44
+ def initialize(repr); end
+end
+
+# Represents the use of the `^` operator for pinning an expression in a pattern matching expression.
+#
+# foo in ^(bar)
+# ^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:15442
+class Prism::PinnedExpressionNode < ::Prism::Node
+ # Initialize a new PinnedExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15444
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: Prism::Node,
+ operator_loc: Prism::Location,
+ lparen_loc: Prism::Location,
+ rparen_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, expression, operator_loc, lparen_loc, rparen_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15581
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15456
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15461
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15478
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15473
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node, ?operator_loc: Location, ?lparen_loc: Location, ?rparen_loc: Location) -> PinnedExpressionNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15483
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: Prism::Node,
+ operator_loc: Prism::Location,
+ lparen_loc: Prism::Location,
+ rparen_loc: Prism::Location
+ ).returns(Prism::PinnedExpressionNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, expression: self.expression, operator_loc: self.operator_loc, lparen_loc: self.lparen_loc, rparen_loc: self.rparen_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15488
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15491
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15466
+ def each_child_node; end
+
+ # The expression used in the pinned expression
+ #
+ # foo in ^(bar)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15499
+ sig { returns(Prism::Node) }
+ def expression; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15565
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def lparen: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15555
+ sig { returns(String) }
+ def lparen; end
+
+ # The location of the opening parenthesis.
+ #
+ # foo in ^(bar)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15521
+ sig { returns(Prism::Location) }
+ def lparen_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15550
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `^` operator
+ #
+ # foo in ^(bar)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15505
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # def rparen: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15560
+ sig { returns(String) }
+ def rparen; end
+
+ # The location of the closing parenthesis.
+ #
+ # foo in ^(bar)
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15537
+ sig { returns(Prism::Location) }
+ def rparen_loc; end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15529
+ def save_lparen_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15513
+ def save_operator_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15545
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15570
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15575
+ def type; end
+ end
+end
+
+# Represents the use of the `^` operator for pinning a variable in a pattern matching expression.
+#
+# foo in ^bar
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:15594
+class Prism::PinnedVariableNode < ::Prism::Node
+ # Initialize a new PinnedVariableNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15596
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ variable: T.any(Prism::LocalVariableReadNode, Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::ItLocalVariableReadNode, Prism::MissingNode),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, variable, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15689
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15606
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15611
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15628
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15623
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode, ?operator_loc: Location) -> PinnedVariableNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15633
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ variable: T.any(Prism::LocalVariableReadNode, Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::ItLocalVariableReadNode, Prism::MissingNode),
+ operator_loc: Prism::Location
+ ).returns(Prism::PinnedVariableNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, variable: self.variable, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15638
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15641
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15616
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15673
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15668
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `^` operator
+ #
+ # foo in ^bar
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15655
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15663
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15678
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The variable used in the pinned expression
+ #
+ # foo in ^bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15649
+ sig do
+ returns(T.any(Prism::LocalVariableReadNode, Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::ItLocalVariableReadNode, Prism::MissingNode))
+ end
+ def variable; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15683
+ def type; end
+ end
+end
+
+# Represents the use of the `END` keyword.
+#
+# END { foo }
+# ^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:15700
+class Prism::PostExecutionNode < ::Prism::Node
+ # Initialize a new PostExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15702
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ statements: T.nilable(Prism::StatementsNode),
+ keyword_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, statements, keyword_loc, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15829
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15714
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15719
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15808
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15785
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15738
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15731
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location) -> PostExecutionNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15743
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ statements: T.nilable(Prism::StatementsNode),
+ keyword_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::PostExecutionNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, statements: self.statements, keyword_loc: self.keyword_loc, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15748
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15751
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15724
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15813
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15798
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15759
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15803
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15772
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15793
+ def save_closing_loc(repository); end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15767
+ def save_keyword_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15780
+ def save_opening_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15756
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15818
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15823
+ def type; end
+ end
+end
+
+# Represents the use of the `BEGIN` keyword.
+#
+# BEGIN { foo }
+# ^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:15842
+class Prism::PreExecutionNode < ::Prism::Node
+ # Initialize a new PreExecutionNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15844
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ statements: T.nilable(Prism::StatementsNode),
+ keyword_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, statements, keyword_loc, opening_loc, closing_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15971
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15856
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15861
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15950
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15927
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15880
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15873
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location) -> PreExecutionNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15885
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ statements: T.nilable(Prism::StatementsNode),
+ keyword_loc: Prism::Location,
+ opening_loc: Prism::Location,
+ closing_loc: Prism::Location
+ ).returns(Prism::PreExecutionNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, statements: self.statements, keyword_loc: self.keyword_loc, opening_loc: self.opening_loc, closing_loc: self.closing_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15890
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15893
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15866
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15955
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15940
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15901
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15945
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15914
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15935
+ def save_closing_loc(repository); end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15909
+ def save_keyword_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15922
+ def save_opening_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15898
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15960
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15965
+ def type; end
+ end
+end
+
+# The top level node of any parse tree.
+#
+# pkg:gem/prism#lib/prism/node.rb:15981
+class Prism::ProgramNode < ::Prism::Node
+ # Initialize a new ProgramNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15983
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ statements: Prism::StatementsNode
+ ).void
+ end
+ def initialize(source, node_id, location, flags, locals, statements); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16055
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15993
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:15998
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16015
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16010
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?statements: StatementsNode) -> ProgramNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16020
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ statements: Prism::StatementsNode
+ ).returns(Prism::ProgramNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, statements: self.statements); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16025
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], statements: StatementsNode }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16028
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16003
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16039
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16033
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # attr_reader statements: StatementsNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16036
+ sig { returns(Prism::StatementsNode) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16044
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16049
+ def type; end
+ end
+end
+
+# Flags for range and flip-flop nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19876
+module Prism::RangeFlags; end
+
+# ... operator
+#
+# pkg:gem/prism#lib/prism/node.rb:19878
+Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer)
+
+# Represents the use of the `..` or `...` operators.
+#
+# 1..2
+# ^^^^
+#
+# c if a =~ /left/ ... b =~ /right/
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:16070
+class Prism::RangeNode < ::Prism::Node
+ # Initialize a new RangeNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16072
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: T.nilable(Prism::Node),
+ right: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, left, right, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16185
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16083
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16088
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16109
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16101
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location) -> RangeNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16114
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ left: T.nilable(Prism::Node),
+ right: T.nilable(Prism::Node),
+ operator_loc: Prism::Location
+ ).returns(Prism::RangeNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, left: self.left, right: self.right, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16119
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node?, right: Prism::node?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16122
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16093
+ def each_child_node; end
+
+ # def exclude_end?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16127
+ sig { returns(T::Boolean) }
+ def exclude_end?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16169
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The left-hand side of the range, if present. It can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # 1...
+ # ^
+ #
+ # hello...goodbye
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16138
+ sig { returns(T.nilable(Prism::Node)) }
+ def left; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16164
+ sig { returns(String) }
+ def operator; end
+
+ # The location of the `..` or `...` operator.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16151
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # The right-hand side of the range, if present. It can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # ..5
+ # ^
+ #
+ # 1...foo
+ # ^^^
+ # If neither right-hand or left-hand side was included, this will be a MissingNode.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16148
+ sig { returns(T.nilable(Prism::Node)) }
+ def right; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16159
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16174
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16179
+ def type; end
+ end
+end
+
+# Represents a rational number literal.
+#
+# 1.0r
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:16198
+class Prism::RationalNode < ::Prism::Node
+ # Initialize a new RationalNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16200
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ numerator: Integer,
+ denominator: Integer
+ ).void
+ end
+ def initialize(source, node_id, location, flags, numerator, denominator); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16295
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16210
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def binary?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16249
+ sig { returns(T::Boolean) }
+ def binary?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16215
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16231
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16226
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?numerator: Integer, ?denominator: Integer) -> RationalNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16236
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ numerator: Integer,
+ denominator: Integer
+ ).returns(Prism::RationalNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, numerator: self.numerator, denominator: self.denominator); end
+
+ # def decimal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16254
+ sig { returns(T::Boolean) }
+ def decimal?; end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16241
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, numerator: Integer, denominator: Integer }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16244
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # The denominator of the rational number.
+ #
+ # 1.5r # denominator 2
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16276
+ sig { returns(Integer) }
+ def denominator; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16220
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def hexadecimal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16264
+ sig { returns(T::Boolean) }
+ def hexadecimal?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16279
+ sig { override.returns(String) }
+ def inspect; end
+
+ # The numerator of the rational number.
+ #
+ # 1.5r # numerator 3
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16271
+ sig { returns(Integer) }
+ def numerator; end
+
+ # Returns the value of the node as an IntegerNode or a FloatNode. This
+ # method is deprecated in favor of #value or #numerator/#denominator.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:123
+ def numeric; end
+
+ # def octal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16259
+ sig { returns(T::Boolean) }
+ def octal?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16284
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # Returns the value of the node as a Ruby Rational.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:117
+ sig { returns(Rational) }
+ def value; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16289
+ def type; end
+ end
+end
+
+# Represents the use of the `redo` keyword.
+#
+# redo
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:16307
+class Prism::RedoNode < ::Prism::Node
+ # Initialize a new RedoNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16309
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16372
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16317
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16322
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16338
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16333
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> RedoNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16343
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::RedoNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16348
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16351
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16327
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16356
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16361
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16366
+ def type; end
+ end
+end
+
+# The Reflection module provides the ability to reflect on the structure of
+# the syntax tree itself, as opposed to looking at a single syntax tree. This
+# is useful in metaprogramming contexts.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:16
+module Prism::Reflection
+ class << self
+ # Returns the fields for the given node.
+ #
+ # pkg:gem/prism#lib/prism/reflection.rb:107
+ sig { params(node: T.class_of(Prism::Node)).returns(T::Array[Prism::Reflection::Field]) }
+ def fields_for(node); end
+ end
+end
+
+# A constant field represents a constant value on a node. Effectively, it
+# represents an identifier found within the source. It resolves to a symbol
+# in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:48
+class Prism::Reflection::ConstantField < ::Prism::Reflection::Field; end
+
+# A constant list field represents a list of constant values on a node. It
+# resolves to an array of symbols in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:58
+class Prism::Reflection::ConstantListField < ::Prism::Reflection::Field; end
+
+# A field represents a single piece of data on a node. It is the base class
+# for all other field types.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:19
+class Prism::Reflection::Field
+ # Initializes the field with the given name.
+ #
+ # pkg:gem/prism#lib/prism/reflection.rb:24
+ sig { params(name: Symbol).void }
+ def initialize(name); end
+
+ # The name of the field.
+ #
+ # pkg:gem/prism#lib/prism/reflection.rb:21
+ sig { returns(Symbol) }
+ def name; end
+end
+
+# A flags field represents a bitset of flags on a node. It resolves to an
+# integer in Ruby. Note that the flags cannot be accessed directly on the
+# node because the integer is kept private. Instead, the various flags in
+# the bitset should be accessed through their query methods.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:95
+class Prism::Reflection::FlagsField < ::Prism::Reflection::Field
+ # Initializes the flags field with the given name and flags.
+ #
+ # pkg:gem/prism#lib/prism/reflection.rb:100
+ sig { params(name: Symbol, flags: T::Array[Symbol]).void }
+ def initialize(name, flags); end
+
+ # The names of the flags in the bitset.
+ #
+ # pkg:gem/prism#lib/prism/reflection.rb:97
+ sig { returns(T::Array[Symbol]) }
+ def flags; end
+end
+
+# A float field represents a double-precision floating point value. It is
+# used exclusively to represent the value of a floating point literal. It
+# resolves to a Float in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:88
+class Prism::Reflection::FloatField < ::Prism::Reflection::Field; end
+
+# An integer field represents an integer value. It is used to represent the
+# value of an integer literal, the depth of local variables, and the number
+# of a numbered reference. It resolves to an Integer in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:82
+class Prism::Reflection::IntegerField < ::Prism::Reflection::Field; end
+
+# A location field represents the location of some part of the node in the
+# source code. For example, the location of a keyword or an operator. It
+# resolves to a Prism::Location in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:70
+class Prism::Reflection::LocationField < ::Prism::Reflection::Field; end
+
+# A node field represents a single child node in the syntax tree. It
+# resolves to a Prism::Node in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:31
+class Prism::Reflection::NodeField < ::Prism::Reflection::Field; end
+
+# A node list field represents a list of child nodes in the syntax tree. It
+# resolves to an array of Prism::Node instances in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:42
+class Prism::Reflection::NodeListField < ::Prism::Reflection::Field; end
+
+# An optional constant field represents a constant value on a node that may
+# or may not be present. It resolves to either a symbol or nil in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:53
+class Prism::Reflection::OptionalConstantField < ::Prism::Reflection::Field; end
+
+# An optional location field represents the location of some part of the
+# node in the source code that may or may not be present. It resolves to
+# either a Prism::Location or nil in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:76
+class Prism::Reflection::OptionalLocationField < ::Prism::Reflection::Field; end
+
+# An optional node field represents a single child node in the syntax tree
+# that may or may not be present. It resolves to either a Prism::Node or nil
+# in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:37
+class Prism::Reflection::OptionalNodeField < ::Prism::Reflection::Field; end
+
+# A string field represents a string value on a node. It almost always
+# represents the unescaped value of a string-like literal. It resolves to a
+# string in Ruby.
+#
+# pkg:gem/prism#lib/prism/reflection.rb:64
+class Prism::Reflection::StringField < ::Prism::Reflection::Field; end
+
+# Flags for regular expression and match last line nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19882
+module Prism::RegularExpressionFlags; end
+
+# n - forces the ASCII-8BIT encoding
+#
+# pkg:gem/prism#lib/prism/node.rb:19899
+Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer)
+
+# e - forces the EUC-JP encoding
+#
+# pkg:gem/prism#lib/prism/node.rb:19896
+Prism::RegularExpressionFlags::EUC_JP = T.let(T.unsafe(nil), Integer)
+
+# x - ignores whitespace and allows comments in regular expressions
+#
+# pkg:gem/prism#lib/prism/node.rb:19887
+Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to binary
+#
+# pkg:gem/prism#lib/prism/node.rb:19911
+Prism::RegularExpressionFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to US-ASCII
+#
+# pkg:gem/prism#lib/prism/node.rb:19914
+Prism::RegularExpressionFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to UTF-8
+#
+# pkg:gem/prism#lib/prism/node.rb:19908
+Prism::RegularExpressionFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# i - ignores the case of characters when matching
+#
+# pkg:gem/prism#lib/prism/node.rb:19884
+Prism::RegularExpressionFlags::IGNORE_CASE = T.let(T.unsafe(nil), Integer)
+
+# m - allows $ to match the end of lines within strings
+#
+# pkg:gem/prism#lib/prism/node.rb:19890
+Prism::RegularExpressionFlags::MULTI_LINE = T.let(T.unsafe(nil), Integer)
+
+# o - only interpolates values into the regular expression once
+#
+# pkg:gem/prism#lib/prism/node.rb:19893
+Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer)
+
+# u - forces the UTF-8 encoding
+#
+# pkg:gem/prism#lib/prism/node.rb:19905
+Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer)
+
+# s - forces the Windows-31J encoding
+#
+# pkg:gem/prism#lib/prism/node.rb:19902
+Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer)
+
+# Represents a regular expression literal with no interpolation.
+#
+# /foo/i
+# ^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:16381
+class Prism::RegularExpressionNode < ::Prism::Node
+ include ::Prism::RegularExpressionOptions
+
+ # Initialize a new RegularExpressionNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16383
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, content_loc, closing_loc, unescaped); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16562
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16395
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16459
+ sig { returns(T::Boolean) }
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16400
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16541
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16515
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16416
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16411
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16536
+ sig { returns(String) }
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16502
+ sig { returns(Prism::Location) }
+ def content_loc; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> RegularExpressionNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16421
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).returns(Prism::RegularExpressionNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, content_loc: self.content_loc, closing_loc: self.closing_loc, unescaped: self.unescaped); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16426
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16429
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16405
+ def each_child_node; end
+
+ # def euc_jp?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16454
+ sig { returns(T::Boolean) }
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16439
+ sig { returns(T::Boolean) }
+ def extended?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16479
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16484
+ sig { returns(T::Boolean) }
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16474
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def ignore_case?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16434
+ sig { returns(T::Boolean) }
+ def ignore_case?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16546
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def multi_line?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16444
+ sig { returns(T::Boolean) }
+ def multi_line?; end
+
+ # def once?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16449
+ sig { returns(T::Boolean) }
+ def once?; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16531
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16489
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ sig { returns(Integer) }
+ def options; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16523
+ def save_closing_loc(repository); end
+
+ # Save the content_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16510
+ def save_content_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16497
+ def save_opening_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16551
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16528
+ sig { returns(String) }
+ def unescaped; end
+
+ # def utf_8?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16469
+ sig { returns(T::Boolean) }
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16464
+ sig { returns(T::Boolean) }
+ def windows_31j?; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16556
+ def type; end
+ end
+end
+
+# pkg:gem/prism#lib/prism/node_ext.rb:23
+module Prism::RegularExpressionOptions
+ # Returns a numeric value that represents the flags that were used to create
+ # the regular expression.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:26
+ def options; end
+end
+
+# Prism parses deterministically for the same input. This provides a nice
+# property that is exposed through the #node_id API on nodes. Effectively this
+# means that for the same input, these values will remain consistent every
+# time the source is parsed. This means we can reparse the source same with a
+# #node_id value and find the exact same node again.
+#
+# The Relocation module provides an API around this property. It allows you to
+# "save" nodes and locations using a minimal amount of memory (just the
+# node_id and a field identifier) and then reify them later.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:14
+module Prism::Relocation
+ class << self
+ # Create a new repository for the given filepath.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:496
+ def filepath(value); end
+
+ # Create a new repository for the given string.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:501
+ def string(value); end
+ end
+end
+
+# A field representing the start and end character columns.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:270
+class Prism::Relocation::CharacterColumnsField
+ # Fetches the start and end character column of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:272
+ def fields(value); end
+end
+
+# A field representing the start and end character offsets.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:218
+class Prism::Relocation::CharacterOffsetsField
+ # Fetches the start and end character offset of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:220
+ def fields(value); end
+end
+
+# A field representing the start and end code unit columns for a specific
+# encoding.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:282
+class Prism::Relocation::CodeUnitColumnsField
+ # Initialize a new field with the associated repository and encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:291
+ def initialize(repository, encoding); end
+
+ # The associated encoding for the code units.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:288
+ def encoding; end
+
+ # Fetches the start and end code units column of a value for a particular
+ # encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:299
+ def fields(value); end
+
+ # The repository object that is used for lazily creating a code units
+ # cache.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:285
+ def repository; end
+
+ private
+
+ # Lazily create a code units cache for the associated encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:309
+ def cache; end
+end
+
+# A field representing the start and end code unit offsets.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:229
+class Prism::Relocation::CodeUnitOffsetsField
+ # Initialize a new field with the associated repository and encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:238
+ def initialize(repository, encoding); end
+
+ # The associated encoding for the code units.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:235
+ def encoding; end
+
+ # Fetches the start and end code units offset of a value for a particular
+ # encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:246
+ def fields(value); end
+
+ # A pointer to the repository object that is used for lazily creating a
+ # code units cache.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:232
+ def repository; end
+
+ private
+
+ # Lazily create a code units cache for the associated encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:256
+ def cache; end
+end
+
+# A field representing the start and end byte columns.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:262
+class Prism::Relocation::ColumnsField
+ # Fetches the start and end byte column of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:264
+ def fields(value); end
+end
+
+# An abstract field used as the parent class of the two comments fields.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:315
+class Prism::Relocation::CommentsField
+ private
+
+ # Create comment objects from the given values.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:330
+ def comments(values); end
+end
+
+# An object that represents a slice of a comment.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:317
+class Prism::Relocation::CommentsField::Comment
+ # Initialize a new comment with the given slice.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:322
+ def initialize(slice); end
+
+ # The slice of the comment.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:319
+ def slice; end
+end
+
+# An entry in a repository that will lazily reify its values when they are
+# first accessed.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:17
+class Prism::Relocation::Entry
+ # Initialize a new entry with the given repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:25
+ def initialize(repository); end
+
+ # Fetch the leading and trailing comments of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:120
+ def comments; end
+
+ # Fetch the end character column of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:93
+ def end_character_column; end
+
+ # Fetch the end character offset of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:61
+ def end_character_offset; end
+
+ # Fetch the end code units column of the value, for the encoding that was
+ # configured on the repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:105
+ def end_code_units_column; end
+
+ # Fetch the end code units offset of the value, for the encoding that was
+ # configured on the repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:73
+ def end_code_units_offset; end
+
+ # Fetch the end byte column of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:83
+ def end_column; end
+
+ # Fetch the end line of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:41
+ def end_line; end
+
+ # Fetch the end byte offset of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:51
+ def end_offset; end
+
+ # Fetch the filepath of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:31
+ def filepath; end
+
+ # Fetch the leading comments of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:110
+ def leading_comments; end
+
+ # Reify the values on this entry with the given values. This is an
+ # internal-only API that is called from the repository when it is time to
+ # reify the values.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:127
+ def reify!(values); end
+
+ # Fetch the start character column of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:88
+ def start_character_column; end
+
+ # Fetch the start character offset of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:56
+ def start_character_offset; end
+
+ # Fetch the start code units column of the value, for the encoding that
+ # was configured on the repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:99
+ def start_code_units_column; end
+
+ # Fetch the start code units offset of the value, for the encoding that
+ # was configured on the repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:67
+ def start_code_units_offset; end
+
+ # Fetch the start byte column of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:78
+ def start_column; end
+
+ # Fetch the start line of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:36
+ def start_line; end
+
+ # Fetch the start byte offset of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:46
+ def start_offset; end
+
+ # Fetch the trailing comments of the value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:115
+ def trailing_comments; end
+
+ private
+
+ # Fetch a value from the entry, raising an error if it is missing.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:135
+ def fetch_value(name); end
+
+ # Return the values from the repository, reifying them if necessary.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:143
+ def values; end
+end
+
+# Raised if a value that could potentially be on an entry is missing
+# because it was either not configured on the repository or it has not yet
+# been fetched.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:21
+class Prism::Relocation::Entry::MissingValueError < ::StandardError; end
+
+# A field that represents the file path.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:186
+class Prism::Relocation::FilepathField
+ # Initialize a new field with the given file path.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:191
+ def initialize(value); end
+
+ # Fetch the file path.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:196
+ def fields(_value); end
+
+ # The file path that this field represents.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:188
+ def value; end
+end
+
+# A field representing the leading comments.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:336
+class Prism::Relocation::LeadingCommentsField < ::Prism::Relocation::CommentsField
+ # Fetches the leading comments of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:338
+ def fields(value); end
+end
+
+# A field representing the start and end lines.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:202
+class Prism::Relocation::LinesField
+ # Fetches the start and end line of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:204
+ def fields(value); end
+end
+
+# A field representing the start and end byte offsets.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:210
+class Prism::Relocation::OffsetsField
+ # Fetches the start and end byte offset of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:212
+ def fields(value); end
+end
+
+# A repository is a configured collection of fields and a set of entries
+# that knows how to reparse a source and reify the values.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:353
+class Prism::Relocation::Repository
+ # Initialize a new repository with the given source.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:370
+ def initialize(source); end
+
+ # Configure the character columns field for this repository and return
+ # self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:416
+ def character_columns; end
+
+ # Configure the character offsets field for this repository and return
+ # self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:399
+ def character_offsets; end
+
+ # Configure the code unit columns field for this repository for a specific
+ # encoding and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:422
+ def code_unit_columns(encoding); end
+
+ # Configure the code unit offsets field for this repository for a specific
+ # encoding and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:405
+ def code_unit_offsets(encoding); end
+
+ # Create a code units cache for the given encoding from the source.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:377
+ def code_units_cache(encoding); end
+
+ # Configure the columns field for this repository and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:410
+ def columns; end
+
+ # Configure both the leading and trailing comment fields for this
+ # repository and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:440
+ def comments; end
+
+ # This method is called from nodes and locations when they want to enter
+ # themselves into the repository. It it internal-only and meant to be
+ # called from the #save* APIs.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:447
+ def enter(node_id, field_name); end
+
+ # The entries that have been saved on this repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:367
+ def entries; end
+
+ # The fields that have been configured on this repository.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:364
+ def fields; end
+
+ # Configure the filepath field for this repository and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:382
+ def filepath; end
+
+ # Configure the leading comments field for this repository and return
+ # self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:428
+ def leading_comments; end
+
+ # Configure the lines field for this repository and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:388
+ def lines; end
+
+ # Configure the offsets field for this repository and return self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:393
+ def offsets; end
+
+ # This method is called from the entries in the repository when they need
+ # to reify their values. It is internal-only and meant to be called from
+ # the various value APIs.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:456
+ def reify!; end
+
+ # The source associated with this repository. This will be either a
+ # SourceFilepath (the most common use case) or a SourceString.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:361
+ def source; end
+
+ # Configure the trailing comments field for this repository and return
+ # self.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:434
+ def trailing_comments; end
+
+ private
+
+ # Append the given field to the repository and return the repository so
+ # that these calls can be chained.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:488
+ def field(name, value); end
+end
+
+# Raised when multiple fields of the same type are configured on the same
+# repository.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:356
+class Prism::Relocation::Repository::ConfigurationError < ::StandardError; end
+
+# Represents the source of a repository that will be reparsed.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:149
+class Prism::Relocation::Source
+ # Initialize the source with the given value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:154
+ def initialize(value); end
+
+ # Create a code units cache for the given encoding.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:164
+ def code_units_cache(encoding); end
+
+ # Reparse the value and return the parse result.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:159
+ def result; end
+
+ # The value that will need to be reparsed.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:151
+ def value; end
+end
+
+# A source that is represented by a file path.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:170
+class Prism::Relocation::SourceFilepath < ::Prism::Relocation::Source
+ # Reparse the file and return the parse result.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:172
+ def result; end
+end
+
+# A source that is represented by a string.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:178
+class Prism::Relocation::SourceString < ::Prism::Relocation::Source
+ # Reparse the string and return the parse result.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:180
+ def result; end
+end
+
+# A field representing the trailing comments.
+#
+# pkg:gem/prism#lib/prism/relocation.rb:344
+class Prism::Relocation::TrailingCommentsField < ::Prism::Relocation::CommentsField
+ # Fetches the trailing comments of a value.
+ #
+ # pkg:gem/prism#lib/prism/relocation.rb:346
+ def fields(value); end
+end
+
+# Represents a required keyword parameter to a method, block, or lambda definition.
+#
+# def a(b: )
+# ^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:16577
+class Prism::RequiredKeywordParameterNode < ::Prism::Node
+ # Initialize a new RequiredKeywordParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16579
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16665
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16589
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16594
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16610
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16605
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location) -> RequiredKeywordParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16615
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol,
+ name_loc: Prism::Location
+ ).returns(Prism::RequiredKeywordParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16620
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16623
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16599
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16649
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16633
+ sig { returns(Symbol) }
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16636
+ sig { returns(Prism::Location) }
+ def name_loc; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16628
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16644
+ def save_name_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16654
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16659
+ def type; end
+ end
+end
+
+# Represents a required parameter to a method, block, or lambda definition.
+#
+# def a(b)
+# ^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:16678
+class Prism::RequiredParameterNode < ::Prism::Node
+ # Initialize a new RequiredParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16680
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void }
+ def initialize(source, node_id, location, flags, name); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16752
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16689
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16694
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16710
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16705
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> RequiredParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16715
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: Symbol
+ ).returns(Prism::RequiredParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16720
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16723
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16699
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16736
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16733
+ sig { returns(Symbol) }
+ def name; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16728
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16741
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16746
+ def type; end
+ end
+end
+
+# Represents an expression modified with a rescue.
+#
+# foo rescue nil
+# ^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:16763
+class Prism::RescueModifierNode < ::Prism::Node
+ # Initialize a new RescueModifierNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16765
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: Prism::Node,
+ keyword_loc: Prism::Location,
+ rescue_expression: Prism::Node
+ ).void
+ end
+ def initialize(source, node_id, location, flags, expression, keyword_loc, rescue_expression); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16857
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16776
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16781
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16799
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16794
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node, ?keyword_loc: Location, ?rescue_expression: Prism::node) -> RescueModifierNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16804
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ expression: Prism::Node,
+ keyword_loc: Prism::Location,
+ rescue_expression: Prism::Node
+ ).returns(Prism::RescueModifierNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, expression: self.expression, keyword_loc: self.keyword_loc, rescue_expression: self.rescue_expression); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16809
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node, keyword_loc: Location, rescue_expression: Prism::node }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16812
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16786
+ def each_child_node; end
+
+ # attr_reader expression: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16817
+ sig { returns(Prism::Node) }
+ def expression; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16841
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16836
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16820
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:116
+ def newline_flag!(lines); end
+
+ # attr_reader rescue_expression: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16833
+ sig { returns(Prism::Node) }
+ def rescue_expression; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16828
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16846
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16851
+ def type; end
+ end
+end
+
+# Represents a rescue statement.
+#
+# begin
+# rescue Foo, *splat, Bar => ex
+# foo
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+# end
+#
+# `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `reference` field.
+#
+# pkg:gem/prism#lib/prism/node.rb:16874
+class Prism::RescueNode < ::Prism::Node
+ # Initialize a new RescueNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16876
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ exceptions: T::Array[Prism::Node],
+ operator_loc: T.nilable(Prism::Location),
+ reference: T.nilable(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode)),
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ subsequent: T.nilable(Prism::RescueNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, exceptions, operator_loc, reference, then_keyword_loc, statements, subsequent); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17033
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16891
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16896
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16921
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16911
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Returns the subsequent rescue clause of the rescue node. This method is
+ # deprecated in favor of #subsequent.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:497
+ def consequent; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?exceptions: Array[Prism::node], ?operator_loc: Location?, ?reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?subsequent: RescueNode?) -> RescueNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16926
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ exceptions: T::Array[Prism::Node],
+ operator_loc: T.nilable(Prism::Location),
+ reference: T.nilable(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode)),
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ subsequent: T.nilable(Prism::RescueNode)
+ ).returns(Prism::RescueNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, exceptions: self.exceptions, operator_loc: self.operator_loc, reference: self.reference, then_keyword_loc: self.then_keyword_loc, statements: self.statements, subsequent: self.subsequent); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16931
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, exceptions: Array[Prism::node], operator_loc: Location?, reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil, then_keyword_loc: Location?, statements: StatementsNode?, subsequent: RescueNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16934
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16901
+ def each_child_node; end
+
+ # attr_reader exceptions: Array[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16952
+ sig { returns(T::Array[Prism::Node]) }
+ def exceptions; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17017
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17002
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16939
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def operator: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17007
+ sig { returns(T.nilable(String)) }
+ def operator; end
+
+ # attr_reader operator_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16955
+ sig { returns(T.nilable(Prism::Location)) }
+ def operator_loc; end
+
+ # attr_reader reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16974
+ sig do
+ returns(T.nilable(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode)))
+ end
+ def reference; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16947
+ def save_keyword_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16969
+ def save_operator_loc(repository); end
+
+ # Save the then_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16991
+ def save_then_keyword_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16996
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # attr_reader subsequent: RescueNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16999
+ sig { returns(T.nilable(Prism::RescueNode)) }
+ def subsequent; end
+
+ # def then_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17012
+ sig { returns(T.nilable(String)) }
+ def then_keyword; end
+
+ # attr_reader then_keyword_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:16977
+ sig { returns(T.nilable(Prism::Location)) }
+ def then_keyword_loc; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17022
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17027
+ def type; end
+ end
+end
+
+# Represents a rest parameter to a method, block, or lambda definition.
+#
+# def a(*b)
+# ^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:17051
+class Prism::RestParameterNode < ::Prism::Node
+ # Initialize a new RestParameterNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17053
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, name, name_loc, operator_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17164
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17064
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17069
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17085
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17080
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> RestParameterNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17090
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ name: T.nilable(Symbol),
+ name_loc: T.nilable(Prism::Location),
+ operator_loc: Prism::Location
+ ).returns(Prism::RestParameterNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, name: self.name, name_loc: self.name_loc, operator_loc: self.operator_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17095
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17098
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17074
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17148
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader name: Symbol?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17108
+ sig { returns(T.nilable(Symbol)) }
+ def name; end
+
+ # attr_reader name_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17111
+ sig { returns(T.nilable(Prism::Location)) }
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17143
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17130
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # def repeated_parameter?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17103
+ sig { returns(T::Boolean) }
+ def repeated_parameter?; end
+
+ # Save the name_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17125
+ def save_name_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17138
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17153
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17158
+ def type; end
+ end
+end
+
+# This represents the result of a call to ::parse or ::parse_file. It contains
+# the requested structure, any comments that were encounters, and any errors
+# that were encountered.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:676
+class Prism::Result
+ # Create a new result object with the given values.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:698
+ sig do
+ params(
+ comments: T::Array[Prism::Comment],
+ magic_comments: T::Array[Prism::MagicComment],
+ data_loc: T.nilable(Prism::Location),
+ errors: T::Array[Prism::ParseError],
+ warnings: T::Array[Prism::ParseWarning],
+ source: Prism::Source
+ ).void
+ end
+ def initialize(comments, magic_comments, data_loc, errors, warnings, source); end
+
+ # Create a code units cache for the given encoding.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:730
+ sig do
+ params(
+ encoding: Encoding
+ ).returns(T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)))
+ end
+ def code_units_cache(encoding); end
+
+ # The list of comments that were encountered during parsing.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:678
+ sig { returns(T::Array[Prism::Comment]) }
+ def comments; end
+
+ # An optional location that represents the location of the __END__ marker
+ # and the rest of the content of the file. This content is loaded into the
+ # DATA constant when the file being parsed is the main file being executed.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:686
+ sig { returns(T.nilable(Prism::Location)) }
+ def data_loc; end
+
+ # Implement the hash pattern matching interface for Result.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:708
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # Returns the encoding of the source code that was parsed.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:713
+ sig { returns(Encoding) }
+ def encoding; end
+
+ # The list of errors that were generated during parsing.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:689
+ sig { returns(T::Array[Prism::ParseError]) }
+ def errors; end
+
+ # Returns true if there were errors during parsing and false if there were
+ # not.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:725
+ sig { returns(T::Boolean) }
+ def failure?; end
+
+ # The list of magic comments that were encountered during parsing.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:681
+ sig { returns(T::Array[Prism::MagicComment]) }
+ def magic_comments; end
+
+ # A Source instance that represents the source code that was parsed.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:695
+ sig { returns(Prism::Source) }
+ def source; end
+
+ # Returns true if there were no errors during parsing and false if there
+ # were.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:719
+ sig { returns(T::Boolean) }
+ def success?; end
+
+ # The list of warnings that were generated during parsing.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:692
+ sig { returns(T::Array[Prism::ParseWarning]) }
+ def warnings; end
+end
+
+# Represents the use of the `retry` keyword.
+#
+# retry
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17177
+class Prism::RetryNode < ::Prism::Node
+ # Initialize a new RetryNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17179
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17242
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17187
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17192
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17208
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17203
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> RetryNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17213
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::RetryNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17218
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17221
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17197
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17226
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17231
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17236
+ def type; end
+ end
+end
+
+# Represents the use of the `return` keyword.
+#
+# return 1
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17251
+class Prism::ReturnNode < ::Prism::Node
+ # Initialize a new ReturnNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17253
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, arguments); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17342
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17263
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17318
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17268
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17287
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17280
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?arguments: ArgumentsNode?) -> ReturnNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17292
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ arguments: T.nilable(Prism::ArgumentsNode)
+ ).returns(Prism::ReturnNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, arguments: self.arguments); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17297
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, arguments: ArgumentsNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17300
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17273
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17326
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17321
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17305
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17313
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17331
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17336
+ def type; end
+ end
+end
+
+# This object is passed to the various Prism.* methods that accept the
+# `scopes` option as an element of the list. It defines both the local
+# variables visible at that scope as well as the forwarding parameters
+# available at that scope.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:884
+class Prism::Scope
+ # Create a new scope object with the given locals and forwarding.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:895
+ sig { params(locals: T::Array[Symbol], forwarding: T::Array[Symbol]).void }
+ def initialize(locals, forwarding); end
+
+ # The list of local variables that are forwarded to the next scope. This
+ # should by defined as an array of symbols containing the specific values of
+ # :*, :**, :&, or :"...".
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:892
+ sig { returns(T::Array[Symbol]) }
+ def forwarding; end
+
+ # The list of local variables that are defined in this scope. This should be
+ # defined as an array of symbols.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:887
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+end
+
+# Represents the `self` keyword.
+#
+# self
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17353
+class Prism::SelfNode < ::Prism::Node
+ # Initialize a new SelfNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17355
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17418
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17363
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17368
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17384
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17379
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SelfNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17389
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SelfNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17394
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17397
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17373
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17402
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17407
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17412
+ def type; end
+ end
+end
+
+# A module responsible for deserializing parse results.
+#
+# pkg:gem/prism#lib/prism/serialize.rb:17
+module Prism::Serialize
+ class << self
+ # Deserialize the dumped output from a request to lex or lex_file.
+ #
+ # The formatting of the source of this method is purposeful to illustrate
+ # the structure of the serialized data.
+ #
+ # pkg:gem/prism#lib/prism/serialize.rb:87
+ def load_lex(input, serialized, freeze); end
+
+ # Deserialize the dumped output from a request to parse or parse_file.
+ #
+ # The formatting of the source of this method is purposeful to illustrate
+ # the structure of the serialized data.
+ #
+ # pkg:gem/prism#lib/prism/serialize.rb:34
+ def load_parse(input, serialized, freeze); end
+
+ # Deserialize the dumped output from a request to parse_comments or
+ # parse_file_comments.
+ #
+ # The formatting of the source of this method is purposeful to illustrate
+ # the structure of the serialized data.
+ #
+ # pkg:gem/prism#lib/prism/serialize.rb:131
+ def load_parse_comments(input, serialized, freeze); end
+
+ # Deserialize the dumped output from a request to parse_lex or
+ # parse_lex_file.
+ #
+ # The formatting of the source of this method is purposeful to illustrate
+ # the structure of the serialized data.
+ #
+ # pkg:gem/prism#lib/prism/serialize.rb:153
+ def load_parse_lex(input, serialized, freeze); end
+ end
+end
+
+# pkg:gem/prism#lib/prism/serialize.rb:202
+class Prism::Serialize::ConstantPool
+ # pkg:gem/prism#lib/prism/serialize.rb:205
+ def initialize(input, serialized, base, size); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:213
+ def get(index, encoding); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:203
+ def size; end
+end
+
+# StringIO is synchronized and that adds a high overhead on TruffleRuby.
+#
+# pkg:gem/prism#lib/prism/serialize.rb:256
+Prism::Serialize::FastStringIO = StringIO
+
+# pkg:gem/prism#lib/prism/serialize.rb:259
+class Prism::Serialize::Loader
+ # pkg:gem/prism#lib/prism/serialize.rb:262
+ def initialize(source, serialized); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:270
+ def eof?; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:260
+ def input; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:260
+ def io; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:304
+ def load_comments(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:831
+ def load_constant(constant_pool, encoding); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:275
+ def load_constant_pool(constant_pool); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:782
+ def load_double; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:797
+ def load_embedded_string(encoding); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:292
+ def load_encoding; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:667
+ def load_error_level; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:682
+ def load_errors(encoding, freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:286
+ def load_header; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:771
+ def load_integer; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:298
+ def load_line_offsets(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:818
+ def load_location(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:812
+ def load_location_object(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:321
+ def load_magic_comments(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:842
+ def load_node(constant_pool, encoding, freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:836
+ def load_optional_constant(constant_pool, encoding); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:823
+ def load_optional_location(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:827
+ def load_optional_location_object(freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:790
+ def load_optional_node(constant_pool, encoding, freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:801
+ def load_string(encoding); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:733
+ def load_tokens; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:786
+ def load_uint32; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:766
+ def load_varsint; end
+
+ # variable-length integer using https://en.wikipedia.org/wiki/LEB128
+ # This is also what protobuf uses: https://protobuf.dev/programming-guides/encoding/#varints
+ #
+ # pkg:gem/prism#lib/prism/serialize.rb:752
+ def load_varuint; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:701
+ def load_warning_level; end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:714
+ def load_warnings(encoding, freeze); end
+
+ # pkg:gem/prism#lib/prism/serialize.rb:260
+ def source; end
+end
+
+# pkg:gem/prism#lib/prism/serialize.rb:338
+Prism::Serialize::Loader::DIAGNOSTIC_TYPES = T.let(T.unsafe(nil), Array)
+
+# The major version of prism that we are expecting to find in the serialized
+# strings.
+#
+# pkg:gem/prism#lib/prism/serialize.rb:20
+Prism::Serialize::MAJOR_VERSION = T.let(T.unsafe(nil), Integer)
+
+# The minor version of prism that we are expecting to find in the serialized
+# strings.
+#
+# pkg:gem/prism#lib/prism/serialize.rb:24
+Prism::Serialize::MINOR_VERSION = T.let(T.unsafe(nil), Integer)
+
+# The patch version of prism that we are expecting to find in the serialized
+# strings.
+#
+# pkg:gem/prism#lib/prism/serialize.rb:28
+Prism::Serialize::PATCH_VERSION = T.let(T.unsafe(nil), Integer)
+
+# The token types that can be indexed by their enum values.
+#
+# pkg:gem/prism#lib/prism/serialize.rb:2227
+Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array)
+
+# This node wraps a constant write to indicate that when the value is written, it should have its shareability state modified.
+#
+# C = { a: 1 }
+# ^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17428
+class Prism::ShareableConstantNode < ::Prism::Node
+ # Initialize a new ShareableConstantNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17430
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ write: T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, write); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17513
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17439
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17444
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17461
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17456
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode) -> ShareableConstantNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17466
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ write: T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode)
+ ).returns(Prism::ShareableConstantNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, write: self.write); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17471
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17474
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17449
+ def each_child_node; end
+
+ # def experimental_copy?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17489
+ sig { returns(T::Boolean) }
+ def experimental_copy?; end
+
+ # def experimental_everything?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17484
+ sig { returns(T::Boolean) }
+ def experimental_everything?; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17497
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def literal?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17479
+ sig { returns(T::Boolean) }
+ def literal?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17502
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # The constant write that should be modified with the shareability state.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17494
+ sig do
+ returns(T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode))
+ end
+ def write; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17507
+ def type; end
+ end
+end
+
+# Flags for shareable constant nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19918
+module Prism::ShareableConstantNodeFlags; end
+
+# constant writes that should be modified with shareable constant value experimental copy
+#
+# pkg:gem/prism#lib/prism/node.rb:19926
+Prism::ShareableConstantNodeFlags::EXPERIMENTAL_COPY = T.let(T.unsafe(nil), Integer)
+
+# constant writes that should be modified with shareable constant value experimental everything
+#
+# pkg:gem/prism#lib/prism/node.rb:19923
+Prism::ShareableConstantNodeFlags::EXPERIMENTAL_EVERYTHING = T.let(T.unsafe(nil), Integer)
+
+# constant writes that should be modified with shareable constant value literal
+#
+# pkg:gem/prism#lib/prism/node.rb:19920
+Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer)
+
+# Represents a singleton class declaration involving the `class` keyword.
+#
+# class << self end
+# ^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17524
+class Prism::SingletonClassNode < ::Prism::Node
+ # Initialize a new SingletonClassNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17526
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ class_keyword_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ expression: Prism::Node,
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17663
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17540
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader body: StatementsNode | BeginNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17616
+ sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17545
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def class_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17632
+ sig { returns(String) }
+ def class_keyword; end
+
+ # attr_reader class_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17587
+ sig { returns(Prism::Location) }
+ def class_keyword_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17566
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17558
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?class_keyword_loc: Location, ?operator_loc: Location, ?expression: Prism::node, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location) -> SingletonClassNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17571
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ locals: T::Array[Symbol],
+ class_keyword_loc: Prism::Location,
+ operator_loc: Prism::Location,
+ expression: Prism::Node,
+ body: T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode)),
+ end_keyword_loc: Prism::Location
+ ).returns(Prism::SingletonClassNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, locals: self.locals, class_keyword_loc: self.class_keyword_loc, operator_loc: self.operator_loc, expression: self.expression, body: self.body, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17576
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Prism::node, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17579
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17550
+ def each_child_node; end
+
+ # def end_keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17642
+ sig { returns(String) }
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17619
+ sig { returns(Prism::Location) }
+ def end_keyword_loc; end
+
+ # attr_reader expression: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17613
+ sig { returns(Prism::Node) }
+ def expression; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17647
+ sig { override.returns(String) }
+ def inspect; end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17584
+ sig { returns(T::Array[Symbol]) }
+ def locals; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17637
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17600
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the class_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17595
+ def save_class_keyword_loc(repository); end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17627
+ def save_end_keyword_loc(repository); end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17608
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17652
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17657
+ def type; end
+ end
+end
+
+# This represents a source of Ruby code that has been parsed. It is used in
+# conjunction with locations to allow them to resolve line numbers and source
+# ranges.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:8
+class Prism::Source
+ # Create a new source object with the given source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:46
+ sig { params(source: String, start_line: Integer, offsets: T::Array[Integer]).void }
+ def initialize(source, start_line = 1, offsets = []); end
+
+ # Converts the line number and column in bytes to a byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:80
+ def byte_offset(line, column); end
+
+ # Return the column number in characters for the given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:117
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def character_column(byte_offset); end
+
+ # Return the character offset for the given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:112
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def character_offset(byte_offset); end
+
+ # Generate a cache that targets a specific encoding for calculating code
+ # unit offsets.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:145
+ sig do
+ params(
+ encoding: Encoding
+ ).returns(T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)))
+ end
+ def code_units_cache(encoding); end
+
+ # Returns the column number in code units for the given encoding for the
+ # given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:151
+ sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
+ def code_units_column(byte_offset, encoding); end
+
+ # Returns the offset from the start of the file for the given byte offset
+ # counting in code units for the given encoding.
+ #
+ # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the
+ # concept of code units that differs from the number of characters in other
+ # encodings, it is not captured here.
+ #
+ # We purposefully replace invalid and undefined characters with replacement
+ # characters in this conversion. This happens for two reasons. First, it's
+ # possible that the given byte offset will not occur on a character
+ # boundary. Second, it's possible that the source code will contain a
+ # character that has no equivalent in the given encoding.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:133
+ sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) }
+ def code_units_offset(byte_offset, encoding); end
+
+ # Return the column number for the given byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:107
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def column(byte_offset); end
+
+ # Freeze this object and the objects it contains.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:156
+ def deep_freeze; end
+
+ # Returns the encoding of the source code, which is set by parameters to the
+ # parser or by the encoding magic comment.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:64
+ sig { returns(Encoding) }
+ def encoding; end
+
+ # Binary search through the offsets to find the line number for the given
+ # byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:90
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def line(byte_offset); end
+
+ # Returns the byte offset of the end of the line corresponding to the given
+ # byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:102
+ def line_end(byte_offset); end
+
+ # Return the byte offset of the start of the line corresponding to the given
+ # byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:96
+ sig { params(byte_offset: Integer).returns(Integer) }
+ def line_start(byte_offset); end
+
+ # Returns the lines of the source code as an array of strings.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:69
+ sig { returns(T::Array[String]) }
+ def lines; end
+
+ # The list of newline byte offsets in the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:43
+ sig { returns(T::Array[Integer]) }
+ def offsets; end
+
+ # Replace the value of offsets with the given value.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:58
+ sig { params(offsets: T::Array[Integer]).void }
+ def replace_offsets(offsets); end
+
+ # Replace the value of start_line with the given value.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:53
+ sig { params(start_line: Integer).void }
+ def replace_start_line(start_line); end
+
+ # Perform a byteslice on the source code using the given byte offset and
+ # byte length.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:75
+ sig { params(byte_offset: Integer, length: Integer).returns(String) }
+ def slice(byte_offset, length); end
+
+ # The source code that this source object represents.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:37
+ sig { returns(String) }
+ def source; end
+
+ # The line number where this source starts.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:40
+ sig { returns(Integer) }
+ def start_line; end
+
+ private
+
+ # Binary search through the offsets to find the line number for the given
+ # byte offset.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:166
+ def find_line(byte_offset); end
+
+ class << self
+ # Create a new source object with the given source code. This method should
+ # be used instead of `new` and it will return either a `Source` or a
+ # specialized and more performant `ASCIISource` if no multibyte characters
+ # are present in the source code.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:13
+ def for(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end
+ end
+end
+
+# Represents the use of the `__ENCODING__` keyword.
+#
+# __ENCODING__
+# ^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17679
+class Prism::SourceEncodingNode < ::Prism::Node
+ # Initialize a new SourceEncodingNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17681
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17744
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17689
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17694
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17710
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17705
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SourceEncodingNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17715
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SourceEncodingNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17720
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17723
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17699
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17728
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17733
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17738
+ def type; end
+ end
+end
+
+# Represents the use of the `__FILE__` keyword.
+#
+# __FILE__
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17753
+class Prism::SourceFileNode < ::Prism::Node
+ # Initialize a new SourceFileNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17755
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ filepath: String
+ ).void
+ end
+ def initialize(source, node_id, location, flags, filepath); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17842
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17764
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17769
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17785
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17780
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?filepath: String) -> SourceFileNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17790
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ filepath: String
+ ).returns(Prism::SourceFileNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, filepath: self.filepath); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17795
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, filepath: String }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17798
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17774
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # Represents the file path being parsed. This corresponds directly to the `filepath` option given to the various `Prism::parse*` APIs.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17823
+ sig { returns(String) }
+ def filepath; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17808
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17803
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def frozen?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17813
+ sig { returns(T::Boolean) }
+ def frozen?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17826
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def mutable?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17818
+ sig { returns(T::Boolean) }
+ def mutable?; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17831
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17836
+ def type; end
+ end
+end
+
+# Represents the use of the `__LINE__` keyword.
+#
+# __LINE__
+# ^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17853
+class Prism::SourceLineNode < ::Prism::Node
+ # Initialize a new SourceLineNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17855
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17918
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17863
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17868
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17884
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17879
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SourceLineNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17889
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SourceLineNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17894
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17897
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17873
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17902
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17907
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17912
+ def type; end
+ end
+end
+
+# Represents the use of the splat operator.
+#
+# [*a]
+# ^^
+#
+# pkg:gem/prism#lib/prism/node.rb:17927
+class Prism::SplatNode < ::Prism::Node
+ # Initialize a new SplatNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17929
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ expression: T.nilable(Prism::Node)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, operator_loc, expression); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18018
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17939
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17944
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17963
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17956
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?expression: Prism::node?) -> SplatNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17968
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ operator_loc: Prism::Location,
+ expression: T.nilable(Prism::Node)
+ ).returns(Prism::SplatNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, operator_loc: self.operator_loc, expression: self.expression); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17973
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, expression: Prism::node? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17976
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17949
+ def each_child_node; end
+
+ # attr_reader expression: Prism::node?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17994
+ sig { returns(T.nilable(Prism::Node)) }
+ def expression; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18002
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def operator: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17997
+ sig { returns(String) }
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17981
+ sig { returns(Prism::Location) }
+ def operator_loc; end
+
+ # Save the operator_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:17989
+ def save_operator_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18007
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18012
+ def type; end
+ end
+end
+
+# Represents a set of statements contained within some scope.
+#
+# foo; bar; baz
+# ^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:18029
+class Prism::StatementsNode < ::Prism::Node
+ # Initialize a new StatementsNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18031
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ body: T::Array[Prism::Node]
+ ).void
+ end
+ def initialize(source, node_id, location, flags, body); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18099
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18040
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader body: Array[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18080
+ sig { returns(T::Array[Prism::Node]) }
+ def body; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18045
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18062
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18057
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Array[Prism::node]) -> StatementsNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18067
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ body: T::Array[Prism::Node]
+ ).returns(Prism::StatementsNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, body: self.body); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18072
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Array[Prism::node] }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18075
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18050
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18083
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18088
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18093
+ def type; end
+ end
+end
+
+# Flags for string nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19930
+module Prism::StringFlags; end
+
+# internal bytes forced the encoding to binary
+#
+# pkg:gem/prism#lib/prism/node.rb:19935
+Prism::StringFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to UTF-8
+#
+# pkg:gem/prism#lib/prism/node.rb:19932
+Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/node.rb:19938
+Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/node.rb:19941
+Prism::StringFlags::MUTABLE = T.let(T.unsafe(nil), Integer)
+
+# Represents a string literal, a string contained within a `%w` list, or plain string content within an interpolated string.
+#
+# "foo"
+# ^^^^^
+#
+# %w[foo]
+# ^^^
+#
+# "foo #{bar} baz"
+# ^^^^ ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:18116
+class Prism::StringNode < ::Prism::Node
+ include ::Prism::HeredocQuery
+
+ # Initialize a new StringNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18118
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ content_loc: Prism::Location,
+ closing_loc: T.nilable(Prism::Location),
+ unescaped: String
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, content_loc, closing_loc, unescaped); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18274
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18130
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18135
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18253
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18221
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18151
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18146
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18248
+ sig { returns(String) }
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18208
+ sig { returns(Prism::Location) }
+ def content_loc; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?content_loc: Location, ?closing_loc: Location?, ?unescaped: String) -> StringNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18156
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ content_loc: Prism::Location,
+ closing_loc: T.nilable(Prism::Location),
+ unescaped: String
+ ).returns(Prism::StringNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, content_loc: self.content_loc, closing_loc: self.closing_loc, unescaped: self.unescaped); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18161
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18164
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18140
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18174
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18169
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def frozen?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18179
+ sig { returns(T::Boolean) }
+ def frozen?; end
+
+ sig { returns(T::Boolean) }
+ def heredoc?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18258
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def mutable?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18184
+ sig { returns(T::Boolean) }
+ def mutable?; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18243
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18189
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18235
+ def save_closing_loc(repository); end
+
+ # Save the content_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18216
+ def save_content_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18203
+ def save_opening_loc(repository); end
+
+ # Occasionally it's helpful to treat a string as if it were interpolated so
+ # that there's a consistent interface for working with strings.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:75
+ sig { returns(Prism::InterpolatedStringNode) }
+ def to_interpolated; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18263
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18240
+ sig { returns(String) }
+ def unescaped; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18268
+ def type; end
+ end
+end
+
+# Here we are going to patch StringQuery to put in the class-level methods so
+# that it can maintain a consistent interface
+# Query methods that allow categorizing strings based on their context for
+# where they could be valid in a Ruby syntax tree.
+#
+# pkg:gem/prism#lib/prism/string_query.rb:7
+class Prism::StringQuery
+ # Initialize a new query with the given string.
+ #
+ # pkg:gem/prism#lib/prism/string_query.rb:12
+ def initialize(string); end
+
+ # Whether or not this string is a valid constant name.
+ #
+ # pkg:gem/prism#lib/prism/string_query.rb:22
+ def constant?; end
+
+ # Whether or not this string is a valid local variable name.
+ #
+ # pkg:gem/prism#lib/prism/string_query.rb:17
+ def local?; end
+
+ # Whether or not this string is a valid method name.
+ #
+ # pkg:gem/prism#lib/prism/string_query.rb:27
+ def method_name?; end
+
+ # The string that this query is wrapping.
+ #
+ # pkg:gem/prism#lib/prism/string_query.rb:9
+ def string; end
+
+ class << self
+ # Mirrors the C extension's StringQuery::constant? method.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ sig { params(string: String).returns(T::Boolean) }
+ def constant?(string); end
+
+ # Mirrors the C extension's StringQuery::local? method.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ sig { params(string: String).returns(T::Boolean) }
+ def local?(string); end
+
+ # Mirrors the C extension's StringQuery::method_name? method.
+ #
+ # pkg:gem/prism#lib/prism.rb:92
+ sig { params(string: String).returns(T::Boolean) }
+ def method_name?(string); end
+ end
+end
+
+# Represents the use of the `super` keyword with parentheses or arguments.
+#
+# super()
+# ^^^^^^^
+#
+# super foo, bar
+# ^^^^^^^^^^^^^^
+#
+# If no arguments are provided (except for a block), it would be a `ForwardingSuperNode` instead.
+#
+# pkg:gem/prism#lib/prism/node.rb:18293
+class Prism::SuperNode < ::Prism::Node
+ # Initialize a new SuperNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18295
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ lparen_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ rparen_loc: T.nilable(Prism::Location),
+ block: T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, lparen_loc, arguments, rparen_loc, block); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18440
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18308
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # Can be only `nil` when there are empty parentheses, like `super()`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18384
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # attr_reader block: BlockNode | BlockArgumentNode | nil
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18406
+ sig { returns(T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))) }
+ def block; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18313
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18334
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18326
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?block: BlockNode | BlockArgumentNode | nil) -> SuperNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18339
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ lparen_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ rparen_loc: T.nilable(Prism::Location),
+ block: T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))
+ ).returns(Prism::SuperNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, lparen_loc: self.lparen_loc, arguments: self.arguments, rparen_loc: self.rparen_loc, block: self.block); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18344
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: BlockNode | BlockArgumentNode | nil }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18347
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18318
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18424
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18409
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18352
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def lparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18414
+ sig { returns(T.nilable(String)) }
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18365
+ sig { returns(T.nilable(Prism::Location)) }
+ def lparen_loc; end
+
+ # def rparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18419
+ sig { returns(T.nilable(String)) }
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18387
+ sig { returns(T.nilable(Prism::Location)) }
+ def rparen_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18360
+ def save_keyword_loc(repository); end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18379
+ def save_lparen_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18401
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18429
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18434
+ def type; end
+ end
+end
+
+# Flags for symbol nodes.
+#
+# pkg:gem/prism#lib/prism/node.rb:19945
+module Prism::SymbolFlags; end
+
+# internal bytes forced the encoding to binary
+#
+# pkg:gem/prism#lib/prism/node.rb:19950
+Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to US-ASCII
+#
+# pkg:gem/prism#lib/prism/node.rb:19953
+Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# internal bytes forced the encoding to UTF-8
+#
+# pkg:gem/prism#lib/prism/node.rb:19947
+Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer)
+
+# Represents a symbol literal or a symbol contained within a `%i` list.
+#
+# :foo
+# ^^^^
+#
+# %i[foo]
+# ^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:18457
+class Prism::SymbolNode < ::Prism::Node
+ # Initialize a new SymbolNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18459
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ value_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ unescaped: String
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, value_loc, closing_loc, unescaped); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18616
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18471
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18476
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18595
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18563
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18492
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18487
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?value_loc: Location?, ?closing_loc: Location?, ?unescaped: String) -> SymbolNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18497
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: T.nilable(Prism::Location),
+ value_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ unescaped: String
+ ).returns(Prism::SymbolNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, value_loc: self.value_loc, closing_loc: self.closing_loc, unescaped: self.unescaped); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18502
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18505
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18481
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18515
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18520
+ sig { returns(T::Boolean) }
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18510
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18600
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18585
+ sig { returns(T.nilable(String)) }
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18525
+ sig { returns(T.nilable(Prism::Location)) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18577
+ def save_closing_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18539
+ def save_opening_loc(repository); end
+
+ # Save the value_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18558
+ def save_value_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18605
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18582
+ sig { returns(String) }
+ def unescaped; end
+
+ # def value: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18590
+ sig { returns(T.nilable(String)) }
+ def value; end
+
+ # attr_reader value_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18544
+ sig { returns(T.nilable(Prism::Location)) }
+ def value_loc; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18610
+ def type; end
+ end
+end
+
+# This represents a token from the Ruby source.
+#
+# pkg:gem/prism#lib/prism/parse_result.rb:813
+class Prism::Token
+ # Create a new token object with the given type, value, and location.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:825
+ sig { params(source: Prism::Source, type: Symbol, value: String, location: T.any(Integer, Prism::Location)).void }
+ def initialize(source, type, value, location); end
+
+ # Returns true if the given other token is equal to this token.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:860
+ sig { params(other: T.untyped).returns(T::Boolean) }
+ def ==(other); end
+
+ # Implement the hash pattern matching interface for Token.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:833
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # Freeze this object and the objects it contains.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:873
+ def deep_freeze; end
+
+ # Returns a string representation of this token.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:867
+ def inspect; end
+
+ # A Location object representing the location of this token in the source.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:838
+ sig { returns(Prism::Location) }
+ def location; end
+
+ # Implement the pretty print interface for Token.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:845
+ sig { params(q: T.untyped).void }
+ def pretty_print(q); end
+
+ # The type of token that this token is.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:819
+ sig { returns(Symbol) }
+ def type; end
+
+ # A byteslice of the source that this token represents.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:822
+ sig { returns(String) }
+ def value; end
+
+ private
+
+ # The Source object that represents the source this token came from.
+ #
+ # pkg:gem/prism#lib/prism/parse_result.rb:815
+ sig { returns(Prism::Source) }
+ def source; end
+end
+
+# This module is responsible for converting the prism syntax tree into other
+# syntax trees.
+#
+# pkg:gem/prism#lib/prism/translation.rb:7
+module Prism::Translation; end
+
+# This class is the entry-point for converting a prism syntax tree into the
+# whitequark/parser gem's syntax tree. It inherits from the base parser for
+# the parser gem, and overrides the parse* methods to parse with prism and
+# then translate.
+#
+# Note that this version of the parser always parses using the latest
+# version of Ruby syntax supported by Prism. If you want specific version
+# support, use one of the version-specific subclasses, such as
+# `Prism::Translation::Parser34`. If you want to parse using the same
+# version of Ruby syntax as the currently running version of Ruby, use
+# `Prism::Translation::ParserCurrent`.
+#
+# pkg:gem/prism#lib/prism/translation/parser.rb:29
+class Prism::Translation::Parser < ::Parser::Base
+ # The `builder` argument is used to create the parser using our custom builder class by default.
+ #
+ # By using the `:parser` keyword argument, you can translate in a way that is compatible with
+ # the Parser gem using any parser.
+ #
+ # For example, in RuboCop for Ruby LSP, the following approach can be used to improve performance
+ # by reusing a pre-parsed `Prism::ParseLexResult`:
+ #
+ # class PrismPreparsed
+ # def initialize(prism_result)
+ # @prism_result = prism_result
+ # end
+ #
+ # def parse_lex(source, **options)
+ # @prism_result
+ # end
+ # end
+ #
+ # prism_preparsed = PrismPreparsed.new(prism_result)
+ #
+ # Prism::Translation::Ruby34.new(builder, parser: prism_preparsed)
+ #
+ # In an object passed to the `:parser` keyword argument, the `parse` and `parse_lex` methods
+ # should be implemented as needed.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:74
+ def initialize(builder = T.unsafe(nil), parser: T.unsafe(nil)); end
+
+ # The default encoding for Ruby files is UTF-8.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:91
+ def default_encoding; end
+
+ # Parses a source buffer and returns the AST.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:99
+ def parse(source_buffer); end
+
+ # Parses a source buffer and returns the AST and the source code comments.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:112
+ def parse_with_comments(source_buffer); end
+
+ # Parses a source buffer and returns the AST, the source code comments,
+ # and the tokens emitted by the lexer.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:129
+ def tokenize(source_buffer, recover = T.unsafe(nil)); end
+
+ # Since prism resolves num params for us, we don't need to support this
+ # kind of logic here.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:155
+ def try_declare_numparam(node); end
+
+ # pkg:gem/prism#lib/prism/translation/parser.rb:86
+ sig { overridable.returns(Integer) }
+ def version; end
+
+ # pkg:gem/prism#lib/prism/translation/parser.rb:95
+ def yyerror; end
+
+ private
+
+ # Build the parser gem AST from the prism AST.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:313
+ def build_ast(program, offset_cache); end
+
+ # Build the parser gem comments from the prism comments.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:318
+ def build_comments(comments, offset_cache); end
+
+ # Prism deals with offsets in bytes, while the parser gem deals with
+ # offsets in characters. We need to handle this conversion in order to
+ # build the parser gem AST.
+ #
+ # If the bytesize of the source is the same as the length, then we can
+ # just use the offset directly. Otherwise, we build an array where the
+ # index is the byte offset and the value is the character offset.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:296
+ def build_offset_cache(source); end
+
+ # Build a range from a prism location.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:330
+ def build_range(location, offset_cache); end
+
+ # Build the parser gem tokens from the prism tokens.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:325
+ def build_tokens(tokens, offset_cache); end
+
+ # Converts the version format handled by Parser to the format handled by Prism.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:353
+ def convert_for_prism(version); end
+
+ # Build a diagnostic from the given prism parse error.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:174
+ def error_diagnostic(error, offset_cache); end
+
+ # Options for how prism should parse/lex the source.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:339
+ def prism_options; end
+
+ # If there was a error generated during the parse, then raise an
+ # appropriate syntax error. Otherwise return the result.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:274
+ def unwrap(result, offset_cache); end
+
+ # This is a hook to allow consumers to disable some errors if they don't
+ # want them to block creating the syntax tree.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:163
+ def valid_error?(error); end
+
+ # This is a hook to allow consumers to disable some warnings if they don't
+ # want them to block creating the syntax tree.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:169
+ def valid_warning?(warning); end
+
+ # Build a diagnostic from the given prism parse warning.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:247
+ def warning_diagnostic(warning, offset_cache); end
+end
+
+# This class is the entry-point for Ruby 3.3 of `Prism::Translation::Parser`.
+#
+# pkg:gem/prism#lib/prism/translation/parser_versions.rb:7
+class Prism::Translation::Parser33 < ::Prism::Translation::Parser
+ # pkg:gem/prism#lib/prism/translation/parser_versions.rb:8
+ sig { override.returns(Integer) }
+ def version; end
+end
+
+# This class is the entry-point for Ruby 3.4 of `Prism::Translation::Parser`.
+#
+# pkg:gem/prism#lib/prism/translation/parser_versions.rb:14
+class Prism::Translation::Parser34 < ::Prism::Translation::Parser
+ # pkg:gem/prism#lib/prism/translation/parser_versions.rb:15
+ sig { override.returns(Integer) }
+ def version; end
+end
+
+# pkg:gem/prism#lib/prism/translation/parser_versions.rb:27
+Prism::Translation::Parser35 = Prism::Translation::Parser40
+
+# This class is the entry-point for Ruby 4.0 of `Prism::Translation::Parser`.
+#
+# pkg:gem/prism#lib/prism/translation/parser_versions.rb:21
+class Prism::Translation::Parser40 < ::Prism::Translation::Parser
+ # pkg:gem/prism#lib/prism/translation/parser_versions.rb:22
+ sig { override.returns(Integer) }
+ def version; end
+end
+
+# This class is the entry-point for Ruby 4.1 of `Prism::Translation::Parser`.
+#
+# pkg:gem/prism#lib/prism/translation/parser_versions.rb:30
+class Prism::Translation::Parser41 < ::Prism::Translation::Parser
+ # pkg:gem/prism#lib/prism/translation/parser_versions.rb:31
+ def version; end
+end
+
+# A builder that knows how to convert more modern Ruby syntax
+# into whitequark/parser gem's syntax tree.
+#
+# pkg:gem/prism#lib/prism/translation/parser/builder.rb:9
+class Prism::Translation::Parser::Builder < ::Parser::Builders::Default
+ # The following three lines have been added to support the `it` block parameter syntax in the source code below.
+ #
+ # if args.type == :itarg
+ # block_type = :itblock
+ # args = :it
+ #
+ # https://github.com/whitequark/parser/blob/v3.3.7.1/lib/parser/builders/default.rb#L1122-L1155
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/builder.rb:22
+ def block(method_call, begin_t, args, body, end_t); end
+
+ # It represents the `it` block argument, which is not yet implemented in the Parser gem.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/builder.rb:11
+ def itarg; end
+end
+
+# A visitor that knows how to convert a prism syntax tree into the
+# whitequark/parser gem's syntax tree.
+#
+# pkg:gem/prism#lib/prism/translation/parser/compiler.rb:9
+class Prism::Translation::Parser::Compiler < ::Prism::Compiler
+ # Initialize a new compiler with the given parser, offset cache, and
+ # options.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:40
+ def initialize(parser, offset_cache, forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
+
+ # The Parser::Builders::Default instance that is being used to build the
+ # AST.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:19
+ def builder; end
+
+ # The types of values that can be forwarded in the current scope.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:30
+ def forwarding; end
+
+ # Whether or not the current node is in a destructure.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:33
+ def in_destructure; end
+
+ # Whether or not the current node is in a pattern.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:36
+ def in_pattern; end
+
+ # The offset cache that is used to map between byte and character
+ # offsets in the file.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:27
+ def offset_cache; end
+
+ # The Parser::Base instance that is being used to build the AST.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:15
+ def parser; end
+
+ # The Parser::Source::Buffer instance that is holding a reference to the
+ # source code.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:23
+ def source_buffer; end
+
+ # alias $foo $bar
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:59
+ def visit_alias_global_variable_node(node); end
+
+ # alias foo bar
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:53
+ def visit_alias_method_node(node); end
+
+ # foo => bar | baz
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:65
+ def visit_alternation_pattern_node(node); end
+
+ # a and b
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:71
+ def visit_and_node(node); end
+
+ # foo(bar)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:128
+ def visit_arguments_node(node); end
+
+ # []
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:77
+ def visit_array_node(node); end
+
+ # foo => [bar]
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:105
+ def visit_array_pattern_node(node); end
+
+ # { a: 1 }
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:134
+ def visit_assoc_node(node); end
+
+ # def foo(**); bar(**); end
+ # ^^
+ #
+ # { **foo }
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:182
+ def visit_assoc_splat_node(node); end
+
+ # $+
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:194
+ def visit_back_reference_read_node(node); end
+
+ # begin end
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:200
+ def visit_begin_node(node); end
+
+ # foo(&bar)
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:245
+ def visit_block_argument_node(node); end
+
+ # foo { |; bar| }
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:251
+ def visit_block_local_variable_node(node); end
+
+ # A block on a keyword or method call.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:256
+ def visit_block_node(node); end
+
+ # def foo(&bar); end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:262
+ def visit_block_parameter_node(node); end
+
+ # A block's parameters.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:267
+ def visit_block_parameters_node(node); end
+
+ # break
+ # ^^^^^
+ #
+ # break foo
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:276
+ def visit_break_node(node); end
+
+ # foo.bar &&= baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:381
+ def visit_call_and_write_node(node); end
+
+ # foo
+ # ^^^
+ #
+ # foo.bar
+ # ^^^^^^^
+ #
+ # foo.bar() {}
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:288
+ def visit_call_node(node); end
+
+ # foo.bar += baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:362
+ def visit_call_operator_write_node(node); end
+
+ # foo.bar ||= baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:400
+ def visit_call_or_write_node(node); end
+
+ # foo.bar, = 1
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:419
+ def visit_call_target_node(node); end
+
+ # foo => bar => baz
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:431
+ def visit_capture_pattern_node(node); end
+
+ # case foo; in bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:450
+ def visit_case_match_node(node); end
+
+ # case foo; when bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:437
+ def visit_case_node(node); end
+
+ # class Foo; end
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:463
+ def visit_class_node(node); end
+
+ # @@foo &&= bar
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:502
+ def visit_class_variable_and_write_node(node); end
+
+ # @@foo += bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:492
+ def visit_class_variable_operator_write_node(node); end
+
+ # @@foo ||= bar
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:512
+ def visit_class_variable_or_write_node(node); end
+
+ # @@foo
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:476
+ def visit_class_variable_read_node(node); end
+
+ # @@foo, = bar
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:522
+ def visit_class_variable_target_node(node); end
+
+ # @@foo = 1
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:482
+ def visit_class_variable_write_node(node); end
+
+ # Foo &&= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:553
+ def visit_constant_and_write_node(node); end
+
+ # Foo += bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:543
+ def visit_constant_operator_write_node(node); end
+
+ # Foo ||= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:563
+ def visit_constant_or_write_node(node); end
+
+ # Foo::Bar &&= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:619
+ def visit_constant_path_and_write_node(node); end
+
+ # Foo::Bar
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:579
+ def visit_constant_path_node(node); end
+
+ # Foo::Bar += baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:609
+ def visit_constant_path_operator_write_node(node); end
+
+ # Foo::Bar ||= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:629
+ def visit_constant_path_or_write_node(node); end
+
+ # Foo::Bar, = baz
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:639
+ def visit_constant_path_target_node(node); end
+
+ # Foo::Bar = 1
+ # ^^^^^^^^^^^^
+ #
+ # Foo::Foo, Bar::Bar = 1
+ # ^^^^^^^^ ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:599
+ def visit_constant_path_write_node(node); end
+
+ # Foo
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:528
+ def visit_constant_read_node(node); end
+
+ # Foo, = bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:573
+ def visit_constant_target_node(node); end
+
+ # Foo = 1
+ # ^^^^^^^
+ #
+ # Foo, Bar = 1
+ # ^^^ ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:537
+ def visit_constant_write_node(node); end
+
+ # def foo; end
+ # ^^^^^^^^^^^^
+ #
+ # def self.foo; end
+ # ^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:648
+ def visit_def_node(node); end
+
+ # defined? a
+ # ^^^^^^^^^^
+ #
+ # defined?(a)
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:695
+ def visit_defined_node(node); end
+
+ # if foo then bar else baz end
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:731
+ def visit_else_node(node); end
+
+ # "foo #{bar}"
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:737
+ def visit_embedded_statements_node(node); end
+
+ # "foo #@bar"
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:747
+ def visit_embedded_variable_node(node); end
+
+ # begin; foo; ensure; bar; end
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:753
+ def visit_ensure_node(node); end
+
+ # false
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:759
+ def visit_false_node(node); end
+
+ # foo => [*, bar, *]
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:765
+ def visit_find_pattern_node(node); end
+
+ # if foo .. bar; end
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1541
+ def visit_flip_flop_node(node); end
+
+ # 1.0
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:777
+ def visit_float_node(node); end
+
+ # for foo in bar do end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:783
+ def visit_for_node(node); end
+
+ # def foo(...); bar(...); end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:801
+ def visit_forwarding_arguments_node(node); end
+
+ # def foo(...); end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:807
+ def visit_forwarding_parameter_node(node); end
+
+ # super
+ # ^^^^^
+ #
+ # super {}
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:816
+ def visit_forwarding_super_node(node); end
+
+ # $foo &&= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:854
+ def visit_global_variable_and_write_node(node); end
+
+ # $foo += bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:844
+ def visit_global_variable_operator_write_node(node); end
+
+ # $foo ||= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:864
+ def visit_global_variable_or_write_node(node); end
+
+ # $foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:828
+ def visit_global_variable_read_node(node); end
+
+ # $foo, = bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:874
+ def visit_global_variable_target_node(node); end
+
+ # $foo = 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:834
+ def visit_global_variable_write_node(node); end
+
+ # {}
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:880
+ def visit_hash_node(node); end
+
+ # foo => {}
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:890
+ def visit_hash_pattern_node(node); end
+
+ # if foo then bar end
+ # ^^^^^^^^^^^^^^^^^^^
+ #
+ # bar if foo
+ # ^^^^^^^^^^
+ #
+ # foo ? bar : baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:908
+ def visit_if_node(node); end
+
+ # 1i
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:950
+ def visit_imaginary_node(node); end
+
+ # { foo: }
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:956
+ def visit_implicit_node(node); end
+
+ # foo { |bar,| }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:962
+ def visit_implicit_rest_node(node); end
+
+ # case foo; in bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:968
+ def visit_in_node(node); end
+
+ # foo[bar] &&= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1016
+ def visit_index_and_write_node(node); end
+
+ # foo[bar] += baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:998
+ def visit_index_operator_write_node(node); end
+
+ # foo[bar] ||= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1034
+ def visit_index_or_write_node(node); end
+
+ # foo[bar], = 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1052
+ def visit_index_target_node(node); end
+
+ # @foo &&= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1089
+ def visit_instance_variable_and_write_node(node); end
+
+ # @foo += bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1079
+ def visit_instance_variable_operator_write_node(node); end
+
+ # @foo ||= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1099
+ def visit_instance_variable_or_write_node(node); end
+
+ # @foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1063
+ def visit_instance_variable_read_node(node); end
+
+ # @foo, = bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1109
+ def visit_instance_variable_target_node(node); end
+
+ # @foo = 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1069
+ def visit_instance_variable_write_node(node); end
+
+ # 1
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1115
+ def visit_integer_node(node); end
+
+ # if /foo #{bar}/ then end
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1132
+ def visit_interpolated_match_last_line_node(node); end
+
+ # /foo #{bar}/
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1121
+ def visit_interpolated_regular_expression_node(node); end
+
+ # "foo #{bar}"
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1136
+ def visit_interpolated_string_node(node); end
+
+ # :"foo #{bar}"
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1150
+ def visit_interpolated_symbol_node(node); end
+
+ # `foo #{bar}`
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1160
+ def visit_interpolated_x_string_node(node); end
+
+ # -> { it }
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1174
+ def visit_it_local_variable_read_node(node); end
+
+ # -> { it }
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1180
+ def visit_it_parameters_node(node); end
+
+ # foo(bar: baz)
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1196
+ def visit_keyword_hash_node(node); end
+
+ # def foo(**bar); end
+ # ^^^^^
+ #
+ # def foo(**); end
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1205
+ def visit_keyword_rest_parameter_node(node); end
+
+ # -> {}
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1214
+ def visit_lambda_node(node); end
+
+ # foo &&= bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1266
+ def visit_local_variable_and_write_node(node); end
+
+ # foo += bar
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1256
+ def visit_local_variable_operator_write_node(node); end
+
+ # foo ||= bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1276
+ def visit_local_variable_or_write_node(node); end
+
+ # foo
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1240
+ def visit_local_variable_read_node(node); end
+
+ # foo, = bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1286
+ def visit_local_variable_target_node(node); end
+
+ # foo = 1
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1246
+ def visit_local_variable_write_node(node); end
+
+ # if /foo/ then end
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1577
+ def visit_match_last_line_node(node); end
+
+ # foo in bar
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1296
+ def visit_match_predicate_node(node); end
+
+ # foo => bar
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1306
+ def visit_match_required_node(node); end
+
+ # /(?foo)/ =~ bar
+ # ^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1316
+ def visit_match_write_node(node); end
+
+ # A node that is missing from the syntax tree. This is only used in the
+ # case of a syntax error. The parser gem doesn't have such a concept, so
+ # we invent our own here.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1327
+ def visit_missing_node(node); end
+
+ # module Foo; end
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1333
+ def visit_module_node(node); end
+
+ # foo, bar = baz
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1344
+ def visit_multi_target_node(node); end
+
+ # foo, bar = baz
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1354
+ def visit_multi_write_node(node); end
+
+ # next
+ # ^^^^
+ #
+ # next foo
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1377
+ def visit_next_node(node); end
+
+ # nil
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1389
+ def visit_nil_node(node); end
+
+ # def foo(**nil); end
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1395
+ def visit_no_keywords_parameter_node(node); end
+
+ # -> { _1 + _2 }
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1405
+ def visit_numbered_parameters_node(node); end
+
+ # $1
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1411
+ def visit_numbered_reference_read_node(node); end
+
+ # def foo(bar: baz); end
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1417
+ def visit_optional_keyword_parameter_node(node); end
+
+ # def foo(bar = 1); end
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1423
+ def visit_optional_parameter_node(node); end
+
+ # a or b
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1429
+ def visit_or_node(node); end
+
+ # def foo(bar, *baz); end
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1435
+ def visit_parameters_node(node); end
+
+ # ()
+ # ^^
+ #
+ # (1)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1474
+ def visit_parentheses_node(node); end
+
+ # foo => ^(bar)
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1484
+ def visit_pinned_expression_node(node); end
+
+ # foo = 1 and bar => ^foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1492
+ def visit_pinned_variable_node(node); end
+
+ # END {}
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1497
+ def visit_post_execution_node(node); end
+
+ # BEGIN {}
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1507
+ def visit_pre_execution_node(node); end
+
+ # The top-level program node.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1517
+ def visit_program_node(node); end
+
+ # 0..5
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1523
+ def visit_range_node(node); end
+
+ # 1r
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1545
+ def visit_rational_node(node); end
+
+ # redo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1551
+ def visit_redo_node(node); end
+
+ # /foo/
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1557
+ def visit_regular_expression_node(node); end
+
+ # def foo(bar:); end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1581
+ def visit_required_keyword_parameter_node(node); end
+
+ # def foo(bar); end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1587
+ def visit_required_parameter_node(node); end
+
+ # foo rescue bar
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1593
+ def visit_rescue_modifier_node(node); end
+
+ # begin; rescue; end
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1611
+ def visit_rescue_node(node); end
+
+ # def foo(*bar); end
+ # ^^^^
+ #
+ # def foo(*); end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1620
+ def visit_rest_parameter_node(node); end
+
+ # retry
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1626
+ def visit_retry_node(node); end
+
+ # return
+ # ^^^^^^
+ #
+ # return 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1635
+ def visit_return_node(node); end
+
+ # self
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1647
+ def visit_self_node(node); end
+
+ # A shareable constant.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1652
+ def visit_shareable_constant_node(node); end
+
+ # class << self; end
+ # ^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1658
+ def visit_singleton_class_node(node); end
+
+ # __ENCODING__
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1670
+ def visit_source_encoding_node(node); end
+
+ # __FILE__
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1676
+ def visit_source_file_node(node); end
+
+ # __LINE__
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1682
+ def visit_source_line_node(node); end
+
+ # foo(*bar)
+ # ^^^^
+ #
+ # def foo((bar, *baz)); end
+ # ^^^^
+ #
+ # def foo(*); bar(*); end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1694
+ def visit_splat_node(node); end
+
+ # A list of statements.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1707
+ def visit_statements_node(node); end
+
+ # "foo"
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1713
+ def visit_string_node(node); end
+
+ # super(foo)
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1738
+ def visit_super_node(node); end
+
+ # :foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1761
+ def visit_symbol_node(node); end
+
+ # true
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1788
+ def visit_true_node(node); end
+
+ # undef foo
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1794
+ def visit_undef_node(node); end
+
+ # unless foo; bar end
+ # ^^^^^^^^^^^^^^^^^^^
+ #
+ # bar unless foo
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1803
+ def visit_unless_node(node); end
+
+ # until foo; bar end
+ # ^^^^^^^^^^^^^^^^^^
+ #
+ # bar until foo
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1833
+ def visit_until_node(node); end
+
+ # case foo; when bar; end
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1859
+ def visit_when_node(node); end
+
+ # while foo; bar end
+ # ^^^^^^^^^^^^^^^^^^
+ #
+ # bar while foo
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1877
+ def visit_while_node(node); end
+
+ # `foo`
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1903
+ def visit_x_string_node(node); end
+
+ # yield
+ # ^^^^^
+ #
+ # yield 1
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1929
+ def visit_yield_node(node); end
+
+ private
+
+ # Initialize a new compiler with the given option overrides, used to
+ # visit a subtree with the given options.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1943
+ def copy_compiler(forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
+
+ # When *, **, &, or ... are used as an argument in a method call, we
+ # check if they were allowed by the current context. To determine that
+ # we build this lookup table.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1950
+ def find_forwarding(node); end
+
+ # Returns the set of targets for a MultiTargetNode or a MultiWriteNode.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1963
+ def multi_target_elements(node); end
+
+ # Negate the value of a numeric node. This is a special case where you
+ # have a negative sign on one line and then a number on the next line.
+ # In normal Ruby, this will always be a method call. The parser gem,
+ # however, marks this as a numeric literal. We have to massage the tree
+ # here to get it into the correct form.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1975
+ def numeric_negate(message_loc, receiver); end
+
+ # Blocks can have a special set of parameters that automatically expand
+ # when given arrays if they have a single required parameter and no
+ # other parameters.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:1989
+ def procarg0?(parameters); end
+
+ # Constructs a new source range from the given start and end offsets.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2006
+ def srange(location); end
+
+ # Constructs a new source range from the given start and end offsets.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2011
+ def srange_offsets(start_offset, end_offset); end
+
+ # Constructs a new source range by finding a semicolon between the given
+ # start offset and end offset. If the semicolon is not found, it returns
+ # nil. Importantly it does not search past newlines or comments.
+ #
+ # Note that end_offset is allowed to be nil, in which case this will
+ # search until the end of the string.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2021
+ def srange_semicolon(start_offset, end_offset); end
+
+ # When the content of a string node is split across multiple lines, the
+ # parser gem creates individual string nodes for each line the content is part of.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2138
+ def string_nodes_from_interpolation(node, opening); end
+
+ # Create parser string nodes from a single prism node. The parser gem
+ # "glues" strings together when a line continuation is encountered.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2150
+ def string_nodes_from_line_continuations(unescaped, escaped, start_offset, opening); end
+
+ # Transform a location into a token that the parser gem expects.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2029
+ def token(location); end
+
+ # Visit a block node on a call.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2034
+ def visit_block(call, block); end
+
+ # Visit a heredoc that can be either a string or an xstring.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2069
+ def visit_heredoc(node); end
+
+ # Visit a numeric node and account for the optional sign.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2115
+ def visit_numeric(node, value); end
+
+ # Within the given block, track that we're within a pattern.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2127
+ def within_pattern; end
+end
+
+# Raised when the tree is malformed or there is a bug in the compiler.
+#
+# pkg:gem/prism#lib/prism/translation/parser/compiler.rb:11
+class Prism::Translation::Parser::Compiler::CompilationError < ::StandardError; end
+
+# Locations in the parser gem AST are generated using this class. We
+# store a reference to its constant to make it slightly faster to look
+# up.
+#
+# pkg:gem/prism#lib/prism/translation/parser/compiler.rb:2003
+Prism::Translation::Parser::Compiler::Range = Parser::Source::Range
+
+# pkg:gem/prism#lib/prism/translation/parser.rb:30
+Prism::Translation::Parser::Diagnostic = Parser::Diagnostic
+
+# Accepts a list of prism tokens and converts them into the expected
+# format for the parser gem.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:13
+class Prism::Translation::Parser::Lexer
+ # Initialize the lexer with the given source buffer, prism tokens, and
+ # offset cache.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:231
+ def initialize(source_buffer, lexed, offset_cache); end
+
+ # An array of tuples that contain prism tokens and their associated lex
+ # state when they were lexed.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:224
+ def lexed; end
+
+ # A hash that maps offsets in bytes to offsets in characters.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:227
+ def offset_cache; end
+
+ # The Parser::Source::Buffer that the tokens were lexed from.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:220
+ def source_buffer; end
+
+ # Convert the prism tokens into the expected format for the parser gem.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:241
+ def to_a; end
+
+ private
+
+ # Wonky heredoc tab/spaces rules.
+ # https://github.com/ruby/prism/blob/v1.3.0/src/prism.c#L10548-L10558
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:593
+ def calculate_heredoc_whitespace(heredoc_token_index); end
+
+ # Escape a byte value, given the control and meta flags.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:735
+ def escape_build(value, control, meta); end
+
+ # Read an escape out of the string scanner, given the control and meta
+ # flags, and push the unescaped value into the result.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:743
+ def escape_read(result, scanner, control, meta); end
+
+ # Determine if characters preceeded by a backslash should be escaped or not
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:804
+ def interpolation?(quote); end
+
+ # Parse a complex from the string representation.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:564
+ def parse_complex(value); end
+
+ # Parse a float from the string representation.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:557
+ def parse_float(value); end
+
+ # Parse an integer from the string representation.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:550
+ def parse_integer(value); end
+
+ # Parse a rational from the string representation.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:579
+ def parse_rational(value); end
+
+ # Determine if the string is part of a %-style array.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:814
+ def percent_array?(quote); end
+
+ # For %-arrays whitespace, the parser gem only considers whitespace before the newline.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:792
+ def percent_array_leading_whitespace(string); end
+
+ # In a percent array, certain whitespace can be preceeded with a backslash,
+ # causing the following characters to be part of the previous element.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:784
+ def percent_array_unescape(string); end
+
+ # Creates a new parser range, taking prisms byte offsets into account
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:545
+ def range(start_offset, end_offset); end
+
+ # Regexp allow interpolation but are handled differently during unescaping
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:809
+ def regexp?(quote); end
+
+ # Certain strings are merged into a single string token.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:718
+ def simplify_string?(value, quote); end
+
+ # Wonky heredoc tab/spaces rules.
+ # https://github.com/ruby/prism/blob/v1.3.0/src/prism.c#L16528-L16545
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:640
+ def trim_heredoc_whitespace(string, heredoc); end
+
+ # Apply Ruby string escaping rules
+ #
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:675
+ def unescape_string(string, quote); end
+end
+
+# Types of tokens that are allowed to continue a method call with comments in-between.
+# For these, the parser gem doesn't emit a newline token after the last comment.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:211
+Prism::Translation::Parser::Lexer::COMMENT_CONTINUATION_TYPES = T.let(T.unsafe(nil), Set)
+
+# When one of these delimiters is encountered, then the other
+# one is allowed to be escaped as well.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:666
+Prism::Translation::Parser::Lexer::DELIMITER_SYMETRY = T.let(T.unsafe(nil), Hash)
+
+# Escape sequences that have special and should appear unescaped in the resulting string.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:657
+Prism::Translation::Parser::Lexer::ESCAPES = T.let(T.unsafe(nil), Hash)
+
+# These constants represent flags in our lex state. We really, really
+# don't want to be using them and we really, really don't want to be
+# exposing them as part of our public API. Unfortunately, we don't have
+# another way of matching the exact tokens that the parser gem expects
+# without them. We should find another way to do this, but in the
+# meantime we'll hide them from the documentation and mark them as
+# private constants.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:193
+Prism::Translation::Parser::Lexer::EXPR_BEG = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:194
+Prism::Translation::Parser::Lexer::EXPR_LABEL = T.let(T.unsafe(nil), Integer)
+
+# Heredocs are complex and require us to keep track of a bit of info to refer to later
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+class Prism::Translation::Parser::Lexer::HeredocData < ::Struct
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def common_whitespace; end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def common_whitespace=(_); end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def identifier; end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def identifier=(_); end
+
+ class << self
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def [](*_arg0); end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def keyword_init?; end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def members; end
+
+ # pkg:gem/prism#lib/prism/translation/parser/lexer.rb:215
+ def new(*_arg0); end
+ end
+end
+
+# It is used to determine whether `do` is of the token type `kDO` or `kDO_LAMBDA`.
+#
+# NOTE: In edge cases like `-> (foo = -> (bar) {}) do end`, please note that `kDO` is still returned
+# instead of `kDO_LAMBDA`, which is expected: https://github.com/ruby/prism/pull/3046
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:200
+Prism::Translation::Parser::Lexer::LAMBDA_TOKEN_TYPES = T.let(T.unsafe(nil), Set)
+
+# The `PARENTHESIS_LEFT` token in Prism is classified as either `tLPAREN` or `tLPAREN2` in the Parser gem.
+# The following token types are listed as those classified as `tLPAREN`.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:204
+Prism::Translation::Parser::Lexer::LPAREN_CONVERSION_TOKEN_TYPES = T.let(T.unsafe(nil), Set)
+
+# https://github.com/whitequark/parser/blob/v3.3.6.0/lib/parser/lexer-strings.rl#L14
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:671
+Prism::Translation::Parser::Lexer::REGEXP_META_CHARACTERS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:237
+Prism::Translation::Parser::Lexer::Range = Parser::Source::Range
+
+# The direct translating of types between the two lexers.
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:19
+Prism::Translation::Parser::Lexer::TYPES = T.let(T.unsafe(nil), Hash)
+
+# These tokens are always skipped
+#
+# pkg:gem/prism#lib/prism/translation/parser/lexer.rb:15
+Prism::Translation::Parser::Lexer::TYPES_ALWAYS_SKIP = T.let(T.unsafe(nil), Set)
+
+# The parser gem has a list of diagnostics with a hard-coded set of error
+# messages. We create our own diagnostic class in order to set our own
+# error messages.
+#
+# pkg:gem/prism#lib/prism/translation/parser.rb:36
+class Prism::Translation::Parser::PrismDiagnostic < ::Parser::Diagnostic
+ # Initialize a new diagnostic with the given message and location.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:41
+ def initialize(message, level, reason, location); end
+
+ # This is the cached message coming from prism.
+ #
+ # pkg:gem/prism#lib/prism/translation/parser.rb:38
+ def message; end
+end
+
+# pkg:gem/prism#lib/prism/translation/parser.rb:47
+Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass)
+
+# pkg:gem/prism#lib/prism/translation/parser_current.rb:12
+Prism::Translation::ParserCurrent = Prism::Translation::Parser34
+
+# This class provides a compatibility layer between prism and Ripper. It
+# functions by parsing the entire tree first and then walking it and
+# executing each of the Ripper callbacks as it goes. To use this class, you
+# treat `Prism::Translation::Ripper` effectively as you would treat the
+# `Ripper` class.
+#
+# Note that this class will serve the most common use cases, but Ripper's
+# API is extensive and undocumented. It relies on reporting the state of the
+# parser at any given time. We do our best to replicate that here, but
+# because it is a different architecture it is not possible to perfectly
+# replicate the behavior of Ripper.
+#
+# The main known difference is that we may omit dispatching some events in
+# some cases. This impacts the following events:
+#
+# - on_assign_error
+# - on_comma
+# - on_ignored_nl
+# - on_ignored_sp
+# - on_kw
+# - on_label_end
+# - on_lbrace
+# - on_lbracket
+# - on_lparen
+# - on_nl
+# - on_op
+# - on_operator_ambiguous
+# - on_rbrace
+# - on_rbracket
+# - on_rparen
+# - on_semicolon
+# - on_sp
+# - on_symbeg
+# - on_tstring_beg
+# - on_tstring_end
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:42
+class Prism::Translation::Ripper < ::Prism::Compiler
+ # Create a new Translation::Ripper object with the given source.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:482
+ def initialize(source, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end
+
+ # The current column number of the parser.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:479
+ def column; end
+
+ # True if the parser encountered an error during parsing.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:495
+ sig { returns(T::Boolean) }
+ def error?; end
+
+ # The filename of the source being parsed.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:473
+ def filename; end
+
+ # The current line number of the parser.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:476
+ def lineno; end
+
+ # Parse the source and return the result.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:500
+ sig { returns(T.untyped) }
+ def parse; end
+
+ # The source that is being parsed.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:470
+ def source; end
+
+ # alias $foo $bar
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:599
+ def visit_alias_global_variable_node(node); end
+
+ # alias foo bar
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:589
+ def visit_alias_method_node(node); end
+
+ # foo => bar | baz
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:623
+ def visit_alternation_pattern_node(node); end
+
+ # a and b
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:643
+ def visit_and_node(node); end
+
+ # foo(bar)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:834
+ def visit_arguments_node(node); end
+
+ # []
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:653
+ def visit_array_node(node); end
+
+ # foo => [bar]
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:813
+ def visit_array_pattern_node(node); end
+
+ # { a: 1 }
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:841
+ def visit_assoc_node(node); end
+
+ # def foo(**); bar(**); end
+ # ^^
+ #
+ # { **foo }
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:854
+ def visit_assoc_splat_node(node); end
+
+ # $+
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:863
+ def visit_back_reference_read_node(node); end
+
+ # begin end
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:870
+ def visit_begin_node(node); end
+
+ # foo(&bar)
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:934
+ def visit_block_argument_node(node); end
+
+ # foo { |; bar| }
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:940
+ def visit_block_local_variable_node(node); end
+
+ # Visit a BlockNode.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:946
+ def visit_block_node(node); end
+
+ # def foo(&bar); end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:982
+ def visit_block_parameter_node(node); end
+
+ # A block's parameters.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:996
+ def visit_block_parameters_node(node); end
+
+ # break
+ # ^^^^^
+ #
+ # break foo
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1020
+ def visit_break_node(node); end
+
+ # foo.bar &&= baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1251
+ def visit_call_and_write_node(node); end
+
+ # foo
+ # ^^^
+ #
+ # foo.bar
+ # ^^^^^^^
+ #
+ # foo.bar() {}
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1040
+ def visit_call_node(node); end
+
+ # foo.bar += baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1229
+ def visit_call_operator_write_node(node); end
+
+ # foo.bar ||= baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1273
+ def visit_call_or_write_node(node); end
+
+ # foo.bar, = 1
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1295
+ def visit_call_target_node(node); end
+
+ # foo => bar => baz
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1320
+ def visit_capture_pattern_node(node); end
+
+ # case foo; in bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1343
+ def visit_case_match_node(node); end
+
+ # case foo; when bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1330
+ def visit_case_node(node); end
+
+ # class Foo; end
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1356
+ def visit_class_node(node); end
+
+ # @@foo &&= bar
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1409
+ def visit_class_variable_and_write_node(node); end
+
+ # @@foo += bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1395
+ def visit_class_variable_operator_write_node(node); end
+
+ # @@foo ||= bar
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1423
+ def visit_class_variable_or_write_node(node); end
+
+ # @@foo
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1374
+ def visit_class_variable_read_node(node); end
+
+ # @@foo, = bar
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1437
+ def visit_class_variable_target_node(node); end
+
+ # @@foo = 1
+ # ^^^^^^^^^
+ #
+ # @@foo, @@bar = 1
+ # ^^^^^ ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1384
+ def visit_class_variable_write_node(node); end
+
+ # Foo &&= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1479
+ def visit_constant_and_write_node(node); end
+
+ # Foo += bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1465
+ def visit_constant_operator_write_node(node); end
+
+ # Foo ||= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1493
+ def visit_constant_or_write_node(node); end
+
+ # Foo::Bar &&= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1580
+ def visit_constant_path_and_write_node(node); end
+
+ # Foo::Bar
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1514
+ def visit_constant_path_node(node); end
+
+ # Foo::Bar += baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1566
+ def visit_constant_path_operator_write_node(node); end
+
+ # Foo::Bar ||= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1594
+ def visit_constant_path_or_write_node(node); end
+
+ # Foo::Bar, = baz
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1608
+ def visit_constant_path_target_node(node); end
+
+ # Foo::Bar = 1
+ # ^^^^^^^^^^^^
+ #
+ # Foo::Foo, Bar::Bar = 1
+ # ^^^^^^^^ ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1537
+ def visit_constant_path_write_node(node); end
+
+ # Foo
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1444
+ def visit_constant_read_node(node); end
+
+ # Foo, = bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1507
+ def visit_constant_target_node(node); end
+
+ # Foo = 1
+ # ^^^^^^^
+ #
+ # Foo, Bar = 1
+ # ^^^ ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1454
+ def visit_constant_write_node(node); end
+
+ # def foo; end
+ # ^^^^^^^^^^^^
+ #
+ # def self.foo; end
+ # ^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1617
+ def visit_def_node(node); end
+
+ # defined? a
+ # ^^^^^^^^^^
+ #
+ # defined?(a)
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1664
+ def visit_defined_node(node); end
+
+ # if foo then bar else baz end
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1686
+ def visit_else_node(node); end
+
+ # "foo #{bar}"
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1702
+ def visit_embedded_statements_node(node); end
+
+ # "foo #@bar"
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1723
+ def visit_embedded_variable_node(node); end
+
+ # Visit an EnsureNode node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1734
+ def visit_ensure_node(node); end
+
+ # false
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1752
+ def visit_false_node(node); end
+
+ # foo => [*, bar, *]
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1759
+ def visit_find_pattern_node(node); end
+
+ # if foo .. bar; end
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1784
+ def visit_flip_flop_node(node); end
+
+ # 1.0
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1798
+ def visit_float_node(node); end
+
+ # for foo in bar do end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1804
+ def visit_for_node(node); end
+
+ # def foo(...); bar(...); end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1821
+ def visit_forwarding_arguments_node(node); end
+
+ # def foo(...); end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1828
+ def visit_forwarding_parameter_node(node); end
+
+ # super
+ # ^^^^^
+ #
+ # super {}
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1838
+ def visit_forwarding_super_node(node); end
+
+ # $foo &&= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1887
+ def visit_global_variable_and_write_node(node); end
+
+ # $foo += bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1873
+ def visit_global_variable_operator_write_node(node); end
+
+ # $foo ||= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1901
+ def visit_global_variable_or_write_node(node); end
+
+ # $foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1852
+ def visit_global_variable_read_node(node); end
+
+ # $foo, = bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1915
+ def visit_global_variable_target_node(node); end
+
+ # $foo = 1
+ # ^^^^^^^^
+ #
+ # $foo, $bar = 1
+ # ^^^^ ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1862
+ def visit_global_variable_write_node(node); end
+
+ # {}
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1922
+ def visit_hash_node(node); end
+
+ # foo => {}
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1937
+ def visit_hash_pattern_node(node); end
+
+ # if foo then bar end
+ # ^^^^^^^^^^^^^^^^^^^
+ #
+ # bar if foo
+ # ^^^^^^^^^^
+ #
+ # foo ? bar : baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1979
+ def visit_if_node(node); end
+
+ # 1i
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2015
+ def visit_imaginary_node(node); end
+
+ # { foo: }
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2021
+ def visit_implicit_node(node); end
+
+ # foo { |bar,| }
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2026
+ def visit_implicit_rest_node(node); end
+
+ # case foo; in bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2033
+ def visit_in_node(node); end
+
+ # foo[bar] &&= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2068
+ def visit_index_and_write_node(node); end
+
+ # foo[bar] += baz
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2051
+ def visit_index_operator_write_node(node); end
+
+ # foo[bar] ||= baz
+ # ^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2085
+ def visit_index_or_write_node(node); end
+
+ # foo[bar], = 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2102
+ def visit_index_target_node(node); end
+
+ # @foo &&= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2144
+ def visit_instance_variable_and_write_node(node); end
+
+ # @foo += bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2130
+ def visit_instance_variable_operator_write_node(node); end
+
+ # @foo ||= bar
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2158
+ def visit_instance_variable_or_write_node(node); end
+
+ # @foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2112
+ def visit_instance_variable_read_node(node); end
+
+ # @foo, = bar
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2172
+ def visit_instance_variable_target_node(node); end
+
+ # @foo = 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2119
+ def visit_instance_variable_write_node(node); end
+
+ # 1
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2179
+ def visit_integer_node(node); end
+
+ # if /foo #{bar}/ then end
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2185
+ def visit_interpolated_match_last_line_node(node); end
+
+ # /foo #{bar}/
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2204
+ def visit_interpolated_regular_expression_node(node); end
+
+ # "foo #{bar}"
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2223
+ def visit_interpolated_string_node(node); end
+
+ # :"foo #{bar}"
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2251
+ def visit_interpolated_symbol_node(node); end
+
+ # `foo #{bar}`
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2264
+ def visit_interpolated_x_string_node(node); end
+
+ # -> { it }
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2294
+ def visit_it_local_variable_read_node(node); end
+
+ # -> { it }
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2301
+ def visit_it_parameters_node(node); end
+
+ # foo(bar: baz)
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2306
+ def visit_keyword_hash_node(node); end
+
+ # def foo(**bar); end
+ # ^^^^^
+ #
+ # def foo(**); end
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2318
+ def visit_keyword_rest_parameter_node(node); end
+
+ # -> {}
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2332
+ def visit_lambda_node(node); end
+
+ # foo &&= bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2424
+ def visit_local_variable_and_write_node(node); end
+
+ # foo += bar
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2410
+ def visit_local_variable_operator_write_node(node); end
+
+ # foo ||= bar
+ # ^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2438
+ def visit_local_variable_or_write_node(node); end
+
+ # foo
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2392
+ def visit_local_variable_read_node(node); end
+
+ # foo, = bar
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2452
+ def visit_local_variable_target_node(node); end
+
+ # foo = 1
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2399
+ def visit_local_variable_write_node(node); end
+
+ # if /foo/ then end
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2459
+ def visit_match_last_line_node(node); end
+
+ # foo in bar
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2474
+ def visit_match_predicate_node(node); end
+
+ # foo => bar
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2483
+ def visit_match_required_node(node); end
+
+ # /(?foo)/ =~ bar
+ # ^^^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2492
+ def visit_match_write_node(node); end
+
+ # A node that is missing from the syntax tree. This is only used in the
+ # case of a syntax error.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2498
+ def visit_missing_node(node); end
+
+ # module Foo; end
+ # ^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2504
+ def visit_module_node(node); end
+
+ # (foo, bar), bar = qux
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2521
+ def visit_multi_target_node(node); end
+
+ # foo, bar = baz
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2575
+ def visit_multi_write_node(node); end
+
+ # next
+ # ^^^^
+ #
+ # next foo
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2595
+ def visit_next_node(node); end
+
+ # nil
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2609
+ def visit_nil_node(node); end
+
+ # def foo(**nil); end
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2616
+ def visit_no_keywords_parameter_node(node); end
+
+ # -> { _1 + _2 }
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2625
+ def visit_numbered_parameters_node(node); end
+
+ # $1
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2630
+ def visit_numbered_reference_read_node(node); end
+
+ # def foo(bar: baz); end
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2637
+ def visit_optional_keyword_parameter_node(node); end
+
+ # def foo(bar = 1); end
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2647
+ def visit_optional_parameter_node(node); end
+
+ # a or b
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2657
+ def visit_or_node(node); end
+
+ # def foo(bar, *baz); end
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2667
+ def visit_parameters_node(node); end
+
+ # ()
+ # ^^
+ #
+ # (1)
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2694
+ def visit_parentheses_node(node); end
+
+ # foo => ^(bar)
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2708
+ def visit_pinned_expression_node(node); end
+
+ # foo = 1 and bar => ^foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2717
+ def visit_pinned_variable_node(node); end
+
+ # END {}
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2723
+ def visit_post_execution_node(node); end
+
+ # BEGIN {}
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2738
+ def visit_pre_execution_node(node); end
+
+ # The top-level program node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2752
+ def visit_program_node(node); end
+
+ # 0..5
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2763
+ def visit_range_node(node); end
+
+ # 1r
+ # ^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2777
+ def visit_rational_node(node); end
+
+ # redo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2783
+ def visit_redo_node(node); end
+
+ # /foo/
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2790
+ def visit_regular_expression_node(node); end
+
+ # def foo(bar:); end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2812
+ def visit_required_keyword_parameter_node(node); end
+
+ # def foo(bar); end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2819
+ def visit_required_parameter_node(node); end
+
+ # foo rescue bar
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2826
+ def visit_rescue_modifier_node(node); end
+
+ # begin; rescue; end
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2836
+ def visit_rescue_node(node); end
+
+ # def foo(*bar); end
+ # ^^^^
+ #
+ # def foo(*); end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2894
+ def visit_rest_parameter_node(node); end
+
+ # retry
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2906
+ def visit_retry_node(node); end
+
+ # return
+ # ^^^^^^
+ #
+ # return 1
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2916
+ def visit_return_node(node); end
+
+ # self
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2930
+ def visit_self_node(node); end
+
+ # A shareable constant.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2936
+ def visit_shareable_constant_node(node); end
+
+ # class << self; end
+ # ^^^^^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2942
+ def visit_singleton_class_node(node); end
+
+ # __ENCODING__
+ # ^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2952
+ def visit_source_encoding_node(node); end
+
+ # __FILE__
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2959
+ def visit_source_file_node(node); end
+
+ # __LINE__
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2966
+ def visit_source_line_node(node); end
+
+ # foo(*bar)
+ # ^^^^
+ #
+ # def foo((bar, *baz)); end
+ # ^^^^
+ #
+ # def foo(*); bar(*); end
+ # ^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2979
+ def visit_splat_node(node); end
+
+ # A list of statements.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2984
+ def visit_statements_node(node); end
+
+ # "foo"
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3001
+ def visit_string_node(node); end
+
+ # super(foo)
+ # ^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3133
+ def visit_super_node(node); end
+
+ # :foo
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3154
+ def visit_symbol_node(node); end
+
+ # true
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3178
+ def visit_true_node(node); end
+
+ # undef foo
+ # ^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3185
+ def visit_undef_node(node); end
+
+ # unless foo; bar end
+ # ^^^^^^^^^^^^^^^^^^^
+ #
+ # bar unless foo
+ # ^^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3197
+ def visit_unless_node(node); end
+
+ # until foo; bar end
+ # ^^^^^^^^^^^^^^^^^
+ #
+ # bar until foo
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3225
+ def visit_until_node(node); end
+
+ # case foo; when bar; end
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3249
+ def visit_when_node(node); end
+
+ # while foo; bar end
+ # ^^^^^^^^^^^^^^^^^^
+ #
+ # bar while foo
+ # ^^^^^^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3270
+ def visit_while_node(node); end
+
+ # `foo`
+ # ^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3294
+ def visit_x_string_node(node); end
+
+ # yield
+ # ^^^^^
+ #
+ # yield 1
+ # ^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3317
+ def visit_yield_node(node); end
+
+ private
+
+ # :stopdoc:
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3457
+ def _dispatch_0; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3458
+ def _dispatch_1(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3459
+ def _dispatch_2(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3460
+ def _dispatch_3(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3461
+ def _dispatch_4(arg, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3462
+ def _dispatch_5(arg, _, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3463
+ def _dispatch_7(arg, _, _, _, _, _, _); end
+
+ # This method is responsible for updating lineno and column information
+ # to reflect the current node.
+ #
+ # This method could be drastically improved with some caching on the start
+ # of every line, but for now it's good enough.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3447
+ def bounds(location); end
+
+ # Returns true if the given node is a command node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1220
+ def command?(node); end
+
+ # This method is called when the parser found syntax error.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3485
+ def compile_error(msg); end
+
+ # This method is provided by the Ripper C extension. It is called when a
+ # string needs to be dedented because of a tilde heredoc. It is expected
+ # that it will modify the string in place and return the number of bytes
+ # that were removed.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3500
+ def dedent_string(string, width); end
+
+ # Extract the arguments and block Ripper-style, which means if the block
+ # is like `&b` then it's moved to arguments.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1184
+ def get_arguments_and_block(arguments_node, block_node); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_BEGIN(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_CHAR(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_END(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on___end__(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_alias(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_alias_error(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_aref(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_aref_field(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_arg_ambiguous(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_arg_paren(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_args_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_args_add_block(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_args_add_star(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_args_forward; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_args_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_array(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_aryptn(arg, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_assign(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_assign_error(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_assoc_new(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_assoc_splat(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_assoclist_from_args(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_backref(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_backtick(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_bare_assoc_hash(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_begin(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_binary(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_block_var(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_blockarg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_bodystmt(arg, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_brace_block(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_break(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_call(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_case(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_class(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_class_name_error(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_comma(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_command(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_command_call(arg, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_comment(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_const(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_const_path_field(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_const_path_ref(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_const_ref(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_cvar(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_def(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_defined(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_defs(arg, _, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_do_block(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_dot2(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_dot3(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_dyna_symbol(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_else(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_elsif(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_embdoc(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_embdoc_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_embdoc_end(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_embexpr_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_embexpr_end(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_embvar(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_ensure(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_excessed_comma; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_fcall(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_field(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_float(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_fndptn(arg, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_for(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_gvar(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_hash(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_heredoc_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_heredoc_dedent(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_heredoc_end(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_hshptn(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_ident(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_if(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_if_mod(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_ifop(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_ignored_nl(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_ignored_sp(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_imaginary(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_in(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_int(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_ivar(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_kw(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_kwrest_param(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_label(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_label_end(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_lambda(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_lbrace(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_lbracket(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_lparen(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_magic_comment(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_massign(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_method_add_arg(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_method_add_block(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mlhs_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mlhs_add_post(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mlhs_add_star(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mlhs_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mlhs_paren(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_module(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mrhs_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mrhs_add_star(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mrhs_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_mrhs_new_from_args(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_next(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_nl(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_nokw_param(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_op(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_opassign(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_operator_ambiguous(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_param_error(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_params(arg, _, _, _, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_paren(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_parse_error(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_period(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_program(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_qsymbols_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_qsymbols_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_qsymbols_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_qwords_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_qwords_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_qwords_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_rational(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_rbrace(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_rbracket(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_redo; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_regexp_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_regexp_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_regexp_end(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_regexp_literal(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_regexp_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_rescue(arg, _, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_rescue_mod(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_rest_param(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_retry; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_return(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_return0; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_rparen(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_sclass(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_semicolon(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_sp(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_stmts_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_stmts_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_string_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_string_concat(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_string_content; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_string_dvar(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_string_embexpr(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_string_literal(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_super(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_symbeg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_symbol(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_symbol_literal(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_symbols_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_symbols_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_symbols_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_tlambda(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_tlambeg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_top_const_field(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_top_const_ref(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_tstring_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_tstring_content(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_tstring_end(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_unary(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_undef(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_unless(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_unless_mod(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_until(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_until_mod(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_var_alias(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_var_field(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_var_ref(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_vcall(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_void_stmt; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_when(arg, _, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_while(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_while_mod(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_word_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_word_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_words_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_words_beg(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_words_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3493
+ def on_words_sep(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_xstring_add(arg, _); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_xstring_literal(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_xstring_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_yield(arg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_yield0; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3471
+ def on_zsuper; end
+
+ # Lazily initialize the parse result.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3343
+ def result; end
+
+ # Returns true if there is a comma between the two locations.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3352
+ def trailing_comma?(left, right); end
+
+ # Visit one side of an alias global variable node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:608
+ def visit_alias_global_variable_node_value(node); end
+
+ # Visit a list of elements, like the elements of an array or arguments.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:794
+ def visit_arguments(elements); end
+
+ # Visit the clauses of a begin node to form an on_bodystmt call.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:878
+ def visit_begin_node_clauses(location, node, allow_newline); end
+
+ # Visit the body of a structure that can have either a set of statements
+ # or statements wrapped in rescue/else/ensure.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:913
+ def visit_body_node(location, node, allow_newline = T.unsafe(nil)); end
+
+ # Visit the arguments and block of a call node and return the arguments
+ # and block as they should be used.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1198
+ def visit_call_node_arguments(arguments_node, block_node, trailing_comma); end
+
+ # Visit a constant path that is part of a write node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:1546
+ def visit_constant_path_write_node_target(node); end
+
+ # Visit a destructured positional parameter node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2681
+ def visit_destructured_parameter_node(node); end
+
+ # Visit a string that is expressed using a <<~ heredoc.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3052
+ def visit_heredoc_node(parts, base); end
+
+ # Ripper gives back the escaped string content but strips out the common
+ # leading whitespace. Prism gives back the unescaped string content and
+ # a location for the escaped string content. Unfortunately these don't
+ # work well together, so here we need to re-derive the common leading
+ # whitespace.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3027
+ def visit_heredoc_node_whitespace(parts); end
+
+ # Visit a heredoc node that is representing a string.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3098
+ def visit_heredoc_string_node(node); end
+
+ # Visit a heredoc node that is representing an xstring.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3115
+ def visit_heredoc_x_string_node(node); end
+
+ # Visit the targets of a multi-target node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2534
+ def visit_multi_target_node_targets(lefts, rest, rights, skippable); end
+
+ # Visit a node that represents a number. We need to explicitly handle the
+ # unary - operator.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3391
+ def visit_number_node(node); end
+
+ # Visit a pattern within a pattern match. This is used to bypass the
+ # parenthesis node that can be used to wrap patterns.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:633
+ def visit_pattern_node(node); end
+
+ # Visit the list of statements of a statements node. We support nil
+ # statements in the list. This would normally not be allowed by the
+ # structure of the prism parse tree, but we manually add them here so that
+ # we can mirror Ripper's void stmt.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2993
+ def visit_statements_node_body(body); end
+
+ # Visit an individual part of a string-like node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:2283
+ def visit_string_content(part); end
+
+ # Visit the string content of a particular node. This method is used to
+ # split into the various token types.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3364
+ def visit_token(token, allow_keywords = T.unsafe(nil)); end
+
+ # Dispatch a words_sep event that contains the space between the elements
+ # of list literals.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:783
+ def visit_words_sep(opening_loc, previous, current); end
+
+ # Visit a node that represents a write value. This is used to handle the
+ # special case of an implicit array that is generated without brackets.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3409
+ def visit_write_value(node); end
+
+ # Returns true if there is a semicolon between the two locations.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3357
+ def void_stmt?(left, right, allow_newline); end
+
+ # This method is called when weak warning is produced by the parser.
+ # +fmt+ and +args+ is printf style.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3476
+ def warn(fmt, *args); end
+
+ # This method is called when strong warning is produced by the parser.
+ # +fmt+ and +args+ is printf style.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:3481
+ def warning(fmt, *args); end
+
+ class << self
+ # Tokenizes the Ruby program and returns an array of an array,
+ # which is formatted like
+ # [[lineno, column], type, token, state].
+ # The +filename+ argument is mostly ignored.
+ # By default, this method does not handle syntax errors in +src+,
+ # use the +raise_errors+ keyword to raise a SyntaxError for an error in +src+.
+ #
+ # require "ripper"
+ # require "pp"
+ #
+ # pp Ripper.lex("def m(a) nil end")
+ # #=> [[[1, 0], :on_kw, "def", FNAME ],
+ # [[1, 3], :on_sp, " ", FNAME ],
+ # [[1, 4], :on_ident, "m", ENDFN ],
+ # [[1, 5], :on_lparen, "(", BEG|LABEL],
+ # [[1, 6], :on_ident, "a", ARG ],
+ # [[1, 7], :on_rparen, ")", ENDFN ],
+ # [[1, 8], :on_sp, " ", BEG ],
+ # [[1, 9], :on_kw, "nil", END ],
+ # [[1, 12], :on_sp, " ", END ],
+ # [[1, 13], :on_kw, "end", END ]]
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:71
+ def lex(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:463
+ def lex_state_name(state); end
+
+ # Parses the given Ruby program read from +src+.
+ # +src+ must be a String or an IO or a object with a #gets method.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:45
+ def parse(src, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end
+
+ # Parses +src+ and create S-exp tree.
+ # Returns more readable tree rather than Ripper.sexp_raw.
+ # This method is mainly for developer use.
+ # The +filename+ argument is mostly ignored.
+ # By default, this method does not handle syntax errors in +src+,
+ # returning +nil+ in such cases. Use the +raise_errors+ keyword
+ # to raise a SyntaxError for an error in +src+.
+ #
+ # require "ripper"
+ # require "pp"
+ #
+ # pp Ripper.sexp("def m(a) nil end")
+ # #=> [:program,
+ # [[:def,
+ # [:@ident, "m", [1, 4]],
+ # [:paren, [:params, [[:@ident, "a", [1, 6]]], nil, nil, nil, nil, nil, nil]],
+ # [:bodystmt, [[:var_ref, [:@kw, "nil", [1, 9]]]], nil, nil, nil]]]]
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:393
+ sig { params(source: String, filename: String, lineno: Integer, raise_errors: T.untyped).returns(T.untyped) }
+ def sexp(source, filename = "-", lineno = 1, raise_errors: false); end
+
+ # Parses +src+ and create S-exp tree.
+ # This method is mainly for developer use.
+ # The +filename+ argument is mostly ignored.
+ # By default, this method does not handle syntax errors in +src+,
+ # returning +nil+ in such cases. Use the +raise_errors+ keyword
+ # to raise a SyntaxError for an error in +src+.
+ #
+ # require "ripper"
+ # require "pp"
+ #
+ # pp Ripper.sexp_raw("def m(a) nil end")
+ # #=> [:program,
+ # [:stmts_add,
+ # [:stmts_new],
+ # [:def,
+ # [:@ident, "m", [1, 4]],
+ # [:paren, [:params, [[:@ident, "a", [1, 6]]], nil, nil, nil]],
+ # [:bodystmt,
+ # [:stmts_add, [:stmts_new], [:var_ref, [:@kw, "nil", [1, 9]]]],
+ # nil,
+ # nil,
+ # nil]]]]
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:428
+ sig { params(source: String, filename: String, lineno: Integer, raise_errors: T.untyped).returns(T.untyped) }
+ def sexp_raw(source, filename = "-", lineno = 1, raise_errors: false); end
+
+ # Tokenizes the Ruby program and returns an array of strings.
+ # The +filename+ and +lineno+ arguments are mostly ignored, since the
+ # return value is just the tokenized input.
+ # By default, this method does not handle syntax errors in +src+,
+ # use the +raise_errors+ keyword to raise a SyntaxError for an error in +src+.
+ #
+ # p Ripper.tokenize("def m(a) nil end")
+ # # => ["def", " ", "m", "(", "a", ")", " ", "nil", " ", "end"]
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper.rb:90
+ def tokenize(*_arg0, **_arg1, &_arg2); end
+ end
+end
+
+# A list of all of the Ruby binary operators.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:349
+Prism::Translation::Ripper::BINARY_OPERATORS = T.let(T.unsafe(nil), Array)
+
+# This array contains name of all ripper events.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:301
+Prism::Translation::Ripper::EVENTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_ARG = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:460
+Prism::Translation::Ripper::EXPR_ARG_ANY = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_BEG = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:459
+Prism::Translation::Ripper::EXPR_BEG_ANY = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_CLASS = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_CMDARG = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_DOT = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_END = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_ENDARG = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_ENDFN = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:461
+Prism::Translation::Ripper::EXPR_END_ANY = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_FITEM = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_FNAME = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_LABEL = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_LABELED = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:455
+Prism::Translation::Ripper::EXPR_MID = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:457
+Prism::Translation::Ripper::EXPR_NONE = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper.rb:458
+Prism::Translation::Ripper::EXPR_VALUE = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/prism#lib/prism/translation/ripper/filter.rb:6
+class Prism::Translation::Ripper::Filter
+ # :stopdoc:
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:8
+ def initialize(src, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:23
+ def column; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:15
+ def filename; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:19
+ def lineno; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:31
+ def parse(init = T.unsafe(nil)); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:27
+ def state; end
+
+ private
+
+ # pkg:gem/prism#lib/prism/translation/ripper/filter.rb:46
+ def on_default(event, token, data); end
+end
+
+# A list of all of the Ruby keywords.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:304
+Prism::Translation::Ripper::KEYWORDS = T.let(T.unsafe(nil), Array)
+
+# Ripper-internal bitflags.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:449
+Prism::Translation::Ripper::LEX_STATE_NAMES = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:9
+class Prism::Translation::Ripper::Lexer < ::Prism::Translation::Ripper
+ # Pretty much just the same as Prism.lex_compat.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:111
+ def lex(raise_errors: T.unsafe(nil)); end
+
+ # Returns the lex_compat result wrapped in `Elem`. Errors are omitted.
+ # Since ripper is a streaming parser, tokens are expected to be emitted in the order
+ # that the parser encounters them. This is not implemented.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:118
+ def parse(*_arg0, **_arg1, &_arg2); end
+
+ # Similar to parse but ripper sorts the elements by position in the source. Also
+ # includes errors. Since prism does error recovery, in cases of syntax errors
+ # the result may differ greatly compared to ripper.
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:127
+ def scan(*_arg0, **_arg1, &_arg2); end
+end
+
+# pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:50
+class Prism::Translation::Ripper::Lexer::Elem
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:53
+ def initialize(pos, event, tok, state, message = T.unsafe(nil)); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:61
+ def [](index); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def event; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def event=(_arg0); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:78
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def message; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def message=(_arg0); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def pos; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def pos=(_arg0); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:84
+ def pretty_print(q); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def state; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def state=(_arg0); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:101
+ def to_a; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:82
+ def to_s; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def tok; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:51
+ def tok=(_arg0); end
+end
+
+# :stopdoc:
+#
+# pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:11
+class Prism::Translation::Ripper::Lexer::State
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:15
+ def initialize(i); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:36
+ def &(i); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:35
+ def ==(i); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:21
+ def [](index); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:38
+ def allbits?(i); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:39
+ def anybits?(i); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:33
+ def inspect; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:40
+ def nobits?(i); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:34
+ def pretty_print(q); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:32
+ def to_i; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:13
+ def to_int; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:13
+ def to_s; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:37
+ def |(i); end
+
+ class << self
+ # pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:45
+ def cached(i); end
+ end
+end
+
+# Instances are frozen and there are only a handful of them so we cache them here.
+#
+# pkg:gem/prism#lib/prism/translation/ripper/lexer.rb:43
+Prism::Translation::Ripper::Lexer::State::STATES = T.let(T.unsafe(nil), Hash)
+
+# This array contains name of parser events.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:295
+Prism::Translation::Ripper::PARSER_EVENTS = T.let(T.unsafe(nil), Array)
+
+# This contains a table of all of the parser events and their
+# corresponding arity.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:96
+Prism::Translation::Ripper::PARSER_EVENT_TABLE = T.let(T.unsafe(nil), Hash)
+
+# This array contains name of scanner events.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:298
+Prism::Translation::Ripper::SCANNER_EVENTS = T.let(T.unsafe(nil), Array)
+
+# This contains a table of all of the scanner events and their
+# corresponding arity.
+#
+# pkg:gem/prism#lib/prism/translation/ripper.rb:239
+Prism::Translation::Ripper::SCANNER_EVENT_TABLE = T.let(T.unsafe(nil), Hash)
+
+# This class mirrors the ::Ripper::SexpBuilder subclass of ::Ripper that
+# returns the arrays of [type, *children].
+#
+# pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:11
+class Prism::Translation::Ripper::SexpBuilder < ::Prism::Translation::Ripper
+ # :stopdoc:
+ #
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:14
+ def error; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_BEGIN(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_CHAR(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_END(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on___end__(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_alias(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_alias_error(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_aref(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_aref_field(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_arg_ambiguous(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_arg_paren(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_args_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_args_add_block(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_args_add_star(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_args_forward(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_args_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_array(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_aryptn(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_assign(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_assign_error(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_assoc_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_assoc_splat(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_assoclist_from_args(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_backref(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_backtick(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_bare_assoc_hash(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_begin(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_binary(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_block_var(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_blockarg(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_bodystmt(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_brace_block(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_break(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_call(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_case(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_class(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_class_name_error(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_comma(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_command(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_command_call(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_comment(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_const(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_const_path_field(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_const_path_ref(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_const_ref(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_cvar(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_def(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_defined(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_defs(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_do_block(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_dot2(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_dot3(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_dyna_symbol(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_else(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_elsif(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_embdoc(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_embdoc_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_embdoc_end(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_embexpr_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_embexpr_end(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_embvar(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_ensure(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_excessed_comma(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_fcall(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_field(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_float(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_fndptn(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_for(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_gvar(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_hash(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_heredoc_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_heredoc_end(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_hshptn(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_ident(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_if(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_if_mod(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_ifop(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_ignored_nl(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_ignored_sp(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_imaginary(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_in(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_int(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_ivar(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_kw(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_kwrest_param(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_label(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_label_end(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_lambda(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_lbrace(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_lbracket(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_lparen(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_magic_comment(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_massign(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_method_add_arg(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_method_add_block(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mlhs_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mlhs_add_post(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mlhs_add_star(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mlhs_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mlhs_paren(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_module(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mrhs_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mrhs_add_star(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mrhs_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_mrhs_new_from_args(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_next(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_nl(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_nokw_param(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_op(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_opassign(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_operator_ambiguous(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_param_error(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_params(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_paren(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_period(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_program(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_qsymbols_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_qsymbols_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_qsymbols_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_qwords_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_qwords_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_qwords_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_rational(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_rbrace(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_rbracket(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_redo(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_regexp_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_regexp_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_regexp_end(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_regexp_literal(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_regexp_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_rescue(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_rescue_mod(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_rest_param(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_retry(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_return(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_return0(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_rparen(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_sclass(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_semicolon(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_sp(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_stmts_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_stmts_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_string_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_string_concat(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_string_content(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_string_dvar(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_string_embexpr(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_string_literal(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_super(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_symbeg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_symbol(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_symbol_literal(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_symbols_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_symbols_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_symbols_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_tlambda(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_tlambeg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_top_const_field(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_top_const_ref(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_tstring_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_tstring_content(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_tstring_end(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_unary(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_undef(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_unless(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_unless_mod(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_until(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_until_mod(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_var_alias(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_var_field(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_var_ref(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_vcall(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_void_stmt(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_when(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_while(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_while_mod(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_word_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_word_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_words_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_words_beg(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_words_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:55
+ def on_words_sep(tok); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_xstring_add(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_xstring_literal(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_xstring_new(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_yield(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_yield0(*args); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_zsuper(*args); end
+
+ private
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:67
+ def compile_error(mesg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:18
+ def dedent_element(e, width); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:62
+ def on_error(mesg); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:25
+ def on_heredoc_dedent(val, width); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:47
+ def on_parse_error(mesg); end
+end
+
+# This class mirrors the ::Ripper::SexpBuilderPP subclass of ::Ripper that
+# returns the same values as ::Ripper::SexpBuilder except with a couple of
+# niceties that flatten linked lists into arrays.
+#
+# pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:75
+class Prism::Translation::Ripper::SexpBuilderPP < ::Prism::Translation::Ripper::SexpBuilder
+ private
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:93
+ def _dispatch_event_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:97
+ def _dispatch_event_push(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_args_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_args_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:80
+ def on_heredoc_dedent(val, width); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_mlhs_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:110
+ def on_mlhs_add_post(list, post); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:106
+ def on_mlhs_add_star(list, star); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_mlhs_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:102
+ def on_mlhs_paren(list); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_mrhs_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_mrhs_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_qsymbols_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_qsymbols_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_qwords_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_qwords_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_regexp_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_regexp_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_stmts_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_stmts_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_string_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_symbols_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_symbols_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_word_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_word_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_words_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_words_new; end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:118
+ def on_xstring_add(list, item); end
+
+ # pkg:gem/prism#lib/prism/translation/ripper/sexp.rb:116
+ def on_xstring_new; end
+end
+
+# This module is the entry-point for converting a prism syntax tree into the
+# seattlerb/ruby_parser gem's syntax tree.
+#
+# pkg:gem/prism#lib/prism/translation/ruby_parser.rb:20
+class Prism::Translation::RubyParser
+ # Parse the given source and translate it into the seattlerb/ruby_parser
+ # gem's Sexp format.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1917
+ def parse(source, filepath = T.unsafe(nil)); end
+
+ # Parse the given file and translate it into the seattlerb/ruby_parser
+ # gem's Sexp format.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1923
+ def parse_file(filepath); end
+
+ # Parse the give file and translate it into the
+ # seattlerb/ruby_parser gem's Sexp format. This method is
+ # provided for API compatibility to RubyParser and takes an
+ # optional +timeout+ argument.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1931
+ def process(ruby, file = T.unsafe(nil), timeout = T.unsafe(nil)); end
+
+ private
+
+ # Translate the given parse result and filepath into the
+ # seattlerb/ruby_parser gem's Sexp format.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1953
+ def translate(result, filepath); end
+
+ class << self
+ # Parse the given source and translate it into the seattlerb/ruby_parser
+ # gem's Sexp format.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1938
+ def parse(source, filepath = T.unsafe(nil)); end
+
+ # Parse the given file and translate it into the seattlerb/ruby_parser
+ # gem's Sexp format.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1944
+ def parse_file(filepath); end
+ end
+end
+
+# A prism visitor that builds Sexp objects.
+#
+# pkg:gem/prism#lib/prism/translation/ruby_parser.rb:22
+class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler
+ # Initialize a new compiler with the given file name.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:37
+ def initialize(file, in_def: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
+
+ # This is the name of the file that we are compiling. We set it on every
+ # Sexp object that is generated, and also use it to compile `__FILE__`
+ # nodes.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:26
+ def file; end
+
+ # Class variables will change their type based on if they are inside of
+ # a method definition or not, so we need to track that state.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:30
+ def in_def; end
+
+ # Some nodes will change their representation if they are inside of a
+ # pattern, so we need to track that state.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:34
+ def in_pattern; end
+
+ # ```
+ # alias $foo $bar
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:55
+ def visit_alias_global_variable_node(node); end
+
+ # ```
+ # alias foo bar
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:47
+ def visit_alias_method_node(node); end
+
+ # ```
+ # foo => bar | baz
+ # ^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:63
+ def visit_alternation_pattern_node(node); end
+
+ # ```
+ # a and b
+ # ^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:71
+ def visit_and_node(node); end
+
+ # ```
+ # foo(bar)
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:128
+ def visit_arguments_node(node); end
+
+ # ```
+ # []
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:91
+ def visit_array_node(node); end
+
+ # ```
+ # foo => [bar]
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:103
+ def visit_array_pattern_node(node); end
+
+ # ```
+ # { a: 1 }
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:136
+ def visit_assoc_node(node); end
+
+ # ```
+ # def foo(**); bar(**); end
+ # ^^
+ #
+ # { **foo }
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:147
+ def visit_assoc_splat_node(node); end
+
+ # ```
+ # $+
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:159
+ def visit_back_reference_read_node(node); end
+
+ # ```
+ # begin end
+ # ^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:167
+ def visit_begin_node(node); end
+
+ # ```
+ # foo(&bar)
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:202
+ def visit_block_argument_node(node); end
+
+ # ```
+ # foo { |; bar| }
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:212
+ def visit_block_local_variable_node(node); end
+
+ # A block on a keyword or method call.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:217
+ def visit_block_node(node); end
+
+ # ```
+ # def foo(&bar); end
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:225
+ def visit_block_parameter_node(node); end
+
+ # A block's parameters.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:230
+ def visit_block_parameters_node(node); end
+
+ # ```
+ # break
+ # ^^^^^
+ #
+ # break foo
+ # ^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:272
+ def visit_break_node(node); end
+
+ # ```
+ # foo.bar &&= baz
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:346
+ def visit_call_and_write_node(node); end
+
+ # ```
+ # foo
+ # ^^^
+ #
+ # foo.bar
+ # ^^^^^^^
+ #
+ # foo.bar() {}
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:292
+ def visit_call_node(node); end
+
+ # ```
+ # foo.bar += baz
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:334
+ def visit_call_operator_write_node(node); end
+
+ # ```
+ # foo.bar ||= baz
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:358
+ def visit_call_or_write_node(node); end
+
+ # ```
+ # foo.bar, = 1
+ # ^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:383
+ def visit_call_target_node(node); end
+
+ # ```
+ # foo => bar => baz
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:391
+ def visit_capture_pattern_node(node); end
+
+ # ```
+ # case foo; in bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:407
+ def visit_case_match_node(node); end
+
+ # ```
+ # case foo; when bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:399
+ def visit_case_node(node); end
+
+ # ```
+ # class Foo; end
+ # ^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:415
+ def visit_class_node(node); end
+
+ # ```
+ # @@foo &&= bar
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:468
+ def visit_class_variable_and_write_node(node); end
+
+ # ```
+ # @@foo += bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:460
+ def visit_class_variable_operator_write_node(node); end
+
+ # ```
+ # @@foo ||= bar
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:476
+ def visit_class_variable_or_write_node(node); end
+
+ # ```
+ # @@foo
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:441
+ def visit_class_variable_read_node(node); end
+
+ # ```
+ # @@foo, = bar
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:484
+ def visit_class_variable_target_node(node); end
+
+ # ```
+ # @@foo = 1
+ # ^^^^^^^^^
+ #
+ # @@foo, @@bar = 1
+ # ^^^^^ ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:452
+ def visit_class_variable_write_node(node); end
+
+ # ```
+ # Foo &&= bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:525
+ def visit_constant_and_write_node(node); end
+
+ # ```
+ # Foo += bar
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:517
+ def visit_constant_operator_write_node(node); end
+
+ # ```
+ # Foo ||= bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:533
+ def visit_constant_or_write_node(node); end
+
+ # ```
+ # Foo::Bar &&= baz
+ # ^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:580
+ def visit_constant_path_and_write_node(node); end
+
+ # ```
+ # Foo::Bar
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:549
+ def visit_constant_path_node(node); end
+
+ # ```
+ # Foo::Bar += baz
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:572
+ def visit_constant_path_operator_write_node(node); end
+
+ # ```
+ # Foo::Bar ||= baz
+ # ^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:588
+ def visit_constant_path_or_write_node(node); end
+
+ # ```
+ # Foo::Bar, = baz
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:596
+ def visit_constant_path_target_node(node); end
+
+ # ```
+ # Foo::Bar = 1
+ # ^^^^^^^^^^^^
+ #
+ # Foo::Foo, Bar::Bar = 1
+ # ^^^^^^^^ ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:564
+ def visit_constant_path_write_node(node); end
+
+ # ```
+ # Foo
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:498
+ def visit_constant_read_node(node); end
+
+ # ```
+ # Foo, = bar
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:541
+ def visit_constant_target_node(node); end
+
+ # ```
+ # Foo = 1
+ # ^^^^^^^
+ #
+ # Foo, Bar = 1
+ # ^^^ ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:509
+ def visit_constant_write_node(node); end
+
+ # ```
+ # def foo; end
+ # ^^^^^^^^^^^^
+ #
+ # def self.foo; end
+ # ^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:614
+ def visit_def_node(node); end
+
+ # ```
+ # defined? a
+ # ^^^^^^^^^^
+ #
+ # defined?(a)
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:649
+ def visit_defined_node(node); end
+
+ # ```
+ # if foo then bar else baz end
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:657
+ def visit_else_node(node); end
+
+ # ```
+ # "foo #{bar}"
+ # ^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:665
+ def visit_embedded_statements_node(node); end
+
+ # ```
+ # "foo #@bar"
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:675
+ def visit_embedded_variable_node(node); end
+
+ # ```
+ # begin; foo; ensure; bar; end
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:683
+ def visit_ensure_node(node); end
+
+ # ```
+ # false
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:691
+ def visit_false_node(node); end
+
+ # ```
+ # foo => [*, bar, *]
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:699
+ def visit_find_pattern_node(node); end
+
+ # ```
+ # if foo .. bar; end
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:707
+ def visit_flip_flop_node(node); end
+
+ # ```
+ # 1.0
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:719
+ def visit_float_node(node); end
+
+ # ```
+ # for foo in bar do end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:727
+ def visit_for_node(node); end
+
+ # ```
+ # def foo(...); bar(...); end
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:735
+ def visit_forwarding_arguments_node(node); end
+
+ # ```
+ # def foo(...); end
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:743
+ def visit_forwarding_parameter_node(node); end
+
+ # ```
+ # super
+ # ^^^^^
+ #
+ # super {}
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:754
+ def visit_forwarding_super_node(node); end
+
+ # ```
+ # $foo &&= bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:789
+ def visit_global_variable_and_write_node(node); end
+
+ # ```
+ # $foo += bar
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:781
+ def visit_global_variable_operator_write_node(node); end
+
+ # ```
+ # $foo ||= bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:797
+ def visit_global_variable_or_write_node(node); end
+
+ # ```
+ # $foo
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:762
+ def visit_global_variable_read_node(node); end
+
+ # ```
+ # $foo, = bar
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:805
+ def visit_global_variable_target_node(node); end
+
+ # ```
+ # $foo = 1
+ # ^^^^^^^^
+ #
+ # $foo, $bar = 1
+ # ^^^^ ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:773
+ def visit_global_variable_write_node(node); end
+
+ # ```
+ # {}
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:813
+ def visit_hash_node(node); end
+
+ # ```
+ # foo => {}
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:821
+ def visit_hash_pattern_node(node); end
+
+ # ```
+ # if foo then bar end
+ # ^^^^^^^^^^^^^^^^^^^
+ #
+ # bar if foo
+ # ^^^^^^^^^^
+ #
+ # foo ? bar : baz
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:844
+ def visit_if_node(node); end
+
+ # 1i
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:849
+ def visit_imaginary_node(node); end
+
+ # ```
+ # { foo: }
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:857
+ def visit_implicit_node(node); end
+
+ # ```
+ # foo { |bar,| }
+ # ^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:864
+ def visit_implicit_rest_node(node); end
+
+ # ```
+ # case foo; in bar; end
+ # ^^^^^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:871
+ def visit_in_node(node); end
+
+ # ```
+ # foo[bar] &&= baz
+ # ^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:901
+ def visit_index_and_write_node(node); end
+
+ # ```
+ # foo[bar] += baz
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:886
+ def visit_index_operator_write_node(node); end
+
+ # ```
+ # foo[bar] ||= baz
+ # ^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:916
+ def visit_index_or_write_node(node); end
+
+ # ```
+ # foo[bar], = 1
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:931
+ def visit_index_target_node(node); end
+
+ # ```
+ # @foo &&= bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:969
+ def visit_instance_variable_and_write_node(node); end
+
+ # ```
+ # @foo += bar
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:961
+ def visit_instance_variable_operator_write_node(node); end
+
+ # ```
+ # @foo ||= bar
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:977
+ def visit_instance_variable_or_write_node(node); end
+
+ # ```
+ # @foo
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:942
+ def visit_instance_variable_read_node(node); end
+
+ # ```
+ # @foo, = bar
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:985
+ def visit_instance_variable_target_node(node); end
+
+ # ```
+ # @foo = 1
+ # ^^^^^^^^
+ #
+ # @foo, @bar = 1
+ # ^^^^ ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:953
+ def visit_instance_variable_write_node(node); end
+
+ # ```
+ # 1
+ # ^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:993
+ def visit_integer_node(node); end
+
+ # ```
+ # if /foo #{bar}/ then end
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1001
+ def visit_interpolated_match_last_line_node(node); end
+
+ # ```
+ # /foo #{bar}/
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1020
+ def visit_interpolated_regular_expression_node(node); end
+
+ # ```
+ # "foo #{bar}"
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1037
+ def visit_interpolated_string_node(node); end
+
+ # ```
+ # :"foo #{bar}"
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1046
+ def visit_interpolated_symbol_node(node); end
+
+ # ```
+ # `foo #{bar}`
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1055
+ def visit_interpolated_x_string_node(node); end
+
+ # ```
+ # -> { it }
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1138
+ def visit_it_local_variable_read_node(node); end
+
+ # ```
+ # foo(bar: baz)
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1146
+ def visit_keyword_hash_node(node); end
+
+ # ```
+ # def foo(**bar); end
+ # ^^^^^
+ #
+ # def foo(**); end
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1157
+ def visit_keyword_rest_parameter_node(node); end
+
+ # -> {}
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1162
+ def visit_lambda_node(node); end
+
+ # ```
+ # foo &&= bar
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1213
+ def visit_local_variable_and_write_node(node); end
+
+ # ```
+ # foo += bar
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1205
+ def visit_local_variable_operator_write_node(node); end
+
+ # ```
+ # foo ||= bar
+ # ^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1221
+ def visit_local_variable_or_write_node(node); end
+
+ # ```
+ # foo
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1182
+ def visit_local_variable_read_node(node); end
+
+ # ```
+ # foo, = bar
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1229
+ def visit_local_variable_target_node(node); end
+
+ # ```
+ # foo = 1
+ # ^^^^^^^
+ #
+ # foo, bar = 1
+ # ^^^ ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1197
+ def visit_local_variable_write_node(node); end
+
+ # ```
+ # if /foo/ then end
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1237
+ def visit_match_last_line_node(node); end
+
+ # ```
+ # foo in bar
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1245
+ def visit_match_predicate_node(node); end
+
+ # ```
+ # foo => bar
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1253
+ def visit_match_required_node(node); end
+
+ # ```
+ # /(?foo)/ =~ bar
+ # ^^^^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1261
+ def visit_match_write_node(node); end
+
+ # A node that is missing from the syntax tree. This is only used in the
+ # case of a syntax error. The parser gem doesn't have such a concept, so
+ # we invent our own here.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1268
+ def visit_missing_node(node); end
+
+ # ```
+ # module Foo; end
+ # ^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1276
+ def visit_module_node(node); end
+
+ # ```
+ # foo, bar = baz
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1302
+ def visit_multi_target_node(node); end
+
+ # ```
+ # foo, bar = baz
+ # ^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1314
+ def visit_multi_write_node(node); end
+
+ # ```
+ # next
+ # ^^^^
+ #
+ # next foo
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1340
+ def visit_next_node(node); end
+
+ # ```
+ # nil
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1355
+ def visit_nil_node(node); end
+
+ # ```
+ # def foo(**nil); end
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1363
+ def visit_no_keywords_parameter_node(node); end
+
+ # ```
+ # -> { _1 + _2 }
+ # ^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1371
+ def visit_numbered_parameters_node(node); end
+
+ # ```
+ # $1
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1379
+ def visit_numbered_reference_read_node(node); end
+
+ # ```
+ # def foo(bar: baz); end
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1387
+ def visit_optional_keyword_parameter_node(node); end
+
+ # ```
+ # def foo(bar = 1); end
+ # ^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1395
+ def visit_optional_parameter_node(node); end
+
+ # ```
+ # a or b
+ # ^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1403
+ def visit_or_node(node); end
+
+ # ```
+ # def foo(bar, *baz); end
+ # ^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1423
+ def visit_parameters_node(node); end
+
+ # ```
+ # ()
+ # ^^
+ #
+ # (1)
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1465
+ def visit_parentheses_node(node); end
+
+ # ```
+ # foo => ^(bar)
+ # ^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1477
+ def visit_pinned_expression_node(node); end
+
+ # ```
+ # foo = 1 and bar => ^foo
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1485
+ def visit_pinned_variable_node(node); end
+
+ # END {}
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1494
+ def visit_post_execution_node(node); end
+
+ # BEGIN {}
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1499
+ def visit_pre_execution_node(node); end
+
+ # The top-level program node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1504
+ def visit_program_node(node); end
+
+ # ```
+ # 0..5
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1512
+ def visit_range_node(node); end
+
+ # ```
+ # 1r
+ # ^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1536
+ def visit_rational_node(node); end
+
+ # ```
+ # redo
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1544
+ def visit_redo_node(node); end
+
+ # ```
+ # /foo/
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1552
+ def visit_regular_expression_node(node); end
+
+ # ```
+ # def foo(bar:); end
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1560
+ def visit_required_keyword_parameter_node(node); end
+
+ # ```
+ # def foo(bar); end
+ # ^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1568
+ def visit_required_parameter_node(node); end
+
+ # ```
+ # foo rescue bar
+ # ^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1576
+ def visit_rescue_modifier_node(node); end
+
+ # ```
+ # begin; rescue; end
+ # ^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1584
+ def visit_rescue_node(node); end
+
+ # ```
+ # def foo(*bar); end
+ # ^^^^
+ #
+ # def foo(*); end
+ # ^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1606
+ def visit_rest_parameter_node(node); end
+
+ # ```
+ # retry
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1614
+ def visit_retry_node(node); end
+
+ # ```
+ # return
+ # ^^^^^^
+ #
+ # return 1
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1625
+ def visit_return_node(node); end
+
+ # ```
+ # self
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1640
+ def visit_self_node(node); end
+
+ # A shareable constant.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1645
+ def visit_shareable_constant_node(node); end
+
+ # ```
+ # class << self; end
+ # ^^^^^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1653
+ def visit_singleton_class_node(node); end
+
+ # ```
+ # __ENCODING__
+ # ^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1663
+ def visit_source_encoding_node(node); end
+
+ # ```
+ # __FILE__
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1672
+ def visit_source_file_node(node); end
+
+ # ```
+ # __LINE__
+ # ^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1680
+ def visit_source_line_node(node); end
+
+ # ```
+ # foo(*bar)
+ # ^^^^
+ #
+ # def foo((bar, *baz)); end
+ # ^^^^
+ #
+ # def foo(*); bar(*); end
+ # ^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1694
+ def visit_splat_node(node); end
+
+ # A list of statements.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1703
+ def visit_statements_node(node); end
+
+ # ```
+ # "foo"
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1717
+ def visit_string_node(node); end
+
+ # ```
+ # super(foo)
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1732
+ def visit_super_node(node); end
+
+ # ```
+ # :foo
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1748
+ def visit_symbol_node(node); end
+
+ # ```
+ # true
+ # ^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1756
+ def visit_true_node(node); end
+
+ # ```
+ # undef foo
+ # ^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1764
+ def visit_undef_node(node); end
+
+ # ```
+ # unless foo; bar end
+ # ^^^^^^^^^^^^^^^^^^^
+ #
+ # bar unless foo
+ # ^^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1776
+ def visit_unless_node(node); end
+
+ # ```
+ # until foo; bar end
+ # ^^^^^^^^^^^^^^^^^
+ #
+ # bar until foo
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1787
+ def visit_until_node(node); end
+
+ # ```
+ # case foo; when bar; end
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1795
+ def visit_when_node(node); end
+
+ # ```
+ # while foo; bar end
+ # ^^^^^^^^^^^^^^^^^^
+ #
+ # bar while foo
+ # ^^^^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1806
+ def visit_while_node(node); end
+
+ # ```
+ # `foo`
+ # ^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1814
+ def visit_x_string_node(node); end
+
+ # ```
+ # yield
+ # ^^^^^
+ #
+ # yield 1
+ # ^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1832
+ def visit_yield_node(node); end
+
+ private
+
+ # Attach prism comments to the given sexp.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1839
+ def attach_comments(sexp, node); end
+
+ # If a class variable is written within a method definition, it has a
+ # different type than everywhere else.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:490
+ def class_variable_write_type; end
+
+ # Create a new compiler with the given options.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1850
+ def copy_compiler(in_def: T.unsafe(nil), in_pattern: T.unsafe(nil)); end
+
+ # Call nodes with operators following them will either be op_asgn or
+ # op_asgn2 nodes. That is determined by their call operator and their
+ # right-hand side.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:369
+ def op_asgn?(node); end
+
+ # Call nodes with operators following them can use &. as an operator,
+ # which changes their type by prefixing "safe_".
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:375
+ def op_asgn_type(node, type); end
+
+ # Create a new Sexp object from the given prism node and arguments.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1855
+ def s(node, *arguments); end
+
+ # Visit a block node, which will modify the AST by wrapping the given
+ # visited node in an iter node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1865
+ def visit_block(node, sexp, block); end
+
+ # ```
+ # def foo((bar, baz)); end
+ # ^^^^^^^^^^
+ # ```
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1440
+ def visit_destructured_parameter(node); end
+
+ # Visit the interpolated content of the string-like node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1062
+ def visit_interpolated_parts(parts); end
+
+ # Pattern constants get wrapped in another layer of :const.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1886
+ def visit_pattern_constant(node); end
+
+ # If the bounds of a range node are empty parentheses, then they do not
+ # get replaced by their usual s(:nil), but instead are s(:begin).
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1524
+ def visit_range_bounds_node(node); end
+
+ # Visit the value of a write, which will be on the right-hand side of
+ # a write operator. Because implicit arrays can have splats, those could
+ # potentially be wrapped in an svalue node.
+ #
+ # pkg:gem/prism#lib/prism/translation/ruby_parser.rb:1900
+ def visit_write_value(node); end
+end
+
+# Represents the use of the literal `true` keyword.
+#
+# true
+# ^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:18630
+class Prism::TrueNode < ::Prism::Node
+ # Initialize a new TrueNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18632
+ sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void }
+ def initialize(source, node_id, location, flags); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18695
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18640
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18645
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18661
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18656
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> TrueNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18666
+ sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::TrueNode) }
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18671
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18674
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18650
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18679
+ sig { override.returns(String) }
+ def inspect; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18684
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18689
+ def type; end
+ end
+end
+
+# Represents the use of the `undef` keyword.
+#
+# undef :foo, :bar, :baz
+# ^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:18704
+class Prism::UndefNode < ::Prism::Node
+ # Initialize a new UndefNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18706
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ names: T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)],
+ keyword_loc: Prism::Location
+ ).void
+ end
+ def initialize(source, node_id, location, flags, names, keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18793
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18716
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18721
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18738
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18733
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?names: Array[SymbolNode | InterpolatedSymbolNode], ?keyword_loc: Location) -> UndefNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18743
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ names: T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)],
+ keyword_loc: Prism::Location
+ ).returns(Prism::UndefNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, names: self.names, keyword_loc: self.keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18748
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, names: Array[SymbolNode | InterpolatedSymbolNode], keyword_loc: Location }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18751
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18726
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18777
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18772
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18759
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # attr_reader names: Array[SymbolNode | InterpolatedSymbolNode]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18756
+ sig { returns(T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)]) }
+ def names; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18767
+ def save_keyword_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18782
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18787
+ def type; end
+ end
+end
+
+# Represents the use of the `unless` keyword, either in the block form or the modifier form.
+#
+# bar unless foo
+# ^^^^^^^^^^^^^^
+#
+# unless foo then bar end
+# ^^^^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:18808
+class Prism::UnlessNode < ::Prism::Node
+ # Initialize a new UnlessNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18810
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ predicate: Prism::Node,
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ else_clause: T.nilable(Prism::ElseNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, predicate, then_keyword_loc, statements, else_clause, end_keyword_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18986
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18824
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18829
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18852
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18843
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # Returns the else clause of the unless node. This method is deprecated in
+ # favor of #else_clause.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:506
+ def consequent; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?else_clause: ElseNode?, ?end_keyword_loc: Location?) -> UnlessNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18857
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ predicate: Prism::Node,
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode),
+ else_clause: T.nilable(Prism::ElseNode),
+ end_keyword_loc: T.nilable(Prism::Location)
+ ).returns(Prism::UnlessNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, predicate: self.predicate, then_keyword_loc: self.then_keyword_loc, statements: self.statements, else_clause: self.else_clause, end_keyword_loc: self.end_keyword_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18862
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, else_clause: ElseNode?, end_keyword_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18865
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18834
+ def each_child_node; end
+
+ # The else clause of the unless expression, if present.
+ #
+ # unless cond then bar else baz end
+ # ^^^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18930
+ sig { returns(T.nilable(Prism::ElseNode)) }
+ def else_clause; end
+
+ # def end_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18965
+ sig { returns(T.nilable(String)) }
+ def end_keyword; end
+
+ # The location of the `end` keyword, if present.
+ #
+ # unless cond then bar end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18936
+ sig { returns(T.nilable(Prism::Location)) }
+ def end_keyword_loc; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18970
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18955
+ sig { returns(String) }
+ def keyword; end
+
+ # The location of the `unless` keyword.
+ #
+ # unless cond then bar end
+ # ^^^^^^
+ #
+ # bar unless cond
+ # ^^^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18876
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:98
+ def newline_flag!(lines); end
+
+ # The condition to be evaluated for the unless expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression).
+ #
+ # unless cond then bar end
+ # ^^^^
+ #
+ # bar unless cond
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18895
+ sig { returns(Prism::Node) }
+ def predicate; end
+
+ # Save the end_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18950
+ def save_end_keyword_loc(repository); end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18884
+ def save_keyword_loc(repository); end
+
+ # Save the then_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18915
+ def save_then_keyword_loc(repository); end
+
+ # The body of statements that will executed if the unless condition is
+ # falsey. Will be `nil` if no body is provided.
+ #
+ # unless cond then bar end
+ # ^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18924
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # def then_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18960
+ sig { returns(T.nilable(String)) }
+ def then_keyword; end
+
+ # The location of the `then` keyword, if present.
+ #
+ # unless cond then bar end
+ # ^^^^
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18901
+ sig { returns(T.nilable(Prism::Location)) }
+ def then_keyword_loc; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18975
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:18980
+ def type; end
+ end
+end
+
+# Represents the use of the `until` keyword, either in the block form or the modifier form.
+#
+# bar until foo
+# ^^^^^^^^^^^^^
+#
+# until foo do bar end
+# ^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:19004
+class Prism::UntilNode < ::Prism::Node
+ # Initialize a new UntilNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19006
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, do_keyword_loc, closing_loc, predicate, statements); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19156
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19019
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def begin_modifier?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19063
+ sig { returns(T::Boolean) }
+ def begin_modifier?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19024
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19135
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19100
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19045
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19037
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?do_keyword_loc: Location?, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?) -> UntilNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19050
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode)
+ ).returns(Prism::UntilNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, do_keyword_loc: self.do_keyword_loc, closing_loc: self.closing_loc, predicate: self.predicate, statements: self.statements); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19055
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, do_keyword_loc: Location?, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19058
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def do_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19130
+ sig { returns(T.nilable(String)) }
+ def do_keyword; end
+
+ # attr_reader do_keyword_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19081
+ sig { returns(T.nilable(Prism::Location)) }
+ def do_keyword_loc; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19029
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19140
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19125
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19068
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:104
+ def newline_flag!(lines); end
+
+ # attr_reader predicate: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19119
+ sig { returns(Prism::Node) }
+ def predicate; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19114
+ def save_closing_loc(repository); end
+
+ # Save the do_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19095
+ def save_do_keyword_loc(repository); end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19076
+ def save_keyword_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19122
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19145
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19150
+ def type; end
+ end
+end
+
+# The version constant is set by reading the result of calling pm_version.
+Prism::VERSION = T.let(T.unsafe(nil), String)
+
+# A visitor is a class that provides a default implementation for every accept
+# method defined on the nodes. This means it can walk a tree without the
+# caller needing to define any special handling. This allows you to handle a
+# subset of the tree, while still walking the whole tree.
+#
+# For example, to find all of the method calls that call the `foo` method, you
+# could write:
+#
+# class FooCalls < Prism::Visitor
+# def visit_call_node(node)
+# if node.name == :foo
+# # Do something with the node
+# end
+#
+# # Call super so that the visitor continues walking the tree
+# super
+# end
+# end
+#
+# pkg:gem/prism#lib/prism/visitor.rb:57
+class Prism::Visitor < ::Prism::BasicVisitor
+ # Visit a AliasGlobalVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:59
+ sig { params(node: Prism::AliasGlobalVariableNode).void }
+ def visit_alias_global_variable_node(node); end
+
+ # Visit a AliasMethodNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:64
+ sig { params(node: Prism::AliasMethodNode).void }
+ def visit_alias_method_node(node); end
+
+ # Visit a AlternationPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:69
+ sig { params(node: Prism::AlternationPatternNode).void }
+ def visit_alternation_pattern_node(node); end
+
+ # Visit a AndNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:74
+ sig { params(node: Prism::AndNode).void }
+ def visit_and_node(node); end
+
+ # Visit a ArgumentsNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:79
+ sig { params(node: Prism::ArgumentsNode).void }
+ def visit_arguments_node(node); end
+
+ # Visit a ArrayNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:84
+ sig { params(node: Prism::ArrayNode).void }
+ def visit_array_node(node); end
+
+ # Visit a ArrayPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:89
+ sig { params(node: Prism::ArrayPatternNode).void }
+ def visit_array_pattern_node(node); end
+
+ # Visit a AssocNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:94
+ sig { params(node: Prism::AssocNode).void }
+ def visit_assoc_node(node); end
+
+ # Visit a AssocSplatNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:99
+ sig { params(node: Prism::AssocSplatNode).void }
+ def visit_assoc_splat_node(node); end
+
+ # Visit a BackReferenceReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:104
+ sig { params(node: Prism::BackReferenceReadNode).void }
+ def visit_back_reference_read_node(node); end
+
+ # Visit a BeginNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:109
+ sig { params(node: Prism::BeginNode).void }
+ def visit_begin_node(node); end
+
+ # Visit a BlockArgumentNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:114
+ sig { params(node: Prism::BlockArgumentNode).void }
+ def visit_block_argument_node(node); end
+
+ # Visit a BlockLocalVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:119
+ sig { params(node: Prism::BlockLocalVariableNode).void }
+ def visit_block_local_variable_node(node); end
+
+ # Visit a BlockNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:124
+ sig { params(node: Prism::BlockNode).void }
+ def visit_block_node(node); end
+
+ # Visit a BlockParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:129
+ sig { params(node: Prism::BlockParameterNode).void }
+ def visit_block_parameter_node(node); end
+
+ # Visit a BlockParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:134
+ sig { params(node: Prism::BlockParametersNode).void }
+ def visit_block_parameters_node(node); end
+
+ # Visit a BreakNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:139
+ sig { params(node: Prism::BreakNode).void }
+ def visit_break_node(node); end
+
+ # Visit a CallAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:144
+ sig { params(node: Prism::CallAndWriteNode).void }
+ def visit_call_and_write_node(node); end
+
+ # Visit a CallNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:149
+ sig { params(node: Prism::CallNode).void }
+ def visit_call_node(node); end
+
+ # Visit a CallOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:154
+ sig { params(node: Prism::CallOperatorWriteNode).void }
+ def visit_call_operator_write_node(node); end
+
+ # Visit a CallOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:159
+ sig { params(node: Prism::CallOrWriteNode).void }
+ def visit_call_or_write_node(node); end
+
+ # Visit a CallTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:164
+ sig { params(node: Prism::CallTargetNode).void }
+ def visit_call_target_node(node); end
+
+ # Visit a CapturePatternNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:169
+ sig { params(node: Prism::CapturePatternNode).void }
+ def visit_capture_pattern_node(node); end
+
+ # Visit a CaseMatchNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:174
+ sig { params(node: Prism::CaseMatchNode).void }
+ def visit_case_match_node(node); end
+
+ # Visit a CaseNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:179
+ sig { params(node: Prism::CaseNode).void }
+ def visit_case_node(node); end
+
+ # Visit a ClassNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:184
+ sig { params(node: Prism::ClassNode).void }
+ def visit_class_node(node); end
+
+ # Visit a ClassVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:189
+ sig { params(node: Prism::ClassVariableAndWriteNode).void }
+ def visit_class_variable_and_write_node(node); end
+
+ # Visit a ClassVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:194
+ sig { params(node: Prism::ClassVariableOperatorWriteNode).void }
+ def visit_class_variable_operator_write_node(node); end
+
+ # Visit a ClassVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:199
+ sig { params(node: Prism::ClassVariableOrWriteNode).void }
+ def visit_class_variable_or_write_node(node); end
+
+ # Visit a ClassVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:204
+ sig { params(node: Prism::ClassVariableReadNode).void }
+ def visit_class_variable_read_node(node); end
+
+ # Visit a ClassVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:209
+ sig { params(node: Prism::ClassVariableTargetNode).void }
+ def visit_class_variable_target_node(node); end
+
+ # Visit a ClassVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:214
+ sig { params(node: Prism::ClassVariableWriteNode).void }
+ def visit_class_variable_write_node(node); end
+
+ # Visit a ConstantAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:219
+ sig { params(node: Prism::ConstantAndWriteNode).void }
+ def visit_constant_and_write_node(node); end
+
+ # Visit a ConstantOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:224
+ sig { params(node: Prism::ConstantOperatorWriteNode).void }
+ def visit_constant_operator_write_node(node); end
+
+ # Visit a ConstantOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:229
+ sig { params(node: Prism::ConstantOrWriteNode).void }
+ def visit_constant_or_write_node(node); end
+
+ # Visit a ConstantPathAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:234
+ sig { params(node: Prism::ConstantPathAndWriteNode).void }
+ def visit_constant_path_and_write_node(node); end
+
+ # Visit a ConstantPathNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:239
+ sig { params(node: Prism::ConstantPathNode).void }
+ def visit_constant_path_node(node); end
+
+ # Visit a ConstantPathOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:244
+ sig { params(node: Prism::ConstantPathOperatorWriteNode).void }
+ def visit_constant_path_operator_write_node(node); end
+
+ # Visit a ConstantPathOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:249
+ sig { params(node: Prism::ConstantPathOrWriteNode).void }
+ def visit_constant_path_or_write_node(node); end
+
+ # Visit a ConstantPathTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:254
+ sig { params(node: Prism::ConstantPathTargetNode).void }
+ def visit_constant_path_target_node(node); end
+
+ # Visit a ConstantPathWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:259
+ sig { params(node: Prism::ConstantPathWriteNode).void }
+ def visit_constant_path_write_node(node); end
+
+ # Visit a ConstantReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:264
+ sig { params(node: Prism::ConstantReadNode).void }
+ def visit_constant_read_node(node); end
+
+ # Visit a ConstantTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:269
+ sig { params(node: Prism::ConstantTargetNode).void }
+ def visit_constant_target_node(node); end
+
+ # Visit a ConstantWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:274
+ sig { params(node: Prism::ConstantWriteNode).void }
+ def visit_constant_write_node(node); end
+
+ # Visit a DefNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:279
+ sig { params(node: Prism::DefNode).void }
+ def visit_def_node(node); end
+
+ # Visit a DefinedNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:284
+ sig { params(node: Prism::DefinedNode).void }
+ def visit_defined_node(node); end
+
+ # Visit a ElseNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:289
+ sig { params(node: Prism::ElseNode).void }
+ def visit_else_node(node); end
+
+ # Visit a EmbeddedStatementsNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:294
+ sig { params(node: Prism::EmbeddedStatementsNode).void }
+ def visit_embedded_statements_node(node); end
+
+ # Visit a EmbeddedVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:299
+ sig { params(node: Prism::EmbeddedVariableNode).void }
+ def visit_embedded_variable_node(node); end
+
+ # Visit a EnsureNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:304
+ sig { params(node: Prism::EnsureNode).void }
+ def visit_ensure_node(node); end
+
+ # Visit a FalseNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:309
+ sig { params(node: Prism::FalseNode).void }
+ def visit_false_node(node); end
+
+ # Visit a FindPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:314
+ sig { params(node: Prism::FindPatternNode).void }
+ def visit_find_pattern_node(node); end
+
+ # Visit a FlipFlopNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:319
+ sig { params(node: Prism::FlipFlopNode).void }
+ def visit_flip_flop_node(node); end
+
+ # Visit a FloatNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:324
+ sig { params(node: Prism::FloatNode).void }
+ def visit_float_node(node); end
+
+ # Visit a ForNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:329
+ sig { params(node: Prism::ForNode).void }
+ def visit_for_node(node); end
+
+ # Visit a ForwardingArgumentsNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:334
+ sig { params(node: Prism::ForwardingArgumentsNode).void }
+ def visit_forwarding_arguments_node(node); end
+
+ # Visit a ForwardingParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:339
+ sig { params(node: Prism::ForwardingParameterNode).void }
+ def visit_forwarding_parameter_node(node); end
+
+ # Visit a ForwardingSuperNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:344
+ sig { params(node: Prism::ForwardingSuperNode).void }
+ def visit_forwarding_super_node(node); end
+
+ # Visit a GlobalVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:349
+ sig { params(node: Prism::GlobalVariableAndWriteNode).void }
+ def visit_global_variable_and_write_node(node); end
+
+ # Visit a GlobalVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:354
+ sig { params(node: Prism::GlobalVariableOperatorWriteNode).void }
+ def visit_global_variable_operator_write_node(node); end
+
+ # Visit a GlobalVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:359
+ sig { params(node: Prism::GlobalVariableOrWriteNode).void }
+ def visit_global_variable_or_write_node(node); end
+
+ # Visit a GlobalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:364
+ sig { params(node: Prism::GlobalVariableReadNode).void }
+ def visit_global_variable_read_node(node); end
+
+ # Visit a GlobalVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:369
+ sig { params(node: Prism::GlobalVariableTargetNode).void }
+ def visit_global_variable_target_node(node); end
+
+ # Visit a GlobalVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:374
+ sig { params(node: Prism::GlobalVariableWriteNode).void }
+ def visit_global_variable_write_node(node); end
+
+ # Visit a HashNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:379
+ sig { params(node: Prism::HashNode).void }
+ def visit_hash_node(node); end
+
+ # Visit a HashPatternNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:384
+ sig { params(node: Prism::HashPatternNode).void }
+ def visit_hash_pattern_node(node); end
+
+ # Visit a IfNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:389
+ sig { params(node: Prism::IfNode).void }
+ def visit_if_node(node); end
+
+ # Visit a ImaginaryNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:394
+ sig { params(node: Prism::ImaginaryNode).void }
+ def visit_imaginary_node(node); end
+
+ # Visit a ImplicitNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:399
+ sig { params(node: Prism::ImplicitNode).void }
+ def visit_implicit_node(node); end
+
+ # Visit a ImplicitRestNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:404
+ sig { params(node: Prism::ImplicitRestNode).void }
+ def visit_implicit_rest_node(node); end
+
+ # Visit a InNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:409
+ sig { params(node: Prism::InNode).void }
+ def visit_in_node(node); end
+
+ # Visit a IndexAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:414
+ sig { params(node: Prism::IndexAndWriteNode).void }
+ def visit_index_and_write_node(node); end
+
+ # Visit a IndexOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:419
+ sig { params(node: Prism::IndexOperatorWriteNode).void }
+ def visit_index_operator_write_node(node); end
+
+ # Visit a IndexOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:424
+ sig { params(node: Prism::IndexOrWriteNode).void }
+ def visit_index_or_write_node(node); end
+
+ # Visit a IndexTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:429
+ sig { params(node: Prism::IndexTargetNode).void }
+ def visit_index_target_node(node); end
+
+ # Visit a InstanceVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:434
+ sig { params(node: Prism::InstanceVariableAndWriteNode).void }
+ def visit_instance_variable_and_write_node(node); end
+
+ # Visit a InstanceVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:439
+ sig { params(node: Prism::InstanceVariableOperatorWriteNode).void }
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Visit a InstanceVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:444
+ sig { params(node: Prism::InstanceVariableOrWriteNode).void }
+ def visit_instance_variable_or_write_node(node); end
+
+ # Visit a InstanceVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:449
+ sig { params(node: Prism::InstanceVariableReadNode).void }
+ def visit_instance_variable_read_node(node); end
+
+ # Visit a InstanceVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:454
+ sig { params(node: Prism::InstanceVariableTargetNode).void }
+ def visit_instance_variable_target_node(node); end
+
+ # Visit a InstanceVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:459
+ sig { params(node: Prism::InstanceVariableWriteNode).void }
+ def visit_instance_variable_write_node(node); end
+
+ # Visit a IntegerNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:464
+ sig { params(node: Prism::IntegerNode).void }
+ def visit_integer_node(node); end
+
+ # Visit a InterpolatedMatchLastLineNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:469
+ sig { params(node: Prism::InterpolatedMatchLastLineNode).void }
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Visit a InterpolatedRegularExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:474
+ sig { params(node: Prism::InterpolatedRegularExpressionNode).void }
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Visit a InterpolatedStringNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:479
+ sig { params(node: Prism::InterpolatedStringNode).void }
+ def visit_interpolated_string_node(node); end
+
+ # Visit a InterpolatedSymbolNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:484
+ sig { params(node: Prism::InterpolatedSymbolNode).void }
+ def visit_interpolated_symbol_node(node); end
+
+ # Visit a InterpolatedXStringNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:489
+ sig { params(node: Prism::InterpolatedXStringNode).void }
+ def visit_interpolated_x_string_node(node); end
+
+ # Visit a ItLocalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:494
+ sig { params(node: Prism::ItLocalVariableReadNode).void }
+ def visit_it_local_variable_read_node(node); end
+
+ # Visit a ItParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:499
+ sig { params(node: Prism::ItParametersNode).void }
+ def visit_it_parameters_node(node); end
+
+ # Visit a KeywordHashNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:504
+ sig { params(node: Prism::KeywordHashNode).void }
+ def visit_keyword_hash_node(node); end
+
+ # Visit a KeywordRestParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:509
+ sig { params(node: Prism::KeywordRestParameterNode).void }
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Visit a LambdaNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:514
+ sig { params(node: Prism::LambdaNode).void }
+ def visit_lambda_node(node); end
+
+ # Visit a LocalVariableAndWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:519
+ sig { params(node: Prism::LocalVariableAndWriteNode).void }
+ def visit_local_variable_and_write_node(node); end
+
+ # Visit a LocalVariableOperatorWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:524
+ sig { params(node: Prism::LocalVariableOperatorWriteNode).void }
+ def visit_local_variable_operator_write_node(node); end
+
+ # Visit a LocalVariableOrWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:529
+ sig { params(node: Prism::LocalVariableOrWriteNode).void }
+ def visit_local_variable_or_write_node(node); end
+
+ # Visit a LocalVariableReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:534
+ sig { params(node: Prism::LocalVariableReadNode).void }
+ def visit_local_variable_read_node(node); end
+
+ # Visit a LocalVariableTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:539
+ sig { params(node: Prism::LocalVariableTargetNode).void }
+ def visit_local_variable_target_node(node); end
+
+ # Visit a LocalVariableWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:544
+ sig { params(node: Prism::LocalVariableWriteNode).void }
+ def visit_local_variable_write_node(node); end
+
+ # Visit a MatchLastLineNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:549
+ sig { params(node: Prism::MatchLastLineNode).void }
+ def visit_match_last_line_node(node); end
+
+ # Visit a MatchPredicateNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:554
+ sig { params(node: Prism::MatchPredicateNode).void }
+ def visit_match_predicate_node(node); end
+
+ # Visit a MatchRequiredNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:559
+ sig { params(node: Prism::MatchRequiredNode).void }
+ def visit_match_required_node(node); end
+
+ # Visit a MatchWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:564
+ sig { params(node: Prism::MatchWriteNode).void }
+ def visit_match_write_node(node); end
+
+ # Visit a MissingNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:569
+ sig { params(node: Prism::MissingNode).void }
+ def visit_missing_node(node); end
+
+ # Visit a ModuleNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:574
+ sig { params(node: Prism::ModuleNode).void }
+ def visit_module_node(node); end
+
+ # Visit a MultiTargetNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:579
+ sig { params(node: Prism::MultiTargetNode).void }
+ def visit_multi_target_node(node); end
+
+ # Visit a MultiWriteNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:584
+ sig { params(node: Prism::MultiWriteNode).void }
+ def visit_multi_write_node(node); end
+
+ # Visit a NextNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:589
+ sig { params(node: Prism::NextNode).void }
+ def visit_next_node(node); end
+
+ # Visit a NilNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:594
+ sig { params(node: Prism::NilNode).void }
+ def visit_nil_node(node); end
+
+ # Visit a NoKeywordsParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:599
+ sig { params(node: Prism::NoKeywordsParameterNode).void }
+ def visit_no_keywords_parameter_node(node); end
+
+ # Visit a NumberedParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:604
+ sig { params(node: Prism::NumberedParametersNode).void }
+ def visit_numbered_parameters_node(node); end
+
+ # Visit a NumberedReferenceReadNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:609
+ sig { params(node: Prism::NumberedReferenceReadNode).void }
+ def visit_numbered_reference_read_node(node); end
+
+ # Visit a OptionalKeywordParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:614
+ sig { params(node: Prism::OptionalKeywordParameterNode).void }
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Visit a OptionalParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:619
+ sig { params(node: Prism::OptionalParameterNode).void }
+ def visit_optional_parameter_node(node); end
+
+ # Visit a OrNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:624
+ sig { params(node: Prism::OrNode).void }
+ def visit_or_node(node); end
+
+ # Visit a ParametersNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:629
+ sig { params(node: Prism::ParametersNode).void }
+ def visit_parameters_node(node); end
+
+ # Visit a ParenthesesNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:634
+ sig { params(node: Prism::ParenthesesNode).void }
+ def visit_parentheses_node(node); end
+
+ # Visit a PinnedExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:639
+ sig { params(node: Prism::PinnedExpressionNode).void }
+ def visit_pinned_expression_node(node); end
+
+ # Visit a PinnedVariableNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:644
+ sig { params(node: Prism::PinnedVariableNode).void }
+ def visit_pinned_variable_node(node); end
+
+ # Visit a PostExecutionNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:649
+ sig { params(node: Prism::PostExecutionNode).void }
+ def visit_post_execution_node(node); end
+
+ # Visit a PreExecutionNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:654
+ sig { params(node: Prism::PreExecutionNode).void }
+ def visit_pre_execution_node(node); end
+
+ # Visit a ProgramNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:659
+ sig { params(node: Prism::ProgramNode).void }
+ def visit_program_node(node); end
+
+ # Visit a RangeNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:664
+ sig { params(node: Prism::RangeNode).void }
+ def visit_range_node(node); end
+
+ # Visit a RationalNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:669
+ sig { params(node: Prism::RationalNode).void }
+ def visit_rational_node(node); end
+
+ # Visit a RedoNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:674
+ sig { params(node: Prism::RedoNode).void }
+ def visit_redo_node(node); end
+
+ # Visit a RegularExpressionNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:679
+ sig { params(node: Prism::RegularExpressionNode).void }
+ def visit_regular_expression_node(node); end
+
+ # Visit a RequiredKeywordParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:684
+ sig { params(node: Prism::RequiredKeywordParameterNode).void }
+ def visit_required_keyword_parameter_node(node); end
+
+ # Visit a RequiredParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:689
+ sig { params(node: Prism::RequiredParameterNode).void }
+ def visit_required_parameter_node(node); end
+
+ # Visit a RescueModifierNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:694
+ sig { params(node: Prism::RescueModifierNode).void }
+ def visit_rescue_modifier_node(node); end
+
+ # Visit a RescueNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:699
+ sig { params(node: Prism::RescueNode).void }
+ def visit_rescue_node(node); end
+
+ # Visit a RestParameterNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:704
+ sig { params(node: Prism::RestParameterNode).void }
+ def visit_rest_parameter_node(node); end
+
+ # Visit a RetryNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:709
+ sig { params(node: Prism::RetryNode).void }
+ def visit_retry_node(node); end
+
+ # Visit a ReturnNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:714
+ sig { params(node: Prism::ReturnNode).void }
+ def visit_return_node(node); end
+
+ # Visit a SelfNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:719
+ sig { params(node: Prism::SelfNode).void }
+ def visit_self_node(node); end
+
+ # Visit a ShareableConstantNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:724
+ sig { params(node: Prism::ShareableConstantNode).void }
+ def visit_shareable_constant_node(node); end
+
+ # Visit a SingletonClassNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:729
+ sig { params(node: Prism::SingletonClassNode).void }
+ def visit_singleton_class_node(node); end
+
+ # Visit a SourceEncodingNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:734
+ sig { params(node: Prism::SourceEncodingNode).void }
+ def visit_source_encoding_node(node); end
+
+ # Visit a SourceFileNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:739
+ sig { params(node: Prism::SourceFileNode).void }
+ def visit_source_file_node(node); end
+
+ # Visit a SourceLineNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:744
+ sig { params(node: Prism::SourceLineNode).void }
+ def visit_source_line_node(node); end
+
+ # Visit a SplatNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:749
+ sig { params(node: Prism::SplatNode).void }
+ def visit_splat_node(node); end
+
+ # Visit a StatementsNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:754
+ sig { params(node: Prism::StatementsNode).void }
+ def visit_statements_node(node); end
+
+ # Visit a StringNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:759
+ sig { params(node: Prism::StringNode).void }
+ def visit_string_node(node); end
+
+ # Visit a SuperNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:764
+ sig { params(node: Prism::SuperNode).void }
+ def visit_super_node(node); end
+
+ # Visit a SymbolNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:769
+ sig { params(node: Prism::SymbolNode).void }
+ def visit_symbol_node(node); end
+
+ # Visit a TrueNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:774
+ sig { params(node: Prism::TrueNode).void }
+ def visit_true_node(node); end
+
+ # Visit a UndefNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:779
+ sig { params(node: Prism::UndefNode).void }
+ def visit_undef_node(node); end
+
+ # Visit a UnlessNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:784
+ sig { params(node: Prism::UnlessNode).void }
+ def visit_unless_node(node); end
+
+ # Visit a UntilNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:789
+ sig { params(node: Prism::UntilNode).void }
+ def visit_until_node(node); end
+
+ # Visit a WhenNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:794
+ sig { params(node: Prism::WhenNode).void }
+ def visit_when_node(node); end
+
+ # Visit a WhileNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:799
+ sig { params(node: Prism::WhileNode).void }
+ def visit_while_node(node); end
+
+ # Visit a XStringNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:804
+ sig { params(node: Prism::XStringNode).void }
+ def visit_x_string_node(node); end
+
+ # Visit a YieldNode node
+ #
+ # pkg:gem/prism#lib/prism/visitor.rb:809
+ sig { params(node: Prism::YieldNode).void }
+ def visit_yield_node(node); end
+end
+
+# Represents the use of the `when` keyword within a case statement.
+#
+# case true
+# when true
+# ^^^^^^^^^
+# end
+#
+# pkg:gem/prism#lib/prism/node.rb:19173
+class Prism::WhenNode < ::Prism::Node
+ # Initialize a new WhenNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19175
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ conditions: T::Array[Prism::Node],
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, conditions, then_keyword_loc, statements); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19295
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19187
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19192
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19213
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19205
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # attr_reader conditions: Array[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19244
+ sig { returns(T::Array[Prism::Node]) }
+ def conditions; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?conditions: Array[Prism::node], ?then_keyword_loc: Location?, ?statements: StatementsNode?) -> WhenNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19218
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ conditions: T::Array[Prism::Node],
+ then_keyword_loc: T.nilable(Prism::Location),
+ statements: T.nilable(Prism::StatementsNode)
+ ).returns(Prism::WhenNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, conditions: self.conditions, then_keyword_loc: self.then_keyword_loc, statements: self.statements); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19223
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, conditions: Array[Prism::node], then_keyword_loc: Location?, statements: StatementsNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19226
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19197
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19279
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19269
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19231
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19239
+ def save_keyword_loc(repository); end
+
+ # Save the then_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19261
+ def save_then_keyword_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19266
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # def then_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19274
+ sig { returns(T.nilable(String)) }
+ def then_keyword; end
+
+ # attr_reader then_keyword_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19247
+ sig { returns(T.nilable(Prism::Location)) }
+ def then_keyword_loc; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19284
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19289
+ def type; end
+ end
+end
+
+# Represents the use of the `while` keyword, either in the block form or the modifier form.
+#
+# bar while foo
+# ^^^^^^^^^^^^^
+#
+# while foo do bar end
+# ^^^^^^^^^^^^^^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:19312
+class Prism::WhileNode < ::Prism::Node
+ # Initialize a new WhileNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19314
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, do_keyword_loc, closing_loc, predicate, statements); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19464
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19327
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def begin_modifier?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19371
+ sig { returns(T::Boolean) }
+ def begin_modifier?; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19332
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19443
+ sig { returns(T.nilable(String)) }
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19408
+ sig { returns(T.nilable(Prism::Location)) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19353
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19345
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?do_keyword_loc: Location?, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?) -> WhileNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19358
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ do_keyword_loc: T.nilable(Prism::Location),
+ closing_loc: T.nilable(Prism::Location),
+ predicate: Prism::Node,
+ statements: T.nilable(Prism::StatementsNode)
+ ).returns(Prism::WhileNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, do_keyword_loc: self.do_keyword_loc, closing_loc: self.closing_loc, predicate: self.predicate, statements: self.statements); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19363
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, do_keyword_loc: Location?, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19366
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def do_keyword: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19438
+ sig { returns(T.nilable(String)) }
+ def do_keyword; end
+
+ # attr_reader do_keyword_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19389
+ sig { returns(T.nilable(Prism::Location)) }
+ def do_keyword_loc; end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19337
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19448
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19433
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19376
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # pkg:gem/prism#lib/prism/parse_result/newlines.rb:110
+ def newline_flag!(lines); end
+
+ # attr_reader predicate: Prism::node
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19427
+ sig { returns(Prism::Node) }
+ def predicate; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19422
+ def save_closing_loc(repository); end
+
+ # Save the do_keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19403
+ def save_do_keyword_loc(repository); end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19384
+ def save_keyword_loc(repository); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19430
+ sig { returns(T.nilable(Prism::StatementsNode)) }
+ def statements; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19453
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19458
+ def type; end
+ end
+end
+
+# Represents an xstring literal with no interpolation.
+#
+# `foo`
+# ^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:19479
+class Prism::XStringNode < ::Prism::Node
+ include ::Prism::HeredocQuery
+
+ # Initialize a new XStringNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19481
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).void
+ end
+ def initialize(source, node_id, location, flags, opening_loc, content_loc, closing_loc, unescaped); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19615
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19493
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19498
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19594
+ sig { returns(String) }
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19568
+ sig { returns(Prism::Location) }
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19514
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19509
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19589
+ sig { returns(String) }
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19555
+ sig { returns(Prism::Location) }
+ def content_loc; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> XStringNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19519
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ opening_loc: Prism::Location,
+ content_loc: Prism::Location,
+ closing_loc: Prism::Location,
+ unescaped: String
+ ).returns(Prism::XStringNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, opening_loc: self.opening_loc, content_loc: self.content_loc, closing_loc: self.closing_loc, unescaped: self.unescaped); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19524
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19527
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19503
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19537
+ sig { returns(T::Boolean) }
+ def forced_binary_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19532
+ sig { returns(T::Boolean) }
+ def forced_utf8_encoding?; end
+
+ sig { returns(T::Boolean) }
+ def heredoc?; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19599
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def opening: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19584
+ sig { returns(String) }
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19542
+ sig { returns(Prism::Location) }
+ def opening_loc; end
+
+ # Save the closing_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19576
+ def save_closing_loc(repository); end
+
+ # Save the content_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19563
+ def save_content_loc(repository); end
+
+ # Save the opening_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19550
+ def save_opening_loc(repository); end
+
+ # Occasionally it's helpful to treat a string as if it were interpolated so
+ # that there's a consistent interface for working with strings.
+ #
+ # pkg:gem/prism#lib/prism/node_ext.rb:93
+ sig { returns(Prism::InterpolatedXStringNode) }
+ def to_interpolated; end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19604
+ sig { override.returns(Symbol) }
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19581
+ sig { returns(String) }
+ def unescaped; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19609
+ def type; end
+ end
+end
+
+# Represents the use of the `yield` keyword.
+#
+# yield 1
+# ^^^^^^^
+#
+# pkg:gem/prism#lib/prism/node.rb:19629
+class Prism::YieldNode < ::Prism::Node
+ # Initialize a new YieldNode node.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19631
+ sig do
+ params(
+ source: Prism::Source,
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ lparen_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ rparen_loc: T.nilable(Prism::Location)
+ ).void
+ end
+ def initialize(source, node_id, location, flags, keyword_loc, lparen_loc, arguments, rparen_loc); end
+
+ # Implements case-equality for the node. This is effectively == but without
+ # comparing the value of locations. Locations are checked only for presence.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19770
+ def ===(other); end
+
+ # def accept: (Visitor visitor) -> void
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19643
+ sig { override.params(visitor: Prism::Visitor).returns(T.untyped) }
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19717
+ sig { returns(T.nilable(Prism::ArgumentsNode)) }
+ def arguments; end
+
+ # def child_nodes: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19648
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19667
+ sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) }
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19660
+ sig { override.returns(T::Array[Prism::Node]) }
+ def compact_child_nodes; end
+
+ # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?) -> YieldNode
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19672
+ sig do
+ params(
+ node_id: Integer,
+ location: Prism::Location,
+ flags: Integer,
+ keyword_loc: Prism::Location,
+ lparen_loc: T.nilable(Prism::Location),
+ arguments: T.nilable(Prism::ArgumentsNode),
+ rparen_loc: T.nilable(Prism::Location)
+ ).returns(Prism::YieldNode)
+ end
+ def copy(node_id: self.node_id, location: self.location, flags: self.flags, keyword_loc: self.keyword_loc, lparen_loc: self.lparen_loc, arguments: self.arguments, rparen_loc: self.rparen_loc); end
+
+ # def deconstruct: () -> Array[Node?]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19677
+ sig { override.returns(T::Array[T.nilable(Prism::Node)]) }
+ def deconstruct; end
+
+ # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location? }
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19680
+ sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) }
+ def deconstruct_keys(keys); end
+
+ # def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node]
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19653
+ def each_child_node; end
+
+ sig { override.returns(T::Array[Prism::Reflection::Field]) }
+ def fields; end
+
+ # def inspect -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19754
+ sig { override.returns(String) }
+ def inspect; end
+
+ # def keyword: () -> String
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19739
+ sig { returns(String) }
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19685
+ sig { returns(Prism::Location) }
+ def keyword_loc; end
+
+ # def lparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19744
+ sig { returns(T.nilable(String)) }
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19698
+ sig { returns(T.nilable(Prism::Location)) }
+ def lparen_loc; end
+
+ # def rparen: () -> String?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19749
+ sig { returns(T.nilable(String)) }
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19720
+ sig { returns(T.nilable(Prism::Location)) }
+ def rparen_loc; end
+
+ # Save the keyword_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19693
+ def save_keyword_loc(repository); end
+
+ # Save the lparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19712
+ def save_lparen_loc(repository); end
+
+ # Save the rparen_loc location using the given saved source so that
+ # it can be retrieved later.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19734
+ def save_rparen_loc(repository); end
+
+ # Return a symbol representation of this node type. See `Node#type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19759
+ sig { override.returns(Symbol) }
+ def type; end
+
+ class << self
+ # Return a symbol representation of this node type. See `Node::type`.
+ #
+ # pkg:gem/prism#lib/prism/node.rb:19764
+ def type; end
+ end
+end
+
+# pkg:gem/prism#lib/prism/translation/ruby_parser.rb:11
+class RubyParser; end
+
+# pkg:gem/prism#lib/prism/translation/ruby_parser.rb:12
+class RubyParser::SyntaxError < ::RuntimeError; end
diff --git a/sorbet/rbi/gems/pry@0.16.0.rbi b/sorbet/rbi/gems/pry@0.16.0.rbi
new file mode 100644
index 0000000..7df2dc8
--- /dev/null
+++ b/sorbet/rbi/gems/pry@0.16.0.rbi
@@ -0,0 +1,9091 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `pry` gem.
+# Please instead update this file by running `bin/tapioca gem pry`.
+
+
+# pkg:gem/pry#lib/pry/core_extensions.rb:115
+class BasicObject
+ # Return a binding object for the receiver.
+ #
+ # The `self` of the binding is set to the current object, and it contains no
+ # local variables.
+ #
+ # The default definee (http://yugui.jp/articles/846) is set such that new
+ # methods defined will be added to the singleton class of the BasicObject.
+ #
+ # @return [Binding]
+ #
+ # pkg:gem/pry#lib/pry/core_extensions.rb:125
+ def __binding__; end
+end
+
+# pkg:gem/pry#lib/pry/core_extensions.rb:24
+class Object < ::BasicObject
+ include ::Kernel
+ include ::PP::ObjectMixin
+
+ # Return a binding object for the receiver.
+ #
+ # The `self` of the binding is set to the current object, and it contains no
+ # local variables.
+ #
+ # The default definee (http://yugui.jp/articles/846) is set such that:
+ #
+ # * If `self` is a class or module, then new methods created in the binding
+ # will be defined in that class or module (as in `class Foo; end`).
+ # * If `self` is a normal object, then new methods created in the binding will
+ # be defined on its singleton class (as in `class << self; end`).
+ # * If `self` doesn't have a real singleton class (i.e. it is a Fixnum, Float,
+ # Symbol, nil, true, or false), then new methods will be created on the
+ # object's class (as in `self.class.class_eval{ }`)
+ #
+ # Newly created constants, including classes and modules, will also be added
+ # to the default definee.
+ #
+ # @return [Binding]
+ #
+ # pkg:gem/pry#lib/pry/core_extensions.rb:70
+ def __binding__; end
+
+ # Start a Pry REPL on self.
+ #
+ # If `self` is a Binding then that will be used to evaluate expressions;
+ # otherwise a new binding will be created.
+ #
+ # @param [Object] object the object or binding to pry
+ # (__deprecated__, use `object.pry`)
+ # @param [Hash] hash the options hash
+ # @example With a binding
+ # binding.pry
+ # @example On any object
+ # "dummy".pry
+ # @example With options
+ # def my_method
+ # binding.pry :quiet => true
+ # end
+ # my_method()
+ # @see Pry.start
+ #
+ # pkg:gem/pry#lib/pry/core_extensions.rb:43
+ def pry(object = T.unsafe(nil), hash = T.unsafe(nil)); end
+end
+
+# taken from irb
+# Implements tab completion for Readline in Pry
+#
+# {Pry::LastException} is a proxy class who wraps an Exception object for
+# {Pry#last_exception}. it extends the exception object with methods that
+# help pry commands be useful.
+#
+# the original exception object is not modified and method calls are forwarded
+# to the wrapped exception object.
+#
+# A pager is an `IO`-like object that accepts text and either prints it
+# immediately, prints it one page at a time, or streams it to an external
+# program to print one page at a time.
+#
+# pkg:gem/pry#lib/pry/version.rb:3
+class Pry
+ extend ::Forwardable
+ extend ::Pry::Forwardable
+
+ # Create a new {Pry} instance.
+ # @param [Hash] options
+ # @option options [#readline] :input
+ # The object to use for input.
+ # @option options [#puts] :output
+ # The object to use for output.
+ # @option options [Pry::CommandBase] :commands
+ # The object to use for commands.
+ # @option options [Hash] :hooks
+ # The defined hook Procs.
+ # @option options [Pry::Prompt] :prompt
+ # The array of Procs to use for prompts.
+ # @option options [Proc] :print
+ # The Proc to use for printing return values.
+ # @option options [Boolean] :quiet
+ # Omit the `whereami` banner when starting.
+ # @option options [Array] :backtrace
+ # The backtrace of the session's `binding.pry` line, if applicable.
+ # @option options [Object] :target
+ # The initial context for this session.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:80
+ def initialize(options = T.unsafe(nil)); end
+
+ # Add a sticky local to this Pry instance.
+ # A sticky local is a local that persists between all bindings in a session.
+ # @param [Symbol] name The name of the sticky local.
+ # @yield The block that defines the content of the local. The local
+ # will be refreshed at each tick of the repl loop.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:210
+ def add_sticky_local(name, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:34
+ def backtrace; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:34
+ def backtrace=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:31
+ def binding_stack; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:31
+ def binding_stack=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def color(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def color=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def commands(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def commands=(*args, **_arg1, &block); end
+
+ # Generate completions.
+ #
+ # @param [String] str
+ # What the user has typed so far
+ #
+ # @return [Array]
+ # Possible completions
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:143
+ def complete(str); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:49
+ def config; end
+
+ # The currently active `Binding`.
+ # @return [Binding] The currently active `Binding` for the session.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:122
+ def current_binding; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:125
+ def current_context; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:32
+ def custom_completions; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:32
+ def custom_completions=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def editor(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def editor=(*args, **_arg1, &block); end
+
+ # Pass a line of input to Pry.
+ #
+ # This is the equivalent of `Binding#eval` but with extra Pry!
+ #
+ # In particular:
+ # 1. Pry commands will be executed immediately if the line matches.
+ # 2. Partial lines of input will be queued up until a complete expression has
+ # been accepted.
+ # 3. Output is written to `#output` in pretty colours, not returned.
+ #
+ # Once this method has raised an exception or returned false, this instance
+ # is no longer usable. {#exit_value} will return the session's breakout
+ # value if applicable.
+ #
+ # @param [String?] line The line of input; `nil` if the user types ``
+ # @option options [Boolean] :generated Whether this line was generated automatically.
+ # Generated lines are not stored in history.
+ # @return [Boolean] Is Pry ready to accept more input?
+ # @raise [Exception] If the user uses the `raise-up` command, this method
+ # will raise that exception.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:253
+ def eval(line, options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:33
+ def eval_string; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:33
+ def eval_string=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:284
+ def evaluate_ruby(code); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def exception_handler(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def exception_handler=(*args, **_arg1, &block); end
+
+ # Execute the specified hook.
+ # @param [Symbol] name The hook name to execute
+ # @param [*Object] args The arguments to pass to the hook
+ # @return [Object, Exception] The return value of the hook or the exception raised
+ #
+ # If executing a hook raises an exception, we log that and then continue successfully.
+ # To debug such errors, use the global variable $pry_hook_error, which is set as a
+ # result.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:392
+ def exec_hook(name, *args, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:41
+ def exit_value; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def extra_sticky_locals(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def extra_sticky_locals=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def hooks(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def hooks=(*args, **_arg1, &block); end
+
+ # Injects a local variable into the provided binding.
+ #
+ # @param [String] name
+ # The name of the local to inject.
+ #
+ # @param [Object] value
+ # The value to set the local to.
+ #
+ # @param [Binding] binding
+ # The binding to set the local on.
+ #
+ # @return [Object]
+ # The value the local was set to.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:171
+ def inject_local(name, value, binding); end
+
+ # Inject all the sticky locals into the current binding.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:199
+ def inject_sticky_locals!; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def input(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def input=(*args, **_arg1, &block); end
+
+ # @since v0.12.0
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:44
+ def input_ring; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:38
+ def last_dir; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:38
+ def last_dir=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:40
+ def last_exception; end
+
+ # Set the last exception for a session.
+ # @param [Exception] exception The last exception.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:416
+ def last_exception=(exception); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:37
+ def last_file; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:37
+ def last_file=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:36
+ def last_result; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:36
+ def last_result=(_arg0); end
+
+ # @return [Boolean] True if the last result is an exception that was raised,
+ # as opposed to simply an instance of Exception (like the result of
+ # Exception.new)
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:438
+ def last_result_is_exception?; end
+
+ # @return [Integer] The maximum amount of objects remembered by the inp and
+ # out arrays. Defaults to 100.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def memory_size; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def memory_size=(size); end
+
+ # Returns an output device
+ # @example
+ # pry_instance.output.puts "ohai!"
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def output; end
+
+ # Returns an output device
+ # @example
+ # pry_instance.output.puts "ohai!"
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def output=(*args, **_arg1, &block); end
+
+ # @since v0.12.0
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:47
+ def output_ring; end
+
+ # Returns the currently configured pager
+ # @example
+ # pry_instance.pager.page text
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def pager; end
+
+ # Returns the currently configured pager
+ # @example
+ # pry_instance.pager.page text
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def pager=(*args, **_arg1, &block); end
+
+ # Pops the current prompt off of the prompt stack. If the prompt you are
+ # popping is the last prompt, it will not be popped. Use this to restore the
+ # previous prompt.
+ #
+ # @example
+ # pry = Pry.new(prompt: Pry::Prompt[:my_prompt1])
+ # pry.push_prompt(Pry::Prompt[:my_prompt2])
+ # pry.pop_prompt # => prompt2
+ # pry.pop_prompt # => prompt1
+ # pry.pop_prompt # => prompt1
+ #
+ # @return [Pry::Prompt] the prompt being popped
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:492
+ def pop_prompt; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def print(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:51
+ def print=(*args, **_arg1, &block); end
+
+ # If the given line is a valid command, process it in the context of the
+ # current `eval_string` and binding.
+ # @param [String] val The line to process.
+ # @return [Boolean] `true` if `val` is a command, `false` otherwise
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:323
+ def process_command(val); end
+
+ # Same as process_command, but outputs exceptions to `#output` instead of
+ # raising.
+ # @param [String] val The line to process.
+ # @return [Boolean] `true` if `val` is a command, `false` otherwise
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:358
+ def process_command_safely(val); end
+
+ # This is the prompt at the top of the prompt stack.
+ # @return [Pry::Prompt] the current prompt
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:99
+ def prompt; end
+
+ # Sets the Pry prompt.
+ # @param [Pry::Prompt] new_prompt
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:106
+ def prompt=(new_prompt); end
+
+ # Push a binding for the given object onto the stack. If this instance is
+ # currently stopped, mark it as usable again.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:129
+ def push_binding(object); end
+
+ # Initialize this instance by pushing its initial context into the binding
+ # stack. If no target is given, start at the top level.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:116
+ def push_initial_binding(target = T.unsafe(nil)); end
+
+ # Pushes the current prompt onto a stack that it can be restored from later.
+ # Use this if you wish to temporarily change the prompt.
+ #
+ # @example
+ # push_prompt(Pry::Prompt[:my_prompt])
+ #
+ # @param [Pry::Prompt] new_prompt
+ # @return [Pry::Prompt] new_prompt
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:476
+ def push_prompt(new_prompt); end
+
+ # Convenience accessor for the `quiet` config key.
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:562
+ def quiet?; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:552
+ def raise_up(*args); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:556
+ def raise_up!(*args); end
+
+ # Raise an exception out of Pry.
+ #
+ # See Kernel#raise for documentation of parameters.
+ # See rb_make_exception for the inbuilt implementation.
+ #
+ # This is necessary so that the raise-up command can tell the
+ # difference between an exception the user has decided to raise,
+ # and a mistake in specifying that exception.
+ #
+ # (i.e. raise-up RunThymeError.new should not be the same as
+ # raise-up NameError, "uninitialized constant RunThymeError")
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:524
+ def raise_up_common(force, *args); end
+
+ # Potentially deprecated. Use `Pry::REPL.new(pry, :target => target).start`
+ # (If nested sessions are going to exist, this method is fine, but a goal is
+ # to come up with an alternative to nested sessions altogether.)
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:280
+ def repl(target = T.unsafe(nil)); end
+
+ # Reset the current eval string. If the user has entered part of a multiline
+ # expression, this discards that input.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:229
+ def reset_eval_string; end
+
+ # Run the specified command.
+ # @param [String] val The command (and its params) to execute.
+ # @return [Pry::Command::VOID_VALUE]
+ # @example
+ # pry_instance.run_command("ls -m")
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:373
+ def run_command(val); end
+
+ # Returns the appropriate prompt to use.
+ # @return [String] The prompt.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:451
+ def select_prompt; end
+
+ # Set the last result of an eval.
+ # This method should not need to be invoked directly.
+ # @param [Object] result The result.
+ # @param [String] code The code that was run.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:407
+ def set_last_result(result, code = T.unsafe(nil)); end
+
+ # Whether the print proc should be invoked.
+ # Currently only invoked if the output is not suppressed.
+ # @return [Boolean] Whether the print proc should be invoked.
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:445
+ def should_print?; end
+
+ # Output the result or pass to an exception handler (if result is an exception).
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:296
+ def show_result(result); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:214
+ def sticky_locals; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:35
+ def suppress_output; end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:35
+ def suppress_output=(_arg0); end
+
+ # Update Pry's internal state after evalling code.
+ # This method should not need to be invoked directly.
+ # @param [String] code The code we just eval'd
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:426
+ def update_input_history(code); end
+
+ private
+
+ # Force `eval_string` into the encoding of `val`. [Issue #284]
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:650
+ def ensure_correct_encoding!(val); end
+
+ # pkg:gem/pry#lib/pry/pry_instance.rb:568
+ def handle_line(line, options); end
+
+ # the array that the prompt stack is stored in
+ #
+ # pkg:gem/pry#lib/pry/pry_instance.rb:659
+ def prompt_stack; end
+
+ class << self
+ # Convert the given object into an instance of `Pry::Code`, if it isn't
+ # already one.
+ #
+ # @param [Code, Method, UnboundMethod, Proc, Pry::Method, String, Array,
+ # IO] obj
+ #
+ # pkg:gem/pry#lib/pry/code.rb:12
+ def Code(obj); end
+
+ # If the given object is a `Pry::Method`, return it unaltered. If it's
+ # anything else, return it wrapped in a `Pry::Method` instance.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:9
+ def Method(obj); end
+
+ # If the given object is a `Pry::WrappedModule`, return it unaltered. If it's
+ # anything else, return it wrapped in a `Pry::WrappedModule` instance.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:7
+ def WrappedModule(obj); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:296
+ def auto_resize!; end
+
+ # Return a `Binding` object for `target` or return `target` if it is
+ # already a `Binding`.
+ # In the case where `target` is top-level then return `TOPLEVEL_BINDING`
+ # @param [Object] target The object to get a `Binding` object for.
+ # @return [Binding] The `Binding` object.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:322
+ def binding_for(target); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:22
+ def cli; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:22
+ def cli=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def color(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def color=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def commands(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def commands=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:25
+ def config; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:25
+ def config=(_arg0); end
+
+ # @example
+ # Pry.configure do |config|
+ # config.eager_load! # optional
+ # config.input = # ..
+ # config.foo = 2
+ # end
+ #
+ # @yield [config]
+ # Yields a block with {Pry.config} as its argument.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:46
+ def configure; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:355
+ def critical_section; end
+
+ # @return [Pry::Config]
+ # Returns a value store for an instance of Pry running on the current thread.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:63
+ def current; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:19
+ def current_line; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:19
+ def current_line=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:18
+ def custom_completions; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:18
+ def custom_completions=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def editor(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def editor=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:21
+ def eval_path; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:21
+ def eval_path=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def exception_handler(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def exception_handler=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def extra_sticky_locals(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def extra_sticky_locals=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:139
+ def final_session_setup; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def history(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def history=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def hooks(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def hooks=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:350
+ def in_critical_section?; end
+
+ # Basic initialization.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:313
+ def init; end
+
+ # @return [Boolean] Whether this is the first time a Pry session has
+ # been started since loading the Pry class.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:259
+ def initial_session?; end
+
+ # Do basic setup for initial session including: loading pryrc, plugins,
+ # requires, and history.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:129
+ def initial_session_setup; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def input(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def input=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:24
+ def last_internal_error; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:24
+ def last_internal_error=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:20
+ def line_buffer; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:20
+ def line_buffer=(_arg0); end
+
+ # Load the given file in the context of `Pry.toplevel_binding`
+ # @param [String] file The unexpanded file path.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:69
+ def load_file_at_toplevel(file); end
+
+ # Execute the file through the REPL loop, non-interactively.
+ # @param [String] file_name File name to load through the REPL.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:204
+ def load_file_through_repl(file_name); end
+
+ # Load Readline history if required.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:253
+ def load_history; end
+
+ # Load RC files if appropriate This method can also be used to reload the
+ # files if they have changed.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:77
+ def load_rc_files; end
+
+ # Load any Ruby files specified with the -r flag on the command line.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:101
+ def load_requires; end
+
+ # Trap interrupts on jruby, and make them behave like MRI so we can
+ # catch them.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:109
+ def load_traps; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:113
+ def load_win32console; end
+
+ # @return [main]
+ # returns the special instance of Object, "main".
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:55
+ def main; end
+
+ # @return [Integer] The maximum amount of objects remembered by the inp and
+ # out arrays. Defaults to 100.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def memory_size(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def memory_size=(*args, **_arg1, &block); end
+
+ # Returns an output device
+ # @example
+ # pry_instance.output.puts "ohai!"
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def output(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def output=(*args, **_arg1, &block); end
+
+ # Returns the currently configured pager
+ # @example
+ # pry_instance.pager.page text
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def pager(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def pager=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def print(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def print=(*args, **_arg1, &block); end
+
+ # This is the prompt at the top of the prompt stack.
+ # @return [Pry::Prompt] the current prompt
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def prompt(*args, **_arg1, &block); end
+
+ # Sets the Pry prompt.
+ # @param [Pry::Prompt] new_prompt
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:27
+ def prompt=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:23
+ def quiet; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:23
+ def quiet=(_arg0); end
+
+ # Load the local RC file (./.pryrc)
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:86
+ def rc_files_to_load; end
+
+ # Expand a file to its canonical name (following symlinks as appropriate)
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:94
+ def real_path_to(file); end
+
+ # Set all the configurable options back to their default values
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:301
+ def reset_defaults; end
+
+ # Run a Pry command from outside a session. The commands available are
+ # those referenced by `Pry.config.commands` (the default command set).
+ # @param [String] command_string The Pry command (including arguments,
+ # if any).
+ # @param [Hash] options Optional named parameters.
+ # @return [nil]
+ # @option options [Object, Binding] :target The object to run the
+ # command under. Defaults to `TOPLEVEL_BINDING` (main).
+ # @option options [Boolean] :show_output Whether to show command
+ # output. Defaults to true.
+ # @example Run at top-level with no output.
+ # Pry.run_command "ls"
+ # @example Run under Pry class, returning only public methods.
+ # Pry.run_command "ls -m", :target => Pry
+ # @example Display command output.
+ # Pry.run_command "ls -av", :show_output => true
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:279
+ def run_command(command_string, options = T.unsafe(nil)); end
+
+ # Start a Pry REPL.
+ # This method also loads `pryrc` as necessary the first time it is invoked.
+ # @param [Object, Binding] target The receiver of the Pry session
+ # @param [Hash] options
+ # @option options (see Pry#initialize)
+ # @example
+ # Pry.start(Object.new, :input => MyInput.new)
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:156
+ def start(target = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:329
+ def toplevel_binding; end
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:347
+ def toplevel_binding=(_arg0); end
+
+ # An inspector that clips the output to `max_length` chars.
+ # In case of > `max_length` chars the `# notation is used.
+ #
+ # @param [Object] obj
+ # The object to view.
+ #
+ # @param [Hash] options
+ # @option options [Integer] :max_length (60)
+ # The maximum number of chars before clipping occurs.
+ #
+ # @option options [Boolean] :id (false)
+ # Boolean to indicate whether or not a hex representation of the object ID
+ # is attached to the return value when the length of inspect is greater than
+ # value of `:max_length`.
+ #
+ # @return [String]
+ # The string representation of `obj`.
+ #
+ # pkg:gem/pry#lib/pry/pry_class.rb:227
+ def view_clip(obj, options = T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/pry_class.rb:363
+ def mutex_available?; end
+ end
+end
+
+# @return [Array] Code of the method used when implementing Pry's
+# __binding__, along with line indication to be used with instance_eval (and
+# friends).
+#
+# @see Object#__binding__
+#
+# pkg:gem/pry#lib/pry/core_extensions.rb:9
+Pry::BINDING_METHOD_IMPL = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/basic_object.rb:4
+class Pry::BasicObject < ::BasicObject
+ include ::Kernel
+end
+
+# pkg:gem/pry#lib/pry/basic_object.rb:6
+Pry::BasicObject::Dir = Dir
+
+# pkg:gem/pry#lib/pry/basic_object.rb:6
+Pry::BasicObject::ENV = T.let(T.unsafe(nil), Object)
+
+# pkg:gem/pry#lib/pry/basic_object.rb:6
+Pry::BasicObject::File = File
+
+# pkg:gem/pry#lib/pry/basic_object.rb:6
+Pry::BasicObject::Kernel = Kernel
+
+# pkg:gem/pry#lib/pry/basic_object.rb:6
+Pry::BasicObject::LoadError = LoadError
+
+# pkg:gem/pry#lib/pry/basic_object.rb:6
+Pry::BasicObject::Pry = Pry
+
+# A super-class for Commands that are created with a single block.
+#
+# This class ensures that the block is called with the correct number of
+# arguments and the right context.
+#
+# Create subclasses using {Pry::CommandSet#command}.
+#
+# pkg:gem/pry#lib/pry/block_command.rb:10
+class Pry::BlockCommand < ::Pry::Command
+ # Call the block that was registered with this command.
+ # @param [Array] args The arguments passed
+ # @return [Object] The return value of the block
+ #
+ # pkg:gem/pry#lib/pry/block_command.rb:14
+ def call(*args); end
+
+ # pkg:gem/pry#lib/pry/block_command.rb:18
+ def help; end
+end
+
+# Manage the processing of command line options
+#
+# pkg:gem/pry#lib/pry/cli.rb:7
+class Pry::CLI
+ class << self
+ # Add a block responsible for processing parsed options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:39
+ def add_option_processor(&block); end
+
+ # Add another set of CLI options (a Pry::Slop block)
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:24
+ def add_options(&block); end
+
+ # @return [Array] The input array of strings to process
+ # as CLI options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:21
+ def input_args; end
+
+ # @return [Array] The input array of strings to process
+ # as CLI options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:21
+ def input_args=(_arg0); end
+
+ # @return [Array] The Procs that process the parsed options. Plugins can
+ # utilize this facility in order to add and process their own Pry
+ # options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:17
+ def option_processors; end
+
+ # @return [Array] The Procs that process the parsed options. Plugins can
+ # utilize this facility in order to add and process their own Pry
+ # options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:17
+ def option_processors=(_arg0); end
+
+ # @return [Proc] The Proc defining the valid command line options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:12
+ def options; end
+
+ # @return [Proc] The Proc defining the valid command line options.
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:12
+ def options=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/cli.rb:52
+ def parse_options(args = T.unsafe(nil)); end
+
+ # Clear `options` and `option_processors`
+ #
+ # pkg:gem/pry#lib/pry/cli.rb:47
+ def reset; end
+
+ # pkg:gem/pry#lib/pry/cli.rb:90
+ def start(opts); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/cli.rb:8
+class Pry::CLI::NoOptionsError < ::StandardError; end
+
+# A super-class of Commands with structure.
+#
+# This class implements the bare-minimum functionality that a command should
+# have, namely a --help switch, and then delegates actual processing to its
+# subclasses.
+#
+# Create subclasses using {Pry::CommandSet#create_command}, and override the
+# `options(opt)` method to set up an instance of Pry::Slop, and the `process`
+# method to actually run the command. If necessary, you can also override
+# `setup` which will be called before `options`, for example to require any
+# gems your command needs to run, or to set up state.
+#
+# pkg:gem/pry#lib/pry/class_command.rb:15
+class Pry::ClassCommand < ::Pry::Command
+ # pkg:gem/pry#lib/pry/class_command.rb:64
+ def args; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:64
+ def args=(_arg0); end
+
+ # Set up `opts` and `args`, and then call `process`.
+ #
+ # This method will display help if necessary.
+ #
+ # @param [Array] args The arguments passed
+ # @return [Object] The return value of `process` or VOID_VALUE
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:72
+ def call(*args); end
+
+ # Generate shell completions
+ # @param [String] search The line typed so far
+ # @return [Array] the words to complete
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:105
+ def complete(search); end
+
+ # Return the help generated by Pry::Slop for this command.
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:87
+ def help; end
+
+ # A method to setup Pry::Slop so it can parse the options your command expects.
+ #
+ # @note Please don't do anything side-effecty in the main part of this
+ # method, as it may be called by Pry at any time for introspection reasons.
+ # If you need to set up default values, use `setup` instead.
+ #
+ # @example
+ # def options(opt)
+ # opt.banner "Gists methods or classes"
+ # opt.on(:c, :class, "gist a class") do
+ # @action = :class
+ # end
+ # end
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:171
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:63
+ def opts; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:63
+ def opts=(_arg0); end
+
+ # The actual body of your command should go here.
+ #
+ # The `opts` method can be called to get the options that Pry::Slop has passed,
+ # and `args` gives the remaining, unparsed arguments.
+ #
+ # The return value of this method is discarded unless the command was
+ # created with `:keep_retval => true`, in which case it is returned to the
+ # repl.
+ #
+ # @example
+ # def process
+ # if opts.present?(:class)
+ # gist_class
+ # else
+ # gist_method
+ # end
+ # end
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:190
+ def process; end
+
+ # A method called just before `options(opt)` as part of `call`.
+ #
+ # This method can be used to set up any context your command needs to run,
+ # for example requiring gems, or setting default values for options.
+ #
+ # @example
+ # def setup
+ # require 'gist'
+ # @action = :method
+ # end
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:121
+ def setup; end
+
+ # Return an instance of Pry::Slop that can parse either subcommands or the
+ # options that this command accepts.
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:93
+ def slop; end
+
+ # A method to setup Pry::Slop commands so it can parse the subcommands your
+ # command expects. If you need to set up default values, use `setup`
+ # instead.
+ #
+ # @example A minimal example
+ # def subcommands(cmd)
+ # cmd.command :download do |opt|
+ # description 'Downloads a content from a server'
+ #
+ # opt.on :verbose, 'Use verbose output'
+ #
+ # run do |options, arguments|
+ # ContentDownloader.download(options, arguments)
+ # end
+ # end
+ # end
+ #
+ # @example Define the invocation block anywhere you want
+ # def subcommands(cmd)
+ # cmd.command :download do |opt|
+ # description 'Downloads a content from a server'
+ #
+ # opt.on :verbose, 'Use verbose output'
+ # end
+ # end
+ #
+ # def process
+ # # Perform calculations...
+ # opts.fetch_command(:download).run do |options, arguments|
+ # ContentDownloader.download(options, arguments)
+ # end
+ # # More calculations...
+ # end
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:156
+ def subcommands(cmd); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/class_command.rb:29
+ def doc; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:40
+ def file; end
+
+ # Ensure that subclasses inherit the options, description and
+ # match from a ClassCommand super class.
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:19
+ def inherited(klass); end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:45
+ def line; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:25
+ def source; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:37
+ def source_file; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:42
+ def source_line; end
+
+ # pkg:gem/pry#lib/pry/class_command.rb:33
+ def source_location; end
+
+ private
+
+ # The object used to extract the source for the command.
+ #
+ # This should be a `Pry::Method(block)` for a command made with `create_command`
+ # and a `Pry::WrappedModule(self)` for a command that's a standard class.
+ # @return [Pry::WrappedModule, Pry::Method]
+ #
+ # pkg:gem/pry#lib/pry/class_command.rb:54
+ def source_object; end
+ end
+end
+
+# `Pry::Code` is a class that encapsulates lines of source code and their
+# line numbers and formats them for terminal output. It can read from a file
+# or method definition or be instantiated with a `String` or an `Array`.
+#
+# In general, the formatting methods in `Code` return a new `Code` object
+# which will format the text as specified when `#to_s` is called. This allows
+# arbitrary chaining of formatting methods without mutating the original
+# object.
+#
+# pkg:gem/pry#lib/pry/code.rb:32
+class Pry::Code
+ extend ::MethodSource::CodeHelpers
+
+ # Instantiate a `Code` object containing code from the given `Array`,
+ # `String`, or `IO`. The first line will be line 1 unless specified
+ # otherwise. If you need non-contiguous line numbers, you can create an
+ # empty `Code` object and then use `#push` to insert the lines.
+ #
+ # @param [Array, String, IO] lines
+ # @param [Integer?] start_line
+ # @param [Symbol?] code_type
+ #
+ # pkg:gem/pry#lib/pry/code.rb:87
+ def initialize(lines = T.unsafe(nil), start_line = T.unsafe(nil), code_type = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/code.rb:106
+ def <<(line); end
+
+ # Two `Code` objects are equal if they contain the same lines with the same
+ # numbers. Otherwise, call `to_s` and `chomp` and compare as Strings.
+ #
+ # @param [Code, Object] other
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:325
+ def ==(other); end
+
+ # Remove all lines except for the +lines+ after and excluding +lineno+.
+ #
+ # @param [Integer] lineno
+ # @param [Integer] lines
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:195
+ def after(lineno, lines = T.unsafe(nil)); end
+
+ # Remove all lines except for the +lines+ on either side of and including
+ # +lineno+.
+ #
+ # @param [Integer] lineno
+ # @param [Integer] lines
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:182
+ def around(lineno, lines = T.unsafe(nil)); end
+
+ # Remove all lines except for the +lines+ up to and excluding +lineno+.
+ #
+ # @param [Integer] lineno
+ # @param [Integer] lines
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:168
+ def before(lineno, lines = T.unsafe(nil)); end
+
+ # Remove all lines that aren't in the given range, expressed either as a
+ # `Range` object or a first and last line number (inclusive). Negative
+ # indices count from the end of the array of lines.
+ #
+ # @param [Range, Integer] start_line
+ # @param [Integer?] end_line
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:135
+ def between(start_line, end_line = T.unsafe(nil)); end
+
+ # @return [Symbol] The type of code stored in this wrapper.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:77
+ def code_type; end
+
+ # @return [Symbol] The type of code stored in this wrapper.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:77
+ def code_type=(_arg0); end
+
+ # Get the comment that describes the expression on the given line number.
+ #
+ # @param [Integer] line_number (1-based)
+ # @return [String] the code.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:286
+ def comment_describing(line_number); end
+
+ # Get the multiline expression that starts on the given line number.
+ #
+ # @param [Integer] line_number (1-based)
+ # @return [String] the code.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:294
+ def expression_at(line_number, consume = T.unsafe(nil)); end
+
+ # Remove all lines that don't match the given `pattern`.
+ #
+ # @param [Regexp] pattern
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:207
+ def grep(pattern); end
+
+ # @return [String] a (possibly highlighted) copy of the source code.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:263
+ def highlighted; end
+
+ # Return the number of lines stored.
+ #
+ # @return [Integer]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:316
+ def length; end
+
+ # @return [Integer] the number of digits in the last line.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:252
+ def max_lineno_width; end
+
+ # Forward any missing methods to the output of `#to_s`.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:335
+ def method_missing(method_name, *args, &block); end
+
+ # Get the (approximate) Module.nesting at the give line number.
+ #
+ # @param [Integer] line_number line number starting from 1
+ # @return [Array] a list of open modules.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:302
+ def nesting_at(line_number); end
+
+ # Writes a formatted representation (based on the configuration of the
+ # object) to the given output, which must respond to `#<<`.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:269
+ def print_to_output(output, color = T.unsafe(nil)); end
+
+ # Append the given line. +lineno+ is one more than the last existing
+ # line, unless specified otherwise.
+ #
+ # @param [String] line
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:102
+ def push(line); end
+
+ # Return an unformatted String of the code.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:309
+ def raw; end
+
+ # Filter the lines using the given block.
+ #
+ # @yield [LOC]
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:122
+ def reject(&block); end
+
+ # Filter the lines using the given block.
+ #
+ # @yield [LOC]
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:112
+ def select(&block); end
+
+ # Take `num_lines` from `start_line`, forward or backwards.
+ #
+ # @param [Integer] start_line
+ # @param [Integer] num_lines
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:150
+ def take_lines(start_line, num_lines); end
+
+ # @return [String] a formatted representation (based on the configuration of
+ # the object).
+ #
+ # pkg:gem/pry#lib/pry/code.rb:258
+ def to_s; end
+
+ # Format output with the specified number of spaces in front of every line,
+ # unless `spaces` is falsy.
+ #
+ # @param [Integer?] spaces
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:244
+ def with_indentation(spaces = T.unsafe(nil)); end
+
+ # Format output with line numbers next to it, unless `y_n` is falsy.
+ #
+ # @param [Boolean?] y_n
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:221
+ def with_line_numbers(y_n = T.unsafe(nil)); end
+
+ # Format output with a marker next to the given +lineno+, unless +lineno+ is
+ # falsy.
+ #
+ # @param [Integer?] lineno
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:232
+ def with_marker(lineno = T.unsafe(nil)); end
+
+ protected
+
+ # An abstraction of the `dup.instance_eval` pattern used throughout this
+ # class.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:353
+ def alter(&block); end
+
+ private
+
+ # Check whether String responds to missing methods.
+ #
+ # pkg:gem/pry#lib/pry/code.rb:345
+ def respond_to_missing?(method_name, include_private = T.unsafe(nil)); end
+
+ class << self
+ # Instantiate a `Code` object containing code loaded from a file or
+ # Pry's line buffer.
+ #
+ # @param [String] filename The name of a file, or "(pry)".
+ # @param [Symbol] code_type The type of code the file contains.
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:42
+ def from_file(filename, code_type = T.unsafe(nil)); end
+
+ # Instantiate a `Code` object containing code extracted from a
+ # `::Method`, `UnboundMethod`, `Proc`, or `Pry::Method` object.
+ #
+ # @param [::Method, UnboundMethod, Proc, Pry::Method] meth The method
+ # object.
+ # @param [Integer, nil] start_line The line number to start on, or nil to
+ # use the method's original line numbers.
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:55
+ def from_method(meth, start_line = T.unsafe(nil)); end
+
+ # Attempt to extract the source code for module (or class) `mod`.
+ #
+ # @param [Module, Class] mod The module (or class) of interest.
+ # @param [Integer] candidate_rank The module candidate (by rank)
+ # to use (see `Pry::WrappedModule::Candidate` for more information).
+ # @param [Integer, nil] start_line The line number to start on, or nil to
+ # use the method's original line numbers.
+ # @return [Code]
+ #
+ # pkg:gem/pry#lib/pry/code.rb:69
+ def from_module(mod, candidate_rank = T.unsafe(nil), start_line = T.unsafe(nil)); end
+ end
+end
+
+# Represents a range of lines in a code listing.
+#
+# @api private
+#
+# pkg:gem/pry#lib/pry/code/code_range.rb:8
+class Pry::Code::CodeRange
+ # @param [Integer] start_line
+ # @param [Integer?] end_line
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:11
+ def initialize(start_line, end_line = T.unsafe(nil)); end
+
+ # @param [Array] lines
+ # @return [Range]
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:19
+ def indices_range(lines); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/code/code_range.rb:27
+ def end_line; end
+
+ # @return [Integer]
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:57
+ def find_end_index(lines); end
+
+ # @return [Integer]
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:50
+ def find_start_index(lines); end
+
+ # If `end_line` is equal to `nil`, then calculate it from the first
+ # parameter, `start_line`. Otherwise, leave it as it is.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:32
+ def force_set_end_line; end
+
+ # Finds indices of `start_line` and `end_line` in the given Array of
+ # +lines+.
+ #
+ # @param [Array] lines
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:45
+ def indices(lines); end
+
+ # For example, if the range is 4..10, then `start_line` would be equal to
+ # 4 and `end_line` to 10.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code/code_range.rb:66
+ def set_end_line_from_range; end
+
+ # pkg:gem/pry#lib/pry/code/code_range.rb:25
+ def start_line; end
+end
+
+# Represents a line of code (which may, in fact, contain multiple lines if
+# the entirety was eval'd as a single unit following the `edit` command).
+#
+# A line of code is a tuple, which consists of a line and a line number. A
+# `LOC` object's state (namely, the line parameter) can be changed via
+# instance methods. `Pry::Code` heavily uses this class.
+#
+# @api private
+# @example
+# loc = LOC.new("def example\n :example\nend", 1)
+# puts loc.line
+# def example
+# :example
+# end
+# #=> nil
+#
+# loc.indent(3)
+# loc.line #=> " def example\n :example\nend"
+#
+# pkg:gem/pry#lib/pry/code/loc.rb:23
+class Pry::Code::LOC
+ # @param [String] line The line of code.
+ # @param [Integer] lineno The position of the +line+.
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:29
+ def initialize(line, lineno); end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:34
+ def ==(other); end
+
+ # Prepends the line number `lineno` to the `line`.
+ #
+ # @param [Integer] max_width
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:64
+ def add_line_number(max_width = T.unsafe(nil), color = T.unsafe(nil)); end
+
+ # Prepends a marker "=>" or an empty marker to the +line+.
+ #
+ # @param [Integer] marker_lineno If it is equal to the `lineno`, then
+ # prepend a hashrocket. Otherwise, an empty marker.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:81
+ def add_marker(marker_lineno); end
+
+ # Paints the `line` of code.
+ #
+ # @param [Symbol] code_type
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:56
+ def colorize(code_type); end
+
+ # pkg:gem/pry#lib/pry/code/loc.rb:38
+ def dup; end
+
+ # pkg:gem/pry#lib/pry/code/loc.rb:98
+ def handle_multiline_entries_from_edit_command(line, max_width); end
+
+ # Indents the `line` with +distance+ spaces.
+ #
+ # @param [Integer] distance
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:94
+ def indent(distance); end
+
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:43
+ def line; end
+
+ # @return [Integer]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:48
+ def lineno; end
+
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/code/loc.rb:25
+ def tuple; end
+end
+
+# pkg:gem/pry#lib/pry/code/code_file.rb:6
+class Pry::CodeFile
+ # @param [String] filename The name of a file with code to be detected
+ # @param [Symbol] code_type The type of code the `filename` contains
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:41
+ def initialize(filename, code_type = T.unsafe(nil)); end
+
+ # @return [String] The code contained in the current `@filename`.
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:47
+ def code; end
+
+ # @return [Symbol] The type of code stored in this wrapper.
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:37
+ def code_type; end
+
+ private
+
+ # @raise [MethodSource::SourceNotFoundError] if the `filename` is not
+ # readable for some reason.
+ # @return [String] absolute path for the given `filename`.
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:64
+ def abs_path; end
+
+ # @return [Array] All the paths that contain code that Pry can use for its
+ # API's. Skips directories.
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:80
+ def code_path; end
+
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:110
+ def from_load_path; end
+
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:105
+ def from_pry_init_pwd; end
+
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:100
+ def from_pwd; end
+
+ # @param [String] path
+ # @return [Boolean] if the path, with or without the default ext,
+ # is a readable file then `true`, otherwise `false`.
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:73
+ def readable?(path); end
+
+ # @param [String] filename
+ # @param [Symbol] default (:unknown) the file type to assume if none could be
+ # detected.
+ # @return [Symbol, nil] The SyntaxHighlighter type of a file from its
+ # extension, or `nil` if `:unknown`.
+ #
+ # pkg:gem/pry#lib/pry/code/code_file.rb:89
+ def type_from_filename(filename, default = T.unsafe(nil)); end
+end
+
+# pkg:gem/pry#lib/pry/code/code_file.rb:7
+Pry::CodeFile::DEFAULT_EXT = T.let(T.unsafe(nil), String)
+
+# List of all supported languages.
+# @return [Hash]
+#
+# pkg:gem/pry#lib/pry/code/code_file.rb:11
+Pry::CodeFile::EXTENSIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/pry#lib/pry/code/code_file.rb:28
+Pry::CodeFile::FILES = T.let(T.unsafe(nil), Hash)
+
+# Store the current working directory. This allows show-source etc. to work if
+# your process has changed directory since boot. [Issue #675]
+#
+# pkg:gem/pry#lib/pry/code/code_file.rb:34
+Pry::CodeFile::INITIAL_PWD = T.let(T.unsafe(nil), String)
+
+# This class is responsible for taking a string (identifying a
+# command/class/method/etc) and returning the relevant type of object.
+# For example, if the user looks up "show-source" then a
+# `Pry::Command` will be returned. Alternatively, if the user passes in "Pry#repl" then
+# a `Pry::Method` object will be returned.
+#
+# The `CodeObject.lookup` method is responsible for 1. figuring out what kind of
+# object the user wants (applying precedence rules in doing so -- i.e methods
+# get precedence over commands with the same name) and 2. Returning
+# the appropriate object. If the user fails to provide a string
+# identifier for the object (i.e they pass in `nil` or "") then the
+# object looked up will be the 'current method' or 'current class'
+# associated with the Binding.
+#
+# TODO: This class is a clusterfuck. We need a much more robust
+# concept of what a "Code Object" really is. Currently
+# commands/classes/candidates/methods and so on just share a very
+# ill-defined interface.
+#
+# pkg:gem/pry#lib/pry/code_object.rb:22
+class Pry::CodeObject
+ include ::Pry::Helpers::OptionsHelpers
+ include ::Pry::Helpers::CommandHelpers
+
+ # pkg:gem/pry#lib/pry/code_object.rb:82
+ def initialize(str, pry_instance, options = T.unsafe(nil)); end
+
+ # TODO: just make it so find_command_by_match_or_listing doesn't raise?
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:94
+ def command_lookup; end
+
+ # lookup variables and constants and `self` that are not modules
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:118
+ def default_lookup; end
+
+ # when no parameter is given (i.e CodeObject.lookup(nil)), then we
+ # lookup the 'current object' from the binding.
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:102
+ def empty_lookup; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:136
+ def method_or_class_lookup; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:79
+ def pry_instance; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:79
+ def pry_instance=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:77
+ def str; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:77
+ def str=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:80
+ def super_level; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:80
+ def super_level=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:78
+ def target; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:78
+ def target=(_arg0); end
+
+ private
+
+ # Returns true if `str` looks like a method, i.e Klass#method
+ # We need to consider this case because method lookups should fall
+ # through to the `method_or_class_lookup()` method but a
+ # defined?() on a "Klass#method` string will see the `#` as a
+ # comment and only evaluate the `Klass` part.
+ # @param [String] str
+ # @return [Boolean] Whether the string looks like an instance method.
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:163
+ def looks_like_an_instance_method?(str); end
+
+ # grab the nth (`super_level`) super of `obj
+ # @param [Object] obj
+ # @param [Fixnum] super_level How far up the super chain to ascend.
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:188
+ def lookup_super(obj, super_level); end
+
+ # We use this method to decide whether code is safe to eval. Method's are
+ # generally not, but everything else is.
+ # TODO: is just checking != "method" enough??
+ # TODO: see duplication of this method in Pry::WrappedModule
+ # @param [String] str The string to lookup
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:173
+ def safe_to_evaluate?(str); end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:152
+ def sourcable_object?(obj); end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:181
+ def target_self; end
+
+ class << self
+ # pkg:gem/pry#lib/pry/code_object.rb:69
+ def lookup(str, pry_instance, options = T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/code_object.rb:23
+module Pry::CodeObject::Helpers
+ # pkg:gem/pry#lib/pry/code_object.rb:30
+ def c_method?; end
+
+ # @return [Boolean] `true` if this module was defined by means of the C API,
+ # `false` if it's a Ruby module.
+ # @note If a module defined by C was extended with a lot of methods written
+ # in Ruby, this method would fail.
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:46
+ def c_module?; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:38
+ def command?; end
+
+ # pkg:gem/pry#lib/pry/code_object.rb:34
+ def module_with_yard_docs?; end
+
+ # we need this helper as some Pry::Method objects can wrap Procs
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/code_object.rb:26
+ def real_method_object?; end
+end
+
+# PP subclass for streaming inspect output in color.
+#
+# pkg:gem/pry#lib/pry/color_printer.rb:8
+class Pry::ColorPrinter < ::PP
+ # pkg:gem/pry#lib/pry/color_printer.rb:25
+ def pp(object); end
+
+ # pkg:gem/pry#lib/pry/color_printer.rb:37
+ def text(str, max_width = T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/color_printer.rb:49
+ def highlight_object_literal(object_literal); end
+
+ # pkg:gem/pry#lib/pry/color_printer.rb:55
+ def inspect_object(object); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/color_printer.rb:11
+ def default(_output, value, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/color_printer.rb:18
+ def pp(obj, output = T.unsafe(nil), max_width = T.unsafe(nil)); end
+ end
+end
+
+# The super-class of all commands, new commands should be created by calling
+# {Pry::CommandSet#command} which creates a BlockCommand or
+# {Pry::CommandSet#create_command} which creates a ClassCommand. Please don't
+# use this class directly.
+# N.B. using a regular expression here so that "raise-up 'foo'" does the right thing.
+#
+# pkg:gem/pry#lib/pry/command.rb:11
+class Pry::Command
+ include ::Pry::Helpers::BaseHelpers
+ include ::Pry::Helpers::OptionsHelpers
+ include ::Pry::Helpers::CommandHelpers
+ include ::Pry::Helpers::Text
+ extend ::Pry::Helpers::DocumentationHelpers
+ extend ::Pry::CodeObject::Helpers
+
+ # Instantiate a command, in preparation for calling it.
+ # @param [Hash] context The runtime context to use with this command.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:230
+ def initialize(context = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command.rb:292
+ def _pry_; end
+
+ # pkg:gem/pry#lib/pry/command.rb:218
+ def _pry_=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:213
+ def arg_string; end
+
+ # pkg:gem/pry#lib/pry/command.rb:213
+ def arg_string=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:253
+ def block; end
+
+ # pkg:gem/pry#lib/pry/command.rb:211
+ def captures; end
+
+ # pkg:gem/pry#lib/pry/command.rb:211
+ def captures=(_arg0); end
+
+ # Display a warning if a command collides with a local/method in
+ # the current scope.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:329
+ def check_for_command_collision(command_match, arg_string); end
+
+ # The block we pass *into* a command so long as `:takes_block` is
+ # not equal to `false`
+ # @example
+ # my-command | do
+ # puts "block content"
+ # end
+ #
+ # pkg:gem/pry#lib/pry/command.rb:226
+ def command_block; end
+
+ # The block we pass *into* a command so long as `:takes_block` is
+ # not equal to `false`
+ # @example
+ # my-command | do
+ # puts "block content"
+ # end
+ #
+ # pkg:gem/pry#lib/pry/command.rb:226
+ def command_block=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:261
+ def command_name; end
+
+ # pkg:gem/pry#lib/pry/command.rb:257
+ def command_options; end
+
+ # pkg:gem/pry#lib/pry/command.rb:215
+ def command_set; end
+
+ # pkg:gem/pry#lib/pry/command.rb:215
+ def command_set=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:284
+ def commands; end
+
+ # Generate completions for this command
+ #
+ # @param [String] _search The line typed so far
+ # @return [Array] Completion words
+ #
+ # pkg:gem/pry#lib/pry/command.rb:411
+ def complete(_search); end
+
+ # pkg:gem/pry#lib/pry/command.rb:214
+ def context; end
+
+ # pkg:gem/pry#lib/pry/command.rb:214
+ def context=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:249
+ def description; end
+
+ # pkg:gem/pry#lib/pry/command.rb:212
+ def eval_string; end
+
+ # pkg:gem/pry#lib/pry/command.rb:212
+ def eval_string=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:216
+ def hooks; end
+
+ # pkg:gem/pry#lib/pry/command.rb:216
+ def hooks=(_arg0); end
+
+ # Revaluate the string (str) and perform interpolation.
+ # @param [String] str The string to reevaluate with interpolation.
+ #
+ # @return [String] The reevaluated string with interpolations
+ # applied (if any).
+ #
+ # pkg:gem/pry#lib/pry/command.rb:318
+ def interpolate_string(str); end
+
+ # pkg:gem/pry#lib/pry/command.rb:245
+ def match; end
+
+ # Make those properties accessible to instances
+ #
+ # pkg:gem/pry#lib/pry/command.rb:241
+ def name; end
+
+ # Properties of one execution of a command (passed by {Pry#run_command} as a hash of
+ # context and expanded in `#initialize`
+ #
+ # pkg:gem/pry#lib/pry/command.rb:209
+ def output; end
+
+ # Properties of one execution of a command (passed by {Pry#run_command} as a hash of
+ # context and expanded in `#initialize`
+ #
+ # pkg:gem/pry#lib/pry/command.rb:209
+ def output=(_arg0); end
+
+ # Process a line that Command.matches? this command.
+ # @param [String] line The line to process
+ # @return [Object, Command::VOID_VALUE]
+ #
+ # pkg:gem/pry#lib/pry/command.rb:394
+ def process_line(line); end
+
+ # pkg:gem/pry#lib/pry/command.rb:217
+ def pry_instance; end
+
+ # pkg:gem/pry#lib/pry/command.rb:217
+ def pry_instance=(_arg0); end
+
+ # Run a command from another command.
+ # @param [String] command_string The string that invokes the command
+ # @param [Array] args Further arguments to pass to the command
+ # @example
+ # run "show-input"
+ # @example
+ # run ".ls"
+ # @example
+ # run "amend-line", "5", 'puts "hello world"'
+ #
+ # pkg:gem/pry#lib/pry/command.rb:278
+ def run(command_string, *args); end
+
+ # pkg:gem/pry#lib/pry/command.rb:265
+ def source; end
+
+ # @return [Hash] Pry commands can store arbitrary state
+ # here. This state persists between subsequent command invocations.
+ # All state saved here is unique to the command, it does not
+ # need to be namespaced.
+ # @example
+ # state.my_state = "my state" # this will not conflict with any
+ # # `state.my_state` used in another command.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:309
+ def state; end
+
+ # pkg:gem/pry#lib/pry/command.rb:210
+ def target; end
+
+ # pkg:gem/pry#lib/pry/command.rb:210
+ def target=(_arg0); end
+
+ # @return [Object] The value of `self` inside the `target` binding.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:298
+ def target_self; end
+
+ # Extract necessary information from a line that Command.matches? this
+ # command.
+ #
+ # Returns an array of four elements:
+ #
+ # ```
+ # [String] the portion of the line that matched with the Command match
+ # [String] a string of all the arguments (i.e. everything but the match)
+ # [Array] the captures caught by the command_regex
+ # [Array] the arguments obtained by splitting the arg_string
+ # ```
+ #
+ # @param [String] val The line of input
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/command.rb:356
+ def tokenize(val); end
+
+ # pkg:gem/pry#lib/pry/command.rb:288
+ def void; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/command.rb:485
+ def after_hooks; end
+
+ # pkg:gem/pry#lib/pry/command.rb:481
+ def before_hooks; end
+
+ # Run the command with the given `args`.
+ #
+ # This is a public wrapper around `#call` which ensures all preconditions
+ # are met.
+ #
+ # @param [Array] args The arguments to pass to this command.
+ # @return [Object] The return value of the `#call` method, or
+ # {Command::VOID_VALUE}.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:425
+ def call_safely(*args); end
+
+ # Run the `#call` method and all the registered hooks.
+ # @param [Array] args The arguments to `#call`
+ # @return [Object] The return value from `#call`
+ #
+ # pkg:gem/pry#lib/pry/command.rb:492
+ def call_with_hooks(*args); end
+
+ # pkg:gem/pry#lib/pry/command.rb:476
+ def find_hooks(event); end
+
+ # Normalize method arguments according to its arity.
+ #
+ # @param [Integer] method
+ # @param [Array] args
+ # @return [Array] a (possibly shorter) array of the arguments to pass
+ #
+ # pkg:gem/pry#lib/pry/command.rb:509
+ def normalize_method_args(method, args); end
+
+ # Pass a block argument to a command.
+ # @param [String] arg_string The arguments (as a string) passed to the command.
+ # We inspect these for a '| do' or a '| {' and if we find it we use it
+ # to start a block input sequence. Once we have a complete
+ # block, we save it to an accessor that can be retrieved from the command context.
+ # Note that if we find the '| do' or '| {' we delete this and the
+ # elements following it from `arg_string`.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:451
+ def pass_block(arg_string); end
+
+ # pkg:gem/pry#lib/pry/command.rb:436
+ def use_unpatched_symbol; end
+
+ class << self
+ # Define or get the command's banner
+ #
+ # pkg:gem/pry#lib/pry/command.rb:61
+ def banner(arg = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command.rb:66
+ def block; end
+
+ # pkg:gem/pry#lib/pry/command.rb:30
+ def block=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:109
+ def command_name; end
+
+ # Define or get the command's options
+ #
+ # pkg:gem/pry#lib/pry/command.rb:51
+ def command_options(arg = T.unsafe(nil)); end
+
+ # Define or get the command's options
+ #
+ # pkg:gem/pry#lib/pry/command.rb:32
+ def command_options=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:165
+ def command_regex; end
+
+ # pkg:gem/pry#lib/pry/command.rb:172
+ def convert_to_regex(obj); end
+
+ # pkg:gem/pry#lib/pry/command.rb:89
+ def default_options(match); end
+
+ # Define or get the command's description
+ #
+ # pkg:gem/pry#lib/pry/command.rb:45
+ def description(arg = T.unsafe(nil)); end
+
+ # Define or get the command's description
+ #
+ # pkg:gem/pry#lib/pry/command.rb:31
+ def description=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:75
+ def doc; end
+
+ # pkg:gem/pry#lib/pry/command.rb:82
+ def file; end
+
+ # The group in which the command should be displayed in "help" output.
+ # This is usually auto-generated from directory naming, but it can be
+ # manually overridden if necessary.
+ # Group should not be changed once it is initialized.
+ #
+ # pkg:gem/pry#lib/pry/command.rb:185
+ def group(name = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command.rb:105
+ def inspect; end
+
+ # pkg:gem/pry#lib/pry/command.rb:87
+ def line; end
+
+ # pkg:gem/pry#lib/pry/command.rb:35
+ def match(arg = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command.rb:33
+ def match=(_arg0); end
+
+ # How well does this command match the given line?
+ #
+ # Higher scores are better because they imply that this command matches
+ # the line more closely.
+ #
+ # The score is calculated by taking the number of characters at the start
+ # of the string that are used only to identify the command, not as part of
+ # the arguments.
+ #
+ # @example
+ # /\.(.*)/.match_score(".foo") #=> 1
+ # /\.*(.*)/.match_score("...foo") #=> 3
+ # 'hi'.match_score("hi there") #=> 2
+ #
+ # @param [String] val A line input at the REPL
+ # @return [Fixnum]
+ #
+ # pkg:gem/pry#lib/pry/command.rb:153
+ def match_score(val); end
+
+ # Should this command be called for the given line?
+ # @param [String] val A line input at the REPL
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/command.rb:133
+ def matches?(val); end
+
+ # pkg:gem/pry#lib/pry/command.rb:101
+ def name; end
+
+ # backward compatibility
+ #
+ # pkg:gem/pry#lib/pry/command.rb:57
+ def options(arg = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command.rb:58
+ def options=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/command.rb:70
+ def source; end
+
+ # pkg:gem/pry#lib/pry/command.rb:79
+ def source_file; end
+
+ # pkg:gem/pry#lib/pry/command.rb:84
+ def source_line; end
+
+ # pkg:gem/pry#lib/pry/command.rb:202
+ def state; end
+
+ # Create a new command with the given properties.
+ # @param [String, Regex] match The thing that triggers this command
+ # @param [String] description The description to appear in `help`
+ # @param [Hash] options Behavioral options (see {Pry::CommandSet#command})
+ # @param [Module] helpers A module of helper functions to be included.
+ # @yield optional, used for BlockCommands
+ # @return [Class] (a subclass of {Pry::Command})
+ #
+ # pkg:gem/pry#lib/pry/command.rb:120
+ def subclass(match, description, options, helpers, &block); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/commands/amend_line.rb:5
+class Pry::Command::AmendLine < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:22
+ def process; end
+
+ private
+
+ # @return [String] A new string with the amendments applied to it.
+ #
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:33
+ def amend_input; end
+
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:47
+ def delete_from_array(array, range); end
+
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:51
+ def insert_into_array(array, range); end
+
+ # @return [Fixnum] The number of lines currently in `eval_string` (the
+ # input buffer)
+ #
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:62
+ def line_count; end
+
+ # The lines (or line) that will be modified by the `amend-line`.
+ # @return [Range, Fixnum] The lines or line.
+ #
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:90
+ def line_range; end
+
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:56
+ def replace_in_array(array, range); end
+
+ # Returns the (one-indexed) start and end lines given by the user.
+ # The lines in this range will be affected by the `amend-line`.
+ # Returns `nil` if no lines were specified by the user.
+ # @return [Array, nil]
+ #
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:70
+ def start_and_end_line_number; end
+
+ # Takes two numbers that are 1-indexed, and returns a range (or
+ # number) that is 0-indexed. 1-indexed means the first element is
+ # identified by 1 rather than by 0 (as is the case for Ruby arrays).
+ # @param [Fixnum] start_line_number One-indexed number.
+ # @param [Fixnum] end_line_number One-indexed number.
+ # @return [Range] The zero-indexed range.
+ #
+ # pkg:gem/pry#lib/pry/commands/amend_line.rb:83
+ def zero_indexed_range_from_one_indexed_numbers(start_line_number, end_line_number); end
+end
+
+# pkg:gem/pry#lib/pry/commands/bang.rb:5
+class Pry::Command::Bang < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/bang.rb:16
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/bang_pry.rb:5
+class Pry::Command::BangPry < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/bang_pry.rb:14
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/cat.rb:5
+class Pry::Command::Cat < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/cat.rb:53
+ def complete(search); end
+
+ # pkg:gem/pry#lib/pry/commands/cat.rb:57
+ def load_path_completions; end
+
+ # pkg:gem/pry#lib/pry/commands/cat.rb:23
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/cat.rb:38
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/cat/abstract_formatter.rb:6
+class Pry::Command::Cat::AbstractFormatter
+ include ::Pry::Helpers::OptionsHelpers
+ include ::Pry::Helpers::CommandHelpers
+ include ::Pry::Helpers::BaseHelpers
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/cat/abstract_formatter.rb:26
+ def between_lines; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/abstract_formatter.rb:18
+ def code_type; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/abstract_formatter.rb:12
+ def decorate(content); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/abstract_formatter.rb:22
+ def use_line_numbers?; end
+end
+
+# pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:6
+class Pry::Command::Cat::ExceptionFormatter < ::Pry::Command::Cat::AbstractFormatter
+ include ::Pry::Helpers::Text
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:12
+ def initialize(exception, pry_instance, opts); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:7
+ def ex; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:18
+ def format; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:8
+ def opts; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:9
+ def pry_instance; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:56
+ def backtrace_file; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:37
+ def backtrace_level; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:60
+ def backtrace_line; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:64
+ def check_for_errors; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:33
+ def code_window_size; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:78
+ def header; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:52
+ def increment_backtrace_level; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/exception_formatter.rb:71
+ def start_and_end_line_for_code_window; end
+end
+
+# pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:6
+class Pry::Command::Cat::FileFormatter < ::Pry::Command::Cat::AbstractFormatter
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:11
+ def initialize(file_with_embedded_line, pry_instance, opts); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:27
+ def file_and_line; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:7
+ def file_with_embedded_line; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:22
+ def format; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:8
+ def opts; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:9
+ def pry_instance; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:55
+ def code_type; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:43
+ def code_window_size; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:47
+ def decorate(content); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:59
+ def detect_code_type_from_file(file_name); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:35
+ def file_name; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/file_formatter.rb:39
+ def line_number; end
+end
+
+# pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:6
+class Pry::Command::Cat::InputExpressionFormatter < ::Pry::Command::Cat::AbstractFormatter
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:10
+ def initialize(input_expressions, opts); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:15
+ def format; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:7
+ def input_expressions; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:7
+ def input_expressions=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:8
+ def opts; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:8
+ def opts=(_arg0); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:42
+ def normalized_expression_range; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:37
+ def numbered_input_items; end
+
+ # pkg:gem/pry#lib/pry/commands/cat/input_expression_formatter.rb:33
+ def selected_input_items; end
+end
+
+# pkg:gem/pry#lib/pry/commands/cd.rb:5
+class Pry::Command::Cd < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/cd.rb:27
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/change_inspector.rb:5
+class Pry::Command::ChangeInspector < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/change_inspector.rb:17
+ def process(inspector); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/change_inspector.rb:28
+ def inspector_map; end
+end
+
+# pkg:gem/pry#lib/pry/commands/change_prompt.rb:5
+class Pry::Command::ChangePrompt < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/change_prompt.rb:16
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/change_prompt.rb:20
+ def process(prompt); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/change_prompt.rb:38
+ def change_prompt(prompt); end
+
+ # pkg:gem/pry#lib/pry/commands/change_prompt.rb:30
+ def list_prompts; end
+end
+
+# pkg:gem/pry#lib/pry/commands/clear_screen.rb:5
+class Pry::Command::ClearScreen < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/clear_screen.rb:10
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/code_collector.rb:5
+class Pry::Command::CodeCollector
+ include ::Pry::Helpers::OptionsHelpers
+ include ::Pry::Helpers::CommandHelpers
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:23
+ def initialize(args, opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:8
+ def args; end
+
+ # The code object
+ #
+ # @return [Pry::WrappedModule, Pry::Method, Pry::Command]
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:86
+ def code_object; end
+
+ # The content (i.e code/docs) for the selected object.
+ # If the user provided a bare code object, it returns the source.
+ # If the user provided the `-i` or `-o` switches, it returns the
+ # selected input/output lines joined as a string. If the user used
+ # `-d CODE_OBJECT` it returns the docs for that code object.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:60
+ def content; end
+
+ # The name of the explicitly given file (if any).
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:13
+ def file; end
+
+ # The name of the explicitly given file (if any).
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:13
+ def file=(_arg0); end
+
+ # The line range passed to `--lines`, converted to a 0-indexed range.
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:123
+ def line_range; end
+
+ # Name of the object argument
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:128
+ def obj_name; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:9
+ def opts; end
+
+ # The selected `pry_instance.input_ring` as a string, as specified by
+ # the `-i` switch.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:116
+ def pry_input_content; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:10
+ def pry_instance; end
+
+ # The selected `pry_instance.output_ring` as a string, as specified by
+ # the `-o` switch.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:104
+ def pry_output_content; end
+
+ # Given a string and a range, return the `range` lines of that
+ # string.
+ #
+ # @param [String] content
+ # @param [Range, Fixnum] range
+ # @return [String] The string restricted to the given range
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:96
+ def restrict_to_lines(content, range); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:134
+ def bad_option_combination?; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:153
+ def code_object_doc; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:157
+ def code_object_source_or_file; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:175
+ def convert_to_range(range); end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:171
+ def could_not_locate(name); end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:161
+ def file_content; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:139
+ def pry_array_content_as_string(array, ranges); end
+
+ class << self
+ # Add the `--lines`, `-o`, `-i`, `-s`, `-d` options.
+ #
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:30
+ def inject_options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:16
+ def input_expression_ranges; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:16
+ def input_expression_ranges=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:17
+ def output_result_ranges; end
+
+ # pkg:gem/pry#lib/pry/commands/code_collector.rb:17
+ def output_result_ranges=(_arg0); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/commands/disable_pry.rb:5
+class Pry::Command::DisablePry < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/disable_pry.rb:23
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/edit.rb:5
+class Pry::Command::Edit < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/edit.rb:91
+ def apply_runtime_patch; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:174
+ def bad_option_combination?; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:154
+ def code_object; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:107
+ def ensure_file_name_is_valid(file_name); end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:121
+ def file_and_line; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:117
+ def file_and_line_for_current_exception; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:80
+ def file_based_exception?; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:137
+ def file_edit; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:150
+ def filename_argument; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:205
+ def initial_temp_file_content; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:182
+ def input_expression; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:197
+ def never_reload?; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:27
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:170
+ def patch_exception?; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:165
+ def previously_patched?(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:217
+ def probably_a_file?(str); end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:48
+ def process; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:160
+ def pry_method?(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:201
+ def reload?(file_name = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:193
+ def reloadable?; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:71
+ def repl_edit; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:66
+ def repl_edit?; end
+
+ # pkg:gem/pry#lib/pry/commands/edit.rb:84
+ def runtime_patch?; end
+end
+
+# pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:6
+class Pry::Command::Edit::ExceptionPatcher
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:11
+ def initialize(pry_instance, state, exception_file_and_line); end
+
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:9
+ def file_and_line; end
+
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:9
+ def file_and_line=(_arg0); end
+
+ # perform the patch
+ #
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:18
+ def perform_patch; end
+
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:7
+ def pry_instance; end
+
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:7
+ def pry_instance=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:8
+ def state; end
+
+ # pkg:gem/pry#lib/pry/commands/edit/exception_patcher.rb:8
+ def state=(_arg0); end
+end
+
+# pkg:gem/pry#lib/pry/commands/edit/file_and_line_locator.rb:6
+module Pry::Command::Edit::FileAndLineLocator
+ class << self
+ # pkg:gem/pry#lib/pry/commands/edit/file_and_line_locator.rb:8
+ def from_binding(target); end
+
+ # pkg:gem/pry#lib/pry/commands/edit/file_and_line_locator.rb:16
+ def from_code_object(code_object, filename_argument); end
+
+ # pkg:gem/pry#lib/pry/commands/edit/file_and_line_locator.rb:24
+ def from_exception(exception, backtrace_level); end
+
+ # when file and line are passed as a single arg, e.g my_file.rb:30
+ #
+ # pkg:gem/pry#lib/pry/commands/edit/file_and_line_locator.rb:38
+ def from_filename_argument(filename_argument); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/commands/exit.rb:5
+class Pry::Command::Exit < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/exit.rb:25
+ def process; end
+
+ # pkg:gem/pry#lib/pry/commands/exit.rb:34
+ def process_pop_and_return; end
+end
+
+# pkg:gem/pry#lib/pry/commands/exit_all.rb:5
+class Pry::Command::ExitAll < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/exit_all.rb:18
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/exit_program.rb:5
+class Pry::Command::ExitProgram < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/exit_program.rb:18
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/find_method.rb:5
+class Pry::Command::FindMethod < ::Pry::ClassCommand
+ extend ::Pry::Helpers::BaseHelpers
+
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:31
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:36
+ def process; end
+
+ private
+
+ # Return the matched lines of method source if `-c` is given or ""
+ # if `-c` was not given
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:100
+ def additional_info(header, method); end
+
+ # Search for all methods who's implementation matches the given regex
+ # within a namespace.
+ #
+ # @param [Module] namespace The namespace to search
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:186
+ def content_search(namespace); end
+
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:108
+ def matched_method_lines(header, method); end
+
+ # Search for all methods with a name that matches the given regex
+ # within a namespace.
+ #
+ # @param [Module] namespace The namespace to search
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:174
+ def name_search(namespace); end
+
+ # @return [Regexp] The pattern to search for.
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:48
+ def pattern; end
+
+ # pretty-print a list of matching methods.
+ #
+ # @param [Array] matches
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:80
+ def print_matches(matches); end
+
+ # Print matched methods for a class
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:90
+ def print_matches_for_class(klass, grouped); end
+
+ # Run the given block against every constant in the provided namespace.
+ #
+ # @param [Module] klass The namespace in which to start the search.
+ # @param [Hash] done The namespaces we've already visited (private)
+ # @yieldparam klass Each class/module in the namespace.
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:120
+ def recurse_namespace(klass, done = T.unsafe(nil), &block); end
+
+ # Gather all the methods in a namespace that pass the given block.
+ #
+ # @param [Module] namespace The namespace in which to search.
+ # @yieldparam [Method] method The method to test
+ # @yieldreturn [Boolean]
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:150
+ def search_all_methods(namespace); end
+
+ # The class to search for methods.
+ # We only search classes, so if the search object is an
+ # instance, return its class. If no search object is given
+ # search `target_self`.
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:67
+ def search_class; end
+
+ # Output the result of the search.
+ #
+ # @param [Array] matches
+ #
+ # pkg:gem/pry#lib/pry/commands/find_method.rb:55
+ def show_search_results(matches); end
+end
+
+# pkg:gem/pry#lib/pry/commands/fix_indent.rb:5
+class Pry::Command::FixIndent < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/fix_indent.rb:15
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/help.rb:5
+class Pry::Command::Help < ::Pry::ClassCommand
+ # Get a hash of available commands grouped by the "group" name.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:29
+ def command_groups; end
+
+ # Display help for an individual command.
+ #
+ # @param [Pry::Command] command
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:125
+ def display_command(command); end
+
+ # Display help for a searched item, filtered by group
+ #
+ # @param [String] search The string to search for.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:111
+ def display_filtered_commands(search); end
+
+ # Display help for a searched item, filtered first by group
+ # and if that fails, filtered by command name.
+ #
+ # @param [String] search The string to search for.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:98
+ def display_filtered_search_results(search); end
+
+ # Display the index view, with headings and short descriptions per command.
+ #
+ # @param [Hash>] groups
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:44
+ def display_index(groups); end
+
+ # Display help for an individual command or group.
+ #
+ # @param [String] search The string to search for.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:86
+ def display_search(search); end
+
+ # pkg:gem/pry#lib/pry/commands/help.rb:159
+ def group_sort_key(group_name); end
+
+ # Given a group name and an array of commands,
+ # return the help string for those commands.
+ #
+ # @param [String] name The group name.
+ # @param [Array] commands
+ # @return [String] The generated help string.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:62
+ def help_text_for_commands(name, commands); end
+
+ # Clean search terms to make it easier to search group names
+ #
+ # @param [String] key
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:155
+ def normalize(key); end
+
+ # pkg:gem/pry#lib/pry/commands/help.rb:33
+ def process; end
+
+ # Find a subset of a hash that matches the user's search term.
+ #
+ # If there's an exact match a Hash of one element will be returned,
+ # otherwise a sub-Hash with every key that matches the search will
+ # be returned.
+ #
+ # @param [String] search the search term
+ # @param [Hash] hash the hash to search
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:137
+ def search_hash(search, hash); end
+
+ # Sort an array of commands by their `listing` name.
+ #
+ # @param [Array] commands The commands to sort
+ # @return [Array] commands sorted by listing name.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:79
+ def sorted_commands(commands); end
+
+ # @param [Hash] groups
+ # @return [Array] An array of sorted group names.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:71
+ def sorted_group_names(groups); end
+
+ # We only want to show commands that have descriptions, so that the
+ # easter eggs don't show up.
+ #
+ # pkg:gem/pry#lib/pry/commands/help.rb:20
+ def visible_commands; end
+end
+
+# pkg:gem/pry#lib/pry/commands/hist.rb:5
+class Pry::Command::Hist < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/hist.rb:25
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/hist.rb:43
+ def process; end
+
+ private
+
+ # Checks +replay_sequence+ for the presence of neighboring replay calls.
+ # @example
+ # [1] pry(main)> hist --show 46894
+ # 46894: hist --replay 46675..46677
+ # [2] pry(main)> hist --show 46675..46677
+ # 46675: 1+1
+ # 46676: a = 100
+ # 46677: hist --tail
+ # [3] pry(main)> hist --replay 46894
+ # Error: Replay index 46894 points out to another replay call:
+ # `hist -r 46675..46677`
+ # [4] pry(main)>
+ #
+ # @raise [Pry::CommandError] If +replay_sequence+ contains another
+ # "hist --replay" call
+ # @param [String] replay_sequence The sequence of commands to be replayed
+ # (per saltum)
+ # @return [Boolean] `false` if +replay_sequence+ does not contain another
+ # "hist --replay" call
+ #
+ # pkg:gem/pry#lib/pry/commands/hist.rb:143
+ def check_for_juxtaposed_replay(replay_sequence); end
+
+ # Finds history depending on the given switch.
+ #
+ # @return [Pry::Code] if it finds `--all` (or `-a`) switch, returns all
+ # entries in history. Without the switch returns only the entries from the
+ # current Pry session.
+ #
+ # pkg:gem/pry#lib/pry/commands/hist.rb:168
+ def find_history; end
+
+ # pkg:gem/pry#lib/pry/commands/hist.rb:105
+ def process_clear; end
+
+ # pkg:gem/pry#lib/pry/commands/hist.rb:78
+ def process_display; end
+
+ # pkg:gem/pry#lib/pry/commands/hist.rb:110
+ def process_replay; end
+
+ # pkg:gem/pry#lib/pry/commands/hist.rb:86
+ def process_save; end
+end
+
+# pkg:gem/pry#lib/pry/commands/import_set.rb:5
+class Pry::Command::ImportSet < ::Pry::ClassCommand
+ # TODO: resolve unused parameter.
+ #
+ # pkg:gem/pry#lib/pry/commands/import_set.rb:17
+ def process(_command_set_name); end
+end
+
+# pkg:gem/pry#lib/pry/commands/jump_to.rb:5
+class Pry::Command::JumpTo < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/jump_to.rb:14
+ def process(break_level); end
+end
+
+# pkg:gem/pry#lib/pry/commands/list_inspectors.rb:5
+class Pry::Command::ListInspectors < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/list_inspectors.rb:16
+ def process; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/list_inspectors.rb:28
+ def inspector_map; end
+
+ # pkg:gem/pry#lib/pry/commands/list_inspectors.rb:36
+ def selected_inspector?(inspector); end
+
+ # pkg:gem/pry#lib/pry/commands/list_inspectors.rb:32
+ def selected_text; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/config.rb:7
+class Pry::Command::Ls < ::Pry::ClassCommand
+ # Exclude -q, -v and --grep because they,
+ # don't specify what the user wants to see.
+ #
+ # pkg:gem/pry#lib/pry/commands/ls.rb:64
+ def no_user_opts?; end
+
+ # pkg:gem/pry#lib/pry/commands/ls.rb:31
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/ls.rb:69
+ def process; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls.rb:85
+ def error_list; end
+
+ # pkg:gem/pry#lib/pry/commands/ls.rb:105
+ def raise_errors_if_arguments_are_weird; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/config.rb:8
+class Pry::Command::Ls::Config
+ extend ::Forwardable
+ extend ::Pry::Forwardable
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:44
+ def initialize(config); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def [](*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def []=(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def builtin_global_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def builtin_global_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def ceiling; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def ceiling=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def class_constant_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def class_constant_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def class_var_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def class_var_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def constant_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def constant_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def each(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def each_pair(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def exception_constant_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def exception_constant_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def global_var_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def global_var_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def heading_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def heading_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def instance_var_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def instance_var_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def keys(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def local_var_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def local_var_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def method_missing_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def method_missing_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def private_method_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def private_method_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def protected_method_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def protected_method_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def pry_var_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def pry_var_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def pseudo_global_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def pseudo_global_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def public_method_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def public_method_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def separator; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def separator=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def to_a(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:33
+ def unloaded_constant_color; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:37
+ def unloaded_constant_color=(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:42
+ def values(*args, **_arg1, &block); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/commands/ls/config.rb:48
+ def default; end
+ end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/config.rb:11
+Pry::Command::Ls::Config::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/pry#lib/pry/commands/ls/constants.rb:6
+class Pry::Command::Ls::Constants < ::Pry::Command::Ls::Formatter
+ include ::Pry::Command::Ls::Interrogatable
+
+ # pkg:gem/pry#lib/pry/commands/ls/constants.rb:14
+ def initialize(interrogatee, no_user_opts, opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/constants.rb:23
+ def correct_opts?; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/constants.rb:27
+ def output_self; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/constants.rb:39
+ def format(mod, constants); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/constants.rb:35
+ def show_deprecated_constants?; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/constants.rb:7
+Pry::Command::Ls::Constants::DEPRECATED_CONSTANTS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/commands/ls/formatter.rb:6
+class Pry::Command::Ls::Formatter
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:10
+ def initialize(pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:7
+ def grep=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:8
+ def pry_instance; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:16
+ def write_out; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:24
+ def color(type, str); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:41
+ def correct_opts?; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:37
+ def format_value(value); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:49
+ def grep; end
+
+ # Add a new section to the output.
+ # Outputs nothing if the section would be empty.
+ #
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:30
+ def output_section(heading, body); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/formatter.rb:45
+ def output_self; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/globals.rb:6
+class Pry::Command::Ls::Globals < ::Pry::Command::Ls::Formatter
+ # pkg:gem/pry#lib/pry/commands/ls/globals.rb:24
+ def initialize(opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/globals.rb:29
+ def output_self; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/globals.rb:36
+ def format(globals); end
+end
+
+# Taken from "puts global_variables.inspect".
+#
+# pkg:gem/pry#lib/pry/commands/ls/globals.rb:8
+Pry::Command::Ls::Globals::BUILTIN_GLOBALS = T.let(T.unsafe(nil), Array)
+
+# `$SAFE` and `$?` are thread-local, the exception stuff only works in a
+# rescue clause, everything else is basically a local variable with a `$`
+# in its name.
+#
+# pkg:gem/pry#lib/pry/commands/ls/globals.rb:19
+Pry::Command::Ls::Globals::PSEUDO_GLOBALS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/commands/ls/grep.rb:6
+class Pry::Command::Ls::Grep
+ # pkg:gem/pry#lib/pry/commands/ls/grep.rb:7
+ def initialize(grep_regexp); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/grep.rb:11
+ def regexp; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/instance_vars.rb:6
+class Pry::Command::Ls::InstanceVars < ::Pry::Command::Ls::Formatter
+ include ::Pry::Command::Ls::Interrogatable
+
+ # pkg:gem/pry#lib/pry/commands/ls/instance_vars.rb:9
+ def initialize(interrogatee, no_user_opts, opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/instance_vars.rb:16
+ def correct_opts?; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/instance_vars.rb:20
+ def output_self; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/instance_vars.rb:34
+ def format(type, vars); end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/interrogatable.rb:6
+module Pry::Command::Ls::Interrogatable
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/interrogatable.rb:13
+ def interrogatee_mod; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/interrogatable.rb:9
+ def interrogating_a_module?; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/jruby_hacks.rb:6
+module Pry::Command::Ls::JRubyHacks
+ private
+
+ # When removing jruby aliases, we want to keep the alias that is
+ # "least rubbish" according to this metric.
+ #
+ # pkg:gem/pry#lib/pry/commands/ls/jruby_hacks.rb:40
+ def rubbishness(name); end
+
+ # JRuby creates lots of aliases for methods imported from java in an attempt
+ # to make life easier for ruby programmers. (e.g. getFooBar becomes
+ # get_foo_bar and foo_bar, and maybe foo_bar? if it returns a Boolean). The
+ # full transformations are in the assignAliases method of:
+ # https://github.com/jruby/jruby/blob/master/src/org/jruby/javasupport/JavaClass.java
+ #
+ # This has the unfortunate side-effect of making the output of ls even more
+ # incredibly verbose than it normally would be for these objects; and so we
+ # filter out all but the nicest of these aliases here.
+ #
+ # TODO: This is a little bit vague, better heuristics could be used.
+ # JRuby also has a lot of scala-specific logic, which we don't copy.
+ #
+ # pkg:gem/pry#lib/pry/commands/ls/jruby_hacks.rb:21
+ def trim_jruby_aliases(methods); end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/local_names.rb:6
+class Pry::Command::Ls::LocalNames < ::Pry::Command::Ls::Formatter
+ # pkg:gem/pry#lib/pry/commands/ls/local_names.rb:7
+ def initialize(no_user_opts, args, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/local_names.rb:14
+ def correct_opts?; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/local_names.rb:18
+ def output_self; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/local_names.rb:25
+ def format(locals); end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/local_vars.rb:6
+class Pry::Command::Ls::LocalVars < ::Pry::Command::Ls::Formatter
+ # pkg:gem/pry#lib/pry/commands/ls/local_vars.rb:7
+ def initialize(opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/local_vars.rb:13
+ def output_self; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/local_vars.rb:34
+ def colorized_assignment_style(lhs, rhs, desired_width = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/local_vars.rb:25
+ def format(name_value_pairs); end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:6
+class Pry::Command::Ls::LsEntity
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:9
+ def initialize(opts); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:18
+ def entities_table; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:7
+ def pry_instance; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:32
+ def constants; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:56
+ def entities; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:28
+ def globals; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:24
+ def grep(entity); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:44
+ def instance_vars; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:48
+ def local_names; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:52
+ def local_vars; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:36
+ def methods; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/ls_entity.rb:40
+ def self_methods; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/methods.rb:6
+class Pry::Command::Ls::Methods < ::Pry::Command::Ls::Formatter
+ include ::Pry::Command::Ls::Interrogatable
+ include ::Pry::Command::Ls::JRubyHacks
+ include ::Pry::Command::Ls::MethodsHelper
+
+ # pkg:gem/pry#lib/pry/commands/ls/methods.rb:10
+ def initialize(interrogatee, no_user_opts, opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/methods.rb:22
+ def output_self; end
+
+ private
+
+ # Get a lambda that can be used with `take_while` to prevent over-eager
+ # traversal of the Object's ancestry graph.
+ #
+ # pkg:gem/pry#lib/pry/commands/ls/methods.rb:41
+ def below_ceiling; end
+
+ # pkg:gem/pry#lib/pry/commands/ls/methods.rb:35
+ def correct_opts?; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/methods_helper.rb:6
+module Pry::Command::Ls::MethodsHelper
+ include ::Pry::Command::Ls::JRubyHacks
+
+ private
+
+ # Get all the methods that we'll want to output.
+ #
+ # pkg:gem/pry#lib/pry/commands/ls/methods_helper.rb:12
+ def all_methods(instance_methods = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/methods_helper.rb:34
+ def format(methods); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/methods_helper.rb:26
+ def resolution_order; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ls/self_methods.rb:6
+class Pry::Command::Ls::SelfMethods < ::Pry::Command::Ls::Formatter
+ include ::Pry::Command::Ls::Interrogatable
+ include ::Pry::Command::Ls::JRubyHacks
+ include ::Pry::Command::Ls::MethodsHelper
+
+ # pkg:gem/pry#lib/pry/commands/ls/self_methods.rb:10
+ def initialize(interrogatee, no_user_opts, opts, pry_instance); end
+
+ # pkg:gem/pry#lib/pry/commands/ls/self_methods.rb:18
+ def output_self; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/ls/self_methods.rb:28
+ def correct_opts?; end
+end
+
+# pkg:gem/pry#lib/pry/commands/nesting.rb:5
+class Pry::Command::Nesting < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/nesting.rb:14
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/play.rb:5
+class Pry::Command::Play < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/play.rb:74
+ def code_object; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:82
+ def content; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:60
+ def content_after_options; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:70
+ def content_at_expression; end
+
+ # The file to play from when no code object is specified.
+ # e.g `play --lines 4..10`
+ #
+ # pkg:gem/pry#lib/pry/commands/play.rb:92
+ def default_file; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:102
+ def file_content; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:29
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:48
+ def perform_play; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:41
+ def process; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:78
+ def should_use_default_file?; end
+
+ # pkg:gem/pry#lib/pry/commands/play.rb:53
+ def show_input; end
+end
+
+# pkg:gem/pry#lib/pry/commands/pry_backtrace.rb:5
+class Pry::Command::PryBacktrace < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/pry_backtrace.rb:22
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/raise_up.rb:6
+class Pry::Command::RaiseUp < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/raise_up.rb:27
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/reload_code.rb:5
+class Pry::Command::ReloadCode < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/reload_code.rb:20
+ def process; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/reload_code.rb:58
+ def check_for_reloadability(code_object, identifier); end
+
+ # pkg:gem/pry#lib/pry/commands/reload_code.rb:32
+ def current_file; end
+
+ # pkg:gem/pry#lib/pry/commands/reload_code.rb:42
+ def reload_current_file; end
+
+ # pkg:gem/pry#lib/pry/commands/reload_code.rb:51
+ def reload_object(identifier); end
+end
+
+# pkg:gem/pry#lib/pry/commands/reset.rb:5
+class Pry::Command::Reset < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/reset.rb:14
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/ri.rb:7
+class Pry::Command::Ri < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/ri.rb:21
+ def process(spec); end
+end
+
+# pkg:gem/pry#lib/pry/commands/save_file.rb:5
+class Pry::Command::SaveFile < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/save_file.rb:50
+ def display_content; end
+
+ # pkg:gem/pry#lib/pry/commands/save_file.rb:39
+ def file_name; end
+
+ # pkg:gem/pry#lib/pry/commands/save_file.rb:56
+ def mode; end
+
+ # pkg:gem/pry#lib/pry/commands/save_file.rb:21
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/save_file.rb:28
+ def process; end
+
+ # pkg:gem/pry#lib/pry/commands/save_file.rb:43
+ def save_file; end
+end
+
+# pkg:gem/pry#lib/pry/commands/shell_command.rb:5
+class Pry::Command::ShellCommand < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:21
+ def process(cmd); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:50
+ def cd_path_env; end
+
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:54
+ def cd_path_exists?; end
+
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:36
+ def parse_destination(dest); end
+
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:58
+ def path_from_cd_path(dest); end
+
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:43
+ def process_cd(dest); end
+
+ # pkg:gem/pry#lib/pry/commands/shell_command.rb:68
+ def special_case_path?(dest); end
+end
+
+# pkg:gem/pry#lib/pry/commands/shell_mode.rb:5
+class Pry::Command::ShellMode < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/shell_mode.rb:15
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/show_doc.rb:5
+class Pry::Command::ShowDoc < ::Pry::Command::ShowInfo
+ include ::Pry::Helpers::DocumentationHelpers
+
+ # The docs for code_object prepared for display.
+ #
+ # pkg:gem/pry#lib/pry/commands/show_doc.rb:25
+ def content_for(code_object); end
+
+ # Return docs for the code_object, adjusting for whether the code_object
+ # has yard docs available, in which case it returns those.
+ # (note we only have to check yard docs for modules since they can
+ # have multiple docs, but methods can only be doc'd once so we
+ # dont need to check them)
+ #
+ # pkg:gem/pry#lib/pry/commands/show_doc.rb:54
+ def docs_for(code_object); end
+
+ # Which sections to include in the 'header', can toggle: :owner,
+ # :signature and visibility.
+ #
+ # pkg:gem/pry#lib/pry/commands/show_doc.rb:66
+ def header_options; end
+
+ # process the markup (if necessary) and apply colors
+ #
+ # pkg:gem/pry#lib/pry/commands/show_doc.rb:34
+ def render_doc_markup_for(code_object); end
+
+ # figure out start line of docs by back-calculating based on
+ # number of lines in the comment and the start line of the code_object
+ # @return [Fixnum] start line of docs
+ #
+ # pkg:gem/pry#lib/pry/commands/show_doc.rb:73
+ def start_line_for(code_object); end
+end
+
+# pkg:gem/pry#lib/pry/commands/show_info.rb:5
+class Pry::Command::ShowInfo < ::Pry::ClassCommand
+ extend ::Pry::Helpers::BaseHelpers
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:10
+ def initialize(*_arg0); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:127
+ def code_object_header(code_object, line_num); end
+
+ # This method checks whether the `code_object` is a WrappedModule, if it
+ # is, then it returns the first candidate (monkeypatch) with accessible
+ # source (or docs). If `code_object` is not a WrappedModule (i.e a method
+ # or a command) then the `code_object` itself is just returned.
+ #
+ # @return [Pry::WrappedModule, Pry::Method, Pry::Command]
+ #
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:61
+ def code_object_with_accessible_source(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:213
+ def complete(input); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:77
+ def content_and_header_for_code_object(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:81
+ def content_and_headers_for_all_module_candidates(mod); end
+
+ # takes into account possible yard docs, and returns yard_file / yard_line
+ # Also adjusts for start line of comments (using start_line_for), which it
+ # has to infer by subtracting number of lines of comment from start line
+ # of code_object
+ #
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:205
+ def file_and_line_for(code_object); end
+
+ # Generate a header (meta-data information) for all the code
+ # object types: methods, modules, commands, procs...
+ #
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:106
+ def header(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:173
+ def header_options; end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:142
+ def method_header(code_object, line_num); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:165
+ def method_sections(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:151
+ def module_header(code_object, line_num); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:100
+ def no_definition_message; end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:185
+ def obj_name; end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:16
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:26
+ def process; end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:181
+ def show_all_modules?(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:193
+ def start_line_for(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:189
+ def use_line_numbers?; end
+
+ # pkg:gem/pry#lib/pry/commands/show_info.rb:73
+ def valid_superclass?(code_object); end
+end
+
+# pkg:gem/pry#lib/pry/commands/show_input.rb:5
+class Pry::Command::ShowInput < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/show_input.rb:15
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/show_source.rb:5
+class Pry::Command::ShowSource < ::Pry::Command::ShowInfo
+ # The source for code_object prepared for display.
+ #
+ # pkg:gem/pry#lib/pry/commands/show_source.rb:44
+ def content_for(code_object); end
+
+ # pkg:gem/pry#lib/pry/commands/show_source.rb:28
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/show_source.rb:34
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/stat.rb:5
+class Pry::Command::Stat < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/stat.rb:19
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/stat.rb:23
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/switch_to.rb:5
+class Pry::Command::SwitchTo < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/switch_to.rb:14
+ def process(selection); end
+end
+
+# pkg:gem/pry#lib/pry/commands/toggle_color.rb:5
+class Pry::Command::ToggleColor < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/toggle_color.rb:21
+ def color_toggle; end
+
+ # pkg:gem/pry#lib/pry/commands/toggle_color.rb:16
+ def process; end
+end
+
+# represents a void return value for a command
+#
+# pkg:gem/pry#lib/pry/command.rb:20
+Pry::Command::VOID_VALUE = T.let(T.unsafe(nil), Object)
+
+# pkg:gem/pry#lib/pry/commands/pry_version.rb:5
+class Pry::Command::Version < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/pry_version.rb:14
+ def process; end
+end
+
+# pkg:gem/pry#lib/pry/commands/watch_expression.rb:5
+class Pry::Command::WatchExpression < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:31
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:42
+ def process; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:91
+ def add_expression; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:96
+ def add_hook; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:59
+ def delete(index); end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:84
+ def eval_and_print_changed(output); end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:55
+ def expressions; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression.rb:69
+ def list; end
+end
+
+# pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:6
+class Pry::Command::WatchExpression::Expression
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:9
+ def initialize(pry_instance, target, source); end
+
+ # Has the value of the expression changed?
+ #
+ # We use the pretty-printed string representation to detect differences
+ # as this avoids problems with dup (causes too many differences) and ==
+ # (causes too few)
+ #
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:29
+ def changed?; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:15
+ def eval!; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:7
+ def previous_value; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:7
+ def pry_instance; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:7
+ def source; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:7
+ def target; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:20
+ def to_s; end
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:7
+ def value; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/watch_expression/expression.rb:35
+ def target_eval(target, source); end
+end
+
+# pkg:gem/pry#lib/pry/commands/whereami.rb:7
+class Pry::Command::Whereami < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:8
+ def initialize(*_arg0); end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:83
+ def bad_option_combination?; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:63
+ def code; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:77
+ def code?; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:88
+ def location; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:55
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:92
+ def process; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:44
+ def setup; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:171
+ def class_code; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:152
+ def code_window; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:144
+ def default_code; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:185
+ def expand_path(filename); end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:132
+ def handle_internal_binding; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:124
+ def marker; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:156
+ def method_code; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:116
+ def nothing_to_do?; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:140
+ def small_method?; end
+
+ # This either returns the `target_self`
+ # or it returns the class of `target_self` if `target_self` is not a class.
+ # @return [Pry::WrappedModule]
+ #
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:165
+ def target_class; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:128
+ def top_level?; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:120
+ def use_line_numbers?; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:180
+ def valid_method?; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:192
+ def window_size; end
+
+ class << self
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:15
+ def method_size_cutoff; end
+
+ # pkg:gem/pry#lib/pry/commands/whereami.rb:15
+ def method_size_cutoff=(_arg0); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/commands/wtf.rb:5
+class Pry::Command::Wtf < ::Pry::ClassCommand
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:27
+ def options(opt); end
+
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:32
+ def process; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:64
+ def format_backtrace(backtrace); end
+
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:60
+ def format_header(title, exception); end
+
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:83
+ def read_line(file, line); end
+
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:76
+ def trim_backtrace(backtrace); end
+
+ # pkg:gem/pry#lib/pry/commands/wtf.rb:48
+ def unwind_exceptions; end
+end
+
+# pkg:gem/pry#lib/pry/commands/wtf.rb:25
+Pry::Command::Wtf::RUBY_FRAME_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# CommandErrors are caught by the REPL loop and displayed to the user. They
+# indicate an exceptional condition that's fatal to the current command.
+#
+# pkg:gem/pry#lib/pry/exceptions.rb:68
+class Pry::CommandError < ::StandardError; end
+
+# This class is used to create sets of commands. Commands can be imported from
+# different sets, aliased, removed, etc.
+#
+# pkg:gem/pry#lib/pry/command_set.rb:12
+class Pry::CommandSet
+ include ::Enumerable
+ include ::Pry::Helpers::BaseHelpers
+
+ # @param [Array] imported_sets
+ # Sets which will be imported automatically
+ # @yield Optional block run to define commands
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:20
+ def initialize(*imported_sets, &block); end
+
+ # Find a command that matches the given line
+ # @param [String] pattern The line that might be a command invocation
+ # @return [Pry::Command, nil]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:275
+ def [](pattern); end
+
+ # Re-assign the command found at _pattern_ with _command_.
+ #
+ # @param [Regexp, String] pattern
+ # The command to add or replace(found at _pattern_).
+ #
+ # @param [Pry::Command] command
+ # The command to add.
+ #
+ # @return [Pry::Command]
+ # Returns the new command (matched with "pattern".)
+ #
+ # @example
+ # Pry.config.commands["help"] = MyHelpCommand
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:298
+ def []=(pattern, command); end
+
+ # Add a command to set.
+ #
+ # @param [Command] command
+ # a subclass of Pry::Command.
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:324
+ def add_command(command); end
+
+ # Aliases a command
+ # @param [String, Regex] match The match of the alias (can be a regex).
+ # @param [String] action The action to be performed (typically
+ # another command).
+ # @param [Hash] options The optional configuration parameters,
+ # accepts the same as the `command` method, but also allows the
+ # command description to be passed this way too as `:desc`
+ # @example Creating an alias for `ls -M`
+ # Pry.config.commands.alias_command "lM", "ls -M"
+ # @example Pass explicit description (overriding default).
+ # Pry.config.commands.alias_command "lM", "ls -M", :desc => "cutiepie"
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:190
+ def alias_command(match, action, options = T.unsafe(nil)); end
+
+ # Defines a new Pry command.
+ # @param [String, Regexp] match The start of invocations of this command.
+ # @param [String] description A description of the command.
+ # @param [Hash] options The optional configuration parameters.
+ # @option options [Boolean] :keep_retval Whether or not to use return value
+ # of the block for return of `command` or just to return `nil`
+ # (the default).
+ # @option options [Boolean] :interpolate Whether string #{} based
+ # interpolation is applied to the command arguments before
+ # executing the command. Defaults to true.
+ # @option options [String] :listing The listing name of the
+ # command. That is the name by which the command is looked up by
+ # help and by show-source. Necessary for commands with regex matches.
+ # @option options [Boolean] :use_prefix Whether the command uses
+ # `Pry.config.command_prefix` prefix (if one is defined). Defaults
+ # to true.
+ # @option options [Boolean] :shellwords Whether the command's arguments
+ # should be split using Shellwords instead of just split on spaces.
+ # Defaults to true.
+ # @yield The action to perform. The parameters in the block
+ # determines the parameters the command will receive. All
+ # parameters passed into the block will be strings. Successive
+ # command parameters are separated by whitespace at the Pry prompt.
+ # @example
+ # MyCommands = Pry::CommandSet.new do
+ # command "greet", "Greet somebody" do |name|
+ # puts "Good afternoon #{name.capitalize}!"
+ # end
+ # end
+ #
+ # # From pry:
+ # # pry(main)> pry_instance.commands = MyCommands
+ # # pry(main)> greet john
+ # # Good afternoon John!
+ # # pry(main)> help greet
+ # # Greet somebody
+ # @example Regexp command
+ # MyCommands = Pry::CommandSet.new do
+ # command(
+ # /number-(\d+)/, "number-N regex command", :listing => "number"
+ # ) do |num, name|
+ # puts "hello #{name}, nice number: #{num}"
+ # end
+ # end
+ #
+ # # From pry:
+ # # pry(main)> pry_instance.commands = MyCommands
+ # # pry(main)> number-10 john
+ # # hello john, nice number: 10
+ # # pry(main)> help number
+ # # number-N regex command
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:78
+ def block_command(match, description = T.unsafe(nil), options = T.unsafe(nil), &block); end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:89
+ def command(match, description = T.unsafe(nil), options = T.unsafe(nil), &block); end
+
+ # Generate completions for the user's search.
+ # @param [String] search The line to search for
+ # @param [Hash] context The context to create the command with
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:365
+ def complete(search, context = T.unsafe(nil)); end
+
+ # Defines a new Pry command class.
+ #
+ # @param [String, Regexp] match The start of invocations of this command.
+ # @param [String] description A description of the command.
+ # @param [Hash] options The optional configuration parameters, see {#command}
+ # @yield The class body's definition.
+ #
+ # @example
+ # Pry::Commands.create_command "echo", "echo's the input", :shellwords => false do
+ # def options(opt)
+ # opt.banner "Usage: echo [-u | -d] "
+ # opt.on :u, :upcase, "ensure the output is all upper-case"
+ # opt.on :d, :downcase, "ensure the output is all lower-case"
+ # end
+ #
+ # def process
+ # if opts.present?(:u) && opts.present?(:d)
+ # raise Pry::CommandError, "-u and -d makes no sense"
+ # end
+ # result = args.join(" ")
+ # result.downcase! if opts.present?(:downcase)
+ # result.upcase! if opts.present?(:upcase)
+ # output.puts result
+ # end
+ # end
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:117
+ def create_command(match, description = T.unsafe(nil), options = T.unsafe(nil), &block); end
+
+ # Removes some commands from the set
+ # @param [Array] searches the matches or listings of the commands
+ # to remove
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:138
+ def delete(*searches); end
+
+ # Sets or gets the description for a command (replacing the old
+ # description). Returns current description if no description
+ # parameter provided.
+ # @param [String, Regexp] search The command match.
+ # @param [String?] description (nil) The command description.
+ # @example Setting
+ # MyCommands = Pry::CommandSet.new do
+ # desc "help", "help description"
+ # end
+ # @example Getting
+ # Pry.config.commands.desc "amend-line"
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:253
+ def desc(search, description = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:131
+ def each(&block); end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:281
+ def find_command(pattern); end
+
+ # @param [String, Regexp] match_or_listing The match or listing of a command.
+ # of the command to retrieve.
+ # @return [Command] The command object matched.
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:173
+ def find_command_by_match_or_listing(match_or_listing); end
+
+ # Find the command that the user might be trying to refer to.
+ # @param [String] search The user's search.
+ # @return [Pry::Command?]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:331
+ def find_command_for_help(search); end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:15
+ def helper_module; end
+
+ # Imports all the commands from one or more sets.
+ # @param [Array] sets Command sets, all of the commands of which
+ # will be imported.
+ # @return [Pry::CommandSet] Returns the receiver (a command set).
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:149
+ def import(*sets); end
+
+ # Imports some commands from a set
+ # @param [CommandSet] set Set to import commands from
+ # @param [Array] matches Commands to import
+ # @return [Pry::CommandSet] Returns the receiver (a command set).
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:161
+ def import_from(set, *matches); end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:265
+ def keys; end
+
+ # @return [Array]
+ # The list of commands provided by the command set.
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:262
+ def list_commands; end
+
+ # Process the given line to see whether it needs executing as a command.
+ # @param [String] val The line to execute
+ # @param [Hash] context The context to execute the commands with
+ # @return [CommandSet::Result]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:351
+ def process_line(val, context = T.unsafe(nil)); end
+
+ # Rename a command. Accepts either match or listing for the search.
+ #
+ # @param [String, Regexp] new_match The new match for the command.
+ # @param [String, Regexp] search The command's current match or listing.
+ # @param [Hash] options The optional configuration parameters,
+ # accepts the same as the `command` method, but also allows the
+ # command description to be passed this way too.
+ # @example Renaming the `ls` command and changing its description.
+ # Pry.config.commands.rename "dir", "ls", :description => "DOS friendly ls"
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:227
+ def rename_command(new_match, search, options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:270
+ def to_h; end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:267
+ def to_hash; end
+
+ # Is the given line a command invocation?
+ # @param [String] val
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:343
+ def valid_command?(val); end
+
+ private
+
+ # Defines helpers methods for this command sets.
+ # Those helpers are only defined in this command set.
+ #
+ # @yield A block defining helper methods
+ # @example
+ # helpers do
+ # def hello
+ # puts "Hello!"
+ # end
+ #
+ # include OtherModule
+ # end
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:390
+ def helpers(&block); end
+end
+
+# CommandState is a data structure to hold per-command state.
+#
+# Pry commands can store arbitrary state here. This state persists between
+# subsequent command invocations. All state saved here is unique to the
+# command.
+#
+# @since v0.13.0
+# @api private
+#
+# pkg:gem/pry#lib/pry/command_state.rb:12
+class Pry::CommandState
+ # pkg:gem/pry#lib/pry/command_state.rb:17
+ def initialize; end
+
+ # pkg:gem/pry#lib/pry/command_state.rb:25
+ def reset(command_class); end
+
+ # pkg:gem/pry#lib/pry/command_state.rb:21
+ def state_for(command_class); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/command_state.rb:31
+ def command_struct(command_class); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/command_state.rb:13
+ def default; end
+ end
+end
+
+# pkg:gem/pry#lib/pry.rb:35
+Pry::Commands = T.let(T.unsafe(nil), Pry::CommandSet)
+
+# @api private
+#
+# pkg:gem/pry#lib/pry/config/attributable.rb:4
+class Pry::Config
+ extend ::Pry::Config::Attributable
+
+ # pkg:gem/pry#lib/pry/config.rb:151
+ def initialize; end
+
+ # pkg:gem/pry#lib/pry/config.rb:224
+ def [](attr); end
+
+ # pkg:gem/pry#lib/pry/config.rb:220
+ def []=(attr, value); end
+
+ # pkg:gem/pry#lib/pry/config.rb:109
+ def auto_indent; end
+
+ # pkg:gem/pry#lib/pry/config.rb:109
+ def auto_indent=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:116
+ def collision_warning; end
+
+ # pkg:gem/pry#lib/pry/config.rb:116
+ def collision_warning=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:59
+ def color; end
+
+ # pkg:gem/pry#lib/pry/config.rb:59
+ def color=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:132
+ def command_completions; end
+
+ # pkg:gem/pry#lib/pry/config.rb:132
+ def command_completions=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:56
+ def command_prefix; end
+
+ # pkg:gem/pry#lib/pry/config.rb:56
+ def command_prefix=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:16
+ def commands; end
+
+ # pkg:gem/pry#lib/pry/config.rb:16
+ def commands=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:122
+ def completer; end
+
+ # pkg:gem/pry#lib/pry/config.rb:122
+ def completer=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:249
+ def control_d_handler; end
+
+ # pkg:gem/pry#lib/pry/config.rb:250
+ def control_d_handler=(value); end
+
+ # pkg:gem/pry#lib/pry/config.rb:112
+ def correct_indent; end
+
+ # pkg:gem/pry#lib/pry/config.rb:112
+ def correct_indent=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:29
+ def default_window_size; end
+
+ # pkg:gem/pry#lib/pry/config.rb:29
+ def default_window_size=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:77
+ def disable_auto_reload; end
+
+ # pkg:gem/pry#lib/pry/config.rb:77
+ def disable_auto_reload=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:51
+ def editor; end
+
+ # pkg:gem/pry#lib/pry/config.rb:51
+ def editor=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:22
+ def exception_handler; end
+
+ # pkg:gem/pry#lib/pry/config.rb:22
+ def exception_handler=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:142
+ def exec_string; end
+
+ # pkg:gem/pry#lib/pry/config.rb:142
+ def exec_string=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:119
+ def extra_sticky_locals; end
+
+ # pkg:gem/pry#lib/pry/config.rb:119
+ def extra_sticky_locals=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:135
+ def file_completions; end
+
+ # pkg:gem/pry#lib/pry/config.rb:135
+ def file_completions=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:85
+ def history; end
+
+ # pkg:gem/pry#lib/pry/config.rb:85
+ def history=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:94
+ def history_file; end
+
+ # pkg:gem/pry#lib/pry/config.rb:94
+ def history_file=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:97
+ def history_ignorelist; end
+
+ # pkg:gem/pry#lib/pry/config.rb:97
+ def history_ignorelist=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:91
+ def history_load; end
+
+ # pkg:gem/pry#lib/pry/config.rb:91
+ def history_load=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:88
+ def history_save; end
+
+ # pkg:gem/pry#lib/pry/config.rb:88
+ def history_save=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:32
+ def hooks; end
+
+ # pkg:gem/pry#lib/pry/config.rb:32
+ def hooks=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:10
+ def input; end
+
+ # pkg:gem/pry#lib/pry/config.rb:10
+ def input=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:138
+ def ls; end
+
+ # pkg:gem/pry#lib/pry/config.rb:138
+ def ls=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:103
+ def memory_size; end
+
+ # pkg:gem/pry#lib/pry/config.rb:103
+ def memory_size=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:216
+ def merge(config_hash); end
+
+ # pkg:gem/pry#lib/pry/config.rb:211
+ def merge!(config_hash); end
+
+ # pkg:gem/pry#lib/pry/config.rb:229
+ def method_missing(method_name, *args, &_block); end
+
+ # pkg:gem/pry#lib/pry/config.rb:65
+ def multiline; end
+
+ # pkg:gem/pry#lib/pry/config.rb:65
+ def multiline=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:13
+ def output; end
+
+ # pkg:gem/pry#lib/pry/config.rb:13
+ def output=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:145
+ def output_prefix; end
+
+ # pkg:gem/pry#lib/pry/config.rb:145
+ def output_prefix=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:62
+ def pager; end
+
+ # pkg:gem/pry#lib/pry/config.rb:62
+ def pager=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:19
+ def print; end
+
+ # pkg:gem/pry#lib/pry/config.rb:19
+ def print=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:35
+ def prompt; end
+
+ # pkg:gem/pry#lib/pry/config.rb:35
+ def prompt=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:38
+ def prompt_name; end
+
+ # pkg:gem/pry#lib/pry/config.rb:38
+ def prompt_name=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:42
+ def prompt_safe_contexts; end
+
+ # pkg:gem/pry#lib/pry/config.rb:42
+ def prompt_safe_contexts=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:125
+ def quiet; end
+
+ # pkg:gem/pry#lib/pry/config.rb:125
+ def quiet=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:149
+ def rc_file; end
+
+ # pkg:gem/pry#lib/pry/config.rb:149
+ def rc_file=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:100
+ def requires; end
+
+ # pkg:gem/pry#lib/pry/config.rb:100
+ def requires=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:71
+ def should_load_local_rc; end
+
+ # pkg:gem/pry#lib/pry/config.rb:71
+ def should_load_local_rc=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:68
+ def should_load_rc; end
+
+ # pkg:gem/pry#lib/pry/config.rb:68
+ def should_load_rc=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:74
+ def should_load_requires; end
+
+ # pkg:gem/pry#lib/pry/config.rb:74
+ def should_load_requires=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:82
+ def should_trap_interrupts; end
+
+ # pkg:gem/pry#lib/pry/config.rb:82
+ def should_trap_interrupts=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:106
+ def system; end
+
+ # pkg:gem/pry#lib/pry/config.rb:106
+ def system=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:25
+ def unrescued_exceptions; end
+
+ # pkg:gem/pry#lib/pry/config.rb:25
+ def unrescued_exceptions=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/config.rb:129
+ def windows_console_warning; end
+
+ # pkg:gem/pry#lib/pry/config.rb:129
+ def windows_console_warning=(_arg0); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/config.rb:279
+ def choose_input; end
+
+ # pkg:gem/pry#lib/pry/config.rb:310
+ def default_rc_file; end
+
+ # pkg:gem/pry#lib/pry/config.rb:244
+ def initialize_dup(other); end
+
+ # pkg:gem/pry#lib/pry/config.rb:289
+ def load_readline; end
+
+ # pkg:gem/pry#lib/pry/config.rb:240
+ def respond_to_missing?(method_name, include_all = T.unsafe(nil)); end
+end
+
+# Attributable provides the ability to create "attribute"
+# accessors. Attribute accessors create a standard "attr_writer" and a
+# customised "attr_reader". This reader is Proc-aware (lazy).
+#
+# @since v0.13.0
+# @api private
+#
+# pkg:gem/pry#lib/pry/config/attributable.rb:11
+module Pry::Config::Attributable
+ # pkg:gem/pry#lib/pry/config/attributable.rb:12
+ def attribute(attr_name); end
+end
+
+# LazyValue is a Proc (block) wrapper. It is meant to be used as a
+# configuration value. Subsequent `#call` calls always evaluate the given
+# block.
+#
+# @example
+# num = 19
+# value = Pry::Config::LazyValue.new { num += 1 }
+# value.foo # => 20
+# value.foo # => 21
+# value.foo # => 22
+#
+# @api private
+# @since v0.13.0
+# @see Pry::Config::MemoizedValue
+#
+# pkg:gem/pry#lib/pry/config/lazy_value.rb:19
+class Pry::Config::LazyValue
+ # pkg:gem/pry#lib/pry/config/lazy_value.rb:20
+ def initialize(&block); end
+
+ # pkg:gem/pry#lib/pry/config/lazy_value.rb:24
+ def call; end
+end
+
+# MemoizedValue is a Proc (block) wrapper. It is meant to be used as a
+# configuration value. Subsequent `#call` calls return the same memoized
+# result.
+#
+# @example
+# num = 19
+# value = Pry::Config::MemoizedValue.new { num += 1 }
+# value.call # => 20
+# value.call # => 20
+# value.call # => 20
+#
+# @api private
+# @since v0.13.0
+# @see Pry::Config::LazyValue
+#
+# pkg:gem/pry#lib/pry/config/memoized_value.rb:19
+class Pry::Config::MemoizedValue
+ # pkg:gem/pry#lib/pry/config/memoized_value.rb:20
+ def initialize(&block); end
+
+ # pkg:gem/pry#lib/pry/config/memoized_value.rb:26
+ def call; end
+end
+
+# Value holds a value for the given attribute and decides how it should
+# be read. Procs get called, other values are returned as is.
+#
+# @since v0.13.0
+# @api private
+#
+# pkg:gem/pry#lib/pry/config/value.rb:10
+class Pry::Config::Value
+ # pkg:gem/pry#lib/pry/config/value.rb:11
+ def initialize(value); end
+
+ # pkg:gem/pry#lib/pry/config/value.rb:15
+ def call; end
+end
+
+# @api private
+# @since v0.13.0
+#
+# pkg:gem/pry#lib/pry/control_d_handler.rb:6
+module Pry::ControlDHandler
+ class << self
+ # Deal with the ^D key being pressed. Different behaviour in different
+ # cases:
+ # 1. In an expression behave like `!` command.
+ # 2. At top-level session behave like `exit` command.
+ # 3. In a nested session behave like `cd ..`.
+ #
+ # pkg:gem/pry#lib/pry/control_d_handler.rb:12
+ def default(pry_instance); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/pry_instance.rb:58
+Pry::EMPTY_COMPLETIONS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/editor.rb:6
+class Pry::Editor
+ include ::Pry::Helpers::OptionsHelpers
+ include ::Pry::Helpers::CommandHelpers
+
+ # pkg:gem/pry#lib/pry/editor.rb:27
+ def initialize(pry_instance); end
+
+ # Generate the string that's used to start the editor. This includes
+ # all the flags we want as well as the file and line number we
+ # want to open at.
+ #
+ # pkg:gem/pry#lib/pry/editor.rb:60
+ def build_editor_invocation_string(file, line, blocking); end
+
+ # pkg:gem/pry#lib/pry/editor.rb:31
+ def edit_tempfile_with_content(initial_content, line = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/editor.rb:41
+ def invoke_editor(file, line, blocking = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/editor.rb:25
+ def pry_instance; end
+
+ private
+
+ # Some editors that run outside the terminal allow you to control whether or
+ # not to block the process from which they were launched (in this case, Pry).
+ # For those editors, return the flag that produces the desired behavior.
+ #
+ # pkg:gem/pry#lib/pry/editor.rb:100
+ def blocking_flag_for_editor(blocking); end
+
+ # Get the name of the binary that Pry.config.editor points to.
+ #
+ # This is useful for deciding which flags we pass to the editor as
+ # we can just use the program's name and ignore any absolute paths.
+ #
+ # @example
+ # Pry.config.editor="/home/conrad/bin/textmate -w"
+ # editor_name
+ # # => textmate
+ #
+ # pkg:gem/pry#lib/pry/editor.rb:153
+ def editor_name; end
+
+ # Start the editor running, using the calculated invocation string
+ #
+ # pkg:gem/pry#lib/pry/editor.rb:76
+ def open_editor(editor_invocation); end
+
+ # We need JRuby specific code here cos just shelling out using
+ # system() appears to be pretty broken :/
+ #
+ # pkg:gem/pry#lib/pry/editor.rb:89
+ def open_editor_on_jruby(editor_invocation); end
+
+ # Return the syntax for a given editor for starting the editor
+ # and moving to a particular line within that file
+ #
+ # pkg:gem/pry#lib/pry/editor.rb:115
+ def start_line_syntax_for_editor(file_name, line_number); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/editor.rb:7
+ def default; end
+ end
+end
+
+# Env is a helper module to work with environment variables.
+#
+# @since v0.13.0
+# @api private
+#
+# pkg:gem/pry#lib/pry/env.rb:8
+module Pry::Env
+ class << self
+ # pkg:gem/pry#lib/pry/env.rb:9
+ def [](key); end
+ end
+end
+
+# @api private
+# @since v0.13.0
+#
+# pkg:gem/pry#lib/pry/exception_handler.rb:6
+module Pry::ExceptionHandler
+ class << self
+ # Will only show the first line of the backtrace.
+ #
+ # pkg:gem/pry#lib/pry/exception_handler.rb:9
+ def handle_exception(output, exception, _pry_instance); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/exception_handler.rb:42
+ def cause_text(cause); end
+
+ # pkg:gem/pry#lib/pry/exception_handler.rb:32
+ def exception_text(exception); end
+
+ # pkg:gem/pry#lib/pry/exception_handler.rb:19
+ def standard_error_text_for(exception); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/forwardable.rb:4
+module Pry::Forwardable
+ include ::Forwardable
+
+ # Since Ruby 2.4, Forwardable will print a warning when
+ # calling a method that is private on a delegate, and
+ # in the future it could be an error: https://bugs.ruby-lang.org/issues/12782#note-3
+ #
+ # That's why we revert to a custom implementation for delegating one
+ # private method to another.
+ #
+ # pkg:gem/pry#lib/pry/forwardable.rb:16
+ def def_private_delegators(target, *private_delegates); end
+end
+
+# When we try to get a binding for an object, we try to define a method on
+# that Object's singleton class. This doesn't work for "frozen" Object's, and
+# the exception is just a vanilla RuntimeError.
+#
+# pkg:gem/pry#lib/pry/exceptions.rb:56
+module Pry::FrozenObjectException
+ class << self
+ # pkg:gem/pry#lib/pry/exceptions.rb:57
+ def ===(exception); end
+ end
+end
+
+# @return [Boolean] true if this Ruby supports safe levels and tainting,
+# to guard against using deprecated or unsupported features
+#
+# pkg:gem/pry#lib/pry/pry_class.rb:11
+Pry::HAS_SAFE_LEVEL = T.let(T.unsafe(nil), FalseClass)
+
+# pkg:gem/pry#lib/pry/helpers/base_helpers.rb:4
+module Pry::Helpers
+ class << self
+ # pkg:gem/pry#lib/pry/helpers/table.rb:27
+ def tablify(things, line_length, pry_instance = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:5
+ def tablify_or_one_line(heading, things, pry_instance = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:16
+ def tablify_to_screen_width(things, options, pry_instance = T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/helpers/base_helpers.rb:5
+module Pry::Helpers::BaseHelpers
+ extend ::Pry::Helpers::BaseHelpers
+
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:43
+ def colorize_code(code); end
+
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:27
+ def find_command(name, set = T.unsafe(nil)); end
+
+ # formatting
+ #
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:54
+ def heading(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:47
+ def highlight(string, regexp, highlight_color = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:34
+ def not_a_real_file?(file); end
+
+ # Acts like send but ignores any methods defined below Object or Class in the
+ # inheritance hierarchy.
+ # This is required to introspect methods on objects like Net::HTTP::Get that
+ # have overridden the `method` method.
+ #
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:22
+ def safe_send(obj, method, *args, &block); end
+
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:8
+ def silence_warnings; end
+
+ # Send the given text through the best available pager (if Pry.config.pager is
+ # enabled). Infers where to send the output if used as a mixin.
+ # DEPRECATED.
+ #
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:62
+ def stagger_output(text, _out = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/base_helpers.rb:38
+ def use_ansi_codes?; end
+end
+
+# pkg:gem/pry#lib/pry/helpers/command_helpers.rb:7
+module Pry::Helpers::CommandHelpers
+ include ::Pry::Helpers::OptionsHelpers
+ extend ::Pry::Helpers::OptionsHelpers
+ extend ::Pry::Helpers::CommandHelpers
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:115
+ def absolute_index_number(line_number, array_length); end
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:123
+ def absolute_index_range(range_or_number, array_length); end
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:31
+ def get_method_or_raise(method_name, context, opts = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:21
+ def internal_binding?(context); end
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:97
+ def one_index_number(line_number); end
+
+ # convert a 1-index range to a 0-indexed one
+ #
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:102
+ def one_index_range(range); end
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:106
+ def one_index_range_or_number(range_or_number); end
+
+ # Restrict a string to the given range of lines (1-indexed)
+ # @param [String] content The string.
+ # @param [Range, Integer] lines The line(s) to restrict it to.
+ # @return [String] The resulting string.
+ #
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:92
+ def restrict_to_lines(content, lines); end
+
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:135
+ def set_file_and_dir_locals(file_name, pry = T.unsafe(nil), ctx = T.unsafe(nil)); end
+
+ # Open a temp file and yield it to the block, closing it after
+ # @return [String] The path of the temp file
+ #
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:14
+ def temp_file(ext = T.unsafe(nil)); end
+
+ # Remove any common leading whitespace from every line in `text`. This
+ # can be used to make a HEREDOC line up with the left margin, without
+ # sacrificing the indentation level of the source code.
+ #
+ # @example
+ # opt.banner(unindent(<<-USAGE))
+ # Lorem ipsum dolor sit amet, consectetur adipisicing elit,
+ # sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.
+ # "Ut enim ad minim veniam."
+ # USAGE
+ #
+ # @param [String] dirty_text The text from which to remove indentation
+ # @return [String] the text with indentation stripped
+ #
+ # pkg:gem/pry#lib/pry/helpers/command_helpers.rb:68
+ def unindent(dirty_text, left_padding = T.unsafe(nil)); end
+end
+
+# This class contains methods useful for extracting
+# documentation from methods and classes.
+#
+# pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:7
+module Pry::Helpers::DocumentationHelpers
+ private
+
+ # Given a string that makes up a comment in a source-code file parse out the content
+ # that the user is intended to read. (i.e. without leading indentation, #-characters
+ # or shebangs)
+ #
+ # @param [String] comment
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:67
+ def get_comment_content(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:51
+ def process_comment_markup(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:15
+ def process_rdoc(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:45
+ def process_yardoc(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:30
+ def process_yardoc_tag(comment, tag); end
+
+ # @param [String] code
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:57
+ def strip_comments_from_c_code(code); end
+
+ # @param [String] text
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:79
+ def strip_leading_whitespace(text); end
+
+ class << self
+ # Given a string that makes up a comment in a source-code file parse out the content
+ # that the user is intended to read. (i.e. without leading indentation, #-characters
+ # or shebangs)
+ #
+ # @param [String] comment
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:67
+ def get_comment_content(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:51
+ def process_comment_markup(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:15
+ def process_rdoc(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:45
+ def process_yardoc(comment); end
+
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:30
+ def process_yardoc_tag(comment, tag); end
+
+ # @param [String] code
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:57
+ def strip_comments_from_c_code(code); end
+
+ # @param [String] text
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:79
+ def strip_leading_whitespace(text); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/helpers/documentation_helpers.rb:8
+Pry::Helpers::DocumentationHelpers::YARD_TAGS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/helpers/options_helpers.rb:5
+module Pry::Helpers::OptionsHelpers
+ private
+
+ # Get the method object parsed by the slop instance
+ #
+ # pkg:gem/pry#lib/pry/helpers/options_helpers.rb:23
+ def method_object; end
+
+ # Add method options to the Pry::Slop instance
+ #
+ # pkg:gem/pry#lib/pry/helpers/options_helpers.rb:9
+ def method_options(opt); end
+
+ class << self
+ # Get the method object parsed by the slop instance
+ #
+ # pkg:gem/pry#lib/pry/helpers/options_helpers.rb:23
+ def method_object; end
+
+ # Add method options to the Pry::Slop instance
+ #
+ # pkg:gem/pry#lib/pry/helpers/options_helpers.rb:9
+ def method_options(opt); end
+ end
+end
+
+# Contains methods for querying the platform that Pry is running on
+# @api public
+# @since v0.12.0
+#
+# pkg:gem/pry#lib/pry/helpers/platform.rb:10
+module Pry::Helpers::Platform
+ class << self
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:35
+ def jruby?; end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:40
+ def jruby_19?; end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:17
+ def linux?; end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:12
+ def mac_osx?; end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:45
+ def mri?; end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:50
+ def mri_2?; end
+
+ # @return [Boolean] true when Pry is running on Windows with ANSI support,
+ # false otherwise
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:23
+ def windows?; end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/helpers/platform.rb:28
+ def windows_ansi?; end
+ end
+end
+
+# pkg:gem/pry#lib/pry/helpers/table.rb:35
+class Pry::Helpers::Table
+ # pkg:gem/pry#lib/pry/helpers/table.rb:37
+ def initialize(items, args, pry_instance = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:81
+ def ==(other); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:36
+ def column_count; end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:68
+ def column_count=(count); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:77
+ def columns; end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:73
+ def fits_on_line?(line_length); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:36
+ def items; end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:62
+ def items=(items); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:47
+ def rows_to_s(style = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:85
+ def to_a; end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:43
+ def to_s; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:91
+ def _max_width(things); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:95
+ def _rebuild_colorless_cache; end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:116
+ def _recall_color_for(thing); end
+
+ # pkg:gem/pry#lib/pry/helpers/table.rb:105
+ def _recolumn; end
+end
+
+# The methods defined on {Text} are available to custom commands via
+# {Pry::Command#text}.
+#
+# pkg:gem/pry#lib/pry/helpers/text.rb:7
+module Pry::Helpers::Text
+ extend ::Pry::Helpers::Text
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def black_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def blue_on_yellow(text); end
+
+ # Returns _text_ as bold text for use on a terminal.
+ #
+ # @param [String, #to_s] text
+ # @return [String] _text_
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:54
+ def bold(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_black_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_blue_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_cyan_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_green_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_magenta_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_purple_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_red_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_white_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:27
+ def bright_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:36
+ def bright_yellow_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def cyan_on_yellow(text); end
+
+ # Returns `text` in the default foreground colour.
+ # Use this instead of "black" or "white" when you mean absence of colour.
+ #
+ # @param [String, #to_s] text
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:63
+ def default(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def green_on_yellow(text); end
+
+ # Returns _text_ indented by _chars_ spaces.
+ #
+ # @param [String] text
+ # @param [Fixnum] chars
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:113
+ def indent(text, chars); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def magenta_on_yellow(text); end
+
+ # @yield
+ # Yields a block with color turned off.
+ #
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:73
+ def no_color; end
+
+ # @yield
+ # Yields a block with paging turned off.
+ #
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:87
+ def no_pager; end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def purple_on_yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def red_on_yellow(text); end
+
+ # Remove any color codes from _text_.
+ #
+ # @param [String, #to_s] text
+ # @return [String] _text_ stripped of any color codes.
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:46
+ def strip_color(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def white_on_yellow(text); end
+
+ # Returns _text_ in a numbered list, beginning at _offset_.
+ #
+ # @param [#each_line] text
+ # @param [Fixnum] offset
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/helpers/text.rb:100
+ def with_line_numbers(text, offset, color = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:23
+ def yellow(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_black(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_blue(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_cyan(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_green(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_magenta(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_purple(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_red(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_white(text); end
+
+ # pkg:gem/pry#lib/pry/helpers/text.rb:32
+ def yellow_on_yellow(text); end
+end
+
+# pkg:gem/pry#lib/pry/helpers/text.rb:10
+Pry::Helpers::Text::COLORS = T.let(T.unsafe(nil), Hash)
+
+# The History class is responsible for maintaining the user's input history,
+# both internally and within Readline.
+#
+# pkg:gem/pry#lib/pry/history.rb:6
+class Pry::History
+ # pkg:gem/pry#lib/pry/history.rb:29
+ def initialize(options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/history.rb:70
+ def <<(line); end
+
+ # Clear this session's history. This won't affect the contents of the
+ # history file.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:74
+ def clear; end
+
+ # Filter the history with the histignore options
+ # @return [Array] An array containing all the lines that are not
+ # included in the histignore.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:95
+ def filter(history); end
+
+ # @return [Integer] total number of lines, including original lines
+ #
+ # pkg:gem/pry#lib/pry/history.rb:27
+ def history_line_count; end
+
+ # Load the input history using `History.loader`.
+ # @return [Integer] The number of lines loaded
+ #
+ # pkg:gem/pry#lib/pry/history.rb:40
+ def load; end
+
+ # pkg:gem/pry#lib/pry/history.rb:21
+ def loader; end
+
+ # pkg:gem/pry#lib/pry/history.rb:21
+ def loader=(_arg0); end
+
+ # @return [Fixnum] Number of lines in history when Pry first loaded.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:24
+ def original_lines; end
+
+ # Add a line to the input history, ignoring blank and duplicate lines.
+ # @param [String] line
+ # @return [String] The same line that was passed in
+ #
+ # pkg:gem/pry#lib/pry/history.rb:53
+ def push(line); end
+
+ # pkg:gem/pry#lib/pry/history.rb:21
+ def saver; end
+
+ # pkg:gem/pry#lib/pry/history.rb:21
+ def saver=(_arg0); end
+
+ # @return [Fixnum] The number of lines in history from just this session.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:81
+ def session_line_count; end
+
+ # Return an Array containing all stored history.
+ # @return [Array] An Array containing all lines of history loaded
+ # or entered by the user in the current session.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:88
+ def to_a; end
+
+ private
+
+ # The history file, opened for appending.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:127
+ def history_file; end
+
+ # pkg:gem/pry#lib/pry/history.rb:143
+ def history_file_path; end
+
+ # pkg:gem/pry#lib/pry/history.rb:147
+ def invalid_readline_line?(line); end
+
+ # The default loader. Yields lines from `Pry.config.history_file`.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:113
+ def read_from_file; end
+
+ # The default saver. Appends the given line to `Pry.config.history_file`.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:122
+ def save_to_file(line); end
+
+ # Check if the line match any option in the histignore
+ # [Pry.config.history_ignorelist]
+ # @return [Boolean] a boolean that notifies if the line was found in the
+ # histignore array.
+ #
+ # pkg:gem/pry#lib/pry/history.rb:105
+ def should_ignore?(line); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/history.rb:7
+ def default_file; end
+ end
+end
+
+# Implements a hooks system for Pry. A hook is a callable that is associated
+# with an event. A number of events are currently provided by Pry, these
+# include: `:when_started`, `:before_session`, `:after_session`. A hook must
+# have a name, and is connected with an event by the `Pry::Hooks#add_hook`
+# method.
+#
+# @example Adding a hook for the `:before_session` event.
+# Pry.config.hooks.add_hook(:before_session, :say_hi) do
+# puts "hello"
+# end
+#
+# pkg:gem/pry#lib/pry/hooks.rb:14
+class Pry::Hooks
+ # pkg:gem/pry#lib/pry/hooks.rb:25
+ def initialize; end
+
+ # Add a new hook to be executed for the `event_name` event.
+ # @param [Symbol] event_name The name of the event.
+ # @param [Symbol] hook_name The name of the hook.
+ # @param [#call] callable The callable.
+ # @yield The block to use as the callable (if no `callable` provided).
+ # @return [Pry:Hooks] The receiver.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:81
+ def add_hook(event_name, hook_name, callable = T.unsafe(nil), &block); end
+
+ # Clear all hooks functions for a given event.
+ #
+ # @param [String] event_name The name of the event.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:165
+ def clear_event_hooks(event_name); end
+
+ # @param [Symbol] event_name The name of the event.
+ # @param [Symbol] hook_name The name of the hook.
+ # to delete.
+ # @return [#call] The deleted hook.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:147
+ def delete_hook(event_name, hook_name); end
+
+ # pkg:gem/pry#lib/pry/hooks.rb:39
+ def errors; end
+
+ # Execute the list of hooks for the `event_name` event.
+ # @param [Symbol] event_name The name of the event.
+ # @param [Array] args The arguments to pass to each hook function.
+ # @return [Object] The return value of the last executed hook.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:108
+ def exec_hook(event_name, *args, &block); end
+
+ # @param [Symbol] event_name The name of the event.
+ # @param [Symbol] hook_name The name of the hook
+ # @return [#call] a specific hook for a given event.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:128
+ def get_hook(event_name, hook_name); end
+
+ # @param [Symbol] event_name The name of the event.
+ # @return [Hash] The hash of hook names / hook functions.
+ # @note Modifying the returned hash does not alter the hooks, use
+ # `add_hook`/`delete_hook` for that.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:139
+ def get_hooks(event_name); end
+
+ # @param [Symbol] event_name The name of the event.
+ # @return [Fixnum] The number of hook functions for `event_name`.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:121
+ def hook_count(event_name); end
+
+ # @param [Symbol] event_name Name of the event.
+ # @param [Symbol] hook_name Name of the hook.
+ # @return [Boolean] Whether the hook by the name `hook_name`.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:172
+ def hook_exists?(event_name, hook_name); end
+
+ # @example
+ # hooks = Pry::Hooks.new.add_hook(:before_session, :say_hi) { puts "hi!" }
+ # Pry::Hooks.new.merge(hooks)
+ # @param [Pry::Hooks] other The `Pry::Hooks` instance to merge
+ # @return [Pry::Hooks] a new `Pry::Hooks` instance containing a merge of the
+ # contents of two `Pry:Hooks` instances.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:69
+ def merge(other); end
+
+ # Destructively merge the contents of two `Pry:Hooks` instances.
+ #
+ # @param [Pry::Hooks] other The `Pry::Hooks` instance to merge
+ # @return [Pry:Hooks] The receiver.
+ # @see #merge
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:48
+ def merge!(other); end
+
+ protected
+
+ # pkg:gem/pry#lib/pry/hooks.rb:178
+ def hooks; end
+
+ private
+
+ # Ensure that duplicates have their @hooks object.
+ #
+ # pkg:gem/pry#lib/pry/hooks.rb:30
+ def initialize_copy(_orig); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/hooks.rb:15
+ def default; end
+ end
+end
+
+# Pry::Indent is a class that can be used to indent a number of lines
+# containing Ruby code similar as to how IRB does it (but better). The class
+# works by tokenizing a string using CodeRay and then looping over those
+# tokens. Based on the tokens in a line of code that line (or the next one)
+# will be indented or un-indented by correctly.
+#
+# pkg:gem/pry#lib/pry/indent.rb:11
+class Pry::Indent
+ include ::Pry::Helpers::BaseHelpers
+
+ # pkg:gem/pry#lib/pry/indent.rb:107
+ def initialize(pry_instance = T.unsafe(nil)); end
+
+ # Return a string which, when printed, will rewrite the previous line with
+ # the correct indentation. Mostly useful for fixing 'end'.
+ #
+ # @param [String] prompt The user's prompt
+ # @param [String] code The code the user just typed in
+ # @param [Integer] overhang The number of characters to erase afterwards (the
+ # the difference in length between the old line and the new one)
+ #
+ # @return [String] correctly indented line
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:395
+ def correct_indentation(prompt, code, overhang = T.unsafe(nil)); end
+
+ # Get the indentation for the start of the next line.
+ #
+ # This is what's used between the prompt and the cursor in pry.
+ #
+ # @return String The correct number of spaces
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:185
+ def current_prefix; end
+
+ # If the code just before an "if" or "while" token on a line looks like the
+ # end of a statement, then we want to treat that "if" as a singleline, not
+ # multiline statement.
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:268
+ def end_of_statement?(last_token, last_kind); end
+
+ # Are we currently in the middle of a string literal.
+ #
+ # This is used to determine whether to re-indent a given line, we mustn't
+ # re-indent within string literals because to do so would actually change
+ # the value of the String!
+ #
+ # @return Boolean
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:279
+ def in_string?; end
+
+ # Indents a string and returns it. This string can either be a single line
+ # or multiple ones.
+ #
+ # @example
+ # str = <]
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:378
+ def module_nesting; end
+
+ # All the open delimiters, in the order that they first appeared.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:314
+ def open_delimiters; end
+
+ # Return a string which restores the CodeRay string status to the correct value by
+ # opening HEREDOCs and strings.
+ #
+ # @return String
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:322
+ def open_delimiters_line; end
+
+ # reset internal state
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:113
+ def reset; end
+
+ # @return [Array] The stack of open tokens.
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:24
+ def stack; end
+
+ # Given a string of Ruby code, use CodeRay to export the tokens.
+ #
+ # @param [String] string The Ruby to lex
+ # @return [Array] An Array of pairs of [token_value, token_type]
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:287
+ def tokenize(string); end
+
+ # Update the internal state about what kind of strings are open.
+ #
+ # Most of the complication here comes from the fact that HEREDOCs can be
+ # nested. For normal strings (which can't be nested) we assume that CodeRay
+ # correctly pairs open-and-close delimiters so we don't bother checking what
+ # they are.
+ #
+ # @param [String] token The token (of type :delimiter)
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:299
+ def track_delimiter(token); end
+
+ # Update the internal state relating to module nesting.
+ #
+ # It's responsible for adding to the @module_nesting array, which looks
+ # something like:
+ #
+ # [ ["class", "Foo"], ["module", "Bar::Baz"], ["class <<", "self"] ]
+ #
+ # A nil value in the @module_nesting array happens in two places: either
+ # when @awaiting_class is true and we're still waiting for the string to
+ # fill that space, or when a parse was rejected.
+ #
+ # At the moment this function is quite restricted about what formats it will
+ # parse, for example we disallow expressions after the class keyword. This
+ # could maybe be improved in the future.
+ #
+ # @param [String] token a token from Coderay
+ # @param [Symbol] kind the kind of that token
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:343
+ def track_module_nesting(token, kind); end
+
+ # Update the internal state relating to module nesting on 'end'.
+ #
+ # If the current 'end' pairs up with a class or a module then we should
+ # pop an array off of @module_nesting
+ #
+ # @param [String] token a token from Coderay
+ # @param [Symbol] kind the kind of that token
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:368
+ def track_module_nesting_end(token, kind = T.unsafe(nil)); end
+
+ class << self
+ # Clean the indentation of a fragment of ruby.
+ #
+ # @param [String] str
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:85
+ def indent(str); end
+
+ # Get the module nesting at the given point in the given string.
+ #
+ # NOTE If the line specified contains a method definition, then the nesting
+ # at the start of the method definition is used. Otherwise the nesting from
+ # the end of the line is used.
+ #
+ # @param [String] str The ruby code to analyze
+ # @param [Fixnum] line_number The line number (starting from 1)
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/indent.rb:98
+ def nesting_at(str, line_number); end
+ end
+end
+
+# Collection of token types that should be ignored. Without this list
+# keywords such as "class" inside strings would cause the code to be
+# indented incorrectly.
+#
+# :pre_constant and :preserved_constant are the CodeRay 0.9.8 and 1.0.0
+# classifications of "true", "false", and "nil".
+#
+# pkg:gem/pry#lib/pry/indent.rb:63
+Pry::Indent::IGNORE_TOKENS = T.let(T.unsafe(nil), Array)
+
+# Collection of tokens that should appear dedented even though they
+# don't affect the surrounding code.
+#
+# pkg:gem/pry#lib/pry/indent.rb:79
+Pry::Indent::MIDWAY_TOKENS = T.let(T.unsafe(nil), Array)
+
+# Hash containing all the tokens that should increase the indentation
+# level. The keys of this hash are open tokens, the values the matching
+# tokens that should prevent a line from being indented if they appear on
+# the same line.
+#
+# pkg:gem/pry#lib/pry/indent.rb:33
+Pry::Indent::OPEN_TOKENS = T.let(T.unsafe(nil), Hash)
+
+# Which tokens can be followed by an optional "do" keyword.
+#
+# pkg:gem/pry#lib/pry/indent.rb:55
+Pry::Indent::OPTIONAL_DO_TOKENS = T.let(T.unsafe(nil), Array)
+
+# Which tokens can either be open tokens, or appear as modifiers on
+# a single-line.
+#
+# pkg:gem/pry#lib/pry/indent.rb:52
+Pry::Indent::SINGLELINE_TOKENS = T.let(T.unsafe(nil), Array)
+
+# The amount of spaces to insert for each indent level.
+#
+# pkg:gem/pry#lib/pry/indent.rb:27
+Pry::Indent::SPACES = T.let(T.unsafe(nil), String)
+
+# Tokens that indicate the end of a statement (i.e. that, if they appear
+# directly before an "if" indicates that that if applies to the same line,
+# not the next line)
+#
+# :reserved and :keywords are the CodeRay 0.9.8 and 1.0.0 respectively
+# classifications of "super", "next", "return", etc.
+#
+# pkg:gem/pry#lib/pry/indent.rb:72
+Pry::Indent::STATEMENT_END_TOKENS = T.let(T.unsafe(nil), Array)
+
+# Raised if {#module_nesting} would not work.
+#
+# pkg:gem/pry#lib/pry/indent.rb:15
+class Pry::Indent::UnparseableNestingError < ::StandardError; end
+
+# pkg:gem/pry#lib/pry/input/simple_stdio.rb:4
+module Pry::Input; end
+
+# Readline replacement for low-capability terminals.
+#
+# pkg:gem/pry#lib/pry/input/simple_stdio.rb:6
+class Pry::Input::SimpleStdio
+ class << self
+ # pkg:gem/pry#lib/pry/input/simple_stdio.rb:7
+ def readline(prompt); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/input_completer.rb:6
+class Pry::InputCompleter
+ # pkg:gem/pry#lib/pry/input_completer.rb:42
+ def initialize(input, pry = T.unsafe(nil)); end
+
+ # build_path separates the input into two parts: path and input.
+ # input is the partial string that should be completed
+ # path is a proc that takes an input and builds a full path.
+ #
+ # pkg:gem/pry#lib/pry/input_completer.rb:240
+ def build_path(input); end
+
+ # Return a new completion proc for use by Readline.
+ #
+ # pkg:gem/pry#lib/pry/input_completer.rb:56
+ def call(str, options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/input_completer.rb:255
+ def ignored_modules; end
+
+ # pkg:gem/pry#lib/pry/input_completer.rb:229
+ def select_message(path, receiver, message, candidates); end
+end
+
+# pkg:gem/pry#lib/pry/input_completer.rb:8
+Pry::InputCompleter::ARRAY_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:15
+Pry::InputCompleter::CONSTANT_OR_METHOD_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:14
+Pry::InputCompleter::CONSTANT_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:17
+Pry::InputCompleter::GLOBALVARIABLE_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:16
+Pry::InputCompleter::HEX_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:7
+Pry::InputCompleter::NUMERIC_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:12
+Pry::InputCompleter::PROC_OR_HASH_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:11
+Pry::InputCompleter::REGEX_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:20
+Pry::InputCompleter::RESERVED_WORDS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:10
+Pry::InputCompleter::SYMBOL_METHOD_CALL_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:9
+Pry::InputCompleter::SYMBOL_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:13
+Pry::InputCompleter::TOPLEVEL_LOOKUP_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:18
+Pry::InputCompleter::VARIABLE_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/pry#lib/pry/input_completer.rb:40
+Pry::InputCompleter::WORD_ESCAPE_STR = T.let(T.unsafe(nil), String)
+
+# There is one InputLock per input (such as STDIN) as two REPLs on the same
+# input makes things delirious. InputLock serializes accesses to the input so
+# that threads to not conflict with each other. The latest thread to request
+# ownership of the input wins.
+#
+# pkg:gem/pry#lib/pry/input_lock.rb:8
+class Pry::InputLock
+ # pkg:gem/pry#lib/pry/input_lock.rb:29
+ def initialize; end
+
+ # Adds ourselves to the ownership list. The last one in the list may access
+ # the input through interruptible_region().
+ #
+ # pkg:gem/pry#lib/pry/input_lock.rb:38
+ def __with_ownership; end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:81
+ def enter_interruptible_region; end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:108
+ def interruptible_region; end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:95
+ def leave_interruptible_region; end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:75
+ def with_ownership(&block); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/input_lock.rb:19
+ def for(input); end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:13
+ def global_lock; end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:13
+ def global_lock=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:12
+ def input_locks; end
+
+ # pkg:gem/pry#lib/pry/input_lock.rb:12
+ def input_locks=(_arg0); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/input_lock.rb:9
+class Pry::InputLock::Interrupt < ::Exception; end
+
+# pkg:gem/pry#lib/pry/inspector.rb:4
+class Pry::Inspector; end
+
+# pkg:gem/pry#lib/pry/inspector.rb:5
+Pry::Inspector::MAP = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/pry#lib/pry/pry_class.rb:7
+Pry::LOCAL_RC_FILE = T.let(T.unsafe(nil), String)
+
+# pkg:gem/pry#lib/pry/last_exception.rb:12
+class Pry::LastException < ::BasicObject
+ # pkg:gem/pry#lib/pry/last_exception.rb:15
+ def initialize(exception); end
+
+ # pkg:gem/pry#lib/pry/last_exception.rb:13
+ def bt_index; end
+
+ # pkg:gem/pry#lib/pry/last_exception.rb:13
+ def bt_index=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/last_exception.rb:52
+ def bt_source_location_for(index); end
+
+ # @return [String]
+ # returns the path to a file for the current backtrace. see {#bt_index}.
+ #
+ # pkg:gem/pry#lib/pry/last_exception.rb:37
+ def file; end
+
+ # pkg:gem/pry#lib/pry/last_exception.rb:57
+ def inc_bt_index; end
+
+ # @return [Fixnum]
+ # returns the line for the current backtrace. see {#bt_index}.
+ #
+ # pkg:gem/pry#lib/pry/last_exception.rb:43
+ def line; end
+
+ # pkg:gem/pry#lib/pry/last_exception.rb:21
+ def method_missing(name, *args, &block); end
+
+ # @return [Exception]
+ # returns the wrapped exception
+ #
+ # pkg:gem/pry#lib/pry/last_exception.rb:48
+ def wrapped_exception; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/last_exception.rb:29
+ def respond_to_missing?(name, include_all = T.unsafe(nil)); end
+end
+
+# This class wraps the normal `Method` and `UnboundMethod` classes
+# to provide extra functionality useful to Pry.
+#
+# pkg:gem/pry#lib/pry/method.rb:20
+class Pry::Method
+ include ::Pry::Helpers::BaseHelpers
+ include ::Pry::Helpers::DocumentationHelpers
+ include ::Pry::CodeObject::Helpers
+ extend ::Pry::Helpers::BaseHelpers
+ extend ::Forwardable
+ extend ::Pry::Forwardable
+
+ # A new instance of `Pry::Method` wrapping the given `::Method`,
+ # `UnboundMethod`, or `Proc`.
+ #
+ # @param [::Method, UnboundMethod, Proc] method
+ # @param [Hash] known_info Can be used to pre-cache expensive to compute stuff.
+ # @return [Pry::Method]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:263
+ def initialize(method, known_info = T.unsafe(nil)); end
+
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:483
+ def ==(other); end
+
+ # @return [Boolean] Is the method definitely an alias?
+ #
+ # pkg:gem/pry#lib/pry/method.rb:478
+ def alias?; end
+
+ # @return [Array] All known aliases for the method.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:461
+ def aliases; end
+
+ # @return [Boolean] Whether the method is bound.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:446
+ def bound_method?; end
+
+ # pkg:gem/pry#lib/pry/method.rb:515
+ def comment; end
+
+ # @return [String, nil] The documentation for the method, or `nil` if it's
+ # unavailable.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:329
+ def doc; end
+
+ # @return [Boolean] Was the method defined outside a source file?
+ #
+ # pkg:gem/pry#lib/pry/method.rb:436
+ def dynamically_defined?; end
+
+ # @param [Class] klass
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:491
+ def is_a?(klass); end
+
+ # pkg:gem/pry#lib/pry/method.rb:494
+ def kind_of?(klass); end
+
+ # Delegate any unknown calls to the wrapped method.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:503
+ def method_missing(method_name, *args, &block); end
+
+ # Get the name of the method as a String, regardless of the underlying
+ # Method#name type.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:272
+ def name; end
+
+ # Get the name of the method including the class on which it was defined.
+ # @example
+ # method(:puts).method_name
+ # => "Kernel.puts"
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:299
+ def name_with_owner; end
+
+ # @return [String, nil] The original name the method was defined under,
+ # before any aliasing, or `nil` if it can't be determined.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:429
+ def original_name; end
+
+ # pkg:gem/pry#lib/pry/method.rb:255
+ def owner(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/method.rb:255
+ def parameters(*args, **_arg1, &block); end
+
+ # @return [Boolean] Was the method defined within the Pry REPL?
+ #
+ # pkg:gem/pry#lib/pry/method.rb:456
+ def pry_method?; end
+
+ # pkg:gem/pry#lib/pry/method.rb:255
+ def receiver(*args, **_arg1, &block); end
+
+ # Update the live copy of the method's source.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:314
+ def redefine(source); end
+
+ # @param [String, Symbol] method_name
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:498
+ def respond_to?(method_name, include_all = T.unsafe(nil)); end
+
+ # @return [String] A representation of the method's signature, including its
+ # name and parameters. Optional and "rest" parameters are marked with `*`
+ # and block parameters with `&`. Keyword arguments are shown with `:`
+ # If the parameter names are unavailable, they're given numbered names instead.
+ # Paraphrased from `awesome_print` gem.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:391
+ def signature; end
+
+ # @return [Boolean] Whether the method is a singleton method.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:451
+ def singleton_method?; end
+
+ # @return [String, nil] The source code of the method, or `nil` if it's unavailable.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:304
+ def source; end
+
+ # Can we get the source code for this method?
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:321
+ def source?; end
+
+ # @return [String, nil] The name of the file the method is defined in, or
+ # `nil` if the filename is unavailable.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:348
+ def source_file; end
+
+ # @return [Fixnum, nil] The line of code in `source_file` which begins
+ # the method's definition, or `nil` if that information is unavailable.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:361
+ def source_line; end
+
+ # @return [Range, nil] The range of lines in `source_file` which contain
+ # the method's definition, or `nil` if that information is unavailable.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:367
+ def source_range; end
+
+ # @return [Symbol] The source type of the method. The options are
+ # `:ruby` for Ruby methods or `:c` for methods written in C.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:342
+ def source_type; end
+
+ # @return [Pry::Method, nil] The wrapped method that is called when you
+ # use "super" in the body of this method.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:417
+ def super(times = T.unsafe(nil)); end
+
+ # @return [Boolean] Whether the method is unbound.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:441
+ def unbound_method?; end
+
+ # Is the method undefined? (aka `Disowned`)
+ # @return [Boolean] false
+ #
+ # pkg:gem/pry#lib/pry/method.rb:290
+ def undefined?; end
+
+ # @return [Symbol] The visibility of the method. May be `:public`,
+ # `:protected`, or `:private`.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:373
+ def visibility; end
+
+ # Get underlying object wrapped by this Pry::Method instance
+ # @return [Method, UnboundMethod, Proc]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:284
+ def wrapped; end
+
+ # Get the owner of the method as a Pry::Module
+ # @return [Pry::Module]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:278
+ def wrapped_owner; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/method.rb:577
+ def c_source; end
+
+ # @param [String] first_ln The first line of a method definition.
+ # @return [String, nil]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:564
+ def method_name_from_first_line(first_ln); end
+
+ # @return [YARD::CodeObjects::MethodObject]
+ # @raise [CommandError] when the method can't be found or `pry-doc` isn't installed.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:523
+ def pry_doc_info; end
+
+ # pkg:gem/pry#lib/pry/method.rb:511
+ def respond_to_missing?(method_name, include_private = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/method.rb:582
+ def ruby_source; end
+
+ # @param [Class, Module] ancestors The ancestors to investigate
+ # @return [Method] The unwrapped super-method
+ #
+ # pkg:gem/pry#lib/pry/method.rb:543
+ def super_using_ancestors(ancestors, times = T.unsafe(nil)); end
+
+ class << self
+ # Get all of the instance methods of a `Class` or `Module`
+ # @param [Class,Module] klass
+ # @param [Boolean] include_super Whether to include methods from ancestors.
+ # @return [Array[Pry::Method]]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:161
+ def all_from_class(klass, include_super = T.unsafe(nil)); end
+
+ # Get all of the methods on an `Object`
+ #
+ # @param [Object] obj
+ #
+ # @param [Boolean] include_super
+ # indicates whether or not to include methods from ancestors.
+ #
+ # @return [Array[Pry::Method]]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:184
+ def all_from_obj(obj, include_super = T.unsafe(nil)); end
+
+ # Given a `Binding`, try to extract the `::Method` it originated from and
+ # use it to instantiate a `Pry::Method`. Return `nil` if this isn't
+ # possible.
+ #
+ # @param [Binding] binding
+ # @return [Pry::Method, nil]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:77
+ def from_binding(binding); end
+
+ # Given a `Class` or `Module` and the name of a method, try to
+ # instantiate a `Pry::Method` containing the instance method of
+ # that name. Return `nil` if no such method exists.
+ #
+ # @param [Class, Module] klass
+ # @param [String] name
+ # @param [Binding] target The binding where the method is looked up.
+ # @return [Pry::Method, nil]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:136
+ def from_class(klass, name, target = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/method.rb:141
+ def from_module(klass, name, target = T.unsafe(nil)); end
+
+ # Given an object and the name of a method, try to instantiate
+ # a `Pry::Method` containing the method of that name bound to
+ # that object. Return `nil` if no such method exists.
+ #
+ # @param [Object] obj
+ # @param [String] name
+ # @param [Binding] target The binding where the method is looked up.
+ # @return [Pry::Method, nil]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:151
+ def from_obj(obj, name, target = T.unsafe(nil)); end
+
+ # Given a string representing a method name and optionally a binding to
+ # search in, find and return the requested method wrapped in a
+ # `Pry::Method` instance.
+ #
+ # @param [String] name The name of the method to retrieve.
+ # @param [Binding] target The context in which to search for the method.
+ # @param [Hash] options
+ # @option options [Boolean] :instance Look for an instance method if
+ # `name` doesn't contain any context.
+ # @option options [Boolean] :methods Look for a bound/singleton method if
+ # `name` doesn't contain any context.
+ # @return [Pry::Method, nil] A `Pry::Method` instance containing the
+ # requested method, or `nil` if name is `nil` or no method could be
+ # located matching the parameters.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:43
+ def from_str(name, target = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/method.rb:227
+ def instance_method_definition?(name, definition_line); end
+
+ # Get every `Class` and `Module`, in order, that will be checked when looking
+ # for methods on instances of the given `Class` or `Module`.
+ # This does not treat singleton classes of classes specially.
+ # @param [Class, Module] klass
+ # @return [Array[Class, Module]]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:210
+ def instance_resolution_order(klass); end
+
+ # In order to support 2.0 Refinements we need to look up methods
+ # inside the relevant Binding.
+ # @param [Object] obj The owner/receiver of the method.
+ # @param [Symbol] method_name The name of the method.
+ # @param [Symbol] method_type The type of method: :method or :instance_method
+ # @param [Binding] target The binding where the method is looked up.
+ # @return [Method, UnboundMethod] The 'refined' method object.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:114
+ def lookup_method_via_binding(obj, method_name, method_type, target = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/method.rb:215
+ def method_definition?(name, definition_line); end
+
+ # Get every `Class` and `Module`, in order, that will be checked when looking
+ # for an instance method to call on this object.
+ # @param [Object] obj
+ # @return [Array[Class, Module]]
+ #
+ # pkg:gem/pry#lib/pry/method.rb:192
+ def resolution_order(obj); end
+
+ # pkg:gem/pry#lib/pry/method.rb:247
+ def singleton_class_of(obj); end
+
+ # Get the singleton classes of superclasses that could define methods on
+ # the given class object, and any modules they include.
+ # If a module is included at multiple points in the ancestry, only
+ # the lowest copy will be returned.
+ #
+ # pkg:gem/pry#lib/pry/method.rb:238
+ def singleton_class_resolution_order(klass); end
+
+ # pkg:gem/pry#lib/pry/method.rb:220
+ def singleton_method_definition?(name, definition_line); end
+ end
+end
+
+# A Disowned Method is one that's been removed from the class on which it was defined.
+#
+# e.g.
+# class C
+# def foo
+# C.send(:undefine_method, :foo)
+# Pry::Method.from_binding(binding)
+# end
+# end
+#
+# In this case we assume that the "owner" is the singleton class of the receiver.
+#
+# This occurs mainly in Sinatra applications.
+#
+# pkg:gem/pry#lib/pry/method/disowned.rb:18
+class Pry::Method::Disowned < ::Pry::Method
+ # Create a new Disowned method.
+ #
+ # @param [Object] receiver
+ # @param [String] method_name
+ #
+ # pkg:gem/pry#lib/pry/method/disowned.rb:25
+ def initialize(receiver, method_name); end
+
+ # Raise a more useful error message instead of trying to forward to nil.
+ #
+ # pkg:gem/pry#lib/pry/method/disowned.rb:52
+ def method_missing(method_name, *args, &block); end
+
+ # pkg:gem/pry#lib/pry/method/disowned.rb:19
+ def name; end
+
+ # Get the hypothesized owner of the method.
+ #
+ # @return [Object]
+ #
+ # pkg:gem/pry#lib/pry/method/disowned.rb:46
+ def owner; end
+
+ # pkg:gem/pry#lib/pry/method/disowned.rb:19
+ def receiver; end
+
+ # Can we get the source for this method?
+ # @return [Boolean] false
+ #
+ # pkg:gem/pry#lib/pry/method/disowned.rb:39
+ def source?; end
+
+ # Is the method undefined? (aka `Disowned`)
+ # @return [Boolean] true
+ #
+ # pkg:gem/pry#lib/pry/method/disowned.rb:33
+ def undefined?; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/method/disowned.rb:62
+ def respond_to_missing?(method_name, include_private = T.unsafe(nil)); end
+end
+
+# pkg:gem/pry#lib/pry/method/patcher.rb:5
+class Pry::Method::Patcher
+ # pkg:gem/pry#lib/pry/method/patcher.rb:12
+ def initialize(method); end
+
+ # pkg:gem/pry#lib/pry/method/patcher.rb:6
+ def method; end
+
+ # pkg:gem/pry#lib/pry/method/patcher.rb:6
+ def method=(_arg0); end
+
+ # perform the patch
+ #
+ # pkg:gem/pry#lib/pry/method/patcher.rb:21
+ def patch_in_ram(source); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/method/patcher.rb:38
+ def cache_key; end
+
+ # Update the definition line so that it can be eval'd directly on the Method's
+ # owner instead of from the original context.
+ #
+ # In particular this takes `def self.foo` and turns it into `def foo` so that we
+ # don't end up creating the method on the singleton class of the singleton class
+ # by accident.
+ #
+ # This is necessarily done by String manipulation because we can't find out what
+ # syntax is needed for the argument list by ruby-level introspection.
+ #
+ # @param [String] line The original definition line. e.g. def self.foo(bar, baz=1)
+ # @return [String] The new definition line. e.g. def foo(bar, baz=1)
+ #
+ # pkg:gem/pry#lib/pry/method/patcher.rb:78
+ def definition_for_owner(line); end
+
+ # pkg:gem/pry#lib/pry/method/patcher.rb:33
+ def redefine(source); end
+
+ # Run some code ensuring that at the end target#meth_name will not have changed.
+ #
+ # When we're redefining aliased methods we will overwrite the method at the
+ # unaliased name (so that super continues to work). By wrapping that code in a
+ # translation we make that not happen, which means that alias_method_chains, etc.
+ # continue to work.
+ #
+ # pkg:gem/pry#lib/pry/method/patcher.rb:49
+ def with_method_transaction; end
+
+ # Apply wrap_for_owner and wrap_for_nesting successively to `source`
+ # @param [String] source
+ # @return [String] The wrapped source.
+ #
+ # pkg:gem/pry#lib/pry/method/patcher.rb:91
+ def wrap(source); end
+
+ # Update the new source code to have the correct Module.nesting.
+ #
+ # This method uses syntactic analysis of the original source file to determine
+ # the new nesting, so that we can tell the difference between:
+ #
+ # class A; def self.b; end; end
+ # class << A; def b; end; end
+ #
+ # The resulting code should be evaluated in the TOPLEVEL_BINDING.
+ #
+ # @param [String] source The source to wrap.
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/method/patcher.rb:122
+ def wrap_for_nesting(source); end
+
+ # Update the source code so that when it has the right owner when eval'd.
+ #
+ # This (combined with definition_for_owner) is backup for the case that
+ # wrap_for_nesting fails, to ensure that the method will still be defined in
+ # the correct place.
+ #
+ # @param [String] source The source to wrap
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/method/patcher.rb:103
+ def wrap_for_owner(source); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/method/patcher.rb:16
+ def code_for(filename); end
+ end
+end
+
+# This class is responsible for locating the *real* `Pry::Method`
+# object captured by a binding.
+#
+# Given a `Binding` from inside a method and a 'seed' Pry::Method object,
+# there are primarily two situations where the seed method doesn't match
+# the Binding:
+# 1. The Pry::Method is from a subclass
+# 2. The Pry::Method represents a method of the same name while the original
+# was renamed to something else. For 1. we search vertically up the
+# inheritance chain, and for 2. we search laterally along the object's
+# method table.
+#
+# When we locate the method that matches the Binding we wrap it in
+# Pry::Method and return it, or return nil if we fail.
+#
+# pkg:gem/pry#lib/pry/method/weird_method_locator.rb:19
+class Pry::Method::WeirdMethodLocator
+ # @param [Pry::Method] method The seed method.
+ # @param [Binding] target The Binding that captures the method
+ # we want to locate.
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:55
+ def initialize(method, target); end
+
+ # @return [Pry::Method, nil] The Pry::Method that matches the
+ # given binding.
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:62
+ def find_method; end
+
+ # @return [Boolean] Whether the Pry::Method is unrecoverable
+ # This usually happens when the method captured by the Binding
+ # has been subsequently deleted.
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:69
+ def lost_method?; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:49
+ def method; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:49
+ def method=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:50
+ def target; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:50
+ def target=(_arg0); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:215
+ def all_methods_for(obj); end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:167
+ def expanded_source_location(source_location); end
+
+ # it's possible in some cases that the method we find by this approach is
+ # a sub-method of the one we're currently in, consider:
+ #
+ # class A; def b; binding.pry; end; end
+ # class B < A; def b; super; end; end
+ #
+ # Given that we can normally find the source_range of methods, and that we
+ # know which __FILE__ and __LINE__ the binding is at, we can hope to
+ # disambiguate these cases.
+ #
+ # This obviously won't work if the source is unavailable for some reason,
+ # or if both methods have the same __FILE__ and __LINE__.
+ #
+ # @return [Pry::Method, nil] The Pry::Method representing the
+ # superclass method.
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:131
+ def find_method_in_superclass; end
+
+ # This is the case where the name of a method has changed
+ # (via alias_method) so we locate the Method object for the
+ # renamed method.
+ #
+ # @return [Pry::Method, nil] The Pry::Method representing the
+ # renamed method
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:156
+ def find_renamed_method; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:197
+ def index_to_line_number(index); end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:206
+ def lines_for_file(file); end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:80
+ def normal_method?(method); end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:106
+ def pry_file?; end
+
+ # Use static analysis to locate the start of the method definition.
+ # We have the `__FILE__` and `__LINE__` from the binding and the
+ # original name of the method so we search up until we find a
+ # def/define_method, etc defining a method of the appropriate name.
+ #
+ # @return [Array] The `source_location` of the
+ # renamed method
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:184
+ def renamed_method_source_location; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:75
+ def skip_superclass_search?; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:88
+ def target_file; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:98
+ def target_line; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:84
+ def target_self; end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:202
+ def valid_file?(file); end
+
+ class << self
+ # Whether the given method object matches the associated binding.
+ # If the method object does not match the binding, then it's
+ # most likely not the method captured by the binding, and we
+ # must commence a search.
+ #
+ # @param [Pry::Method] method
+ # @param [Binding] binding
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:29
+ def normal_method?(method, binding); end
+
+ # pkg:gem/pry#lib/pry/method/weird_method_locator.rb:44
+ def weird_method?(method, binding); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/exceptions.rb:69
+class Pry::MethodNotFound < ::Pry::CommandError; end
+
+# pkg:gem/pry#lib/pry/command_set.rb:4
+class Pry::NoCommandError < ::StandardError
+ # pkg:gem/pry#lib/pry/command_set.rb:5
+ def initialize(match, owner); end
+end
+
+# `ObjectPath` implements the resolution of "object paths", which are strings
+# that are similar to filesystem paths but meant for traversing Ruby objects.
+# Examples of valid object paths include:
+#
+# x
+# @foo/@bar
+# "string"/upcase
+# Pry/Method
+#
+# Object paths are mostly relevant in the context of the `cd` command.
+# @see https://github.com/pry/pry/wiki/State-navigation
+#
+# pkg:gem/pry#lib/pry/object_path.rb:17
+class Pry::ObjectPath
+ # @param [String] path_string The object path expressed as a string.
+ # @param [Array] current_stack The current state of the binding
+ # stack.
+ #
+ # pkg:gem/pry#lib/pry/object_path.rb:23
+ def initialize(path_string, current_stack); end
+
+ # @return [Array] a new stack resulting from applying the given
+ # path to the current stack.
+ #
+ # pkg:gem/pry#lib/pry/object_path.rb:30
+ def resolve; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/object_path.rb:74
+ def complete?(segment); end
+
+ # pkg:gem/pry#lib/pry/object_path.rb:78
+ def handle_failure(context, err); end
+end
+
+# pkg:gem/pry#lib/pry/object_path.rb:18
+Pry::ObjectPath::SPECIAL_TERMS = T.let(T.unsafe(nil), Array)
+
+# indicates obsolete API
+#
+# pkg:gem/pry#lib/pry/exceptions.rb:72
+class Pry::ObsoleteError < ::StandardError; end
+
+# pkg:gem/pry#lib/pry/output.rb:4
+class Pry::Output
+ # pkg:gem/pry#lib/pry/output.rb:10
+ def initialize(pry_instance); end
+
+ # pkg:gem/pry#lib/pry/output.rb:34
+ def <<(*objs); end
+
+ # pkg:gem/pry#lib/pry/output.rb:53
+ def decolorize_maybe(str); end
+
+ # Return a screen height or the default if that fails.
+ #
+ # pkg:gem/pry#lib/pry/output.rb:74
+ def height; end
+
+ # pkg:gem/pry#lib/pry/output.rb:41
+ def method_missing(method_name, *args, &block); end
+
+ # pkg:gem/pry#lib/pry/output.rb:28
+ def print(*objs); end
+
+ # pkg:gem/pry#lib/pry/output.rb:8
+ def pry_instance; end
+
+ # pkg:gem/pry#lib/pry/output.rb:15
+ def puts(*objs); end
+
+ # @return [Array] a pair of [rows, columns] which gives the size of
+ # the window. If the window size cannot be determined, the default value.
+ #
+ # pkg:gem/pry#lib/pry/output.rb:61
+ def size; end
+
+ # pkg:gem/pry#lib/pry/output.rb:37
+ def tty?; end
+
+ # Return a screen width or the default if that fails.
+ #
+ # pkg:gem/pry#lib/pry/output.rb:69
+ def width; end
+
+ # pkg:gem/pry#lib/pry/output.rb:35
+ def write(*objs); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/output.rb:80
+ def actual_screen_size; end
+
+ # pkg:gem/pry#lib/pry/output.rb:125
+ def ansicon_env_size; end
+
+ # pkg:gem/pry#lib/pry/output.rb:109
+ def env_size; end
+
+ # pkg:gem/pry#lib/pry/output.rb:92
+ def io_console_size; end
+
+ # pkg:gem/pry#lib/pry/output.rb:132
+ def nonzero_column?(size); end
+
+ # pkg:gem/pry#lib/pry/output.rb:114
+ def readline_size; end
+
+ # pkg:gem/pry#lib/pry/output.rb:49
+ def respond_to_missing?(method_name, include_private = T.unsafe(nil)); end
+end
+
+# @return [Array] default terminal screen size [rows, cols]
+#
+# pkg:gem/pry#lib/pry/output.rb:6
+Pry::Output::DEFAULT_SIZE = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/pry#lib/pry/pager.rb:7
+class Pry::Pager
+ # pkg:gem/pry#lib/pry/pager.rb:13
+ def initialize(pry_instance); end
+
+ # Yields a pager object (`NullPager`, `SimplePager`, or `SystemPager`).
+ # All pagers accept output with `#puts`, `#print`, `#write`, and `#<<`.
+ #
+ # pkg:gem/pry#lib/pry/pager.rb:33
+ def open; end
+
+ # Send the given text through the best available pager (if
+ # `Pry.config.pager` is enabled). If you want to send text through in
+ # chunks as you generate it, use `open` to get a writable object
+ # instead.
+ #
+ # @param [String] text
+ # Text to run through a pager.
+ #
+ # pkg:gem/pry#lib/pry/pager.rb:25
+ def page(text); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:11
+ def pry_instance; end
+
+ private
+
+ # Return an instance of the "best" available pager class --
+ # `SystemPager` if possible, `SimplePager` if `SystemPager` isn't
+ # available, and `NullPager` if the user has disabled paging. All
+ # pagers accept output with `#puts`, `#print`, `#write`, and `#<<`. You
+ # must call `#close` when you're done writing output to a pager, and
+ # you must rescue `Pry::Pager::StopPaging`. These requirements can be
+ # avoided by using `.open` instead.
+ #
+ # pkg:gem/pry#lib/pry/pager.rb:56
+ def best_available; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:43
+ def enabled?; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:47
+ def output; end
+end
+
+# `NullPager` is a "pager" that actually just prints all output as it
+# comes in. Used when `Pry.config.pager` is false.
+#
+# pkg:gem/pry#lib/pry/pager.rb:68
+class Pry::Pager::NullPager
+ # pkg:gem/pry#lib/pry/pager.rb:69
+ def initialize(out); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:80
+ def <<(str); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:86
+ def close; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:77
+ def print(str); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:73
+ def puts(str); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:82
+ def write(str); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/pager.rb:90
+ def height; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:94
+ def width; end
+end
+
+# `PageTracker` tracks output to determine whether it's likely to take
+# up a whole page. This doesn't need to be super precise, but we can
+# use it for `SimplePager` and to avoid invoking the system pager
+# unnecessarily.
+#
+# One simplifying assumption is that we don't need `#page?` to return
+# `true` on the basis of an incomplete line. Long lines should be
+# counted as multiple lines, but we don't have to transition from
+# `false` to `true` until we see a newline.
+#
+# pkg:gem/pry#lib/pry/pager.rb:213
+class Pry::Pager::PageTracker
+ # pkg:gem/pry#lib/pry/pager.rb:214
+ def initialize(rows, cols); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:231
+ def page?; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:220
+ def record(str); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:235
+ def reset; end
+
+ private
+
+ # Approximation of the printable length of a given line, without the
+ # newline and without ANSI color codes.
+ #
+ # pkg:gem/pry#lib/pry/pager.rb:244
+ def line_length(line); end
+end
+
+# `SimplePager` is a straightforward pure-Ruby pager. We use it on
+# JRuby and when we can't find a usable external pager.
+#
+# pkg:gem/pry#lib/pry/pager.rb:101
+class Pry::Pager::SimplePager < ::Pry::Pager::NullPager
+ # pkg:gem/pry#lib/pry/pager.rb:102
+ def initialize(*_arg0); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:107
+ def write(str); end
+end
+
+# pkg:gem/pry#lib/pry/pager.rb:8
+class Pry::Pager::StopPaging < ::StandardError; end
+
+# `SystemPager` buffers output until we're pretty sure it's at least a
+# page long, then invokes an external pager and starts streaming output
+# to it. If `#close` is called before then, it just prints out the
+# buffered content.
+#
+# pkg:gem/pry#lib/pry/pager.rb:129
+class Pry::Pager::SystemPager < ::Pry::Pager::NullPager
+ # pkg:gem/pry#lib/pry/pager.rb:161
+ def initialize(*_arg0); end
+
+ # pkg:gem/pry#lib/pry/pager.rb:181
+ def close; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:168
+ def write(str); end
+
+ private
+
+ # pkg:gem/pry#lib/pry/pager.rb:195
+ def invoked_pager?; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:199
+ def pager; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:191
+ def write_to_pager(text); end
+
+ class << self
+ # pkg:gem/pry#lib/pry/pager.rb:142
+ def available?; end
+
+ # pkg:gem/pry#lib/pry/pager.rb:130
+ def default_pager; end
+ end
+end
+
+# Prompt represents the Pry prompt, which can be used with Readline-like
+# libraries. It defines a few default prompts (default prompt, simple prompt,
+# etc) and also provides an API for adding and implementing custom prompts.
+#
+# @example Registering a new Pry prompt
+# Pry::Prompt.add(
+# :ipython,
+# 'IPython-like prompt', [':', '...:']
+# ) do |_context, _nesting, pry_instance, sep|
+# sep == ':' ? "In [#{pry_instance.input_ring.count}]: " : ' ...: '
+# end
+#
+# # Produces:
+# # In [3]: def foo
+# # ...: puts 'foo'
+# # ...: end
+# # => :foo
+# # In [4]:
+#
+# @example Manually instantiating the Prompt class
+# prompt_procs = [
+# proc { '#{rand(1)}>" },
+# proc { "#{('a'..'z').to_a.sample}*" }
+# ]
+# prompt = Pry::Prompt.new(
+# :random,
+# 'Random number or letter prompt.',
+# prompt_procs
+# )
+# prompt.wait_proc.call(...) #=>
+# prompt.incomplete_proc.call(...)
+#
+# @since v0.11.0
+# @api public
+#
+# pkg:gem/pry#lib/pry/prompt.rb:38
+class Pry::Prompt
+ # @param [String] name
+ # @param [String] description
+ # @param [Array] prompt_procs
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:117
+ def initialize(name, description, prompt_procs); end
+
+ # @deprecated Use a `Pry::Prompt` instance directly
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:135
+ def [](key); end
+
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:108
+ def description; end
+
+ # @return [Proc] the proc which builds the prompt when in the middle of an
+ # expression such as open method, etc. (`*`)
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:130
+ def incomplete_proc; end
+
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:105
+ def name; end
+
+ # @return [Array] the array of procs that hold
+ # `[wait_proc, incomplete_proc]`
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:112
+ def prompt_procs; end
+
+ # @return [Proc] the proc which builds the wait prompt (`>`)
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:124
+ def wait_proc; end
+
+ class << self
+ # Retrieves a prompt.
+ #
+ # @example
+ # Prompt[:my_prompt]
+ #
+ # @param [Symbol] name The name of the prompt you want to access
+ # @return [Hash{Symbol=>Object}]
+ # @since v0.12.0
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:52
+ def [](name); end
+
+ # Adds a new prompt to the prompt hash.
+ #
+ # @param [Symbol] name
+ # @param [String] description
+ # @param [Array] separators The separators to differentiate
+ # between prompt modes (default mode and class/method definition mode).
+ # The Array *must* have a size of 2.
+ # @yield [context, nesting, pry_instance, sep]
+ # @yieldparam context [Object] the context where Pry is currently in
+ # @yieldparam nesting [Integer] whether the context is nested
+ # @yieldparam pry_instance [Pry] the Pry instance
+ # @yieldparam separator [String] separator string
+ # @return [nil]
+ # @raise [ArgumentError] if the size of `separators` is not 2
+ # @raise [ArgumentError] if `prompt_name` is already occupied
+ # @since v0.12.0
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:79
+ def add(name, description = T.unsafe(nil), separators = T.unsafe(nil)); end
+
+ # @return [Hash{Symbol=>Hash}] the duplicate of the internal prompts hash
+ # @note Use this for read-only operations
+ # @since v0.12.0
+ #
+ # pkg:gem/pry#lib/pry/prompt.rb:59
+ def all; end
+ end
+end
+
+# pkg:gem/pry#lib/pry/repl.rb:4
+class Pry::REPL
+ extend ::Forwardable
+ extend ::Pry::Forwardable
+
+ # Create an instance of {REPL} wrapping the given {Pry}.
+ # @param [Pry] pry The instance of {Pry} that this {REPL} will control.
+ # @param [Hash] options Options for this {REPL} instance.
+ # @option options [Object] :target The initial target of the session.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:22
+ def initialize(pry, options = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/repl.rb:6
+ def input(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/repl.rb:6
+ def output(*args, **_arg1, &block); end
+
+ # @return [Pry] The instance of {Pry} that the user is controlling.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:9
+ def pry; end
+
+ # @return [Pry] The instance of {Pry} that the user is controlling.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:9
+ def pry=(_arg0); end
+
+ # Start the read-eval-print loop.
+ # @return [Object?] If the session throws `:breakout`, return the value
+ # thrown with it.
+ # @raise [Exception] If the session throws `:raise_up`, raise the exception
+ # thrown with it.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:36
+ def start; end
+
+ private
+
+ # Calculates correct overhang for current line. Supports vi Readline
+ # mode and its indicators such as "(ins)" or "(cmd)".
+ #
+ # @return [Integer]
+ # @note This doesn't calculate overhang for Readline's emacs mode with an
+ # indicator because emacs is the default mode and it doesn't use
+ # indicators in 99% of cases.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:307
+ def calculate_overhang(current_prompt, original_val, indented_val); end
+
+ # pkg:gem/pry#lib/pry/repl.rb:287
+ def complete_expression?(multiline_input); end
+
+ # pkg:gem/pry#lib/pry/repl.rb:246
+ def coolline_available?; end
+
+ # Clean up after the repl session.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:84
+ def epilogue; end
+
+ # Manage switching of input objects on encountering `EOFError`s.
+ # @return [Object] Whatever the given block returns.
+ # @return [:no_more_input] Indicates that no more input can be read.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:127
+ def handle_read_errors; end
+
+ # pkg:gem/pry#lib/pry/repl.rb:234
+ def input_multiline?; end
+
+ # pkg:gem/pry#lib/pry/repl.rb:228
+ def input_readline(*args); end
+
+ # pkg:gem/pry#lib/pry/repl.rb:219
+ def input_readmultiline(*args); end
+
+ # If `$stdout` is not a tty, it's probably a pipe.
+ # @example
+ # # `piping?` returns `false`
+ # % pry
+ # [1] pry(main)
+ #
+ # # `piping?` returns `true`
+ # % pry | tee log
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:272
+ def piping?; end
+
+ # pkg:gem/pry#lib/pry/repl.rb:250
+ def prism_available?; end
+
+ # Set up the repl session.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:47
+ def prologue; end
+
+ # Read a line of input from the user.
+ # @return [String] The line entered by the user.
+ # @return [nil] On ``.
+ # @return [:control_c] On ``.
+ # @return [:no_more_input] On EOF.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:93
+ def read; end
+
+ # Returns the next line of input to be sent to the {Pry} instance.
+ # @param [String] current_prompt The prompt to use for input.
+ # @return [String?] The next line of input, or `nil` on .
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:169
+ def read_line(current_prompt); end
+
+ # pkg:gem/pry#lib/pry/repl.rb:242
+ def readline_available?; end
+
+ # pkg:gem/pry#lib/pry/repl.rb:238
+ def reline_available?; end
+
+ # The actual read-eval-print loop.
+ #
+ # The {REPL} instance is responsible for reading and looping, whereas the
+ # {Pry} instance is responsible for evaluating user input and printing
+ # return values and command output.
+ #
+ # @return [Object?] If the session throws `:breakout`, return the value
+ # thrown with it.
+ # @raise [Exception] If the session throws `:raise_up`, raise the exception
+ # thrown with it.
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:66
+ def repl; end
+
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:279
+ def set_readline_output; end
+
+ class << self
+ # Instantiate a new {Pry} instance with the given options, then start a
+ # {REPL} instance wrapping it.
+ # @option options See {Pry#initialize}
+ #
+ # pkg:gem/pry#lib/pry/repl.rb:14
+ def start(options); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/repl.rb:285
+Pry::REPL::UNEXPECTED_TOKENS = T.let(T.unsafe(nil), Array)
+
+# A class to manage the loading of files through the REPL loop.
+# This is an interesting trick as it processes your file as if it
+# was user input in an interactive session. As a result, all Pry
+# commands are available, and they are executed non-interactively. Furthermore
+# the session becomes interactive when the repl loop processes a
+# 'make-interactive' command in the file. The session also becomes
+# interactive when an exception is encountered, enabling you to fix
+# the error before returning to non-interactive processing with the
+# 'make-non-interactive' command.
+#
+# pkg:gem/pry#lib/pry/repl_file_loader.rb:14
+class Pry::REPLFileLoader
+ # pkg:gem/pry#lib/pry/repl_file_loader.rb:15
+ def initialize(file_name); end
+
+ # Define a few extra commands useful for flipping back & forth
+ # between interactive/non-interactive modes
+ #
+ # pkg:gem/pry#lib/pry/repl_file_loader.rb:59
+ def define_additional_commands; end
+
+ # Switch to interactive mode, i.e take input from the user
+ # and use the regular print and exception handlers.
+ # @param [Pry] pry_instance the Pry instance to make interactive.
+ #
+ # pkg:gem/pry#lib/pry/repl_file_loader.rb:26
+ def interactive_mode(pry_instance); end
+
+ # Actually load the file through the REPL by setting file content
+ # as the REPL input stream.
+ #
+ # pkg:gem/pry#lib/pry/repl_file_loader.rb:75
+ def load; end
+
+ # Switch to non-interactive mode. Essentially
+ # this means there is no result output
+ # and that the session becomes interactive when an exception is encountered.
+ # @param [Pry] pry_instance the Pry instance to make non-interactive.
+ #
+ # pkg:gem/pry#lib/pry/repl_file_loader.rb:37
+ def non_interactive_mode(pry_instance, content); end
+end
+
+# As a REPL, we often want to catch any unexpected exceptions that may have
+# been raised; however we don't want to go overboard and prevent the user
+# from exiting Pry when they want to.
+#
+# pkg:gem/pry#lib/pry/exceptions.rb:7
+module Pry::RescuableException
+ class << self
+ # pkg:gem/pry#lib/pry/exceptions.rb:8
+ def ===(exception); end
+ end
+end
+
+# Wraps the return result of process_commands, indicates if the
+# result IS a command and what kind of command (e.g void)
+#
+# pkg:gem/pry#lib/pry/command_set.rb:397
+class Pry::Result
+ # pkg:gem/pry#lib/pry/command_set.rb:400
+ def initialize(is_command, retval = T.unsafe(nil)); end
+
+ # Is the result a command?
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:407
+ def command?; end
+
+ # pkg:gem/pry#lib/pry/command_set.rb:398
+ def retval; end
+
+ # Is the result a command and if it is, is it a void command?
+ # (one that does not return a value)
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/command_set.rb:414
+ def void_command?; end
+end
+
+# A ring is a thread-safe fixed-capacity array to which you can only add
+# elements. Older entries are overwritten as you add new elements, so that the
+# ring can never contain more than `max_size` elements.
+#
+# @example
+# ring = Pry::Ring.new(3)
+# ring << 1 << 2 << 3
+# ring.to_a #=> [1, 2, 3]
+# ring << 4
+# ring.to_a #=> [2, 3, 4]
+#
+# ring[0] #=> 2
+# ring[-1] #=> 4
+# ring.clear
+# ring[0] #=> nil
+#
+# @api public
+# @since v0.12.0
+#
+# pkg:gem/pry#lib/pry/ring.rb:22
+class Pry::Ring
+ # @param [Integer] max_size Maximum buffer size. The buffer will start
+ # overwriting elements once its reaches its maximum capacity
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:33
+ def initialize(max_size); end
+
+ # Push `value` to the current index.
+ #
+ # @param [Object] value
+ # @return [self]
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:43
+ def <<(value); end
+
+ # Read the value stored at `index`.
+ #
+ # @param [Integer, Range] index The element (if Integer) or elements
+ # (if Range) associated with `index`
+ # @return [Object, Array, nil] element(s) at `index`, `nil` if none
+ # exist
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:57
+ def [](index); end
+
+ # Clear the buffer and reset count.
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:75
+ def clear; end
+
+ # @return [Integer] how many objects were added during the lifetime of the
+ # ring
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:28
+ def count; end
+
+ # @return [Integer] maximum buffer size
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:24
+ def max_size; end
+
+ # pkg:gem/pry#lib/pry/ring.rb:29
+ def size; end
+
+ # @return [Array] the buffer as unwinded array
+ #
+ # pkg:gem/pry#lib/pry/ring.rb:67
+ def to_a; end
+
+ private
+
+ # pkg:gem/pry#lib/pry/ring.rb:84
+ def transpose_buffer_tail; end
+end
+
+# pkg:gem/pry#lib/pry/slop.rb:5
+class Pry::Slop
+ include ::Enumerable
+
+ # Create a new instance of Slop and optionally build options via a block.
+ #
+ # config - A Hash of configuration options.
+ # block - An optional block used to specify options.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:127
+ def initialize(config = T.unsafe(nil), &block); end
+
+ # Fetch an options argument value.
+ #
+ # key - The Symbol or String option short or long flag.
+ #
+ # Returns the Object value for this option, or nil.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:278
+ def [](key); end
+
+ # Add a callback.
+ #
+ # label - The Symbol identifier to attach this callback.
+ #
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:398
+ def add_callback(label, &block); end
+
+ # Get or set the banner.
+ #
+ # banner - The String to set the banner.
+ #
+ # Returns the banner String.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:168
+ def banner(banner = T.unsafe(nil)); end
+
+ # Set the banner.
+ #
+ # banner - The String to set the banner.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:159
+ def banner=(banner); end
+
+ # Add a new command.
+ #
+ # command - The Symbol or String used to identify this command.
+ # options - A Hash of configuration options (see Slop::new)
+ #
+ # Returns a new instance of Slop mapped to this command.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:196
+ def command(command, options = T.unsafe(nil), &block); end
+
+ # The Hash of configuration options for this Slop instance.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:118
+ def config; end
+
+ # Get or set the description (used for commands).
+ #
+ # desc - The String to set the description.
+ #
+ # Returns the description String.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:185
+ def description(desc = T.unsafe(nil)); end
+
+ # Set the description (used for commands).
+ #
+ # desc - The String to set the description.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:176
+ def description=(desc); end
+
+ # Enumerable interface. Yields each Slop::Option.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:297
+ def each(&block); end
+
+ # Fetch a Slop object associated with this command.
+ #
+ # command - The String or Symbol name of the command.
+ #
+ # Examples:
+ #
+ # opts.command :foo do
+ # on :v, :verbose, 'Enable verbose mode'
+ # end
+ #
+ # # ruby run.rb foo -v
+ # opts.fetch_command(:foo).verbose? #=> true
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:389
+ def fetch_command(command); end
+
+ # Fetch a Slop::Option object.
+ #
+ # key - The Symbol or String option key.
+ #
+ # Examples:
+ #
+ # opts.on(:foo, 'Something fooey', :argument => :optional)
+ # opt = opts.fetch_option(:foo)
+ # opt.class #=> Slop::Option
+ # opt.accepts_optional_argument? #=> true
+ #
+ # Returns an Option or nil if none were found.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:373
+ def fetch_option(key); end
+
+ # pkg:gem/pry#lib/pry/slop.rb:282
+ def get(key); end
+
+ # pkg:gem/pry#lib/pry/slop.rb:440
+ def help; end
+
+ # Fetch a list of options which were missing from the parsed list.
+ #
+ # Examples:
+ #
+ # opts = Slop.new do
+ # on :n, :name=
+ # on :p, :password=
+ # end
+ #
+ # opts.parse %w[ --name Lee ]
+ # opts.missing #=> ['password']
+ #
+ # Returns an Array of Strings representing missing options.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:357
+ def missing; end
+
+ # Add an Option.
+ #
+ # objects - An Array with an optional Hash as the last element.
+ #
+ # Examples:
+ #
+ # on '-u', '--username=', 'Your username'
+ # on :v, :verbose, 'Enable verbose mode'
+ #
+ # Returns the created instance of Slop::Option.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:265
+ def on(*objects, &block); end
+
+ # pkg:gem/pry#lib/pry/slop.rb:271
+ def opt(*objects, &block); end
+
+ # pkg:gem/pry#lib/pry/slop.rb:270
+ def option(*objects, &block); end
+
+ # The Array of Slop::Option objects tied to this Slop instance.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:121
+ def options; end
+
+ # Parse a list of items, executing and gathering options along the way.
+ #
+ # items - The Array of items to extract options from (default: ARGV).
+ # block - An optional block which when used will yield non options.
+ #
+ # Returns an Array of original items.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:206
+ def parse(items = T.unsafe(nil), &block); end
+
+ # Parse a list of items, executing and gathering options along the way.
+ # unlike parse() this method will remove any options and option arguments
+ # from the original Array.
+ #
+ # items - The Array of items to extract options from (default: ARGV).
+ # block - An optional block which when used will yield non options.
+ #
+ # Returns an Array of original items with options removed.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:219
+ def parse!(items = T.unsafe(nil), &block); end
+
+ # Check for an options presence.
+ #
+ # Examples:
+ #
+ # opts.parse %w( --foo )
+ # opts.present?(:foo) #=> true
+ # opts.present?(:bar) #=> false
+ #
+ # Returns true if all of the keys are present in the parsed arguments.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:333
+ def present?(*keys); end
+
+ # Specify code to be executed when these options are parsed.
+ #
+ # callable - An object responding to a call method.
+ #
+ # yields - The instance of Slop parsing these options
+ # An Array of unparsed arguments
+ #
+ # Example:
+ #
+ # Slop.parse do
+ # on :v, :verbose
+ #
+ # run do |opts, args|
+ # puts "Arguments: #{args.inspect}" if opts.verbose?
+ # end
+ # end
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:317
+ def run(callable = T.unsafe(nil), &block); end
+
+ # Add string separators between options.
+ #
+ # text - The String text to print.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:405
+ def separator(text); end
+
+ # Is strict mode enabled?
+ #
+ # Returns true if strict mode is enabled, false otherwise.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:152
+ def strict?; end
+
+ # pkg:gem/pry#lib/pry/slop.rb:294
+ def to_h(include_commands = T.unsafe(nil)); end
+
+ # Returns a new Hash with option flags as keys and option values as values.
+ #
+ # include_commands - If true, merge options from all sub-commands.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:287
+ def to_hash(include_commands = T.unsafe(nil)); end
+
+ # Print a handy Slop help string.
+ #
+ # Returns the banner followed by available option help strings.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:416
+ def to_s; end
+
+ private
+
+ # Autocreate an option on the fly. See the :autocreate Slop config option.
+ #
+ # items - The Array of items we're parsing.
+ # index - The current Integer index for the item we're processing.
+ #
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:590
+ def autocreate(items, index); end
+
+ # Build an option from a list of objects.
+ #
+ # objects - An Array of objects used to build this option.
+ #
+ # Returns a new instance of Slop::Option.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:606
+ def build_option(objects, &block); end
+
+ # Remove any leading -- characters from a string.
+ #
+ # object - The Object we want to cast to a String and clean.
+ #
+ # Returns the newly cleaned String with leading -- characters removed.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:659
+ def clean(object); end
+
+ # pkg:gem/pry#lib/pry/slop.rb:663
+ def commands_to_help; end
+
+ # Execute a `-abc` type option where a, b and c are all options. This
+ # method is only executed if the multiple_switches argument is true.
+ #
+ # option - The first Option object.
+ # argument - The argument to this option. (Split into multiple Options).
+ # index - The index of the current item being processed.
+ #
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:552
+ def execute_multiple_switches(option, argument, index); end
+
+ # Execute an option, firing off callbacks and assigning arguments.
+ #
+ # option - The Slop::Option object found by #process_item.
+ # argument - The argument Object to assign to this option.
+ # index - The current Integer index of the object we're processing.
+ # item - The optional String item we're processing.
+ #
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:519
+ def execute_option(option, argument, index, item = T.unsafe(nil)); end
+
+ # Extract the long flag from an item.
+ #
+ # objects - The Array of objects passed from #build_option.
+ # config - The Hash of configuration options built in #build_option.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:644
+ def extract_long_flag(objects, config); end
+
+ # Extract an option from a flag.
+ #
+ # flag - The flag key used to extract an option.
+ #
+ # Returns an Array of [option, argument].
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:567
+ def extract_option(flag); end
+
+ # Extract the short flag from an item.
+ #
+ # objects - The Array of objects passed from #build_option.
+ # config - The Hash of configuration options built in #build_option.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:626
+ def extract_short_flag(objects, config); end
+
+ # Convenience method for present?(:option).
+ #
+ # Examples:
+ #
+ # opts.parse %( --verbose )
+ # opts.verbose? #=> true
+ # opts.other? #=> false
+ #
+ # Returns true if this option is present. If this method does not end
+ # with a ? character it will instead call super().
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:454
+ def method_missing(method, *args, &block); end
+
+ # Process a list item, figure out if it's an option, execute any
+ # callbacks, assign any option arguments, and do some sanity checks.
+ #
+ # items - The Array of items to process.
+ # index - The current Integer index of the item we want to process.
+ # block - An optional block which when passed will yield non options.
+ #
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:472
+ def process_item(items, index, &block); end
+
+ # Override this method so we can check if an option? method exists.
+ #
+ # Returns true if this option key exists in our list of options.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:340
+ def respond_to_missing?(method_name, include_all = T.unsafe(nil)); end
+
+ class << self
+ # Build a Slop object from a option specification.
+ #
+ # This allows you to design your options via a simple String rather
+ # than programmatically. Do note though that with this method, you're
+ # unable to pass any advanced options to the on() method when creating
+ # options.
+ #
+ # string - The optspec String
+ # config - A Hash of configuration options to pass to Slop.new
+ #
+ # Examples:
+ #
+ # opts = Slop.optspec(<<-SPEC)
+ # ruby foo.rb [options]
+ # ---
+ # n,name= Your name
+ # a,age= Your age
+ # A,auth Sign in with auth
+ # p,passcode= Your secret pass code
+ # SPEC
+ #
+ # opts.fetch_option(:name).description #=> "Your name"
+ #
+ # Returns a new instance of Slop.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:97
+ def optspec(string, config = T.unsafe(nil)); end
+
+ # items - The Array of items to extract options from (default: ARGV).
+ # config - The Hash of configuration options to send to Slop.new().
+ # block - An optional block used to add options.
+ #
+ # Examples:
+ #
+ # Slop.parse(ARGV, :help => true) do
+ # on '-n', '--name', 'Your username', :argument => true
+ # end
+ #
+ # Returns a new instance of Slop.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:54
+ def parse(items = T.unsafe(nil), config = T.unsafe(nil), &block); end
+
+ # items - The Array of items to extract options from (default: ARGV).
+ # config - The Hash of configuration options to send to Slop.new().
+ # block - An optional block used to add options.
+ #
+ # Returns a new instance of Slop.
+ #
+ # pkg:gem/pry#lib/pry/slop.rb:63
+ def parse!(items = T.unsafe(nil), config = T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/slop/commands.rb:5
+class Pry::Slop::Commands
+ include ::Enumerable
+
+ # Create a new instance of Slop::Commands and optionally build
+ # Slop instances via a block. Any configuration options used in
+ # this method will be the default configuration options sent to
+ # each Slop object created.
+ #
+ # config - An optional configuration Hash.
+ # block - Optional block used to define commands.
+ #
+ # Examples:
+ #
+ # commands = Slop::Commands.new do
+ # on :new do
+ # on '-o', '--outdir=', 'The output directory'
+ # on '-v', '--verbose', 'Enable verbose mode'
+ # end
+ #
+ # on :generate do
+ # on '--assets', 'Generate assets', :default => true
+ # end
+ #
+ # global do
+ # on '-D', '--debug', 'Enable debug mode', :default => false
+ # end
+ # end
+ #
+ # commands[:new].class #=> Slop
+ # commands.parse
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:39
+ def initialize(config = T.unsafe(nil), &block); end
+
+ # Fetch the instance of Slop tied to a command.
+ #
+ # key - The String or Symbol key used to locate this command.
+ #
+ # Returns the Slop instance if this key is found, nil otherwise.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:100
+ def [](key); end
+
+ # pkg:gem/pry#lib/pry/slop/commands.rb:8
+ def arguments; end
+
+ # Optionally set the banner for this command help output.
+ #
+ # banner - The String text to set the banner.
+ #
+ # Returns the String banner if one is set.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:59
+ def banner(banner = T.unsafe(nil)); end
+
+ # Optionally set the banner for this command help output.
+ #
+ # banner - The String text to set the banner.
+ #
+ # Returns the String banner if one is set.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:9
+ def banner=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/slop/commands.rb:8
+ def commands; end
+
+ # pkg:gem/pry#lib/pry/slop/commands.rb:8
+ def config; end
+
+ # Add a Slop instance used when no other commands exist.
+ #
+ # config - A Hash of configuration options to pass to Slop.
+ # block - An optional block used to pass options to Slop.
+ #
+ # Returns the newly created Slop instance mapped to default.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:81
+ def default(config = T.unsafe(nil), &block); end
+
+ # Enumerable interface.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:119
+ def each(&block); end
+
+ # pkg:gem/pry#lib/pry/slop/commands.rb:103
+ def get(key); end
+
+ # Add a global Slop instance.
+ #
+ # config - A Hash of configuration options to pass to Slop.
+ # block - An optional block used to pass options to Slop.
+ #
+ # Returns the newly created Slop instance mapped to global.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:91
+ def global(config = T.unsafe(nil), &block); end
+
+ # pkg:gem/pry#lib/pry/slop/commands.rb:167
+ def help; end
+
+ # Returns the inspection String.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:170
+ def inspect; end
+
+ # Add a Slop instance for a specific command.
+ #
+ # command - A String or Symbol key used to identify this command.
+ # config - A Hash of configuration options to pass to Slop.
+ # block - An optional block used to pass options to Slop.
+ #
+ # Returns the newly created Slop instance mapped to command.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:71
+ def on(command, config = T.unsafe(nil), &block); end
+
+ # Parse a list of items.
+ #
+ # items - The Array of items to parse.
+ #
+ # Returns the original Array of items.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:128
+ def parse(items = T.unsafe(nil)); end
+
+ # Parse a list of items, removing any options or option arguments found.
+ #
+ # items - The Array of items to parse.
+ #
+ # Returns the original Array of items with options removed.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:138
+ def parse!(items = T.unsafe(nil)); end
+
+ # Check for a command presence.
+ #
+ # Examples:
+ #
+ # cmds.parse %w( foo )
+ # cmds.present?(:foo) #=> true
+ # cmds.present?(:bar) #=> false
+ #
+ # Returns true if the given key is present in the parsed arguments.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:114
+ def present?(key); end
+
+ # Returns a nested Hash with Slop options and values. See Slop#to_hash.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:153
+ def to_hash; end
+
+ # Returns the help String.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:158
+ def to_s; end
+
+ private
+
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:177
+ def execute_arguments!(items); end
+
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop/commands.rb:183
+ def execute_global_opts!(items); end
+end
+
+# Returns a default Hash of configuration options this Slop instance uses.
+#
+# pkg:gem/pry#lib/pry/slop.rb:30
+Pry::Slop::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# The main Error class, all Exception classes inherit from this class.
+#
+# pkg:gem/pry#lib/pry/slop.rb:12
+class Pry::Slop::Error < ::StandardError; end
+
+# Raised when an argument does not match its intended match constraint.
+#
+# pkg:gem/pry#lib/pry/slop.rb:21
+class Pry::Slop::InvalidArgumentError < ::Pry::Slop::Error; end
+
+# Raised when an invalid command is found and the strict flag is enabled.
+#
+# pkg:gem/pry#lib/pry/slop.rb:27
+class Pry::Slop::InvalidCommandError < ::Pry::Slop::Error; end
+
+# Raised when an invalid option is found and the strict flag is enabled.
+#
+# pkg:gem/pry#lib/pry/slop.rb:24
+class Pry::Slop::InvalidOptionError < ::Pry::Slop::Error; end
+
+# Raised when an option argument is expected but none are given.
+#
+# pkg:gem/pry#lib/pry/slop.rb:15
+class Pry::Slop::MissingArgumentError < ::Pry::Slop::Error; end
+
+# Raised when an option is expected/required but not present.
+#
+# pkg:gem/pry#lib/pry/slop.rb:18
+class Pry::Slop::MissingOptionError < ::Pry::Slop::Error; end
+
+# pkg:gem/pry#lib/pry/slop/option.rb:5
+class Pry::Slop::Option
+ # Incapsulate internal option information, mainly used to store
+ # option specific configuration data, most of the meat of this
+ # class is found in the #value method.
+ #
+ # slop - The instance of Slop tied to this Option.
+ # short - The String or Symbol short flag.
+ # long - The String or Symbol long flag.
+ # description - The String description text.
+ # config - A Hash of configuration options.
+ # block - An optional block used as a callback.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:35
+ def initialize(slop, short, long, description, config = T.unsafe(nil), &block); end
+
+ # Returns true if this option accepts an optional argument.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:72
+ def accepts_optional_argument?; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:23
+ def argument_in_value; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:23
+ def argument_in_value=(_arg0); end
+
+ # Call this options callback if one exists, and it responds to call().
+ #
+ # Returns nothing.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:84
+ def call(*objects); end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:22
+ def config; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:23
+ def count; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:23
+ def count=(_arg0); end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:22
+ def description; end
+
+ # Returns true if this option expects an argument.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:67
+ def expects_argument?; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:140
+ def help; end
+
+ # Returns the String inspection text.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:143
+ def inspect; end
+
+ # Returns the String flag of this option. Preferring the long flag.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:77
+ def key; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:22
+ def long; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:22
+ def short; end
+
+ # Returns the help String for this option.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:124
+ def to_s; end
+
+ # pkg:gem/pry#lib/pry/slop/option.rb:22
+ def types; end
+
+ # Fetch the argument value for this option.
+ #
+ # Returns the Object once any type conversions have taken place.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:108
+ def value; end
+
+ # Set the new argument value for this option.
+ #
+ # We use this setter method to handle concatenating lists. That is,
+ # when an array type is specified and used more than once, values from
+ # both options will be grouped together and flattened into a single array.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:93
+ def value=(new_value); end
+
+ private
+
+ # Convert an object to a Float if possible.
+ #
+ # value - The Object we want to convert to a float.
+ #
+ # Returns the Float value if possible to convert, else a zero.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:173
+ def value_to_float(value); end
+
+ # Convert an object to an Integer if possible.
+ #
+ # value - The Object we want to convert to an integer.
+ #
+ # Returns the Integer value if possible to convert, else a zero.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:156
+ def value_to_integer(value); end
+
+ # Convert an object to a Range if possible.
+ #
+ # value - The Object we want to convert to a range.
+ #
+ # Returns the Range value if one could be found, else the original object.
+ #
+ # pkg:gem/pry#lib/pry/slop/option.rb:190
+ def value_to_range(value); end
+end
+
+# The default Hash of configuration options this class uses.
+#
+# pkg:gem/pry#lib/pry/slop/option.rb:7
+Pry::Slop::Option::DEFAULT_OPTIONS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/pry#lib/pry/slop.rb:9
+Pry::Slop::VERSION = T.let(T.unsafe(nil), String)
+
+# @api private
+# @since v0.13.0
+#
+# pkg:gem/pry#lib/pry/syntax_highlighter.rb:8
+class Pry::SyntaxHighlighter
+ class << self
+ # pkg:gem/pry#lib/pry/syntax_highlighter.rb:9
+ def highlight(code, language = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/syntax_highlighter.rb:17
+ def keyword_token_color; end
+
+ # Sets comment token to blue (black by default), so it's more legible.
+ #
+ # pkg:gem/pry#lib/pry/syntax_highlighter.rb:22
+ def overwrite_coderay_comment_token!; end
+
+ # pkg:gem/pry#lib/pry/syntax_highlighter.rb:13
+ def tokenize(code, language = T.unsafe(nil)); end
+ end
+end
+
+# @api private
+# @since v0.13.0
+#
+# pkg:gem/pry#lib/pry/system_command_handler.rb:6
+module Pry::SystemCommandHandler
+ class << self
+ # pkg:gem/pry#lib/pry/system_command_handler.rb:8
+ def default(output, command, _pry_instance); end
+ end
+end
+
+# Catches SecurityErrors if $SAFE is set
+#
+# pkg:gem/pry#lib/pry/exceptions.rb:28
+module Pry::TooSafeException
+ class << self
+ # pkg:gem/pry#lib/pry/exceptions.rb:29
+ def ===(exception); end
+ end
+end
+
+# An Exception Tag (cf. Exceptional Ruby) that instructs Pry to show the error
+# in a more user-friendly manner. This should be used when the exception
+# happens within Pry itself as a direct consequence of the user typing
+# something wrong.
+#
+# This allows us to distinguish between the user typing:
+#
+# pry(main)> def )
+# SyntaxError: unexpected )
+#
+# pry(main)> method_that_evals("def )")
+# SyntaxError: (eval):1: syntax error, unexpected ')'
+# from ./a.rb:2 in `eval'
+#
+# pkg:gem/pry#lib/pry/exceptions.rb:51
+module Pry::UserError; end
+
+# pkg:gem/pry#lib/pry/version.rb:4
+Pry::VERSION = T.let(T.unsafe(nil), String)
+
+# @api private
+# @since v0.13.0
+#
+# pkg:gem/pry#lib/pry/warning.rb:6
+module Pry::Warning
+ class << self
+ # Prints a warning message with exact file and line location, similar to how
+ # Ruby's -W prints warnings.
+ #
+ # @param [String] message
+ # @return [void]
+ #
+ # pkg:gem/pry#lib/pry/warning.rb:12
+ def warn(message); end
+ end
+end
+
+# pkg:gem/pry#lib/pry/wrapped_module.rb:16
+class Pry::WrappedModule
+ include ::Pry::Helpers::BaseHelpers
+ include ::Pry::CodeObject::Helpers
+
+ # @raise [ArgumentError] if the argument is not a `Module`
+ # @param [Module] mod
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:56
+ def initialize(mod); end
+
+ # Return a candidate for this module of specified rank. A `rank`
+ # of 0 is equivalent to the 'primary candidate', which is the
+ # module definition with the highest number of methods. A `rank`
+ # of 1 is the module definition with the second highest number of
+ # methods, and so on. Module candidates are necessary as modules
+ # can be reopened multiple times and in multiple places in Ruby,
+ # the candidate API gives you access to the module definition
+ # representing each of those reopenings.
+ # @raise [Pry::CommandError] If the `rank` is out of range. That
+ # is greater than `number_of_candidates - 1`.
+ # @param [Fixnum] rank
+ # @return [Pry::WrappedModule::Candidate]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:239
+ def candidate(rank); end
+
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:250
+ def candidates; end
+
+ # Is this strictly a class?
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:126
+ def class?; end
+
+ # Returns an array of the names of the constants accessible in the wrapped
+ # module. This avoids the problem of accidentally calling the singleton
+ # method `Module.constants`.
+ # @param [Boolean] inherit Include the names of constants from included
+ # modules?
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:76
+ def constants(inherit = T.unsafe(nil)); end
+
+ # Returns documentation for the module.
+ # This documentation is for the primary candidate, if
+ # you would like documentation for other candidates use
+ # `WrappedModule#candidate` to select the candidate you're
+ # interested in.
+ # @raise [Pry::CommandError] If documentation cannot be found.
+ # @return [String] The documentation for the module.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:195
+ def doc; end
+
+ # @return [String, nil] The associated file for the module (i.e
+ # the primary candidate: highest ranked monkeypatch).
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:176
+ def file; end
+
+ # @return [Fixnum, nil] The associated line for the module (i.e
+ # the primary candidate: highest ranked monkeypatch).
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:183
+ def line; end
+
+ # Forward method invocations to the wrapped module
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:150
+ def method_missing(method_name, *args, &block); end
+
+ # The prefix that would appear before methods defined on this class.
+ #
+ # i.e. the "String." or "String#" in String.new and String#initialize.
+ #
+ # @return String
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:85
+ def method_prefix; end
+
+ # Is this strictly a module? (does not match classes)
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:120
+ def module?; end
+
+ # The name of the Module if it has one, otherwise #.
+ #
+ # @return [String]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:100
+ def nonblank_name; end
+
+ # @return [Fixnum] The number of candidate definitions for the
+ # current module.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:245
+ def number_of_candidates; end
+
+ # Is this a singleton class?
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:110
+ def singleton_class?; end
+
+ # Get the instance associated with this singleton class.
+ #
+ # @raise ArgumentError: tried to get instance of non singleton class
+ #
+ # @return [Object]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:135
+ def singleton_instance; end
+
+ # Returns the source for the module.
+ # This source is for the primary candidate, if
+ # you would like source for other candidates use
+ # `WrappedModule#candidate` to select the candidate you're
+ # interested in.
+ # @raise [Pry::CommandError] If source cannot be found.
+ # @return [String] The source for the module.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:206
+ def source; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:179
+ def source_file; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:186
+ def source_line; end
+
+ # Retrieve the source location of a module. Return value is in same
+ # format as Method#source_location. If the source location
+ # cannot be found this method returns `nil`.
+ #
+ # @return [Array, nil] The source location of the
+ # module (or class), or `nil` if no source location found.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:168
+ def source_location; end
+
+ # @param [Fixnum] times How far to travel up the ancestor chain.
+ # @return [Pry::WrappedModule, nil] The wrapped module that is the
+ # superclass.
+ # When `self` is a `Module` then return the
+ # nth ancestor, otherwise (in the case of classes) return the
+ # nth ancestor that is a class.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:270
+ def super(times = T.unsafe(nil)); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:20
+ def wrapped; end
+
+ # @return [String] Return the YARD docs for this module.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:223
+ def yard_doc; end
+
+ # @return [Boolean] Whether YARD docs are available for this module.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:260
+ def yard_docs?; end
+
+ # @return [String] Return the associated file for the
+ # module from YARD, if one exists.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:212
+ def yard_file; end
+
+ # @return [Fixnum] Return the associated line for the
+ # module from YARD, if one exists.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:218
+ def yard_line; end
+
+ private
+
+ # Return all methods (instance methods and class methods) for a
+ # given module.
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:347
+ def all_methods_for(mod); end
+
+ # We only want methods that have a non-nil `source_location`. We also
+ # skip some spooky internal methods.
+ #
+ # @return [Array]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:329
+ def all_relevant_methods_for(mod); end
+
+ # A helper method.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:310
+ def all_source_locations_by_popularity; end
+
+ # memoized lines for file
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:371
+ def lines_for_file(file); end
+
+ # @return [Array>] The array of `Pry::Method` objects,
+ # there are two associated with each candidate. The first is the 'base
+ # method' for a candidate and it serves as the start point for
+ # the search in uncovering the module definition. The second is
+ # the last method defined for that candidate and it is used to
+ # speed up source code extraction.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:302
+ def method_candidates; end
+
+ # Detect methods that are defined with `def_delegator` from the Forwardable
+ # module. We want to reject these methods as they screw up module
+ # extraction since the `source_location` for such methods points at forwardable.rb
+ # TODO: make this more robust as valid user-defined files called
+ # forwardable.rb are also skipped.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:366
+ def method_defined_by_forwardable_module?(method); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:351
+ def nested_module?(parent, name); end
+
+ # @return [Pry::WrappedModule::Candidate] The candidate with the
+ # highest rank, that is the 'monkey patch' of this module with the
+ # highest number of methods, which contains a source code line that
+ # defines the module. It is considered the 'canonical' definition
+ # for the module. In the absence of a suitable candidate, the
+ # candidate of rank 0 will be returned, or a CommandError raised if
+ # there are no candidates at all.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:292
+ def primary_candidate; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:158
+ def respond_to_missing?(method_name, include_private = T.unsafe(nil)); end
+
+ class << self
+ # Convert a string to a module.
+ #
+ # @param [String] mod_name
+ # @param [Binding] target The binding where the lookup takes place.
+ # @return [Module, nil] The module or `nil` (if conversion failed).
+ # @example
+ # Pry::WrappedModule.from_str("Pry::Code")
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:29
+ def from_str(mod_name, target = T.unsafe(nil)); end
+
+ private
+
+ # We use this method to decide whether code is safe to eval. Method's are
+ # generally not, but everything else is.
+ # TODO: is just checking != "method" enough??
+ # TODO: see duplication of this method in Pry::CodeObject
+ # @param [String] str The string to lookup.
+ # @param [Binding] target Where the lookup takes place.
+ # @return [Boolean]
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module.rb:45
+ def safe_to_evaluate?(str, target); end
+ end
+end
+
+# This class represents a single candidate for a module/class definition.
+# It provides access to the source, documentation, line and file
+# for a monkeypatch (reopening) of a class/module.
+#
+# pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:8
+class Pry::WrappedModule::Candidate
+ include ::Pry::Helpers::DocumentationHelpers
+ include ::Pry::CodeObject::Helpers
+ extend ::Forwardable
+ extend ::Pry::Forwardable
+
+ # @raise [Pry::CommandError] If `rank` is out of bounds.
+ # @param [Pry::WrappedModule] wrapper The associated
+ # `Pry::WrappedModule` instance that owns the candidates.
+ # @param [Fixnum] rank The rank of the candidate to
+ # retrieve. Passing 0 returns 'primary candidate' (the candidate with largest
+ # number of methods), passing 1 retrieves candidate with
+ # second largest number of methods, and so on, up to
+ # `Pry::WrappedModule#number_of_candidates() - 1`
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:38
+ def initialize(wrapper, rank); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:27
+ def class?(*args, **_arg1, &block); end
+
+ # @raise [Pry::CommandError] If documentation cannot be found.
+ # @return [String] The documentation for the candidate.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:70
+ def doc; end
+
+ # @return [String] The file where the module definition is located.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:14
+ def file; end
+
+ # @return [Fixnum] The line where the module definition is located.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:18
+ def line; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:27
+ def module?(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:27
+ def nonblank_name(*args, **_arg1, &block); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:27
+ def number_of_candidates(*args, **_arg1, &block); end
+
+ # @raise [Pry::CommandError] If source code cannot be found.
+ # @return [String] The source for the candidate, i.e the
+ # complete module/class definition.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:59
+ def source; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:15
+ def source_file; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:19
+ def source_line; end
+
+ # @return [Array, nil] A `[String, Fixnum]` pair representing the
+ # source location (file and line) for the candidate or `nil`
+ # if no source location found.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:79
+ def source_location; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:27
+ def wrapped(*args, **_arg1, &block); end
+
+ private
+
+ # Locate the first line of the module definition.
+ # @param [String] file The file that contains the module
+ # definition (somewhere).
+ # @param [Fixnum] line The module definition should appear
+ # before this line (if it exists).
+ # @return [Fixnum] The line where the module is defined. This
+ # line number is one-indexed.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:99
+ def first_line_of_module_definition(file, line); end
+
+ # This method is used by `Candidate#source_location` as a
+ # starting point for the search for the candidate's definition.
+ # @return [Array] The source location of the base method used to
+ # calculate the source location of the candidate.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:116
+ def first_method_source_location; end
+
+ # @return [Array] The source location of the last method in this
+ # candidate's module definition.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:122
+ def last_method_source_location; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:28
+ def lines_for_file(*a, &b); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:28
+ def method_candidates(*a, &b); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:104
+ def module_definition_first_line?(line); end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:28
+ def name(*a, &b); end
+
+ # Return the number of lines between the start of the class definition and
+ # the start of the last method. We use this value so we can quickly grab
+ # these lines from the file (without having to check each intervening line
+ # for validity, which is expensive) speeding up source extraction.
+ #
+ # @return [Integer] number of lines.
+ #
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:132
+ def number_of_lines_in_first_chunk; end
+
+ # pkg:gem/pry#lib/pry/wrapped_module/candidate.rb:28
+ def yard_docs?(*a, &b); end
+end
diff --git a/sorbet/rbi/gems/rails-dom-testing@2.3.0.rbi b/sorbet/rbi/gems/rails-dom-testing@2.3.0.rbi
new file mode 100644
index 0000000..0230ef8
--- /dev/null
+++ b/sorbet/rbi/gems/rails-dom-testing@2.3.0.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rails-dom-testing` gem.
+# Please instead update this file by running `bin/tapioca gem rails-dom-testing`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/rails-html-sanitizer@1.7.1.rbi b/sorbet/rbi/gems/rails-html-sanitizer@1.7.1.rbi
new file mode 100644
index 0000000..d98def1
--- /dev/null
+++ b/sorbet/rbi/gems/rails-html-sanitizer@1.7.1.rbi
@@ -0,0 +1,9 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rails-html-sanitizer` gem.
+# Please instead update this file by running `bin/tapioca gem rails-html-sanitizer`.
+
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/rainbow@3.1.1.rbi b/sorbet/rbi/gems/rainbow@3.1.1.rbi
new file mode 100644
index 0000000..8e11eec
--- /dev/null
+++ b/sorbet/rbi/gems/rainbow@3.1.1.rbi
@@ -0,0 +1,362 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rainbow` gem.
+# Please instead update this file by running `bin/tapioca gem rainbow`.
+
+
+class Object < ::BasicObject
+ include ::Kernel
+ include ::PP::ObjectMixin
+
+ private
+
+ # pkg:gem/rainbow#lib/rainbow/global.rb:23
+ def Rainbow(string); end
+end
+
+# pkg:gem/rainbow#lib/rainbow/string_utils.rb:3
+module Rainbow
+ class << self
+ # pkg:gem/rainbow#lib/rainbow/global.rb:10
+ def enabled; end
+
+ # pkg:gem/rainbow#lib/rainbow/global.rb:14
+ def enabled=(value); end
+
+ # pkg:gem/rainbow#lib/rainbow/global.rb:6
+ def global; end
+
+ # pkg:gem/rainbow#lib/rainbow.rb:6
+ def new; end
+
+ # pkg:gem/rainbow#lib/rainbow/global.rb:18
+ def uncolor(string); end
+ end
+end
+
+# pkg:gem/rainbow#lib/rainbow/color.rb:4
+class Rainbow::Color
+ # pkg:gem/rainbow#lib/rainbow/color.rb:5
+ def ground; end
+
+ class << self
+ # pkg:gem/rainbow#lib/rainbow/color.rb:7
+ def build(ground, values); end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:40
+ def parse_hex_color(hex); end
+ end
+end
+
+# pkg:gem/rainbow#lib/rainbow/color.rb:54
+class Rainbow::Color::Indexed < ::Rainbow::Color
+ # pkg:gem/rainbow#lib/rainbow/color.rb:57
+ def initialize(ground, num); end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:62
+ def codes; end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:55
+ def num; end
+end
+
+# pkg:gem/rainbow#lib/rainbow/color.rb:69
+class Rainbow::Color::Named < ::Rainbow::Color::Indexed
+ # pkg:gem/rainbow#lib/rainbow/color.rb:90
+ def initialize(ground, name); end
+
+ class << self
+ # pkg:gem/rainbow#lib/rainbow/color.rb:82
+ def color_names; end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:86
+ def valid_names; end
+ end
+end
+
+# pkg:gem/rainbow#lib/rainbow/color.rb:70
+Rainbow::Color::Named::NAMES = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rainbow#lib/rainbow/color.rb:100
+class Rainbow::Color::RGB < ::Rainbow::Color::Indexed
+ # pkg:gem/rainbow#lib/rainbow/color.rb:107
+ def initialize(ground, *values); end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:101
+ def b; end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:116
+ def codes; end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:101
+ def g; end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:101
+ def r; end
+
+ private
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:122
+ def code_from_rgb; end
+
+ class << self
+ # pkg:gem/rainbow#lib/rainbow/color.rb:103
+ def to_ansi_domain(value); end
+ end
+end
+
+# pkg:gem/rainbow#lib/rainbow/color.rb:129
+class Rainbow::Color::X11Named < ::Rainbow::Color::RGB
+ include ::Rainbow::X11ColorNames
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:140
+ def initialize(ground, name); end
+
+ class << self
+ # pkg:gem/rainbow#lib/rainbow/color.rb:132
+ def color_names; end
+
+ # pkg:gem/rainbow#lib/rainbow/color.rb:136
+ def valid_names; end
+ end
+end
+
+# pkg:gem/rainbow#lib/rainbow/null_presenter.rb:4
+class Rainbow::NullPresenter < ::String
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:9
+ def background(*_values); end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:95
+ def bg(*_values); end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:49
+ def black; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:33
+ def blink; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:65
+ def blue; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:96
+ def bold; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:17
+ def bright; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:5
+ def color(*_values); end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:45
+ def cross_out; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:73
+ def cyan; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:97
+ def dark; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:21
+ def faint; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:94
+ def fg(*_values); end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:93
+ def foreground(*_values); end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:57
+ def green; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:41
+ def hide; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:37
+ def inverse; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:25
+ def italic; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:69
+ def magenta; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:81
+ def method_missing(method_name, *args); end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:53
+ def red; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:13
+ def reset; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:98
+ def strike; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:29
+ def underline; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:77
+ def white; end
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:61
+ def yellow; end
+
+ private
+
+ # pkg:gem/rainbow#lib/rainbow/null_presenter.rb:89
+ def respond_to_missing?(method_name, *args); end
+end
+
+# pkg:gem/rainbow#lib/rainbow/presenter.rb:8
+class Rainbow::Presenter < ::String
+ # Sets background color of this text.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:30
+ def background(*values); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:34
+ def bg(*values); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:92
+ def black; end
+
+ # Turns on blinking attribute for this text (not well supported by terminal
+ # emulators).
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:72
+ def blink; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:108
+ def blue; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:49
+ def bold; end
+
+ # Turns on bright/bold for this text.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:45
+ def bright; end
+
+ # Sets color of this text.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:22
+ def color(*values); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:86
+ def cross_out; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:116
+ def cyan; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:57
+ def dark; end
+
+ # Turns on faint/dark for this text (not well supported by terminal
+ # emulators).
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:53
+ def faint; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:27
+ def fg(*values); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:26
+ def foreground(*values); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:100
+ def green; end
+
+ # Hides this text (set its color to the same as background).
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:82
+ def hide; end
+
+ # Inverses current foreground/background colors.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:77
+ def inverse; end
+
+ # Turns on italic style for this text (not well supported by terminal
+ # emulators).
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:61
+ def italic; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:112
+ def magenta; end
+
+ # We take care of X11 color method call here.
+ # Such as #aqua, #ghostwhite.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:126
+ def method_missing(method_name, *args); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:96
+ def red; end
+
+ # Resets terminal to default colors/backgrounds.
+ #
+ # It shouldn't be needed to use this method because all methods
+ # append terminal reset code to end of string.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:40
+ def reset; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:90
+ def strike; end
+
+ # Turns on underline decoration for this text.
+ #
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:66
+ def underline; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:120
+ def white; end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:104
+ def yellow; end
+
+ private
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:134
+ def respond_to_missing?(method_name, *args); end
+
+ # pkg:gem/rainbow#lib/rainbow/presenter.rb:140
+ def wrap_with_sgr(codes); end
+end
+
+# pkg:gem/rainbow#lib/rainbow/presenter.rb:9
+Rainbow::Presenter::TERM_EFFECTS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rainbow#lib/rainbow/string_utils.rb:4
+class Rainbow::StringUtils
+ class << self
+ # pkg:gem/rainbow#lib/rainbow/string_utils.rb:17
+ def uncolor(string); end
+
+ # pkg:gem/rainbow#lib/rainbow/string_utils.rb:5
+ def wrap_with_sgr(string, codes); end
+ end
+end
+
+# pkg:gem/rainbow#lib/rainbow/wrapper.rb:7
+class Rainbow::Wrapper
+ # pkg:gem/rainbow#lib/rainbow/wrapper.rb:10
+ def initialize(enabled = T.unsafe(nil)); end
+
+ # pkg:gem/rainbow#lib/rainbow/wrapper.rb:8
+ def enabled; end
+
+ # pkg:gem/rainbow#lib/rainbow/wrapper.rb:8
+ def enabled=(_arg0); end
+
+ # pkg:gem/rainbow#lib/rainbow/wrapper.rb:14
+ def wrap(string); end
+end
+
+# pkg:gem/rainbow#lib/rainbow/x11_color_names.rb:4
+module Rainbow::X11ColorNames; end
+
+# pkg:gem/rainbow#lib/rainbow/x11_color_names.rb:5
+Rainbow::X11ColorNames::NAMES = T.let(T.unsafe(nil), Hash)
diff --git a/sorbet/rbi/gems/rake@13.4.2.rbi b/sorbet/rbi/gems/rake@13.4.2.rbi
new file mode 100644
index 0000000..a310a8c
--- /dev/null
+++ b/sorbet/rbi/gems/rake@13.4.2.rbi
@@ -0,0 +1,3127 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rake` gem.
+# Please instead update this file by running `bin/tapioca gem rake`.
+
+
+# :stopdoc:
+#
+# Some top level Constants.
+#
+# pkg:gem/rake#lib/rake.rb:68
+FileList = Rake::FileList
+
+# --
+# This a FileUtils extension that defines several additional commands to be
+# added to the FileUtils utility functions.
+#
+# pkg:gem/rake#lib/rake/file_utils.rb:8
+module FileUtils
+ # Run a Ruby interpreter with the given arguments.
+ #
+ # Example:
+ # ruby %{-pe '$_.upcase!' ; rm # -rf /.
+ #
+ # If a block is given, upon command completion the block is called with an
+ # OK flag (true on a zero exit status) and a Process::Status object.
+ # Without a block a RuntimeError is raised when the command exits non-zero.
+ #
+ # Examples:
+ #
+ # sh 'ls -ltr'
+ #
+ # sh 'ls', 'file with spaces'
+ #
+ # # check exit status after command runs
+ # sh %{grep pattern file} do |ok, res|
+ # if !ok
+ # puts "pattern not found (status = #{res.exitstatus})"
+ # end
+ # end
+ #
+ # pkg:gem/rake#lib/rake/file_utils.rb:43
+ def sh(*cmd, &block); end
+
+ # Split a file path into individual directory names.
+ #
+ # Example:
+ # split_all("a/b/c") => ['a', 'b', 'c']
+ #
+ # pkg:gem/rake#lib/rake/file_utils.rb:131
+ def split_all(path); end
+
+ private
+
+ # pkg:gem/rake#lib/rake/file_utils.rb:61
+ def create_shell_runner(cmd); end
+
+ # pkg:gem/rake#lib/rake/file_utils.rb:89
+ def set_verbose_option(options); end
+
+ # pkg:gem/rake#lib/rake/file_utils.rb:71
+ def sh_show_command(cmd, options = T.unsafe(nil)); end
+end
+
+# pkg:gem/rake#lib/rake/file_utils.rb:111
+FileUtils::LN_SUPPORTED = T.let(T.unsafe(nil), Array)
+
+# Path to the currently running Ruby program
+#
+# pkg:gem/rake#lib/rake/file_utils.rb:10
+FileUtils::RUBY = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rake#lib/rake/ext/core.rb:2
+class Module
+ # Check for an existing method in the current class before extending. If
+ # the method already exists, then a warning is printed and the extension is
+ # not added. Otherwise the block is yielded and any definitions in the
+ # block will take effect.
+ #
+ # Usage:
+ #
+ # class String
+ # rake_extension("xyz") do
+ # def xyz
+ # ...
+ # end
+ # end
+ # end
+ #
+ # pkg:gem/rake#lib/rake/ext/core.rb:18
+ def rake_extension(method); end
+end
+
+# --
+# Copyright 2003-2010 by Jim Weirich (jim.weirich@gmail.com)
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to
+# deal in the Software without restriction, including without limitation the
+# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+# sell copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+# IN THE SOFTWARE.
+# ++
+# :stopdoc:
+#
+# pkg:gem/rake#lib/rake.rb:24
+module Rake
+ extend ::FileUtils::StreamUtils_
+ extend ::FileUtils
+ extend ::Rake::FileUtilsExt
+
+ class << self
+ # Add files to the rakelib list
+ #
+ # pkg:gem/rake#lib/rake/rake_module.rb:33
+ def add_rakelib(*files); end
+
+ # Current Rake Application
+ #
+ # pkg:gem/rake#lib/rake/rake_module.rb:8
+ def application; end
+
+ # Set the current Rake application object.
+ #
+ # pkg:gem/rake#lib/rake/rake_module.rb:13
+ def application=(app); end
+
+ # Yield each file or directory component.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:418
+ def each_dir_parent(dir); end
+
+ # Convert Pathname and Pathname-like objects to strings;
+ # leave everything else alone
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:429
+ def from_pathname(path); end
+
+ # Load a rakefile.
+ #
+ # pkg:gem/rake#lib/rake/rake_module.rb:28
+ def load_rakefile(path); end
+
+ # Return the original directory where the Rake application was started.
+ #
+ # pkg:gem/rake#lib/rake/rake_module.rb:23
+ def original_dir; end
+
+ # pkg:gem/rake#lib/rake/rake_module.rb:17
+ def suggested_thread_count; end
+
+ # Make +block_application+ the default rake application inside a block so
+ # you can load rakefiles into a different application.
+ #
+ # This is useful when you want to run rake tasks inside a library without
+ # running rake in a sub-shell.
+ #
+ # Example:
+ #
+ # Dir.chdir 'other/directory'
+ #
+ # other_rake = Rake.with_application do |rake|
+ # rake.load_rakefile
+ # end
+ #
+ # puts other_rake.tasks
+ #
+ # pkg:gem/rake#lib/rake/rake_module.rb:54
+ def with_application(block_application = T.unsafe(nil)); end
+ end
+end
+
+# Rake main application object. When invoking +rake+ from the
+# command line, a Rake::Application object is created and run.
+#
+# pkg:gem/rake#lib/rake/application.rb:20
+class Rake::Application
+ include ::Rake::TaskManager
+ include ::Rake::TraceOutput
+
+ # Initialize a Rake::Application object.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:50
+ def initialize; end
+
+ # Add a file to the list of files to be imported.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:793
+ def add_import(fn); end
+
+ # Add a loader to handle imported files ending in the extension
+ # +ext+.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:162
+ def add_loader(ext, loader); end
+
+ # Collect the list of tasks on the command line. If no tasks are
+ # given, return a list containing only the default task.
+ # Environmental assignments are processed at this time as well.
+ #
+ # `args` is the list of arguments to peruse to get the list of tasks.
+ # It should be the command line that was given to rake, less any
+ # recognised command-line options, which OptionParser.parse will
+ # have taken care of already.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:774
+ def collect_command_line_tasks(args); end
+
+ # Default task name ("default").
+ # (May be overridden by subclasses)
+ #
+ # pkg:gem/rake#lib/rake/application.rb:788
+ def default_task_name; end
+
+ # Warn about deprecated usage.
+ #
+ # Example:
+ # Rake.application.deprecate("import", "Rake.import", caller.first)
+ #
+ # pkg:gem/rake#lib/rake/application.rb:283
+ def deprecate(old_usage, new_usage, call_site); end
+
+ # pkg:gem/rake#lib/rake/application.rb:245
+ def display_cause_details(ex); end
+
+ # Display the error message that caused the exception.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:229
+ def display_error_message(ex); end
+
+ # pkg:gem/rake#lib/rake/application.rb:270
+ def display_exception_backtrace(ex); end
+
+ # pkg:gem/rake#lib/rake/application.rb:237
+ def display_exception_details(ex); end
+
+ # pkg:gem/rake#lib/rake/application.rb:252
+ def display_exception_details_seen; end
+
+ # pkg:gem/rake#lib/rake/application.rb:260
+ def display_exception_message_details(ex); end
+
+ # Display the tasks and prerequisites
+ #
+ # pkg:gem/rake#lib/rake/application.rb:406
+ def display_prerequisites; end
+
+ # Display the tasks and comments.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:323
+ def display_tasks_and_comments; end
+
+ # Calculate the dynamic width of the
+ #
+ # pkg:gem/rake#lib/rake/application.rb:374
+ def dynamic_width; end
+
+ # pkg:gem/rake#lib/rake/application.rb:378
+ def dynamic_width_stty; end
+
+ # pkg:gem/rake#lib/rake/application.rb:382
+ def dynamic_width_tput; end
+
+ # Exit the program because of an unhandled exception.
+ # (may be overridden by subclasses)
+ #
+ # pkg:gem/rake#lib/rake/application.rb:224
+ def exit_because_of_exception(ex); end
+
+ # pkg:gem/rake#lib/rake/application.rb:703
+ def find_rakefile_location; end
+
+ # Read and handle the command line options. Returns the command line
+ # arguments that we didn't understand, which should (in theory) be just
+ # task names and env vars.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:669
+ def handle_options(argv); end
+
+ # pkg:gem/rake#lib/rake/application.rb:256
+ def has_cause?(ex); end
+
+ # True if one of the files in RAKEFILES is in the current directory.
+ # If a match is found, it is copied into @rakefile.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:299
+ def have_rakefile; end
+
+ # Initialize the command line parameters and app name.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:89
+ def init(app_name = T.unsafe(nil), argv = T.unsafe(nil)); end
+
+ # Invokes a task with arguments that are extracted from +task_string+
+ #
+ # pkg:gem/rake#lib/rake/application.rb:180
+ def invoke_task(task_string); end
+
+ # Load the pending list of imported files.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:798
+ def load_imports; end
+
+ # Find the rakefile and then load it and any pending imports.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:125
+ def load_rakefile; end
+
+ # The name of the application (typically 'rake')
+ #
+ # pkg:gem/rake#lib/rake/application.rb:25
+ def name; end
+
+ # Application options from the command line
+ #
+ # pkg:gem/rake#lib/rake/application.rb:168
+ def options; end
+
+ # The original directory where rake was invoked.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:28
+ def original_dir; end
+
+ # pkg:gem/rake#lib/rake/application.rb:186
+ def parse_task_string(string); end
+
+ # pkg:gem/rake#lib/rake/application.rb:715
+ def print_rakefile_directory(location); end
+
+ # Similar to the regular Ruby +require+ command, but will check
+ # for *.rake files in addition to *.rb files.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:689
+ def rake_require(file_name, paths = T.unsafe(nil), loaded = T.unsafe(nil)); end
+
+ # Name of the actual rakefile used.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:31
+ def rakefile; end
+
+ # pkg:gem/rake#lib/rake/application.rb:814
+ def rakefile_location(backtrace = T.unsafe(nil)); end
+
+ # pkg:gem/rake#lib/rake/application.rb:720
+ def raw_load_rakefile; end
+
+ # Run the Rake application. The run method performs the following
+ # three steps:
+ #
+ # * Initialize the command line options (+init+).
+ # * Define the tasks (+load_rakefile+).
+ # * Run the top level tasks (+top_level+).
+ #
+ # If you wish to build a custom rake command, you should call
+ # +init+ on your application. Then define any tasks. Finally,
+ # call +top_level+ to run your top level tasks.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:80
+ def run(argv = T.unsafe(nil)); end
+
+ # Run the given block with the thread startup and shutdown.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:145
+ def run_with_threads; end
+
+ # pkg:gem/rake#lib/rake/application.rb:823
+ def set_default_options; end
+
+ # Provide standard exception handling for the given block.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:208
+ def standard_exception_handling; end
+
+ # A list of all the standard options used in rake, suitable for
+ # passing to OptionParser.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:427
+ def standard_rake_options; end
+
+ # The directory path containing the system wide rakefiles.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:752
+ def system_dir; end
+
+ # Number of columns on the terminal
+ #
+ # pkg:gem/rake#lib/rake/application.rb:34
+ def terminal_columns; end
+
+ # Number of columns on the terminal
+ #
+ # pkg:gem/rake#lib/rake/application.rb:34
+ def terminal_columns=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/application.rb:362
+ def terminal_width; end
+
+ # Return the thread pool used for multithreaded processing.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:173
+ def thread_pool; end
+
+ # Run the top level tasks of a Rake application.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:132
+ def top_level; end
+
+ # List of the top level task names (task names from the command line).
+ #
+ # pkg:gem/rake#lib/rake/application.rb:37
+ def top_level_tasks; end
+
+ # pkg:gem/rake#lib/rake/application.rb:413
+ def trace(*strings); end
+
+ # pkg:gem/rake#lib/rake/application.rb:395
+ def truncate(string, width); end
+
+ # We will truncate output if we are outputting to a TTY or if we've been
+ # given an explicit column width to honor
+ #
+ # pkg:gem/rake#lib/rake/application.rb:318
+ def truncate_output?; end
+
+ # Override the detected TTY output state (mostly for testing)
+ #
+ # pkg:gem/rake#lib/rake/application.rb:40
+ def tty_output=(_arg0); end
+
+ # True if we are outputting to TTY, false otherwise
+ #
+ # pkg:gem/rake#lib/rake/application.rb:312
+ def tty_output?; end
+
+ # pkg:gem/rake#lib/rake/application.rb:386
+ def unix?; end
+
+ # pkg:gem/rake#lib/rake/application.rb:391
+ def windows?; end
+
+ private
+
+ # pkg:gem/rake#lib/rake/application.rb:746
+ def glob(path, &block); end
+
+ # Does the exception have a task invocation chain?
+ #
+ # pkg:gem/rake#lib/rake/application.rb:292
+ def has_chain?(exception); end
+
+ # pkg:gem/rake#lib/rake/application.rb:103
+ def load_debug_at_stop_feature; end
+
+ # pkg:gem/rake#lib/rake/application.rb:645
+ def select_tasks_to_show(options, show_tasks, value); end
+
+ # pkg:gem/rake#lib/rake/application.rb:652
+ def select_trace_output(options, trace_option, value); end
+
+ # pkg:gem/rake#lib/rake/application.rb:418
+ def sort_options(options); end
+
+ # The standard directory containing system wide rake files.
+ #
+ # pkg:gem/rake#lib/rake/application.rb:757
+ def standard_system_dir; end
+end
+
+# pkg:gem/rake#lib/rake/application.rb:42
+Rake::Application::DEFAULT_RAKEFILES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/backtrace.rb:3
+module Rake::Backtrace
+ class << self
+ # pkg:gem/rake#lib/rake/backtrace.rb:19
+ def collapse(backtrace); end
+ end
+end
+
+# pkg:gem/rake#lib/rake/backtrace.rb:8
+Rake::Backtrace::SUPPRESSED_PATHS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/backtrace.rb:12
+Rake::Backtrace::SUPPRESSED_PATHS_RE = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rake#lib/rake/backtrace.rb:17
+Rake::Backtrace::SUPPRESS_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/rake#lib/rake/backtrace.rb:4
+Rake::Backtrace::SYS_KEYS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/backtrace.rb:5
+Rake::Backtrace::SYS_PATHS = T.let(T.unsafe(nil), Array)
+
+# Mixin for creating easily cloned objects.
+#
+# pkg:gem/rake#lib/rake/cloneable.rb:6
+module Rake::Cloneable
+ private
+
+ # The hook that is invoked by 'clone' and 'dup' methods.
+ #
+ # pkg:gem/rake#lib/rake/cloneable.rb:8
+ def initialize_copy(source); end
+end
+
+# pkg:gem/rake#lib/rake/application.rb:14
+class Rake::CommandLineOptionError < ::StandardError; end
+
+# Based on a script at:
+# http://stackoverflow.com/questions/891537/ruby-detect-number-of-cpus-installed
+#
+# pkg:gem/rake#lib/rake/cpu_counter.rb:6
+class Rake::CpuCounter
+ # pkg:gem/rake#lib/rake/cpu_counter.rb:22
+ def count; end
+
+ # pkg:gem/rake#lib/rake/cpu_counter.rb:11
+ def count_with_default(default = T.unsafe(nil)); end
+
+ class << self
+ # pkg:gem/rake#lib/rake/cpu_counter.rb:7
+ def count; end
+ end
+end
+
+# DSL is a module that provides #task, #desc, #namespace, etc. Use this
+# when you'd like to use rake outside the top level scope.
+#
+# For a Rakefile you run from the command line this module is automatically
+# included.
+#
+# pkg:gem/rake#lib/rake/dsl_definition.rb:14
+module Rake::DSL
+ include ::FileUtils::StreamUtils_
+ include ::FileUtils
+ include ::Rake::FileUtilsExt
+
+ private
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def cd(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def chdir(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def chmod(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def chmod_R(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def chown(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def chown_R(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def copy(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def cp(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def cp_lr(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def cp_r(*args, **options, &block); end
+
+ # Describes the next rake task. Duplicate descriptions are discarded.
+ # Descriptions are shown with rake -T (up to the first
+ # sentence) and rake -D (the entire description).
+ #
+ # Example:
+ # desc "Run the Unit Tests"
+ # task test: [:build] do
+ # # ... run tests
+ # end
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:166
+ def desc(description); end
+
+ # Declare a set of files tasks to create the given directories on
+ # demand.
+ #
+ # Example:
+ # directory "testdata/doc"
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:92
+ def directory(*args, &block); end
+
+ # Declare a file task.
+ #
+ # Example:
+ # file "config.cfg" => ["config.template"] do
+ # open("config.cfg", "w") do |outfile|
+ # open("config.template") do |infile|
+ # while line = infile.gets
+ # outfile.puts line
+ # end
+ # end
+ # end
+ # end
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:76
+ def file(*args, &block); end
+
+ # Declare a file creation task.
+ # (Mainly used for the directory command).
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:82
+ def file_create(*args, &block); end
+
+ # Import the partial Rakefiles +fn+. Imported files are loaded
+ # _after_ the current file is completely loaded. This allows the
+ # import statement to appear anywhere in the importing file, and yet
+ # allowing the imported files to depend on objects defined in the
+ # importing file.
+ #
+ # A common use of the import statement is to include files
+ # containing dependency declarations.
+ #
+ # See also the --rakelibdir command line option.
+ #
+ # Example:
+ # import ".depend", "my_rules"
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:184
+ def import(*fns); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def install(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def link(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def ln(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def ln_s(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def ln_sf(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def ln_sr(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def makedirs(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def mkdir(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def mkdir_p(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def mkpath(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def move(*args, **options, &block); end
+
+ # Declare a task that performs its prerequisites in
+ # parallel. Multitasks does *not* guarantee that its prerequisites
+ # will execute in any given order (which is obvious when you think
+ # about it)
+ #
+ # Example:
+ # multitask deploy: %w[deploy_gem deploy_rdoc]
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:113
+ def multitask(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def mv(*args, **options, &block); end
+
+ # Create a new rake namespace and use it for evaluating the given
+ # block. Returns a NameSpace object that can be used to lookup
+ # tasks defined in the namespace.
+ #
+ # Example:
+ #
+ # ns = namespace "nested" do
+ # # the "nested:run" task
+ # task :run
+ # end
+ # task_run = ns[:run] # find :run in the given namespace.
+ #
+ # Tasks can also be defined in a namespace by using a ":" in the task
+ # name:
+ #
+ # task "nested:test" do
+ # # ...
+ # end
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:136
+ def namespace(name = T.unsafe(nil), &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def nowrite(value = T.unsafe(nil)); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rake_check_options(options, *optdecl); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rake_output_message(message); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def remove(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rm(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rm_f(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rm_r(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rm_rf(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rmdir(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def rmtree(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:23
+ def ruby(*args, **options, &block); end
+
+ # Declare a rule for auto-tasks.
+ #
+ # Example:
+ # rule '.o' => '.c' do |t|
+ # sh 'cc', '-c', '-o', t.name, t.source
+ # end
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:152
+ def rule(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:23
+ def safe_ln(*args, **options); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def safe_unlink(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:23
+ def sh(*cmd, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:23
+ def split_all(path); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def symlink(*args, **options, &block); end
+
+ # :call-seq:
+ # task(task_name)
+ # task(task_name: dependencies)
+ # task(task_name, arguments => dependencies)
+ #
+ # Declare a basic task. The +task_name+ is always the first argument. If
+ # the task name contains a ":" it is defined in that namespace.
+ #
+ # The +dependencies+ may be a single task name or an Array of task names.
+ # The +argument+ (a single name) or +arguments+ (an Array of names) define
+ # the arguments provided to the task.
+ #
+ # The task, argument and dependency names may be either symbols or
+ # strings.
+ #
+ # A task with a single dependency:
+ #
+ # task clobber: %w[clean] do
+ # rm_rf "html"
+ # end
+ #
+ # A task with an argument and a dependency:
+ #
+ # task :package, [:version] => :test do |t, args|
+ # # ...
+ # end
+ #
+ # To invoke this task from the command line:
+ #
+ # $ rake package[1.2.3]
+ #
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:59
+ def task(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def touch(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def verbose(value = T.unsafe(nil)); end
+
+ # pkg:gem/rake#lib/rake/dsl_definition.rb:24
+ def when_writing(msg = T.unsafe(nil)); end
+end
+
+# Default Rakefile loader used by +import+.
+#
+# pkg:gem/rake#lib/rake/default_loader.rb:5
+class Rake::DefaultLoader
+ # Loads a rakefile into the current application from +fn+
+ #
+ # pkg:gem/rake#lib/rake/default_loader.rb:10
+ def load(fn); end
+end
+
+# pkg:gem/rake#lib/rake/early_time.rb:21
+Rake::EARLY = T.let(T.unsafe(nil), Rake::EarlyTime)
+
+# pkg:gem/rake#lib/rake/task_arguments.rb:112
+Rake::EMPTY_TASK_ARGS = T.let(T.unsafe(nil), Rake::TaskArguments)
+
+# EarlyTime is a fake timestamp that occurs _before_ any other time value.
+#
+# pkg:gem/rake#lib/rake/early_time.rb:5
+class Rake::EarlyTime
+ include ::Comparable
+ include ::Singleton::SingletonInstanceMethods
+ include ::Singleton
+ extend ::Singleton::SingletonClassMethods
+
+ # The EarlyTime always comes before +other+!
+ #
+ # pkg:gem/rake#lib/rake/early_time.rb:12
+ def <=>(other); end
+
+ # pkg:gem/rake#lib/rake/early_time.rb:16
+ def to_s; end
+
+ class << self
+ private
+
+ # pkg:gem/rake#lib/rake/early_time.rb:7
+ def allocate; end
+
+ # pkg:gem/rake#lib/rake/early_time.rb:7
+ def new(*_arg0); end
+ end
+end
+
+# A FileCreationTask is a file task that when used as a dependency will be
+# needed if and only if the file has not been created. Once created, it is
+# not re-triggered if any of its dependencies are newer, nor does trigger
+# any rebuilds of tasks that depend on it whenever it is updated.
+#
+# pkg:gem/rake#lib/rake/file_creation_task.rb:12
+class Rake::FileCreationTask < ::Rake::FileTask
+ # Is this file task needed? Yes if it doesn't exist.
+ #
+ # pkg:gem/rake#lib/rake/file_creation_task.rb:14
+ def needed?; end
+
+ # Time stamp for file creation task. This time stamp is earlier
+ # than any other time stamp.
+ #
+ # pkg:gem/rake#lib/rake/file_creation_task.rb:20
+ def timestamp; end
+end
+
+# A FileList is essentially an array with a few helper methods defined to
+# make file manipulation a bit easier.
+#
+# FileLists are lazy. When given a list of glob patterns for possible files
+# to be included in the file list, instead of searching the file structures
+# to find the files, a FileList holds the pattern for latter use.
+#
+# This allows us to define a number of FileList to match any number of
+# files, but only search out the actual files when then FileList itself is
+# actually used. The key is that the first time an element of the
+# FileList/Array is requested, the pending patterns are resolved into a real
+# list of file names.
+#
+# pkg:gem/rake#lib/rake/file_list.rb:22
+class Rake::FileList
+ include ::Rake::Cloneable
+
+ # Create a file list from the globbable patterns given. If you wish to
+ # perform multiple includes or excludes at object build time, use the
+ # "yield self" pattern.
+ #
+ # Example:
+ # file_list = FileList.new('lib/**/*.rb', 'test/test*.rb')
+ #
+ # pkg_files = FileList.new('lib/**/*') do |fl|
+ # fl.exclude(/\bCVS\b/)
+ # end
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:99
+ def initialize(*patterns); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def &(*args, &block); end
+
+ # Redefine * to return either a string or a new file list.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:193
+ def *(other); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def +(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def -(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:203
+ def <<(obj); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def <=>(*args, &block); end
+
+ # A FileList is equal through array equality.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:171
+ def ==(array); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def [](*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def []=(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:128
+ def add(*filenames); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def all?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def any?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def append(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def assoc(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def at(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def bsearch(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def bsearch_index(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def chain(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def chunk(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def chunk_while(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def clear(*args, &block); end
+
+ # Clear all the exclude patterns so that we exclude nothing.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:164
+ def clear_exclude; end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def collect(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def collect!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def collect_concat(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def combination(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def compact(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def compact!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def concat(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def count(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def cycle(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def deconstruct(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def delete(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def delete_at(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def delete_if(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def detect(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def difference(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def dig(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def drop(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def drop_while(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each_cons(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each_entry(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each_index(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each_slice(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each_with_index(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def each_with_object(*args, &block); end
+
+ # Grep each of the files in the filelist using the given pattern. If a
+ # block is given, call the block on each matching line, passing the file
+ # name, line number, and the matching line of text. If no block is given,
+ # a standard emacs style file:linenumber:line message will be printed to
+ # standard out. Returns the number of matched items.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:293
+ def egrep(pattern, *options); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def empty?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def entries(*args, &block); end
+
+ # Register a list of file name patterns that should be excluded from the
+ # list. Patterns may be regular expressions, glob patterns or regular
+ # strings. In addition, a block given to exclude will remove entries that
+ # return true when given to the block.
+ #
+ # Note that glob patterns are expanded against the file system. If a file
+ # is explicitly added to a file list, but does not exist in the file
+ # system, then an glob pattern in the exclude list will not exclude the
+ # file.
+ #
+ # Examples:
+ # FileList['a.c', 'b.c'].exclude("a.c") => ['b.c']
+ # FileList['a.c', 'b.c'].exclude(/^a/) => ['b.c']
+ #
+ # If "a.c" is a file, then ...
+ # FileList['a.c', 'b.c'].exclude("a.*") => ['b.c']
+ #
+ # If "a.c" is not a file, then ...
+ # FileList['a.c', 'b.c'].exclude("a.*") => ['a.c', 'b.c']
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:150
+ def exclude(*patterns, &block); end
+
+ # Should the given file name be excluded from the list?
+ #
+ # NOTE: This method was formerly named "exclude?", but Rails
+ # introduced an exclude? method as an array method and setup a
+ # conflict with file list. We renamed the method to avoid
+ # confusion. If you were using "FileList#exclude?" in your user
+ # code, you will need to update.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:364
+ def excluded_from_list?(fn); end
+
+ # Return a new file list that only contains file names from the current
+ # file list that exist on the file system.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:320
+ def existing; end
+
+ # Modify the current file list so that it contains only file name that
+ # exist on the file system.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:326
+ def existing!; end
+
+ # Return a new FileList with String#ext method applied to
+ # each member of the array.
+ #
+ # This method is a shortcut for:
+ #
+ # array.collect { |item| item.ext(newext) }
+ #
+ # +ext+ is a user added method for the Array class.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:284
+ def ext(newext = T.unsafe(nil)); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def fetch(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def fetch_values(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def fill(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def filter(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def filter!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def filter_map(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def find(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def find_all(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def find_index(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def first(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def flat_map(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def flatten(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def flatten!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def grep(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def grep_v(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def group_by(*args, &block); end
+
+ # Return a new FileList with the results of running +gsub+ against each
+ # element of the original list.
+ #
+ # Example:
+ # FileList['lib/test/file', 'x/y'].gsub(/\//, "\\")
+ # => ['lib\\test\\file', 'x\\y']
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:253
+ def gsub(pat, rep); end
+
+ # Same as +gsub+ except that the original file list is modified.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:264
+ def gsub!(pat, rep); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:391
+ def import(array); end
+
+ # Add file names defined by glob patterns to the file list. If an array
+ # is given, add each element of the array.
+ #
+ # Example:
+ # file_list.include("*.java", "*.cfg")
+ # file_list.include %w( math.c lib.h *.o )
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:116
+ def include(*filenames); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def include?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def index(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def inject(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def insert(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def inspect(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def intersect?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def intersection(*args, &block); end
+
+ # Lie about our class.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:187
+ def is_a?(klass); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def join(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def keep_if(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:190
+ def kind_of?(klass); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def last(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def lazy(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def length(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def map(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def map!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def max(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def max_by(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def member?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def min(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def min_by(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def minmax(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def minmax_by(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def none?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def one?(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def pack(*args, &block); end
+
+ # FileList version of partition. Needed because the nested arrays should
+ # be FileLists in this version.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:334
+ def partition(&block); end
+
+ # Apply the pathmap spec to each of the included file names, returning a
+ # new file list with the modified paths. (See String#pathmap for
+ # details.)
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:272
+ def pathmap(spec = T.unsafe(nil), &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def permutation(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def pop(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def prepend(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def product(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def push(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def rassoc(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def reduce(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def reject(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def reject!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def repeated_combination(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def repeated_permutation(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def replace(*args, &block); end
+
+ # Resolve all the pending adds now.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:210
+ def resolve; end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def reverse(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def reverse!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def reverse_each(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def rindex(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def rotate(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def rotate!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def sample(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def select(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def select!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def shelljoin(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def shift(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def shuffle(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def shuffle!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def size(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def slice(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def slice!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def slice_after(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def slice_before(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def slice_when(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def sort(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def sort!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def sort_by(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def sort_by!(*args, &block); end
+
+ # Return a new FileList with the results of running +sub+ against each
+ # element of the original list.
+ #
+ # Example:
+ # FileList['a.c', 'b.c'].sub(/\.c$/, '.o') => ['a.o', 'b.o']
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:242
+ def sub(pat, rep); end
+
+ # Same as +sub+ except that the original file list is modified.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:258
+ def sub!(pat, rep); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def sum(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def take(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def take_while(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def tally(*args, &block); end
+
+ # Return the internal array object.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:176
+ def to_a; end
+
+ # Return the internal array object.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:182
+ def to_ary; end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def to_h(*args, &block); end
+
+ # Convert a FileList to a string by joining all elements with a space.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:344
+ def to_s; end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def to_set(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def transpose(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def union(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def uniq(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def uniq!(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def unshift(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def values_at(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:76
+ def zip(*args, &block); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:67
+ def |(*args, &block); end
+
+ private
+
+ # Add matching glob patterns.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:350
+ def add_matching(pattern); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:220
+ def resolve_add(fn); end
+
+ # pkg:gem/rake#lib/rake/file_list.rb:230
+ def resolve_exclude; end
+
+ class << self
+ # Create a new file list including the files listed. Similar to:
+ #
+ # FileList.new(*args)
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:400
+ def [](*args); end
+
+ # Get a sorted list of files matching the pattern. This method
+ # should be preferred to Dir[pattern] and Dir.glob(pattern) because
+ # the files returned are guaranteed to be sorted.
+ #
+ # pkg:gem/rake#lib/rake/file_list.rb:407
+ def glob(pattern, *args); end
+ end
+end
+
+# List of array methods (that are not in +Object+) that need to be
+# delegated.
+#
+# pkg:gem/rake#lib/rake/file_list.rb:44
+Rake::FileList::ARRAY_METHODS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/file_list.rb:381
+Rake::FileList::DEFAULT_IGNORE_PATTERNS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/file_list.rb:387
+Rake::FileList::DEFAULT_IGNORE_PROCS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/file_list.rb:61
+Rake::FileList::DELEGATING_METHODS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/file_list.rb:86
+Rake::FileList::GLOB_PATTERN = T.let(T.unsafe(nil), Regexp)
+
+# List of additional methods that must be delegated.
+#
+# pkg:gem/rake#lib/rake/file_list.rb:47
+Rake::FileList::MUST_DEFINE = T.let(T.unsafe(nil), Array)
+
+# List of methods that should not be delegated here (we define special
+# versions of them explicitly below).
+#
+# pkg:gem/rake#lib/rake/file_list.rb:51
+Rake::FileList::MUST_NOT_DEFINE = T.let(T.unsafe(nil), Array)
+
+# List of delegated methods that return new array values which need
+# wrapping.
+#
+# pkg:gem/rake#lib/rake/file_list.rb:55
+Rake::FileList::SPECIAL_RETURN = T.let(T.unsafe(nil), Array)
+
+# A FileTask is a task that includes time based dependencies. If any of a
+# FileTask's prerequisites have a timestamp that is later than the file
+# represented by this task, then the file must be rebuilt (using the
+# supplied actions).
+#
+# pkg:gem/rake#lib/rake/file_task.rb:12
+class Rake::FileTask < ::Rake::Task
+ # Is this file task needed? Yes if it doesn't exist, or if its time stamp
+ # is out of date.
+ #
+ # pkg:gem/rake#lib/rake/file_task.rb:16
+ def needed?; end
+
+ # Time stamp for file task.
+ #
+ # pkg:gem/rake#lib/rake/file_task.rb:25
+ def timestamp; end
+
+ private
+
+ # Are there any prerequisites with a later time than the given time stamp?
+ #
+ # pkg:gem/rake#lib/rake/file_task.rb:36
+ def out_of_date?(stamp); end
+
+ class << self
+ # Apply the scope to the task name according to the rules for this kind
+ # of task. File based tasks ignore the scope when creating the name.
+ #
+ # pkg:gem/rake#lib/rake/file_task.rb:53
+ def scope_name(scope, task_name); end
+ end
+end
+
+# FileUtilsExt provides a custom version of the FileUtils methods
+# that respond to the verbose and nowrite
+# commands.
+#
+# pkg:gem/rake#lib/rake/file_utils_ext.rb:10
+module Rake::FileUtilsExt
+ include ::FileUtils::StreamUtils_
+ include ::FileUtils
+ extend ::FileUtils::StreamUtils_
+ extend ::FileUtils
+ extend ::Rake::FileUtilsExt
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def cd(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def chdir(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def chmod(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def chmod_R(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def chown(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def chown_R(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def copy(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def cp(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def cp_lr(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def cp_r(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def install(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def link(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def ln(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def ln_s(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def ln_sf(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def ln_sr(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def makedirs(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def mkdir(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def mkdir_p(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def mkpath(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def move(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def mv(*args, **options, &block); end
+
+ # Get/set the nowrite flag controlling output from the FileUtils
+ # utilities. If verbose is true, then the utility method is
+ # echoed to standard output.
+ #
+ # Examples:
+ # nowrite # return the current value of the
+ # # nowrite flag
+ # nowrite(v) # set the nowrite flag to _v_.
+ # nowrite(v) { code } # Execute code with the nowrite flag set
+ # # temporarily to _v_. Return to the
+ # # original value when code is done.
+ #
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:78
+ def nowrite(value = T.unsafe(nil)); end
+
+ # Check that the options do not contain options not listed in
+ # +optdecl+. An ArgumentError exception is thrown if non-declared
+ # options are found.
+ #
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:124
+ def rake_check_options(options, *optdecl); end
+
+ # Send the message to the default rake output (which is $stderr).
+ #
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:117
+ def rake_output_message(message); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def remove(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def rm(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def rm_f(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def rm_r(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def rm_rf(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def rmdir(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def rmtree(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def safe_unlink(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def symlink(*args, **options, &block); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:33
+ def touch(*args, **options, &block); end
+
+ # Get/set the verbose flag controlling output from the FileUtils
+ # utilities. If verbose is true, then the utility method is
+ # echoed to standard output.
+ #
+ # Examples:
+ # verbose # return the current value of the
+ # # verbose flag
+ # verbose(v) # set the verbose flag to _v_.
+ # verbose(v) { code } # Execute code with the verbose flag set
+ # # temporarily to _v_. Return to the
+ # # original value when code is done.
+ #
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:53
+ def verbose(value = T.unsafe(nil)); end
+
+ # Use this function to prevent potentially destructive ruby code
+ # from running when the :nowrite flag is set.
+ #
+ # Example:
+ #
+ # when_writing("Building Project") do
+ # project.build
+ # end
+ #
+ # The following code will build the project under normal
+ # conditions. If the nowrite(true) flag is set, then the example
+ # will print:
+ #
+ # DRYRUN: Building Project
+ #
+ # instead of actually building the project.
+ #
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:108
+ def when_writing(msg = T.unsafe(nil)); end
+
+ class << self
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:14
+ def nowrite_flag; end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:14
+ def nowrite_flag=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:14
+ def verbose_flag; end
+
+ # pkg:gem/rake#lib/rake/file_utils_ext.rb:14
+ def verbose_flag=(_arg0); end
+ end
+end
+
+# pkg:gem/rake#lib/rake/file_utils_ext.rb:17
+Rake::FileUtilsExt::DEFAULT = T.let(T.unsafe(nil), Object)
+
+# InvocationChain tracks the chain of task invocations to detect
+# circular dependencies.
+#
+# pkg:gem/rake#lib/rake/invocation_chain.rb:6
+class Rake::InvocationChain < ::Rake::LinkedList
+ # Append an invocation to the chain of invocations. It is an error
+ # if the invocation already listed.
+ #
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:15
+ def append(invocation); end
+
+ # Is the invocation already in the chain?
+ #
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:9
+ def member?(invocation); end
+
+ # Convert to string, ie: TOP => invocation => invocation
+ #
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:23
+ def to_s; end
+
+ private
+
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:34
+ def prefix; end
+
+ class << self
+ # Class level append.
+ #
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:28
+ def append(invocation, chain); end
+ end
+end
+
+# pkg:gem/rake#lib/rake/invocation_chain.rb:55
+Rake::InvocationChain::EMPTY = T.let(T.unsafe(nil), Rake::InvocationChain::EmptyInvocationChain)
+
+# Null object for an empty chain.
+#
+# pkg:gem/rake#lib/rake/invocation_chain.rb:39
+class Rake::InvocationChain::EmptyInvocationChain < ::Rake::LinkedList::EmptyLinkedList
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:46
+ def append(invocation); end
+
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:42
+ def member?(obj); end
+
+ # pkg:gem/rake#lib/rake/invocation_chain.rb:50
+ def to_s; end
+end
+
+# pkg:gem/rake#lib/rake/invocation_exception_mixin.rb:3
+module Rake::InvocationExceptionMixin
+ # Return the invocation chain (list of Rake tasks) that were in
+ # effect when this exception was detected by rake. May be null if
+ # no tasks were active.
+ #
+ # pkg:gem/rake#lib/rake/invocation_exception_mixin.rb:7
+ def chain; end
+
+ # Set the invocation chain in effect when this exception was
+ # detected.
+ #
+ # pkg:gem/rake#lib/rake/invocation_exception_mixin.rb:13
+ def chain=(value); end
+end
+
+# pkg:gem/rake#lib/rake/late_time.rb:17
+Rake::LATE = T.let(T.unsafe(nil), Rake::LateTime)
+
+# LateTime is a fake timestamp that occurs _after_ any other time value.
+#
+# pkg:gem/rake#lib/rake/late_time.rb:4
+class Rake::LateTime
+ include ::Comparable
+ include ::Singleton::SingletonInstanceMethods
+ include ::Singleton
+ extend ::Singleton::SingletonClassMethods
+
+ # pkg:gem/rake#lib/rake/late_time.rb:8
+ def <=>(other); end
+
+ # pkg:gem/rake#lib/rake/late_time.rb:12
+ def to_s; end
+
+ class << self
+ private
+
+ # pkg:gem/rake#lib/rake/late_time.rb:6
+ def allocate; end
+
+ # pkg:gem/rake#lib/rake/late_time.rb:6
+ def new(*_arg0); end
+ end
+end
+
+# Polylithic linked list structure used to implement several data
+# structures in Rake.
+#
+# pkg:gem/rake#lib/rake/linked_list.rb:6
+class Rake::LinkedList
+ include ::Enumerable
+
+ # pkg:gem/rake#lib/rake/linked_list.rb:84
+ def initialize(head, tail = T.unsafe(nil)); end
+
+ # Lists are structurally equivalent.
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:25
+ def ==(other); end
+
+ # Polymorphically add a new element to the head of a list. The
+ # type of head node will be the same list type as the tail.
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:12
+ def conj(item); end
+
+ # For each item in the list.
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:48
+ def each; end
+
+ # Is the list empty?
+ # .make guards against a list being empty making any instantiated LinkedList
+ # object not empty by default
+ # You should consider overriding this method if you implement your own .make method
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:20
+ def empty?; end
+
+ # pkg:gem/rake#lib/rake/linked_list.rb:8
+ def head; end
+
+ # Same as +to_s+, but with inspected items.
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:42
+ def inspect; end
+
+ # pkg:gem/rake#lib/rake/linked_list.rb:8
+ def tail; end
+
+ # Convert to string: LL(item, item...)
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:36
+ def to_s; end
+
+ class << self
+ # Cons a new head onto the tail list.
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:73
+ def cons(head, tail); end
+
+ # The standard empty list class for the given LinkedList class.
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:78
+ def empty; end
+
+ # Make a list out of the given arguments. This method is
+ # polymorphic
+ #
+ # pkg:gem/rake#lib/rake/linked_list.rb:59
+ def make(*args); end
+ end
+end
+
+# pkg:gem/rake#lib/rake/linked_list.rb:110
+Rake::LinkedList::EMPTY = T.let(T.unsafe(nil), Rake::LinkedList::EmptyLinkedList)
+
+# Represent an empty list, using the Null Object Pattern.
+#
+# When inheriting from the LinkedList class, you should implement
+# a type specific Empty class as well. Make sure you set the class
+# instance variable @parent to the associated list class (this
+# allows conj, cons and make to work polymorphically).
+#
+# pkg:gem/rake#lib/rake/linked_list.rb:95
+class Rake::LinkedList::EmptyLinkedList < ::Rake::LinkedList
+ # pkg:gem/rake#lib/rake/linked_list.rb:98
+ def initialize; end
+
+ # pkg:gem/rake#lib/rake/linked_list.rb:101
+ def empty?; end
+
+ class << self
+ # pkg:gem/rake#lib/rake/linked_list.rb:105
+ def cons(head, tail); end
+ end
+end
+
+# Same as a regular task, but the immediate prerequisites are done in
+# parallel using Ruby threads.
+#
+# pkg:gem/rake#lib/rake/multi_task.rb:7
+class Rake::MultiTask < ::Rake::Task
+ private
+
+ # pkg:gem/rake#lib/rake/multi_task.rb:10
+ def invoke_prerequisites(task_args, invocation_chain); end
+end
+
+# The NameSpace class will lookup task names in the scope defined by a
+# +namespace+ command.
+#
+# pkg:gem/rake#lib/rake/name_space.rb:6
+class Rake::NameSpace
+ # Create a namespace lookup object using the given task manager
+ # and the list of scopes.
+ #
+ # pkg:gem/rake#lib/rake/name_space.rb:12
+ def initialize(task_manager, scope_list); end
+
+ # Lookup a task named +name+ in the namespace.
+ #
+ # pkg:gem/rake#lib/rake/name_space.rb:20
+ def [](name); end
+
+ # The scope of the namespace (a LinkedList)
+ #
+ # pkg:gem/rake#lib/rake/name_space.rb:27
+ def scope; end
+
+ # Return the list of tasks defined in this and nested namespaces.
+ #
+ # pkg:gem/rake#lib/rake/name_space.rb:34
+ def tasks; end
+end
+
+# Options used by the Rake command line application.
+#
+# pkg:gem/rake#lib/rake/options.rb:8
+class Rake::Options
+ # pkg:gem/rake#lib/rake/options.rb:9
+ def always_multitask; end
+
+ # pkg:gem/rake#lib/rake/options.rb:9
+ def always_multitask=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:10
+ def backtrace; end
+
+ # pkg:gem/rake#lib/rake/options.rb:10
+ def backtrace=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:11
+ def build_all; end
+
+ # pkg:gem/rake#lib/rake/options.rb:11
+ def build_all=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:12
+ def dryrun; end
+
+ # pkg:gem/rake#lib/rake/options.rb:12
+ def dryrun=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:13
+ def ignore_deprecate; end
+
+ # pkg:gem/rake#lib/rake/options.rb:13
+ def ignore_deprecate=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:14
+ def ignore_system; end
+
+ # pkg:gem/rake#lib/rake/options.rb:14
+ def ignore_system=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:15
+ def job_stats; end
+
+ # pkg:gem/rake#lib/rake/options.rb:15
+ def job_stats=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:16
+ def load_system; end
+
+ # pkg:gem/rake#lib/rake/options.rb:16
+ def load_system=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:17
+ def nosearch; end
+
+ # pkg:gem/rake#lib/rake/options.rb:17
+ def nosearch=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:18
+ def rakelib; end
+
+ # pkg:gem/rake#lib/rake/options.rb:18
+ def rakelib=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:19
+ def show_all_tasks; end
+
+ # pkg:gem/rake#lib/rake/options.rb:19
+ def show_all_tasks=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:20
+ def show_prereqs; end
+
+ # pkg:gem/rake#lib/rake/options.rb:20
+ def show_prereqs=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:21
+ def show_task_pattern; end
+
+ # pkg:gem/rake#lib/rake/options.rb:21
+ def show_task_pattern=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:22
+ def show_tasks; end
+
+ # pkg:gem/rake#lib/rake/options.rb:22
+ def show_tasks=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:23
+ def silent; end
+
+ # pkg:gem/rake#lib/rake/options.rb:23
+ def silent=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:24
+ def suppress_backtrace_pattern; end
+
+ # pkg:gem/rake#lib/rake/options.rb:24
+ def suppress_backtrace_pattern=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:25
+ def thread_pool_size; end
+
+ # pkg:gem/rake#lib/rake/options.rb:25
+ def thread_pool_size=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:26
+ def trace; end
+
+ # pkg:gem/rake#lib/rake/options.rb:26
+ def trace=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:27
+ def trace_output; end
+
+ # pkg:gem/rake#lib/rake/options.rb:27
+ def trace_output=(_arg0); end
+
+ # pkg:gem/rake#lib/rake/options.rb:28
+ def trace_rules; end
+
+ # pkg:gem/rake#lib/rake/options.rb:28
+ def trace_rules=(_arg0); end
+end
+
+# Include PrivateReader to use +private_reader+.
+#
+# pkg:gem/rake#lib/rake/private_reader.rb:5
+module Rake::PrivateReader
+ mixes_in_class_methods ::Rake::PrivateReader::ClassMethods
+
+ class << self
+ # pkg:gem/rake#lib/rake/private_reader.rb:7
+ def included(base); end
+ end
+end
+
+# pkg:gem/rake#lib/rake/private_reader.rb:11
+module Rake::PrivateReader::ClassMethods
+ # Declare a list of private accessors
+ #
+ # pkg:gem/rake#lib/rake/private_reader.rb:14
+ def private_reader(*names); end
+end
+
+# A Promise object represents a promise to do work (a chore) in the
+# future. The promise is created with a block and a list of
+# arguments for the block. Calling value will return the value of
+# the promised chore.
+#
+# Used by ThreadPool.
+#
+# pkg:gem/rake#lib/rake/promise.rb:11
+class Rake::Promise
+ # Create a promise to do the chore specified by the block.
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:17
+ def initialize(args, &block); end
+
+ # pkg:gem/rake#lib/rake/promise.rb:14
+ def recorder; end
+
+ # pkg:gem/rake#lib/rake/promise.rb:14
+ def recorder=(_arg0); end
+
+ # Return the value of this promise.
+ #
+ # If the promised chore is not yet complete, then do the work
+ # synchronously. We will wait.
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:29
+ def value; end
+
+ # If no one else is working this promise, go ahead and do the chore.
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:42
+ def work; end
+
+ private
+
+ # Perform the chore promised
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:57
+ def chore; end
+
+ # Are we done with the promise
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:83
+ def complete?; end
+
+ # free up these items for the GC
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:88
+ def discard; end
+
+ # Did the promise throw an error
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:78
+ def error?; end
+
+ # Do we have a result for the promise
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:73
+ def result?; end
+
+ # Record execution statistics if there is a recorder
+ #
+ # pkg:gem/rake#lib/rake/promise.rb:94
+ def stat(*args); end
+end
+
+# pkg:gem/rake#lib/rake/promise.rb:12
+Rake::Promise::NOT_SET = T.let(T.unsafe(nil), Object)
+
+# Exit status class for times the system just gives us a nil.
+#
+# pkg:gem/rake#lib/rake/pseudo_status.rb:6
+class Rake::PseudoStatus
+ # pkg:gem/rake#lib/rake/pseudo_status.rb:9
+ def initialize(code = T.unsafe(nil)); end
+
+ # pkg:gem/rake#lib/rake/pseudo_status.rb:17
+ def >>(n); end
+
+ # pkg:gem/rake#lib/rake/pseudo_status.rb:25
+ def exited?; end
+
+ # pkg:gem/rake#lib/rake/pseudo_status.rb:7
+ def exitstatus; end
+
+ # pkg:gem/rake#lib/rake/pseudo_status.rb:21
+ def stopped?; end
+
+ # pkg:gem/rake#lib/rake/pseudo_status.rb:13
+ def to_i; end
+end
+
+# Error indicating a recursion overflow error in task selection.
+#
+# pkg:gem/rake#lib/rake/rule_recursion_overflow_error.rb:5
+class Rake::RuleRecursionOverflowError < ::StandardError
+ # pkg:gem/rake#lib/rake/rule_recursion_overflow_error.rb:6
+ def initialize(*args); end
+
+ # pkg:gem/rake#lib/rake/rule_recursion_overflow_error.rb:11
+ def add_target(target); end
+
+ # pkg:gem/rake#lib/rake/rule_recursion_overflow_error.rb:15
+ def message; end
+end
+
+# pkg:gem/rake#lib/rake/scope.rb:3
+class Rake::Scope < ::Rake::LinkedList
+ # Path for the scope.
+ #
+ # pkg:gem/rake#lib/rake/scope.rb:6
+ def path; end
+
+ # Path for the scope + the named path.
+ #
+ # pkg:gem/rake#lib/rake/scope.rb:11
+ def path_with_task_name(task_name); end
+
+ # Trim +n+ innermost scope levels from the scope. In no case will
+ # this trim beyond the toplevel scope.
+ #
+ # pkg:gem/rake#lib/rake/scope.rb:17
+ def trim(n); end
+end
+
+# Singleton null object for an empty scope.
+#
+# pkg:gem/rake#lib/rake/scope.rb:41
+Rake::Scope::EMPTY = T.let(T.unsafe(nil), Rake::Scope::EmptyScope)
+
+# Scope lists always end with an EmptyScope object. See Null
+# Object Pattern)
+#
+# pkg:gem/rake#lib/rake/scope.rb:28
+class Rake::Scope::EmptyScope < ::Rake::LinkedList::EmptyLinkedList
+ # pkg:gem/rake#lib/rake/scope.rb:31
+ def path; end
+
+ # pkg:gem/rake#lib/rake/scope.rb:35
+ def path_with_task_name(task_name); end
+end
+
+# A Task is the basic unit of work in a Rakefile. Tasks have associated
+# actions (possibly more than one) and a list of prerequisites. When
+# invoked, a task will first ensure that all of its prerequisites have an
+# opportunity to run and then it will execute its own actions.
+#
+# Tasks are not usually created directly using the new method, but rather
+# use the +file+ and +task+ convenience methods.
+#
+# pkg:gem/rake#lib/rake/task.rb:15
+class Rake::Task
+ # Create a task named +task_name+ with no actions or prerequisites. Use
+ # +enhance+ to add actions and prerequisites.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:99
+ def initialize(task_name, app); end
+
+ # List of actions attached to a task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:24
+ def actions; end
+
+ # Add a description to the task. The description can consist of an option
+ # argument list (enclosed brackets) and an optional comment.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:298
+ def add_description(description); end
+
+ # List of all unique prerequisite tasks including prerequisite tasks'
+ # prerequisites.
+ # Includes self when cyclic dependencies are found.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:77
+ def all_prerequisite_tasks; end
+
+ # Has this task already been invoked? Already invoked tasks
+ # will be skipped unless you reenable them.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:39
+ def already_invoked; end
+
+ # Application owning this task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:27
+ def application; end
+
+ # Application owning this task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:27
+ def application=(_arg0); end
+
+ # Argument description (nil if none).
+ #
+ # pkg:gem/rake#lib/rake/task.rb:136
+ def arg_description; end
+
+ # Name of arguments for this task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:141
+ def arg_names; end
+
+ # Clear the existing prerequisites, actions, comments, and arguments of a rake task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:153
+ def clear; end
+
+ # Clear the existing actions on a rake task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:168
+ def clear_actions; end
+
+ # Clear the existing arguments on a rake task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:180
+ def clear_args; end
+
+ # Clear the existing comments on a rake task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:174
+ def clear_comments; end
+
+ # Clear the existing prerequisites of a rake task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:162
+ def clear_prerequisites; end
+
+ # First line (or sentence) of all comments. Multiple comments are
+ # separated by a "/".
+ #
+ # pkg:gem/rake#lib/rake/task.rb:322
+ def comment; end
+
+ # pkg:gem/rake#lib/rake/task.rb:304
+ def comment=(comment); end
+
+ # Enhance a task with prerequisites or actions. Returns self.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:115
+ def enhance(deps = T.unsafe(nil), &block); end
+
+ # Execute the actions associated with this task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:270
+ def execute(args = T.unsafe(nil)); end
+
+ # Full collection of comments. Multiple comments are separated by
+ # newlines.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:316
+ def full_comment; end
+
+ # pkg:gem/rake#lib/rake/task.rb:46
+ def inspect; end
+
+ # Return a string describing the internal state of a task. Useful for
+ # debugging.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:354
+ def investigation; end
+
+ # Invoke the task if it is needed. Prerequisites are invoked first.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:186
+ def invoke(*args); end
+
+ # Invoke all the prerequisites of a task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:237
+ def invoke_prerequisites(task_args, invocation_chain); end
+
+ # Invoke all the prerequisites of a task in parallel.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:249
+ def invoke_prerequisites_concurrently(task_args, invocation_chain); end
+
+ # File/Line locations of each of the task definitions for this
+ # task (only valid if the task was defined with the detect
+ # location option set).
+ #
+ # pkg:gem/rake#lib/rake/task.rb:35
+ def locations; end
+
+ # Name of the task, including any namespace qualifiers.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:122
+ def name; end
+
+ # Name of task with argument list description.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:127
+ def name_with_args; end
+
+ # Is this task needed?
+ #
+ # pkg:gem/rake#lib/rake/task.rb:286
+ def needed?; end
+
+ # List of order only prerequisites for a task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:21
+ def order_only_prerequisites; end
+
+ # pkg:gem/rake#lib/rake/task.rb:18
+ def prereqs; end
+
+ # List of prerequisite tasks
+ #
+ # pkg:gem/rake#lib/rake/task.rb:61
+ def prerequisite_tasks; end
+
+ # List of prerequisites for a task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:17
+ def prerequisites; end
+
+ # Reenable the task, allowing its tasks to be executed if the task
+ # is invoked again.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:147
+ def reenable; end
+
+ # Array of nested namespaces names used for task lookup by this task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:30
+ def scope; end
+
+ # Set the names of the arguments for this task. +args+ should be
+ # an array of symbols, one for each argument name.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:348
+ def set_arg_names(args); end
+
+ # First source from a rule (nil if no sources)
+ #
+ # pkg:gem/rake#lib/rake/task.rb:93
+ def source; end
+
+ # List of sources for task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:52
+ def sources; end
+
+ # List of sources for task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:51
+ def sources=(_arg0); end
+
+ # Timestamp for this task. Basic tasks return the current time for their
+ # time stamp. Other tasks can be more sophisticated.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:292
+ def timestamp; end
+
+ # Return task name
+ #
+ # pkg:gem/rake#lib/rake/task.rb:42
+ def to_s; end
+
+ # Add order only dependencies.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:379
+ def |(deps); end
+
+ protected
+
+ # pkg:gem/rake#lib/rake/task.rb:83
+ def collect_prerequisites(seen); end
+
+ # Same as invoke, but explicitly pass a call chain to detect
+ # circular dependencies.
+ #
+ # If multiple tasks depend on this
+ # one in parallel, they will all fail if the first execution of
+ # this task fails.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:197
+ def invoke_with_call_chain(task_args, invocation_chain); end
+
+ private
+
+ # pkg:gem/rake#lib/rake/task.rb:229
+ def add_chain_to(exception, new_chain); end
+
+ # pkg:gem/rake#lib/rake/task.rb:308
+ def add_comment(comment); end
+
+ # Get the first sentence in a string. The sentence is terminated
+ # by the first period, exclamation mark, or the end of the line.
+ # Decimal points do not count as periods.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:341
+ def first_sentence(string); end
+
+ # Format the trace flags for display.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:261
+ def format_trace_flags; end
+
+ # pkg:gem/rake#lib/rake/task.rb:65
+ def lookup_prerequisite(prerequisite_name); end
+
+ # Transform the list of comments as specified by the block and
+ # join with the separator.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:328
+ def transform_comments(separator, &block); end
+
+ class << self
+ # Return a task with the given name. If the task is not currently
+ # known, try to synthesize one from the defined rules. If no rules are
+ # found, but an existing file matches the task name, assume it is a file
+ # task with no dependencies or actions.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:404
+ def [](task_name); end
+
+ # Clear the task list. This cause rake to immediately forget all the
+ # tasks that have been assigned. (Normally used in the unit tests.)
+ #
+ # pkg:gem/rake#lib/rake/task.rb:391
+ def clear; end
+
+ # Define a rule for synthesizing tasks.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:421
+ def create_rule(*args, &block); end
+
+ # Define a task given +args+ and an option block. If a rule with the
+ # given name already exists, the prerequisites and actions are added to
+ # the existing task. Returns the defined task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:416
+ def define_task(*args, &block); end
+
+ # Format dependencies parameter to pass to task.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:373
+ def format_deps(deps); end
+
+ # Apply the scope to the task name according to the rules for
+ # this kind of task. Generic tasks will accept the scope as
+ # part of the name.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:428
+ def scope_name(scope, task_name); end
+
+ # TRUE if the task name is already defined.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:409
+ def task_defined?(task_name); end
+
+ # List of all defined tasks.
+ #
+ # pkg:gem/rake#lib/rake/task.rb:396
+ def tasks; end
+ end
+end
+
+# Error indicating an ill-formed task declaration.
+#
+# pkg:gem/rake#lib/rake/task_argument_error.rb:5
+class Rake::TaskArgumentError < ::ArgumentError; end
+
+# TaskArguments manage the arguments passed to a task.
+#
+# pkg:gem/rake#lib/rake/task_arguments.rb:7
+class Rake::TaskArguments
+ include ::Enumerable
+
+ # Create a TaskArgument object with a list of argument +names+ and a set
+ # of associated +values+. +parent+ is the parent argument object.
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:15
+ def initialize(names, values, parent = T.unsafe(nil)); end
+
+ # Find an argument value by name or index.
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:44
+ def [](index); end
+
+ # pkg:gem/rake#lib/rake/task_arguments.rb:97
+ def deconstruct_keys(keys); end
+
+ # Enumerates the arguments and their values
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:56
+ def each(&block); end
+
+ # Retrieve the list of values not associated with named arguments
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:32
+ def extras; end
+
+ # pkg:gem/rake#lib/rake/task_arguments.rb:93
+ def fetch(*args, &block); end
+
+ # Returns true if +key+ is one of the arguments
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:88
+ def has_key?(key); end
+
+ # pkg:gem/rake#lib/rake/task_arguments.rb:79
+ def inspect; end
+
+ # pkg:gem/rake#lib/rake/task_arguments.rb:91
+ def key?(key); end
+
+ # Returns the value of the given argument via method_missing
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:66
+ def method_missing(sym, *args); end
+
+ # Argument names
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:11
+ def names; end
+
+ # Create a new argument scope using the prerequisite argument
+ # names.
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:38
+ def new_scope(names); end
+
+ # Retrieve the complete array of sequential values
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:27
+ def to_a; end
+
+ # Returns a Hash of arguments and their values
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:71
+ def to_hash; end
+
+ # pkg:gem/rake#lib/rake/task_arguments.rb:75
+ def to_s; end
+
+ # Extracts the argument values at +keys+
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:61
+ def values_at(*keys); end
+
+ # Specify a hash of default values for task arguments. Use the
+ # defaults only if there is no specific value for the given
+ # argument.
+ #
+ # pkg:gem/rake#lib/rake/task_arguments.rb:51
+ def with_defaults(defaults); end
+
+ protected
+
+ # pkg:gem/rake#lib/rake/task_arguments.rb:103
+ def lookup(name); end
+end
+
+# The TaskManager module is a mixin for managing tasks.
+#
+# pkg:gem/rake#lib/rake/task_manager.rb:5
+module Rake::TaskManager
+ # pkg:gem/rake#lib/rake/task_manager.rb:9
+ def initialize; end
+
+ # Find a matching task for +task_name+.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:54
+ def [](task_name, scopes = T.unsafe(nil)); end
+
+ # Clear all tasks in this application.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:182
+ def clear; end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:17
+ def create_rule(*args, &block); end
+
+ # Return the list of scope names currently active in the task
+ # manager.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:222
+ def current_scope; end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:23
+ def define_task(task_class, *args, &block); end
+
+ # If a rule can be found that matches the task name, enhance the
+ # task with the prerequisites and actions from the rule. Set the
+ # source attribute of the task appropriately for the rule. Return
+ # the enhanced task or nil of no rule was found.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:151
+ def enhance_with_matching_rule(task_name, level = T.unsafe(nil)); end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:68
+ def generate_did_you_mean_suggestions(task_name); end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:62
+ def generate_message_for_undefined_task(task_name); end
+
+ # Evaluate the block in a nested namespace named +name+. Create
+ # an anonymous namespace if +name+ is nil.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:228
+ def in_namespace(name); end
+
+ # Lookup a task. Return an existing task if found, otherwise
+ # create a task of the current type.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:49
+ def intern(task_class, task_name); end
+
+ # Track the last comment made in the Rakefile.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:7
+ def last_description; end
+
+ # Track the last comment made in the Rakefile.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:7
+ def last_description=(_arg0); end
+
+ # Lookup a task, using scope and the scope hints in the task name.
+ # This method performs straight lookups without trying to
+ # synthesize file tasks or rules. Special scope names (e.g. '^')
+ # are recognized. If no scope argument is supplied, use the
+ # current scope. Return nil if the task cannot be found.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:192
+ def lookup(task_name, initial_scope = T.unsafe(nil)); end
+
+ # Resolve the arguments for a task/rule. Returns a tuple of
+ # [task_name, arg_name_list, prerequisites, order_only_prerequisites].
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:88
+ def resolve_args(args); end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:81
+ def synthesize_file_task(task_name); end
+
+ # List of all defined tasks in this application.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:168
+ def tasks; end
+
+ # List of all the tasks defined in the given scope (and its
+ # sub-scopes).
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:174
+ def tasks_in_scope(scope); end
+
+ private
+
+ # Add a location to the locations field of the given task.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:241
+ def add_location(task); end
+
+ # Attempt to create a rule given the list of prerequisites.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:271
+ def attempt_rule(task_name, task_pattern, args, extensions, block, level); end
+
+ # Find the location that called into the dsl layer.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:248
+ def find_location; end
+
+ # Generate an anonymous namespace name.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:259
+ def generate_name; end
+
+ # Return the current description, clearing it in the process.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:321
+ def get_description; end
+
+ # Lookup the task name
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:208
+ def lookup_in_scope(name, scope); end
+
+ # Make a list of sources from the list of file name extensions /
+ # translation procs.
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:293
+ def make_sources(task_name, task_pattern, extensions); end
+
+ # Resolve task arguments for a task or rule when there are
+ # dependencies declared.
+ #
+ # The patterns recognized by this argument resolving function are:
+ #
+ # task :t, order_only: [:e]
+ # task :t => [:d]
+ # task :t => [:d], order_only: [:e]
+ # task :t, [a] => [:d]
+ # task :t, [a] => [:d], order_only: [:e]
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:127
+ def resolve_args_with_dependencies(args, hash); end
+
+ # Resolve task arguments for a task or rule when there are no
+ # dependencies declared.
+ #
+ # The patterns recognized by this argument resolving function are:
+ #
+ # task :t
+ # task :t, [:a]
+ #
+ # pkg:gem/rake#lib/rake/task_manager.rb:105
+ def resolve_args_without_dependencies(args); end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:265
+ def trace_rule(level, message); end
+
+ class << self
+ # pkg:gem/rake#lib/rake/task_manager.rb:328
+ def record_task_metadata; end
+
+ # pkg:gem/rake#lib/rake/task_manager.rb:328
+ def record_task_metadata=(_arg0); end
+ end
+end
+
+# pkg:gem/rake#lib/rake/thread_history_display.rb:6
+class Rake::ThreadHistoryDisplay
+ include ::Rake::PrivateReader
+ extend ::Rake::PrivateReader::ClassMethods
+
+ # pkg:gem/rake#lib/rake/thread_history_display.rb:11
+ def initialize(stats); end
+
+ # pkg:gem/rake#lib/rake/thread_history_display.rb:17
+ def show; end
+
+ private
+
+ # pkg:gem/rake#lib/rake/thread_history_display.rb:9
+ def items; end
+
+ # pkg:gem/rake#lib/rake/thread_history_display.rb:35
+ def rename(hash, key, renames); end
+
+ # pkg:gem/rake#lib/rake/thread_history_display.rb:9
+ def stats; end
+
+ # pkg:gem/rake#lib/rake/thread_history_display.rb:9
+ def threads; end
+end
+
+# pkg:gem/rake#lib/rake/thread_pool.rb:8
+class Rake::ThreadPool
+ # Creates a ThreadPool object. The +thread_count+ parameter is the size
+ # of the pool.
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:12
+ def initialize(thread_count); end
+
+ # Creates a future executed by the +ThreadPool+.
+ #
+ # The args are passed to the block when executing (similarly to
+ # Thread#new) The return value is an object representing
+ # a future which has been created and added to the queue in the
+ # pool. Sending #value to the object will sleep the
+ # current thread until the future is finished and will return the
+ # result (or raise an exception thrown from the future)
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:33
+ def future(*args, &block); end
+
+ # Enable the gathering of history events.
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:68
+ def gather_history; end
+
+ # Return a array of history events for the thread pool.
+ #
+ # History gathering must be enabled to be able to see the events
+ # (see #gather_history). Best to call this when the job is
+ # complete (i.e. after ThreadPool#join is called).
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:77
+ def history; end
+
+ # Waits until the queue of futures is empty and all threads have exited.
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:44
+ def join; end
+
+ # Return a hash of always collected statistics for the thread pool.
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:84
+ def statistics; end
+
+ private
+
+ # for testing only
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:152
+ def __queue__; end
+
+ # processes one item on the queue. Returns true if there was an
+ # item to process, false if there was no item
+ #
+ # pkg:gem/rake#lib/rake/thread_pool.rb:95
+ def process_queue_item; end
+
+ # pkg:gem/rake#lib/rake/thread_pool.rb:111
+ def start_thread; end
+
+ # pkg:gem/rake#lib/rake/thread_pool.rb:139
+ def stat(event, data = T.unsafe(nil)); end
+end
+
+# pkg:gem/rake#lib/rake/trace_output.rb:3
+module Rake::TraceOutput
+ # Write trace output to output stream +out+.
+ #
+ # The write is done as a single IO call (to print) to lessen the
+ # chance that the trace output is interrupted by other tasks also
+ # producing output.
+ #
+ # pkg:gem/rake#lib/rake/trace_output.rb:10
+ def trace_on(out, *strings); end
+end
+
+# pkg:gem/rake#lib/rake/version.rb:3
+Rake::VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rake#lib/rake/version.rb:5
+module Rake::Version; end
+
+# pkg:gem/rake#lib/rake/version.rb:6
+Rake::Version::BUILD = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rake#lib/rake/version.rb:6
+Rake::Version::MAJOR = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rake#lib/rake/version.rb:6
+Rake::Version::MINOR = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rake#lib/rake/version.rb:8
+Rake::Version::NUMBERS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rake#lib/rake/version.rb:6
+Rake::Version::OTHER = T.let(T.unsafe(nil), Array)
+
+# Win 32 interface methods for Rake. Windows specific functionality
+# will be placed here to collect that knowledge in one spot.
+#
+# pkg:gem/rake#lib/rake/win32.rb:7
+module Rake::Win32
+ class << self
+ # True if running on a windows system.
+ #
+ # pkg:gem/rake#lib/rake/win32.rb:11
+ def windows?; end
+ end
+end
+
+# pkg:gem/rake#lib/rake.rb:69
+RakeFileUtils = Rake::FileUtilsExt
+
+# pkg:gem/rake#lib/rake/ext/string.rb:4
+class String
+ include ::Comparable
+
+ # Replace the file extension with +newext+. If there is no extension on
+ # the string, append the new extension to the end. If the new extension
+ # is not given, or is the empty string, remove any existing extension.
+ #
+ # +ext+ is a user added method for the String class.
+ #
+ # This String extension comes from Rake
+ #
+ # pkg:gem/rake#lib/rake/ext/string.rb:14
+ def ext(newext = T.unsafe(nil)); end
+
+ # Map the path according to the given specification. The specification
+ # controls the details of the mapping. The following special patterns are
+ # recognized:
+ #
+ # %p :: The complete path.
+ # %f :: The base file name of the path, with its file extension,
+ # but without any directories.
+ # %n :: The file name of the path without its file extension.
+ # %d :: The directory list of the path.
+ # %x :: The file extension of the path. An empty string if there
+ # is no extension.
+ # %X :: Everything *but* the file extension.
+ # %s :: The alternate file separator if defined, otherwise use #
+ # the standard file separator.
+ # %% :: A percent sign.
+ #
+ # The %d specifier can also have a numeric prefix (e.g. '%2d').
+ # If the number is positive, only return (up to) +n+ directories in the
+ # path, starting from the left hand side. If +n+ is negative, return (up
+ # to) +n+ directories from the right hand side of the path.
+ #
+ # Examples:
+ #
+ # 'a/b/c/d/file.txt'.pathmap("%2d") => 'a/b'
+ # 'a/b/c/d/file.txt'.pathmap("%-2d") => 'c/d'
+ #
+ # Also the %d , %p , %f , %n ,
+ # %x , and %X operators can take a pattern/replacement
+ # argument to perform simple string substitutions on a particular part of
+ # the path. The pattern and replacement are separated by a comma and are
+ # enclosed by curly braces. The replacement spec comes after the %
+ # character but before the operator letter. (e.g. "%{old,new}d").
+ # Multiple replacement specs should be separated by semi-colons (e.g.
+ # "%{old,new;src,bin}d").
+ #
+ # Regular expressions may be used for the pattern, and back refs may be
+ # used in the replacement text. Curly braces, commas and semi-colons are
+ # excluded from both the pattern and replacement text (let's keep parsing
+ # reasonable).
+ #
+ # For example:
+ #
+ # "src/org/onestepback/proj/A.java".pathmap("%{^src,class}X.class")
+ #
+ # returns:
+ #
+ # "class/org/onestepback/proj/A.class"
+ #
+ # If the replacement text is '*', then a block may be provided to perform
+ # some arbitrary calculation for the replacement.
+ #
+ # For example:
+ #
+ # "/path/to/file.TXT".pathmap("%X%{.*,*}x") { |ext|
+ # ext.downcase
+ # }
+ #
+ # Returns:
+ #
+ # "/path/to/file.txt"
+ #
+ # This String extension comes from Rake
+ #
+ # pkg:gem/rake#lib/rake/ext/string.rb:138
+ def pathmap(spec = T.unsafe(nil), &block); end
+
+ protected
+
+ # Explode a path into individual components. Used by +pathmap+.
+ #
+ # This String extension comes from Rake
+ #
+ # pkg:gem/rake#lib/rake/ext/string.rb:27
+ def pathmap_explode; end
+
+ # Extract a partial path from the path. Include +n+ directories from the
+ # front end (left hand side) if +n+ is positive. Include |+n+|
+ # directories from the back end (right hand side) if +n+ is negative.
+ #
+ # This String extension comes from Rake
+ #
+ # pkg:gem/rake#lib/rake/ext/string.rb:41
+ def pathmap_partial(n); end
+
+ # Perform the pathmap replacement operations on the given path. The
+ # patterns take the form 'pat1,rep1;pat2,rep2...'.
+ #
+ # This String extension comes from Rake
+ #
+ # pkg:gem/rake#lib/rake/ext/string.rb:59
+ def pathmap_replace(patterns, &block); end
+end
diff --git a/sorbet/rbi/gems/rbi@0.4.0.rbi b/sorbet/rbi/gems/rbi@0.4.0.rbi
new file mode 100644
index 0000000..1f95994
--- /dev/null
+++ b/sorbet/rbi/gems/rbi@0.4.0.rbi
@@ -0,0 +1,5706 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rbi` gem.
+# Please instead update this file by running `bin/tapioca gem rbi`.
+
+
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rbi` gem.
+# Please instead update this file by running `bundle exec spoom srb sigs export`.
+
+# pkg:gem/rbi#lib/rbi.rb:7
+module RBI; end
+
+# pkg:gem/rbi#lib/rbi/model.rb:978
+class RBI::Arg < ::RBI::Node
+ # pkg:gem/rbi#lib/rbi/model.rb:983
+ sig { params(value: ::String, loc: T.nilable(::RBI::Loc)).void }
+ def initialize(value, loc: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:989
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:994
+ sig { returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:980
+ sig { returns(::String) }
+ def value; end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:325
+class RBI::Attr < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:353
+ sig do
+ params(
+ name: ::Symbol,
+ names: T::Array[::Symbol],
+ visibility: ::RBI::Visibility,
+ sigs: T.nilable(T::Array[::RBI::Sig]),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment])
+ ).void
+ end
+ def initialize(name, names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:420
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:59
+ sig { abstract.returns(T::Array[::RBI::Method]) }
+ def convert_to_methods; end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:362
+ sig { abstract.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:104
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:429
+ sig { override.params(other: ::RBI::Node).void }
+ def merge_with(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:327
+ sig { returns(T::Array[::Symbol]) }
+ def names; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:333
+ sig { returns(T::Array[::RBI::Sig]) }
+ def sigs; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:343
+ sig { params(sigs: T::Array[::RBI::Sig]).returns(T::Array[::RBI::Sig]) }
+ def sigs=(sigs); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:338
+ sig { returns(T::Boolean) }
+ def sigs?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:330
+ sig { returns(::RBI::Visibility) }
+ def visibility; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:330
+ def visibility=(_arg0); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:80
+ sig do
+ params(
+ name: ::String,
+ sig: T.nilable(::RBI::Sig),
+ visibility: ::RBI::Visibility,
+ loc: T.nilable(::RBI::Loc),
+ comments: T::Array[::RBI::Comment]
+ ).returns(::RBI::Method)
+ end
+ def create_getter_method(name, sig, visibility, loc, comments); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:99
+ sig do
+ params(
+ name: ::String,
+ sig: T.nilable(::RBI::Sig),
+ attribute_type: T.nilable(T.any(::RBI::Type, ::String)),
+ visibility: ::RBI::Visibility,
+ loc: T.nilable(::RBI::Loc),
+ comments: T::Array[::RBI::Comment]
+ ).returns(::RBI::Method)
+ end
+ def create_setter_method(name, sig, attribute_type, visibility, loc, comments); end
+
+ # @final
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:65
+ sig(:final) { returns([T.nilable(::RBI::Sig), T.nilable(T.any(::RBI::Type, ::String))]) }
+ def parse_sig; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:365
+class RBI::AttrAccessor < ::RBI::Attr
+ # pkg:gem/rbi#lib/rbi/model.rb:374
+ sig do
+ params(
+ name: ::Symbol,
+ names: ::Symbol,
+ visibility: ::RBI::Visibility,
+ sigs: T.nilable(T::Array[::RBI::Sig]),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::AttrAccessor).void)
+ ).void
+ end
+ def initialize(name, *names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:458
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:130
+ sig { override.returns(T::Array[::RBI::Method]) }
+ def convert_to_methods; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:381
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:388
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:394
+class RBI::AttrReader < ::RBI::Attr
+ # pkg:gem/rbi#lib/rbi/model.rb:403
+ sig do
+ params(
+ name: ::Symbol,
+ names: ::Symbol,
+ visibility: ::RBI::Visibility,
+ sigs: T.nilable(T::Array[::RBI::Sig]),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::AttrReader).void)
+ ).void
+ end
+ def initialize(name, *names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:442
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:145
+ sig { override.returns(T::Array[::RBI::Method]) }
+ def convert_to_methods; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:410
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:417
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:423
+class RBI::AttrWriter < ::RBI::Attr
+ # pkg:gem/rbi#lib/rbi/model.rb:432
+ sig do
+ params(
+ name: ::Symbol,
+ names: ::Symbol,
+ visibility: ::RBI::Visibility,
+ sigs: T.nilable(T::Array[::RBI::Sig]),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::AttrWriter).void)
+ ).void
+ end
+ def initialize(name, *names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:450
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:155
+ sig { override.returns(T::Array[::RBI::Method]) }
+ def convert_to_methods; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:439
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:446
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# An arbitrary blank line that can be added both in trees and comments
+#
+# pkg:gem/rbi#lib/rbi/model.rb:70
+class RBI::BlankLine < ::RBI::Comment
+ # pkg:gem/rbi#lib/rbi/model.rb:72
+ sig { params(loc: T.nilable(::RBI::Loc)).void }
+ def initialize(loc: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:810
+class RBI::BlockParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:816
+ sig do
+ params(
+ name: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::BlockParam).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:835
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:830
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:813
+ sig { override.returns(T.nilable(::String)) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:824
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:217
+class RBI::Class < ::RBI::Scope
+ # pkg:gem/rbi#lib/rbi/model.rb:230
+ sig do
+ params(
+ name: ::String,
+ superclass_name: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Class).void)
+ ).void
+ end
+ def initialize(name, superclass_name: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:388
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:239
+ sig { override.returns(::String) }
+ def fully_qualified_name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:219
+ sig { returns(::String) }
+ def name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:222
+ sig { returns(T.nilable(::String)) }
+ def superclass_name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:222
+ def superclass_name=(_arg0); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:51
+class RBI::Comment < ::RBI::Node
+ # pkg:gem/rbi#lib/rbi/model.rb:56
+ sig { params(text: ::String, loc: T.nilable(::RBI::Loc)).void }
+ def initialize(text, loc: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:62
+ sig { params(other: ::Object).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:53
+ sig { returns(::String) }
+ def text; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:53
+ def text=(_arg0); end
+end
+
+# A tree showing incompatibles nodes
+#
+# Is rendered as a merge conflict between `left` and` right`:
+# ~~~rb
+# class Foo
+# <<<<<<< left
+# def m1; end
+# def m2(a); end
+# =======
+# def m1(a); end
+# def m2; end
+# >>>>>>> right
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:634
+class RBI::ConflictTree < ::RBI::Tree
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:642
+ sig { params(left_name: ::String, right_name: ::String).void }
+ def initialize(left_name: T.unsafe(nil), right_name: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:636
+ sig { returns(::RBI::Tree) }
+ def left; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:639
+ sig { returns(::String) }
+ def left_name; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:636
+ def right; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:639
+ def right_name; end
+end
+
+# Consts
+#
+# pkg:gem/rbi#lib/rbi/model.rb:296
+class RBI::Const < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:301
+ sig do
+ params(
+ name: ::String,
+ value: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Const).void)
+ ).void
+ end
+ def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:412
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:309
+ sig { returns(::String) }
+ def fully_qualified_name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:94
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:298
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:317
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:298
+ def value; end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:358
+class RBI::DuplicateNodeError < ::RBI::Error; end
+
+# pkg:gem/rbi#lib/rbi.rb:8
+class RBI::Error < ::StandardError; end
+
+# pkg:gem/rbi#lib/rbi/model.rb:868
+class RBI::Extend < ::RBI::Mixin
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:870
+ sig do
+ params(
+ name: ::String,
+ names: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Extend).void)
+ ).void
+ end
+ def initialize(name, *names, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:567
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:134
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:877
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:143
+class RBI::File
+ # pkg:gem/rbi#lib/rbi/model.rb:164
+ sig do
+ params(
+ strictness: T.nilable(::String),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(file: ::RBI::File).void)
+ ).void
+ end
+ def initialize(strictness: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:172
+ sig { params(node: ::RBI::Node).void }
+ def <<(node); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:154
+ sig { returns(T::Array[::RBI::Comment]) }
+ def comments; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:151
+ sig { params(comments: T::Array[::RBI::Comment]).returns(T::Array[::RBI::Comment]) }
+ def comments=(comments); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:159
+ sig { returns(T::Boolean) }
+ def comments?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:177
+ sig { returns(T::Boolean) }
+ def empty?; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:859
+ sig do
+ params(
+ out: T.any(::IO, ::StringIO),
+ indent: ::Integer,
+ print_locs: T::Boolean,
+ max_line_length: T.nilable(::Integer)
+ ).void
+ end
+ def print(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1236
+ sig { params(out: T.any(::IO, ::StringIO), indent: ::Integer, print_locs: T::Boolean).void }
+ def rbs_print(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1242
+ sig { params(indent: ::Integer, print_locs: T::Boolean).returns(::String) }
+ def rbs_string(indent: T.unsafe(nil), print_locs: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:145
+ sig { returns(::RBI::Tree) }
+ def root; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:145
+ def root=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:148
+ sig { returns(T.nilable(::String)) }
+ def strictness; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:148
+ def strictness=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:865
+ sig { params(indent: ::Integer, print_locs: T::Boolean, max_line_length: T.nilable(::Integer)).returns(::String) }
+ def string(indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbi#lib/rbi/formatter.rb:5
+class RBI::Formatter
+ # pkg:gem/rbi#lib/rbi/formatter.rb:18
+ sig do
+ params(
+ add_sig_templates: T::Boolean,
+ group_nodes: T::Boolean,
+ max_line_length: T.nilable(::Integer),
+ nest_singleton_methods: T::Boolean,
+ nest_non_public_members: T::Boolean,
+ sort_nodes: T::Boolean,
+ replace_attributes_with_methods: T::Boolean
+ ).void
+ end
+ def initialize(add_sig_templates: T.unsafe(nil), group_nodes: T.unsafe(nil), max_line_length: T.unsafe(nil), nest_singleton_methods: T.unsafe(nil), nest_non_public_members: T.unsafe(nil), sort_nodes: T.unsafe(nil), replace_attributes_with_methods: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/formatter.rb:43
+ sig { params(file: ::RBI::File).void }
+ def format_file(file); end
+
+ # pkg:gem/rbi#lib/rbi/formatter.rb:48
+ sig { params(tree: ::RBI::Tree).void }
+ def format_tree(tree); end
+
+ # pkg:gem/rbi#lib/rbi/formatter.rb:7
+ sig { returns(T.nilable(::Integer)) }
+ def max_line_length; end
+
+ # pkg:gem/rbi#lib/rbi/formatter.rb:7
+ def max_line_length=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/formatter.rb:37
+ sig { params(file: ::RBI::File).returns(::String) }
+ def print_file(file); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:86
+class RBI::Group < ::RBI::Tree
+ # pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:91
+ sig { params(kind: ::RBI::Group::Kind).void }
+ def initialize(kind); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:88
+ sig { returns(::RBI::Group::Kind) }
+ def kind; end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:96
+class RBI::Group::Kind
+ class << self
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:111
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:103
+RBI::Group::Kind::Attrs = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:109
+RBI::Group::Kind::Consts = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:99
+RBI::Group::Kind::Helpers = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:106
+RBI::Group::Kind::Inits = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:107
+RBI::Group::Kind::Methods = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:101
+RBI::Group::Kind::MixesInClassMethods = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:97
+RBI::Group::Kind::Mixins = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:98
+RBI::Group::Kind::RequiredAncestors = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:102
+RBI::Group::Kind::Sends = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:108
+RBI::Group::Kind::SingletonClasses = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:105
+RBI::Group::Kind::TEnums = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:104
+RBI::Group::Kind::TStructFields = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:100
+RBI::Group::Kind::TypeMembers = T.let(T.unsafe(nil), RBI::Group::Kind)
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:5
+class RBI::GroupNodesError < ::RBI::Error; end
+
+# Sorbet's misc.
+#
+# pkg:gem/rbi#lib/rbi/model.rb:1309
+class RBI::Helper < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1314
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Helper).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:583
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:164
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1311
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1322
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:854
+class RBI::Include < ::RBI::Mixin
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:856
+ sig do
+ params(
+ name: ::String,
+ names: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Include).void)
+ ).void
+ end
+ def initialize(name, *names, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:559
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:124
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:863
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/index.rb:5
+class RBI::Index < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/index.rb:16
+ sig { void }
+ def initialize; end
+
+ # pkg:gem/rbi#lib/rbi/index.rb:27
+ sig { params(id: ::String).returns(T::Array[::RBI::Node]) }
+ def [](id); end
+
+ # pkg:gem/rbi#lib/rbi/index.rb:32
+ sig { params(nodes: ::RBI::Node).void }
+ def index(*nodes); end
+
+ # pkg:gem/rbi#lib/rbi/index.rb:22
+ sig { returns(T::Array[::String]) }
+ def keys; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:38
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/index.rb:55
+ sig { params(node: T.all(::RBI::Indexable, ::RBI::Node)).void }
+ def index_node(node); end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/index.rb:8
+ sig { params(node: ::RBI::Node).returns(::RBI::Index) }
+ def index(*node); end
+ end
+end
+
+# A Node that can be referred to by a unique ID inside an index
+# @interface
+#
+# pkg:gem/rbi#lib/rbi/index.rb:69
+module RBI::Indexable
+ interface!
+
+ # Unique IDs that refer to this node.
+ #
+ # Some nodes can have multiple ids, for example an attribute accessor matches the ID of the
+ # getter and the setter.
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:76
+ sig { abstract.returns(T::Array[::String]) }
+ def index_ids; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:999
+class RBI::KwArg < ::RBI::Arg
+ # pkg:gem/rbi#lib/rbi/model.rb:1004
+ sig { params(keyword: ::String, value: ::String, loc: T.nilable(::RBI::Loc)).void }
+ def initialize(keyword, value, loc: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1010
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1001
+ sig { returns(::String) }
+ def keyword; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1015
+ sig { returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:746
+class RBI::KwOptParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:755
+ sig do
+ params(
+ name: ::String,
+ value: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::KwOptParam).void)
+ ).void
+ end
+ def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:775
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:770
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:749
+ sig { override.returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:764
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:752
+ sig { returns(::String) }
+ def value; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:716
+class RBI::KwParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:722
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::KwParam).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:741
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:736
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:719
+ sig { override.returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:730
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:780
+class RBI::KwRestParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:786
+ sig do
+ params(
+ name: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::KwRestParam).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:805
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:800
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:783
+ sig { override.returns(T.nilable(::String)) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:794
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/loc.rb:5
+class RBI::Loc
+ # pkg:gem/rbi#lib/rbi/loc.rb:32
+ sig do
+ params(
+ file: T.nilable(::String),
+ begin_line: T.nilable(::Integer),
+ end_line: T.nilable(::Integer),
+ begin_column: T.nilable(::Integer),
+ end_column: T.nilable(::Integer)
+ ).void
+ end
+ def initialize(file: T.unsafe(nil), begin_line: T.unsafe(nil), end_line: T.unsafe(nil), begin_column: T.unsafe(nil), end_column: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:23
+ def begin_column; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:23
+ sig { returns(T.nilable(::Integer)) }
+ def begin_line; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:23
+ def end_column; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:23
+ def end_line; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:20
+ sig { returns(T.nilable(::String)) }
+ def file; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:41
+ sig { params(other: ::RBI::Loc).returns(::RBI::Loc) }
+ def join(other); end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:52
+ sig { returns(T::Boolean) }
+ def multiline?; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:68
+ sig { returns(T.nilable(::String)) }
+ def source; end
+
+ # pkg:gem/rbi#lib/rbi/loc.rb:59
+ sig { returns(::String) }
+ def to_s; end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/loc.rb:8
+ sig { params(file: ::String, prism_location: ::Prism::Location).returns(::RBI::Loc) }
+ def from_prism(file, prism_location); end
+ end
+end
+
+# A tree that _might_ contain conflicts
+#
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:342
+class RBI::MergeTree < ::RBI::Tree
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:351
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T::Array[::RBI::Comment],
+ conflicts: T::Array[::RBI::Rewriters::Merge::Conflict],
+ block: T.nilable(T.proc.params(node: ::RBI::Tree).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), conflicts: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:344
+ sig { returns(T::Array[::RBI::Rewriters::Merge::Conflict]) }
+ def conflicts; end
+end
+
+# Methods and args
+#
+# pkg:gem/rbi#lib/rbi/model.rb:454
+class RBI::Method < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:491
+ sig do
+ params(
+ name: ::String,
+ params: T.nilable(T::Array[::RBI::Param]),
+ is_singleton: T::Boolean,
+ visibility: ::RBI::Visibility,
+ sigs: T.nilable(T::Array[::RBI::Sig]),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Method).void)
+ ).void
+ end
+ def initialize(name, params: T.unsafe(nil), is_singleton: T.unsafe(nil), visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:511
+ sig { params(param: ::RBI::Param).void }
+ def <<(param); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:546
+ sig { params(name: ::String).void }
+ def add_block_param(name); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:536
+ sig { params(name: ::String, default_value: ::String).void }
+ def add_kw_opt_param(name, default_value); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:531
+ sig { params(name: ::String).void }
+ def add_kw_param(name); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:541
+ sig { params(name: ::String).void }
+ def add_kw_rest_param(name); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:521
+ sig { params(name: ::String, default_value: ::String).void }
+ def add_opt_param(name, default_value); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:516
+ sig { params(name: ::String).void }
+ def add_param(name); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:526
+ sig { params(name: ::String).void }
+ def add_rest_param(name); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:559
+ sig do
+ params(
+ params: T.nilable(T::Array[::RBI::SigParam]),
+ return_type: T.any(::RBI::Type, ::String),
+ is_abstract: T::Boolean,
+ is_override: T::Boolean,
+ is_overridable: T::Boolean,
+ is_final: T::Boolean,
+ type_params: T.nilable(T::Array[::String]),
+ checked: T.nilable(::Symbol),
+ block: T.nilable(T.proc.params(node: ::RBI::Sig).void)
+ ).void
+ end
+ def add_sig(params: T.unsafe(nil), return_type: T.unsafe(nil), is_abstract: T.unsafe(nil), is_override: T.unsafe(nil), is_overridable: T.unsafe(nil), is_final: T.unsafe(nil), type_params: T.unsafe(nil), checked: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:466
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:585
+ sig { returns(::String) }
+ def fully_qualified_name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:114
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:464
+ sig { returns(T::Boolean) }
+ def is_singleton; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:464
+ def is_singleton=(_arg0); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:482
+ sig { override.params(other: ::RBI::Node).void }
+ def merge_with(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:456
+ sig { returns(::String) }
+ def name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:459
+ sig { returns(T::Array[::RBI::Param]) }
+ def params; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:470
+ sig { returns(T::Array[::RBI::Sig]) }
+ def sigs; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:480
+ sig { params(sigs: T::Array[::RBI::Sig]).returns(T::Array[::RBI::Sig]) }
+ def sigs=(sigs); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:475
+ sig { returns(T::Boolean) }
+ def sigs?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:595
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:467
+ sig { returns(::RBI::Visibility) }
+ def visibility; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:467
+ def visibility=(_arg0); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:504
+ sig { params(other: ::RBI::Method).returns(T::Boolean) }
+ def compatible_params?(other); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:513
+ sig { params(preferred: T::Array[::RBI::Param], fallback: T::Array[::RBI::Param]).returns(T::Array[::RBI::Param]) }
+ def merge_params(preferred, fallback); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:524
+ sig { params(sigs: T::Array[::RBI::Sig], params: T::Array[::RBI::Param]).void }
+ def rename_sigs_params(sigs, params); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1353
+class RBI::MixesInClassMethods < ::RBI::Mixin
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1360
+ sig do
+ params(
+ name: ::String,
+ names: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::MixesInClassMethods).void)
+ ).void
+ end
+ def initialize(name, *names, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:575
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:144
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1367
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:843
+class RBI::Mixin < ::RBI::NodeWithComments
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:848
+ sig do
+ params(
+ name: ::String,
+ names: T::Array[::String],
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment])
+ ).void
+ end
+ def initialize(name, names, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:551
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:845
+ sig { returns(T::Array[::String]) }
+ def names; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:197
+class RBI::Module < ::RBI::Scope
+ # pkg:gem/rbi#lib/rbi/model.rb:202
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Module).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:396
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:210
+ sig { override.returns(::String) }
+ def fully_qualified_name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:199
+ sig { returns(::String) }
+ def name; end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:8
+class RBI::Node
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:16
+ sig { params(loc: T.nilable(::RBI::Loc)).void }
+ def initialize(loc: T.unsafe(nil)); end
+
+ # Can `self` and `_other` be merged into a single definition?
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:302
+ sig { params(_other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(_other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:22
+ sig { void }
+ def detach; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:13
+ sig { returns(T.nilable(::RBI::Loc)) }
+ def loc; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:13
+ def loc=(_arg0); end
+
+ # Merge `self` and `other` into a single definition
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:308
+ sig { params(other: ::RBI::Node).void }
+ def merge_with(other); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:311
+ sig { returns(T.nilable(::RBI::ConflictTree)) }
+ def parent_conflict_tree; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:44
+ sig { returns(T.nilable(::RBI::Scope)) }
+ def parent_scope; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:10
+ sig { returns(T.nilable(::RBI::Tree)) }
+ def parent_tree; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:10
+ def parent_tree=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:877
+ sig do
+ params(
+ out: T.any(::IO, ::StringIO),
+ indent: ::Integer,
+ print_locs: T::Boolean,
+ max_line_length: T.nilable(::Integer)
+ ).void
+ end
+ def print(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1251
+ sig do
+ params(
+ out: T.any(::IO, ::StringIO),
+ indent: ::Integer,
+ print_locs: T::Boolean,
+ positional_names: T::Boolean
+ ).void
+ end
+ def rbs_print(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), positional_names: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1257
+ sig { params(indent: ::Integer, print_locs: T::Boolean, positional_names: T::Boolean).returns(::String) }
+ def rbs_string(indent: T.unsafe(nil), print_locs: T.unsafe(nil), positional_names: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:31
+ sig { params(node: ::RBI::Node).void }
+ def replace(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:91
+ sig { params(version: ::Gem::Version).returns(T::Boolean) }
+ def satisfies_version?(version); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:883
+ sig { params(indent: ::Integer, print_locs: T::Boolean, max_line_length: T.nilable(::Integer)).returns(::String) }
+ def string(indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:88
+class RBI::NodeWithComments < ::RBI::Node
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:105
+ sig { params(loc: T.nilable(::RBI::Loc), comments: T.nilable(T::Array[::RBI::Comment])).void }
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:111
+ sig { returns(T::Array[::String]) }
+ def annotations; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:93
+ sig { returns(T::Array[::RBI::Comment]) }
+ def comments; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:90
+ sig { params(comments: T::Array[::RBI::Comment]).returns(T::Array[::RBI::Comment]) }
+ def comments=(comments); end
+
+ # Returns true if this node has any comments, without allocating
+ # an empty array for nodes that have never had comments set.
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:100
+ sig { returns(T::Boolean) }
+ def comments?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:325
+ sig { override.params(other: ::RBI::Node).void }
+ def merge_with(other); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:101
+ sig { returns(T::Array[::Gem::Requirement]) }
+ def version_requirements; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:652
+class RBI::OptParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:661
+ sig do
+ params(
+ name: ::String,
+ value: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::OptParam).void)
+ ).void
+ end
+ def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:681
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:676
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:655
+ sig { override.returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:670
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:658
+ sig { returns(::String) }
+ def value; end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:601
+class RBI::Param < ::RBI::NodeWithComments
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:603
+ sig { params(loc: T.nilable(::RBI::Loc), comments: T.nilable(T::Array[::RBI::Comment])).void }
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:617
+ sig { abstract.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:543
+ sig { override.params(other: T.nilable(::RBI::Node)).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:608
+ sig { returns(T.nilable(::String)) }
+ def name; end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:7
+class RBI::ParseError < ::RBI::Error
+ # pkg:gem/rbi#lib/rbi/parser.rb:12
+ sig { params(message: ::String, location: ::RBI::Loc).void }
+ def initialize(message, location); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:9
+ sig { returns(::RBI::Loc) }
+ def location; end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:49
+class RBI::Parser
+ # pkg:gem/rbi#lib/rbi/parser.rb:80
+ sig { params(path: ::String).returns(::RBI::Tree) }
+ def parse_file(path); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:75
+ sig { params(string: ::String).returns(::RBI::Tree) }
+ def parse_string(string); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:87
+ sig { params(source: ::String, file: ::String).returns(::RBI::Tree) }
+ def parse(source, file:); end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/parser.rb:57
+ sig { params(path: ::String).returns(::RBI::Tree) }
+ def parse_file(path); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:62
+ sig { params(paths: T::Array[::String]).returns(T::Array[::RBI::Tree]) }
+ def parse_files(paths); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:52
+ sig { params(string: ::String).returns(::RBI::Tree) }
+ def parse_string(string); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:68
+ sig { params(strings: T::Array[::String]).returns(T::Array[::RBI::Tree]) }
+ def parse_strings(strings); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:1013
+class RBI::Parser::HeredocLocationVisitor < ::Prism::Visitor
+ # pkg:gem/rbi#lib/rbi/parser.rb:1015
+ sig { params(source: ::Prism::Source, begin_offset: ::Integer, end_offset: ::Integer).void }
+ def initialize(source, begin_offset, end_offset); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:1046
+ sig { returns(::Prism::Location) }
+ def location; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:1036
+ sig { override.params(node: ::Prism::InterpolatedStringNode).void }
+ def visit_interpolated_string_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:1025
+ sig { override.params(node: ::Prism::StringNode).void }
+ def visit_string_node(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:1057
+ sig { params(node: T.any(::Prism::InterpolatedStringNode, ::Prism::StringNode)).void }
+ def handle_string_node(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:915
+class RBI::Parser::SigBuilder < ::RBI::Parser::Visitor
+ # pkg:gem/rbi#lib/rbi/parser.rb:920
+ sig { params(content: ::String, file: ::String).void }
+ def initialize(content, file:); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:996
+ sig { params(node: ::Prism::CallNode, value: ::String).returns(T::Boolean) }
+ def allow_incompatible_override?(node, value); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:917
+ sig { returns(::RBI::Sig) }
+ def current; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:986
+ sig { params(node: ::Prism::Node).returns(::String) }
+ def sig_param_name(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:978
+ sig { override.params(node: ::Prism::AssocNode).void }
+ def visit_assoc_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:928
+ sig { override.params(node: ::Prism::CallNode).void }
+ def visit_call_node(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:164
+class RBI::Parser::TreeBuilder < ::RBI::Parser::Visitor
+ # pkg:gem/rbi#lib/rbi/parser.rb:172
+ sig { params(source: ::String, comments: T::Array[::Prism::Comment], file: ::String).void }
+ def initialize(source, comments:, file:); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:169
+ sig { returns(T.nilable(::Prism::Node)) }
+ def last_node; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:166
+ sig { returns(::RBI::Tree) }
+ def tree; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:361
+ sig { params(node: ::Prism::CallNode).void }
+ def visit_call_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:185
+ sig { override.params(node: ::Prism::ClassNode).void }
+ def visit_class_node(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:236
+ sig { params(node: T.any(::Prism::ConstantPathWriteNode, ::Prism::ConstantWriteNode)).void }
+ def visit_constant_assign(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:229
+ sig { override.params(node: ::Prism::ConstantPathWriteNode).void }
+ def visit_constant_path_write_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:221
+ sig { override.params(node: ::Prism::ConstantWriteNode).void }
+ def visit_constant_write_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:291
+ sig { override.params(node: ::Prism::DefNode).void }
+ def visit_def_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:313
+ sig { override.params(node: ::Prism::ModuleNode).void }
+ def visit_module_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:332
+ sig { override.params(node: ::Prism::ProgramNode).void }
+ def visit_program_node(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:344
+ sig { override.params(node: ::Prism::SingletonClassNode).void }
+ def visit_singleton_class_node(node); end
+
+ private
+
+ # Collect all the remaining comments within a node
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:539
+ sig { params(node: ::Prism::Node).void }
+ def collect_dangling_comments(node); end
+
+ # Collect all the remaining comments after visiting the tree
+ #
+ # pkg:gem/rbi#lib/rbi/parser.rb:557
+ sig { void }
+ def collect_orphan_comments; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:580
+ sig { returns(::RBI::Tree) }
+ def current_scope; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:585
+ sig { returns(T::Array[::RBI::Sig]) }
+ def current_sigs; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:592
+ sig { params(sigs: T::Array[::RBI::Sig]).returns(T::Array[::RBI::Comment]) }
+ def detach_comments_from_sigs(sigs); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:604
+ sig { params(node: ::Prism::Node).returns(T::Array[::RBI::Comment]) }
+ def node_comments(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:666
+ sig { params(node: ::Prism::Comment).returns(::RBI::Comment) }
+ def parse_comment(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:699
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Array[::RBI::Param]) }
+ def parse_params(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:673
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Array[::RBI::Arg]) }
+ def parse_send_args(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:765
+ sig { params(node: ::Prism::CallNode).returns(::RBI::Sig) }
+ def parse_sig(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:774
+ sig do
+ params(
+ node: T.any(::Prism::ConstantPathWriteNode, ::Prism::ConstantWriteNode)
+ ).returns(T.nilable(::RBI::Struct))
+ end
+ def parse_struct(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:822
+ sig { params(send: ::Prism::CallNode).void }
+ def parse_tstruct_field(send); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:859
+ sig { params(name: ::String, node: ::Prism::Node).returns(::RBI::Visibility) }
+ def parse_visibility(name, node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:873
+ sig { void }
+ def separate_header_comments; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:883
+ sig { void }
+ def set_root_tree_loc; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:902
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def t_enum_value?(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:897
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def type_variable_definition?(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:114
+class RBI::Parser::Visitor < ::Prism::Visitor
+ # pkg:gem/rbi#lib/rbi/parser.rb:116
+ sig { params(source: ::String, file: ::String).void }
+ def initialize(source, file:); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:143
+ sig { params(node: ::Prism::Node).returns(::Prism::Location) }
+ def adjust_prism_location_for_heredoc(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:126
+ sig { params(node: ::Prism::Node).returns(::RBI::Loc) }
+ def node_loc(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:131
+ sig { params(node: T.nilable(::Prism::Node)).returns(T.nilable(::String)) }
+ def node_string(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:138
+ sig { params(node: ::Prism::Node).returns(::String) }
+ def node_string!(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:154
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def self?(node); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:159
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def t_sig_without_runtime?(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/printer.rb:7
+class RBI::Printer < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/printer.rb:25
+ sig do
+ params(
+ out: T.any(::IO, ::String, ::StringIO),
+ indent: ::Integer,
+ print_locs: T::Boolean,
+ max_line_length: T.nilable(::Integer)
+ ).void
+ end
+ def initialize(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:19
+ sig { returns(::Integer) }
+ def current_indent; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:48
+ sig { returns(::String) }
+ def current_indent_string; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:43
+ sig { void }
+ def dedent; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:13
+ def in_visibility_group; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:13
+ def in_visibility_group=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:38
+ sig { void }
+ def indent; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:22
+ sig { returns(T.nilable(::Integer)) }
+ def max_line_length; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:16
+ sig { returns(T.nilable(::RBI::Node)) }
+ def previous_node; end
+
+ # Print a string without indentation nor `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:54
+ sig { params(string: ::String).void }
+ def print(string); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:13
+ sig { returns(T::Boolean) }
+ def print_locs; end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:13
+ def print_locs=(_arg0); end
+
+ # Print a string with indentation and `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:76
+ sig { params(string: ::String).void }
+ def printl(string); end
+
+ # Print a string without indentation but with a `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:60
+ sig { params(string: T.nilable(::String)).void }
+ def printn(string = T.unsafe(nil)); end
+
+ # Print a string with indentation but without a `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:69
+ sig { params(string: T.nilable(::String)).void }
+ def printt(string = T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:84
+ sig { override.params(nodes: T::Array[::RBI::Node]).void }
+ def visit_all(nodes); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:98
+ sig { override.params(file: ::RBI::File).void }
+ def visit_file(file); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:702
+ sig { params(node: ::RBI::Node).returns(T::Boolean) }
+ def oneline?(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:670
+ sig { params(node: ::RBI::Node).void }
+ def print_blank_line_before(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:680
+ sig { params(node: ::RBI::Node).void }
+ def print_loc(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:686
+ sig { params(node: ::RBI::Param, last: T::Boolean).void }
+ def print_param_comment_leading_space(node, last:); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:761
+ sig { params(node: ::RBI::Sig).void }
+ def print_sig_as_block(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:731
+ sig { params(node: ::RBI::Sig).void }
+ def print_sig_as_line(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:694
+ sig { params(node: ::RBI::SigParam, last: T::Boolean).void }
+ def print_sig_param_comment_leading_space(node, last:); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:831
+ sig { params(node: ::RBI::Sig).returns(T::Array[::String]) }
+ def sig_modifiers(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:481
+ sig { override.params(node: ::RBI::Arg).void }
+ def visit_arg(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:280
+ sig { params(node: ::RBI::Attr).void }
+ def visit_attr(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:263
+ sig { override.params(node: ::RBI::AttrAccessor).void }
+ def visit_attr_accessor(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:269
+ sig { override.params(node: ::RBI::AttrReader).void }
+ def visit_attr_reader(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:275
+ sig { override.params(node: ::RBI::AttrWriter).void }
+ def visit_attr_writer(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:160
+ sig { override.params(node: ::RBI::BlankLine).void }
+ def visit_blank_line(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:401
+ sig { override.params(node: ::RBI::BlockParam).void }
+ def visit_block_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:180
+ sig { override.params(node: ::RBI::Class).void }
+ def visit_class(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:139
+ sig { override.params(node: ::RBI::Comment).void }
+ def visit_comment(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:646
+ sig { override.params(node: ::RBI::ConflictTree).void }
+ def visit_conflict_tree(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:253
+ sig { override.params(node: ::RBI::Const).void }
+ def visit_const(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:413
+ sig { override.params(node: ::RBI::Extend).void }
+ def visit_extend(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:615
+ sig { override.params(node: ::RBI::Group).void }
+ def visit_group(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:599
+ sig { override.params(node: ::RBI::Helper).void }
+ def visit_helper(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:407
+ sig { override.params(node: ::RBI::Include).void }
+ def visit_include(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:487
+ sig { override.params(node: ::RBI::KwArg).void }
+ def visit_kw_arg(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:389
+ sig { override.params(node: ::RBI::KwOptParam).void }
+ def visit_kw_opt_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:383
+ sig { override.params(node: ::RBI::KwParam).void }
+ def visit_kw_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:395
+ sig { override.params(node: ::RBI::KwRestParam).void }
+ def visit_kw_rest_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:315
+ sig { override.params(node: ::RBI::Method).void }
+ def visit_method(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:609
+ sig { override.params(node: ::RBI::MixesInClassMethods).void }
+ def visit_mixes_in_class_methods(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:418
+ sig { params(node: ::RBI::Mixin).void }
+ def visit_mixin(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:174
+ sig { override.params(node: ::RBI::Module).void }
+ def visit_module(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:371
+ sig { override.params(node: ::RBI::OptParam).void }
+ def visit_opt_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:448
+ sig { override.params(node: ::RBI::Private).void }
+ def visit_private(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:442
+ sig { override.params(node: ::RBI::Protected).void }
+ def visit_protected(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:436
+ sig { override.params(node: ::RBI::Public).void }
+ def visit_public(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:118
+ sig { override.params(node: ::RBI::RBSComment).void }
+ def visit_rbs_comment(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:365
+ sig { override.params(node: ::RBI::ReqParam).void }
+ def visit_req_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:636
+ sig { override.params(node: ::RBI::RequiresAncestor).void }
+ def visit_requires_ancestor(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:377
+ sig { override.params(node: ::RBI::RestParam).void }
+ def visit_rest_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:197
+ sig { params(node: ::RBI::Scope).void }
+ def visit_scope(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:242
+ sig { params(node: ::RBI::Scope).void }
+ def visit_scope_body(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:656
+ sig { override.params(node: ::RBI::ScopeConflict).void }
+ def visit_scope_conflict(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:207
+ sig { params(node: ::RBI::Scope).void }
+ def visit_scope_header(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:463
+ sig { override.params(node: ::RBI::Send).void }
+ def visit_send(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:495
+ sig { override.params(node: ::RBI::Sig).void }
+ def visit_sig(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:516
+ sig { override.params(node: ::RBI::SigParam).void }
+ def visit_sig_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:192
+ sig { override.params(node: ::RBI::SingletonClass).void }
+ def visit_singleton_class(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:186
+ sig { override.params(node: ::RBI::Struct).void }
+ def visit_struct(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:541
+ sig { params(node: ::RBI::TStructField).void }
+ def visit_t_struct_field(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:560
+ sig { override.params(node: ::RBI::TEnum).void }
+ def visit_tenum(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:566
+ sig { override.params(node: ::RBI::TEnumBlock).void }
+ def visit_tenum_block(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:579
+ sig { override.params(node: ::RBI::TEnumValue).void }
+ def visit_tenum_value(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:166
+ sig { override.params(node: ::RBI::Tree).void }
+ def visit_tree(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:524
+ sig { override.params(node: ::RBI::TStruct).void }
+ def visit_tstruct(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:530
+ sig { override.params(node: ::RBI::TStructConst).void }
+ def visit_tstruct_const(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:536
+ sig { override.params(node: ::RBI::TStructProp).void }
+ def visit_tstruct_prop(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:589
+ sig { override.params(node: ::RBI::TypeMember).void }
+ def visit_type_member(node); end
+
+ # pkg:gem/rbi#lib/rbi/printer.rb:453
+ sig { params(node: ::RBI::Visibility).void }
+ def visit_visibility(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/printer.rb:622
+ sig { override.params(node: ::RBI::VisibilityGroup).void }
+ def visit_visibility_group(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/printer.rb:828
+RBI::Printer::EMPTY_MODIFIERS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rbi#lib/rbi/printer.rb:10
+RBI::Printer::INDENT_CACHE = T.let(T.unsafe(nil), Array)
+
+# Pre-computed indentation strings to avoid allocating " " * indent on every line.
+#
+# pkg:gem/rbi#lib/rbi/printer.rb:9
+RBI::Printer::MAX_CACHED_INDENT = T.let(T.unsafe(nil), Integer)
+
+# pkg:gem/rbi#lib/rbi/printer.rb:5
+class RBI::PrinterError < ::RBI::Error; end
+
+# pkg:gem/rbi#lib/rbi/model.rb:937
+class RBI::Private < ::RBI::Visibility
+ # pkg:gem/rbi#lib/rbi/model.rb:939
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Private).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:929
+class RBI::Protected < ::RBI::Visibility
+ # pkg:gem/rbi#lib/rbi/model.rb:931
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Protected).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:918
+class RBI::Public < ::RBI::Visibility
+ # pkg:gem/rbi#lib/rbi/model.rb:920
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Public).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+end
+
+# Shared default instance to avoid allocating a new Public on every Method/Attr creation.
+#
+# pkg:gem/rbi#lib/rbi/model.rb:926
+RBI::Public::DEFAULT = T.let(T.unsafe(nil), RBI::Public)
+
+# pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:5
+module RBI::RBS; end
+
+# pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:6
+class RBI::RBS::MethodTypeTranslator
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:38
+ sig { params(method: ::RBI::Method, options: ::RBI::RBS::MethodTypeTranslator::Options).void }
+ def initialize(method, options: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:35
+ sig { returns(::RBI::Sig) }
+ def result; end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:47
+ sig { params(type: ::RBS::MethodType).void }
+ def visit(type); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:136
+ sig { params(param: ::RBI::Param).returns(T.nilable(::String)) }
+ def anonymous_param_name(param); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:121
+ sig { params(param: ::RBS::Types::Function::Param, index: ::Integer).returns(::RBI::SigParam) }
+ def translate_function_param(param, index); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:148
+ sig { params(type: T.untyped).returns(::RBI::Type) }
+ def translate_type(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:63
+ sig { params(type: ::RBS::Types::Block).void }
+ def visit_block_type(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:78
+ sig { params(type: ::RBS::Types::Function).void }
+ def visit_function_type(type); end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:11
+ sig { params(method: ::RBI::Method, type: ::RBS::MethodType).returns(::RBI::Sig) }
+ def translate(method, type); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:7
+class RBI::RBS::MethodTypeTranslator::Error < ::RBI::Error; end
+
+# pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:18
+class RBI::RBS::MethodTypeTranslator::Options
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:23
+ sig { params(erase_generic_types: T::Boolean).void }
+ def initialize(erase_generic_types: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:20
+ sig { returns(T::Boolean) }
+ def erase_generic_types; end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/rbs/method_type_translator.rb:30
+ sig { returns(::RBI::RBS::MethodTypeTranslator::Options) }
+ def default; end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:6
+class RBI::RBS::TypeTranslator
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:41
+ sig { params(options: ::RBI::RBS::MethodTypeTranslator::Options).void }
+ def initialize(options: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:46
+ sig do
+ params(
+ type: T.any(::RBS::Types::Alias, ::RBS::Types::Bases::Any, ::RBS::Types::Bases::Bool, ::RBS::Types::Bases::Bottom, ::RBS::Types::Bases::Class, ::RBS::Types::Bases::Instance, ::RBS::Types::Bases::Nil, ::RBS::Types::Bases::Self, ::RBS::Types::Bases::Top, ::RBS::Types::Bases::Void, ::RBS::Types::ClassInstance, ::RBS::Types::ClassSingleton, ::RBS::Types::Function, ::RBS::Types::Interface, ::RBS::Types::Intersection, ::RBS::Types::Literal, ::RBS::Types::Optional, ::RBS::Types::Proc, ::RBS::Types::Record, ::RBS::Types::Tuple, ::RBS::Types::Union, ::RBS::Types::UntypedFunction, ::RBS::Types::Variable)
+ ).returns(::RBI::Type)
+ end
+ def translate(type); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:220
+ sig { params(type_name: ::String).returns(::String) }
+ def erase_t_generic_type(type_name); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:135
+ sig { params(type: ::RBS::Types::ClassInstance).returns(::RBI::Type) }
+ def translate_class_instance(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:147
+ sig { params(type: ::RBS::Types::Function).returns(::RBI::Type) }
+ def translate_function(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:215
+ sig { params(type_name: ::String).returns(::String) }
+ def translate_t_generic_type(type_name); end
+
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:123
+ sig { params(type: ::RBS::Types::Alias).returns(::RBI::Type) }
+ def translate_type_alias(type); end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:33
+ sig do
+ params(
+ type: T.any(::RBS::Types::Alias, ::RBS::Types::Bases::Any, ::RBS::Types::Bases::Bool, ::RBS::Types::Bases::Bottom, ::RBS::Types::Bases::Class, ::RBS::Types::Bases::Instance, ::RBS::Types::Bases::Nil, ::RBS::Types::Bases::Self, ::RBS::Types::Bases::Top, ::RBS::Types::Bases::Void, ::RBS::Types::ClassInstance, ::RBS::Types::ClassSingleton, ::RBS::Types::Function, ::RBS::Types::Interface, ::RBS::Types::Intersection, ::RBS::Types::Literal, ::RBS::Types::Optional, ::RBS::Types::Proc, ::RBS::Types::Record, ::RBS::Types::Tuple, ::RBS::Types::Union, ::RBS::Types::UntypedFunction, ::RBS::Types::Variable)
+ ).returns(::RBI::Type)
+ end
+ def translate(type); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:206
+RBI::RBS::TypeTranslator::GENERIC_TYPE_TO_SORBET_GENERIC_TYPE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:38
+RBI::RBS::TypeTranslator::Options = RBI::RBS::MethodTypeTranslator::Options
+
+# pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:193
+RBI::RBS::TypeTranslator::RUNTIME_GENERIC_TYPES = T.let(T.unsafe(nil), Array)
+
+RBI::RBS::TypeTranslator::RbsType = T.type_alias { T.any(::RBS::Types::Alias, ::RBS::Types::Bases::Any, ::RBS::Types::Bases::Bool, ::RBS::Types::Bases::Bottom, ::RBS::Types::Bases::Class, ::RBS::Types::Bases::Instance, ::RBS::Types::Bases::Nil, ::RBS::Types::Bases::Self, ::RBS::Types::Bases::Top, ::RBS::Types::Bases::Void, ::RBS::Types::ClassInstance, ::RBS::Types::ClassSingleton, ::RBS::Types::Function, ::RBS::Types::Interface, ::RBS::Types::Intersection, ::RBS::Types::Literal, ::RBS::Types::Optional, ::RBS::Types::Proc, ::RBS::Types::Record, ::RBS::Types::Tuple, ::RBS::Types::Union, ::RBS::Types::UntypedFunction, ::RBS::Types::Variable) }
+
+# pkg:gem/rbi#lib/rbi/rbs/type_translator.rb:210
+RBI::RBS::TypeTranslator::SORBET_GENERIC_TYPE_TO_GENERIC_TYPE = T.let(T.unsafe(nil), Hash)
+
+# A comment representing a RBS type prefixed with `#:`
+#
+# pkg:gem/rbi#lib/rbi/model.rb:78
+class RBI::RBSComment < ::RBI::Comment
+ # pkg:gem/rbi#lib/rbi/model.rb:80
+ sig { params(other: ::Object).returns(T::Boolean) }
+ def ==(other); end
+end
+
+# pkg:gem/rbi#lib/rbi/rbs_printer.rb:5
+class RBI::RBSPrinter < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:31
+ sig do
+ params(
+ out: T.any(::IO, ::StringIO),
+ indent: ::Integer,
+ print_locs: T::Boolean,
+ positional_names: T::Boolean,
+ max_line_length: T.nilable(::Integer),
+ force_multiline_signatures: T::Boolean
+ ).void
+ end
+ def initialize(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), positional_names: T.unsafe(nil), max_line_length: T.unsafe(nil), force_multiline_signatures: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:15
+ sig { returns(::Integer) }
+ def current_indent; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:58
+ sig { void }
+ def dedent; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:9
+ def in_visibility_group; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:9
+ def in_visibility_group=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:53
+ sig { void }
+ def indent; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:21
+ sig { returns(T.nilable(::Integer)) }
+ def max_line_length; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:18
+ sig { returns(T::Boolean) }
+ def positional_names; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:18
+ def positional_names=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:12
+ sig { returns(T.nilable(::RBI::Node)) }
+ def previous_node; end
+
+ # Print a string without indentation nor `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:64
+ sig { params(string: ::String).void }
+ def print(string); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:311
+ sig { params(node: ::RBI::Attr, sig: ::RBI::Sig).void }
+ def print_attr_sig(node, sig); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:9
+ sig { returns(T::Boolean) }
+ def print_locs; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:9
+ def print_locs=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:409
+ sig { params(node: ::RBI::Method, sig: ::RBI::Sig).void }
+ def print_method_sig(node, sig); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:426
+ sig { params(node: ::RBI::Method, sig: ::RBI::Sig).void }
+ def print_method_sig_inline(node, sig); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:488
+ sig { params(node: ::RBI::Method, sig: ::RBI::Sig).void }
+ def print_method_sig_multiline(node, sig); end
+
+ # Print a string with indentation and `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:84
+ sig { params(string: ::String).void }
+ def printl(string); end
+
+ # Print a string without indentation but with a `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:70
+ sig { params(string: T.nilable(::String)).void }
+ def printn(string = T.unsafe(nil)); end
+
+ # Print a string with indentation but without a `\n` at the end.
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:77
+ sig { params(string: T.nilable(::String)).void }
+ def printt(string = T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:91
+ sig { override.params(nodes: T::Array[::RBI::Node]).void }
+ def visit_all(nodes); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:690
+ sig { override.params(node: ::RBI::Arg).void }
+ def visit_arg(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:279
+ sig { params(node: ::RBI::Attr).void }
+ def visit_attr(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:262
+ sig { override.params(node: ::RBI::AttrAccessor).void }
+ def visit_attr_accessor(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:268
+ sig { override.params(node: ::RBI::AttrReader).void }
+ def visit_attr_reader(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:274
+ sig { override.params(node: ::RBI::AttrWriter).void }
+ def visit_attr_writer(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:133
+ sig { override.params(node: ::RBI::BlankLine).void }
+ def visit_blank_line(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:622
+ sig { override.params(node: ::RBI::BlockParam).void }
+ def visit_block_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:153
+ sig { override.params(node: ::RBI::Class).void }
+ def visit_class(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:116
+ sig { override.params(node: ::RBI::Comment).void }
+ def visit_comment(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:826
+ sig { override.params(node: ::RBI::ConflictTree).void }
+ def visit_conflict_tree(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:246
+ sig { override.params(node: ::RBI::Const).void }
+ def visit_const(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:634
+ sig { override.params(node: ::RBI::Extend).void }
+ def visit_extend(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:103
+ sig { override.params(file: ::RBI::File).void }
+ def visit_file(file); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:799
+ sig { override.params(node: ::RBI::Group).void }
+ def visit_group(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:787
+ sig { override.params(node: ::RBI::Helper).void }
+ def visit_helper(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:628
+ sig { override.params(node: ::RBI::Include).void }
+ def visit_include(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:696
+ sig { override.params(node: ::RBI::KwArg).void }
+ def visit_kw_arg(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:609
+ sig { override.params(node: ::RBI::KwOptParam).void }
+ def visit_kw_opt_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:603
+ sig { override.params(node: ::RBI::KwParam).void }
+ def visit_kw_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:615
+ sig { override.params(node: ::RBI::KwRestParam).void }
+ def visit_kw_rest_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:334
+ sig { override.params(node: ::RBI::Method).void }
+ def visit_method(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:793
+ sig { override.params(node: ::RBI::MixesInClassMethods).void }
+ def visit_mixes_in_class_methods(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:639
+ sig { params(node: ::RBI::Mixin).void }
+ def visit_mixin(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:147
+ sig { override.params(node: ::RBI::Module).void }
+ def visit_module(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:583
+ sig { override.params(node: ::RBI::OptParam).void }
+ def visit_opt_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:669
+ sig { override.params(node: ::RBI::Private).void }
+ def visit_private(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:663
+ sig { override.params(node: ::RBI::Protected).void }
+ def visit_protected(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:657
+ sig { override.params(node: ::RBI::Public).void }
+ def visit_public(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:573
+ sig { override.params(node: ::RBI::ReqParam).void }
+ def visit_req_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:820
+ sig { override.params(node: ::RBI::RequiresAncestor).void }
+ def visit_requires_ancestor(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:593
+ sig { override.params(node: ::RBI::RestParam).void }
+ def visit_rest_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:170
+ sig { params(node: ::RBI::Scope).void }
+ def visit_scope(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:233
+ sig { params(node: ::RBI::Scope).void }
+ def visit_scope_body(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:836
+ sig { override.params(node: ::RBI::ScopeConflict).void }
+ def visit_scope_conflict(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:180
+ sig { params(node: ::RBI::Scope).void }
+ def visit_scope_header(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:684
+ sig { override.params(node: ::RBI::Send).void }
+ def visit_send(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:554
+ sig { params(node: ::RBI::Sig).void }
+ def visit_sig(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:567
+ sig { params(node: ::RBI::SigParam).void }
+ def visit_sig_param(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:165
+ sig { override.params(node: ::RBI::SingletonClass).void }
+ def visit_singleton_class(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:159
+ sig { override.params(node: ::RBI::Struct).void }
+ def visit_struct(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:753
+ sig { override.params(node: ::RBI::TEnum).void }
+ def visit_tenum(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:759
+ sig { override.params(node: ::RBI::TEnumBlock).void }
+ def visit_tenum_block(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:765
+ sig { override.params(node: ::RBI::TEnumValue).void }
+ def visit_tenum_value(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:139
+ sig { override.params(node: ::RBI::Tree).void }
+ def visit_tree(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:702
+ sig { override.params(node: ::RBI::TStruct).void }
+ def visit_tstruct(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:737
+ sig { override.params(node: ::RBI::TStructConst).void }
+ def visit_tstruct_const(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:745
+ sig { override.params(node: ::RBI::TStructProp).void }
+ def visit_tstruct_prop(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:781
+ sig { override.params(node: ::RBI::TypeMember).void }
+ def visit_type_member(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:674
+ sig { params(node: ::RBI::Visibility).void }
+ def visit_visibility(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:806
+ sig { override.params(node: ::RBI::VisibilityGroup).void }
+ def visit_visibility_group(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:929
+ sig { params(node: ::RBI::Node).returns(T::Boolean) }
+ def oneline?(node); end
+
+ # Parse a string containing a `T.let(x, X)` and extract the type
+ #
+ # Returns `nil` is the string is not a `T.let`.
+ #
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:963
+ sig { params(code: T.nilable(::String)).returns(T.nilable(::String)) }
+ def parse_t_let(code); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:951
+ sig { params(type: T.any(::RBI::Type, ::String)).returns(::RBI::Type) }
+ def parse_type(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:852
+ sig { params(node: ::RBI::Node).void }
+ def print_blank_line_before(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:871
+ sig { params(node: ::RBI::Node).void }
+ def print_loc(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:913
+ sig { params(node: ::RBI::Param, last: T::Boolean).void }
+ def print_param_comment_leading_space(node, last:); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:877
+ sig { params(node: ::RBI::Method, param: ::RBI::SigParam).void }
+ def print_sig_param(node, param); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:921
+ sig { params(node: ::RBI::SigParam, last: T::Boolean).void }
+ def print_sig_param_comment_leading_space(node, last:); end
+end
+
+# pkg:gem/rbi#lib/rbi/rbs_printer.rb:6
+class RBI::RBSPrinter::Error < ::RBI::Error; end
+
+# pkg:gem/rbi#lib/rbi/model.rb:5
+class RBI::ReplaceNodeError < ::RBI::Error; end
+
+# pkg:gem/rbi#lib/rbi/model.rb:622
+class RBI::ReqParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:628
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::ReqParam).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:647
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:642
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:625
+ sig { override.returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:636
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1372
+class RBI::RequiresAncestor < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1377
+ sig { params(name: ::String, loc: T.nilable(::RBI::Loc), comments: T.nilable(T::Array[::RBI::Comment])).void }
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:154
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1374
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1384
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:686
+class RBI::RestParam < ::RBI::Param
+ # pkg:gem/rbi#lib/rbi/model.rb:692
+ sig do
+ params(
+ name: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::RestParam).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:711
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:706
+ sig { override.returns(T::Boolean) }
+ def anonymous?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:689
+ sig { override.returns(T.nilable(::String)) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:700
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:5
+module RBI::Rewriters; end
+
+# pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:6
+class RBI::Rewriters::AddSigTemplates < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:8
+ sig { params(with_todo_comment: T::Boolean).void }
+ def initialize(with_todo_comment: T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:15
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:29
+ sig { params(attr: ::RBI::Attr).void }
+ def add_attr_sig(attr); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:44
+ sig { params(method: ::RBI::Method).void }
+ def add_method_sig(method); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:69
+ sig { params(node: ::RBI::NodeWithComments).void }
+ def add_todo_comment(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/annotate.rb:6
+class RBI::Rewriters::Annotate < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/annotate.rb:8
+ sig { params(annotation: ::String, annotate_scopes: T::Boolean, annotate_properties: T::Boolean).void }
+ def initialize(annotation, annotate_scopes: T.unsafe(nil), annotate_properties: T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/annotate.rb:17
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/annotate.rb:30
+ sig { params(node: ::RBI::NodeWithComments).void }
+ def annotate_node(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/annotate.rb:37
+ sig { params(node: ::RBI::Node).returns(T::Boolean) }
+ def root?(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:22
+class RBI::Rewriters::AttrToMethods < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:25
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:38
+ sig { params(node: ::RBI::Node, with: T::Array[::RBI::Node]).void }
+ def replace(node, with:); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/deannotate.rb:6
+class RBI::Rewriters::Deannotate < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/deannotate.rb:8
+ sig { params(annotation: ::String).void }
+ def initialize(annotation); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/deannotate.rb:15
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/deannotate.rb:26
+ sig { params(node: ::RBI::NodeWithComments).void }
+ def deannotate_node(node); end
+end
+
+# Take a gem version and filter out all RBI that is not relevant to that version based on @version annotations
+# in comments. As an example:
+#
+# ~~~rb
+# tree = Parser.parse_string(<<~RBI)
+# class Foo
+# # @version > 0.3.0
+# def bar
+# end
+#
+# # @version <= 0.3.0
+# def bar(arg1)
+# end
+# end
+# RBI
+#
+# Rewriters::FilterVersions.filter(tree, Gem::Version.new("0.3.1"))
+#
+# assert_equal(<<~RBI, tree.string)
+# class Foo
+# # @version > 0.3.0
+# def bar
+# end
+# end
+# RBI
+# ~~~
+#
+# Supported operators:
+# - equals `=`
+# - not equals `!=`
+# - greater than `>`
+# - greater than or equal to `>=`
+# - less than `<`
+# - less than or equal to `<=`
+# - pessimistic or twiddle-wakka`~>`
+#
+# And/or logic:
+# - "And" logic: put multiple versions on the same line
+# - e.g. `@version > 0.3.0, <1.0.0` means version must be greater than 0.3.0 AND less than 1.0.0
+# - "Or" logic: put multiple versions on subsequent lines
+# - e.g. the following means version must be less than 0.3.0 OR greater than 1.0.0
+# ```
+# # @version < 0.3.0
+# # @version > 1.0.0
+# ```
+# Prerelease versions:
+# - Prerelease versions are considered less than their non-prerelease counterparts
+# - e.g. `0.4.0-prerelease` is less than `0.4.0`
+#
+# RBI with no versions:
+# - RBI with no version annotations are automatically counted towards ALL versions
+#
+# pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:57
+class RBI::Rewriters::FilterVersions < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:69
+ sig { params(version: ::Gem::Version).void }
+ def initialize(version); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:76
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:62
+ sig { params(tree: ::RBI::Tree, version: ::Gem::Version).void }
+ def filter(tree, version); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:58
+RBI::Rewriters::FilterVersions::VERSION_PREFIX = T.let(T.unsafe(nil), String)
+
+# Rewrite non-singleton methods inside singleton classes to singleton methods
+#
+# Example:
+# ~~~rb
+# class << self
+# def m1; end
+# def self.m2; end
+#
+# class << self
+# def m3; end
+# end
+# end
+# ~~~
+#
+# will be rewritten to:
+#
+# ~~~rb
+# def self.m1; end
+#
+# class << self
+# def self.m2; end
+# def self.m3; end
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/flatten_singleton_methods.rb:30
+class RBI::Rewriters::FlattenSingletonMethods < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/flatten_singleton_methods.rb:33
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+end
+
+# Flattens visibility nodes into method nodes
+#
+# Example:
+# ~~~rb
+# class A
+# def m1; end
+# private
+# def m2; end
+# def m3; end
+# end
+# ~~~
+#
+# will be transformed into:
+#
+# ~~~rb
+# class A
+# def m1; end
+# private def m2; end
+# private def m3; end
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/flatten_visibilities.rb:27
+class RBI::Rewriters::FlattenVisibilities < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/flatten_visibilities.rb:29
+ sig { void }
+ def initialize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/flatten_visibilities.rb:37
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:8
+class RBI::Rewriters::GroupNodes < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:11
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:37
+ sig { params(node: ::RBI::Node).returns(::RBI::Group::Kind) }
+ def group_kind(node); end
+end
+
+# Merge two RBI trees together
+#
+# Be this `Tree`:
+# ~~~rb
+# class Foo
+# attr_accessor :a
+# def m; end
+# C = 10
+# end
+# ~~~
+#
+# Merged with this one:
+# ~~~rb
+# class Foo
+# attr_reader :a
+# def m(x); end
+# C = 10
+# end
+# ~~~
+#
+# Compatible definitions are merged together while incompatible definitions are moved into a `ConflictTree`:
+# ~~~rb
+# class Foo
+# <<<<<<< left
+# attr_accessor :a
+# def m; end
+# =======
+# attr_reader :a
+# def m(x); end
+# >>>>>>> right
+# C = 10
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:39
+class RBI::Rewriters::Merge
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:66
+ sig { params(left_name: ::String, right_name: ::String, keep: ::RBI::Rewriters::Merge::Keep).void }
+ def initialize(left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:75
+ sig { params(tree: ::RBI::Tree).void }
+ def merge(tree); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:63
+ sig { returns(::RBI::MergeTree) }
+ def tree; end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:50
+ sig do
+ params(
+ left: ::RBI::Tree,
+ right: ::RBI::Tree,
+ left_name: ::String,
+ right_name: ::String,
+ keep: ::RBI::Rewriters::Merge::Keep
+ ).returns(::RBI::MergeTree)
+ end
+ def merge_trees(left, right, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
+ end
+end
+
+# Used for logging / error displaying purpose
+#
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:82
+class RBI::Rewriters::Merge::Conflict
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:90
+ sig { params(left: ::RBI::Node, right: ::RBI::Node, left_name: ::String, right_name: ::String).void }
+ def initialize(left:, right:, left_name:, right_name:); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:84
+ sig { returns(::RBI::Node) }
+ def left; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:87
+ sig { returns(::String) }
+ def left_name; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:84
+ def right; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:87
+ def right_name; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:98
+ sig { returns(::String) }
+ def to_s; end
+end
+
+# Merge adjacent conflict trees
+#
+# Transform this:
+# ~~~rb
+# class Foo
+# <<<<<<< left
+# def m1; end
+# =======
+# def m1(a); end
+# >>>>>>> right
+# <<<<<<< left
+# def m2(a); end
+# =======
+# def m2; end
+# >>>>>>> right
+# end
+# ~~~
+#
+# Into this:
+# ~~~rb
+# class Foo
+# <<<<<<< left
+# def m1; end
+# def m2(a); end
+# =======
+# def m1(a); end
+# def m2; end
+# >>>>>>> right
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:258
+class RBI::Rewriters::Merge::ConflictTreeMerger < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:261
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:267
+ sig { override.params(nodes: T::Array[::RBI::Node]).void }
+ def visit_all(nodes); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:290
+ sig { params(left: ::RBI::Tree, right: ::RBI::Tree).void }
+ def merge_conflict_trees(left, right); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:40
+class RBI::Rewriters::Merge::Keep
+ class << self
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:45
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:42
+RBI::Rewriters::Merge::Keep::LEFT = T.let(T.unsafe(nil), RBI::Rewriters::Merge::Keep)
+
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:41
+RBI::Rewriters::Merge::Keep::NONE = T.let(T.unsafe(nil), RBI::Rewriters::Merge::Keep)
+
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:43
+RBI::Rewriters::Merge::Keep::RIGHT = T.let(T.unsafe(nil), RBI::Rewriters::Merge::Keep)
+
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:103
+class RBI::Rewriters::Merge::TreeMerger < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:108
+ sig do
+ params(
+ output: ::RBI::Tree,
+ left_name: ::String,
+ right_name: ::String,
+ keep: ::RBI::Rewriters::Merge::Keep
+ ).void
+ end
+ def initialize(output, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:105
+ sig { returns(T::Array[::RBI::Rewriters::Merge::Conflict]) }
+ def conflicts; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:121
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:181
+ sig { returns(::RBI::Tree) }
+ def current_scope; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:198
+ sig { params(left: ::RBI::Scope, right: ::RBI::Scope).void }
+ def make_conflict_scope(left, right); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:205
+ sig { params(left: ::RBI::Node, right: ::RBI::Node).void }
+ def make_conflict_tree(left, right); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:186
+ sig { params(node: ::RBI::Node).returns(T.nilable(::RBI::Node)) }
+ def previous_definition(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:217
+ sig { params(left: ::RBI::Scope, right: ::RBI::Scope).returns(::RBI::Scope) }
+ def replace_scope_header(left, right); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/nest_non_public_members.rb:6
+class RBI::Rewriters::NestNonPublicMembers < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_non_public_members.rb:9
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/nest_singleton_methods.rb:6
+class RBI::Rewriters::NestSingletonMethods < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_singleton_methods.rb:9
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+end
+
+# This rewriter moves top-level members into a top-level Object class
+#
+# Example:
+# ~~~rb
+# def foo; end
+# attr_reader :bar
+# ~~~
+#
+# will be rewritten to:
+#
+# ~~~rb
+# class Object
+# def foo; end
+# attr_reader :bar
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/nest_top_level_members.rb:22
+class RBI::Rewriters::NestTopLevelMembers < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_top_level_members.rb:24
+ sig { void }
+ def initialize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_top_level_members.rb:32
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+end
+
+# Remove all definitions existing in the index from the current tree
+#
+# Let's create an `Index` from two different `Tree`s:
+# ~~~rb
+# tree1 = Parse.parse_string(<<~RBI)
+# class Foo
+# def foo; end
+# end
+# RBI
+#
+# tree2 = Parse.parse_string(<<~RBI)
+# FOO = 10
+# RBI
+#
+# index = Index.index(tree1, tree2)
+# ~~~
+#
+# We can use `RemoveKnownDefinitions` to remove the definitions found in the `index` from the `Tree` to clean:
+# ~~~rb
+# tree_to_clean = Parser.parse_string(<<~RBI)
+# class Foo
+# def foo; end
+# def bar; end
+# end
+# FOO = 10
+# BAR = 42
+# RBI
+#
+# cleaned_tree, operations = RemoveKnownDefinitions.remove(tree_to_clean, index)
+#
+# assert_equal(<<~RBI, cleaned_tree)
+# class Foo
+# def bar; end
+# end
+# BAR = 42
+# RBI
+#
+# assert_equal(<<~OPERATIONS, operations.join("\n"))
+# Deleted ::Foo#foo at -:2:2-2-16 (duplicate from -:2:2-2:16)
+# Deleted ::FOO at -:5:0-5:8 (duplicate from -:1:0-1:8)
+# OPERATIONS
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:48
+class RBI::Rewriters::RemoveKnownDefinitions < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:53
+ sig { params(index: ::RBI::Index).void }
+ def initialize(index); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:50
+ sig { returns(T::Array[::RBI::Rewriters::RemoveKnownDefinitions::Operation]) }
+ def operations; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:75
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:69
+ sig { params(nodes: T::Array[::RBI::Node]).void }
+ def visit_all(nodes); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:103
+ sig { params(node: ::RBI::Node, previous: ::RBI::Node).returns(T::Boolean) }
+ def can_delete_node?(node, previous); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:121
+ sig { params(node: ::RBI::Node, previous: ::RBI::Node).void }
+ def delete_node(node, previous); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:94
+ sig { params(node: ::RBI::Indexable).returns(T.nilable(::RBI::Node)) }
+ def previous_definition_for(node); end
+
+ class << self
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:61
+ sig do
+ params(
+ tree: ::RBI::Tree,
+ index: ::RBI::Index
+ ).returns([::RBI::Tree, T::Array[::RBI::Rewriters::RemoveKnownDefinitions::Operation]])
+ end
+ def remove(tree, index); end
+ end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:126
+class RBI::Rewriters::RemoveKnownDefinitions::Operation
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:131
+ sig { params(deleted_node: ::RBI::Node, duplicate_of: ::RBI::Node).void }
+ def initialize(deleted_node:, duplicate_of:); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:128
+ sig { returns(::RBI::Node) }
+ def deleted_node; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:128
+ def duplicate_of; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/remove_known_definitions.rb:137
+ sig { returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:6
+class RBI::Rewriters::SortNodes < ::RBI::Visitor
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:9
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:71
+ sig { params(kind: ::RBI::Group::Kind).returns(::Integer) }
+ def group_rank(kind); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:92
+ sig { params(node: ::RBI::Node).returns(T.nilable(::String)) }
+ def node_name(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:43
+ sig { params(node: ::RBI::Node).returns(::Integer) }
+ def node_rank(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:104
+ sig { params(node: ::RBI::Node).void }
+ def sort_node_names!(node); end
+end
+
+# Translate all RBS signature comments to Sorbet RBI signatures
+#
+# pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:7
+class RBI::Rewriters::TranslateRBSSigs < ::RBI::Visitor
+ # pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:11
+ sig { void }
+ def initialize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:18
+ sig { override.params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:40
+ sig { params(node: T.any(::RBI::Attr, ::RBI::Method)).returns(T::Array[::RBI::RBSComment]) }
+ def extract_rbs_comments(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:67
+ sig { params(node: ::RBI::Attr, comment: ::RBI::RBSComment).returns(::RBI::Sig) }
+ def translate_rbs_attr_type(node, comment); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:59
+ sig { params(node: ::RBI::Method, comment: ::RBI::RBSComment).returns(::RBI::Sig) }
+ def translate_rbs_method_type(node, comment); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:8
+class RBI::Rewriters::TranslateRBSSigs::Error < ::RBI::Error; end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:185
+class RBI::Scope < ::RBI::Tree
+ include ::RBI::Indexable
+
+ abstract!
+
+ # Duplicate `self` scope without its body
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:363
+ sig { returns(T.self_type) }
+ def dup_empty; end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:188
+ sig { abstract.returns(::String) }
+ def fully_qualified_name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:84
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:192
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# A conflict between two scope headers
+#
+# Is rendered as a merge conflict between `left` and` right` for scope definitions:
+# ~~~rb
+# <<<<<<< left
+# class Foo
+# =======
+# module Foo
+# >>>>>>> right
+# def m1; end
+# end
+# ~~~
+#
+# pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:665
+class RBI::ScopeConflict < ::RBI::Tree
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:673
+ sig { params(left: ::RBI::Scope, right: ::RBI::Scope, left_name: ::String, right_name: ::String).void }
+ def initialize(left:, right:, left_name: T.unsafe(nil), right_name: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:667
+ sig { returns(::RBI::Scope) }
+ def left; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:670
+ sig { returns(::String) }
+ def left_name; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:667
+ def right; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:670
+ def right_name; end
+end
+
+# Sends
+#
+# pkg:gem/rbi#lib/rbi/model.rb:947
+class RBI::Send < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:955
+ sig do
+ params(
+ method: ::String,
+ args: T::Array[::RBI::Arg],
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Send).void)
+ ).void
+ end
+ def initialize(method, args = T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:963
+ sig { params(arg: ::RBI::Arg).void }
+ def <<(arg); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:968
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:952
+ sig { returns(T::Array[::RBI::Arg]) }
+ def args; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:591
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:184
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:949
+ sig { returns(::String) }
+ def method; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:973
+ sig { returns(::String) }
+ def to_s; end
+end
+
+# Sorbet's sigs
+#
+# pkg:gem/rbi#lib/rbi/model.rb:1022
+class RBI::Sig < ::RBI::NodeWithComments
+ # pkg:gem/rbi#lib/rbi/model.rb:1080
+ sig do
+ params(
+ params: T.nilable(T::Array[::RBI::SigParam]),
+ return_type: T.any(::RBI::Type, ::String),
+ is_abstract: T::Boolean,
+ is_override: T::Boolean,
+ is_overridable: T::Boolean,
+ is_final: T::Boolean,
+ allow_incompatible_override: T::Boolean,
+ allow_incompatible_override_visibility: T::Boolean,
+ without_runtime: T::Boolean,
+ type_params: T.nilable(T::Array[::String]),
+ checked: T.nilable(::Symbol),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Sig).void)
+ ).void
+ end
+ def initialize(params: T.unsafe(nil), return_type: T.unsafe(nil), is_abstract: T.unsafe(nil), is_override: T.unsafe(nil), is_overridable: T.unsafe(nil), is_final: T.unsafe(nil), allow_incompatible_override: T.unsafe(nil), allow_incompatible_override_visibility: T.unsafe(nil), without_runtime: T.unsafe(nil), type_params: T.unsafe(nil), checked: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1112
+ sig { params(param: ::RBI::SigParam).void }
+ def <<(param); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1122
+ sig { params(other: ::Object).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1117
+ sig { params(name: ::String, type: T.any(::RBI::Type, ::String)).void }
+ def add_param(name, type); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1044
+ sig { returns(T::Boolean) }
+ def allow_incompatible_override; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1044
+ def allow_incompatible_override=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1047
+ sig { returns(T::Boolean) }
+ def allow_incompatible_override_visibility; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1047
+ def allow_incompatible_override_visibility=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1063
+ sig { returns(T.nilable(::Symbol)) }
+ def checked; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1063
+ def checked=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1032
+ sig { returns(T::Boolean) }
+ def is_abstract; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1032
+ def is_abstract=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1041
+ sig { returns(T::Boolean) }
+ def is_final; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1041
+ def is_final=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1038
+ sig { returns(T::Boolean) }
+ def is_overridable; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1038
+ def is_overridable=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1035
+ sig { returns(T::Boolean) }
+ def is_override; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1035
+ def is_override=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1024
+ sig { returns(T::Array[::RBI::SigParam]) }
+ def params; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1029
+ sig { returns(T.any(::RBI::Type, ::String)) }
+ def return_type; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1029
+ def return_type=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1053
+ sig { returns(T::Array[::String]) }
+ def type_params; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1058
+ sig { returns(T::Boolean) }
+ def type_params?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1050
+ sig { returns(T::Boolean) }
+ def without_runtime; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1050
+ def without_runtime=(_arg0); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1131
+class RBI::SigParam < ::RBI::NodeWithComments
+ # pkg:gem/rbi#lib/rbi/model.rb:1139
+ sig do
+ params(
+ name: ::String,
+ type: T.any(::RBI::Type, ::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::SigParam).void)
+ ).void
+ end
+ def initialize(name, type, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1159
+ sig { params(other: ::Object).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1154
+ sig { returns(T::Boolean) }
+ def anonymous?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1133
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1149
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1136
+ sig { returns(T.any(::RBI::Type, ::String)) }
+ def type; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:246
+class RBI::SingletonClass < ::RBI::Scope
+ # pkg:gem/rbi#lib/rbi/model.rb:248
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::SingletonClass).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:255
+ sig { override.returns(::String) }
+ def fully_qualified_name; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:260
+class RBI::Struct < ::RBI::Scope
+ # pkg:gem/rbi#lib/rbi/model.rb:277
+ sig do
+ params(
+ name: ::String,
+ members: T::Array[::Symbol],
+ keyword_init: T::Boolean,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(struct: ::RBI::Struct).void)
+ ).void
+ end
+ def initialize(name, members: T.unsafe(nil), keyword_init: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:404
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:287
+ sig { override.returns(::String) }
+ def fully_qualified_name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:268
+ sig { returns(T::Boolean) }
+ def keyword_init; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:268
+ def keyword_init=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:265
+ sig { returns(T::Array[::Symbol]) }
+ def members; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:265
+ def members=(_arg0); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:262
+ sig { returns(::String) }
+ def name; end
+end
+
+# Sorbet's T::Enum
+#
+# pkg:gem/rbi#lib/rbi/model.rb:1256
+class RBI::TEnum < ::RBI::Class
+ # pkg:gem/rbi#lib/rbi/model.rb:1258
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(klass: ::RBI::TEnum).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1264
+class RBI::TEnumBlock < ::RBI::Scope
+ # pkg:gem/rbi#lib/rbi/model.rb:1266
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::TEnumBlock).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1273
+ sig { override.returns(::String) }
+ def fully_qualified_name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:214
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1279
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1284
+class RBI::TEnumValue < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1289
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::TEnumValue).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1296
+ sig { returns(::String) }
+ def fully_qualified_name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:224
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1286
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1302
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# Sorbet's T::Struct
+#
+# pkg:gem/rbi#lib/rbi/model.rb:1168
+class RBI::TStruct < ::RBI::Class
+ # pkg:gem/rbi#lib/rbi/model.rb:1170
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(klass: ::RBI::TStruct).void)
+ ).void
+ end
+ def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1200
+class RBI::TStructConst < ::RBI::TStructField
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1208
+ sig do
+ params(
+ name: ::String,
+ type: T.any(::RBI::Type, ::String),
+ default: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::TStructConst).void)
+ ).void
+ end
+ def initialize(name, type, default: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:607
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1215
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:194
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1222
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:1177
+class RBI::TStructField < ::RBI::NodeWithComments
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1188
+ sig do
+ params(
+ name: ::String,
+ type: T.any(::RBI::Type, ::String),
+ default: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment])
+ ).void
+ end
+ def initialize(name, type, default: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:599
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1185
+ sig { returns(T.nilable(::String)) }
+ def default; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1185
+ def default=(_arg0); end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1197
+ sig { abstract.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1179
+ sig { returns(::String) }
+ def name; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1182
+ sig { returns(T.any(::RBI::Type, ::String)) }
+ def type; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1182
+ def type=(_arg0); end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1227
+class RBI::TStructProp < ::RBI::TStructField
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1235
+ sig do
+ params(
+ name: ::String,
+ type: T.any(::RBI::Type, ::String),
+ default: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::TStructProp).void)
+ ).void
+ end
+ def initialize(name, type, default: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:615
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1242
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:204
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1249
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:120
+class RBI::Tree < ::RBI::NodeWithComments
+ # pkg:gem/rbi#lib/rbi/model.rb:125
+ sig do
+ params(
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::Tree).void)
+ ).void
+ end
+ def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:132
+ sig { params(node: ::RBI::Node).void }
+ def <<(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/add_sig_templates.rb:77
+ sig { params(with_todo_comment: T::Boolean).void }
+ def add_sig_templates!(with_todo_comment: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/annotate.rb:46
+ sig { params(annotation: ::String, annotate_scopes: T::Boolean, annotate_properties: T::Boolean).void }
+ def annotate!(annotation, annotate_scopes: T.unsafe(nil), annotate_properties: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/deannotate.rb:38
+ sig { params(annotation: ::String).void }
+ def deannotate!(annotation); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:138
+ sig { returns(T::Boolean) }
+ def empty?; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/filter_versions.rb:113
+ sig { params(version: ::Gem::Version).void }
+ def filter_versions!(version); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/flatten_singleton_methods.rb:58
+ sig { void }
+ def flatten_singleton_methods!; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/flatten_visibilities.rb:57
+ sig { void }
+ def flatten_visibilities!; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/group_nodes.rb:80
+ sig { void }
+ def group_nodes!; end
+
+ # pkg:gem/rbi#lib/rbi/index.rb:62
+ sig { returns(::RBI::Index) }
+ def index; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/merge_trees.rb:336
+ sig do
+ params(
+ other: ::RBI::Tree,
+ left_name: ::String,
+ right_name: ::String,
+ keep: ::RBI::Rewriters::Merge::Keep
+ ).returns(::RBI::MergeTree)
+ end
+ def merge(other, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_non_public_members.rb:52
+ sig { void }
+ def nest_non_public_members!; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_singleton_methods.rb:41
+ sig { void }
+ def nest_singleton_methods!; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_top_level_members.rb:60
+ sig { void }
+ def nest_top_level_members!; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:122
+ sig { returns(T::Array[::RBI::Node]) }
+ def nodes; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:50
+ sig { void }
+ def replace_attributes_with_methods!; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/sort_nodes.rb:115
+ sig { void }
+ def sort_nodes!; end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/translate_rbs_sigs.rb:88
+ sig { void }
+ def translate_rbs_sigs!; end
+end
+
+# The base class for all RBI types.
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/type.rb:7
+class RBI::Type
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/type.rb:993
+ sig { void }
+ def initialize; end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1064
+ sig { abstract.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:1067
+ sig { params(other: ::BasicObject).returns(T::Boolean) }
+ def eql?(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1073
+ sig { override.returns(::Integer) }
+ def hash; end
+
+ # Returns a new type that is `nilable` if it is not already.
+ #
+ # If the type is already nilable, it returns itself.
+ # ```ruby
+ # type = RBI::Type.simple("String")
+ # type.to_rbi # => "String"
+ # type.nilable.to_rbi # => "::T.nilable(String)"
+ # type.nilable.nilable.to_rbi # => "::T.nilable(String)"
+ # ```
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1007
+ sig { returns(::RBI::Type) }
+ def nilable; end
+
+ # Returns whether the type is nilable.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1034
+ sig { returns(T::Boolean) }
+ def nilable?; end
+
+ # Returns the non-nilable version of the type.
+ # If the type is already non-nilable, it returns itself.
+ # If the type is nilable, it returns the inner type.
+ #
+ # ```ruby
+ # type = RBI::Type.nilable(RBI::Type.simple("String"))
+ # type.to_rbi # => "::T.nilable(String)"
+ # type.non_nilable.to_rbi # => "String"
+ # type.non_nilable.non_nilable.to_rbi # => "String"
+ # ```
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1022
+ sig { returns(::RBI::Type) }
+ def non_nilable; end
+
+ # Returns a normalized version of the type.
+ #
+ # Normalized types are meant to be easier to process, not to read.
+ # For example, `T.any(TrueClass, FalseClass)` instead of `T::Boolean` or
+ # `T.any(String, NilClass)` instead of `T.nilable(String)`.
+ #
+ # This is the inverse of `#simplify`.
+ #
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1048
+ sig { abstract.returns(::RBI::Type) }
+ def normalize; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1266
+ sig { returns(::String) }
+ def rbs_string; end
+
+ # Returns a simplified version of the type.
+ #
+ # Simplified types are meant to be easier to read, not to process.
+ # For example, `T::Boolean` instead of `T.any(TrueClass, FalseClass)` or
+ # `T.nilable(String)` instead of `T.any(String, NilClass)`.
+ #
+ # This is the inverse of `#normalize`.
+ #
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1060
+ sig { abstract.returns(::RBI::Type) }
+ def simplify; end
+
+ # @abstract
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1079
+ sig { abstract.returns(::String) }
+ def to_rbi; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:1083
+ sig { override.returns(::String) }
+ def to_s; end
+
+ class << self
+ # Builds a type that represents an intersection of multiple types like `T.all(String, Integer)`.
+ #
+ # Note that this method transforms types such as `T.all(String, String)` into `String`, so
+ # it may return something other than a `All`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:929
+ sig { params(type1: ::RBI::Type, type2: ::RBI::Type, types: ::RBI::Type).returns(::RBI::Type) }
+ def all(type1, type2, *types); end
+
+ # Builds a type that represents a union of multiple types like `T.any(String, Integer)`.
+ #
+ # Note that this method transforms types such as `T.any(String, NilClass)` into `T.nilable(String)`, so
+ # it may return something other than a `Any`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:938
+ sig { params(type1: ::RBI::Type, type2: ::RBI::Type, types: ::RBI::Type).returns(::RBI::Type) }
+ def any(type1, type2, *types); end
+
+ # Builds a type that represents `T.anything`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:854
+ sig { returns(::RBI::Type::Anything) }
+ def anything; end
+
+ # Builds a type that represents `T.attached_class`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:860
+ sig { returns(::RBI::Type::AttachedClass) }
+ def attached_class; end
+
+ # Builds a type that represents `T::Boolean`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:866
+ sig { returns(::RBI::Type::Boolean) }
+ def boolean; end
+
+ # Builds a type that represents the singleton class of another type like `T.class_of(Foo)`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:910
+ sig { params(type: ::RBI::Type::Simple, type_parameter: T.nilable(::RBI::Type)).returns(::RBI::Type::ClassOf) }
+ def class_of(type, type_parameter = T.unsafe(nil)); end
+
+ # Builds a type that represents a generic type like `T::Array[String]` or `T::Hash[Symbol, Integer]`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:946
+ sig { params(name: ::String, params: T.any(::RBI::Type, T::Array[::RBI::Type])).returns(::RBI::Type::Generic) }
+ def generic(name, *params); end
+
+ # Builds a type that represents a nilable of another type like `T.nilable(String)`.
+ #
+ # Note that this method transforms types such as `T.nilable(T.untyped)` into `T.untyped`, so
+ # it may return something other than a `RBI::Type::Nilable`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:919
+ sig { params(type: ::RBI::Type).returns(::RBI::Type) }
+ def nilable(type); end
+
+ # Builds a type that represents `T.noreturn`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:872
+ sig { returns(::RBI::Type::NoReturn) }
+ def noreturn; end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:26
+ sig { params(node: ::Prism::Node).returns(::RBI::Type) }
+ def parse_node(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:10
+ sig { params(string: ::String).returns(::RBI::Type) }
+ def parse_string(string); end
+
+ # Builds a type that represents a proc type like `T.proc.void`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:980
+ sig { returns(::RBI::Type::Proc) }
+ def proc; end
+
+ # Builds a type that represents `T.self_type`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:878
+ sig { returns(::RBI::Type::SelfType) }
+ def self_type; end
+
+ # Builds a type that represents a shape type like `{name: String, age: Integer}`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:972
+ sig { params(types: T::Hash[T.any(::String, ::Symbol), ::RBI::Type]).returns(::RBI::Type::Shape) }
+ def shape(types = T.unsafe(nil)); end
+
+ # Builds a simple type like `String` or `::Foo::Bar`.
+ #
+ # It raises a `NameError` if the name is not a valid Ruby class identifier.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:843
+ sig { params(name: ::String).returns(::RBI::Type::Simple) }
+ def simple(name); end
+
+ # Builds a type that represents the class of another type like `T::Class[Foo]`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:898
+ sig { params(type: ::RBI::Type).returns(::RBI::Type::Class) }
+ def t_class(type); end
+
+ # Builds a type that represents the module of another type like `T::Module[Foo]`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:904
+ sig { params(type: ::RBI::Type).returns(::RBI::Type::Module) }
+ def t_module(type); end
+
+ # Builds a type that represents a tuple type like `[String, Integer]`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:966
+ sig { params(types: T.any(::RBI::Type, T::Array[::RBI::Type])).returns(::RBI::Type::Tuple) }
+ def tuple(*types); end
+
+ # Builds a type that represents a type alias like `MyTypeAlias`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:958
+ sig { params(name: ::String, aliased_type: ::RBI::Type).returns(::RBI::Type::TypeAlias) }
+ def type_alias(name, aliased_type); end
+
+ # Builds a type that represents a type parameter like `T.type_parameter(:U)`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:952
+ sig { params(name: ::Symbol).returns(::RBI::Type::TypeParameter) }
+ def type_parameter(name); end
+
+ # Builds a type that represents `T.untyped`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:884
+ sig { returns(::RBI::Type::Untyped) }
+ def untyped; end
+
+ # Builds a type that represents `void`.
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:890
+ sig { returns(::RBI::Type::Void) }
+ def void; end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:322
+ sig { params(node: ::Prism::CallNode).returns(T::Array[::Prism::Node]) }
+ def call_chain(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:309
+ sig { params(node: ::Prism::CallNode, count: ::Integer).returns(T::Array[::Prism::Node]) }
+ def check_arguments_at_least!(node, count); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:294
+ sig { params(node: ::Prism::CallNode, count: ::Integer).returns(T::Array[::Prism::Node]) }
+ def check_arguments_exactly!(node, count); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:96
+ sig { params(node: ::Prism::CallNode).returns(::RBI::Type) }
+ def parse_call(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:56
+ sig { params(node: T.any(::Prism::ConstantPathNode, ::Prism::ConstantReadNode)).returns(::RBI::Type) }
+ def parse_constant(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:73
+ sig { params(node: T.any(::Prism::ConstantPathWriteNode, ::Prism::ConstantWriteNode)).returns(::RBI::Type) }
+ def parse_constant_assignment(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:244
+ sig { params(node: ::Prism::CallNode).returns(::RBI::Type) }
+ def parse_proc(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:223
+ sig { params(node: T.any(::Prism::HashNode, ::Prism::KeywordHashNode)).returns(::RBI::Type) }
+ def parse_shape(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:218
+ sig { params(node: ::Prism::ArrayNode).returns(::RBI::Type) }
+ def parse_tuple(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:335
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def t?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:354
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def t_boolean?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:361
+ sig { params(node: ::Prism::ConstantPathNode).returns(T::Boolean) }
+ def t_class?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:371
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def t_class_of?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:366
+ sig { params(node: ::Prism::ConstantPathNode).returns(T::Boolean) }
+ def t_module?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:378
+ sig { params(node: ::Prism::CallNode).returns(T::Boolean) }
+ def t_proc?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type_parser.rb:347
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def t_type_alias?(node); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:987
+ sig { params(name: ::String).returns(T::Boolean) }
+ def valid_identifier?(name); end
+ end
+end
+
+# A type that is intersection of multiple types like `T.all(String, Integer)`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:420
+class RBI::Type::All < ::RBI::Type::Composite
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:429
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:449
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:423
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# A type that is union of multiple types like `T.any(String, Integer)`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:462
+class RBI::Type::Any < ::RBI::Type::Composite
+ # pkg:gem/rbi#lib/rbi/type.rb:470
+ sig { returns(T::Boolean) }
+ def nilable?; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:476
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:496
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:465
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# `T.anything`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:51
+class RBI::Type::Anything < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:54
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:66
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:72
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:60
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# `T.attached_class`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:78
+class RBI::Type::AttachedClass < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:81
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:93
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:99
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:87
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# `T::Boolean`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:105
+class RBI::Type::Boolean < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:108
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:120
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:126
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:114
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# The class of another type like `T::Class[Foo]`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:242
+class RBI::Type::Class < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:247
+ sig { params(type: ::RBI::Type).void }
+ def initialize(type); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:254
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:266
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:272
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:260
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:244
+ sig { returns(::RBI::Type) }
+ def type; end
+end
+
+# The singleton class of another type like `T.class_of(Foo)`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:314
+class RBI::Type::ClassOf < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:322
+ sig { params(type: ::RBI::Type::Simple, type_parameter: T.nilable(::RBI::Type)).void }
+ def initialize(type, type_parameter = T.unsafe(nil)); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:330
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:346
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:352
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:336
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:316
+ sig { returns(::RBI::Type::Simple) }
+ def type; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:319
+ sig { returns(T.nilable(::RBI::Type)) }
+ def type_parameter; end
+end
+
+# A type that is composed of multiple types like `T.all(String, Integer)`.
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/type.rb:402
+class RBI::Type::Composite < ::RBI::Type
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/type.rb:407
+ sig { params(types: T::Array[::RBI::Type]).void }
+ def initialize(types); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:414
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:404
+ sig { returns(T::Array[::RBI::Type]) }
+ def types; end
+end
+
+# pkg:gem/rbi#lib/rbi/type_parser.rb:6
+class RBI::Type::Error < ::RBI::Error; end
+
+# A generic type like `T::Array[String]` or `T::Hash[Symbol, Integer]`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:547
+class RBI::Type::Generic < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:555
+ sig { params(name: ::String, params: ::RBI::Type).void }
+ def initialize(name, *params); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:563
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:549
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:575
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:552
+ sig { returns(T::Array[::RBI::Type]) }
+ def params; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:581
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:569
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# The module of another type like `T::Module[Foo]`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:278
+class RBI::Type::Module < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:283
+ sig { params(type: ::RBI::Type).void }
+ def initialize(type); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:290
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:302
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:308
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:296
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:280
+ sig { returns(::RBI::Type) }
+ def type; end
+end
+
+# A type that can be `nil` like `T.nilable(String)`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:358
+class RBI::Type::Nilable < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:363
+ sig { params(type: ::RBI::Type).void }
+ def initialize(type); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:370
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:382
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:388
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:376
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:360
+ sig { returns(::RBI::Type) }
+ def type; end
+end
+
+# `T.noreturn`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:132
+class RBI::Type::NoReturn < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:135
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:147
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:153
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:141
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# A proc type like `T.proc.void`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:743
+class RBI::Type::Proc < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:754
+ sig { void }
+ def initialize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:763
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:791
+ sig { params(type: T.untyped).returns(T.self_type) }
+ def bind(type); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:823
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:773
+ sig { params(params: ::RBI::Type).returns(T.self_type) }
+ def params(**params); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:751
+ sig { returns(T.nilable(::RBI::Type)) }
+ def proc_bind; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:745
+ sig { returns(T::Hash[::Symbol, ::RBI::Type]) }
+ def proc_params; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:748
+ sig { returns(::RBI::Type) }
+ def proc_returns; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:779
+ sig { params(type: T.untyped).returns(T.self_type) }
+ def returns(type); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:829
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:798
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:785
+ sig { returns(T.self_type) }
+ def void; end
+end
+
+# `T.self_type`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:159
+class RBI::Type::SelfType < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:162
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:174
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:180
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:168
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# A shape type like `{name: String, age: Integer}`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:701
+class RBI::Type::Shape < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:706
+ sig { params(types: T::Hash[T.any(::String, ::Symbol), ::RBI::Type]).void }
+ def initialize(types); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:713
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:729
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:735
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:719
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:703
+ sig { returns(T::Hash[T.any(::String, ::Symbol), ::RBI::Type]) }
+ def types; end
+end
+
+# A type that represents a simple class name like `String` or `Foo`.
+#
+# It can also be a qualified name like `::Foo` or `Foo::Bar`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:13
+class RBI::Type::Simple < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:18
+ sig { params(name: ::String).void }
+ def initialize(name); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:25
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:15
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:37
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:43
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:31
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# A tuple type like `[String, Integer]`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:665
+class RBI::Type::Tuple < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:670
+ sig { params(types: T::Array[::RBI::Type]).void }
+ def initialize(types); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:677
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:689
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:695
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:683
+ sig { override.returns(::String) }
+ def to_rbi; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:667
+ sig { returns(T::Array[::RBI::Type]) }
+ def types; end
+end
+
+# A type alias that references another type by name like `MyTypeAlias`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:623
+class RBI::Type::TypeAlias < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:631
+ sig { params(name: ::String, aliased_type: ::RBI::Type).void }
+ def initialize(name, aliased_type); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:639
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:628
+ sig { returns(::RBI::Type) }
+ def aliased_type; end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:625
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:651
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:657
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:645
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# A type parameter like `T.type_parameter(:U)`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:587
+class RBI::Type::TypeParameter < ::RBI::Type
+ # pkg:gem/rbi#lib/rbi/type.rb:592
+ sig { params(name: ::Symbol).void }
+ def initialize(name); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:599
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/type.rb:589
+ sig { returns(::Symbol) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:611
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:617
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:605
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# `T.untyped`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:186
+class RBI::Type::Untyped < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:189
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:201
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:207
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:195
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# pkg:gem/rbi#lib/rbi/type_visitor.rb:6
+class RBI::Type::Visitor
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:10
+ sig { params(node: ::RBI::Type).void }
+ def visit(node); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:58
+ sig { params(type: ::RBI::Type::All).void }
+ def visit_all(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:61
+ sig { params(type: ::RBI::Type::Any).void }
+ def visit_any(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:64
+ sig { params(type: ::RBI::Type::Anything).void }
+ def visit_anything(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:67
+ sig { params(type: ::RBI::Type::AttachedClass).void }
+ def visit_attached_class(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:70
+ sig { params(type: ::RBI::Type::Boolean).void }
+ def visit_boolean(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:73
+ sig { params(type: ::RBI::Type::Class).void }
+ def visit_class(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:76
+ sig { params(type: ::RBI::Type::ClassOf).void }
+ def visit_class_of(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:79
+ sig { params(type: ::RBI::Type::Generic).void }
+ def visit_generic(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:82
+ sig { params(type: ::RBI::Type::Nilable).void }
+ def visit_nilable(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:88
+ sig { params(type: ::RBI::Type::NoReturn).void }
+ def visit_no_return(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:91
+ sig { params(type: ::RBI::Type::Proc).void }
+ def visit_proc(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:94
+ sig { params(type: ::RBI::Type::SelfType).void }
+ def visit_self_type(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:100
+ sig { params(type: ::RBI::Type::Shape).void }
+ def visit_shape(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:85
+ sig { params(type: ::RBI::Type::Simple).void }
+ def visit_simple(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:103
+ sig { params(type: ::RBI::Type::Tuple).void }
+ def visit_tuple(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:112
+ sig { params(type: ::RBI::Type::TypeAlias).void }
+ def visit_type_alias(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:106
+ sig { params(type: ::RBI::Type::TypeParameter).void }
+ def visit_type_parameter(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:109
+ sig { params(type: ::RBI::Type::Untyped).void }
+ def visit_untyped(type); end
+
+ # pkg:gem/rbi#lib/rbi/type_visitor.rb:97
+ sig { params(type: ::RBI::Type::Void).void }
+ def visit_void(type); end
+end
+
+# pkg:gem/rbi#lib/rbi/type_visitor.rb:7
+class RBI::Type::Visitor::Error < ::RBI::Error; end
+
+# `void`.
+#
+# pkg:gem/rbi#lib/rbi/type.rb:213
+class RBI::Type::Void < ::RBI::Type
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:216
+ sig { override.params(other: ::BasicObject).returns(T::Boolean) }
+ def ==(other); end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:228
+ sig { override.returns(::RBI::Type) }
+ def normalize; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:234
+ sig { override.returns(::RBI::Type) }
+ def simplify; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/type.rb:222
+ sig { override.returns(::String) }
+ def to_rbi; end
+end
+
+# pkg:gem/rbi#lib/rbi/model.rb:1327
+class RBI::TypeMember < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1332
+ sig do
+ params(
+ name: ::String,
+ value: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: T.nilable(T::Array[::RBI::Comment]),
+ block: T.nilable(T.proc.params(node: ::RBI::TypeMember).void)
+ ).void
+ end
+ def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1340
+ sig { returns(::String) }
+ def fully_qualified_name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/index.rb:174
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1329
+ sig { returns(::String) }
+ def name; end
+
+ # @override
+ #
+ # pkg:gem/rbi#lib/rbi/model.rb:1348
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:1329
+ def value; end
+end
+
+# pkg:gem/rbi#lib/rbi/rbs_printer.rb:984
+class RBI::TypePrinter
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:989
+ sig { params(max_line_length: T.nilable(::Integer)).void }
+ def initialize(max_line_length: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:986
+ sig { returns(::String) }
+ def string; end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:995
+ sig { params(node: ::RBI::Type).void }
+ def visit(node); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1117
+ sig { params(type: ::RBI::Type::All).void }
+ def visit_all(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1127
+ sig { params(type: ::RBI::Type::Any).void }
+ def visit_any(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1062
+ sig { params(type: ::RBI::Type::Anything).void }
+ def visit_anything(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1087
+ sig { params(type: ::RBI::Type::AttachedClass).void }
+ def visit_attached_class(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1046
+ sig { params(type: ::RBI::Type::Boolean).void }
+ def visit_boolean(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1194
+ sig { params(type: ::RBI::Type::Class).void }
+ def visit_class(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1105
+ sig { params(type: ::RBI::Type::ClassOf).void }
+ def visit_class_of(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1051
+ sig { params(type: ::RBI::Type::Generic).void }
+ def visit_generic(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1201
+ sig { params(type: ::RBI::Type::Module).void }
+ def visit_module(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1092
+ sig { params(type: ::RBI::Type::Nilable).void }
+ def visit_nilable(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1072
+ sig { params(type: ::RBI::Type::NoReturn).void }
+ def visit_no_return(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1167
+ sig { params(type: ::RBI::Type::Proc).void }
+ def visit_proc(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1082
+ sig { params(type: ::RBI::Type::SelfType).void }
+ def visit_self_type(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1147
+ sig { params(type: ::RBI::Type::Shape).void }
+ def visit_shape(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1041
+ sig { params(type: ::RBI::Type::Simple).void }
+ def visit_simple(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1137
+ sig { params(type: ::RBI::Type::Tuple).void }
+ def visit_tuple(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1189
+ sig { params(type: ::RBI::Type::TypeParameter).void }
+ def visit_type_parameter(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1077
+ sig { params(type: ::RBI::Type::Untyped).void }
+ def visit_untyped(type); end
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1067
+ sig { params(type: ::RBI::Type::Void).void }
+ def visit_void(type); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/rbs_printer.rb:1210
+ sig { params(type_name: ::String).returns(::String) }
+ def translate_t_type(type_name); end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:5
+class RBI::UnexpectedMultipleSigsError < ::RBI::Error
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:10
+ sig { params(node: ::RBI::Node).void }
+ def initialize(node); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/attr_to_methods.rb:7
+ sig { returns(::RBI::Node) }
+ def node; end
+end
+
+# pkg:gem/rbi#lib/rbi/parser.rb:18
+class RBI::UnexpectedParserError < ::RBI::Error
+ # pkg:gem/rbi#lib/rbi/parser.rb:23
+ sig { params(parent_exception: ::Exception, last_location: ::RBI::Loc).void }
+ def initialize(parent_exception, last_location); end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:20
+ sig { returns(::RBI::Loc) }
+ def last_location; end
+
+ # pkg:gem/rbi#lib/rbi/parser.rb:30
+ sig { params(io: T.any(::IO, ::StringIO)).void }
+ def print_debug(io: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbi#lib/rbi/version.rb:5
+RBI::VERSION = T.let(T.unsafe(nil), String)
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/model.rb:885
+class RBI::Visibility < ::RBI::NodeWithComments
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/model.rb:890
+ sig { params(visibility: ::Symbol, loc: T.nilable(::RBI::Loc), comments: T.nilable(T::Array[::RBI::Comment])).void }
+ def initialize(visibility, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:896
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:913
+ sig { returns(T::Boolean) }
+ def private?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:908
+ sig { returns(T::Boolean) }
+ def protected?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:903
+ sig { returns(T::Boolean) }
+ def public?; end
+
+ # pkg:gem/rbi#lib/rbi/model.rb:887
+ sig { returns(::Symbol) }
+ def visibility; end
+end
+
+# pkg:gem/rbi#lib/rbi/rewriters/nest_non_public_members.rb:58
+class RBI::VisibilityGroup < ::RBI::Tree
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_non_public_members.rb:63
+ sig { params(visibility: ::RBI::Visibility).void }
+ def initialize(visibility); end
+
+ # pkg:gem/rbi#lib/rbi/rewriters/nest_non_public_members.rb:60
+ sig { returns(::RBI::Visibility) }
+ def visibility; end
+end
+
+# @abstract
+#
+# pkg:gem/rbi#lib/rbi/visitor.rb:8
+class RBI::Visitor
+ abstract!
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:10
+ sig { params(node: T.nilable(::RBI::Node)).void }
+ def visit(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:108
+ sig { params(nodes: T::Array[::RBI::Node]).void }
+ def visit_all(nodes); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:113
+ sig { params(file: ::RBI::File).void }
+ def visit_file(file); end
+
+ private
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:198
+ sig { params(node: ::RBI::Arg).void }
+ def visit_arg(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:147
+ sig { params(node: ::RBI::AttrAccessor).void }
+ def visit_attr_accessor(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:150
+ sig { params(node: ::RBI::AttrReader).void }
+ def visit_attr_reader(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:153
+ sig { params(node: ::RBI::AttrWriter).void }
+ def visit_attr_writer(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:126
+ sig { params(node: ::RBI::BlankLine).void }
+ def visit_blank_line(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:177
+ sig { params(node: ::RBI::BlockParam).void }
+ def visit_block_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:132
+ sig { params(node: ::RBI::Class).void }
+ def visit_class(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:120
+ sig { params(node: ::RBI::Comment).void }
+ def visit_comment(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:246
+ sig { params(node: ::RBI::ConflictTree).void }
+ def visit_conflict_tree(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:144
+ sig { params(node: ::RBI::Const).void }
+ def visit_const(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:183
+ sig { params(node: ::RBI::Extend).void }
+ def visit_extend(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:240
+ sig { params(node: ::RBI::Group).void }
+ def visit_group(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:228
+ sig { params(node: ::RBI::Helper).void }
+ def visit_helper(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:180
+ sig { params(node: ::RBI::Include).void }
+ def visit_include(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:201
+ sig { params(node: ::RBI::KwArg).void }
+ def visit_kw_arg(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:171
+ sig { params(node: ::RBI::KwOptParam).void }
+ def visit_kw_opt_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:168
+ sig { params(node: ::RBI::KwParam).void }
+ def visit_kw_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:174
+ sig { params(node: ::RBI::KwRestParam).void }
+ def visit_kw_rest_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:156
+ sig { params(node: ::RBI::Method).void }
+ def visit_method(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:234
+ sig { params(node: ::RBI::MixesInClassMethods).void }
+ def visit_mixes_in_class_methods(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:129
+ sig { params(node: ::RBI::Module).void }
+ def visit_module(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:162
+ sig { params(node: ::RBI::OptParam).void }
+ def visit_opt_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:192
+ sig { params(node: ::RBI::Private).void }
+ def visit_private(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:189
+ sig { params(node: ::RBI::Protected).void }
+ def visit_protected(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:186
+ sig { params(node: ::RBI::Public).void }
+ def visit_public(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:123
+ sig { params(node: ::RBI::RBSComment).void }
+ def visit_rbs_comment(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:159
+ sig { params(node: ::RBI::ReqParam).void }
+ def visit_req_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:237
+ sig { params(node: ::RBI::RequiresAncestor).void }
+ def visit_requires_ancestor(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:165
+ sig { params(node: ::RBI::RestParam).void }
+ def visit_rest_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:249
+ sig { params(node: ::RBI::ScopeConflict).void }
+ def visit_scope_conflict(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:195
+ sig { params(node: ::RBI::Send).void }
+ def visit_send(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:204
+ sig { params(node: ::RBI::Sig).void }
+ def visit_sig(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:207
+ sig { params(node: ::RBI::SigParam).void }
+ def visit_sig_param(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:135
+ sig { params(node: ::RBI::SingletonClass).void }
+ def visit_singleton_class(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:138
+ sig { params(node: ::RBI::Struct).void }
+ def visit_struct(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:219
+ sig { params(node: ::RBI::TEnum).void }
+ def visit_tenum(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:222
+ sig { params(node: ::RBI::TEnumBlock).void }
+ def visit_tenum_block(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:225
+ sig { params(node: ::RBI::TEnumValue).void }
+ def visit_tenum_value(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:141
+ sig { params(node: ::RBI::Tree).void }
+ def visit_tree(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:210
+ sig { params(node: ::RBI::TStruct).void }
+ def visit_tstruct(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:213
+ sig { params(node: ::RBI::TStructConst).void }
+ def visit_tstruct_const(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:216
+ sig { params(node: ::RBI::TStructProp).void }
+ def visit_tstruct_prop(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:231
+ sig { params(node: ::RBI::TypeMember).void }
+ def visit_type_member(node); end
+
+ # pkg:gem/rbi#lib/rbi/visitor.rb:243
+ sig { params(node: ::RBI::VisibilityGroup).void }
+ def visit_visibility_group(node); end
+end
+
+# pkg:gem/rbi#lib/rbi/visitor.rb:5
+class RBI::VisitorError < ::RBI::Error; end
diff --git a/sorbet/rbi/gems/rbs@4.0.3.rbi b/sorbet/rbi/gems/rbs@4.0.3.rbi
new file mode 100644
index 0000000..fd7971e
--- /dev/null
+++ b/sorbet/rbi/gems/rbs@4.0.3.rbi
@@ -0,0 +1,6908 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rbs` gem.
+# Please instead update this file by running `bin/tapioca gem rbs`.
+
+
+# pkg:gem/rbs#lib/rbs/version.rb:3
+module RBS
+ class << self
+ # pkg:gem/rbs#lib/rbs.rb:80
+ def logger; end
+
+ # pkg:gem/rbs#lib/rbs.rb:77
+ def logger_level; end
+
+ # pkg:gem/rbs#lib/rbs.rb:89
+ def logger_level=(level); end
+
+ # pkg:gem/rbs#lib/rbs.rb:78
+ def logger_output; end
+
+ # pkg:gem/rbs#lib/rbs.rb:84
+ def logger_output=(val); end
+
+ # pkg:gem/rbs#lib/rbs.rb:94
+ def print_warning; end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/type_param.rb:4
+module RBS::AST; end
+
+# pkg:gem/rbs#lib/rbs/ast/annotation.rb:5
+class RBS::AST::Annotation
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:9
+ def initialize(string:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:14
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:18
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:20
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:7
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:6
+ def string; end
+
+ # pkg:gem/rbs#lib/rbs/ast/annotation.rb:24
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/comment.rb:5
+class RBS::AST::Comment
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:9
+ def initialize(string:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:14
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:18
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:20
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:7
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:6
+ def string; end
+
+ # pkg:gem/rbs#lib/rbs/ast/comment.rb:24
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:5
+module RBS::AST::Declarations; end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:423
+class RBS::AST::Declarations::AliasDecl < ::RBS::AST::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:426
+ def initialize(new_name:, old_name:, location:, comment:, annotations: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:434
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:424
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:424
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:440
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:442
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:424
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:424
+ def new_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:424
+ def old_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:6
+class RBS::AST::Declarations::Base; end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:55
+class RBS::AST::Declarations::Class < ::RBS::AST::Declarations::Base
+ include ::RBS::AST::Declarations::NestedDeclarationHelper
+ include ::RBS::AST::Declarations::MixinHelper
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:97
+ def initialize(name:, type_params:, super_class:, members:, annotations:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:119
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:93
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:95
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:127
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:129
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:94
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:91
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:89
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:92
+ def super_class; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:133
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:90
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:107
+ def update(name: T.unsafe(nil), type_params: T.unsafe(nil), super_class: T.unsafe(nil), members: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:56
+class RBS::AST::Declarations::Class::Super
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:61
+ def initialize(name:, args:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:67
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:58
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:71
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:73
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:59
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:57
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:77
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:447
+class RBS::AST::Declarations::ClassAlias < ::RBS::AST::Declarations::AliasDecl
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:448
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:347
+class RBS::AST::Declarations::Constant < ::RBS::AST::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:354
+ def initialize(name:, type:, location:, comment:, annotations: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:362
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:352
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:351
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:368
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:370
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:350
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:348
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:374
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:349
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:385
+class RBS::AST::Declarations::Global < ::RBS::AST::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:392
+ def initialize(name:, type:, location:, comment:, annotations: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:400
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:390
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:389
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:406
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:408
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:388
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:386
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:412
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:387
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:248
+class RBS::AST::Declarations::Interface < ::RBS::AST::Declarations::Base
+ include ::RBS::AST::Declarations::MixinHelper
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:258
+ def initialize(name:, type_params:, members:, annotations:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:278
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:252
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:254
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:285
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:287
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:253
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:251
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:249
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:291
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:250
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:267
+ def update(name: T.unsafe(nil), type_params: T.unsafe(nil), members: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:35
+module RBS::AST::Declarations::MixinHelper
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:36
+ def each_mixin(&block); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:147
+class RBS::AST::Declarations::Module < ::RBS::AST::Declarations::Base
+ include ::RBS::AST::Declarations::NestedDeclarationHelper
+ include ::RBS::AST::Declarations::MixinHelper
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:197
+ def initialize(name:, type_params:, members:, self_types:, annotations:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:220
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:193
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:195
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:228
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:230
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:192
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:191
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:189
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:194
+ def self_types; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:234
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:190
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:207
+ def update(name: T.unsafe(nil), type_params: T.unsafe(nil), members: T.unsafe(nil), self_types: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:148
+class RBS::AST::Declarations::Module::Self
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:153
+ def initialize(name:, args:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:159
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:150
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:163
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:165
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:151
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:149
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:169
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:177
+ def to_s; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:459
+class RBS::AST::Declarations::ModuleAlias < ::RBS::AST::Declarations::AliasDecl
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:460
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:9
+module RBS::AST::Declarations::NestedDeclarationHelper
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:22
+ def each_decl; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:10
+ def each_member; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/declarations.rb:304
+class RBS::AST::Declarations::TypeAlias < ::RBS::AST::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:312
+ def initialize(name:, type_params:, type:, annotations:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:321
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:308
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:310
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:328
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:330
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:309
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:305
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:334
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:307
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/declarations.rb:306
+ def type_params; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/directives.rb:5
+module RBS::AST::Directives; end
+
+# pkg:gem/rbs#lib/rbs/ast/directives.rb:6
+class RBS::AST::Directives::Base; end
+
+# pkg:gem/rbs#lib/rbs/ast/directives.rb:37
+class RBS::AST::Directives::ResolveTypeNames < ::RBS::AST::Directives::Base
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:42
+ def initialize(value:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:38
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:40
+ def value; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/directives.rb:9
+class RBS::AST::Directives::Use < ::RBS::AST::Directives::Base
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:31
+ def initialize(clauses:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:29
+ def clauses; end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:29
+ def location; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/directives.rb:10
+class RBS::AST::Directives::Use::SingleClause
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:13
+ def initialize(type_name:, new_name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:11
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:11
+ def new_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:11
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/directives.rb:20
+class RBS::AST::Directives::Use::WildcardClause
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:23
+ def initialize(namespace:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:21
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/directives.rb:21
+ def namespace; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:5
+module RBS::AST::Members; end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:399
+class RBS::AST::Members::Alias < ::RBS::AST::Members::Base
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:407
+ def initialize(new_name:, old_name:, kind:, annotations:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:416
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:403
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:405
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:423
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:425
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:441
+ def instance?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:402
+ def kind; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:404
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:400
+ def new_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:401
+ def old_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:445
+ def singleton?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:429
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:329
+class RBS::AST::Members::AttrAccessor < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Attribute
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:332
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:311
+class RBS::AST::Members::AttrReader < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Attribute
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:314
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:347
+class RBS::AST::Members::AttrWriter < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Attribute
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:350
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:260
+module RBS::AST::Members::Attribute
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:270
+ def initialize(name:, type:, ivar_name:, kind:, annotations:, location:, comment:, visibility: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:281
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:265
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:267
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:290
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:292
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:264
+ def ivar_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:263
+ def kind; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:266
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:261
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:262
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:296
+ def update(name: T.unsafe(nil), type: T.unsafe(nil), ivar_name: T.unsafe(nil), kind: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil), visibility: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:268
+ def visibility; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:6
+class RBS::AST::Members::Base; end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:159
+class RBS::AST::Members::ClassInstanceVariable < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Var
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:162
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:173
+class RBS::AST::Members::ClassVariable < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Var
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:176
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:230
+class RBS::AST::Members::Extend < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Mixin
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:233
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:215
+class RBS::AST::Members::Include < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Mixin
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:218
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:145
+class RBS::AST::Members::InstanceVariable < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Var
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:148
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:365
+module RBS::AST::Members::LocationOnly
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:368
+ def initialize(location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:372
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:376
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:378
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:366
+ def location; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:9
+class RBS::AST::Members::MethodDefinition < ::RBS::AST::Members::Base
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:55
+ def initialize(name:, kind:, overloads:, annotations:, location:, comment:, overloading:, visibility:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:66
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:49
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:51
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:75
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:77
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:81
+ def instance?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:47
+ def kind; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:50
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:46
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:52
+ def overloading; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:89
+ def overloading?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:48
+ def overloads; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:85
+ def singleton?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:106
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:93
+ def update(name: T.unsafe(nil), kind: T.unsafe(nil), overloads: T.unsafe(nil), annotations: T.unsafe(nil), location: T.unsafe(nil), comment: T.unsafe(nil), overloading: T.unsafe(nil), visibility: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:53
+ def visibility; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:10
+class RBS::AST::Members::MethodDefinition::Overload
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:13
+ def initialize(method_type:, annotations:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:18
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:11
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:26
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:22
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:11
+ def method_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:32
+ def sub(subst); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:38
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:28
+ def update(annotations: T.unsafe(nil), method_type: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:187
+module RBS::AST::Members::Mixin
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:194
+ def initialize(name:, args:, annotations:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:202
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:190
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:189
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:192
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:206
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:210
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:191
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:188
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:245
+class RBS::AST::Members::Prepend < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::Mixin
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:248
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:391
+class RBS::AST::Members::Private < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::LocationOnly
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:394
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:383
+class RBS::AST::Members::Public < ::RBS::AST::Members::Base
+ include ::RBS::AST::Members::LocationOnly
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:386
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/members.rb:121
+module RBS::AST::Members::Var
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:127
+ def initialize(name:, type:, location:, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:134
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:125
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:138
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:140
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:124
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:122
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/members.rb:123
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:5
+module RBS::AST::Ruby; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:6
+module RBS::AST::Ruby::Annotations; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:43
+class RBS::AST::Ruby::Annotations::AliasAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:46
+ def initialize(location:, prefix_location:, keyword_location:, type_name:, type_name_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:44
+ def keyword_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:53
+ def map_type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:44
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:44
+ def type_name_location; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:7
+class RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:10
+ def initialize(location, prefix_location); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:15
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:8
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:8
+ def prefix_location; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:356
+class RBS::AST::Ruby::Annotations::BlockParamTypeAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:359
+ def initialize(location:, prefix_location:, ampersand_location:, name_location:, colon_location:, question_location:, type_location:, type:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def ampersand_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def colon_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:370
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:384
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:388
+ def optional?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def question_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:392
+ def required?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:396
+ def type_fingerprint; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:357
+ def type_location; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:64
+class RBS::AST::Ruby::Annotations::ClassAliasAnnotation < ::RBS::AST::Ruby::Annotations::AliasAnnotation
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:65
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:82
+class RBS::AST::Ruby::Annotations::ColonMethodTypeAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:85
+ def initialize(location:, prefix_location:, annotations:, method_type:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:83
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:91
+ def map_type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:83
+ def method_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:100
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:322
+class RBS::AST::Ruby::Annotations::DoubleSplatParamTypeAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:325
+ def initialize(location:, prefix_location:, star2_location:, name_location:, colon_location:, param_type:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:323
+ def colon_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:323
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:334
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:323
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:323
+ def param_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:323
+ def star2_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:346
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:222
+class RBS::AST::Ruby::Annotations::InstanceVariableAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:225
+ def initialize(location:, prefix_location:, ivar_name:, ivar_name_location:, colon_location:, type:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:223
+ def colon_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:223
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:223
+ def ivar_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:223
+ def ivar_name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:234
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:223
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:246
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:109
+class RBS::AST::Ruby::Annotations::MethodTypesAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:114
+ def initialize(location:, prefix_location:, overloads:, vertical_bar_locations:, dot3_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:112
+ def dot3_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:121
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:112
+ def overloads; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:132
+ def type_fingerprint; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:112
+ def vertical_bar_locations; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:110
+RBS::AST::Ruby::Annotations::MethodTypesAnnotation::Overload = RBS::AST::Members::MethodDefinition::Overload
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:73
+class RBS::AST::Ruby::Annotations::ModuleAliasAnnotation < ::RBS::AST::Ruby::Annotations::AliasAnnotation
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:74
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:20
+class RBS::AST::Ruby::Annotations::NodeTypeAssertion < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:23
+ def initialize(location:, prefix_location:, type:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:28
+ def map_type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:21
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:35
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:256
+class RBS::AST::Ruby::Annotations::ParamTypeAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:259
+ def initialize(location:, prefix_location:, name_location:, colon_location:, param_type:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:257
+ def colon_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:257
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:267
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:257
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:257
+ def param_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:278
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:155
+class RBS::AST::Ruby::Annotations::ReturnTypeAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:164
+ def initialize(location:, prefix_location:, return_location:, colon_location:, return_type:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:158
+ def colon_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:162
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:172
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:156
+ def return_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:160
+ def return_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:183
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:141
+class RBS::AST::Ruby::Annotations::SkipAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:144
+ def initialize(location:, prefix_location:, skip_location:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:142
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:142
+ def skip_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:150
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:288
+class RBS::AST::Ruby::Annotations::SplatParamTypeAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:291
+ def initialize(location:, prefix_location:, star_location:, name_location:, colon_location:, param_type:, comment_location:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:289
+ def colon_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:289
+ def comment_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:300
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:289
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:289
+ def param_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:289
+ def star_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:312
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:192
+class RBS::AST::Ruby::Annotations::TypeApplicationAnnotation < ::RBS::AST::Ruby::Annotations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:195
+ def initialize(location:, prefix_location:, type_args:, close_bracket_location:, comma_locations:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:193
+ def close_bracket_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:193
+ def comma_locations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:202
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:193
+ def type_args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/annotations.rb:214
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:6
+class RBS::AST::Ruby::CommentBlock
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:9
+ def initialize(source_buffer, comments); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:226
+ def as_comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:7
+ def comment_buffer; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:211
+ def comments; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:98
+ def each_paragraph(variables, &block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:50
+ def end_line; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:36
+ def leading?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:215
+ def leading_annotation?(index); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:174
+ def line_location(start_line, end_line); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:54
+ def line_starts; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:180
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:7
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:7
+ def offsets; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:187
+ def parse_annotation_lines(start_line, end_line, variables); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:46
+ def start_line; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:169
+ def text(comment_index); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:41
+ def trailing?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:197
+ def trailing_annotation(variables); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:130
+ def yield_annotation(start_line, end_line, current_line, variables, &block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:110
+ def yield_paragraph(start_line, current_line, variables, &block); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:60
+ def build(buffer, comments); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+class RBS::AST::Ruby::CommentBlock::AnnotationSyntaxError < ::Struct
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def error; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def error=(_); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def location=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/comment_block.rb:96
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:6
+module RBS::AST::Ruby::Declarations; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:7
+class RBS::AST::Ruby::Declarations::Base
+ include ::RBS::AST::Ruby::Helpers::ConstantHelper
+ include ::RBS::AST::Ruby::Helpers::LocationHelper
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:13
+ def initialize(buffer); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:8
+ def buffer; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:18
+class RBS::AST::Ruby::Declarations::ClassDecl < ::RBS::AST::Ruby::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:74
+ def initialize(buffer, name, node, super_class); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:66
+ def class_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:82
+ def each_decl(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:94
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:68
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:98
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:70
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:72
+ def super_class; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:102
+ def type_fingerprint; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:92
+ def type_params; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:19
+class RBS::AST::Ruby::Declarations::ClassDecl::SuperClass
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:28
+ def initialize(type_name_location, operator_location, type_name, type_annotation); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:56
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:43
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:55
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:22
+ def operator_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:26
+ def type_annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:35
+ def type_args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:58
+ def type_fingerprint; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:24
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:20
+ def type_name_location; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:223
+class RBS::AST::Ruby::Declarations::ClassModuleAliasDecl < ::RBS::AST::Ruby::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:230
+ def initialize(buffer, node, new_name, infered_old_name, leading_comment, annotation); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:228
+ def annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:264
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:227
+ def infered_old_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:225
+ def leading_comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:239
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:243
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:226
+ def new_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:224
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:252
+ def old_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:268
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:161
+class RBS::AST::Ruby::Declarations::ConstantDecl < ::RBS::AST::Ruby::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:167
+ def initialize(buffer, constant_name, node, leading_comment, type_annotation); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:209
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:163
+ def constant_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:162
+ def leading_comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:175
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:179
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:164
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:188
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:165
+ def type_annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:213
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:114
+class RBS::AST::Ruby::Declarations::ModuleDecl < ::RBS::AST::Ruby::Declarations::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:121
+ def initialize(buffer, name, node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:128
+ def each_decl(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:142
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:117
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:115
+ def module_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:146
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:119
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:140
+ def self_types; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:150
+ def type_fingerprint; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/declarations.rb:138
+ def type_params; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/helpers/constant_helper.rb:6
+module RBS::AST::Ruby::Helpers; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/helpers/constant_helper.rb:7
+module RBS::AST::Ruby::Helpers::ConstantHelper
+ private
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/helpers/constant_helper.rb:10
+ def constant_as_type_name(node); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ast/ruby/helpers/constant_helper.rb:10
+ def constant_as_type_name(node); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/helpers/location_helper.rb:7
+module RBS::AST::Ruby::Helpers::LocationHelper
+ # pkg:gem/rbs#lib/rbs/ast/ruby/helpers/location_helper.rb:8
+ def rbs_location(location); end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:6
+module RBS::AST::Ruby::Members; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:690
+class RBS::AST::Ruby::Members::AttrAccessorMember < ::RBS::AST::Ruby::Members::AttributeMember; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:684
+class RBS::AST::Ruby::Members::AttrReaderMember < ::RBS::AST::Ruby::Members::AttributeMember; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:687
+class RBS::AST::Ruby::Members::AttrWriterMember < ::RBS::AST::Ruby::Members::AttributeMember; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:639
+class RBS::AST::Ruby::Members::AttributeMember < ::RBS::AST::Ruby::Members::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:645
+ def initialize(buffer, node, name_nodes, leading_comment, type_annotation); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:643
+ def leading_comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:659
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:663
+ def name_locations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:641
+ def name_nodes; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:653
+ def names; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:640
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:669
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:642
+ def type_annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:673
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:7
+class RBS::AST::Ruby::Members::Base
+ include ::RBS::AST::Ruby::Helpers::LocationHelper
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:10
+ def initialize(buffer); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:8
+ def buffer; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:547
+class RBS::AST::Ruby::Members::DefMember < ::RBS::AST::Ruby::Members::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:555
+ def initialize(buffer, name, node, method_type, leading_comment); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:575
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:553
+ def leading_comment; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:563
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:552
+ def method_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:550
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:579
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:551
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:571
+ def overloading?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:567
+ def overloads; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:583
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:548
+RBS::AST::Ruby::Members::DefMember::Overload = RBS::AST::Members::MethodDefinition::Overload
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:633
+class RBS::AST::Ruby::Members::ExtendMember < ::RBS::AST::Ruby::Members::MixinMember; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:630
+class RBS::AST::Ruby::Members::IncludeMember < ::RBS::AST::Ruby::Members::MixinMember; end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:693
+class RBS::AST::Ruby::Members::InstanceVariableMember < ::RBS::AST::Ruby::Members::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:696
+ def initialize(buffer, annotation); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:694
+ def annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:709
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:701
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:705
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:713
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:17
+class RBS::AST::Ruby::Members::MethodTypeAnnotation
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:403
+ def initialize(type_annotations:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:484
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:407
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:524
+ def overloading?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:488
+ def overloads; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:401
+ def type_annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:535
+ def type_fingerprint; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:420
+ def build(leading_block, trailing_block, variables, node); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:18
+class RBS::AST::Ruby::Members::MethodTypeAnnotation::DocStyle
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:29
+ def initialize; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:181
+ def all_param_annotations; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:27
+ def block; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:27
+ def block=(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:196
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:287
+ def method_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:25
+ def optional_keywords; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:21
+ def optional_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:24
+ def required_keywords; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:20
+ def required_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:26
+ def rest_keywords; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:26
+ def rest_keywords=(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:22
+ def rest_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:22
+ def rest_positionals=(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:19
+ def return_type_annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:19
+ def return_type_annotation=(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:23
+ def trailing_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:273
+ def type_fingerprint; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:41
+ def build(param_type_annotations, return_type_annotation, node); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:593
+class RBS::AST::Ruby::Members::MixinMember < ::RBS::AST::Ruby::Members::Base
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:598
+ def initialize(buffer, node, module_name, annotation); end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:596
+ def annotation; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:605
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:595
+ def module_name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:609
+ def name_location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:594
+ def node; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:616
+ def type_args; end
+
+ # pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:620
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/ast/ruby/members.rb:636
+class RBS::AST::Ruby::Members::PrependMember < ::RBS::AST::Ruby::Members::MixinMember; end
+
+# pkg:gem/rbs#lib/rbs/ast/type_param.rb:5
+class RBS::AST::TypeParam
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:8
+ def initialize(name:, variance:, upper_bound:, lower_bound:, location:, default_type: T.unsafe(nil), unchecked: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:41
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:6
+ def default_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:51
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:53
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:6
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:25
+ def lower_bound; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:6
+ def lower_bound_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:69
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:6
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:57
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:133
+ def to_s; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:32
+ def unchecked!(value = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:37
+ def unchecked?; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:18
+ def upper_bound; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:6
+ def upper_bound_type; end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:6
+ def variance; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:166
+ def application(params, args); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:198
+ def normalize_args(params, args); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:114
+ def rename(params, new_names:); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:92
+ def resolve_variables(params); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:102
+ def subst_var(vars, type); end
+
+ # pkg:gem/rbs#lib/rbs/ast/type_param.rb:219
+ def validate(type_params); end
+ end
+end
+
+# The Visitor class implements the Visitor pattern for traversing the RBS Abstract Syntax Tree (AST).
+#
+# It provides methods to visit each type of node in the AST, allowing for custom processing of each node type.
+#
+# This class is designed to be subclassed, with specific visit methods overridden to implement custom behavior for
+# different node types.
+#
+# Example usage:
+#
+# ~~~rb
+# class MyVisitor < RBS::AST::Visitor
+# def visit_declaration_class(node)
+# puts "Visiting class: #{node.name}"
+#
+# super # call `super` to run the default visiting behavior
+# end
+# end
+#
+# visitor = MyVisitor.new
+# visitor.visit(ast_node)
+# ~~~
+#
+# pkg:gem/rbs#lib/rbs/ast/visitor.rb:26
+class RBS::AST::Visitor
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:27
+ def visit(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:70
+ def visit_all(nodes); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:79
+ def visit_declaration_class(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:87
+ def visit_declaration_constant(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:76
+ def visit_declaration_global(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:93
+ def visit_declaration_interface(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:83
+ def visit_declaration_module(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:90
+ def visit_declaration_type_alias(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:97
+ def visit_member_alias(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:124
+ def visit_member_attr_accessor(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:118
+ def visit_member_attr_reader(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:121
+ def visit_member_attr_writer(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:100
+ def visit_member_class_instance_variable(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:103
+ def visit_member_class_variable(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:133
+ def visit_member_extend(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:127
+ def visit_member_include(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:106
+ def visit_member_instance_variable(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:115
+ def visit_member_method_definition(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:130
+ def visit_member_prepend(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:109
+ def visit_member_private(node); end
+
+ # pkg:gem/rbs#lib/rbs/ast/visitor.rb:112
+ def visit_member_public(node); end
+end
+
+# pkg:gem/rbs#lib/rbs/ancestor_graph.rb:4
+class RBS::AncestorGraph
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:13
+ def initialize(env:, ancestor_builder: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:9
+ def ancestor_builder; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:19
+ def build; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:32
+ def build_ancestors(node, ancestors); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:11
+ def children; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:64
+ def each_ancestor(node, yielded: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:56
+ def each_child(node, &block); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:78
+ def each_descendant(node, yielded: T.unsafe(nil), &block); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:48
+ def each_parent(node, &block); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:8
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:10
+ def parents; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:43
+ def register(parent:, child:); end
+end
+
+# pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+class RBS::AncestorGraph::InstanceNode < ::Struct
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def type_name=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:5
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+class RBS::AncestorGraph::SingletonNode < ::Struct
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def type_name=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/ancestor_graph.rb:6
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:19
+class RBS::BaseError < ::StandardError; end
+
+# pkg:gem/rbs#lib/rbs/buffer.rb:4
+class RBS::Buffer
+ # pkg:gem/rbs#lib/rbs/buffer.rb:9
+ def initialize(content:, name: T.unsafe(nil), parent: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:131
+ def absolute_position(position); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:6
+ def content; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:148
+ def detach; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:86
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:78
+ def last_position; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:26
+ def line_count; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:22
+ def lines; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:68
+ def loc_to_pos(loc); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:5
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:7
+ def parent; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:116
+ def parent_buffer; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:122
+ def parent_position(position); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:56
+ def pos_to_loc(pos); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:30
+ def ranges; end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:90
+ def rbs_location(location, loc2 = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:98
+ def sub_buffer(lines:); end
+
+ # pkg:gem/rbs#lib/rbs/buffer.rb:140
+ def top_buffer; end
+end
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:4
+module RBS::BuiltinNames; end
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:45
+RBS::BuiltinNames::Array = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:37
+RBS::BuiltinNames::BasicObject = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:43
+RBS::BuiltinNames::Class = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:41
+RBS::BuiltinNames::Comparable = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:42
+RBS::BuiltinNames::Enumerable = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:48
+RBS::BuiltinNames::Enumerator = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:55
+RBS::BuiltinNames::FalseClass = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:52
+RBS::BuiltinNames::Float = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:46
+RBS::BuiltinNames::Hash = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:51
+RBS::BuiltinNames::Integer = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:39
+RBS::BuiltinNames::Kernel = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:44
+RBS::BuiltinNames::Module = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:5
+class RBS::BuiltinNames::Name
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:8
+ def initialize(name:); end
+
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:16
+ def instance_type(*args); end
+
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:20
+ def instance_type?(type); end
+
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:6
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:24
+ def singleton_type; end
+
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:28
+ def singleton_type?(type); end
+
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:12
+ def to_s; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/builtin_names.rb:32
+ def define(name, namespace: T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:56
+RBS::BuiltinNames::Numeric = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:38
+RBS::BuiltinNames::Object = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:47
+RBS::BuiltinNames::Range = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:53
+RBS::BuiltinNames::Regexp = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:49
+RBS::BuiltinNames::Set = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:40
+RBS::BuiltinNames::String = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:50
+RBS::BuiltinNames::Symbol = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/builtin_names.rb:54
+RBS::BuiltinNames::TrueClass = T.let(T.unsafe(nil), RBS::BuiltinNames::Name)
+
+# pkg:gem/rbs#lib/rbs/cli/colored_io.rb:4
+class RBS::CLI; end
+
+# pkg:gem/rbs#lib/rbs/cli/colored_io.rb:5
+class RBS::CLI::ColoredIO
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:8
+ def initialize(stdout:); end
+
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:28
+ def puts(*_arg0, **_arg1, &_arg2); end
+
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:20
+ def puts_green(string); end
+
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:12
+ def puts_red(string); end
+
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:6
+ def stdout; end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:43
+ def are_colors_disabled?; end
+
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:39
+ def are_colors_supported?; end
+
+ # https://github.com/rubygems/rubygems/blob/ed65279100234a17d65d71fe26de5083984ac5b8/bundler/lib/bundler/vendor/thor/lib/thor/shell/color.rb#L99-L109
+ #
+ # pkg:gem/rbs#lib/rbs/cli/colored_io.rb:35
+ def can_display_colors?; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:345
+class RBS::ClassInstanceVariableDuplicationError < ::RBS::VariableDuplicationError
+ # pkg:gem/rbs#lib/rbs/errors.rb:346
+ def kind; end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/base.rb:4
+module RBS::Collection; end
+
+# pkg:gem/rbs#lib/rbs/collection/cleaner.rb:5
+class RBS::Collection::Cleaner
+ # pkg:gem/rbs#lib/rbs/collection/cleaner.rb:8
+ def initialize(lockfile_path:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/cleaner.rb:12
+ def clean; end
+
+ # pkg:gem/rbs#lib/rbs/collection/cleaner.rb:6
+ def lock; end
+
+ # pkg:gem/rbs#lib/rbs/collection/cleaner.rb:30
+ def needed?(gem_name, version); end
+end
+
+# This class represent the configuration file.
+#
+# pkg:gem/rbs#lib/rbs/collection/config.rb:7
+class RBS::Collection::Config
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:49
+ def initialize(data, config_path:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:19
+ def config_path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:19
+ def data; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:54
+ def gem(gem_name); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:74
+ def gems; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:58
+ def repo_path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:62
+ def repo_path_data; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:66
+ def sources; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:21
+ def find_config_path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:41
+ def from_path(path); end
+
+ # Generate a rbs lockfile from Gemfile.lock to `config_path`.
+ # If `with_lockfile` is true, it respects existing rbs lockfile.
+ #
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:34
+ def generate_lockfile(config_path:, definition:, with_lockfile: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:45
+ def to_lockfile_path(config_path); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/config.rb:8
+class RBS::Collection::Config::CollectionNotAvailable < ::StandardError
+ # pkg:gem/rbs#lib/rbs/collection/config.rb:9
+ def initialize; end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:6
+class RBS::Collection::Config::Lockfile
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:9
+ def initialize(lockfile_path:, path:, gemfile_lock_path:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:73
+ def check_rbs_availability!; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:18
+ def fullpath; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:22
+ def gemfile_lock_fullpath; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:7
+ def gemfile_lock_path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:7
+ def gems; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:65
+ def library_data(lib); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:7
+ def lockfile_dir; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:7
+ def lockfile_path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:7
+ def path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:7
+ def sources; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:28
+ def to_lockfile; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile.rb:42
+ def from_lockfile(lockfile_path:, data:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:6
+class RBS::Collection::Config::LockfileGenerator
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:48
+ def initialize(config:, definition:, with_lockfile:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:40
+ def config; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:40
+ def definition; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:40
+ def existing_lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:40
+ def gem_entries; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:40
+ def gem_hash; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:76
+ def generate; end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:40
+ def lockfile; end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:109
+ def assign_gem(name:, version:, skip: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:175
+ def assign_stdlib(name:, from_gem: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:246
+ def find_best_version(version:, versions:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:240
+ def find_source(name:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:101
+ def validate_gemfile_lock_path!(lock:, gemfile_lock_path:); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:42
+ def generate(config:, definition:, with_lockfile: T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:7
+RBS::Collection::Config::LockfileGenerator::ALUMNI_STDLIBS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:24
+class RBS::Collection::Config::LockfileGenerator::GemfileLockMismatchError < ::StandardError
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:25
+ def initialize(expected:, actual:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/config/lockfile_generator.rb:30
+ def message; end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/config.rb:17
+RBS::Collection::Config::PATH = T.let(T.unsafe(nil), Pathname)
+
+# pkg:gem/rbs#lib/rbs/collection/installer.rb:5
+class RBS::Collection::Installer
+ # pkg:gem/rbs#lib/rbs/collection/installer.rb:9
+ def initialize(lockfile_path:, stdout: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/collection/installer.rb:14
+ def install_from_lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/installer.rb:6
+ def lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/installer.rb:7
+ def stdout; end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/base.rb:5
+module RBS::Collection::Sources
+ class << self
+ # pkg:gem/rbs#lib/rbs/collection/sources.rb:12
+ def from_config_entry(source_entry, base_directory:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/base.rb:6
+module RBS::Collection::Sources::Base
+ # pkg:gem/rbs#lib/rbs/collection/sources/base.rb:7
+ def dependencies_of(name, version); end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/git.rb:11
+class RBS::Collection::Sources::Git
+ include ::RBS::Collection::Sources::Base
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:19
+ def initialize(name:, revision:, remote:, repo_dir:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:27
+ def has?(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:44
+ def install(dest:, name:, version:, stdout:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:224
+ def load_metadata(dir:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:74
+ def manifest_of(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:208
+ def metadata_content(name:, version:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:17
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:17
+ def remote; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:17
+ def repo_dir; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:173
+ def resolved_revision; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:17
+ def revision; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:114
+ def to_lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:37
+ def versions(name); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:216
+ def write_metadata(dir:, name:, version:); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:88
+ def _install(dest:, name:, version:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:184
+ def commit_hash?; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:100
+ def cp_r(src, dest); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:124
+ def format_config_entry(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:169
+ def gem_repo_dir; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:230
+ def gems_versions; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:188
+ def git(*cmd, **opt); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:192
+ def git?(*cmd, **opt); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:159
+ def git_dir; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:153
+ def need_to_fetch?(revision); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:131
+ def setup!; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/git.rb:198
+ def sh!(*cmd, **opt); end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/git.rb:15
+class RBS::Collection::Sources::Git::CommandError < ::StandardError; end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/git.rb:13
+RBS::Collection::Sources::Git::METADATA_FILENAME = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rbs#lib/rbs/collection/sources/local.rb:6
+class RBS::Collection::Sources::Local
+ include ::RBS::Collection::Sources::Base
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:11
+ def initialize(path:, base_directory:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:9
+ def full_path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:17
+ def has?(name, version); end
+
+ # Create a symlink instead of copying file to refer files in @path.
+ # By avoiding copying RBS files, the users do not need re-run `rbs collection install`
+ # when the RBS files are updated.
+ #
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:32
+ def install(dest:, name:, version:, stdout:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:64
+ def manifest_of(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:9
+ def path; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:72
+ def to_lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:25
+ def versions(name); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/local.rb:59
+ def _install(src, dst); end
+end
+
+# Signatures that are included in gem package as sig/ directory.
+#
+# pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:9
+class RBS::Collection::Sources::Rubygems
+ include ::RBS::Collection::Sources::Base
+ include ::Singleton::SingletonInstanceMethods
+ include ::Singleton
+ extend ::Singleton::SingletonClassMethods
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:13
+ def has?(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:23
+ def install(dest:, name:, version:, stdout:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:29
+ def manifest_of(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:36
+ def to_lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:17
+ def versions(name); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:42
+ def gem_sig_path(name, version); end
+
+ class << self
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:11
+ def allocate; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/rubygems.rb:11
+ def new(*_arg0); end
+ end
+end
+
+# signatures that are bundled in rbs gem under the stdlib/ directory
+#
+# pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:9
+class RBS::Collection::Sources::Stdlib
+ include ::RBS::Collection::Sources::Base
+ include ::Singleton::SingletonInstanceMethods
+ include ::Singleton
+ extend ::Singleton::SingletonClassMethods
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:15
+ def has?(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:23
+ def install(dest:, name:, version:, stdout:); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:29
+ def manifest_of(name, version); end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:38
+ def to_lockfile; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:19
+ def versions(name); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:44
+ def lookup(name, version); end
+
+ class << self
+ private
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:11
+ def allocate; end
+
+ # pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:11
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/collection/sources/stdlib.rb:13
+RBS::Collection::Sources::Stdlib::REPO = T.let(T.unsafe(nil), RBS::Repository)
+
+# pkg:gem/rbs#lib/rbs/constant.rb:4
+class RBS::Constant
+ # pkg:gem/rbs#lib/rbs/constant.rb:9
+ def initialize(name:, type:, entry:); end
+
+ # pkg:gem/rbs#lib/rbs/constant.rb:15
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/constant.rb:7
+ def entry; end
+
+ # pkg:gem/rbs#lib/rbs/constant.rb:22
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/constant.rb:24
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/constant.rb:5
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/constant.rb:6
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:598
+class RBS::CyclicClassAliasDefinitionError < ::RBS::BaseError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:603
+ def initialize(entry); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:601
+ def alias_entry; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:609
+ def location; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:559
+class RBS::CyclicTypeParameterBound < ::RBS::BaseError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:564
+ def initialize(type_name:, method_name:, params:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:562
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:562
+ def method_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:562
+ def params; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:562
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:4
+class RBS::Definition
+ # pkg:gem/rbs#lib/rbs/definition.rb:302
+ def initialize(type_name:, entry:, self_type:, ancestors:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:296
+ def ancestors; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:325
+ def class?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:342
+ def class_type?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:300
+ def class_variables; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:389
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:295
+ def entry; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:346
+ def instance_type?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:299
+ def instance_variables; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:333
+ def interface?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:350
+ def interface_type?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:379
+ def map_method_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:298
+ def methods; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:329
+ def module?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:297
+ def self_type; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:367
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:294
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:354
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:358
+ def type_params_decl; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:209
+module RBS::Definition::Ancestor; end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:210
+class RBS::Definition::Ancestor::Instance
+ # pkg:gem/rbs#lib/rbs/definition.rb:213
+ def initialize(name:, args:, source:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:219
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:211
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:223
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:225
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:211
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:211
+ def source; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:230
+class RBS::Definition::Ancestor::Singleton
+ # pkg:gem/rbs#lib/rbs/definition.rb:233
+ def initialize(name:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:237
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:241
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:243
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:231
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:249
+class RBS::Definition::InstanceAncestors
+ # pkg:gem/rbs#lib/rbs/definition.rb:254
+ def initialize(type_name:, params:, ancestors:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:252
+ def ancestors; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:260
+ def apply(args, env:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:251
+ def params; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:250
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:30
+class RBS::Definition::Method
+ # pkg:gem/rbs#lib/rbs/definition.rb:107
+ def initialize(super_method:, defs:, accessibility:, alias_of:, annotations: T.unsafe(nil), alias_member: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:117
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:101
+ def accessibility; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:105
+ def alias_member; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:104
+ def alias_of; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:103
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:151
+ def comments; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:133
+ def defined_in; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:100
+ def defs; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:127
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:102
+ def extra_annotations; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:129
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:140
+ def implemented_in; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:190
+ def map_method_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:176
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:183
+ def map_type_bound(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:155
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:147
+ def method_types; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:163
+ def private?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:159
+ def public?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:167
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:99
+ def super_method; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:196
+ def update(super_method: T.unsafe(nil), defs: T.unsafe(nil), accessibility: T.unsafe(nil), alias_of: T.unsafe(nil), annotations: T.unsafe(nil), alias_member: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:31
+class RBS::Definition::Method::TypeDef
+ # pkg:gem/rbs#lib/rbs/definition.rb:40
+ def initialize(type:, member:, defined_in:, implemented_in:, overload_annotations: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:50
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:38
+ def annotations; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:64
+ def comment; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:34
+ def defined_in; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:89
+ def each_annotation(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:58
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:60
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:35
+ def implemented_in; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:33
+ def member; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:36
+ def member_annotations; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:80
+ def overload?; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:37
+ def overload_annotations; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:32
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:73
+ def update(type: T.unsafe(nil), member: T.unsafe(nil), defined_in: T.unsafe(nil), implemented_in: T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:284
+class RBS::Definition::SingletonAncestors
+ # pkg:gem/rbs#lib/rbs/definition.rb:288
+ def initialize(type_name:, ancestors:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:286
+ def ancestors; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:285
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition.rb:5
+class RBS::Definition::Variable
+ # pkg:gem/rbs#lib/rbs/definition.rb:11
+ def initialize(parent_variable:, type:, declared_in:, source:); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:8
+ def declared_in; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:6
+ def parent_variable; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:9
+ def source; end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:18
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/definition.rb:7
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder.rb:4
+class RBS::DefinitionBuilder
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:14
+ def initialize(env:, ancestor_builder: T.unsafe(nil), method_builder: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:6
+ def ancestor_builder; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:195
+ def build_instance(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:43
+ def build_interface(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:327
+ def build_singleton(type_name); end
+
+ # Builds a definition for singleton without .new method.
+ #
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:257
+ def build_singleton0(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:85
+ def define_instance(definition, type_name, subst, define_class_vars:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:33
+ def define_interface(definition, type_name, subst); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:695
+ def define_method(methods, definition, method, subst, self_type_methods, defined_in:, implemented_in: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:25
+ def ensure_namespace!(namespace, location:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:5
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:983
+ def expand_alias(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:987
+ def expand_alias1(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:994
+ def expand_alias2(type_name, args); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:634
+ def import_methods(definition, module_name, module_methods, interfaces_methods, subst, self_type_methods); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:583
+ def insert_variable(type_name, variables, name:, type:, source:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:9
+ def instance_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:12
+ def interface_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:453
+ def interface_methods(interface_ancestors); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:7
+ def method_builder; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:11
+ def singleton0_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:10
+ def singleton_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:483
+ def source_location(source, decl); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:973
+ def special_accessibility(is_instance, method_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:66
+ def tapp_subst(name, args); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:979
+ def try_cache(type_name, cache:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:1018
+ def update(env:, except:, ancestor_builder:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:473
+ def validate_params_with(type_params, result:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:1047
+ def validate_type_name(name, location); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:501
+ def validate_type_params(definition, ancestors:, methods:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:1036
+ def validate_type_presence(type); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder.rb:594
+ def validate_variable(var); end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:5
+class RBS::DefinitionBuilder::AncestorBuilder
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:162
+ def initialize(env:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:151
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:664
+ def fill_ancestor_source(ancestor, name:, source:, &block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:492
+ def instance_ancestors(type_name, building_ancestors: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:154
+ def instance_ancestors_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:628
+ def interface_ancestors(type_name, building_ancestors: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:160
+ def interface_ancestors_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:474
+ def mixin_ancestors(entry, type_name, included_modules:, included_interfaces:, extended_modules:, prepended_modules:, extended_interfaces:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:350
+ def mixin_ancestors0(decl, type_name, align_params:, included_modules:, included_interfaces:, extended_modules:, prepended_modules:, extended_interfaces:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:192
+ def one_instance_ancestors(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:153
+ def one_instance_ancestors_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:331
+ def one_interface_ancestors(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:159
+ def one_interface_ancestors_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:277
+ def one_singleton_ancestors(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:156
+ def one_singleton_ancestors_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:573
+ def singleton_ancestors(type_name, building_ancestors: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:157
+ def singleton_ancestors_cache; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:175
+ def validate_super_class!(type_name, entry); end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:6
+class RBS::DefinitionBuilder::AncestorBuilder::OneAncestors
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:17
+ def initialize(type_name:, params:, super_class:, self_types:, included_modules:, included_interfaces:, prepended_modules:, extended_modules:, extended_interfaces:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:29
+ def each_ancestor(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:86
+ def each_extended_interface(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:78
+ def each_extended_module(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:62
+ def each_included_interface(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:54
+ def each_included_module(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:70
+ def each_prepended_module(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:46
+ def each_self_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:15
+ def extended_interfaces; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:14
+ def extended_modules; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:12
+ def included_interfaces; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:11
+ def included_modules; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:8
+ def params; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:13
+ def prepended_modules; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:10
+ def self_types; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:9
+ def super_class; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:7
+ def type_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:94
+ def class_instance(type_name:, params:, super_class:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:136
+ def interface(type_name:, params:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:122
+ def module_instance(type_name:, params:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/ancestor_builder.rb:108
+ def singleton(type_name:, super_class:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:5
+class RBS::DefinitionBuilder::MethodBuilder
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:91
+ def initialize(env:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:211
+ def build_alias(methods, type, member:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:216
+ def build_attribute(methods, type, member:, accessibility:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:99
+ def build_instance(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:191
+ def build_interface(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:250
+ def build_method(methods, type, member:, accessibility:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:232
+ def build_ruby_attribute(methods, type, member:, accessibility:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:162
+ def build_singleton(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:261
+ def each_rbs_member_with_accessibility(members, accessibility: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:86
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:87
+ def instance_methods; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:89
+ def interface_methods; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:88
+ def singleton_methods; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:274
+ def update(env:, except:); end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:6
+class RBS::DefinitionBuilder::MethodBuilder::Methods
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:30
+ def initialize(type:); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:49
+ def each; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:28
+ def methods; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:27
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:35
+ def validate!; end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:7
+class RBS::DefinitionBuilder::MethodBuilder::Methods::Definition < ::Struct
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:14
+ def accessibility; end
+
+ # @implements Definition
+ #
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:10
+ def original; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:22
+ def empty(name:, type:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:63
+class RBS::DefinitionBuilder::MethodBuilder::Methods::Sorter
+ include ::TSort
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:68
+ def initialize(methods); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:66
+ def methods; end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:76
+ def tsort_each_child(defn); end
+
+ # pkg:gem/rbs#lib/rbs/definition_builder/method_builder.rb:72
+ def tsort_each_node(&block); end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:21
+class RBS::DefinitionError < ::RBS::BaseError; end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:23
+module RBS::DetailedMessageable
+ # pkg:gem/rbs#lib/rbs/errors.rb:24
+ def detailed_message(highlight: T.unsafe(nil), **_arg1); end
+end
+
+# pkg:gem/rbs#lib/rbs/diff.rb:4
+class RBS::Diff
+ # pkg:gem/rbs#lib/rbs/diff.rb:5
+ def initialize(type_name:, library_options:, after_path: T.unsafe(nil), before_path: T.unsafe(nil), detail: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:13
+ def each_diff(&block); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:96
+ def build_builder(env); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:77
+ def build_env(path); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:49
+ def build_methods(path); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:122
+ def constant_to_s(constant); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:100
+ def definition_method_to_s(key, kind, definition_method); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:38
+ def each_diff_constants(before_constant_children, after_constant_children); end
+
+ # pkg:gem/rbs#lib/rbs/diff.rb:27
+ def each_diff_methods(kind, before_methods, after_methods); end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:419
+class RBS::DuplicatedDeclarationError < ::RBS::LoadingError
+ # pkg:gem/rbs#lib/rbs/errors.rb:423
+ def initialize(name, *decls); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:421
+ def decls; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:420
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:292
+class RBS::DuplicatedInterfaceMethodDefinitionError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:299
+ def initialize(type:, method_name:, member:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:307
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:297
+ def member; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:296
+ def method_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:311
+ def qualified_method_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:295
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:320
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:251
+class RBS::DuplicatedMethodDefinitionError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:258
+ def initialize(type:, method_name:, members:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:283
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:256
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:255
+ def method_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:287
+ def other_locations; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:270
+ def qualified_method_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:254
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:279
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:4
+class RBS::Environment
+ # pkg:gem/rbs#lib/rbs/environment.rb:48
+ def initialize; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:981
+ def absolute_type(resolver, map, type, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:976
+ def absolute_type_name(resolver, map, type_name, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:455
+ def add_source(source); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:568
+ def append_context(context, decl); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:992
+ def buffers; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:117
+ def class_alias?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:10
+ def class_alias_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:101
+ def class_decl?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:5
+ def class_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:125
+ def class_entry(type_name, normalized: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:97
+ def constant_decl?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:8
+ def constant_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:167
+ def constant_entry(type_name, normalized: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:93
+ def constant_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:14
+ def declarations; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:470
+ def each_rbs_source(&block); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:482
+ def each_ruby_source(&block); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:9
+ def global_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:277
+ def insert_rbs_decl(decl, context:, namespace:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:374
+ def insert_ruby_decl(decl, context:, namespace:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:987
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:6
+ def interface_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:75
+ def interface_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:109
+ def module_alias?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:154
+ def module_class_entry(type_name, normalized: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:105
+ def module_decl?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:132
+ def module_entry(type_name, normalized: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:83
+ def module_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:269
+ def normalize_module_name(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:273
+ def normalize_module_name!(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:241
+ def normalize_module_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:219
+ def normalize_type_name(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:206
+ def normalize_type_name!(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:187
+ def normalize_type_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:139
+ def normalized_class_entry(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:163
+ def normalized_module_class_entry(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:150
+ def normalized_module_entry(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:236
+ def normalized_type_name!(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:223
+ def normalized_type_name?(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:577
+ def resolve_declaration(resolver, map, decl, context:, prefix:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:862
+ def resolve_member(resolver, map, member, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:962
+ def resolve_method_type(resolver, map, type, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:713
+ def resolve_ruby_decl(resolver, decl, context:, prefix:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:790
+ def resolve_ruby_member(resolver, member, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:500
+ def resolve_signature(resolver, table, dirs, decls, only: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:522
+ def resolve_type_names(only: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:970
+ def resolve_type_params(resolver, map, params, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:562
+ def resolver_context(*nesting); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:12
+ def sources; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:7
+ def type_alias_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:79
+ def type_alias_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:87
+ def type_name?(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:996
+ def unload(paths); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:494
+ def validate_type_params; end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:59
+ def initialize_copy(other); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/environment.rb:69
+ def from_loader(loader); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:33
+class RBS::Environment::ClassAliasEntry < ::RBS::Environment::SingleEntry; end
+
+# pkg:gem/rbs#lib/rbs/environment/class_entry.rb:5
+class RBS::Environment::ClassEntry
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:10
+ def initialize(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:15
+ def <<(context_decl); end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:8
+ def context_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:21
+ def each_decl(&block); end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:31
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:6
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:35
+ def primary_decl; end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:47
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/environment/class_entry.rb:52
+ def validate_type_params; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:42
+class RBS::Environment::ConstantEntry < ::RBS::Environment::SingleEntry; end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:45
+class RBS::Environment::GlobalEntry < ::RBS::Environment::SingleEntry; end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:36
+class RBS::Environment::InterfaceEntry < ::RBS::Environment::SingleEntry; end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:30
+class RBS::Environment::ModuleAliasEntry < ::RBS::Environment::SingleEntry; end
+
+# pkg:gem/rbs#lib/rbs/environment/module_entry.rb:5
+class RBS::Environment::ModuleEntry
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:10
+ def initialize(name); end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:15
+ def <<(context_decl); end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:8
+ def context_decls; end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:20
+ def each_decl(&block); end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:30
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:6
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:34
+ def primary_decl; end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:43
+ def self_types; end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:38
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/environment/module_entry.rb:49
+ def validate_type_params; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:18
+class RBS::Environment::SingleEntry
+ # pkg:gem/rbs#lib/rbs/environment.rb:23
+ def initialize(name:, decl:, context:); end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:20
+ def context; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:21
+ def decl; end
+
+ # pkg:gem/rbs#lib/rbs/environment.rb:19
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment.rb:39
+class RBS::Environment::TypeAliasEntry < ::RBS::Environment::SingleEntry; end
+
+# pkg:gem/rbs#lib/rbs/environment/use_map.rb:5
+class RBS::Environment::UseMap
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:30
+ def initialize(table:); end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:36
+ def build_map(clause); end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:72
+ def resolve(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:53
+ def resolve?(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:28
+ def use_dirs; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment/use_map.rb:6
+class RBS::Environment::UseMap::Table
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:9
+ def initialize; end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:7
+ def children; end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:14
+ def compute_children; end
+
+ # pkg:gem/rbs#lib/rbs/environment/use_map.rb:7
+ def known_types; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment_loader.rb:4
+class RBS::EnvironmentLoader
+ include ::RBS::FileFinder
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:40
+ def initialize(core_root: T.unsafe(nil), repository: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:48
+ def add(path: T.unsafe(nil), library: T.unsafe(nil), version: T.unsafe(nil), resolve_dependencies: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:74
+ def add_collection(lockfile); end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:20
+ def core_root; end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:24
+ def dirs; end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:125
+ def each_dir; end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:148
+ def each_signature; end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:98
+ def has_library?(library:, version:); end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:23
+ def libs; end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:106
+ def load(env:); end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:21
+ def repository; end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:59
+ def resolve_dependencies(library:, version:); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:28
+ def gem_sig_path(name, version); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/environment_loader.rb:26
+RBS::EnvironmentLoader::DEFAULT_CORE_ROOT = T.let(T.unsafe(nil), Pathname)
+
+# pkg:gem/rbs#lib/rbs/environment_loader.rb:17
+class RBS::EnvironmentLoader::Library < ::Struct; end
+
+# pkg:gem/rbs#lib/rbs/environment_loader.rb:5
+class RBS::EnvironmentLoader::UnknownLibraryError < ::StandardError
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:8
+ def initialize(lib:); end
+
+ # pkg:gem/rbs#lib/rbs/environment_loader.rb:6
+ def library; end
+end
+
+# pkg:gem/rbs#lib/rbs/environment_walker.rb:4
+class RBS::EnvironmentWalker
+ include ::TSort
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:11
+ def initialize(env:); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:16
+ def builder; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:99
+ def each_type_name(type, &block); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:105
+ def each_type_node(type, &block); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:9
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:20
+ def only_ancestors!(only = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:25
+ def only_ancestors?; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:44
+ def tsort_each_child(node, &block); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:31
+ def tsort_each_node(&block); end
+end
+
+# pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+class RBS::EnvironmentWalker::InstanceNode < ::Struct
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def type_name=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:5
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+class RBS::EnvironmentWalker::SingletonNode < ::Struct
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def type_name=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:6
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+class RBS::EnvironmentWalker::TypeNameNode < ::Struct
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def type_name=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/environment_walker.rb:7
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/factory.rb:4
+class RBS::Factory
+ # pkg:gem/rbs#lib/rbs/factory.rb:5
+ def type_name(string); end
+end
+
+# pkg:gem/rbs#lib/rbs/file_finder.rb:4
+module RBS::FileFinder
+ class << self
+ # pkg:gem/rbs#lib/rbs/file_finder.rb:7
+ def each_file(path, skip_hidden:, immediate: T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:407
+class RBS::GenericParameterMismatchError < ::RBS::LoadingError
+ # pkg:gem/rbs#lib/rbs/errors.rb:411
+ def initialize(name:, decl:, location: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:409
+ def decl; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:408
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:574
+class RBS::InconsistentClassModuleAliasError < ::RBS::BaseError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:579
+ def initialize(entry); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:577
+ def alias_entry; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:593
+ def location; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:187
+class RBS::InheritModuleError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:192
+ def initialize(super_decl); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:198
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:190
+ def super_decl; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:202
+ def check!(super_decl, env:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:4
+class RBS::InlineParser
+ class << self
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:45
+ def parse(buffer, prism); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:5
+class RBS::InlineParser::CommentAssociation
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:8
+ def initialize(blocks); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:6
+ def associated_blocks; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:6
+ def blocks; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:84
+ def each_enclosed_block(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:104
+ def each_unassociated_block; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:6
+ def end_line_map; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:47
+ def leading_block(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:55
+ def leading_block!(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:6
+ def start_line_map; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:63
+ def trailing_block(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:76
+ def trailing_block!(node); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:24
+ def build(buffer, result); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:29
+class RBS::InlineParser::CommentAssociation::Reference
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:32
+ def initialize(block, association); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:37
+ def associate!; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:42
+ def associated?; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser/comment_association.rb:30
+ def block; end
+end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:20
+module RBS::InlineParser::Diagnostic; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:38
+class RBS::InlineParser::Diagnostic::AnnotationSyntaxError < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:41
+class RBS::InlineParser::Diagnostic::AttributeNonSymbolName < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:21
+class RBS::InlineParser::Diagnostic::Base
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:24
+ def initialize(location, message); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:22
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:22
+ def message; end
+end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:42
+class RBS::InlineParser::Diagnostic::ClassModuleAliasDeclarationMissingTypeName < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:39
+class RBS::InlineParser::Diagnostic::MixinMultipleArguments < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:40
+class RBS::InlineParser::Diagnostic::MixinNonConstantModule < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:31
+class RBS::InlineParser::Diagnostic::NonConstantClassName < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:36
+class RBS::InlineParser::Diagnostic::NonConstantConstantDeclaration < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:32
+class RBS::InlineParser::Diagnostic::NonConstantModuleName < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:33
+class RBS::InlineParser::Diagnostic::NonConstantSuperClassName < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:30
+class RBS::InlineParser::Diagnostic::NotImplementedYet < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:35
+class RBS::InlineParser::Diagnostic::TopLevelAttributeDefinition < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:34
+class RBS::InlineParser::Diagnostic::TopLevelMethodDefinition < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:37
+class RBS::InlineParser::Diagnostic::UnusedInlineAnnotation < ::RBS::InlineParser::Diagnostic::Base; end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:57
+class RBS::InlineParser::Parser < ::Prism::Visitor
+ include ::RBS::AST::Ruby::Helpers::ConstantHelper
+ include ::RBS::AST::Ruby::Helpers::LocationHelper
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:63
+ def initialize(result); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:69
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:58
+ def comments; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:73
+ def current_module; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:77
+ def current_module!; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:81
+ def diagnostics; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:472
+ def insert_declaration(decl); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:58
+ def module_nesting; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:315
+ def parse_attribute_call(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:375
+ def parse_constant_declaration(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:259
+ def parse_mixin_call(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:508
+ def parse_super_class(super_class_expr, inheritance_operator_loc); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:85
+ def push_module_nesting(mod); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:480
+ def report_unused_annotation(*annotations); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:495
+ def report_unused_block(block); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:58
+ def result; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:92
+ def skip_node?(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:217
+ def visit_call_node(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:103
+ def visit_class_node(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:253
+ def visit_constant_path_write_node(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:246
+ def visit_constant_write_node(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:178
+ def visit_def_node(node); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:156
+ def visit_module_node(node); end
+end
+
+# pkg:gem/rbs#lib/rbs/inline_parser.rb:5
+class RBS::InlineParser::Result
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:8
+ def initialize(buffer, prism); end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:6
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:6
+ def declarations; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:6
+ def diagnostics; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:6
+ def prism_result; end
+
+ # pkg:gem/rbs#lib/rbs/inline_parser.rb:15
+ def type_fingerprint; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:341
+class RBS::InstanceVariableDuplicationError < ::RBS::VariableDuplicationError
+ # pkg:gem/rbs#lib/rbs/errors.rb:342
+ def kind; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:378
+class RBS::InvalidOverloadMethodError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:386
+ def initialize(type_name:, method_name:, kind:, members:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:383
+ def kind; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:402
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:384
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:382
+ def method_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:381
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:67
+class RBS::InvalidTypeApplicationError < ::RBS::DefinitionError
+ # pkg:gem/rbs#lib/rbs/errors.rb:74
+ def initialize(type_name:, args:, params:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:69
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:72
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:70
+ def params; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:68
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:71
+ def type_params; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:83
+ def check!(type_name:, args:, params:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:92
+ def check2!(env:, type_name:, args:, location:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:432
+class RBS::InvalidVarianceAnnotationError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:439
+ def initialize(type_name:, param:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:437
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:436
+ def param; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:435
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:20
+class RBS::LoadingError < ::RBS::BaseError; end
+
+# pkg:gem/rbs#lib/rbs.rb:71
+class RBS::Location
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def initialize(_arg0, _arg1, _arg2); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:79
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def [](_arg0); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _add_optional_child(_arg0, _arg1, _arg2); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _add_optional_no_child(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _add_required_child(_arg0, _arg1, _arg2); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _end_pos; end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _optional_keys; end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _required_keys; end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _start_pos; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:110
+ def add_optional_child(name, range); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:106
+ def add_required_child(name, range); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:27
+ def aref(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:118
+ def each_optional_key(&block); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:126
+ def each_required_key(&block); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:55
+ def end_column; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:51
+ def end_line; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:63
+ def end_loc; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:35
+ def end_pos; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:5
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:134
+ def key?(name); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:146
+ def local_location; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:166
+ def local_source; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:39
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:138
+ def optional_key?(name); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:67
+ def range; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:142
+ def required_key?(name); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:71
+ def source; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:47
+ def start_column; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:43
+ def start_line; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:59
+ def start_loc; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:31
+ def start_pos; end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:86
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:75
+ def to_s; end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def initialize_copy(_arg0); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:16
+ def new(buffer_ = T.unsafe(nil), start_pos_ = T.unsafe(nil), end_pos_ = T.unsafe(nil), buffer: T.unsafe(nil), start_pos: T.unsafe(nil), end_pos: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/location_aux.rb:102
+ def to_string(location, default: T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/location_aux.rb:29
+RBS::Location::WithChildren = RBS::Location
+
+# pkg:gem/rbs#lib/rbs/locator.rb:4
+class RBS::Locator
+ # pkg:gem/rbs#lib/rbs/locator.rb:7
+ def initialize(buffer:, dirs:, decls:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:5
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:5
+ def decls; end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:5
+ def dirs; end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:13
+ def find(line:, column:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:29
+ def find2(line:, column:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:60
+ def find_in_decl(pos, decl:, array:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:42
+ def find_in_directive(pos, dir, array); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:212
+ def find_in_loc(pos, location:, array:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:131
+ def find_in_member(pos, member:, array:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:154
+ def find_in_method_type(pos, method_type:, array:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:196
+ def find_in_type(pos, type:, array:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:172
+ def find_in_type_param(pos, type_param:, array:); end
+
+ # pkg:gem/rbs#lib/rbs/locator.rb:239
+ def test_loc(pos, location:); end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:4
+module RBS::MethodNameHelper
+ # pkg:gem/rbs#lib/rbs/errors.rb:5
+ def method_name_string; end
+end
+
+# pkg:gem/rbs#lib/rbs/method_type.rb:4
+class RBS::MethodType
+ # pkg:gem/rbs#lib/rbs/method_type.rb:10
+ def initialize(type_params:, type:, block:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:17
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:7
+ def block; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:86
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:59
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:127
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:123
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:8
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:65
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:74
+ def map_type_bound(&block); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:33
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:24
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:100
+ def to_s; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:6
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:119
+ def type_param_names; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:5
+ def type_params; end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:50
+ def update(type_params: T.unsafe(nil), type: T.unsafe(nil), block: T.unsafe(nil), location: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/method_type.rb:131
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:468
+class RBS::MixinClassError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:474
+ def initialize(type_name:, member:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:481
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:472
+ def member; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:471
+ def type_name; end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:502
+ def member_name(member); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:513
+ def mixin_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:485
+ def check!(type_name:, env:, member:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/namespace.rb:4
+class RBS::Namespace
+ # pkg:gem/rbs#lib/rbs/namespace.rb:7
+ def initialize(path:, absolute:); end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:20
+ def +(other); end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:59
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:47
+ def absolute!; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:39
+ def absolute?; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:28
+ def append(component); end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:101
+ def ascend; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:55
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:63
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:65
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:32
+ def parent; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:5
+ def path; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:51
+ def relative!; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:43
+ def relative?; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:69
+ def split; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:75
+ def to_s; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:84
+ def to_type_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/namespace.rb:12
+ def empty; end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:93
+ def parse(string); end
+
+ # pkg:gem/rbs#lib/rbs/namespace.rb:16
+ def root; end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:229
+class RBS::NoMixinFoundError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:235
+ def initialize(type_name:, member:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:242
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:233
+ def member; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:232
+ def type_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:246
+ def check!(type_name, env:, member:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:210
+class RBS::NoSelfTypeFoundError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:216
+ def initialize(type_name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:214
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:213
+ def type_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:223
+ def check!(self_type, env:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:167
+class RBS::NoSuperclassFoundError < ::RBS::DefinitionError
+ # pkg:gem/rbs#lib/rbs/errors.rb:171
+ def initialize(type_name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:169
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:168
+ def type_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:178
+ def check!(type_name, env:, location:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:148
+class RBS::NoTypeFoundError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:154
+ def initialize(type_name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:152
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:151
+ def type_name; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:161
+ def check!(type_name, env:, location:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:545
+class RBS::NonregularTypeAliasError < ::RBS::BaseError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:551
+ def initialize(diagnostic:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:548
+ def diagnostic; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:549
+ def location; end
+end
+
+# pkg:gem/rbs#lib/rbs.rb:71
+class RBS::Parser
+ class << self
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _lex(_arg0, _arg1); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _parse_inline_leading_annotation(_arg0, _arg1, _arg2, _arg3); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _parse_inline_trailing_annotation(_arg0, _arg1, _arg2, _arg3); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _parse_method_type(_arg0, _arg1, _arg2, _arg3, _arg4); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _parse_signature(_arg0, _arg1, _arg2); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _parse_type(_arg0, _arg1, _arg2, _arg3, _arg4, _arg5, _arg6, _arg7); end
+
+ # pkg:gem/rbs#lib/rbs.rb:71
+ def _parse_type_params(_arg0, _arg1, _arg2, _arg3); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:79
+ def buffer(source); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:132
+ def byte_range(char_range, content); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:70
+ def lex(source); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:46
+ def magic_comment(buf); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:122
+ def parse_inline_leading_annotation(source, range, variables: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:127
+ def parse_inline_trailing_annotation(source, range, variables: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:14
+ def parse_method_type(source, range: T.unsafe(nil), byte_range: T.unsafe(nil), variables: T.unsafe(nil), require_eof: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:20
+ def parse_signature(source); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:8
+ def parse_type(source, range: T.unsafe(nil), byte_range: T.unsafe(nil), variables: T.unsafe(nil), require_eof: T.unsafe(nil), void_allowed: T.unsafe(nil), self_allowed: T.unsafe(nil), classish_allowed: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/parser_aux.rb:41
+ def parse_type_params(source, module_type_params: T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/parser_aux.rb:88
+RBS::Parser::KEYWORDS = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rbs#lib/rbs/parser/lex_result.rb:5
+class RBS::Parser::LexResult
+ # pkg:gem/rbs#lib/rbs/parser/lex_result.rb:9
+ def initialize(buffer:, value:); end
+
+ # pkg:gem/rbs#lib/rbs/parser/lex_result.rb:6
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/parser/lex_result.rb:7
+ def value; end
+end
+
+# pkg:gem/rbs#lib/rbs/parser/token.rb:5
+class RBS::Parser::Token
+ # pkg:gem/rbs#lib/rbs/parser/token.rb:9
+ def initialize(type:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/parser/token.rb:18
+ def comment?; end
+
+ # pkg:gem/rbs#lib/rbs/parser/token.rb:7
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/parser/token.rb:6
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/parser/token.rb:14
+ def value; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:51
+class RBS::ParsingError < ::RBS::BaseError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:58
+ def initialize(location, error_message, token_type); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:55
+ def error_message; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:54
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:56
+ def token_type; end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/helpers.rb:4
+module RBS::Prototype; end
+
+# pkg:gem/rbs#lib/rbs/prototype/helpers.rb:5
+module RBS::Prototype::Helpers
+ private
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:153
+ def any_node?(node, nodes: T.unsafe(nil), &block); end
+
+ # NOTE: args_node may be a nil by a bug
+ # https://bugs.ruby-lang.org/issues/17495
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:177
+ def args_from_node(args_node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:65
+ def block_from_body(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:141
+ def each_child(node, &block); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:145
+ def each_node(nodes); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:165
+ def keyword_hash?(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:10
+ def parse_comments(string, include_trailing:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:181
+ def symbol_literal_node?(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/helpers.rb:192
+ def untyped; end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/node_usage.rb:5
+class RBS::Prototype::NodeUsage
+ include ::RBS::Prototype::Helpers
+
+ # pkg:gem/rbs#lib/rbs/prototype/node_usage.rb:10
+ def initialize(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/node_usage.rb:25
+ def calculate(node, conditional:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/node_usage.rb:8
+ def conditional_nodes; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/node_usage.rb:17
+ def each_conditional_node(&block); end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/rb.rb:5
+class RBS::Prototype::RB
+ include ::RBS::Prototype::Helpers
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:45
+ def initialize; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:536
+ def block_type(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:516
+ def body_type(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:431
+ def const_to_name(node, context:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:408
+ def const_to_name!(node, context: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:747
+ def current_accessibility(decls, index = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:49
+ def decls; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:787
+ def find_def_index_by_name(decls, name); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:511
+ def function_return_type_from_body(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:453
+ def function_type_from_body(node, def_name); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:529
+ def if_unless_type(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:783
+ def is_accessibility?(decl); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:442
+ def literal_to_symbol(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:550
+ def literal_to_type(node); end
+
+ # backward compatible
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:737
+ def node_type(node, default: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:694
+ def param_type(node, default: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:75
+ def parse(string); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:739
+ def private; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:82
+ def process(node, decls:, comments:, context:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:402
+ def process_children(node, decls:, comments:, context:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:743
+ def public; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:674
+ def range_element_type(types); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:757
+ def remove_unnecessary_accessibility_methods!(decls); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:805
+ def sort_members!(decls); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:42
+ def source_decls; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:43
+ def toplevel_members; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:663
+ def types_to_union_type(types); end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/rb.rb:8
+class RBS::Prototype::RB::Context < ::Struct
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:25
+ def attribute_kind; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:33
+ def enter_namespace(namespace); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:15
+ def method_kind; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:37
+ def update(module_function: T.unsafe(nil), singleton: T.unsafe(nil), in_def: T.unsafe(nil)); end
+
+ class << self
+ # @implements Context
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/rb.rb:11
+ def initial(namespace: T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/rbi.rb:5
+class RBS::Prototype::RBI
+ include ::RBS::Prototype::Helpers
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:12
+ def initialize; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:545
+ def call_node?(node, name:, receiver: T.unsafe(nil), args: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:549
+ def const_to_name(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:71
+ def current_module; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:75
+ def current_module!; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:27
+ def current_namespace; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:8
+ def decls; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:585
+ def each_arg(array, &block); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:599
+ def each_child(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:93
+ def join_comments(nodes, comments); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:10
+ def last_sig; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:262
+ def method_type(args_node, type_node, variables:, overloads:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:9
+ def modules; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:23
+ def nested_name(name); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:607
+ def node_to_hash(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:18
+ def parse(string); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:335
+ def parse_params(args_node, args, method_type, variables:, overloads:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:87
+ def pop_sig; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:537
+ def proc_type?(type_node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:98
+ def process(node, comments:, outer: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:33
+ def push_class(name, super_class, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:52
+ def push_module(name, comment:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:79
+ def push_sig(node); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:460
+ def type_of(type_node, variables:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/rbi.rb:473
+ def type_of0(type_node, variables:); end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:5
+class RBS::Prototype::Runtime
+ include ::RBS::Prototype::Helpers
+ include ::RBS::Prototype::Runtime::Helpers
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:79
+ def initialize(patterns:, env:, merge:, todo: T.unsafe(nil), owners_included: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:662
+ def block_from_ast_of(method); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:109
+ def builder; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:117
+ def decls; end
+
+ # Generate/find outer module declarations
+ # This is broken down into another method to comply with `DRY`
+ # This generates/finds declarations in nested form & returns the last array of declarations
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:591
+ def ensure_outer_module_declarations(mod); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:73
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:496
+ def generate_class(mod); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:433
+ def generate_constants(mod, decls); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:309
+ def generate_methods(mod, module_name, members); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:573
+ def generate_mixin(mod, decl, type_name, type_name_absolute); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:535
+ def generate_module(mod); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:481
+ def generate_super_class(mod); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:74
+ def merge; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:248
+ def merge_rbs(module_name, members, instance: T.unsafe(nil), singleton: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:179
+ def method_type(method); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:77
+ def outline; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:77
+ def outline=(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:76
+ def owners_included; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:113
+ def parse(file); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:72
+ def patterns; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:92
+ def target?(const); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:296
+ def target_method?(mod, instance: T.unsafe(nil), singleton: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:75
+ def todo; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:105
+ def todo_object; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:645
+ def type_args(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:653
+ def type_params(mod); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:423
+ def can_alias?(mod, method); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:137
+ def each_mixined_module(type_name, mod); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:146
+ def each_mixined_module_one(type_name, mod); end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:213
+class RBS::Prototype::Runtime::DataGenerator < ::RBS::Prototype::Runtime::ValueObjectBase
+ private
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:229
+ def add_decl_members(decl); end
+
+ # def self.new: (untyped foo, untyped bar) -> instance
+ # | (foo: untyped, bar: untyped) -> instance
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:237
+ def build_s_new; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:225
+ def build_super_class; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:214
+ def generatable?(target); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:6
+module RBS::Prototype::Runtime::Helpers
+ private
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:19
+ def const_name(const); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:15
+ def const_name!(const); end
+
+ # Returns the exact name & not compactly declared name
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:10
+ def only_name(mod); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:37
+ def to_type_name(name, full_name: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/helpers.rb:53
+ def untyped; end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/reflection.rb:6
+module RBS::Prototype::Runtime::Reflection
+ class << self
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/reflection.rb:12
+ def constants_of(mod, inherit = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/reflection.rb:7
+ def object_class(value); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:91
+class RBS::Prototype::Runtime::StructGenerator < ::RBS::Prototype::Runtime::ValueObjectBase
+ private
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:108
+ def add_decl_members(decl); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:165
+ def build_overload_for_keyword_arguments; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:151
+ def build_overload_for_positional_arguments; end
+
+ # def self.keyword_init?: () -> bool?
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:180
+ def build_s_keyword_init_p; end
+
+ # def self.new: (?untyped foo, ?untyped bar) -> instance
+ # | (?foo: untyped, ?bar: untyped) -> instance
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:117
+ def build_s_new; end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:104
+ def build_super_class; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:92
+ def generatable?(target); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:102
+RBS::Prototype::Runtime::StructGenerator::CAN_CALL_KEYWORD_INIT_P = T.let(T.unsafe(nil), TrueClass)
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime.rb:10
+class RBS::Prototype::Runtime::Todo
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:11
+ def initialize(builder:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:50
+ def skip_constant?(module_name:, name:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:37
+ def skip_instance_method?(module_name:, method:, accessibility:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:15
+ def skip_mixin?(type_name:, module_name:, mixin_class:); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:24
+ def skip_singleton_method?(module_name:, method:, accessibility:); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime.rb:57
+ def mixin_decls(type_name); end
+end
+
+# pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:8
+class RBS::Prototype::Runtime::ValueObjectBase
+ include ::RBS::Prototype::Runtime::Helpers
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:11
+ def initialize(target_class); end
+
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:15
+ def build_decl; end
+
+ private
+
+ # attr_accessor foo: untyped
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:74
+ def build_member_accessors(ast_members_class); end
+
+ # def self.members: () -> [ :foo, :bar ]
+ # def members: () -> [ :foo, :bar ]
+ #
+ # pkg:gem/rbs#lib/rbs/prototype/runtime/value_object_generator.rb:35
+ def build_s_members; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:448
+class RBS::RecursiveAliasDefinitionError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:454
+ def initialize(type:, defs:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:452
+ def defs; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:461
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:451
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:110
+class RBS::RecursiveAncestorError < ::RBS::DefinitionError
+ # pkg:gem/rbs#lib/rbs/errors.rb:114
+ def initialize(ancestors:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:111
+ def ancestors; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:112
+ def location; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:134
+ def check!(self_ancestor, ancestors:, location:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:527
+class RBS::RecursiveTypeAliasError < ::RBS::BaseError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:533
+ def initialize(alias_names:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:530
+ def alias_names; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:531
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:540
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/repository.rb:4
+class RBS::Repository
+ # pkg:gem/rbs#lib/rbs/repository.rb:74
+ def initialize(no_stdlib: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:98
+ def add(dir); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:71
+ def dirs; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:72
+ def gems; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:108
+ def lookup(gem, version); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:113
+ def lookup_path(gem, version); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/repository.rb:83
+ def default; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:87
+ def find_best_version(version, candidates); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/repository.rb:5
+RBS::Repository::DEFAULT_STDLIB_ROOT = T.let(T.unsafe(nil), Pathname)
+
+# pkg:gem/rbs#lib/rbs/repository.rb:7
+class RBS::Repository::GemRBS
+ # pkg:gem/rbs#lib/rbs/repository.rb:11
+ def initialize(name:); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:64
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:59
+ def find_best_version(version); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:54
+ def latest_version; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:22
+ def load!; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:8
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:49
+ def oldest_version; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:9
+ def paths; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:45
+ def version_names; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:17
+ def versions; end
+end
+
+# pkg:gem/rbs#lib/rbs/repository.rb:69
+class RBS::Repository::VersionPath < ::Struct
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def gem; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def gem=(_); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def path; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def path=(_); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def version; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def version=(_); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def [](*_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def inspect; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def keyword_init?; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def members; end
+
+ # pkg:gem/rbs#lib/rbs/repository.rb:69
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:4
+module RBS::Resolver; end
+
+# pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:5
+class RBS::Resolver::ConstantResolver
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:88
+ def initialize(builder:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:85
+ def builder; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:86
+ def child_constants_cache; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:112
+ def children(module_name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:100
+ def constants(context); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:178
+ def constants_from_ancestors(module_name, constants:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:163
+ def constants_from_context(context, constants:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:201
+ def constants_itself(context, constants:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:86
+ def context_constants_cache; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:138
+ def load_child_constants(name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:122
+ def load_context_constants(context); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:95
+ def resolve(name, context:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:108
+ def resolve_child(module_name, name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:85
+ def table; end
+end
+
+# pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:6
+class RBS::Resolver::ConstantResolver::Table
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:10
+ def initialize(environment); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:63
+ def children(name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:7
+ def children_table; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:67
+ def constant(name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:80
+ def constant_of_constant(name, entry); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:71
+ def constant_of_module(name, entry); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:8
+ def constants_table; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/constant_resolver.rb:7
+ def toplevel; end
+end
+
+# pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:5
+class RBS::Resolver::TypeNameResolver
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:10
+ def initialize(all_names, aliases); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:82
+ def aliased_name?(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:8
+ def aliases; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:6
+ def all_names; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:7
+ def cache; end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:76
+ def has_type_name?(full_name); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:121
+ def normalize_namespace(type_name, rhs, context, visited); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:39
+ def resolve(type_name, context:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:104
+ def resolve_head_namespace(head, context); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:62
+ def resolve_namespace(type_name, context:); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:136
+ def resolve_namespace0(type_name, context, visited); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:88
+ def resolve_type_name(type_name, context); end
+
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:32
+ def try_cache(query); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/resolver/type_name_resolver.rb:16
+ def build(env); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/source.rb:4
+module RBS::Source; end
+
+# pkg:gem/rbs#lib/rbs/source.rb:5
+class RBS::Source::RBS
+ # pkg:gem/rbs#lib/rbs/source.rb:8
+ def initialize(buffer, directives, decls); end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:6
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:6
+ def declarations; end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:6
+ def directives; end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:25
+ def each_declaration_type_name(names, decl, &block); end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:14
+ def each_type_name(&block); end
+end
+
+# pkg:gem/rbs#lib/rbs/source.rb:52
+class RBS::Source::Ruby
+ # pkg:gem/rbs#lib/rbs/source.rb:58
+ def initialize(buffer, prism, declarations, diagnostics); end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:53
+ def buffer; end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:55
+ def declarations; end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:56
+ def diagnostics; end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:76
+ def each_declaration_type_name(names, decl, &block); end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:65
+ def each_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/source.rb:54
+ def prism_result; end
+end
+
+# pkg:gem/rbs#lib/rbs/substitution.rb:4
+class RBS::Substitution
+ # pkg:gem/rbs#lib/rbs/substitution.rb:12
+ def initialize; end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:66
+ def +(other); end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:53
+ def [](ty); end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:16
+ def add(from:, to:); end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:37
+ def apply(ty); end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:8
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:6
+ def instance_type; end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:6
+ def instance_type=(_arg0); end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:5
+ def mapping; end
+
+ # pkg:gem/rbs#lib/rbs/substitution.rb:55
+ def without(*vars); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/substitution.rb:20
+ def build(variables, types, instance_type: T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/subtractor.rb:4
+class RBS::Subtractor
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:5
+ def initialize(minuend, subtrahend); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:10
+ def call(minuend = T.unsafe(nil), context: T.unsafe(nil)); end
+
+ private
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:180
+ def absolute_typename(name, context:); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:163
+ def access_modifier?(decl); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:120
+ def cvar_exist?(owner, name); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:129
+ def each_member(owner, &block); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:48
+ def filter_members(decl, context:); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:151
+ def filter_redundant_access_modifiers(decls); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:106
+ def ivar_exist?(owner, name, kind); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:60
+ def member_exist?(owner, member, context:); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:89
+ def method_exist?(owner, method_name, kind); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:140
+ def mixin_exist?(owner, mixin, context:); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:189
+ def typename_candidates(name, context:); end
+
+ # pkg:gem/rbs#lib/rbs/subtractor.rb:167
+ def update_decl(decl, members:); end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:367
+class RBS::SuperclassMismatchError < ::RBS::DefinitionError
+ # pkg:gem/rbs#lib/rbs/errors.rb:371
+ def initialize(name:, entry:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:369
+ def entry; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:368
+ def name; end
+end
+
+# pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:4
+class RBS::TypeAliasDependency
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:14
+ def initialize(env:); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:27
+ def build_dependencies; end
+
+ # Check if an alias type definition is circular & prohibited
+ #
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:19
+ def circular_definition?(alias_name); end
+
+ # A hash which stores the transitive closure
+ # of the directed graph
+ #
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:12
+ def dependencies; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:57
+ def dependencies_of(name); end
+
+ # Direct dependencies corresponds to a directed graph
+ # with vertices as types and directions based on assignment of types
+ #
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:9
+ def direct_dependencies; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:52
+ def direct_dependencies_of(name); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:5
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:43
+ def transitive_closure; end
+
+ private
+
+ # Recursive function to construct transitive closure
+ #
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:81
+ def dependency(start, vertex, nested = T.unsafe(nil)); end
+
+ # Constructs directed graph recursively
+ #
+ # pkg:gem/rbs#lib/rbs/type_alias_dependency.rb:65
+ def direct_dependency(type, result = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:4
+class RBS::TypeAliasRegularity
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:16
+ def initialize(env:); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:61
+ def build_alias_type(name); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:14
+ def builder; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:69
+ def compatible_args?(args1, args2); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:14
+ def diagnostics; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:110
+ def each_alias_type(type, &block); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:83
+ def each_mutual_alias_defs(&block); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:14
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:79
+ def nonregular?(type_name); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:22
+ def validate; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:39
+ def validate_alias_type(alias_type, names, types); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:120
+ def validate(env:); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:5
+class RBS::TypeAliasRegularity::Diagnostic
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:8
+ def initialize(type_name:, nonregular_type:); end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:6
+ def nonregular_type; end
+
+ # pkg:gem/rbs#lib/rbs/type_alias_regularity.rb:6
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/type_name.rb:4
+class RBS::TypeName
+ # pkg:gem/rbs#lib/rbs/type_name.rb:9
+ def initialize(namespace:, name:); end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:79
+ def +(other); end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:25
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:55
+ def absolute!; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:59
+ def absolute?; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:51
+ def alias?; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:47
+ def class?; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:29
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:31
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:67
+ def interface?; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:7
+ def kind; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:6
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:5
+ def namespace; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:63
+ def relative!; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:75
+ def split; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:39
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:43
+ def to_namespace; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:35
+ def to_s; end
+
+ # pkg:gem/rbs#lib/rbs/type_name.rb:71
+ def with_prefix(namespace); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/type_name.rb:90
+ def parse(string); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:614
+class RBS::TypeParamDefaultReferenceError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:620
+ def initialize(type_param, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:618
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:617
+ def type_param; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/errors.rb:626
+ def check!(type_params); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:4
+module RBS::Types; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:410
+class RBS::Types::Alias
+ include ::RBS::Types::Application
+
+ # pkg:gem/rbs#lib/rbs/types.rb:415
+ def initialize(name:, args:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:411
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:439
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:431
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:425
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:421
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:202
+module RBS::Types::Application
+ # pkg:gem/rbs#lib/rbs/types.rb:206
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:204
+ def args; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:232
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:210
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:216
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:244
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:240
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:212
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:203
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:224
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:248
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:41
+module RBS::Types::Bases; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:109
+class RBS::Types::Bases::Any < ::RBS::Types::Bases::Base
+ # pkg:gem/rbs#lib/rbs/types.rb:110
+ def initialize(location:, todo: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:117
+ def to_s(level = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:42
+class RBS::Types::Bases::Base
+ include ::RBS::Types::NoFreeVariables
+ include ::RBS::Types::NoSubst
+ include ::RBS::Types::EmptyEachType
+ include ::RBS::Types::NoTypeName
+
+ # pkg:gem/rbs#lib/rbs/types.rb:45
+ def initialize(location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:49
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:57
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:98
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:94
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:53
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:43
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:64
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:69
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:102
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:107
+class RBS::Types::Bases::Bool < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:123
+class RBS::Types::Bases::Bottom < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:130
+class RBS::Types::Bases::Class < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:125
+class RBS::Types::Bases::Instance < ::RBS::Types::Bases::Base
+ # pkg:gem/rbs#lib/rbs/types.rb:126
+ def sub(s); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:121
+class RBS::Types::Bases::Nil < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:124
+class RBS::Types::Bases::Self < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:122
+class RBS::Types::Bases::Top < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:108
+class RBS::Types::Bases::Void < ::RBS::Types::Bases::Base; end
+
+# pkg:gem/rbs#lib/rbs/types.rb:1348
+class RBS::Types::Block
+ # pkg:gem/rbs#lib/rbs/types.rb:1354
+ def initialize(type:, required:, location: T.unsafe(nil), self_type: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1361
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1352
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1386
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1350
+ def required; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1351
+ def self_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1376
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1368
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1349
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:366
+class RBS::Types::ClassInstance
+ include ::RBS::Types::Application
+
+ # pkg:gem/rbs#lib/rbs/types.rb:371
+ def initialize(name:, args:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:367
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:397
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:389
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:381
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:377
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:260
+class RBS::Types::ClassSingleton
+ include ::RBS::Types::Application
+
+ # pkg:gem/rbs#lib/rbs/types.rb:265
+ def initialize(name:, location:, args: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:271
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:275
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:277
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:261
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:309
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:301
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:281
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:289
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:293
+ def to_s(level = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:23
+module RBS::Types::EmptyEachType
+ # pkg:gem/rbs#lib/rbs/types.rb:24
+ def each_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:32
+ def map_type(&block); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:915
+class RBS::Types::Function
+ # pkg:gem/rbs#lib/rbs/types.rb:971
+ def initialize(required_positionals:, optional_positionals:, rest_positionals:, trailing_positionals:, required_keywords:, optional_keywords:, rest_keywords:, return_type:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:982
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1053
+ def amap(array, &block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1192
+ def drop_head; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1209
+ def drop_tail; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1090
+ def each_param(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1075
+ def each_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1163
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:994
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1008
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1234
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1222
+ def has_keyword?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1230
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:996
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1061
+ def hmapv(hash, &block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1036
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1069
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:967
+ def optional_keywords; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:963
+ def optional_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1173
+ def param_to_s; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:966
+ def required_keywords; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:962
+ def required_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:968
+ def rest_keywords; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:964
+ def rest_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1188
+ def return_to_s; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:969
+ def return_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1117
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1104
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:965
+ def trailing_positionals; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1149
+ def update(required_positionals: T.unsafe(nil), optional_positionals: T.unsafe(nil), rest_positionals: T.unsafe(nil), trailing_positionals: T.unsafe(nil), required_keywords: T.unsafe(nil), optional_keywords: T.unsafe(nil), rest_keywords: T.unsafe(nil), return_type: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1238
+ def with_nonreturn_void?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1136
+ def with_return_type(type); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/types.rb:1123
+ def empty(return_type); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:916
+class RBS::Types::Function::Param
+ # pkg:gem/rbs#lib/rbs/types.rb:921
+ def initialize(type:, name:, location: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:927
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:931
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:933
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:919
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:937
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:918
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:945
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:949
+ def to_s; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:917
+ def type; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:322
+class RBS::Types::Interface
+ include ::RBS::Types::Application
+
+ # pkg:gem/rbs#lib/rbs/types.rb:327
+ def initialize(name:, args:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:323
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:353
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:345
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:337
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:333
+ def to_json(state = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:832
+class RBS::Types::Intersection
+ # pkg:gem/rbs#lib/rbs/types.rb:836
+ def initialize(types:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:841
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:879
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:845
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:851
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:906
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:902
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:847
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:834
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:887
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:895
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:863
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:859
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:870
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:833
+ def types; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:910
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:1530
+class RBS::Types::Literal
+ include ::RBS::Types::NoFreeVariables
+ include ::RBS::Types::NoSubst
+ include ::RBS::Types::EmptyEachType
+ include ::RBS::Types::NoTypeName
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1534
+ def initialize(literal:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1539
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1543
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1566
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1562
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1545
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1531
+ def literal; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1532
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1554
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1558
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1570
+ def with_nonreturn_void?; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/types.rb:1590
+ def unescape_string(string, is_double_quote); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:1574
+RBS::Types::Literal::TABLE = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rbs#lib/rbs/types.rb:5
+module RBS::Types::NoFreeVariables
+ # pkg:gem/rbs#lib/rbs/types.rb:6
+ def free_variables(set = T.unsafe(nil)); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:11
+module RBS::Types::NoSubst
+ # pkg:gem/rbs#lib/rbs/types.rb:12
+ def sub(s); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:17
+module RBS::Types::NoTypeName
+ # pkg:gem/rbs#lib/rbs/types.rb:18
+ def map_type_name(&_arg0); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:655
+class RBS::Types::Optional
+ # pkg:gem/rbs#lib/rbs/types.rb:659
+ def initialize(type:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:664
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:702
+ def each_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:668
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:674
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:732
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:728
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:670
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:657
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:717
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:710
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:682
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:678
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:688
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:656
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:736
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:1407
+class RBS::Types::Proc
+ # pkg:gem/rbs#lib/rbs/types.rb:1413
+ def initialize(location:, type:, block:, self_type: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1420
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1409
+ def block; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1474
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1424
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1430
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1513
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1509
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1426
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1411
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1496
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1487
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1410
+ def self_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1447
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1437
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1458
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1408
+ def type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1517
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:537
+class RBS::Types::Record
+ # pkg:gem/rbs#lib/rbs/types.rb:541
+ def initialize(location:, all_fields: T.unsafe(nil), fields: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:565
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:538
+ def all_fields; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:615
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:569
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:538
+ def fields; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:575
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:646
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:642
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:571
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:539
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:631
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:624
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:538
+ def optional_fields; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:590
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:586
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:599
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:650
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:1395
+module RBS::Types::SelfTypeBindingHelper
+ private
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1398
+ def self_type_binding_to_s(t); end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/types.rb:1398
+ def self_type_binding_to_s(t); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:452
+class RBS::Types::Tuple
+ # pkg:gem/rbs#lib/rbs/types.rb:456
+ def initialize(types:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:461
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:498
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:465
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:471
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:528
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:524
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:467
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:454
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:513
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:506
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:483
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:479
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:490
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:453
+ def types; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:532
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:741
+class RBS::Types::Union
+ # pkg:gem/rbs#lib/rbs/types.rb:745
+ def initialize(types:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:750
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:796
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:754
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:760
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:823
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:819
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:756
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:743
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:804
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:812
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:772
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:768
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:779
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:742
+ def types; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:827
+ def with_nonreturn_void?; end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:1251
+class RBS::Types::UntypedFunction
+ # pkg:gem/rbs#lib/rbs/types.rb:1254
+ def initialize(return_type:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1336
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1284
+ def each_param(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1276
+ def each_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1312
+ def empty?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1340
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1258
+ def free_variables(acc = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1320
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1316
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1342
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1262
+ def map_type(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1270
+ def map_type_name(&block); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1328
+ def param_to_s; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1332
+ def return_to_s; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1252
+ def return_type; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1298
+ def sub(subst); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1292
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1308
+ def update(return_type: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1324
+ def with_nonreturn_void?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:1304
+ def with_return_type(ty); end
+end
+
+# pkg:gem/rbs#lib/rbs/types.rb:133
+class RBS::Types::Variable
+ include ::RBS::Types::NoTypeName
+ include ::RBS::Types::EmptyEachType
+
+ # pkg:gem/rbs#lib/rbs/types.rb:139
+ def initialize(name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:144
+ def ==(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:148
+ def eql?(other); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:154
+ def free_variables(set = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:193
+ def has_classish_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:189
+ def has_self_type?; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:150
+ def hash; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:135
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:134
+ def name; end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:164
+ def sub(s); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:160
+ def to_json(state = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:183
+ def to_s(level = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:197
+ def with_nonreturn_void?; end
+
+ class << self
+ # pkg:gem/rbs#lib/rbs/types.rb:168
+ def build(v); end
+
+ # pkg:gem/rbs#lib/rbs/types.rb:178
+ def fresh(v = T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:349
+class RBS::UnknownMethodAliasError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:357
+ def initialize(type_name:, original_name:, aliased_name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:354
+ def aliased_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:355
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:353
+ def original_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:352
+ def type_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/version.rb:4
+RBS::VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rbs#lib/rbs/validator.rb:4
+class RBS::Validator
+ # pkg:gem/rbs#lib/rbs/validator.rb:9
+ def initialize(env:, resolver: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:15
+ def absolute_type(type, context:, &block); end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:7
+ def definition_builder; end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:5
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:6
+ def resolver; end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:178
+ def type_alias_dependency; end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:182
+ def type_alias_regularity; end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:158
+ def validate_class_alias(entry:); end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:104
+ def validate_method_definition(method_def, type_name:); end
+
+ # Validates presence of the relative type, and application arity match.
+ #
+ # pkg:gem/rbs#lib/rbs/validator.rb:24
+ def validate_type(type, context:); end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:63
+ def validate_type_alias(entry:); end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:120
+ def validate_type_params(params, type_name:, location:, method_name: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/validator.rb:154
+ def validate_variable(var); end
+end
+
+# pkg:gem/rbs#lib/rbs/errors.rb:325
+class RBS::VariableDuplicationError < ::RBS::DefinitionError
+ include ::RBS::DetailedMessageable
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:332
+ def initialize(type_name:, variable_name:, location:); end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:330
+ def location; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:328
+ def type_name; end
+
+ # pkg:gem/rbs#lib/rbs/errors.rb:329
+ def variable_name; end
+end
+
+# pkg:gem/rbs#lib/rbs/variance_calculator.rb:4
+class RBS::VarianceCalculator
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:78
+ def initialize(builder:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:76
+ def builder; end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:82
+ def env; end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:169
+ def function(type, result:, context:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:98
+ def in_inherit(name:, args:, variables:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:86
+ def in_method_type(method_type:, variables:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:110
+ def in_type_alias(name:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:176
+ def negate(variance); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:121
+ def type(type, result:, context:); end
+end
+
+# pkg:gem/rbs#lib/rbs/variance_calculator.rb:5
+class RBS::VarianceCalculator::Result
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:8
+ def initialize(variables:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:45
+ def compatible?(var, with_annotation:); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:24
+ def contravariant(x); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:15
+ def covariant(x); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:37
+ def each(&block); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:41
+ def include?(name); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:60
+ def incompatible?(params); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:33
+ def invariant(x); end
+
+ # pkg:gem/rbs#lib/rbs/variance_calculator.rb:6
+ def result; end
+end
+
+# pkg:gem/rbs#lib/rbs/vendorer.rb:4
+class RBS::Vendorer
+ # pkg:gem/rbs#lib/rbs/vendorer.rb:8
+ def initialize(vendor_dir:, loader:); end
+
+ # pkg:gem/rbs#lib/rbs/vendorer.rb:21
+ def clean!; end
+
+ # pkg:gem/rbs#lib/rbs/vendorer.rb:28
+ def copy!; end
+
+ # pkg:gem/rbs#lib/rbs/vendorer.rb:13
+ def ensure_dir; end
+
+ # pkg:gem/rbs#lib/rbs/vendorer.rb:6
+ def loader; end
+
+ # pkg:gem/rbs#lib/rbs/vendorer.rb:5
+ def vendor_dir; end
+end
+
+# pkg:gem/rbs#lib/rbs/writer.rb:4
+class RBS::Writer
+ # pkg:gem/rbs#lib/rbs/writer.rb:8
+ def initialize(out:); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:366
+ def attribute(kind, attr); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:42
+ def format_annotation(annotation); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:23
+ def indent(size = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:6
+ def indentation; end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:293
+ def method_name(name); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:219
+ def name_and_args(name, args); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:207
+ def name_and_params(name, params); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:5
+ def out; end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:30
+ def prefix; end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:18
+ def preserve!(preserve: T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:14
+ def preserve?; end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:396
+ def preserve_empty_line(prev, decl); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:229
+ def put_lines(lines, leading_spaces:); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:34
+ def puts(string = T.unsafe(nil)); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:79
+ def write(contents); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:60
+ def write_annotation(annotations); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:66
+ def write_comment(comment); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:119
+ def write_decl(decl); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:314
+ def write_def(member); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:306
+ def write_loc_source(located); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:239
+ def write_member(member); end
+
+ # pkg:gem/rbs#lib/rbs/writer.rb:102
+ def write_use_directive(dir); end
+end
diff --git a/sorbet/rbi/gems/regexp_parser@2.12.0.rbi b/sorbet/rbi/gems/regexp_parser@2.12.0.rbi
new file mode 100644
index 0000000..20c5398
--- /dev/null
+++ b/sorbet/rbi/gems/regexp_parser@2.12.0.rbi
@@ -0,0 +1,3398 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `regexp_parser` gem.
+# Please instead update this file by running `bin/tapioca gem regexp_parser`.
+
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:3
+module Regexp::Expression; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/alternation.rb:7
+class Regexp::Expression::Alternation < ::Regexp::Expression::SequenceOperation
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/alternation.rb:10
+ def alternatives; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:11
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:132
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/alternation.rb:8
+Regexp::Expression::Alternation::OPERAND = Regexp::Expression::Alternative
+
+# A sequence of expressions, used by Alternation as one of its alternatives.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/alternation.rb:5
+class Regexp::Expression::Alternative < ::Regexp::Expression::Sequence
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:12
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:4
+module Regexp::Expression::Anchor; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:20
+Regexp::Expression::Anchor::BOL = Regexp::Expression::Anchor::BeginningOfLine
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:22
+Regexp::Expression::Anchor::BOS = Regexp::Expression::Anchor::BeginningOfString
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:5
+class Regexp::Expression::Anchor::Base < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:149
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:7
+class Regexp::Expression::Anchor::BeginningOfLine < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:13
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:10
+class Regexp::Expression::Anchor::BeginningOfString < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:14
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:21
+Regexp::Expression::Anchor::EOL = Regexp::Expression::Anchor::EndOfLine
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:23
+Regexp::Expression::Anchor::EOS = Regexp::Expression::Anchor::EndOfString
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:24
+Regexp::Expression::Anchor::EOSobEOL = Regexp::Expression::Anchor::EndOfStringOrBeforeEndOfLine
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:8
+class Regexp::Expression::Anchor::EndOfLine < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:15
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:11
+class Regexp::Expression::Anchor::EndOfString < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:16
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:13
+class Regexp::Expression::Anchor::EndOfStringOrBeforeEndOfLine < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:17
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:18
+class Regexp::Expression::Anchor::MatchStart < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:18
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:16
+class Regexp::Expression::Anchor::NonWordBoundary < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:19
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:15
+ def negative?; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/anchor.rb:15
+class Regexp::Expression::Anchor::WordBoundary < ::Regexp::Expression::Anchor::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:20
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:66
+module Regexp::Expression::Assertion; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:67
+class Regexp::Expression::Assertion::Base < ::Regexp::Expression::Group::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:149
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:69
+class Regexp::Expression::Assertion::Lookahead < ::Regexp::Expression::Assertion::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:21
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:72
+class Regexp::Expression::Assertion::Lookbehind < ::Regexp::Expression::Assertion::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:22
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:70
+class Regexp::Expression::Assertion::NegativeLookahead < ::Regexp::Expression::Assertion::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:23
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:16
+ def negative?; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:73
+class Regexp::Expression::Assertion::NegativeLookbehind < ::Regexp::Expression::Assertion::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:24
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:17
+ def negative?; end
+end
+
+# alias for symmetry between token symbol and Expression class name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:57
+Regexp::Expression::Backref = Regexp::Expression::Backreference
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:4
+module Regexp::Expression::Backreference; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:5
+class Regexp::Expression::Backreference::Base < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:157
+ def match_length; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:142
+ def referential?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:17
+class Regexp::Expression::Backreference::Name < ::Regexp::Expression::Backreference::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:21
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:25
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:18
+ def name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:19
+ def reference; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:33
+class Regexp::Expression::Backreference::NameCall < ::Regexp::Expression::Backreference::Name
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:26
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:45
+class Regexp::Expression::Backreference::NameRecursionLevel < ::Regexp::Expression::Backreference::Name
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:48
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:46
+ def recursion_level; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:7
+class Regexp::Expression::Backreference::Number < ::Regexp::Expression::Backreference::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:11
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:27
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:8
+ def number; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:9
+ def reference; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:32
+class Regexp::Expression::Backreference::NumberCall < ::Regexp::Expression::Backreference::Number
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:29
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:34
+class Regexp::Expression::Backreference::NumberCallRelative < ::Regexp::Expression::Backreference::NumberRelative
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:30
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:36
+class Regexp::Expression::Backreference::NumberRecursionLevel < ::Regexp::Expression::Backreference::NumberRelative
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:39
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:37
+ def recursion_level; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:27
+class Regexp::Expression::Backreference::NumberRelative < ::Regexp::Expression::Backreference::Number
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:28
+ def effective_number; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:28
+ def effective_number=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:28
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/backreference.rb:29
+ def reference; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:4
+class Regexp::Expression::Base
+ include ::Regexp::Expression::Shared
+ include ::Regexp::Expression::ReferencedExpressions
+ extend ::Regexp::Expression::Shared::ClassMethods
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:7
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match.rb:13
+ def =~(string, offset = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:30
+ def a?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:27
+ def ascii_classes?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:76
+ def attributes; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:10
+ def case_insensitive?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def conditional_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def conditional_level=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def custom_to_s_handling; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def custom_to_s_handling=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:25
+ def d?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:22
+ def default_classes?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:20
+ def extended?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:16
+ def free_spacing?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:49
+ def greedy?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:13
+ def i?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:14
+ def ignore_case?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:56
+ def lazy?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def level=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:8
+ def m?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match.rb:10
+ def match(string, offset = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match.rb:5
+ def match?(string); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match.rb:8
+ def matches?(string); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:5
+ def multiline?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def nesting_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def options; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def options=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def parent; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def parent=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:58
+ def possessive?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def pre_quantifier_decorations; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def pre_quantifier_decorations=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def quantifier; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:19
+ def quantify(*args); end
+
+ # Deprecated. Prefer `#repetitions` which has a more uniform interface.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:28
+ def quantity; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:53
+ def reluctant?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:33
+ def repetitions; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def set_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def set_level=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/strfregexp.rb:100
+ def strfre(format = T.unsafe(nil), indent_offset = T.unsafe(nil), index = T.unsafe(nil)); 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[,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'
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/strfregexp.rb:39
+ def strfregexp(format = T.unsafe(nil), indent_offset = T.unsafe(nil), index = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def te; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def te=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def text; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def text=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:62
+ def to_h; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:11
+ def to_re(format = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def token; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def token=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def ts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def ts=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def type; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:5
+ def type=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:35
+ def u?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:32
+ def unicode_classes?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/base.rb:23
+ def unquantified_clone; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/options.rb:19
+ def x?; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:4
+class Regexp::Expression::CharacterSet < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:8
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:18
+ def close; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:5
+ def closed; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:5
+ def closed=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:6
+ def closed?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:14
+ def negate; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:5
+ def negative; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:5
+ def negative=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:18
+ def negative?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:17
+ def parts; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/intersection.rb:5
+class Regexp::Expression::CharacterSet::IntersectedSequence < ::Regexp::Expression::Sequence
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:31
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/intersection.rb:7
+class Regexp::Expression::CharacterSet::Intersection < ::Regexp::Expression::SequenceOperation
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:32
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/intersection.rb:8
+Regexp::Expression::CharacterSet::Intersection::OPERAND = Regexp::Expression::CharacterSet::IntersectedSequence
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/range.rb:5
+class Regexp::Expression::CharacterSet::Range < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/range.rb:10
+ def <<(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/range.rb:16
+ def complete?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:33
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:18
+ def parts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set/range.rb:6
+ def ts; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:4
+module Regexp::Expression::CharacterType; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:7
+class Regexp::Expression::CharacterType::Any < ::Regexp::Expression::CharacterType::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:34
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:5
+class Regexp::Expression::CharacterType::Base < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:19
+ def negative?; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:8
+class Regexp::Expression::CharacterType::Digit < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:17
+class Regexp::Expression::CharacterType::ExtendedGrapheme < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:10
+class Regexp::Expression::CharacterType::Hex < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:16
+class Regexp::Expression::CharacterType::Linebreak < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:9
+class Regexp::Expression::CharacterType::NonDigit < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:11
+class Regexp::Expression::CharacterType::NonHex < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:15
+class Regexp::Expression::CharacterType::NonSpace < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:13
+class Regexp::Expression::CharacterType::NonWord < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:14
+class Regexp::Expression::CharacterType::Space < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_type.rb:12
+class Regexp::Expression::CharacterType::Word < ::Regexp::Expression::CharacterType::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/free_space.rb:10
+class Regexp::Expression::Comment < ::Regexp::Expression::FreeSpace
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:35
+ def human_name; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:132
+ def comment?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:4
+module Regexp::Expression::Conditional; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:20
+class Regexp::Expression::Conditional::Branch < ::Regexp::Expression::Sequence
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:36
+ def human_name; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:11
+class Regexp::Expression::Conditional::Condition < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:37
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:149
+ def match_length; end
+
+ # Name or number of the referenced capturing group that determines state.
+ # Returns a String if reference is by name, Integer if by number.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:14
+ def reference; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:143
+ def referential?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:22
+class Regexp::Expression::Conditional::Expression < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:23
+ def <<(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:27
+ def add_sequence(active_opts = T.unsafe(nil), params = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:32
+ def branch(active_opts = T.unsafe(nil), params = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:43
+ def branches; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:39
+ def condition; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:34
+ def condition=(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:38
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:132
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:19
+ def parts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:47
+ def reference; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:144
+ def referential?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:5
+class Regexp::Expression::Conditional::TooManyBranches < ::Regexp::Parser::Error
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/conditional.rb:6
+ def initialize; end
+end
+
+# alias for symmetry between Token::* and Expression::*
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:32
+Regexp::Expression::Escape = Regexp::Expression::EscapeSequence
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:4
+module Regexp::Expression::EscapeSequence; end
+
+# e.g. \xE2\x82\xAC
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:25
+class Regexp::Expression::EscapeSequence::AbstractMetaControlSequence < ::Regexp::Expression::EscapeSequence::Base
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:48
+ def control_sequence_to_s(control_sequence); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:53
+ def meta_char_to_codepoint(meta_char); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:7
+class Regexp::Expression::EscapeSequence::AsciiEscape < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:4
+ def codepoint; end
+end
+
+# \e
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:8
+class Regexp::Expression::EscapeSequence::Backspace < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:5
+ def codepoint; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:5
+class Regexp::Expression::EscapeSequence::Base < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_char.rb:4
+ def char; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+end
+
+# \b
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:9
+class Regexp::Expression::EscapeSequence::Bell < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:6
+ def codepoint; end
+end
+
+# e.g. \x0A
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:20
+class Regexp::Expression::EscapeSequence::Codepoint < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:18
+ def codepoint; end
+end
+
+# e.g. \u000A
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:22
+class Regexp::Expression::EscapeSequence::CodepointList < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:28
+ def char; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:36
+ def chars; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:32
+ def codepoint; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:40
+ def codepoints; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:166
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:26
+class Regexp::Expression::EscapeSequence::Control < ::Regexp::Expression::EscapeSequence::AbstractMetaControlSequence
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:60
+ def codepoint; end
+end
+
+# \a
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:10
+class Regexp::Expression::EscapeSequence::FormFeed < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:7
+ def codepoint; end
+end
+
+# e.g. \012
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:19
+class Regexp::Expression::EscapeSequence::Hex < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:17
+ def codepoint; end
+end
+
+# \v
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:16
+class Regexp::Expression::EscapeSequence::Literal < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:13
+ def codepoint; end
+end
+
+# e.g. \cB
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:27
+class Regexp::Expression::EscapeSequence::Meta < ::Regexp::Expression::EscapeSequence::AbstractMetaControlSequence
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:66
+ def codepoint; end
+end
+
+# e.g. \M-Z
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:28
+class Regexp::Expression::EscapeSequence::MetaControl < ::Regexp::Expression::EscapeSequence::AbstractMetaControlSequence
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:72
+ def codepoint; end
+end
+
+# \f
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:11
+class Regexp::Expression::EscapeSequence::Newline < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:8
+ def codepoint; end
+end
+
+# e.g. \j, \@, \😀 (ineffectual escapes)
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:18
+class Regexp::Expression::EscapeSequence::Octal < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:15
+ def codepoint; end
+end
+
+# \n
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:12
+class Regexp::Expression::EscapeSequence::Return < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:9
+ def codepoint; end
+end
+
+# \r
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:13
+class Regexp::Expression::EscapeSequence::Tab < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:10
+ def codepoint; end
+end
+
+# e.g. \u{A B}
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:23
+class Regexp::Expression::EscapeSequence::UTF8Hex < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:21
+ def codepoint; end
+end
+
+# \t
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/escape_sequence.rb:14
+class Regexp::Expression::EscapeSequence::VerticalTab < ::Regexp::Expression::EscapeSequence::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/escape_sequence_codepoint.rb:11
+ def codepoint; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/free_space.rb:4
+class Regexp::Expression::FreeSpace < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:149
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/free_space.rb:5
+ def quantify(*_args); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:137
+ def decorative?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:4
+module Regexp::Expression::Group; end
+
+# Special case. Absence group can match 0.. chars, irrespective of content.
+# TODO: in theory, they *can* exclude match lengths with `.`: `(?~.{3})`
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:21
+class Regexp::Expression::Group::Absence < ::Regexp::Expression::Group::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:174
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:22
+class Regexp::Expression::Group::Atomic < ::Regexp::Expression::Group::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:5
+class Regexp::Expression::Group::Base < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:20
+ def parts; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:42
+class Regexp::Expression::Group::Capture < ::Regexp::Expression::Group::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:39
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:44
+ def identifier; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:43
+ def number; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:43
+ def number=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:43
+ def number_at_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:43
+ def number_at_level=(_arg0); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:128
+ def capturing?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:62
+class Regexp::Expression::Group::Comment < ::Regexp::Expression::Group::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:22
+ def parts; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:133
+ def comment?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:138
+ def decorative?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:47
+class Regexp::Expression::Group::Named < ::Regexp::Expression::Group::Capture
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:51
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:40
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:49
+ def identifier; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:48
+ def name; end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:56
+ def initialize_copy(orig); end
+end
+
+# TODO: should split off OptionsSwitch in v3.0.0. Maybe even make it no
+# longer inherit from Group because it is effectively a terminal expression.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:25
+class Regexp::Expression::Group::Options < ::Regexp::Expression::Group::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:26
+ def option_changes; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:26
+ def option_changes=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:33
+ def quantify(*args); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:28
+ def initialize_copy(orig); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:8
+class Regexp::Expression::Group::Passive < ::Regexp::Expression::Group::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:11
+ def initialize(*_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:9
+ def implicit=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/group.rb:16
+ def implicit?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:21
+ def parts; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/keep.rb:4
+module Regexp::Expression::Keep; end
+
+# TODO: in regexp_parser v3.0.0 this should possibly be a Subexpression
+# that contains all expressions to its left.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/keep.rb:7
+class Regexp::Expression::Keep::Mark < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:41
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:149
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/literal.rb:4
+class Regexp::Expression::Literal < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:42
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:107
+ def match_length; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:87
+Regexp::Expression::MatchLength = Regexp::MatchLength
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/posix_class.rb:12
+Regexp::Expression::Nonposixclass = Regexp::Expression::PosixClass
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:120
+Regexp::Expression::Nonproperty = Regexp::Expression::UnicodeProperty
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/posix_class.rb:4
+class Regexp::Expression::PosixClass < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/posix_class.rb:5
+ def name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:20
+ def negative?; end
+end
+
+# alias for symmetry between token symbol and Expression class name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/posix_class.rb:11
+Regexp::Expression::Posixclass = Regexp::Expression::PosixClass
+
+# alias for symmetry between token symbol and Expression class name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:119
+Regexp::Expression::Property = Regexp::Expression::UnicodeProperty
+
+# TODO: in v3.0.0, maybe put Shared back into Base, and inherit from Base and
+# call super in #initialize, but raise in #quantifier= and #quantify,
+# or introduce an Expression::Quantifiable intermediate class.
+# Or actually allow chaining as a more concise but tricky solution than PR#69.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:8
+class Regexp::Expression::Quantifier
+ include ::Regexp::Expression::Shared
+ extend ::Regexp::Expression::Shared::ClassMethods
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:13
+ def initialize(*args); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def conditional_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def conditional_level=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def custom_to_s_handling; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def custom_to_s_handling=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:32
+ def greedy?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:38
+ def lazy?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def level=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:44
+ def max; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:40
+ def min; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:48
+ def mode; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def nesting_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def options; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def options=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def parent; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def parent=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:32
+ def possessive?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def pre_quantifier_decorations; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def pre_quantifier_decorations=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def quantifier; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:32
+ def reluctant?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def set_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def set_level=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def te; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def te=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def text; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def text=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:21
+ def to_h; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def token; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def token=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def ts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def ts=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def type; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:9
+ def type=(_arg0); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:54
+ def deprecated_old_init(token, text, _min, _max, _mode = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:66
+ def derived_data; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/quantifier.rb:11
+Regexp::Expression::Quantifier::MODES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/referenced_expressions.rb:4
+module Regexp::Expression::ReferencedExpressions
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/referenced_expressions.rb:7
+ def referenced_expression; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/referenced_expressions.rb:5
+ def referenced_expressions; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/referenced_expressions.rb:5
+ def referenced_expressions=(_arg0); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/referenced_expressions.rb:11
+ def initialize_copy(orig); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/root.rb:4
+class Regexp::Expression::Root < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:43
+ def human_name; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/root.rb:5
+ def build(options = T.unsafe(nil)); end
+ end
+end
+
+# A sequence of expressions. Differs from a Subexpressions by how it handles
+# quantifiers, as it applies them to its last element instead of itself as
+# a whole subexpression.
+#
+# Used as the base class for the Alternation alternatives, Conditional
+# branches, and CharacterSet::Intersection intersected sequences.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence.rb:10
+class Regexp::Expression::Sequence < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence.rb:29
+ def quantify(token, *args); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence.rb:25
+ def ts; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence.rb:12
+ def add_to(exp, params = T.unsafe(nil), active_opts = T.unsafe(nil)); end
+ end
+end
+
+# abstract class
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:5
+class Regexp::Expression::SequenceOperation < ::Regexp::Expression::Subexpression
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:14
+ def <<(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:18
+ def add_sequence(active_opts = T.unsafe(nil), params = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:7
+ def operands; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:8
+ def operator; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:24
+ def parts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:6
+ def sequences; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/sequence_operation.rb:10
+ def ts; end
+end
+
+# alias for symmetry between token symbol and Expression class name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/character_set.rb:24
+Regexp::Expression::Set = Regexp::Expression::CharacterSet
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:4
+module Regexp::Expression::Shared
+ mixes_in_class_methods ::Regexp::Expression::Shared::ClassMethods
+
+ # Deep-compare two expressions for equality.
+ #
+ # When changing the conditions, please make sure to update
+ # #pretty_print_instance_variables so that it includes all relevant values.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:103
+ def ==(other); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:110
+ def ===(other); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:53
+ def base_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:126
+ def capturing?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:99
+ def coded_offset; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:130
+ def comment?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:135
+ def decorative?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:49
+ def ends_at(include_quantifier = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:111
+ def eql?(other); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:57
+ def full_length; end
+
+ # default implementation, e.g. "atomic group", "hex escape", "word type", ..
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:6
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/printing.rb:5
+ def inspect; end
+
+ # Test if this expression has the given test_token, and optionally a given
+ # test_type.
+ #
+ # # Any expressions
+ # exp.is? :* # always returns true
+ #
+ # # is it a :capture
+ # exp.is? :capture
+ #
+ # # is it a :character and a :set
+ # exp.is? :character, :set
+ #
+ # # is it a :meta :dot
+ # exp.is? :dot, :meta
+ #
+ # # is it a :meta or :escape :dot
+ # exp.is? :dot, [:meta, :escape]
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:38
+ def is?(test_token, test_type = T.unsafe(nil)); end
+
+ # not an alias so as to respect overrides of #negative?
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:10
+ def negated?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:5
+ def negative?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:103
+ def nesting_level=(lvl); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:95
+ def offset; end
+
+ # Test if this expression matches an entry in the given scope spec.
+ #
+ # A scope spec can be one of:
+ #
+ # . An array: Interpreted as a set of tokens, tested for inclusion
+ # of the expression's token.
+ #
+ # . A hash: Where the key is interpreted as the expression type
+ # and the value is either a symbol or an array. In this
+ # case, when the scope is a hash, one_of? calls itself to
+ # evaluate the key's value.
+ #
+ # . A symbol: matches the expression's token or type, depending on
+ # the level of the call. If one_of? is called directly with
+ # a symbol then it will always be checked against the
+ # type of the expression. If it's being called for a value
+ # from a hash, it will be checked against the token of the
+ # expression.
+ #
+ # # any expression
+ # exp.one_of?(:*) # always true
+ #
+ # # like exp.type?(:group)
+ # exp.one_of?(:group)
+ #
+ # # any expression of type meta
+ # exp.one_of?(:meta => :*)
+ #
+ # # meta dots and alternations
+ # exp.one_of?(:meta => [:dot, :alternation])
+ #
+ # # meta dots and any set tokens
+ # exp.one_of?({meta: [:dot], set: :*})
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:77
+ def one_of?(scope, top = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:113
+ def optional?; end
+
+ # default implementation
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:6
+ def parts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:87
+ def pre_quantifier_decoration(expression_format = T.unsafe(nil)); end
+
+ # Make pretty-print work despite #inspect implementation.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/printing.rb:14
+ def pretty_print(q); end
+
+ # Called by pretty_print (ruby/pp) and #inspect.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/printing.rb:19
+ def pretty_print_instance_variables; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:117
+ def quantified?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:109
+ def quantifier=(qtf); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:91
+ def quantifier_affix(expression_format = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:140
+ def referential?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:45
+ def starts_at; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:122
+ def terminal?; end
+
+ # #to_s reproduces the original source, as an unparser would.
+ #
+ # It takes an optional format argument.
+ #
+ # Example:
+ #
+ # lit = Regexp::Parser.parse(/a +/x)[0]
+ #
+ # lit.to_s # => 'a+' # default; with quantifier
+ # lit.to_s(:full) # => 'a+' # default; with quantifier
+ # lit.to_s(:base) # => 'a' # without quantifier
+ # lit.to_s(:original) # => 'a +' # with quantifier AND intermittent decorations
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:74
+ def to_s(format = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:85
+ def to_str(format = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/construct.rb:39
+ def token_class; end
+
+ # Test if this expression has the given test_type, which can be either
+ # a symbol or an array of symbols to check against the expression's type.
+ #
+ # # is it a :group expression
+ # exp.type? :group
+ #
+ # # is it a :set, or :meta
+ # exp.type? [:set, :meta]
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:15
+ def type?(test_type); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:20
+ def init_from_token_and_options(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:34
+ def initialize_copy(orig); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:12
+ def intersperse(expressions, separator); end
+
+ class << self
+ # filled in ./methods/*.rb
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:7
+ def included(mod); end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/shared.rb:5
+module Regexp::Expression::Shared::ClassMethods
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:127
+ def capturing?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:131
+ def comment?; end
+
+ # Convenience method to init a valid Expression without a Regexp::Token
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/construct.rb:7
+ def construct(params = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/construct.rb:17
+ def construct_defaults; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:136
+ def decorative?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:141
+ def referential?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:123
+ def terminal?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/construct.rb:27
+ def token_class; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:4
+class Regexp::Expression::Subexpression < ::Regexp::Expression::Base
+ include ::Enumerable
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:9
+ def initialize(token, options = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:22
+ def <<(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def [](*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def at(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:35
+ def dig(*indices); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def each(*args, &block); end
+
+ # Traverses the expression, passing each recursive child to the
+ # given block.
+ # If the block takes two arguments, the indices of the children within
+ # their parents are also passed to it.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/traverse.rb:10
+ def each_expression(include_self = T.unsafe(nil), &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def empty?(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:7
+ def expressions; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:7
+ def expressions=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:52
+ def extract_quantifier_target(quantifier_description); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def fetch(*args, &block); end
+
+ # Returns a new array with the results of calling the given block once
+ # for every expression. If a block is not given, returns an array with
+ # each expression and its level index as an array.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/traverse.rb:58
+ def flat_map(include_self = T.unsafe(nil), &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def index(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:120
+ def inner_match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def join(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def last(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def length(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:113
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/parts.rb:23
+ def parts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/strfregexp.rb:114
+ def strfre_tree(format = T.unsafe(nil), include_self = T.unsafe(nil), separator = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/strfregexp.rb:104
+ def strfregexp_tree(format = T.unsafe(nil), include_self = T.unsafe(nil), separator = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:41
+ def te; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:45
+ def to_h; end
+
+ # Traverses the subexpression (depth-first, pre-order) and calls the given
+ # block for each expression with three arguments; the traversal event,
+ # the expression, and the index of the expression within its parent.
+ #
+ # The event argument is passed as follows:
+ #
+ # - For subexpressions, :enter upon entering the subexpression, and
+ # :exit upon exiting it.
+ #
+ # - For terminal expressions, :visit is called once.
+ #
+ # Returns self.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/traverse.rb:34
+ def traverse(include_self = T.unsafe(nil), &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:28
+ def values_at(*args, &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/traverse.rb:53
+ def walk(include_self = T.unsafe(nil), &block); end
+
+ protected
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/traverse.rb:68
+ def each_expression_with_index(&block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/traverse.rb:75
+ def each_expression_without_index(&block); end
+
+ private
+
+ # Override base method to clone the expressions as well.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/subexpression.rb:15
+ def initialize_copy(orig); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/tests.rb:124
+ def terminal?; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:4
+module Regexp::Expression::UnicodeProperty; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:110
+class Regexp::Expression::UnicodeProperty::Age < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:15
+class Regexp::Expression::UnicodeProperty::Alnum < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:16
+class Regexp::Expression::UnicodeProperty::Alpha < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:33
+class Regexp::Expression::UnicodeProperty::Any < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:17
+class Regexp::Expression::UnicodeProperty::Ascii < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:34
+class Regexp::Expression::UnicodeProperty::Assigned < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:5
+class Regexp::Expression::UnicodeProperty::Base < ::Regexp::Expression::Base
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:99
+ def match_length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:6
+ def name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/negative.rb:21
+ def negative?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:10
+ def shortcut; end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:18
+class Regexp::Expression::UnicodeProperty::Blank < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:111
+class Regexp::Expression::UnicodeProperty::Block < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:19
+class Regexp::Expression::UnicodeProperty::Cntrl < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:99
+module Regexp::Expression::UnicodeProperty::Codepoint; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:102
+class Regexp::Expression::UnicodeProperty::Codepoint::Any < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:100
+class Regexp::Expression::UnicodeProperty::Codepoint::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:103
+class Regexp::Expression::UnicodeProperty::Codepoint::Control < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:104
+class Regexp::Expression::UnicodeProperty::Codepoint::Format < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:106
+class Regexp::Expression::UnicodeProperty::Codepoint::PrivateUse < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:105
+class Regexp::Expression::UnicodeProperty::Codepoint::Surrogate < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:107
+class Regexp::Expression::UnicodeProperty::Codepoint::Unassigned < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:112
+class Regexp::Expression::UnicodeProperty::Derived < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:20
+class Regexp::Expression::UnicodeProperty::Digit < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:113
+class Regexp::Expression::UnicodeProperty::Emoji < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:114
+class Regexp::Expression::UnicodeProperty::Enumerated < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:21
+class Regexp::Expression::UnicodeProperty::Graph < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:36
+module Regexp::Expression::UnicodeProperty::Letter; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:39
+class Regexp::Expression::UnicodeProperty::Letter::Any < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:37
+class Regexp::Expression::UnicodeProperty::Letter::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:40
+class Regexp::Expression::UnicodeProperty::Letter::Cased < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:42
+class Regexp::Expression::UnicodeProperty::Letter::Lowercase < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:44
+class Regexp::Expression::UnicodeProperty::Letter::Modifier < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:45
+class Regexp::Expression::UnicodeProperty::Letter::Other < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:43
+class Regexp::Expression::UnicodeProperty::Letter::Titlecase < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:41
+class Regexp::Expression::UnicodeProperty::Letter::Uppercase < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:22
+class Regexp::Expression::UnicodeProperty::Lower < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:48
+module Regexp::Expression::UnicodeProperty::Mark; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:51
+class Regexp::Expression::UnicodeProperty::Mark::Any < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:49
+class Regexp::Expression::UnicodeProperty::Mark::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:52
+class Regexp::Expression::UnicodeProperty::Mark::Combining < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:55
+class Regexp::Expression::UnicodeProperty::Mark::Enclosing < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:53
+class Regexp::Expression::UnicodeProperty::Mark::Nonspacing < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:54
+class Regexp::Expression::UnicodeProperty::Mark::Spacing < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:31
+class Regexp::Expression::UnicodeProperty::Newline < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:58
+module Regexp::Expression::UnicodeProperty::Number; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:61
+class Regexp::Expression::UnicodeProperty::Number::Any < ::Regexp::Expression::UnicodeProperty::Number::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:59
+class Regexp::Expression::UnicodeProperty::Number::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:62
+class Regexp::Expression::UnicodeProperty::Number::Decimal < ::Regexp::Expression::UnicodeProperty::Number::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:63
+class Regexp::Expression::UnicodeProperty::Number::Letter < ::Regexp::Expression::UnicodeProperty::Number::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:64
+class Regexp::Expression::UnicodeProperty::Number::Other < ::Regexp::Expression::UnicodeProperty::Number::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:23
+class Regexp::Expression::UnicodeProperty::Print < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:24
+class Regexp::Expression::UnicodeProperty::Punct < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:67
+module Regexp::Expression::UnicodeProperty::Punctuation; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:70
+class Regexp::Expression::UnicodeProperty::Punctuation::Any < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:68
+class Regexp::Expression::UnicodeProperty::Punctuation::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:74
+class Regexp::Expression::UnicodeProperty::Punctuation::Close < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:71
+class Regexp::Expression::UnicodeProperty::Punctuation::Connector < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:72
+class Regexp::Expression::UnicodeProperty::Punctuation::Dash < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:76
+class Regexp::Expression::UnicodeProperty::Punctuation::Final < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:75
+class Regexp::Expression::UnicodeProperty::Punctuation::Initial < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:73
+class Regexp::Expression::UnicodeProperty::Punctuation::Open < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:77
+class Regexp::Expression::UnicodeProperty::Punctuation::Other < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:115
+class Regexp::Expression::UnicodeProperty::Script < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:80
+module Regexp::Expression::UnicodeProperty::Separator; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:83
+class Regexp::Expression::UnicodeProperty::Separator::Any < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:81
+class Regexp::Expression::UnicodeProperty::Separator::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:85
+class Regexp::Expression::UnicodeProperty::Separator::Line < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:86
+class Regexp::Expression::UnicodeProperty::Separator::Paragraph < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:84
+class Regexp::Expression::UnicodeProperty::Separator::Space < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:25
+class Regexp::Expression::UnicodeProperty::Space < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:89
+module Regexp::Expression::UnicodeProperty::Symbol; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:92
+class Regexp::Expression::UnicodeProperty::Symbol::Any < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:90
+class Regexp::Expression::UnicodeProperty::Symbol::Base < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:94
+class Regexp::Expression::UnicodeProperty::Symbol::Currency < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:93
+class Regexp::Expression::UnicodeProperty::Symbol::Math < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:95
+class Regexp::Expression::UnicodeProperty::Symbol::Modifier < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:96
+class Regexp::Expression::UnicodeProperty::Symbol::Other < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:26
+class Regexp::Expression::UnicodeProperty::Upper < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:27
+class Regexp::Expression::UnicodeProperty::Word < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:29
+class Regexp::Expression::UnicodeProperty::XPosixPunct < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/unicode_property.rb:28
+class Regexp::Expression::UnicodeProperty::Xdigit < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/free_space.rb:13
+class Regexp::Expression::WhiteSpace < ::Regexp::Expression::FreeSpace
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/human_name.rb:44
+ def human_name; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/classes/free_space.rb:14
+ def merge(exp); end
+end
+
+# A very thin wrapper around the scanner that breaks quantified literal runs,
+# collects emitted tokens into an array, calculates their nesting depth, and
+# normalizes tokens for the parser, and checks if they are implemented by the
+# given syntax flavor.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:7
+class Regexp::Lexer
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:73
+ def emit(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:22
+ def lex(input, syntax = T.unsafe(nil), options: T.unsafe(nil), collect_tokens: T.unsafe(nil), &block); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:93
+ def ascend(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def block; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def block=(_arg0); end
+
+ # if a codepoint list is followed by a quantifier, that quantifier applies
+ # to the last codepoint, e.g. /\u{61 62 63}{3}/ =~ 'abccc'
+ # c.f. #break_literal.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:145
+ def break_codepoint_list(token); end
+
+ # called by scan to break a literal run that is longer than one character
+ # into two separate tokens when it is followed by a quantifier
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:125
+ def break_literal(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def collect_tokens; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def collect_tokens=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def conditional_nesting; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def conditional_nesting=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:108
+ def descend(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:164
+ def merge_condition(current, last); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def nesting; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def nesting=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def preprev_token; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def preprev_token=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def prev_token; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def prev_token=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def set_nesting; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def set_nesting=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def shift; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def shift=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def tokens; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:89
+ def tokens=(_arg0); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:18
+ def lex(input, syntax = T.unsafe(nil), options: T.unsafe(nil), collect_tokens: T.unsafe(nil), &block); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:84
+ def scan(input, syntax = T.unsafe(nil), options: T.unsafe(nil), collect_tokens: T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:14
+Regexp::Lexer::CLOSING_TOKENS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:16
+Regexp::Lexer::CONDITION_TOKENS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/lexer.rb:9
+Regexp::Lexer::OPENING_TOKENS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:3
+class Regexp::MatchLength
+ include ::Enumerable
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:11
+ def initialize(exp, opts = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:26
+ def each(opts = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:37
+ def endless_each; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:46
+ def fixed?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:42
+ def include?(length); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:62
+ def inspect; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:54
+ def max; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:50
+ def min; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:58
+ def minmax; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:67
+ def to_re; end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def base_max; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def base_max=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def base_min; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def base_min=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def exp_class; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def exp_class=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def max_rep; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def max_rep=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def min_rep; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def min_rep=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def reify; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:73
+ def reify=(_arg0); end
+
+ # ruby >= 2.4
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:76
+ def test_regexp; end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/expression/methods/match_length.rb:6
+ def of(obj); end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/version.rb:4
+class Regexp::Parser
+ include ::Regexp::Expression
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:27
+ def parse(input, syntax = T.unsafe(nil), options: T.unsafe(nil), &block); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:577
+ def active_opts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:101
+ def anchor(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:264
+ def assign_effective_number(exp); end
+
+ # Assigns referenced expressions to referring expressions, e.g. if there is
+ # an instance of Backreference::Number, its #referenced_expression is set to
+ # the instance of Group::Capture that it refers to via its number.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:584
+ def assign_referenced_expressions; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:229
+ def backref(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:204
+ def captured_group_count_at_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def captured_group_counts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def captured_group_counts=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:573
+ def close_completed_character_set_range; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:212
+ def close_group; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:541
+ def close_set; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:271
+ def conditional(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def conditional_nesting; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def conditional_nesting=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:208
+ def count_captured_group; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:218
+ def decrease_nesting; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:307
+ def escape(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:62
+ def extract_options(input, options); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:352
+ def free_space(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:116
+ def group(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:512
+ def increase_group_level(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:552
+ def intersection(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:363
+ def keep(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:367
+ def literal(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:371
+ def meta(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:537
+ def negate_set; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:301
+ def nest(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:296
+ def nest_conditional(exp); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def nesting; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def nesting=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def node; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def node=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:167
+ def open_group(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:530
+ def open_set(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:132
+ def options_group(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def options_stack; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def options_stack=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:78
+ def parse_token(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:393
+ def posixclass(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:400
+ def property(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:482
+ def quantifier(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:545
+ def range(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def root; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def root=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:382
+ def sequence_operation(klass, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:518
+ def set(token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def switching_options; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:58
+ def switching_options=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:200
+ def total_captured_group_count; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:556
+ def type(token); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:23
+ def parse(input, syntax = T.unsafe(nil), options: T.unsafe(nil), &block); end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:130
+Regexp::Parser::ENC_FLAGS = T.let(T.unsafe(nil), Array)
+
+# base class for all gem-specific errors
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/error.rb:5
+class Regexp::Parser::Error < ::StandardError; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:129
+Regexp::Parser::MOD_FLAGS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:9
+class Regexp::Parser::ParserError < ::Regexp::Parser::Error; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:397
+Regexp::Parser::UP = Regexp::Expression::UnicodeProperty
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:398
+Regexp::Parser::UPTokens = Regexp::Syntax::Token::UnicodeProperty
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:17
+class Regexp::Parser::UnknownTokenError < ::Regexp::Parser::ParserError
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:18
+ def initialize(type, token); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:11
+class Regexp::Parser::UnknownTokenTypeError < ::Regexp::Parser::ParserError
+ # pkg:gem/regexp_parser#lib/regexp_parser/parser.rb:12
+ def initialize(type, token); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/version.rb:5
+Regexp::Parser::VERSION = T.let(T.unsafe(nil), String)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/scanner_error.rb:5
+class Regexp::Scanner
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2509
+ def capturing_group_count; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2509
+ def capturing_group_count=(_arg0); end
+
+ # Emits an array with the details of the scanned pattern
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2484
+ def emit(type, token, text); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2509
+ def literal_run; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2509
+ def literal_run=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:24
+ def scan(input_object, options: T.unsafe(nil), collect_tokens: T.unsafe(nil), &block); end
+
+ private
+
+ # Appends one or more characters to the literal buffer, to be emitted later
+ # by a call to emit_literal.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2555
+ def append_literal(data, ts, te); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def block; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def block=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def char_pos; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def char_pos=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def collect_tokens; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def collect_tokens=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def conditional_stack; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def conditional_stack=(_arg0); end
+
+ # Copy from ts to te from data as text
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2549
+ def copy(data, ts, te); end
+
+ # Emits the literal run collected by calls to the append_literal method.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2560
+ def emit_literal; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2595
+ def emit_meta_control_sequence(data, ts, te, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2566
+ def emit_options(text); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2520
+ def extract_encoding(input_object, options); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def free_spacing; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def free_spacing=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2528
+ def free_spacing?(input_object, options); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def group_depth; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def group_depth=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2540
+ def in_group?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2544
+ def in_set?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def prev_token; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def prev_token=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def regexp_encoding; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def regexp_encoding=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def set_depth; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def set_depth=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def spacing_stack; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def spacing_stack=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def tokens; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2513
+ def tokens=(_arg0); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2469
+ def long_prop_map; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2473
+ def parse_prop_map(name); end
+
+ # Scans the given regular expression text, or Regexp object and collects the
+ # emitted token into an array that gets returned at the end. If a block is
+ # given, it gets called for each emitted token.
+ #
+ # This method may raise errors if a syntax error is encountered.
+ # --------------------------------------------------------------------------
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:20
+ def scan(input_object, options: T.unsafe(nil), collect_tokens: T.unsafe(nil), &block); end
+
+ # lazy-load property maps when first needed
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2465
+ def short_prop_map; end
+ end
+end
+
+# Invalid back reference. Used for name a number refs/calls.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:46
+class Regexp::Scanner::InvalidBackrefError < ::Regexp::Scanner::ValidationError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:47
+ def initialize(what, reason); end
+end
+
+# Invalid group. Used for named groups.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:31
+class Regexp::Scanner::InvalidGroupError < ::Regexp::Scanner::ValidationError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:32
+ def initialize(what, reason); end
+end
+
+# Invalid groupOption. Used for inline options.
+# TODO: should become InvalidGroupOptionError in v3.0.0 for consistency
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:39
+class Regexp::Scanner::InvalidGroupOption < ::Regexp::Scanner::ValidationError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:40
+ def initialize(option, text); end
+end
+
+# Invalid sequence format. Used for escape sequences, mainly.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:24
+class Regexp::Scanner::InvalidSequenceError < ::Regexp::Scanner::ValidationError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:25
+ def initialize(what = T.unsafe(nil), where = T.unsafe(nil)); end
+end
+
+# Use each_with_object for required_ruby_version >= 2.2,or #to_h for >= 2.6
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner.rb:2478
+Regexp::Scanner::POSIX_CLASSES = T.let(T.unsafe(nil), Hash)
+
+# Unexpected end of pattern
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/premature_end_error.rb:5
+class Regexp::Scanner::PrematureEndError < ::Regexp::Scanner::ScannerError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/premature_end_error.rb:6
+ def initialize(where = T.unsafe(nil)); end
+end
+
+# General scanner error (catch all)
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/scanner_error.rb:7
+class Regexp::Scanner::ScannerError < ::Regexp::Parser::Error; end
+
+# The POSIX class name was not recognized by the scanner.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:60
+class Regexp::Scanner::UnknownPosixClassError < ::Regexp::Scanner::ValidationError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:61
+ def initialize(text, _); end
+end
+
+# The property name was not recognized by the scanner.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:53
+class Regexp::Scanner::UnknownUnicodePropertyError < ::Regexp::Scanner::ValidationError
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:54
+ def initialize(name, _); end
+end
+
+# Base for all scanner validation errors
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:5
+class Regexp::Scanner::ValidationError < ::Regexp::Scanner::ScannerError
+ class << self
+ # Centralizes and unifies the handling of validation related errors.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:7
+ def for(type, problem, reason = T.unsafe(nil)); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/scanner/errors/validation_error.rb:11
+ def types; end
+ end
+end
+
+# Define the base module and the simplest of tokens.
+# After loading all the tokens the map is full. Extract all tokens and types
+# into the All and Types constants.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax.rb:5
+module Regexp::Syntax
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:63
+ def comparable(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:46
+ def const_missing(const_name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:53
+ def fallback_version_class(version); end
+
+ # Returns the syntax specification class for the given syntax
+ # version name. The special names 'any' and '*' return Syntax::Any.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:24
+ def for(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:28
+ def new(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:59
+ def specified_versions; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:34
+ def supported?(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:38
+ def version_class(version); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:63
+ def comparable(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:46
+ def const_missing(const_name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:53
+ def fallback_version_class(version); end
+
+ # Returns the syntax specification class for the given syntax
+ # version name. The special names 'any' and '*' return Syntax::Any.
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:24
+ def for(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:28
+ def new(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:59
+ def specified_versions; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:34
+ def supported?(name); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:38
+ def version_class(version); end
+ end
+end
+
+# A syntax that always returns true, passing all tokens as implemented. This
+# is useful during development, testing, and should be useful for some types
+# of transformations as well.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/any.rb:7
+class Regexp::Syntax::Any < ::Regexp::Syntax::Base
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/any.rb:10
+ def implements?(_type, _token); end
+ end
+end
+
+# A lookup map of supported types and tokens in a given syntax
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:11
+class Regexp::Syntax::Base
+ include ::Regexp::Syntax::Token
+
+ # TODO: drop this backwards compatibility code in v3.0.0, do `private :new`
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:101
+ def initialize; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:106
+ def method_missing(name, *args); end
+
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:117
+ def respond_to_missing?(name, include_private = T.unsafe(nil)); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:48
+ def added_features; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:46
+ def check!(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:36
+ def check?(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:28
+ def excludes(type, tokens); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:15
+ def features; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:15
+ def features=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:38
+ def implementations(type); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:23
+ def implements(type, tokens); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:42
+ def implements!(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:33
+ def implements?(type, token); end
+
+ # automatically inherit features through the syntax class hierarchy
+ #
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:18
+ def inherited(subclass); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:56
+ def normalize(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:76
+ def normalize_backref(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:67
+ def normalize_group(type, token); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:52
+ def removed_features; end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions.rb:10
+Regexp::Syntax::CURRENT = Regexp::Syntax::V3_2_0
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:8
+class Regexp::Syntax::InvalidVersionNameError < ::Regexp::Syntax::SyntaxError
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:9
+ def initialize(name); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:4
+class Regexp::Syntax::NotImplementedError < ::Regexp::Syntax::SyntaxError
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/base.rb:5
+ def initialize(syntax, type, token); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax.rb:6
+class Regexp::Syntax::SyntaxError < ::Regexp::Parser::Error; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:5
+module Regexp::Syntax::Token; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:44
+Regexp::Syntax::Token::All = T.let(T.unsafe(nil), Array)
+
+# alias for symmetry between Token::* and Expression::*
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:17
+module Regexp::Syntax::Token::Alternation; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:18
+Regexp::Syntax::Token::Alternation::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:19
+Regexp::Syntax::Token::Alternation::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:5
+module Regexp::Syntax::Token::Anchor; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:11
+Regexp::Syntax::Token::Anchor::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:6
+Regexp::Syntax::Token::Anchor::Basic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:7
+Regexp::Syntax::Token::Anchor::Extended = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:9
+Regexp::Syntax::Token::Anchor::MatchStart = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:8
+Regexp::Syntax::Token::Anchor::String = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/anchor.rb:12
+Regexp::Syntax::Token::Anchor::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/assertion.rb:5
+module Regexp::Syntax::Token::Assertion; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/assertion.rb:9
+Regexp::Syntax::Token::Assertion::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/assertion.rb:6
+Regexp::Syntax::Token::Assertion::Lookahead = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/assertion.rb:7
+Regexp::Syntax::Token::Assertion::Lookbehind = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/assertion.rb:10
+Regexp::Syntax::Token::Assertion::Type = T.let(T.unsafe(nil), Symbol)
+
+# alias for symmetry between token symbol and Expression class name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:33
+Regexp::Syntax::Token::Backref = Regexp::Syntax::Token::Backreference
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:5
+module Regexp::Syntax::Token::Backreference; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:17
+Regexp::Syntax::Token::Backreference::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:9
+Regexp::Syntax::Token::Backreference::Name = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:8
+Regexp::Syntax::Token::Backreference::Number = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:7
+Regexp::Syntax::Token::Backreference::NumberRef = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:6
+Regexp::Syntax::Token::Backreference::Plain = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:11
+Regexp::Syntax::Token::Backreference::RecursionLevel = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:18
+Regexp::Syntax::Token::Backreference::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:13
+Regexp::Syntax::Token::Backreference::V1_8_6 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:15
+Regexp::Syntax::Token::Backreference::V1_9_1 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_set.rb:5
+module Regexp::Syntax::Token::CharacterSet; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_set.rb:9
+Regexp::Syntax::Token::CharacterSet::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_set.rb:6
+Regexp::Syntax::Token::CharacterSet::Basic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_set.rb:7
+Regexp::Syntax::Token::CharacterSet::Extended = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_set.rb:10
+Regexp::Syntax::Token::CharacterSet::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:5
+module Regexp::Syntax::Token::CharacterType; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:12
+Regexp::Syntax::Token::CharacterType::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:6
+Regexp::Syntax::Token::CharacterType::Basic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:10
+Regexp::Syntax::Token::CharacterType::Clustered = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:7
+Regexp::Syntax::Token::CharacterType::Extended = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:8
+Regexp::Syntax::Token::CharacterType::Hex = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_type.rb:13
+Regexp::Syntax::Token::CharacterType::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/conditional.rb:5
+module Regexp::Syntax::Token::Conditional; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/conditional.rb:11
+Regexp::Syntax::Token::Conditional::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/conditional.rb:8
+Regexp::Syntax::Token::Conditional::Condition = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/conditional.rb:6
+Regexp::Syntax::Token::Conditional::Delimiters = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/conditional.rb:9
+Regexp::Syntax::Token::Conditional::Separator = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/conditional.rb:13
+Regexp::Syntax::Token::Conditional::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:5
+module Regexp::Syntax::Token::Escape; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:10
+Regexp::Syntax::Token::Escape::ASCII = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:26
+Regexp::Syntax::Token::Escape::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:6
+Regexp::Syntax::Token::Escape::Basic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:8
+Regexp::Syntax::Token::Escape::Control = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:22
+Regexp::Syntax::Token::Escape::Hex = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:15
+Regexp::Syntax::Token::Escape::Meta = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:24
+Regexp::Syntax::Token::Escape::Octal = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:27
+Regexp::Syntax::Token::Escape::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:13
+Regexp::Syntax::Token::Escape::Unicode = T.let(T.unsafe(nil), Array)
+
+# alias for symmetry between Token::* and Expression::*
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/escape.rb:33
+Regexp::Syntax::Token::EscapeSequence = Regexp::Syntax::Token::Escape
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:13
+module Regexp::Syntax::Token::FreeSpace; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:14
+Regexp::Syntax::Token::FreeSpace::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:15
+Regexp::Syntax::Token::FreeSpace::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:5
+module Regexp::Syntax::Token::Group; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:19
+Regexp::Syntax::Token::Group::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:10
+Regexp::Syntax::Token::Group::Atomic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:6
+Regexp::Syntax::Token::Group::Basic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:12
+Regexp::Syntax::Token::Group::Comment = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:7
+Regexp::Syntax::Token::Group::Extended = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:9
+Regexp::Syntax::Token::Group::Named = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:11
+Regexp::Syntax::Token::Group::Passive = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:20
+Regexp::Syntax::Token::Group::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:14
+Regexp::Syntax::Token::Group::V1_8_6 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/group.rb:17
+Regexp::Syntax::Token::Group::V2_4_1 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/keep.rb:5
+module Regexp::Syntax::Token::Keep; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/keep.rb:8
+Regexp::Syntax::Token::Keep::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/keep.rb:6
+Regexp::Syntax::Token::Keep::Mark = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/keep.rb:9
+Regexp::Syntax::Token::Keep::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:8
+module Regexp::Syntax::Token::Literal; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:9
+Regexp::Syntax::Token::Literal::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:10
+Regexp::Syntax::Token::Literal::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:6
+Regexp::Syntax::Token::Map = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:5
+module Regexp::Syntax::Token::Meta; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:10
+Regexp::Syntax::Token::Meta::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:7
+Regexp::Syntax::Token::Meta::Alternation = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:6
+Regexp::Syntax::Token::Meta::Basic = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:8
+Regexp::Syntax::Token::Meta::Extended = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/meta.rb:11
+Regexp::Syntax::Token::Meta::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/posix_class.rb:5
+module Regexp::Syntax::Token::PosixClass; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/posix_class.rb:11
+Regexp::Syntax::Token::PosixClass::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/posix_class.rb:9
+Regexp::Syntax::Token::PosixClass::Extensions = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/posix_class.rb:13
+Regexp::Syntax::Token::PosixClass::NonType = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/posix_class.rb:6
+Regexp::Syntax::Token::PosixClass::Standard = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/posix_class.rb:12
+Regexp::Syntax::Token::PosixClass::Type = T.let(T.unsafe(nil), Symbol)
+
+# alias for symmetry between token symbol and Token module name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:809
+Regexp::Syntax::Token::Property = Regexp::Syntax::Token::UnicodeProperty
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:5
+module Regexp::Syntax::Token::Quantifier; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:31
+Regexp::Syntax::Token::Quantifier::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:6
+Regexp::Syntax::Token::Quantifier::Greedy = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:24
+Regexp::Syntax::Token::Quantifier::Interval = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:28
+Regexp::Syntax::Token::Quantifier::IntervalAll = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:26
+Regexp::Syntax::Token::Quantifier::IntervalPossessive = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:25
+Regexp::Syntax::Token::Quantifier::IntervalReluctant = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:18
+Regexp::Syntax::Token::Quantifier::Possessive = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:12
+Regexp::Syntax::Token::Quantifier::Reluctant = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:32
+Regexp::Syntax::Token::Quantifier::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/quantifier.rb:30
+Regexp::Syntax::Token::Quantifier::V1_8_6 = T.let(T.unsafe(nil), Array)
+
+# alias for symmetry between token symbol and Token module name
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/character_set.rb:16
+Regexp::Syntax::Token::Set = Regexp::Syntax::Token::CharacterSet
+
+# Type is the same as Backreference so keeping it here, for now.
+#
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:22
+module Regexp::Syntax::Token::SubexpressionCall; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:26
+Regexp::Syntax::Token::SubexpressionCall::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:23
+Regexp::Syntax::Token::SubexpressionCall::Name = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/backreference.rb:24
+Regexp::Syntax::Token::SubexpressionCall::Number = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token.rb:45
+Regexp::Syntax::Token::Types = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:5
+module Regexp::Syntax::Token::UnicodeProperty
+ class << self
+ private
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:6
+ def all(name); end
+ end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:73
+Regexp::Syntax::Token::UnicodeProperty::Age = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:45
+Regexp::Syntax::Token::UnicodeProperty::Age_V1_9_3 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:49
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:51
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:53
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_3_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:55
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:57
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:59
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_6_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:61
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_6_2 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:63
+Regexp::Syntax::Token::UnicodeProperty::Age_V2_6_3 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:65
+Regexp::Syntax::Token::UnicodeProperty::Age_V3_1_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:67
+Regexp::Syntax::Token::UnicodeProperty::Age_V3_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:69
+Regexp::Syntax::Token::UnicodeProperty::Age_V3_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:71
+Regexp::Syntax::Token::UnicodeProperty::Age_V4_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:799
+Regexp::Syntax::Token::UnicodeProperty::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:18
+module Regexp::Syntax::Token::UnicodeProperty::Category; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:41
+Regexp::Syntax::Token::UnicodeProperty::Category::All = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:38
+Regexp::Syntax::Token::UnicodeProperty::Category::Codepoint = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:19
+Regexp::Syntax::Token::UnicodeProperty::Category::Letter = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:22
+Regexp::Syntax::Token::UnicodeProperty::Category::Mark = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:25
+Regexp::Syntax::Token::UnicodeProperty::Category::Number = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:28
+Regexp::Syntax::Token::UnicodeProperty::Category::Punctuation = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:35
+Regexp::Syntax::Token::UnicodeProperty::Category::Separator = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:32
+Regexp::Syntax::Token::UnicodeProperty::Category::Symbol = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:11
+Regexp::Syntax::Token::UnicodeProperty::CharType_V1_9_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:14
+Regexp::Syntax::Token::UnicodeProperty::CharType_V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:152
+Regexp::Syntax::Token::UnicodeProperty::Derived = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:75
+Regexp::Syntax::Token::UnicodeProperty::Derived_V1_9_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:129
+Regexp::Syntax::Token::UnicodeProperty::Derived_V2_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:134
+Regexp::Syntax::Token::UnicodeProperty::Derived_V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:138
+Regexp::Syntax::Token::UnicodeProperty::Derived_V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:142
+Regexp::Syntax::Token::UnicodeProperty::Derived_V3_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:148
+Regexp::Syntax::Token::UnicodeProperty::Derived_V4_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:782
+Regexp::Syntax::Token::UnicodeProperty::Emoji = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:752
+Regexp::Syntax::Token::UnicodeProperty::Emoji_V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:760
+Regexp::Syntax::Token::UnicodeProperty::Emoji_V2_6_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:780
+Regexp::Syntax::Token::UnicodeProperty::Enumerated = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:764
+Regexp::Syntax::Token::UnicodeProperty::Enumerated_V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:802
+Regexp::Syntax::Token::UnicodeProperty::NonType = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:16
+Regexp::Syntax::Token::UnicodeProperty::POSIX = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:365
+Regexp::Syntax::Token::UnicodeProperty::Script = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:154
+Regexp::Syntax::Token::UnicodeProperty::Script_V1_9_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:250
+Regexp::Syntax::Token::UnicodeProperty::Script_V1_9_3 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:256
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:266
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:292
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_3_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:301
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:310
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:317
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_6_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:327
+Regexp::Syntax::Token::UnicodeProperty::Script_V2_6_2 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:334
+Regexp::Syntax::Token::UnicodeProperty::Script_V3_1_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:341
+Regexp::Syntax::Token::UnicodeProperty::Script_V3_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:351
+Regexp::Syntax::Token::UnicodeProperty::Script_V4_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:801
+Regexp::Syntax::Token::UnicodeProperty::Type = T.let(T.unsafe(nil), Symbol)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:750
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:367
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V1_9_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:466
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:594
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:629
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_3_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:642
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:656
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:666
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_6_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:680
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V2_6_2 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:692
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V3_1_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:703
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V3_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:725
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V3_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:729
+Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V4_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:784
+Regexp::Syntax::Token::UnicodeProperty::V1_9_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:785
+Regexp::Syntax::Token::UnicodeProperty::V1_9_3 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:786
+Regexp::Syntax::Token::UnicodeProperty::V2_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:787
+Regexp::Syntax::Token::UnicodeProperty::V2_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:788
+Regexp::Syntax::Token::UnicodeProperty::V2_3_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:789
+Regexp::Syntax::Token::UnicodeProperty::V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:790
+Regexp::Syntax::Token::UnicodeProperty::V2_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:791
+Regexp::Syntax::Token::UnicodeProperty::V2_6_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:792
+Regexp::Syntax::Token::UnicodeProperty::V2_6_2 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:793
+Regexp::Syntax::Token::UnicodeProperty::V2_6_3 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:794
+Regexp::Syntax::Token::UnicodeProperty::V3_1_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:795
+Regexp::Syntax::Token::UnicodeProperty::V3_2_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:796
+Regexp::Syntax::Token::UnicodeProperty::V3_5_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/token/unicode_property.rb:797
+Regexp::Syntax::Token::UnicodeProperty::V4_0_0 = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:14
+class Regexp::Syntax::UnknownSyntaxNameError < ::Regexp::Syntax::SyntaxError
+ # pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:15
+ def initialize(name); end
+end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/1.8.6.rb:3
+class Regexp::Syntax::V1_8_6 < ::Regexp::Syntax::Base; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/1.9.1.rb:3
+class Regexp::Syntax::V1_9_1 < ::Regexp::Syntax::V1_8_6; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/1.9.3.rb:3
+class Regexp::Syntax::V1_9_3 < ::Regexp::Syntax::V1_9_1; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.0.0.rb:3
+class Regexp::Syntax::V2_0_0 < ::Regexp::Syntax::V1_9_3; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.2.0.rb:3
+class Regexp::Syntax::V2_2_0 < ::Regexp::Syntax::V2_0_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.3.0.rb:3
+class Regexp::Syntax::V2_3_0 < ::Regexp::Syntax::V2_2_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.4.0.rb:3
+class Regexp::Syntax::V2_4_0 < ::Regexp::Syntax::V2_3_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.4.1.rb:3
+class Regexp::Syntax::V2_4_1 < ::Regexp::Syntax::V2_4_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.5.0.rb:3
+class Regexp::Syntax::V2_5_0 < ::Regexp::Syntax::V2_4_1; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.6.0.rb:3
+class Regexp::Syntax::V2_6_0 < ::Regexp::Syntax::V2_5_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.6.2.rb:3
+class Regexp::Syntax::V2_6_2 < ::Regexp::Syntax::V2_6_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/2.6.3.rb:3
+class Regexp::Syntax::V2_6_3 < ::Regexp::Syntax::V2_6_2; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/3.1.0.rb:3
+class Regexp::Syntax::V3_1_0 < ::Regexp::Syntax::V2_6_3; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/3.2.0.rb:3
+class Regexp::Syntax::V3_2_0 < ::Regexp::Syntax::V3_1_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/3.5.0.rb:1
+class Regexp::Syntax::V3_5_0 < ::Regexp::Syntax::V3_2_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/versions/4.0.0.rb:1
+class Regexp::Syntax::V4_0_0 < ::Regexp::Syntax::V3_5_0; end
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:6
+Regexp::Syntax::VERSION_CONST_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:4
+Regexp::Syntax::VERSION_FORMAT = T.let(T.unsafe(nil), String)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/syntax/version_lookup.rb:5
+Regexp::Syntax::VERSION_REGEXP = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/token.rb:4
+Regexp::TOKEN_KEYS = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+class Regexp::Token < ::Struct
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def conditional_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def conditional_level=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:22
+ def length; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def level=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:16
+ def next; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:16
+ def next=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:18
+ def offset; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:16
+ def previous; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:16
+ def previous=(_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def set_level; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def set_level=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def te; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def te=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def text; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def text=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def token; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def token=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def ts; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def ts=(_); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def type; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def type=(_); end
+
+ class << self
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def [](*_arg0); end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def inspect; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def keyword_init?; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def members; end
+
+ # pkg:gem/regexp_parser#lib/regexp_parser/token.rb:15
+ def new(*_arg0); end
+ end
+end
diff --git a/sorbet/rbi/gems/require-hooks@0.4.1.rbi b/sorbet/rbi/gems/require-hooks@0.4.1.rbi
new file mode 100644
index 0000000..1e536b2
--- /dev/null
+++ b/sorbet/rbi/gems/require-hooks@0.4.1.rbi
@@ -0,0 +1,152 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `require-hooks` gem.
+# Please instead update this file by running `bin/tapioca gem require-hooks`.
+
+
+# pkg:gem/require-hooks#lib/require-hooks/api.rb:3
+module RequireHooks
+ class << self
+ # Define a block to wrap the code loading.
+ # The return value MUST be a result of calling the passed block.
+ # For example, you can use such hooks for instrumentation, debugging purposes.
+ #
+ # RequireHooks.around_load do |path, &block|
+ # puts "Loading #{path}"
+ # block.call.tap { puts "Loaded #{path}" }
+ # end
+ #
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:103
+ def around_load(patterns: T.unsafe(nil), exclude_patterns: T.unsafe(nil), &block); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:139
+ def context_for(path); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:168
+ def contexts; end
+
+ # This hook should be used to manually compile byte code to be loaded by the VM.
+ # The arguments are (path, source = nil), where source is only defined if transformations took place.
+ # Otherwise, you MUST read the source code from the file yourself.
+ #
+ # The return value MUST be either nil (continue to the next hook or default behavior) or a platform-specific bytecode object (e.g., RubyVM::InstructionSequence).
+ #
+ # RequireHooks.hijack_load do |path, source|
+ # source ||= File.read(path)
+ # if defined?(RubyVM::InstructionSequence)
+ # RubyVM::InstructionSequence.compile(source)
+ # elsif defined?(JRUBY_VERSION)
+ # JRuby.compile(source)
+ # end
+ # end
+ #
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:135
+ def hijack_load(patterns: T.unsafe(nil), exclude_patterns: T.unsafe(nil), &block); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:93
+ def print_warnings; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:93
+ def print_warnings=(_arg0); end
+
+ # Hack to enable coverage for hooked files.
+ # Requires eval coverage to be on.
+ # See https://bugs.ruby-lang.org/issues/22018 (https://github.com/ruby/ruby/pull/16805)
+ #
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:160
+ def setup_path_coverage(path, contents = T.unsafe(nil)); end
+
+ # Define hooks to perform source-to-source transformations.
+ # The return value MUST be either String (new source code) or nil (indicating that no transformations were performed).
+ #
+ # NOTE: The second argument (`source`) MAY be nil, indicating that no transformer tried to transform the source code.
+ #
+ #
+ # RequireHooks.source_transform do |path, source|
+ # end
+ #
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:117
+ def source_transform(patterns: T.unsafe(nil), exclude_patterns: T.unsafe(nil), &block); end
+
+ private
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:184
+ def eval_coverage_enabled?; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:174
+ def register_hook(type, block, patterns: T.unsafe(nil), exclude_patterns: T.unsafe(nil)); end
+ end
+end
+
+# pkg:gem/require-hooks#lib/require-hooks/api.rb:4
+class RequireHooks::Context
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:8
+ def initialize(patterns: T.unsafe(nil), exclude_patterns: T.unsafe(nil)); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:5
+ def around_load; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:30
+ def empty?; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:5
+ def exclude_patterns; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:45
+ def hijack?; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:5
+ def hijack_load; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:24
+ def match?(path); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:81
+ def merge!(another_ctx); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:5
+ def patterns; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:59
+ def perform_source_transform(path); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:35
+ def readonly?; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:49
+ def run_around_load_callbacks(path); end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:5
+ def source_transform; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:41
+ def source_transform?; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:20
+ def to_key; end
+
+ # pkg:gem/require-hooks#lib/require-hooks/api.rb:71
+ def try_hijack_load(path, source); end
+end
+
+# pkg:gem/require-hooks#lib/require-hooks/mode/load_iseq.rb:6
+RequireHooks::EMPTY_ISEQ = T.let(T.unsafe(nil), RubyVM::InstructionSequence)
+
+# pkg:gem/require-hooks#lib/require-hooks/iseq.rb:4
+module RequireHooks::Iseq
+ class << self
+ # pkg:gem/require-hooks#lib/require-hooks/iseq.rb:6
+ def compile_with_coverage(ctx, path); end
+ end
+end
+
+# pkg:gem/require-hooks#lib/require-hooks/mode/load_iseq.rb:8
+module RequireHooks::LoadIseq
+ # pkg:gem/require-hooks#lib/require-hooks/mode/load_iseq.rb:9
+ def load_iseq(path); end
+end
+
+class RubyVM::InstructionSequence
+ extend ::RequireHooks::LoadIseq
+end
diff --git a/sorbet/rbi/gems/rspec-core@3.13.6.rbi b/sorbet/rbi/gems/rspec-core@3.13.6.rbi
new file mode 100644
index 0000000..c9ceeda
--- /dev/null
+++ b/sorbet/rbi/gems/rspec-core@3.13.6.rbi
@@ -0,0 +1,9720 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `rspec-core` gem.
+# Please instead update this file by running `bin/tapioca gem rspec-core`.
+
+
+# Namespace for all core RSpec code.
+# This is borrowed (slightly modified) from Scott Taylor's
+# project_path project:
+# http://github.com/smtlaissezfaire/project_path
+#
+# pkg:gem/rspec-core#lib/rspec/core/version.rb:1
+module RSpec
+ extend ::RSpec::Core::Warnings
+
+ class << self
+ # Used to ensure examples get reloaded between multiple runs in the same
+ # process and ensures user configuration is persisted.
+ #
+ # Users must invoke this if they want to clear all examples but preserve
+ # current configuration when they use the runner multiple times within the
+ # same process.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:70
+ def clear_examples; end
+
+ # Returns the global [Configuration](RSpec/Core/Configuration) object. While
+ # you _can_ use this method to access the configuration, the more common
+ # convention is to use [RSpec.configure](RSpec#configure-class_method).
+ #
+ # @example
+ # RSpec.configuration.drb_port = 1234
+ # @see RSpec.configure
+ # @see Core::Configuration
+ # Setters for shared global objects
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:85
+ def configuration; end
+
+ # Returns the global [Configuration](RSpec/Core/Configuration) object. While
+ # you _can_ use this method to access the configuration, the more common
+ # convention is to use [RSpec.configure](RSpec#configure-class_method).
+ #
+ # @example
+ # RSpec.configuration.drb_port = 1234
+ # @see RSpec.configure
+ # @see Core::Configuration
+ # Setters for shared global objects
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:49
+ def configuration=(_arg0); end
+
+ # Yields the global configuration to a block.
+ # @yield [Configuration] global configuration
+ #
+ # @example
+ # RSpec.configure do |config|
+ # config.add_formatter 'documentation'
+ # end
+ # @see Core::Configuration
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:97
+ def configure; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:194
+ def const_missing(name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def context(*args, &example_group_block); end
+
+ # The example being executed.
+ #
+ # The primary audience for this method is library authors who need access
+ # to the example currently being executed and also want to support all
+ # versions of RSpec 2 and 3.
+ #
+ # @example
+ #
+ # RSpec.configure do |c|
+ # # context.example is deprecated, but RSpec.current_example is not
+ # # available until RSpec 3.0.
+ # fetch_current_example = RSpec.respond_to?(:current_example) ?
+ # proc { RSpec.current_example } : proc { |context| context.example }
+ #
+ # c.before(:example) do
+ # example = fetch_current_example.call(self)
+ #
+ # # ...
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:122
+ def current_example; end
+
+ # Set the current example being executed.
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:128
+ def current_example=(example); end
+
+ # Get the current RSpec execution scope
+ #
+ # Returns (in order of lifecycle):
+ # * `:suite` as an initial value, this is outside of the test lifecycle.
+ # * `:before_suite_hook` during `before(:suite)` hooks.
+ # * `:before_context_hook` during `before(:context)` hooks.
+ # * `:before_example_hook` during `before(:example)` hooks and `around(:example)` before `example.run`.
+ # * `:example` within the example run.
+ # * `:after_example_hook` during `after(:example)` hooks and `around(:example)` after `example.run`.
+ # * `:after_context_hook` during `after(:context)` hooks.
+ # * `:after_suite_hook` during `after(:suite)` hooks.
+ # * `:suite` as a final value, again this is outside of the test lifecycle.
+ #
+ # Reminder, `:context` hooks have `:all` alias and `:example` hooks have `:each` alias.
+ # @return [Symbol]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:154
+ def current_scope; end
+
+ # Set the current scope rspec is executing in
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:134
+ def current_scope=(scope); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def describe(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def example_group(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def fcontext(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def fdescribe(*args, &example_group_block); end
+
+ # Used to ensure examples get reloaded and user configuration gets reset to
+ # defaults between multiple runs in the same process.
+ #
+ # Users must invoke this if they want to have the configuration reset when
+ # they use the runner multiple times within the same process. Users must deal
+ # themselves with re-configuration of RSpec before run.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:58
+ def reset; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/shared_example_group.rb:113
+ def shared_context(name, *args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/shared_example_group.rb:110
+ def shared_examples(name, *args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/shared_example_group.rb:114
+ def shared_examples_for(name, *args, &block); end
+
+ # @private
+ # Internal container for global non-configuration data.
+ # Setters for shared global objects
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:160
+ def world; end
+
+ # @private
+ # Internal container for global non-configuration data.
+ # Setters for shared global objects
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:49
+ def world=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def xcontext(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:279
+ def xdescribe(*args, &example_group_block); end
+ end
+end
+
+# Namespace for the rspec-core code.
+#
+# pkg:gem/rspec-core#lib/rspec/core/version.rb:2
+module RSpec::Core
+ class << self
+ # @private path to executable file.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core.rb:181
+ def path_to_executable; end
+ end
+end
+
+# @private
+# Unnamed example group used by `SuiteHookContext`.
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_group.rb:782
+class RSpec::Core::AnonymousExampleGroup < ::RSpec::Core::ExampleGroup
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:783
+ def metadata; end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:4
+class RSpec::Core::BacktraceFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:8
+ def initialize; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:49
+ def backtrace_line(line); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:53
+ def exclude?(line); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:6
+ def exclusion_patterns; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:6
+ def exclusion_patterns=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:28
+ def filter_gem(gem_name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:33
+ def format_backtrace(backtrace, options = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:22
+ def full_backtrace=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:24
+ def full_backtrace?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:6
+ def inclusion_patterns; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:6
+ def inclusion_patterns=(_arg0); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/backtrace_formatter.rb:60
+ def matches?(patterns, line); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:3
+module RSpec::Core::Bisect; end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:8
+class RSpec::Core::Bisect::BisectFailedError < ::StandardError
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:9
+ def for_failed_spec_run(spec_output); end
+ end
+end
+
+# Wraps a pipe to support sending objects between a child and
+# parent process. Where supported, encoding is explicitly
+# set to ensure binary data is able to pass from child to
+# parent.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:36
+class RSpec::Core::Bisect::Channel
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:41
+ def initialize; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:62
+ def close; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:56
+ def receive; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:50
+ def send(message); end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:38
+RSpec::Core::Bisect::Channel::MARSHAL_DUMP_ENCODING = T.let(T.unsafe(nil), Encoding)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+class RSpec::Core::Bisect::ExampleSetDescriptor < ::Struct
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def all_example_ids; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def all_example_ids=(_); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def failed_example_ids; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def failed_example_ids=(_); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def [](*_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def inspect; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def keyword_init?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def members; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:5
+ def new(*_arg0); end
+ end
+end
+
+# Wraps a `formatter` providing a simple means to notify it in place
+# of an `RSpec::Core::Reporter`, without involving configuration in
+# any way.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:19
+class RSpec::Core::Bisect::Notifier
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:20
+ def initialize(formatter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/bisect/utilities.rb:24
+ def publish(event, *args); end
+end
+
+# Stores runtime configuration information.
+#
+# Configuration options are loaded from multiple files and joined together
+# with command-line switches and the `SPEC_OPTS` environment variable.
+#
+# Precedence order (where later entries overwrite earlier entries on
+# conflicts):
+#
+# * Global (`$XDG_CONFIG_HOME/rspec/options`, or `~/.rspec` if it does
+# not exist)
+# * Project-specific (`./.rspec`)
+# * Local (`./.rspec-local`)
+# * Command-line options
+# * `SPEC_OPTS`
+#
+# For example, an option set in the local file will override an option set
+# in your global file.
+#
+# The global, project-specific and local files can all be overridden with a
+# separate custom file using the --options command-line parameter.
+#
+# @example Standard settings
+# RSpec.configure do |c|
+# c.drb = true
+# c.drb_port = 1234
+# c.default_path = 'behavior'
+# end
+#
+# @example Hooks
+# RSpec.configure do |c|
+# c.before(:suite) { establish_connection }
+# c.before(:example) { log_in_as :authorized }
+# c.around(:example) { |ex| Database.transaction(&ex) }
+# end
+#
+# @see RSpec.configure
+# @see Hooks
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:47
+class RSpec::Core::Configuration
+ include ::RSpec::Core::Hooks
+ include ::RSpec::Core::Configuration::Readers
+
+ # Build an object to store runtime configuration options and set defaults
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:528
+ def initialize; end
+
+ # @overload add_formatter(formatter)
+ # @overload add_formatter(formatter, output)
+ #
+ # @param formatter [Class, String, Object] formatter to use. Can be any of the
+ # string values supported from the CLI (`p`/`progress`,
+ # `d`/`doc`/`documentation`, `h`/`html`, or `j`/`json`), any
+ # class that implements the formatter protocol and has registered
+ # itself with RSpec as a formatter, or a formatter instance.
+ # @param output [String, IO] where the formatter will write its output.
+ # Can be an IO object or a string path to a file. If not provided,
+ # the configured `output_stream` (`$stdout`, by default) will be used.
+ #
+ # Adds a formatter to the set RSpec will use for this run.
+ #
+ # @see RSpec::Core::Formatters::Protocol
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:996
+ def add_formatter(formatter, output = T.unsafe(nil)); end
+
+ # @overload add_setting(name)
+ # @overload add_setting(name, opts)
+ # @option opts [Symbol] :default
+ #
+ # Set a default value for the generated getter and predicate methods:
+ #
+ # add_setting(:foo, :default => "default value")
+ #
+ # @option opts [Symbol] :alias_with
+ #
+ # Use `:alias_with` to alias the setter, getter, and predicate to
+ # another name, or names:
+ #
+ # add_setting(:foo, :alias_with => :bar)
+ # add_setting(:foo, :alias_with => [:bar, :baz])
+ #
+ # Adds a custom setting to the RSpec.configuration object.
+ #
+ # RSpec.configuration.add_setting :foo
+ #
+ # Used internally and by extension frameworks like rspec-rails, so they
+ # can add config settings that are domain specific. For example:
+ #
+ # RSpec.configure do |c|
+ # c.add_setting :use_transactional_fixtures,
+ # :default => true,
+ # :alias_with => :use_transactional_examples
+ # end
+ #
+ # `add_setting` creates three methods on the configuration object, a
+ # setter, a getter, and a predicate:
+ #
+ # RSpec.configuration.foo=(value)
+ # RSpec.configuration.foo
+ # RSpec.configuration.foo? # Returns true if foo returns anything but nil or false.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:659
+ def add_setting(name, opts = T.unsafe(nil)); end
+
+ # Defines a `after` hook. See {Hooks#after} for full docs.
+ #
+ # This method differs from {Hooks#after} in only one way: it supports
+ # the `:suite` scope. Hooks with the `:suite` scope will be run once after
+ # the last example of the entire suite is executed. Conditions passed along
+ # with `:suite` are effectively ignored.
+ #
+ # @see #append_after
+ # @see #before
+ # @see #prepend_before
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2031
+ def after(scope = T.unsafe(nil), *meta, &block); end
+
+ # Creates a method that defines an example group with the provided
+ # metadata. Can be used to define example group/metadata shortcuts.
+ #
+ # @example
+ # RSpec.configure do |config|
+ # config.alias_example_group_to :describe_model, :type => :model
+ # end
+ #
+ # shared_context_for "model tests", :type => :model do
+ # # define common model test helper methods, `let` declarations, etc
+ # end
+ #
+ # # This lets you do this:
+ #
+ # RSpec.describe_model User do
+ # end
+ #
+ # # ... which is the equivalent of
+ #
+ # RSpec.describe User, :type => :model do
+ # end
+ #
+ # @note The defined aliased will also be added to the top level
+ # (e.g. `main` and from within modules) if
+ # `expose_dsl_globally` is set to true.
+ # @see #alias_example_to
+ # @see #expose_dsl_globally=
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1209
+ def alias_example_group_to(new_name, *args); end
+
+ # Creates a method that delegates to `example` including the submitted
+ # `args`. Used internally to add variants of `example` like `pending`:
+ # @param name [String] example name alias
+ # @param args [Array, Hash] metadata for the generated example
+ #
+ # @note The specific example alias below (`pending`) is already
+ # defined for you.
+ # @note Use with caution. This extends the language used in your
+ # specs, but does not add any additional documentation. We use this
+ # in RSpec to define methods like `focus` and `xit`, but we also add
+ # docs for those methods.
+ #
+ # @example
+ # RSpec.configure do |config|
+ # config.alias_example_to :pending, :pending => true
+ # end
+ #
+ # # This lets you do this:
+ #
+ # RSpec.describe Thing do
+ # pending "does something" do
+ # thing = Thing.new
+ # end
+ # end
+ #
+ # # ... which is the equivalent of
+ #
+ # RSpec.describe Thing do
+ # it "does something", :pending => true do
+ # thing = Thing.new
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1177
+ def alias_example_to(name, *args); end
+
+ # Define an alias for it_should_behave_like that allows different
+ # language (like "it_has_behavior" or "it_behaves_like") to be
+ # employed when including shared examples.
+ #
+ # @example
+ # RSpec.configure do |config|
+ # config.alias_it_behaves_like_to(:it_has_behavior, 'has behavior:')
+ # end
+ #
+ # # allows the user to include a shared example group like:
+ #
+ # RSpec.describe Entity do
+ # it_has_behavior 'sortability' do
+ # let(:sortable) { Entity.new }
+ # end
+ # end
+ #
+ # # which is reported in the output as:
+ # # Entity
+ # # has behavior: sortability
+ # # ...sortability examples here
+ #
+ # @note Use with caution. This extends the language used in your
+ # specs, but does not add any additional documentation. We use this
+ # in RSpec to define `it_should_behave_like` (for backward
+ # compatibility), but we also add docs for that method.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1240
+ def alias_it_behaves_like_to(new_name, report_label = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1243
+ def alias_it_should_behave_like_to(new_name, report_label = T.unsafe(nil)); end
+
+ # Adds `block` to the end of the list of `after` blocks in the same
+ # scope (`:example`, `:context`, or `:suite`), in contrast to {#after},
+ # which adds the hook to the start of the list.
+ #
+ # See {Hooks#after} for full `after` hook docs.
+ #
+ # This method differs from {Hooks#append_after} in only one way: it supports
+ # the `:suite` scope. Hooks with the `:suite` scope will be run once after
+ # the last example of the entire suite is executed. Conditions passed along
+ # with `:suite` are effectively ignored.
+ #
+ # @see #append_after
+ # @see #before
+ # @see #prepend_before
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2061
+ def append_after(scope = T.unsafe(nil), *meta, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1990
+ def append_before(scope = T.unsafe(nil), *meta, &block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1941
+ def apply_derived_metadata_to(metadata); end
+
+ # Registers `block` as an `around` hook.
+ #
+ # See {Hooks#around} for full `around` hook docs.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2079
+ def around(scope = T.unsafe(nil), *meta, &block); end
+
+ # Regexps used to exclude lines from backtraces.
+ #
+ # Excludes lines from ruby (and jruby) source, installed gems, anything
+ # in any "bin" directory, and any of the RSpec libs (outside gem
+ # installs) by default.
+ #
+ # You can modify the list via the getter, or replace it with the setter.
+ #
+ # To override this behaviour and display a full backtrace, use
+ # `--backtrace` on the command line, in a `.rspec` file, or in the
+ # `rspec_options` attribute of RSpec's rake task.
+ # @return [Array]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:697
+ def backtrace_exclusion_patterns; end
+
+ # Set regular expressions used to exclude lines in backtrace.
+ # @param patterns [Array] set backtrace_formatter exclusion_patterns
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:703
+ def backtrace_exclusion_patterns=(patterns); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:522
+ def backtrace_formatter; end
+
+ # Regexps used to include lines in backtraces.
+ #
+ # Defaults to [Regexp.new Dir.getwd].
+ #
+ # Lines that match an exclusion _and_ an inclusion pattern
+ # will be included.
+ #
+ # You can modify the list via the getter, or replace it with the setter.
+ # @return [Array]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:716
+ def backtrace_inclusion_patterns; end
+
+ # Set regular expressions used to include lines in backtrace.
+ # @attr patterns [Array] set backtrace_formatter inclusion_patterns
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:722
+ def backtrace_inclusion_patterns=(patterns); end
+
+ # Defines a `before` hook. See {Hooks#before} for full docs.
+ #
+ # This method differs from {Hooks#before} in only one way: it supports
+ # the `:suite` scope. Hooks with the `:suite` scope will be run once before
+ # the first example of the entire suite is executed. Conditions passed along
+ # with `:suite` are effectively ignored.
+ #
+ # @see #prepend_before
+ # @see #after
+ # @see #append_after
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1976
+ def before(scope = T.unsafe(nil), *meta, &block); end
+
+ # Determines which bisect runner implementation gets used to run subsets
+ # of the suite during a bisection. Your choices are:
+ #
+ # - `:shell`: Performs a spec run by shelling out, booting RSpec and your
+ # application environment each time. This runner is the most widely
+ # compatible runner, but is not as fast. On platforms that do not
+ # support forking, this is the default.
+ # - `:fork`: Pre-boots RSpec and your application environment in a parent
+ # process, and then forks a child process for each spec run. This runner
+ # tends to be significantly faster than the `:shell` runner but cannot
+ # be used in some situations. On platforms that support forking, this
+ # is the default. If you use this runner, you should ensure that all
+ # of your one-time setup logic goes in a `before(:suite)` hook instead
+ # of getting run at the top-level of a file loaded by `--require`.
+ #
+ # @note This option will only be used by `--bisect` if you set it in a file
+ # loaded via `--require`.
+ #
+ # @return [Symbol]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:499
+ def bisect_runner; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:500
+ def bisect_runner=(value); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2125
+ def bisect_runner_class; end
+
+ # Enables color output if the output is a TTY. As of RSpec 3.6, this is
+ # the default behavior and this option is retained only for backwards
+ # compatibility.
+ #
+ # @deprecated No longer recommended because of complex behavior. Instead,
+ # rely on the fact that TTYs will display color by default, or set
+ # {#color_mode} to :on to display color on a non-TTY output.
+ # @see color_mode
+ # @see color_enabled?
+ # @return [Boolean]
+ # Toggle output color.
+ #
+ # @deprecated No longer recommended because of complex behavior. Instead,
+ # rely on the fact that TTYs will display color by default, or set
+ # {:color_mode} to :on to display color on a non-TTY output.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:922
+ def color; end
+
+ # Enables color output if the output is a TTY. As of RSpec 3.6, this is
+ # the default behavior and this option is retained only for backwards
+ # compatibility.
+ #
+ # @deprecated No longer recommended because of complex behavior. Instead,
+ # rely on the fact that TTYs will display color by default, or set
+ # {#color_mode} to :on to display color on a non-TTY output.
+ # @see color_mode
+ # @see color_enabled?
+ # @return [Boolean]
+ # Toggle output color.
+ #
+ # @deprecated No longer recommended because of complex behavior. Instead,
+ # rely on the fact that TTYs will display color by default, or set
+ # {:color_mode} to :on to display color on a non-TTY output.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:960
+ def color=(_arg0); end
+
+ # Check if color is enabled for a particular output.
+ # @param output [IO] an output stream to use, defaults to the current
+ # `output_stream`
+ # @return [Boolean]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:943
+ def color_enabled?(output = T.unsafe(nil)); end
+
+ # The mode for determining whether to display output in color. One of:
+ #
+ # - :automatic - the output will be in color if the output is a TTY (the
+ # default)
+ # - :on - the output will be in color, whether or not the output is a TTY
+ # - :off - the output will not be in color
+ #
+ # @see color_enabled?
+ # @return [Boolean]
+ # Set the color mode.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:935
+ def color_mode; end
+
+ # The mode for determining whether to display output in color. One of:
+ #
+ # - :automatic - the output will be in color if the output is a TTY (the
+ # default)
+ # - :on - the output will be in color, whether or not the output is a TTY
+ # - :off - the output will not be in color
+ #
+ # @see color_enabled?
+ # @return [Boolean]
+ # Set the color mode.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:953
+ def color_mode=(_arg0); end
+
+ # @private
+ #
+ # Used internally to extend the singleton class of a single example's
+ # example group instance with modules using `include` and/or `extend`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1580
+ def configure_example(example, example_hooks); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1622
+ def configure_expectation_framework; end
+
+ # @private
+ #
+ # Used internally to extend a group with modules using `include`, `prepend` and/or
+ # `extend`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1568
+ def configure_group(group); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1616
+ def configure_mock_framework; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def default_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def default_color=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def default_color?; end
+
+ # The formatter that will be used if no formatter has been set.
+ # Defaults to 'progress'.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1003
+ def default_formatter; end
+
+ # Sets a fallback formatter to use if none other has been set.
+ #
+ # @example
+ #
+ # RSpec.configure do |rspec|
+ # rspec.default_formatter = 'doc'
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1014
+ def default_formatter=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def default_path; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:121
+ def default_path=(path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def default_path?; end
+
+ # Defines a callback that can assign derived metadata values.
+ #
+ # @param filters [Array, Hash] metadata filters that determine
+ # which example or group metadata hashes the callback will be triggered
+ # for. If none are given, the callback will be run against the metadata
+ # hashes of all groups and examples.
+ # @yieldparam metadata [Hash] original metadata hash from an example or
+ # group. Mutate this in your block as needed.
+ #
+ # @example
+ # RSpec.configure do |config|
+ # # Tag all groups and examples in the spec/unit directory with
+ # # :type => :unit
+ # config.define_derived_metadata(:file_path => %r{/spec/unit/}) do |metadata|
+ # metadata[:type] = :unit
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1900
+ def define_derived_metadata(*filters, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def deprecation_stream; end
+
+ # Determines where deprecation warnings are printed.
+ # @param value [IO, String] IO to write to or filename to write to
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:168
+ def deprecation_stream=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def detail_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def detail_color=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def detail_color?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1881
+ def disable_monkey_patching; end
+
+ # Enables zero monkey patching mode for RSpec. It removes monkey
+ # patching of the top-level DSL methods (`describe`,
+ # `shared_examples_for`, etc) onto `main` and `Module`, instead
+ # requiring you to prefix these methods with `RSpec.`. It enables
+ # expect-only syntax for rspec-mocks and rspec-expectations. It
+ # simply disables monkey patching on whatever pieces of RSpec
+ # the user is using.
+ #
+ # @note It configures rspec-mocks and rspec-expectations only
+ # if the user is using those (either explicitly or implicitly
+ # by not setting `mock_with` or `expect_with` to anything else).
+ #
+ # @note If the user uses this options with `mock_with :mocha`
+ # (or similar) they will still have monkey patching active
+ # in their test environment from mocha.
+ #
+ # @example
+ #
+ # # It disables all monkey patching.
+ # RSpec.configure do |config|
+ # config.disable_monkey_patching!
+ # end
+ #
+ # # Is an equivalent to
+ # RSpec.configure do |config|
+ # config.expose_dsl_globally = false
+ #
+ # config.mock_with :rspec do |mocks|
+ # mocks.syntax = :expect
+ # mocks.patch_marshal_to_support_partial_doubles = false
+ # end
+ #
+ # config.expect_with :rspec do |expectations|
+ # expectations.syntax = :expect
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1873
+ def disable_monkey_patching!; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1881
+ def disable_monkey_patching=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def drb; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def drb=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def drb?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def drb_port; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def drb_port=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def drb_port?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def dry_run; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def dry_run=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def dry_run?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def error_exit_code; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def error_exit_code=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def error_exit_code?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def error_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def error_stream=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def error_stream?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def example_status_persistence_file_path; end
+
+ # Sets the file path to use for persisting example statuses. Necessary for the
+ # `--only-failures` and `--next-failure` CLI options.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:192
+ def example_status_persistence_file_path=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def exclude_pattern; end
+
+ # Set pattern to match files to exclude.
+ # @attr value [String] the filename pattern to exclude spec files by
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:304
+ def exclude_pattern=(value); end
+
+ # Returns the `exclusion_filter`. If none has been set, returns an empty
+ # hash.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1369
+ def exclusion_filter; end
+
+ # Clears and reassigns the `exclusion_filter`. Set to `nil` if you don't
+ # want any exclusion filter at all.
+ #
+ # ### Warning
+ #
+ # This overrides any exclusion filters/tags set on the command line or in
+ # configuration files.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1362
+ def exclusion_filter=(filter); end
+
+ # Sets the expectation framework module(s) to be included in each example
+ # group.
+ #
+ # `frameworks` can be `:rspec`, `:test_unit`, `:minitest`, a custom
+ # module, or any combination thereof:
+ #
+ # config.expect_with :rspec
+ # config.expect_with :test_unit
+ # config.expect_with :minitest
+ # config.expect_with :rspec, :minitest
+ # config.expect_with OtherExpectationFramework
+ #
+ # RSpec will translate `:rspec`, `:minitest`, and `:test_unit` into the
+ # appropriate modules.
+ #
+ # ## Configuration
+ #
+ # If the module responds to `configuration`, `expect_with` will
+ # yield the `configuration` object if given a block:
+ #
+ # config.expect_with OtherExpectationFramework do |custom_config|
+ # custom_config.custom_setting = true
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:858
+ def expect_with(*frameworks); end
+
+ # Delegates to expect_with(framework).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:831
+ def expectation_framework=(framework); end
+
+ # Returns the configured expectation framework adapter module(s)
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:819
+ def expectation_frameworks; end
+
+ # Exposes the current running example via the named
+ # helper method. RSpec 2.x exposed this via `example`,
+ # but in RSpec 3.0, the example is instead exposed via
+ # an arg yielded to `it`, `before`, `let`, etc. However,
+ # some extension gems (such as Capybara) depend on the
+ # RSpec 2.x's `example` method, so this config option
+ # can be used to maintain compatibility.
+ #
+ # @param method_name [Symbol] the name of the helper method
+ #
+ # @example
+ #
+ # RSpec.configure do |rspec|
+ # rspec.expose_current_running_example_as :example
+ # end
+ #
+ # RSpec.describe MyClass do
+ # before do
+ # # `example` can be used here because of the above config.
+ # do_something if example.metadata[:type] == "foo"
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1811
+ def expose_current_running_example_as(method_name); end
+
+ # Use this to expose the core RSpec DSL via `Module` and the `main`
+ # object. It will be set automatically but you can override it to
+ # remove the DSL.
+ # Default: true
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:151
+ def expose_dsl_globally=(value); end
+
+ # Indicates if the DSL has been exposed off of modules and `main`.
+ # Default: true
+ # @return [Boolean]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:143
+ def expose_dsl_globally?; end
+
+ # Tells RSpec to extend example groups with `mod`. Methods defined in
+ # `mod` are exposed to example groups (not examples). Use `filters` to
+ # constrain the groups to extend.
+ #
+ # Similar to `include`, but behavior is added to example groups, which
+ # are classes, rather than the examples, which are instances of those
+ # classes.
+ #
+ # @example
+ #
+ # module UiHelpers
+ # def run_in_browser
+ # # ...
+ # end
+ # end
+ #
+ # module PermissionHelpers
+ # def define_permissions
+ # # ...
+ # end
+ # end
+ #
+ # RSpec.configure do |config|
+ # config.extend(UiHelpers, :type => :request)
+ # config.extend(PermissionHelpers, :with_permissions, :type => :request)
+ # end
+ #
+ # describe "edit profile", :with_permissions, :type => :request do
+ # run_in_browser
+ # define_permissions
+ #
+ # it "does stuff in the client" do
+ # # ...
+ # end
+ # end
+ #
+ # @see #include
+ # @see #prepend
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1518
+ def extend(mod, *filters); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def fail_fast; end
+
+ # @see fail_fast
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:214
+ def fail_fast=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def fail_if_no_examples; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def fail_if_no_examples=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def fail_if_no_examples?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def failure_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def failure_color=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def failure_color?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def failure_exit_code; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def failure_exit_code=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def failure_exit_code?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1083
+ def files_or_directories_to_run=(*files); end
+
+ # @private
+ # The spec files RSpec will run.
+ # @return [Array] specified files about to run
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1096
+ def files_to_run; end
+
+ # @private
+ # The spec files RSpec will run.
+ # @return [Array] specified files about to run
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:516
+ def files_to_run=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1317
+ def filter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1309
+ def filter=(filter); end
+
+ # Adds {#backtrace_exclusion_patterns} that will filter lines from
+ # the named gems from backtraces.
+ #
+ # @param gem_names [Array] Names of the gems to filter
+ #
+ # @example
+ # RSpec.configure do |config|
+ # config.filter_gems_from_backtrace "rack", "rake"
+ # end
+ #
+ # @note The patterns this adds will match the named gems in their common
+ # locations (e.g. system gems, vendored with bundler, installed as a
+ # :git dependency with bundler, etc) but is not guaranteed to work for
+ # all possible gem locations. For example, if you have the gem source
+ # in a directory with a completely unrelated name, and use bundler's
+ # :path option, this will not filter it.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:742
+ def filter_gems_from_backtrace(*gem_names); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:518
+ def filter_manager; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:518
+ def filter_manager=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1280
+ def filter_run(*args); end
+
+ # Adds key/value pairs to the `exclusion_filter`. If `args`
+ # includes any symbols that are not part of the hash, each symbol
+ # is treated as a key in the hash with the value `true`.
+ #
+ # ### Note
+ #
+ # Filters set using this method can be overridden from the command line
+ # or config files (e.g. `.rspec`).
+ #
+ # @example
+ # # Given this declaration.
+ # describe "something", :foo => 'bar' do
+ # # ...
+ # end
+ #
+ # # Any of the following will exclude that group.
+ # config.filter_run_excluding :foo => 'bar'
+ # config.filter_run_excluding :foo => /^ba/
+ # config.filter_run_excluding :foo => lambda {|v| v == 'bar'}
+ # config.filter_run_excluding :foo => lambda {|v,m| m[:foo] == 'bar'}
+ #
+ # # Given a proc with an arity of 1, the lambda is passed the value
+ # # related to the key, e.g.
+ # config.filter_run_excluding :foo => lambda {|v| v == 'bar'}
+ #
+ # # Given a proc with an arity of 2, the lambda is passed the value
+ # # related to the key, and the metadata itself e.g.
+ # config.filter_run_excluding :foo => lambda {|v,m| m[:foo] == 'bar'}
+ #
+ # filter_run_excluding :foo # same as filter_run_excluding :foo => true
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1349
+ def filter_run_excluding(*args); end
+
+ # Adds key/value pairs to the `inclusion_filter`. If `args`
+ # includes any symbols that are not part of the hash, each symbol
+ # is treated as a key in the hash with the value `true`.
+ #
+ # ### Note
+ #
+ # Filters set using this method can be overridden from the command line
+ # or config files (e.g. `.rspec`).
+ #
+ # @example
+ # # Given this declaration.
+ # describe "something", :foo => 'bar' do
+ # # ...
+ # end
+ #
+ # # Any of the following will include that group.
+ # config.filter_run_including :foo => 'bar'
+ # config.filter_run_including :foo => /^ba/
+ # config.filter_run_including :foo => lambda {|v| v == 'bar'}
+ # config.filter_run_including :foo => lambda {|v,m| m[:foo] == 'bar'}
+ #
+ # # Given a proc with an arity of 1, the lambda is passed the value
+ # # related to the key, e.g.
+ # config.filter_run_including :foo => lambda {|v| v == 'bar'}
+ #
+ # # Given a proc with an arity of 2, the lambda is passed the value
+ # # related to the key, and the metadata itself e.g.
+ # config.filter_run_including :foo => lambda {|v,m| m[:foo] == 'bar'}
+ #
+ # filter_run_including :foo # same as filter_run_including :foo => true
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1275
+ def filter_run_including(*args); end
+
+ # Applies the provided filter only if any of examples match, in constrast
+ # to {#filter_run}, which always applies even if no examples match, in
+ # which case no examples will be run. This allows you to leave configured
+ # filters in place that are intended only for temporary use. The most common
+ # example is focus filtering: `config.filter_run_when_matching :focus`.
+ # With that configured, you can temporarily focus an example or group
+ # by tagging it with `:focus` metadata, or prefixing it with an `f`
+ # (as in `fdescribe`, `fcontext` and `fit`) since those are aliases for
+ # `describe`/`context`/`it` with `:focus` metadata.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1291
+ def filter_run_when_matching(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def fixed_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def fixed_color=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def fixed_color?; end
+
+ # @private
+ #
+ # Used to set higher priority option values from the command line.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:592
+ def force(hash); end
+
+ # Formats the docstring output using the block provided.
+ #
+ # @example
+ # # This will strip the descriptions of both examples and example
+ # # groups.
+ # RSpec.configure do |config|
+ # config.format_docstrings { |s| s.strip }
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1661
+ def format_docstrings(&block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1666
+ def format_docstrings_block; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:999
+ def formatter=(formatter, output = T.unsafe(nil)); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1029
+ def formatter_loader; end
+
+ # Returns a duplicate of the formatters currently loaded in
+ # the `FormatterLoader` for introspection.
+ #
+ # Note as this is a duplicate, any mutations will be disregarded.
+ #
+ # @return [Array] the formatters currently loaded
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1024
+ def formatters; end
+
+ # Toggle full backtrace.
+ # @attr true_or_false [Boolean] toggle full backtrace display
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:908
+ def full_backtrace=(true_or_false); end
+
+ # Check if full backtrace is enabled.
+ # @return [Boolean] is full backtrace enabled
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:902
+ def full_backtrace?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def full_cause_backtrace; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def full_cause_backtrace=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def full_cause_backtrace?; end
+
+ # @return [Array] full description filter
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:977
+ def full_description; end
+
+ # Run examples matching on `description` in all files to run.
+ # @param description [String, Regexp] the pattern to filter on
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:972
+ def full_description=(description); end
+
+ # @private
+ # Holds the various registered hooks. Here we use a FilterableItemRepository
+ # implementation that is specifically optimized for the read/write patterns
+ # of the config object.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2109
+ def hooks; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1607
+ def in_project_source_dir_regex; end
+
+ # Tells RSpec to include `mod` in example groups. Methods defined in
+ # `mod` are exposed to examples (not example groups). Use `filters` to
+ # constrain the groups or examples in which to include the module.
+ #
+ # @example
+ #
+ # module AuthenticationHelpers
+ # def login_as(user)
+ # # ...
+ # end
+ # end
+ #
+ # module PreferencesHelpers
+ # def preferences(user, preferences = {})
+ # # ...
+ # end
+ # end
+ #
+ # module UserHelpers
+ # def users(username)
+ # # ...
+ # end
+ # end
+ #
+ # RSpec.configure do |config|
+ # config.include(UserHelpers) # included in all groups
+ #
+ # # included in examples with `:preferences` metadata
+ # config.include(PreferenceHelpers, :preferences)
+ #
+ # # included in examples with `:type => :request` metadata
+ # config.include(AuthenticationHelpers, :type => :request)
+ #
+ # # included in examples where the `:type` metadata matches a proc condition
+ # config.include(AuthenticationHelpers, :type => proc { |type, _metadata| [:request, :controller].include?(type) })
+ # end
+ #
+ # describe "edit profile", :preferences, :type => :request do
+ # it "can be viewed by owning user" do
+ # login_as preferences(users(:jdoe), :lang => 'es')
+ # get "/profiles/jdoe"
+ # assert_select ".username", :text => 'jdoe'
+ # end
+ # end
+ #
+ # @note Filtered module inclusions can also be applied to
+ # individual examples that have matching metadata. Just like
+ # Ruby's object model is that every object has a singleton class
+ # which has only a single instance, RSpec's model is that every
+ # example has a singleton example group containing just the one
+ # example.
+ #
+ # @see #include_context
+ # @see #extend
+ # @see #prepend
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1428
+ def include(mod, *filters); end
+
+ # Tells RSpec to include the named shared example group in example groups.
+ # Use `filters` to constrain the groups or examples in which to include
+ # the example group.
+ #
+ # @example
+ #
+ # RSpec.shared_context "example admin user" do
+ # let(:admin_user) { create_user(:admin) }
+ # end
+ #
+ # RSpec.shared_context "example guest user" do
+ # let(:guest_user) { create_user(:guest) }
+ # end
+ #
+ # RSpec.configure do |config|
+ # config.include_context "example guest user", :type => :request
+ # config.include_context "example admin user", :admin, :type => :request
+ # end
+ #
+ # RSpec.describe "The admin page", :type => :request do
+ # it "can be viewed by admins", :admin do
+ # login_with admin_user
+ # get "/admin"
+ # expect(response).to be_ok
+ # end
+ #
+ # it "cannot be viewed by guests" do
+ # login_with guest_user
+ # get "/admin"
+ # expect(response).to be_forbidden
+ # end
+ # end
+ #
+ # @note Filtered context inclusions can also be applied to
+ # individual examples that have matching metadata. Just like
+ # Ruby's object model is that every object has a singleton class
+ # which has only a single instance, RSpec's model is that every
+ # example has a singleton example group containing just the one
+ # example.
+ #
+ # @see #include
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1475
+ def include_context(shared_group_name, *filters); end
+
+ # Returns the `inclusion_filter`. If none has been set, returns an empty
+ # hash.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1313
+ def inclusion_filter; end
+
+ # Clears and reassigns the `inclusion_filter`. Set to `nil` if you don't
+ # want any inclusion filter at all.
+ #
+ # ### Warning
+ #
+ # This overrides any inclusion filters/tags set on the command line or in
+ # configuration files.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1304
+ def inclusion_filter=(filter); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1101
+ def last_run_statuses; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def libs; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:963
+ def libs=(libs); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1630
+ def load_spec_files; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:522
+ def loaded_spec_files; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def max_displayed_failure_line_count; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def max_displayed_failure_line_count=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def max_displayed_failure_line_count?; end
+
+ # Returns the configured mock framework adapter module.
+ # @return [Symbol]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:669
+ def mock_framework; end
+
+ # Delegates to mock_framework=(framework).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:681
+ def mock_framework=(framework); end
+
+ # Sets the mock framework adapter module.
+ #
+ # `framework` can be a Symbol or a Module.
+ #
+ # Given any of `:rspec`, `:mocha`, `:flexmock`, or `:rr`, configures the
+ # named framework.
+ #
+ # Given `:nothing`, configures no framework. Use this if you don't use
+ # any mocking framework to save a little bit of overhead.
+ #
+ # Given a Module, includes that module in every example group. The module
+ # should adhere to RSpec's mock framework adapter API:
+ #
+ # setup_mocks_for_rspec
+ # - called before each example
+ #
+ # verify_mocks_for_rspec
+ # - called after each example if the example hasn't yet failed.
+ # Framework should raise an exception when expectations fail
+ #
+ # teardown_mocks_for_rspec
+ # - called after verify_mocks_for_rspec (even if there are errors)
+ #
+ # If the module responds to `configuration` and `mock_with` receives a
+ # block, it will yield the configuration object to the block e.g.
+ #
+ # config.mock_with OtherMockFrameworkAdapter do |mod_config|
+ # mod_config.custom_setting = true
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:786
+ def mock_with(framework); end
+
+ # Invokes block before defining an example group
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2114
+ def on_example_group_definition(&block); end
+
+ # @api private
+ # Returns an array of blocks to call before defining an example group
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2120
+ def on_example_group_definition_callbacks; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def only_failures; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:200
+ def only_failures?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:203
+ def only_failures_but_not_configured?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1673
+ def order=(*args, &block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:522
+ def ordering_manager; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1673
+ def ordering_registry(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def output_stream; end
+
+ # Set the output stream for reporter.
+ # @attr value [IO, String] IO to write to or filename to write to, defaults to $stdout
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:274
+ def output_stream=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def pattern; end
+
+ # Set pattern to match files to load.
+ # @attr value [String] the filename pattern to filter spec files by
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:293
+ def pattern=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def pending_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def pending_color=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def pending_color?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def pending_failure_output; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:473
+ def pending_failure_output=(mode); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def pending_failure_output?; end
+
+ # Tells RSpec to prepend example groups with `mod`. Methods defined in
+ # `mod` are exposed to examples (not example groups). Use `filters` to
+ # constrain the groups in which to prepend the module.
+ #
+ # Similar to `include`, but module is included before the example group's class
+ # in the ancestor chain.
+ #
+ # @example
+ #
+ # module OverrideMod
+ # def override_me
+ # "overridden"
+ # end
+ # end
+ #
+ # RSpec.configure do |config|
+ # config.prepend(OverrideMod, :method => :prepend)
+ # end
+ #
+ # describe "overriding example's class", :method => :prepend do
+ # it "finds the user" do
+ # self.class.class_eval do
+ # def override_me
+ # end
+ # end
+ # override_me # => "overridden"
+ # # ...
+ # end
+ # end
+ #
+ # @see #include
+ # @see #extend
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1557
+ def prepend(mod, *filters); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2045
+ def prepend_after(scope = T.unsafe(nil), *meta, &block); end
+
+ # Adds `block` to the start of the list of `before` blocks in the same
+ # scope (`:example`, `:context`, or `:suite`), in contrast to {#before},
+ # which adds the hook to the end of the list.
+ #
+ # See {Hooks#before} for full `before` hook docs.
+ #
+ # This method differs from {Hooks#prepend_before} in only one way: it supports
+ # the `:suite` scope. Hooks with the `:suite` scope will be run once before
+ # the first example of the entire suite is executed. Conditions passed along
+ # with `:suite` are effectively ignored.
+ #
+ # @see #before
+ # @see #after
+ # @see #append_after
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2006
+ def prepend_before(scope = T.unsafe(nil), *meta, &block); end
+
+ # @macro add_setting
+ # Report the times for the slowest examples (default: `false`).
+ # Use this to specify the number of examples to include in the profile.
+ # @return [Boolean]
+ # @api private
+ #
+ # Defaults `profile_examples` to 10 examples when `@profile_examples` is
+ # `true`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1073
+ def profile_examples; end
+
+ # @macro add_setting
+ # Report the times for the slowest examples (default: `false`).
+ # Use this to specify the number of examples to include in the profile.
+ # @return [Boolean]
+ # @api private
+ #
+ # Defaults `profile_examples` to 10 examples when `@profile_examples` is
+ # `true`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:322
+ def profile_examples=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def profile_examples?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def project_source_dirs; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def project_source_dirs=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def project_source_dirs?; end
+
+ # Turns deprecation warnings into errors, in order to surface
+ # the full backtrace of the call site. This can be useful when
+ # you need more context to address a deprecation than the
+ # single-line call site normally provided.
+ #
+ # @example
+ #
+ # RSpec.configure do |rspec|
+ # rspec.raise_errors_for_deprecations!
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1833
+ def raise_errors_for_deprecations!; end
+
+ # Turns RSpec warnings into errors. This can be useful when
+ # you want RSpec to run in a 'strict' no warning situation.
+ # (Note this does not capture or raise on Ruby warnings).
+ #
+ # @example
+ #
+ # RSpec.configure do |rspec|
+ # rspec.raise_on_warning = true
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1781
+ def raise_on_warning=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1673
+ def register_ordering(*args, &block); end
+
+ # @return [RSpec::Core::Reporter] the currently configured reporter
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1056
+ def reporter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def requires; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1597
+ def requires=(paths); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:601
+ def reset; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:614
+ def reset_filters; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:607
+ def reset_reporter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def run_all_when_everything_filtered; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def run_all_when_everything_filtered=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def run_all_when_everything_filtered?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1673
+ def seed(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1673
+ def seed=(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1673
+ def seed_used?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def shared_context_metadata_behavior; end
+
+ # @see shared_context_metadata_behavior
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:434
+ def shared_context_metadata_behavior=(value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def silence_filter_announcements; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def silence_filter_announcements=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def silence_filter_announcements?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1138
+ def spec_files_with_failures; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def start_time; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def start_time=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def start_time?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:520
+ def static_config_filter_manager; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:520
+ def static_config_filter_manager=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def success_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def success_color=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def success_color?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def threadsafe; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def threadsafe=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def threadsafe?; end
+
+ # @deprecated This config option was added in RSpec 2 to pave the way
+ # for this being the default behavior in RSpec 3. Now this option is
+ # a no-op.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:383
+ def treat_symbols_as_metadata_keys_with_true_values=(_value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:66
+ def tty; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:89
+ def tty=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:78
+ def tty?; end
+
+ # Set Ruby warnings on or off.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1760
+ def warnings=(value); end
+
+ # @return [Boolean] Whether or not ruby warnings are enabled.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1765
+ def warnings?; end
+
+ # Defines a callback that runs after the first example with matching
+ # metadata is defined. If no examples are defined with matching metadata,
+ # it will not get called at all.
+ #
+ # This can be used to ensure some setup is performed (such as bootstrapping
+ # a DB or loading a specific file that adds significantly to the boot time)
+ # if needed (as indicated by the presence of an example with matching metadata)
+ # but avoided otherwise.
+ #
+ # @example
+ # RSpec.configure do |config|
+ # config.when_first_matching_example_defined(:db) do
+ # # Load a support file that does some heavyweight setup,
+ # # including bootstrapping the DB, but only if we have loaded
+ # # any examples tagged with `:db`.
+ # require 'support/db'
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1923
+ def when_first_matching_example_defined(*filters); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2091
+ def with_suite_hooks; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:518
+ def world; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:518
+ def world=(_arg0); end
+
+ private
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2254
+ def absolute_pattern?(pattern); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2355
+ def add_hook_to_existing_matching_groups(meta, scope, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2294
+ def assert_no_example_groups_defined(config_option); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2344
+ def clear_values_derived_from_example_status_persistence_file_path; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2276
+ def command; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2320
+ def conditionally_disable_expectations_monkey_patching; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2311
+ def conditionally_disable_mocks_monkey_patching; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2349
+ def configure_group_with(group, module_list, application_method); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2284
+ def define_built_in_hooks; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2407
+ def define_mixed_in_module(mod, filters, mod_list, config_method, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2259
+ def extract_location(path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2236
+ def file_glob_from(path, pattern); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2225
+ def gather_directories(path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2204
+ def get_files_to_run(paths); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2231
+ def get_matching_files(path, pattern); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2171
+ def handle_suite_hook(scope, meta); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2143
+ def load_file_handling_errors(method, file); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2377
+ def metadata_applies_to_group?(meta, group); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2369
+ def on_existing_matching_groups(meta); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2307
+ def output_to_tty?(output = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2303
+ def output_wrapper; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2216
+ def paths_to_check(paths); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2221
+ def pattern_might_load_specs_from_vendored_dirs?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2330
+ def rspec_expectations_loaded?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2326
+ def rspec_mocks_loaded?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2186
+ def run_suite_hooks(hook_description, hooks); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2392
+ def safe_extend(mod, host); end
+
+ # for 1.8.7
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2388
+ def safe_include(mod, host); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2382
+ def safe_prepend(mod, host); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2334
+ def update_pattern_attr(name, value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:2280
+ def value_for(key); end
+
+ class << self
+ # @private
+ #
+ # As `add_setting` but only add the reader.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:100
+ def add_read_only_setting(name, opts = T.unsafe(nil)); end
+
+ # @private
+ #
+ # Invoked by the `add_setting` instance method. Use that method on a
+ # `Configuration` instance rather than this class method.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:87
+ def add_setting(name, opts = T.unsafe(nil)); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:70
+ def define_alias(name, alias_name); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:77
+ def define_predicate(name); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:60
+ def define_reader(name); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1671
+ def delegate_to_ordering_manager(*methods); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1651
+RSpec::Core::Configuration::DEFAULT_FORMATTER = T.let(T.unsafe(nil), Proc)
+
+# @private
+#
+# This buffer is used to capture all messages sent to the reporter during
+# reporter initialization. It can then replay those messages after the
+# formatter is correctly initialized. Otherwise, deprecation warnings
+# during formatter initialization can cause an infinite loop.
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1039
+class RSpec::Core::Configuration::DeprecationReporterBuffer
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1040
+ def initialize; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1044
+ def deprecation(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1048
+ def play_onto(reporter); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1821
+module RSpec::Core::Configuration::ExposeCurrentExample; end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1126
+RSpec::Core::Configuration::FAILED_STATUS = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:749
+RSpec::Core::Configuration::MOCKING_ADAPTERS = T.let(T.unsafe(nil), Hash)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:57
+class RSpec::Core::Configuration::MustBeConfiguredBeforeExampleGroupsError < ::StandardError; end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1129
+RSpec::Core::Configuration::PASSED_STATUS = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1132
+RSpec::Core::Configuration::PENDING_STATUS = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1770
+RSpec::Core::Configuration::RAISE_ERROR_WARNING_NOTIFIER = T.let(T.unsafe(nil), Proc)
+
+# Module that holds `attr_reader` declarations. It's in a separate
+# module to allow us to override those methods and use `super`.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:53
+module RSpec::Core::Configuration::Readers
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def default_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def default_path; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def deprecation_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def detail_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def drb; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def drb_port; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def dry_run; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def error_exit_code; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def error_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def example_status_persistence_file_path; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def exclude_pattern; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def fail_fast; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def fail_if_no_examples; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def failure_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def failure_exit_code; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def fixed_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def full_cause_backtrace; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def libs; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def max_displayed_failure_line_count; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def only_failures; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def output_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def pattern; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def pending_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def pending_failure_output; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def project_source_dirs; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def requires; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def run_all_when_everything_filtered; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def shared_context_metadata_behavior; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def silence_filter_announcements; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def start_time; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def success_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def threadsafe; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration.rb:63
+ def tty; end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1123
+RSpec::Core::Configuration::UNKNOWN_STATUS = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration.rb:1135
+RSpec::Core::Configuration::VALID_STATUSES = T.let(T.unsafe(nil), Array)
+
+# Responsible for utilizing externally provided configuration options,
+# whether via the command line, `.rspec`, `~/.rspec`,
+# `$XDG_CONFIG_HOME/rspec/options`, `.rspec-local` or a custom options
+# file.
+#
+# pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:10
+class RSpec::Core::ConfigurationOptions
+ # @param args [Array] command line arguments
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:12
+ def initialize(args); end
+
+ # @return [Array] the original command-line arguments
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:40
+ def args; end
+
+ # Updates the provided {Configuration} instance based on the provided
+ # external configuration options.
+ #
+ # @param config [Configuration] the configuration instance to update
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:21
+ def configure(config); end
+
+ # @api private
+ # Updates the provided {FilterManager} based on the filter options.
+ # @param filter_manager [FilterManager] instance to update
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:30
+ def configure_filter_manager(filter_manager); end
+
+ # @return [Hash] the final merged options, drawn from all external sources
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:37
+ def options; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:173
+ def args_from_options_file(path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:142
+ def command_line_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:146
+ def custom_options; end
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:190
+ def custom_options_file; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:133
+ def env_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:125
+ def file_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:66
+ def force?(key); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:158
+ def global_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:202
+ def global_options_file; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:213
+ def home_options_file_path; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:121
+ def load_formatters_into(config); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:150
+ def local_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:198
+ def local_options_file; end
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:181
+ def options_file_as_erb_string(path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:162
+ def options_from(path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:70
+ def order(keys); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:44
+ def organize_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:167
+ def parse_args_ignoring_files_or_dirs_to_run(args, source); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:113
+ def process_options_into(config); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:154
+ def project_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:194
+ def project_options_file; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:229
+ def resolve_xdg_config_home; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:206
+ def xdg_options_file_if_exists; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:222
+ def xdg_options_file_path; end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:77
+RSpec::Core::ConfigurationOptions::OPTIONS_ORDER = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:59
+RSpec::Core::ConfigurationOptions::UNFORCED_OPTIONS = T.let(T.unsafe(nil), RSpec::Core::Set)
+
+# pkg:gem/rspec-core#lib/rspec/core/configuration_options.rb:64
+RSpec::Core::ConfigurationOptions::UNPROCESSABLE_OPTIONS = T.let(T.unsafe(nil), RSpec::Core::Set)
+
+# DSL defines methods to group examples, most notably `describe`,
+# and exposes them as class methods of {RSpec}. They can also be
+# exposed globally (on `main` and instances of `Module`) through
+# the {Configuration} option `expose_dsl_globally`.
+#
+# By default the methods `describe`, `context` and `example_group`
+# are exposed. These methods define a named context for one or
+# more examples. The given block is evaluated in the context of
+# a generated subclass of {RSpec::Core::ExampleGroup}.
+#
+# ## Examples:
+#
+# RSpec.describe "something" do
+# context "when something is a certain way" do
+# it "does something" do
+# # example code goes here
+# end
+# end
+# end
+#
+# @see ExampleGroup
+# @see ExampleGroup.example_group
+#
+# pkg:gem/rspec-core#lib/rspec/core/dsl.rb:25
+module RSpec::Core::DSL
+ class << self
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:89
+ def change_global_dsl(&changes); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:27
+ def example_group_aliases; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:37
+ def expose_example_group_alias(name); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:81
+ def expose_example_group_alias_globally(method_name); end
+
+ # Adds the describe method to Module and the top level binding.
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:58
+ def expose_globally!; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:32
+ def exposed_globally?; end
+
+ # Removes the describe method from Module and the top level binding.
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:70
+ def remove_globally!; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:53
+ def top_level; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/dsl.rb:53
+ def top_level=(_arg0); end
+ end
+end
+
+# Deprecation Error.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:221
+class RSpec::Core::DeprecationError < ::StandardError; end
+
+# @private
+# Wrapper around Ruby's `DidYouMean::SpellChecker` when available to provide file name suggestions.
+#
+# pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:5
+class RSpec::Core::DidYouMean
+ # pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:8
+ def initialize(relative_file_name); end
+
+ # provide probable suggestions
+ # :nocov: - not installed on CI
+ # return a hint if API for ::DidYouMean::SpellChecker not supported
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:15
+ def call; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:6
+ def relative_file_name; end
+
+ private
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:35
+ def formats(probables); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:45
+ def red_font(mytext); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/did_you_mean.rb:40
+ def top_and_tail(rspec_format); end
+end
+
+# Wrapper for an instance of a subclass of {ExampleGroup}. An instance of
+# `RSpec::Core::Example` is returned by example definition methods
+# such as {ExampleGroup.it it} and is yielded to the {ExampleGroup.it it},
+# {Hooks#before before}, {Hooks#after after}, {Hooks#around around},
+# {MemoizedHelpers::ClassMethods#let let} and
+# {MemoizedHelpers::ClassMethods#subject subject} blocks.
+#
+# This allows us to provide rich metadata about each individual
+# example without adding tons of methods directly to the ExampleGroup
+# that users may inadvertently redefine.
+#
+# Useful for configuring logging and/or taking some action based
+# on the state of an example's metadata.
+#
+# @example
+#
+# RSpec.configure do |config|
+# config.before do |example|
+# log example.description
+# end
+#
+# config.after do |example|
+# log example.description
+# end
+#
+# config.around do |example|
+# log example.description
+# example.run
+# end
+# end
+#
+# shared_examples "auditable" do
+# it "does something" do
+# log "#{example.full_description}: #{auditable.inspect}"
+# auditable.should do_something
+# end
+# end
+#
+# @see ExampleGroup
+# @note Example blocks are evaluated in the context of an instance
+# of an `ExampleGroup`, not in the context of an instance of `Example`.
+#
+# pkg:gem/rspec-core#lib/rspec/core/example.rb:44
+class RSpec::Core::Example
+ # Creates a new instance of Example.
+ # @param example_group_class [Class] the subclass of ExampleGroup in which
+ # this Example is declared
+ # @param description [String] the String passed to the `it` method (or
+ # alias)
+ # @param user_metadata [Hash] additional args passed to `it` to be used as
+ # metadata
+ # @param example_block [Proc] the block of code that represents the
+ # example
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:186
+ def initialize(example_group_class, description, user_metadata, example_block = T.unsafe(nil)); end
+
+ # @attr
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:174
+ def clock; end
+
+ # @attr
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:174
+ def clock=(_arg0); end
+
+ # Returns the string submitted to `example` or its aliases (e.g.
+ # `specify`, `it`, etc). If no string is submitted (e.g.
+ # `it { is_expected.to do_something }`) it returns the message generated
+ # by the matcher if there is one, otherwise returns a message including
+ # the location of the example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:76
+ def description; end
+
+ # @private
+ #
+ # The exception that will be displayed to the user -- either the failure of
+ # the example or the `pending_exception` if the example is pending.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:388
+ def display_exception; end
+
+ # @private
+ #
+ # Assigns the exception that will be displayed to the user -- either the failure of
+ # the example or the `pending_exception` if the example is pending.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:396
+ def display_exception=(ex); end
+
+ # Duplicates the example and overrides metadata with the provided
+ # hash.
+ #
+ # @param metadata_overrides [Hash] the hash to override the example metadata
+ # @return [Example] a duplicate of the example with modified metadata
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:132
+ def duplicate_with(metadata_overrides = T.unsafe(nil)); end
+
+ # Returns the example group class that provides the context for running
+ # this example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:230
+ def example_group; end
+
+ # @attr_reader
+ # @private
+ #
+ # Returns the example_group_instance that provides the context for
+ # running this example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:170
+ def example_group_instance; end
+
+ # @attr_reader
+ #
+ # Returns the first exception raised in the context of running this
+ # example (nil if no exception is raised).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:158
+ def exception; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:49
+ def execution_result; end
+
+ # @private
+ #
+ # Used internally to set an exception and fail without actually executing
+ # the example when an exception is raised in before(:context).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:439
+ def fail_with_exception(reporter, exception); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:49
+ def file_path; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:49
+ def full_description; end
+
+ # @return [String] the unique id of this example. Pass
+ # this at the command line to re-run this exact example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:117
+ def id; end
+
+ # Provide a human-readable representation of this class
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:220
+ def inspect; end
+
+ # Returns a description of the example that always includes the location.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:87
+ def inspect_output; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:456
+ def instance_exec(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:49
+ def location; end
+
+ # Returns the location-based argument that can be passed to the `rspec` command to rerun this example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:96
+ def location_rerun_argument; end
+
+ # @attr_reader
+ #
+ # Returns the metadata object associated with this example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:163
+ def metadata; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:49
+ def pending; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:234
+ def pending?; end
+
+ # @return [RSpec::Core::Reporter] the current reporter for the example
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:226
+ def reporter; end
+
+ # Returns the location-based argument that can be passed to the `rspec` command to rerun this example.
+ #
+ # @deprecated Use {#location_rerun_argument} instead.
+ # @note If there are multiple examples identified by this location, they will use {#id}
+ # to rerun instead, but this method will still return the location (that's why it is deprecated!).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:111
+ def rerun_argument; end
+
+ # @api private
+ # instance_execs the block passed to the constructor in the context of
+ # the instance of {ExampleGroup}.
+ # @param example_group_instance the instance of an ExampleGroup subclass
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:246
+ def run(example_group_instance, reporter); end
+
+ # @private
+ #
+ # Used to set the exception when `aggregate_failures` fails.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:425
+ def set_aggregate_failures_exception(exception); end
+
+ # @private
+ #
+ # Used internally to set an exception in an after hook, which
+ # captures the exception but doesn't raise it.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:412
+ def set_exception(exception); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:49
+ def skip; end
+
+ # @private
+ #
+ # Used internally to skip without actually executing the example when
+ # skip is used in before(:context).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:449
+ def skip_with_exception(reporter, exception); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:238
+ def skipped?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:223
+ def to_s; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:148
+ def update_inherited_metadata(updates); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:534
+ def assign_generated_description; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:478
+ def finish(reporter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:543
+ def generate_description; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:462
+ def hooks; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:550
+ def location_description; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:530
+ def mocks_need_verification?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:498
+ def record_finished(status, reporter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:516
+ def run_after_example; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:503
+ def run_before_example; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:473
+ def start(reporter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:524
+ def verify_mocks; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:508
+ def with_around_and_singleton_context_hooks; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:466
+ def with_around_example_hooks; end
+
+ class << self
+ # @private
+ #
+ # Used to define methods that delegate to this example's metadata.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:48
+ def delegate_to_metadata(key); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:122
+ def parse_id(id); end
+ end
+end
+
+# :nocov:
+# For some reason, rescuing `Support::AllExceptionsExceptOnesWeMustNotRescue`
+# in place of `Exception` above can cause the exit status to be the wrong
+# thing. I have no idea why. See:
+# https://github.com/rspec/rspec-core/pull/2063#discussion_r38284978
+# @private
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/example.rb:310
+RSpec::Core::Example::AllExceptionsExcludingDangerousOnesOnRubiesThatAllowIt = RSpec::Support::AllExceptionsExceptOnesWeMustNotRescue
+
+# Represents the result of executing an example.
+# Behaves like a hash for backwards compatibility.
+#
+# pkg:gem/rspec-core#lib/rspec/core/example.rb:556
+class RSpec::Core::Example::ExecutionResult
+ include ::RSpec::Core::HashImitatable
+ extend ::RSpec::Core::HashImitatable::ClassMethods
+
+ # @api private
+ # Populates finished_at and run_time if it has not yet been set
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:610
+ def ensure_timing_set(clock); end
+
+ # @return [Boolean] Indicates if the example was completely skipped
+ # (typically done via `:skip` metadata or the `skip` method). Skipped examples
+ # will have a `:pending` result. A `:pending` result can also come from examples
+ # that were marked as `:pending`, which causes them to be run, and produces a
+ # `:failed` result if the example passes.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:597
+ def example_skipped?; end
+
+ # @return [Exception, nil] The failure, if there was one.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:563
+ def exception; end
+
+ # @return [Exception, nil] The failure, if there was one.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:563
+ def exception=(_arg0); end
+
+ # @return [Time] When the example finished.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:569
+ def finished_at; end
+
+ # @return [Time] When the example finished.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:569
+ def finished_at=(_arg0); end
+
+ # @return [Exception, nil] The exception triggered while
+ # executing the pending example. If no exception was triggered
+ # it would no longer get a status of `:pending` unless it was
+ # tagged with `:skip`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:582
+ def pending_exception; end
+
+ # @return [Exception, nil] The exception triggered while
+ # executing the pending example. If no exception was triggered
+ # it would no longer get a status of `:pending` unless it was
+ # tagged with `:skip`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:582
+ def pending_exception=(_arg0); end
+
+ # @return [Boolean] For examples tagged with `:pending`,
+ # this indicates whether or not it now passes.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:586
+ def pending_fixed; end
+
+ # @return [Boolean] For examples tagged with `:pending`,
+ # this indicates whether or not it now passes.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:586
+ def pending_fixed=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:588
+ def pending_fixed?; end
+
+ # @return [String, nil] The reason the example was pending,
+ # or nil if the example was not pending.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:576
+ def pending_message; end
+
+ # @return [String, nil] The reason the example was pending,
+ # or nil if the example was not pending.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:576
+ def pending_message=(_arg0); end
+
+ # @api private
+ # Records the finished status of the example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:603
+ def record_finished(status, finished_at); end
+
+ # @return [Float] How long the example took in seconds.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:572
+ def run_time; end
+
+ # @return [Float] How long the example took in seconds.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:572
+ def run_time=(_arg0); end
+
+ # @return [Time] When the example started.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:566
+ def started_at; end
+
+ # @return [Time] When the example started.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:566
+ def started_at=(_arg0); end
+
+ # @return [Symbol] `:passed`, `:failed` or `:pending`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:560
+ def status; end
+
+ # @return [Symbol] `:passed`, `:failed` or `:pending`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:560
+ def status=(_arg0); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:616
+ def calculate_run_time(finished_at); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:634
+ def get_value(name); end
+
+ # For backwards compatibility we present `status` as a string
+ # when presenting the legacy hash interface.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:623
+ def hash_for_delegation; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:642
+ def issue_deprecation(_method_name, *_args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:629
+ def set_value(name, value); end
+end
+
+# Wraps both a `Proc` and an {Example} for use in {Hooks#around
+# around} hooks. In around hooks we need to yield this special
+# kind of object (rather than the raw {Example}) because when
+# there are multiple `around` hooks we have to wrap them recursively.
+#
+# @example
+#
+# RSpec.configure do |c|
+# c.around do |ex| # Procsy which wraps the example
+# if ex.metadata[:key] == :some_value && some_global_condition
+# raise "some message"
+# end
+# ex.run # run delegates to ex.call.
+# end
+# end
+#
+# @note This class also exposes the instance methods of {Example},
+# proxying them through to the wrapped {Example} instance.
+#
+# pkg:gem/rspec-core#lib/rspec/core/example.rb:331
+class RSpec::Core::Example::Procsy
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:362
+ def initialize(example, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def <<(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def ==(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def ===(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def >>(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def [](*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def arity(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def binding(*a, &b); end
+
+ # Calls the proc and notes that the example has been executed.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:350
+ def call(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def clock(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def clock=(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def clone(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def curry(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def description(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def dup(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def duplicate_with(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def eql?(*a, &b); end
+
+ # The {Example} instance.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:333
+ def example; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def example_group(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def example_group_instance(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def exception(*a, &b); end
+
+ # Indicates whether or not the around hook has executed the example.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:374
+ def executed?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def execution_result(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def file_path(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def full_description(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def hash(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def id(*a, &b); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:379
+ def inspect; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def inspect_output(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def lambda?(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def location(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def location_rerun_argument(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def metadata(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def parameters(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def pending(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def pending?(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def reporter(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def rerun_argument(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def ruby2_keywords(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:354
+ def run(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def skip(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def skipped?(*a, &b); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def source_location(*a, &b); end
+
+ # Provides a wrapped proc that will update our `executed?` state when
+ # executed.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:358
+ def to_proc; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:339
+ def update_inherited_metadata(*a, &b); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:369
+ def wrap(&block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example.rb:346
+ def yield(*a, &b); end
+end
+
+# ExampleGroup and {Example} are the main structural elements of
+# rspec-core. Consider this example:
+#
+# RSpec.describe Thing do
+# it "does something" do
+# end
+# end
+#
+# The object returned by `describe Thing` is a subclass of ExampleGroup.
+# The object returned by `it "does something"` is an instance of Example,
+# which serves as a wrapper for an instance of the ExampleGroup in which it
+# is declared.
+#
+# Example group bodies (e.g. `describe` or `context` blocks) are evaluated
+# in the context of a new subclass of ExampleGroup. Individual examples are
+# evaluated in the context of an instance of the specific ExampleGroup
+# subclass to which they belong.
+#
+# Besides the class methods defined here, there are other interesting macros
+# defined in {Hooks}, {MemoizedHelpers::ClassMethods} and
+# {SharedExampleGroup}. There are additional instance methods available to
+# your examples defined in {MemoizedHelpers} and {Pending}.
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_group.rb:29
+class RSpec::Core::ExampleGroup
+ include ::RSpec::Core::MemoizedHelpers
+ include ::RSpec::Core::Pending
+ extend ::RSpec::Core::Hooks
+ extend ::RSpec::Core::MemoizedHelpers::ClassMethods
+ extend ::RSpec::Core::SharedExampleGroup
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:714
+ def initialize(inspect_output = T.unsafe(nil)); end
+
+ # Returns the class or module passed to the `describe` method (or alias).
+ # Returns nil if the subject is not a class or module.
+ # @example
+ # RSpec.describe Thing do
+ # it "does something" do
+ # described_class == Thing
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:99
+ def described_class; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:720
+ def inspect; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:765
+ def method_missing(name, *args, **_arg2); end
+
+ class << self
+ # Adds an example to the example group
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:374
+ def add_example(example); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:536
+ def before_context_ivars; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:473
+ def children; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def context(*args, &example_group_block); end
+
+ # Returns true if a `before(:context)` or `after(:context)`
+ # hook is currently executing.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:549
+ def currently_executing_a_context_hook?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:674
+ def declaration_locations; end
+
+ # @private
+ # @macro [attach] define_example_group_method
+ # @!scope class
+ # @method $1
+ # @overload $1
+ # @overload $1(&example_group_definition)
+ # @param example_group_definition [Block] The definition of the example group.
+ # @overload $1(doc_string, *metadata, &example_implementation)
+ # @param doc_string [String] The group's doc string.
+ # @param metadata [Array, Hash] Metadata for the group.
+ # Symbols will be transformed into hash entries with `true` values.
+ # @param example_group_definition [Block] The definition of the example group.
+ # @return [RSpec::Core::ExampleGroup]
+ #
+ # Generates a subclass of this example group which inherits
+ # everything except the examples themselves.
+ #
+ # @example
+ #
+ # RSpec.describe "something" do # << This describe method is defined in
+ # # << RSpec::Core::DSL, included in the
+ # # << global namespace (optional)
+ # before do
+ # do_something_before
+ # end
+ #
+ # before(:example, :clean_env) do
+ # env.clear!
+ # end
+ #
+ # let(:thing) { Thing.new }
+ #
+ # $1 "attribute (of something)" do
+ # # examples in the group get the before hook
+ # # declared above, and can access `thing`
+ # end
+ #
+ # $1 "needs additional setup", :clean_env, :implementation => JSON do
+ # # specifies that hooks with matching metadata
+ # # should be be run additionally
+ # end
+ # end
+ #
+ # @see DSL#describe
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:248
+ def define_example_group_method(name, metadata = T.unsafe(nil)); end
+
+ # @private
+ # @macro [attach] define_example_method
+ # @!scope class
+ # @method $1
+ # @overload $1
+ # @overload $1(&example_implementation)
+ # @param example_implementation [Block] The implementation of the example.
+ # @overload $1(doc_string, *metadata)
+ # @param doc_string [String] The example's doc string.
+ # @param metadata [Array, Hash] Metadata for the example.
+ # Symbols will be transformed into hash entries with `true` values.
+ # @overload $1(doc_string, *metadata, &example_implementation)
+ # @param doc_string [String] The example's doc string.
+ # @param metadata [Array, Hash] Metadata for the example.
+ # Symbols will be transformed into hash entries with `true` values.
+ # @param example_implementation [Block] The implementation of the example.
+ # @yield [Example] the example object
+ # @example
+ # $1 do
+ # end
+ #
+ # $1 "does something" do
+ # end
+ #
+ # $1 "does something", :slow, :uses_js do
+ # end
+ #
+ # $1 "does something", :with => 'additional metadata' do
+ # end
+ #
+ # $1 "does something" do |ex|
+ # # ex is the Example object that contains metadata about the example
+ # end
+ #
+ # @example
+ # $1 "does something", :slow, :load_factor => 100 do
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:145
+ def define_example_method(name, extra_options = T.unsafe(nil)); end
+
+ # @private
+ # @macro [attach] define_nested_shared_group_method
+ # @!scope class
+ # @method $1(name, *args, &block)
+ # @param name [String, Symbol] The name of the shared group to include.
+ # @param args [Array] Pass parameters to a shared example group
+ # @param block [Block] Additional context to pass to the shared group.
+ # @return [RSpec::Core::ExampleGroup]
+ #
+ # @see SharedExampleGroup
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:324
+ def define_nested_shared_group_method(new_name, report_label = T.unsafe(nil)); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:76
+ def delegate_to_metadata(*names); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:467
+ def descendant_filtered_examples; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:510
+ def descendants; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def describe(*args, &example_group_block); end
+
+ # Returns the class or module passed to the `describe` method (or alias).
+ # Returns nil if the subject is not a class or module.
+ # @example
+ # RSpec.describe Thing do
+ # it "does something" do
+ # described_class == Thing
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def described_class; end
+
+ # @return [String] the current example group description
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:85
+ def description; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:707
+ def each_instance_variable_for_example(group); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:525
+ def ensure_example_groups_are_configured; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def example(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def example_group(*args, &example_group_block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:457
+ def examples; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def fcontext(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def fdescribe(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def fexample(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def file_path; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:462
+ def filtered_examples; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:386
+ def find_and_eval_shared(label, name, inclusion_location, *args, &customization_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def fit(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def focus(*all_args, &block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:662
+ def for_filtered_examples(reporter, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def fspecify(*all_args, &block); end
+
+ # @return [String] the unique id of this example group. Pass
+ # this at the command line to re-run this exact example group.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:682
+ def id; end
+
+ # Define a singleton method for the singleton class (remove the method if
+ # it's already been defined).
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:40
+ def idempotently_define_singleton_method(name, &definition); end
+
+ # Includes shared content mapped to `name` directly in the group in which
+ # it is declared, as opposed to `it_behaves_like`, which creates a nested
+ # group. If given a block, that block is also eval'd in the current
+ # context.
+ #
+ # @see SharedExampleGroup
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:350
+ def include_context(name, *args, &block); end
+
+ # Includes shared content mapped to `name` directly in the group in which
+ # it is declared, as opposed to `it_behaves_like`, which creates a nested
+ # group. If given a block, that block is also eval'd in the current
+ # context.
+ #
+ # @see SharedExampleGroup
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:360
+ def include_examples(name, *args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def it(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def it_behaves_like(name, *args, &customization_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def it_should_behave_like(name, *args, &customization_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def location; end
+
+ # The [Metadata](Metadata) object associated with this group.
+ # @see Metadata
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:51
+ def metadata; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:492
+ def next_runnable_index_for(file); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:632
+ def ordering_strategy; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:515
+ def parent_groups; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def pending(*all_args, &block); end
+
+ # Removes an example from the example group
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:380
+ def remove_example(example); end
+
+ # Clear memoized values when adding/removing examples
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:366
+ def reset_memoized; end
+
+ # Runs all the examples in this group.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:606
+ def run(reporter = T.unsafe(nil)); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:592
+ def run_after_context_hooks(example_group_instance); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:554
+ def run_before_context_hooks(example_group_instance); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:648
+ def run_examples(reporter); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:417
+ def set_it_up(description, args, registration_collection, &example_group_block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:692
+ def set_ivars(instance, ivars); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def skip(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def specify(*all_args, &block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:541
+ def store_before_context_ivars(example_group_instance); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:402
+ def subclass(parent, description, args, registration_collection, &example_group_block); end
+
+ # 1.8.7
+ # :nocov:
+ # @private
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:569
+ def superclass_before_context_ivars; end
+
+ # @private
+ # @return [Metadata] belonging to the parent of a nested {ExampleGroup}
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:71
+ def superclass_metadata; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:520
+ def top_level?; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:687
+ def top_level_description; end
+
+ # @private
+ # Traverses the tree of groups, starting with `self`, then the children, recursively.
+ # Halts the traversal of a branch of the tree as soon as the passed block returns true.
+ # Note that siblings groups and their sub-trees will continue to be explored.
+ # This is intended to make it easy to find the top-most group that satisfies some
+ # condition.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:483
+ def traverse_tree_until(&block); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:734
+ def update_inherited_metadata(updates); end
+
+ # Temporarily replace the provided metadata.
+ # Intended primarily to allow an example group's singleton class
+ # to return the metadata of the example that it exists for. This
+ # is necessary for shared example group inclusion to work properly
+ # with singleton example groups.
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:61
+ def with_replaced_metadata(meta); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def xcontext(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def xdescribe(*args, &example_group_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def xexample(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def xit(*all_args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:43
+ def xspecify(*all_args, &block); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_group.rb:749
+ def method_missing(name, *args); end
+ end
+end
+
+# :nocov:
+# @private
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_group.rb:703
+RSpec::Core::ExampleGroup::INSTANCE_VARIABLE_TO_IGNORE = T.let(T.unsafe(nil), Symbol)
+
+# Raised when an RSpec API is called in the wrong scope, such as `before`
+# being called from within an example rather than from within an example
+# group block.
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_group.rb:747
+class RSpec::Core::ExampleGroup::WrongScopeError < ::NoMethodError; end
+
+# Dumps a list of hashes in a pretty, human readable format
+# for later parsing. The hashes are expected to have symbol
+# keys and string values, and each hash should have the same
+# set of keys.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:143
+class RSpec::Core::ExampleStatusDumper
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:148
+ def initialize(examples); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:152
+ def dump; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:188
+ def column_widths; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:159
+ def formatted_header_rows; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:176
+ def formatted_row_from(row_values); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:166
+ def formatted_value_rows; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:184
+ def headers; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:172
+ def rows; end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:144
+ def dump(examples); end
+ end
+end
+
+# Merges together a list of example statuses from this run
+# and a list from previous runs (presumably loaded from disk).
+# Each example status object is expected to be a hash with
+# at least an `:example_id` and a `:status` key. Examples that
+# were loaded but not executed (due to filtering, `--fail-fast`
+# or whatever) should have a `:status` of `UNKNOWN_STATUS`.
+#
+# This will produce a new list that:
+# - Will be missing examples from previous runs that we know for sure
+# no longer exist.
+# - Will have the latest known status for any examples that either
+# definitively do exist or may still exist.
+# - Is sorted by file name and example definition order, so that
+# the saved file is easily scannable if users want to inspect it.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:74
+class RSpec::Core::ExampleStatusMerger
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:79
+ def initialize(this_run, from_previous_runs); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:85
+ def merge; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:102
+ def delete_previous_examples_that_no_longer_exist; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:108
+ def example_must_no_longer_exist?(ex_id); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:95
+ def hash_from(example_list); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:124
+ def loaded_spec_files; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:132
+ def sort_value_from(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:128
+ def spec_file_from(ex_id); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:75
+ def merge(this_run, from_previous_runs); end
+ end
+end
+
+# Parses a string that has been previously dumped by ExampleStatusDumper.
+# Note that this parser is a bit naive in that it does a simple split on
+# "\n" and " | ", with no concern for handling escaping. For now, that's
+# OK because the values we plan to persist (example id, status, and perhaps
+# example duration) are highly unlikely to contain "\n" or " | " -- after
+# all, who puts those in file names?
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:207
+class RSpec::Core::ExampleStatusParser
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:212
+ def initialize(string); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:216
+ def parse; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:226
+ def headers; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:222
+ def parse_row(line); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:230
+ def split_line(line); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:208
+ def parse(string); end
+ end
+end
+
+# Persists example ids and their statuses so that we can filter
+# to just the ones that failed the last time they ran.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:8
+class RSpec::Core::ExampleStatusPersister
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:18
+ def initialize(examples, file_name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:23
+ def persist; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:40
+ def dump_statuses(unparsed_previous_runs); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:46
+ def statuses_from_this_run; end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:9
+ def load_from(file_name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/example_status_persister.rb:14
+ def persist(examples, file_name); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:183
+RSpec::Core::ExclusionRules = RSpec::Core::FilterRules
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:4
+class RSpec::Core::FilterManager
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:7
+ def initialize; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:22
+ def add_ids(rerun_path, scoped_ids); end
+
+ # @api private
+ #
+ # @param file_path [String]
+ # @param line_numbers [Array]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:15
+ def add_location(file_path, line_numbers); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:30
+ def empty?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:57
+ def exclude(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:61
+ def exclude_only(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:65
+ def exclude_with_low_priority(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:5
+ def exclusions; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:69
+ def include(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:73
+ def include_only(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:77
+ def include_with_low_priority(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:5
+ def inclusions; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:34
+ def prune(examples); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:83
+ def add_path_to_arrays_filter(filter_key, path, values); end
+
+ # When a user specifies a particular spec location, that takes priority
+ # over any exclusion filters (such as if the spec is tagged with `:slow`
+ # and there is a `:slow => true` exclusion filter), but only for specs
+ # defined in the same file as the location filters. Excluded specs in
+ # other files should still be excluded.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:101
+ def file_scoped_include?(ex_metadata, ids, locations); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:89
+ def prune_conditionally_filtered_examples(examples); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:115
+class RSpec::Core::FilterRules
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:130
+ def initialize(rules = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:161
+ def [](key); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:134
+ def add(updated); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:138
+ def add_with_low_priority(updated); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:149
+ def clear; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:153
+ def delete(key); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:173
+ def description; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:169
+ def each_pair(&block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:165
+ def empty?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:157
+ def fetch(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:177
+ def include_example?(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:119
+ def opposite; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:119
+ def opposite=(_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:120
+ def rules; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:144
+ def use_only(updated); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:122
+ def build; end
+ end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:116
+RSpec::Core::FilterRules::PROC_HEX_NUMBER = T.let(T.unsafe(nil), Regexp)
+
+# pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:117
+RSpec::Core::FilterRules::PROJECT_DIR = T.let(T.unsafe(nil), String)
+
+# Tracks a collection of filterable items (e.g. modules, hooks, etc)
+# and provides an optimized API to get the applicable items for the
+# metadata of an example or example group.
+#
+# There are two implementations, optimized for different uses.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:87
+module RSpec::Core::FilterableItemRepository; end
+
+# This implementation is much more complex, and is optimized for
+# rare (or hopefully no) updates once the queries start. Updates
+# incur a cost as it has to clear the memoization and keep track
+# of applicable keys. Queries will be O(N) the first time an item
+# is provided with a given set of applicable metadata; subsequent
+# queries with items with the same set of applicable metadata will
+# be O(1) due to internal memoization.
+#
+# This is ideal for use by config, where filterable items (e.g. hooks)
+# are typically added at the start of the process (e.g. in `spec_helper`)
+# and then repeatedly queried as example groups and examples are defined.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:151
+class RSpec::Core::FilterableItemRepository::QueryOptimized < ::RSpec::Core::FilterableItemRepository::UpdateOptimized
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:155
+ def initialize(applies_predicate); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:164
+ def append(item, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:174
+ def delete(item, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:179
+ def items_for(metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:169
+ def prepend(item, metadata); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:217
+ def applicable_metadata_from(metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:152
+ def find_items_for(request_meta); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:211
+ def handle_mutation(metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:235
+ def proc_keys_from(metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:203
+ def reconstruct_caches; end
+end
+
+# This implementation is simple, and is optimized for frequent
+# updates but rare queries. `append` and `prepend` do no extra
+# processing, and no internal memoization is done, since this
+# is not optimized for queries.
+#
+# This is ideal for use by a example or example group, which may
+# be updated multiple times with globally configured hooks, etc,
+# but will not be queried frequently by other examples or example
+# groups.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:98
+class RSpec::Core::FilterableItemRepository::UpdateOptimized
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:101
+ def initialize(applies_predicate); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:106
+ def append(item, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:114
+ def delete(item, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:99
+ def items_and_filters; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:118
+ def items_for(request_meta); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:110
+ def prepend(item, metadata); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/flat_map.rb:4
+module RSpec::Core::FlatMap
+ private
+
+ # for 1.8.7
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/flat_map.rb:6
+ def flat_map(array, &block); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/flat_map.rb:17
+ def flat_map(array, &block); end
+ end
+end
+
+# ## Built-in Formatters
+#
+# * progress (default) - Prints dots for passing examples, `F` for failures, `*`
+# for pending.
+# * documentation - Prints the docstrings passed to `describe` and `it` methods
+# (and their aliases).
+# * html
+# * json - Useful for archiving data for subsequent analysis.
+#
+# The progress formatter is the default, but you can choose any one or more of
+# the other formatters by passing with the `--format` (or `-f` for short)
+# command-line option, e.g.
+#
+# rspec --format documentation
+#
+# You can also send the output of multiple formatters to different streams, e.g.
+#
+# rspec --format documentation --format html --out results.html
+#
+# This example sends the output of the documentation formatter to `$stdout`, and
+# the output of the html formatter to results.html.
+#
+# ## Custom Formatters
+#
+# You can tell RSpec to use a custom formatter by passing its path and name to
+# the `rspec` command. For example, if you define MyCustomFormatter in
+# path/to/my_custom_formatter.rb, you would type this command:
+#
+# rspec --require path/to/my_custom_formatter.rb --format MyCustomFormatter
+#
+# The reporter calls every formatter with this protocol:
+#
+# * To start
+# * `start(StartNotification)`
+# * Once per example group
+# * `example_group_started(GroupNotification)`
+# * Once per example
+# * `example_started(ExampleNotification)`
+# * One of these per example, depending on outcome
+# * `example_passed(ExampleNotification)`
+# * `example_failed(FailedExampleNotification)`
+# * `example_pending(ExampleNotification)`
+# * Optionally at any time
+# * `message(MessageNotification)`
+# * At the end of the suite
+# * `stop(ExamplesNotification)`
+# * `start_dump(NullNotification)`
+# * `dump_pending(ExamplesNotification)`
+# * `dump_failures(ExamplesNotification)`
+# * `dump_summary(SummaryNotification)`
+# * `seed(SeedNotification)`
+# * `close(NullNotification)`
+#
+# Only the notifications to which you subscribe your formatter will be called
+# on your formatter. To subscribe your formatter use:
+# `RSpec::Core::Formatters#register` e.g.
+#
+# `RSpec::Core::Formatters.register FormatterClassName, :example_passed, :example_failed`
+#
+# We recommend you implement the methods yourself; for simplicity we provide the
+# default formatter output via our notification objects but if you prefer you
+# can subclass `RSpec::Core::Formatters::BaseTextFormatter` and override the
+# methods you wish to enhance.
+#
+# @see RSpec::Core::Formatters::BaseTextFormatter
+# @see RSpec::Core::Reporter
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:3
+module RSpec::Core::Formatters
+ class << self
+ # Register the formatter class
+ # @param formatter_class [Class] formatter class to register
+ # @param notifications [Array] one or more notifications to be
+ # registered to the specified formatter
+ #
+ # @see RSpec::Core::Formatters::BaseFormatter
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:86
+ def register(formatter_class, *notifications); end
+ end
+end
+
+# Contains common logic for formatters used by `--bisect` to communicate results
+# back to the bisect runner.
+#
+# Subclasses must define a `notify_results(all_example_ids, failed_example_ids)`
+# method.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/base_bisect_formatter.rb:12
+class RSpec::Core::Formatters::BaseBisectFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_bisect_formatter.rb:17
+ def initialize(expected_failures); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_bisect_formatter.rb:23
+ def example_failed(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_bisect_formatter.rb:27
+ def example_finished(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_bisect_formatter.rb:37
+ def start_dump(_notification); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_bisect_formatter.rb:13
+ def inherited(formatter); end
+ end
+end
+
+# RSpec's built-in formatters are all subclasses of
+# RSpec::Core::Formatters::BaseFormatter.
+#
+# @see RSpec::Core::Formatters::BaseTextFormatter
+# @see RSpec::Core::Reporter
+# @see RSpec::Core::Formatters::Protocol
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:13
+class RSpec::Core::Formatters::BaseFormatter
+ # @api public
+ # @param output [IO] the formatter output
+ # @see RSpec::Core::Formatters::Protocol#initialize
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:23
+ def initialize(output); end
+
+ # @api public
+ #
+ # @param _notification [NullNotification] (Ignored)
+ # @see RSpec::Core::Formatters::Protocol#close
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:50
+ def close(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:17
+ def example_group; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:17
+ def example_group=(_arg0); end
+
+ # @api public
+ #
+ # @param notification [GroupNotification] containing example_group
+ # subclass of `RSpec::Core::ExampleGroup`
+ # @see RSpec::Core::Formatters::Protocol#example_group_started
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:42
+ def example_group_started(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:18
+ def output; end
+
+ # @api public
+ #
+ # @param notification [StartNotification]
+ # @see RSpec::Core::Formatters::Protocol#start
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:32
+ def start(notification); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:64
+ def output_supports_sync; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:60
+ def restore_sync_output; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_formatter.rb:56
+ def start_sync_output; end
+end
+
+# Base for all of RSpec's built-in formatters. See
+# RSpec::Core::Formatters::BaseFormatter to learn more about all of the
+# methods called by the reporter.
+#
+# @see RSpec::Core::Formatters::BaseFormatter
+# @see RSpec::Core::Reporter
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:12
+class RSpec::Core::Formatters::BaseTextFormatter < ::RSpec::Core::Formatters::BaseFormatter
+ # @api public
+ #
+ # Invoked at the end of a suite run. Allows the formatter to do any
+ # tidying up, but be aware that formatter output streams may be used
+ # elsewhere so don't actually close them.
+ #
+ # @param _notification [NullNotification] (Ignored)
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:65
+ def close(_notification); end
+
+ # @api public
+ #
+ # Dumps detailed information about each example failure.
+ #
+ # @param notification [NullNotification]
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:30
+ def dump_failures(notification); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:47
+ def dump_pending(notification); end
+
+ # @api public
+ #
+ # This method is invoked after the dumping of examples and failures.
+ # Each parameter is assigned to a corresponding attribute.
+ #
+ # @param summary [SummaryNotification] containing duration,
+ # example_count, failure_count and pending_count
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:42
+ def dump_summary(summary); end
+
+ # @api public
+ #
+ # Used by the reporter to send messages to the output stream.
+ #
+ # @param notification [MessageNotification] containing message
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:21
+ def message(notification); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/base_text_formatter.rb:53
+ def seed(notification); end
+end
+
+# Used by `--bisect`. When it shells out and runs a portion of the suite, it uses
+# this formatter as a means to have the status reported back to it, via DRb.
+#
+# Note that since DRb calls carry considerable overhead compared to normal
+# method calls, we try to minimize the number of DRb calls for perf reasons,
+# opting to communicate only at the start and the end of the run, rather than
+# after each example.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/bisect_drb_formatter.rb:15
+class RSpec::Core::Formatters::BisectDRbFormatter < ::RSpec::Core::Formatters::BaseBisectFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/bisect_drb_formatter.rb:16
+ def initialize(_output); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/bisect_drb_formatter.rb:23
+ def notify_results(results); end
+end
+
+# ConsoleCodes provides helpers for formatting console output
+# with ANSI codes, e.g. color's and bold.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:6
+module RSpec::Core::Formatters::ConsoleCodes
+ private
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:34
+ def config_colors_to_methods; end
+
+ # Fetches the correct code for the supplied symbol, or checks
+ # that a code is valid. Defaults to white (37).
+ #
+ # @param code_or_symbol [Symbol, Fixnum] Symbol or code to check
+ # @return [Fixnum] a console code
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:47
+ def console_code_for(code_or_symbol); end
+
+ # Wraps a piece of text in ANSI codes with the supplied code. Will
+ # only apply the control code if `RSpec.configuration.color_enabled?`
+ # returns true.
+ #
+ # @param text [String] the text to wrap
+ # @param code_or_symbol [Symbol, Fixnum] the desired control code
+ # @return [String] the wrapped text
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:66
+ def wrap(text, code_or_symbol); end
+
+ class << self
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:34
+ def config_colors_to_methods; end
+
+ # Fetches the correct code for the supplied symbol, or checks
+ # that a code is valid. Defaults to white (37).
+ #
+ # @param code_or_symbol [Symbol, Fixnum] Symbol or code to check
+ # @return [Fixnum] a console code
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:47
+ def console_code_for(code_or_symbol); end
+
+ # Wraps a piece of text in ANSI codes with the supplied code. Will
+ # only apply the control code if `RSpec.configuration.color_enabled?`
+ # returns true.
+ #
+ # @param text [String] the text to wrap
+ # @param code_or_symbol [Symbol, Fixnum] the desired control code
+ # @return [String] the wrapped text
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:66
+ def wrap(text, code_or_symbol); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:8
+RSpec::Core::Formatters::ConsoleCodes::VT100_CODES = T.let(T.unsafe(nil), Hash)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/console_codes.rb:29
+RSpec::Core::Formatters::ConsoleCodes::VT100_CODE_VALUES = T.let(T.unsafe(nil), Hash)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:7
+class RSpec::Core::Formatters::DeprecationFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:12
+ def initialize(deprecation_stream, summary_stream); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:10
+ def count; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:32
+ def deprecation(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:44
+ def deprecation_message_for(data); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:10
+ def deprecation_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:40
+ def deprecation_summary(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:18
+ def output; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:20
+ def printer; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:10
+ def summary_stream; end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:60
+RSpec::Core::Formatters::DeprecationFormatter::DEPRECATION_STREAM_NOTICE = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:135
+class RSpec::Core::Formatters::DeprecationFormatter::DelayedPrinter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:140
+ def initialize(deprecation_stream, summary_stream, deprecation_formatter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:138
+ def deprecation_formatter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:138
+ def deprecation_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:163
+ def deprecation_summary; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:172
+ def print_deferred_deprecation_warnings; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:148
+ def print_deprecation_message(data); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:155
+ def stash_deprecation_message(deprecation_message); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:138
+ def summary_stream; end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:136
+RSpec::Core::Formatters::DeprecationFormatter::DelayedPrinter::TOO_MANY_USES_LIMIT = T.let(T.unsafe(nil), Integer)
+
+# @private
+# Wraps a File object and provides file-specific operations.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:196
+class RSpec::Core::Formatters::DeprecationFormatter::FileStream
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:197
+ def initialize(file); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:207
+ def puts(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:211
+ def summarize(summary_stream, deprecation_count); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+class RSpec::Core::Formatters::DeprecationFormatter::GeneratedDeprecationMessage < ::Struct
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:95
+ def initialize(data); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:100
+ def to_s; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:107
+ def too_many_warnings_message; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def type; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def type=(_); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def [](*_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def inspect; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def keyword_init?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def members; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:94
+ def new(*_arg0); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:113
+class RSpec::Core::Formatters::DeprecationFormatter::ImmediatePrinter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:116
+ def initialize(deprecation_stream, summary_stream, deprecation_formatter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:114
+ def deprecation_formatter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:114
+ def deprecation_stream; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:128
+ def deprecation_summary; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:123
+ def print_deprecation_message(data); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:114
+ def summary_stream; end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:52
+RSpec::Core::Formatters::DeprecationFormatter::RAISE_ERROR_CONFIG_NOTICE = T.let(T.unsafe(nil), String)
+
+# @private
+# Not really a stream, but is usable in place of one.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:184
+class RSpec::Core::Formatters::DeprecationFormatter::RaiseErrorStream
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:185
+ def puts(message); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:189
+ def summarize(summary_stream, deprecation_count); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+class RSpec::Core::Formatters::DeprecationFormatter::SpecifiedDeprecationMessage < ::Struct
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:67
+ def initialize(data); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:72
+ def to_s; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:76
+ def too_many_warnings_message; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def type; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def type=(_); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:88
+ def deprecation_type_for(data); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:82
+ def output_formatted(str); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def [](*_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def inspect; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def keyword_init?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def members; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:66
+ def new(*_arg0); end
+ end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/deprecation_formatter.rb:62
+RSpec::Core::Formatters::DeprecationFormatter::TOO_MANY_WARNINGS_NOTICE = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:8
+class RSpec::Core::Formatters::DocumentationFormatter < ::RSpec::Core::Formatters::BaseTextFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:12
+ def initialize(output); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:50
+ def example_failed(failure); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:31
+ def example_group_finished(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:24
+ def example_group_started(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:35
+ def example_passed(passed); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:42
+ def example_pending(pending); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:20
+ def example_started(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:57
+ def message(notification); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:96
+ def current_indentation(offset = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:85
+ def failure_output(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:67
+ def flush_messages; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:91
+ def next_failure_index; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:75
+ def passed_output(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/documentation_formatter.rb:79
+ def pending_output(example, message); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:11
+class RSpec::Core::Formatters::ExceptionPresenter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:16
+ def initialize(exception, example, options = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:78
+ def colorized_formatted_backtrace(colorizer = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:33
+ def colorized_message_lines(colorizer = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def description; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def example; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def exception; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:39
+ def formatted_backtrace(exception = T.unsafe(nil)); end
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:45
+ def formatted_cause(exception); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:84
+ def fully_formatted(failure_number, colorizer = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:89
+ def fully_formatted_lines(failure_number, colorizer); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:29
+ def message_lines; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:226
+ def add_shared_group_lines(lines, colorizer); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def backtrace_formatter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def detail_formatter; end
+
+ # for 1.8.7
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:287
+ def encoded_description(description); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:120
+ def encoded_string(string); end
+
+ # for 1.8.7
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:116
+ def encoding_of(string); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:299
+ def exception_backtrace; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:150
+ def exception_class_name(exception = T.unsafe(nil)); end
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:204
+ def exception_lines; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:185
+ def exception_message_string(exception); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def extra_detail_formatter; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:215
+ def extra_failure_lines; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:156
+ def failure_lines; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:170
+ def failure_slash_error_lines; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:104
+ def final_exception(exception, previous = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:262
+ def find_failed_line; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:278
+ def formatted_message_and_backtrace(colorizer); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:134
+ def indent_lines(lines, failure_number); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:12
+ def message_color; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:236
+ def read_failed_lines; end
+end
+
+# @private
+# Configuring the `ExceptionPresenter` with the right set of options to handle
+# pending vs failed vs skipped and aggregated (or not) failures is not simple.
+# This class takes care of building an appropriate `ExceptionPresenter` for the
+# provided example.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:308
+class RSpec::Core::Formatters::ExceptionPresenter::Factory
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:315
+ def initialize(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:309
+ def build; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:370
+ def multiple_exception_summarizer(exception, prior_detail_formatter, color); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:366
+ def multiple_exceptions_error?(exception); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:325
+ def options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:329
+ def pending_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:391
+ def sub_failure_list_formatter(exception, message_color); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:350
+ def with_multiple_error_options_as_needed(exception, options); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:424
+class RSpec::Core::Formatters::ExceptionPresenter::Factory::CommonBacktraceTruncater
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:425
+ def initialize(parent); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:429
+ def with_truncated_backtrace(child); end
+end
+
+# @private
+# Used to prevent a confusing backtrace from showing up from the `aggregate_failures`
+# block declared for `:aggregate_failures` metadata.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:417
+module RSpec::Core::Formatters::ExceptionPresenter::Factory::EmptyBacktraceFormatter
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:418
+ def format_backtrace(*_arg0); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:449
+RSpec::Core::Formatters::ExceptionPresenter::PENDING_DETAIL_FORMATTER = T.let(T.unsafe(nil), Proc)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/failure_list_formatter.rb:7
+class RSpec::Core::Formatters::FailureListFormatter < ::RSpec::Core::Formatters::BaseFormatter
+ # Discard profile and messages
+ #
+ # These outputs are not really relevant in the context of this failure
+ # list formatter.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/failure_list_formatter.rb:18
+ def dump_profile(_profile); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/failure_list_formatter.rb:10
+ def example_failed(failure); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/failure_list_formatter.rb:19
+ def message(_message); end
+end
+
+# @api private
+# Formatter for providing message output as a fallback when no other
+# profiler implements #message
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/fallback_message_formatter.rb:7
+class RSpec::Core::Formatters::FallbackMessageFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/fallback_message_formatter.rb:10
+ def initialize(output); end
+
+ # @api public
+ #
+ # Used by the reporter to send messages to the output stream.
+ #
+ # @param notification [MessageNotification] containing message
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/fallback_message_formatter.rb:22
+ def message(notification); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/fallback_message_formatter.rb:15
+ def output; end
+end
+
+# Formatters helpers.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:7
+module RSpec::Core::Formatters::Helpers
+ class << self
+ # @api private
+ #
+ # Formats seconds into a human-readable string.
+ #
+ # @param duration [Float, Fixnum] in seconds
+ # @return [String] human-readable time
+ #
+ # @example
+ # format_duration(1) #=> "1 minute 1 second"
+ # format_duration(135.14) #=> "2 minutes 15.14 seconds"
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:24
+ def format_duration(duration); end
+
+ # @api private
+ #
+ # Formats seconds to have 5 digits of precision with trailing zeros
+ # removed if the number is less than 1 or with 2 digits of precision if
+ # the number is greater than zero.
+ #
+ # @param float [Float]
+ # @return [String] formatted float
+ #
+ # @example
+ # format_seconds(0.000006) #=> "0.00001"
+ # format_seconds(0.020000) #=> "0.02"
+ # format_seconds(1.00000000001) #=> "1"
+ #
+ # The precision used is set in {Helpers::SUB_SECOND_PRECISION} and
+ # {Helpers::DEFAULT_PRECISION}.
+ #
+ # @see #strip_trailing_zeroes
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:60
+ def format_seconds(float, precision = T.unsafe(nil)); end
+
+ # @api private
+ # Given a list of example ids, organizes them into a compact, ordered list.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:102
+ def organize_ids(ids); end
+
+ # @api private
+ #
+ # Pluralize a word based on a count.
+ #
+ # @param count [Fixnum] number of objects
+ # @param string [String] word to be pluralized
+ # @return [String] pluralized word
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:88
+ def pluralize(count, string); end
+
+ private
+
+ # @api private
+ #
+ # Remove trailing zeros from a string.
+ #
+ # Only remove trailing zeros after a decimal place.
+ # see: http://rubular.com/r/ojtTydOgpn
+ #
+ # @param string [String] string with trailing zeros
+ # @return [String] string with trailing zeros removed
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:76
+ def strip_trailing_zeroes(string); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:12
+RSpec::Core::Formatters::Helpers::DEFAULT_PRECISION = T.let(T.unsafe(nil), Integer)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/helpers.rb:9
+RSpec::Core::Formatters::Helpers::SUB_SECOND_PRECISION = T.let(T.unsafe(nil), Integer)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:8
+class RSpec::Core::Formatters::HtmlFormatter < ::RSpec::Core::Formatters::BaseFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:13
+ def initialize(output); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:103
+ def dump_summary(summary); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:55
+ def example_failed(failure); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:28
+ def example_group_started(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:49
+ def example_passed(passed); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:93
+ def example_pending(pending); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:45
+ def example_started(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:22
+ def start(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:40
+ def start_dump(_notification); end
+
+ private
+
+ # The number of the currently running example_group.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:120
+ def example_group_number; end
+
+ # The number of the currently running example (a global counter).
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:125
+ def example_number; end
+
+ # Override this method if you wish to output extra HTML for a failed
+ # spec. For example, you could output links to images or other files
+ # produced during the specs.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:141
+ def extra_failure_content(failure); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_formatter.rb:130
+ def percent_done; end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:7
+class RSpec::Core::Formatters::HtmlPrinter
+ include ::ERB::Escape
+ include ::ERB::Util
+
+ # For the #h method.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:9
+ def initialize(output); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:79
+ def flush; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:96
+ def make_example_group_header_red(group_id); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:103
+ def make_example_group_header_yellow(group_id); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:88
+ def make_header_red; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:92
+ def make_header_yellow; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:83
+ def move_progress(percent_done); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:36
+ def print_example_failed(pending_fixed, description, run_time, failure_id, exception, extra_content); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:18
+ def print_example_group_end; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:23
+ def print_example_group_start(group_id, description, number_of_parents); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:29
+ def print_example_passed(description, run_time); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:53
+ def print_example_pending(description, pending_message); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:13
+ def print_html_start; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:59
+ def print_summary(duration, example_count, failure_count, pending_count); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:112
+ def indentation_style(number_of_parents); end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:140
+RSpec::Core::Formatters::HtmlPrinter::GLOBAL_SCRIPTS = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:218
+RSpec::Core::Formatters::HtmlPrinter::GLOBAL_STYLES = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:382
+RSpec::Core::Formatters::HtmlPrinter::HTML_HEADER = T.let(T.unsafe(nil), String)
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/html_printer.rb:116
+RSpec::Core::Formatters::HtmlPrinter::REPORT_HEADER = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:8
+class RSpec::Core::Formatters::JsonFormatter < ::RSpec::Core::Formatters::BaseFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:13
+ def initialize(output); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:56
+ def close(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:60
+ def dump_profile(profile); end
+
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:79
+ def dump_profile_slowest_example_groups(profile); end
+
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:67
+ def dump_profile_slowest_examples(profile); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:24
+ def dump_summary(summary); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:20
+ def message(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:11
+ def output_hash; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:51
+ def seed(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:35
+ def stop(group_notification); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/json_formatter.rb:88
+ def format_example(example); end
+end
+
+# @api private
+#
+# `RSpec::Core::Formatters::Loader` is an internal class for
+# managing formatters used by a particular configuration. It is
+# not expected to be used directly, but only through the configuration
+# interface.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters.rb:96
+class RSpec::Core::Formatters::Loader
+ # @api private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:105
+ def initialize(reporter); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:144
+ def add(formatter_to_use, *paths); end
+
+ # @return [String] the default formatter to setup, defaults to `progress`
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:118
+ def default_formatter; end
+
+ # @return [String] the default formatter to setup, defaults to `progress`
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:118
+ def default_formatter=(_arg0); end
+
+ # @return [Array] the loaded formatters
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:112
+ def formatters; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:121
+ def prepare_default(output_stream, deprecation_stream); end
+
+ # @return [Reporter] the reporter
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:115
+ def reporter; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:126
+ def setup_default(output_stream, deprecation_stream); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:211
+ def built_in_formatter(key); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:234
+ def custom_formatter(formatter_ref); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:195
+ def duplicate_formatter_exists?(new_formatter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:207
+ def existing_formatter_implements?(notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:181
+ def find_formatter(formatter_to_use); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:202
+ def has_matching_output?(formatter, new_formatter); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:228
+ def notifications_for(formatter_class); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:269
+ def open_stream(path_or_wrapper); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:250
+ def path_for(const_ref); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:188
+ def register(formatter, notifications); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:246
+ def string_const?(str); end
+
+ # activesupport/lib/active_support/inflector/methods.rb, line 48
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:259
+ def underscore(camel_cased_word); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:254
+ def underscore_with_fix_for_non_standard_rspec_naming(string); end
+
+ class << self
+ # @api private
+ #
+ # Internal formatters are stored here when loaded.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters.rb:100
+ def formatters; end
+ end
+end
+
+# @api private
+# Formatter for providing profile output.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:8
+class RSpec::Core::Formatters::ProfileFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:11
+ def initialize(output); end
+
+ # @api public
+ #
+ # This method is invoked after the dumping the summary if profiling is
+ # enabled.
+ #
+ # @param profile [ProfileNotification] containing duration,
+ # slowest_examples and slowest_example_groups
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:25
+ def dump_profile(profile); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:16
+ def output; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:62
+ def bold(text); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:44
+ def dump_profile_slowest_example_groups(profile); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:32
+ def dump_profile_slowest_examples(profile); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/profile_formatter.rb:57
+ def format_caller(caller_info); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/progress_formatter.rb:8
+class RSpec::Core::Formatters::ProgressFormatter < ::RSpec::Core::Formatters::BaseTextFormatter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/progress_formatter.rb:19
+ def example_failed(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/progress_formatter.rb:11
+ def example_passed(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/progress_formatter.rb:15
+ def example_pending(_notification); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/progress_formatter.rb:23
+ def start_dump(_notification); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:5
+class RSpec::Core::Formatters::SnippetExtractor
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:35
+ def initialize(source, beginning_line_number, max_line_count = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:24
+ def beginning_line_number; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:41
+ def expression_lines; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:24
+ def max_line_count; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:24
+ def source; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:95
+ def expression_node; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:107
+ def expression_outmost_node?(node); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:55
+ def line_range_of_expression; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:87
+ def line_range_of_location_nodes_in_expression; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:117
+ def location_nodes_at_beginning_line; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:70
+ def unclosed_tokens_in_line_range(line_range); end
+
+ class << self
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:26
+ def extract_expression_lines_at(file_path, beginning_line_number, max_line_count = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:9
+ def extract_line_at(file_path, line_number); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:128
+ def least_indentation_from(lines); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:16
+ def source_from_file(path); end
+ end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:22
+class RSpec::Core::Formatters::SnippetExtractor::NoExpressionAtLineError < ::StandardError; end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:6
+class RSpec::Core::Formatters::SnippetExtractor::NoSuchFileError < ::StandardError; end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/snippet_extractor.rb:7
+class RSpec::Core::Formatters::SnippetExtractor::NoSuchLineError < ::StandardError; end
+
+# @private
+# Provides terminal syntax highlighting of code snippets
+# when coderay is available.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:7
+class RSpec::Core::Formatters::SyntaxHighlighter
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:8
+ def initialize(configuration); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:12
+ def highlight(lines); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:50
+ def color_enabled_implementation; end
+
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:44
+ def implementation; end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:18
+ def attempt_to_add_rspec_terms_to_coderay_keywords; end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:61
+module RSpec::Core::Formatters::SyntaxHighlighter::CodeRayImplementation
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:64
+ def highlight_syntax(lines); end
+ end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:62
+RSpec::Core::Formatters::SyntaxHighlighter::CodeRayImplementation::RESET_CODE = T.let(T.unsafe(nil), String)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:78
+module RSpec::Core::Formatters::SyntaxHighlighter::NoSyntaxHighlightingImplementation
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:79
+ def highlight_syntax(lines); end
+ end
+end
+
+# @private
+# Not sure why, but our code above (and/or coderay itself) does not work
+# on Windows, so we disable the feature on Windows.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/syntax_highlighter.rb:87
+RSpec::Core::Formatters::SyntaxHighlighter::WindowsImplementation = RSpec::Core::Formatters::SyntaxHighlighter::NoSyntaxHighlightingImplementation
+
+# Mixin that makes the including class imitate a hash for backwards
+# compatibility. The including class should use `attr_accessor` to
+# declare attributes.
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:349
+module RSpec::Core::HashImitatable
+ mixes_in_class_methods ::RSpec::Core::HashImitatable::ClassMethods
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def <(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def <=(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def >(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def >=(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:388
+ def [](key); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:398
+ def []=(key, value); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def all?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def any?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def assoc(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def chain(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def chunk(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def chunk_while(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def clear(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def collect(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def collect_concat(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def compact(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def compact!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def compare_by_identity(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def compare_by_identity?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def count(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def cycle(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def deconstruct_keys(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def deep_merge(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def deep_merge!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def deep_merge?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def default(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def default=(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def default_proc(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def default_proc=(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def delete(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def delete_if(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def detect(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def dig(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def drop(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def drop_while(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_cons(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_entry(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_key(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_pair(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_slice(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_value(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_with_index(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def each_with_object(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def empty?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def entries(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def except(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def except!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def extract!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def fetch(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def fetch_values(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def filter(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def filter!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def filter_map(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def find(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def find_all(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def find_index(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def first(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def flat_map(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def flatten(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def grep(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def grep_v(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def group_by(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def has_key?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def has_value?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def include?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def inject(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def invert(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def keep_if(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def key(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def key?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def keys(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def lazy(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def length(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def map(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def max(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def max_by(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def member?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def merge(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def merge!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def min(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def min_by(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def minmax(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def minmax_by(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def none?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def one?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def partition(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def rassoc(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def reduce(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def rehash(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def reject(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def reject!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def replace(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def reverse_each(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def select(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def select!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def shift(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def size(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def slice(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def slice!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def slice_after(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def slice_before(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def slice_when(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def sort(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def sort_by(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def store(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def sum(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def take(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def take_while(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def tally(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def to_a(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:354
+ def to_h; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def to_hash(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def to_proc(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def to_set(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def transform_keys(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def transform_keys!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def transform_values(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def transform_values!(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def uniq(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def update(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def value?(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def values(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def values_at(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:367
+ def zip(*args, &block); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:414
+ def directly_supports_attribute?(name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:410
+ def extra_hash_attributes; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:418
+ def get_value(name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:426
+ def hash_for_delegation; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:430
+ def issue_deprecation(_method_name, *_args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:422
+ def set_value(name, value); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:350
+ def included(klass); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:435
+module RSpec::Core::HashImitatable::ClassMethods
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:440
+ def attr_accessor(*names); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:436
+ def hash_attribute_names; end
+end
+
+# Provides `before`, `after` and `around` hooks as a means of
+# supporting common setup and teardown. This module is extended
+# onto {ExampleGroup}, making the methods available from any `describe`
+# or `context` block and included in {Configuration}, making them
+# available off of the configuration object to define global setup
+# or teardown logic.
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:9
+module RSpec::Core::Hooks
+ # @api public
+ # @overload after(&block)
+ # @overload after(scope, &block)
+ # @param scope [Symbol] `:example`, `:context`, or `:suite` (defaults to
+ # `:example`)
+ # @overload after(scope, *conditions, &block)
+ # @param scope [Symbol] `:example`, `:context`, or `:suite` (defaults to
+ # `:example`)
+ # @param conditions [Array, Hash] constrains this hook to
+ # examples matching these conditions e.g.
+ # `after(:example, :ui => true) { ... }` will only run with examples
+ # or groups declared with `:ui => true`. Symbols will be transformed
+ # into hash entries with `true` values.
+ # @overload after(conditions, &block)
+ # @param conditions [Hash]
+ # constrains this hook to examples matching these conditions e.g.
+ # `after(:example, :ui => true) { ... }` will only run with examples
+ # or groups declared with `:ui => true`.
+ #
+ # @see #before
+ # @see #around
+ # @see ExampleGroup
+ # @see SharedContext
+ # @see SharedExampleGroup
+ # @see Configuration
+ #
+ # Declare a block of code to be run after each example (using `:example`)
+ # or once after all examples n the context (using `:context`). See
+ # {#before} for more information about ordering.
+ #
+ # ### Exceptions
+ #
+ # `after` hooks are guaranteed to run even when there are exceptions in
+ # `before` hooks or examples. When an exception is raised in an after
+ # block, the exception is captured for later reporting, and subsequent
+ # `after` blocks are run.
+ #
+ # ### Order
+ #
+ # `after` hooks are stored in three scopes, which are run in order:
+ # `:example`, `:context`, and `:suite`. They can also be declared in
+ # several different places: `RSpec.configure`, a parent group, the current
+ # group. They are run in the following order:
+ #
+ # after(:example) # Declared in the current group.
+ # after(:example) # Declared in a parent group.
+ # after(:example) # Declared in RSpec.configure.
+ # after(:context) # Declared in the current group.
+ # after(:context) # Declared in a parent group.
+ # after(:context) # Declared in RSpec.configure.
+ # after(:suite) # Declared in RSpec.configure.
+ #
+ # This is the reverse of the order in which `before` hooks are run.
+ # Similarly, if more than one `after` is declared within any example
+ # group, they are run in reverse order of that in which they are declared.
+ # Also `around` hooks will run after any `after` example hooks are
+ # invoked but before any `after` context hooks.
+ #
+ # @note The `:example` and `:context` scopes are also available as
+ # `:each` and `:all`, respectively. Use whichever you prefer.
+ # @note The `:suite` scope is only supported for hooks registered on
+ # `RSpec.configuration` since they exist independently of any
+ # example or example group.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:277
+ def after(*args, &block); end
+
+ # Adds `block` to the back of the list of `after` blocks in the same
+ # scope (`:example`, `:context`, or `:suite`).
+ #
+ # See {#after} for scoping semantics.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:287
+ def append_after(*args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:204
+ def append_before(*args, &block); end
+
+ # @api public
+ # @overload around(&block)
+ # @overload around(scope, &block)
+ # @param scope [Symbol] `:example` (defaults to `:example`)
+ # present for syntax parity with `before` and `after`, but
+ # `:example`/`:each` is the only supported value.
+ # @overload around(scope, *conditions, &block)
+ # @param scope [Symbol] `:example` (defaults to `:example`)
+ # present for syntax parity with `before` and `after`, but
+ # `:example`/`:each` is the only supported value.
+ # @param conditions [Array, Hash] constrains this hook to
+ # examples matching these conditions e.g.
+ # `around(:example, :ui => true) { ... }` will only run with examples
+ # or groups declared with `:ui => true`. Symbols will be transformed
+ # into hash entries with `true` values.
+ # @overload around(conditions, &block)
+ # @param conditions [Hash] constrains this hook to examples matching
+ # these conditions e.g. `around(:example, :ui => true) { ... }` will
+ # only run with examples or groups declared with `:ui => true`.
+ #
+ # @yield [Example] the example to run
+ #
+ # @note the syntax of `around` is similar to that of `before` and `after`
+ # but the semantics are quite different. `before` and `after` hooks are
+ # run in the context of the examples with which they are associated,
+ # whereas `around` hooks are actually responsible for running the
+ # examples. Consequently, `around` hooks do not have direct access to
+ # resources that are made available within the examples and their
+ # associated `before` and `after` hooks.
+ #
+ # @note `:example`/`:each` is the only supported scope.
+ #
+ # Declare a block of code, parts of which will be run before and parts
+ # after the example. It is your responsibility to run the example:
+ #
+ # around(:example) do |ex|
+ # # Do some stuff before.
+ # ex.run
+ # # Do some stuff after.
+ # end
+ #
+ # The yielded example aliases `run` with `call`, which lets you treat it
+ # like a `Proc`. This is especially handy when working with libraries
+ # that manage their own setup and teardown using a block or proc syntax,
+ # e.g.
+ #
+ # around(:example) {|ex| Database.transaction(&ex)}
+ # around(:example) {|ex| FakeFS(&ex)}
+ #
+ # ### Order
+ #
+ # The `around` hooks execute surrounding an example and its hooks.
+ #
+ # This means after any `before` context hooks, but before any `before`
+ # example hooks, and similarly after any `after` example hooks but before
+ # any `after` context hooks.
+ #
+ # They are not a synonym for `before`/`after`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:349
+ def around(*args, &block); end
+
+ # @api public
+ #
+ # @overload before(&block)
+ # @overload before(scope, &block)
+ # @param scope [Symbol] `:example`, `:context`, or `:suite`
+ # (defaults to `:example`)
+ # @overload before(scope, *conditions, &block)
+ # @param scope [Symbol] `:example`, `:context`, or `:suite`
+ # (defaults to `:example`)
+ # @param conditions [Array, Hash] constrains this hook to
+ # examples matching these conditions e.g.
+ # `before(:example, :ui => true) { ... }` will only run with examples
+ # or groups declared with `:ui => true`. Symbols will be transformed
+ # into hash entries with `true` values.
+ # @overload before(conditions, &block)
+ # @param conditions [Hash]
+ # constrains this hook to examples matching these conditions e.g.
+ # `before(:example, :ui => true) { ... }` will only run with examples
+ # or groups declared with `:ui => true`.
+ #
+ # @see #after
+ # @see #around
+ # @see ExampleGroup
+ # @see SharedContext
+ # @see SharedExampleGroup
+ # @see Configuration
+ #
+ # Declare a block of code to be run before each example (using `:example`)
+ # or once before any example (using `:context`). These are usually
+ # declared directly in the {ExampleGroup} to which they apply, but they
+ # can also be shared across multiple groups.
+ #
+ # You can also use `before(:suite)` to run a block of code before any
+ # example groups are run. This should be declared in {RSpec.configure}.
+ #
+ # Instance variables declared in `before(:example)` or `before(:context)`
+ # are accessible within each example.
+ #
+ # ### Order
+ #
+ # `before` hooks are stored in three scopes, which are run in order:
+ # `:suite`, `:context`, and `:example`. They can also be declared in
+ # several different places: `RSpec.configure`, a parent group, the current
+ # group. They are run in the following order:
+ #
+ # before(:suite) # Declared in RSpec.configure.
+ # before(:context) # Declared in RSpec.configure.
+ # before(:context) # Declared in a parent group.
+ # before(:context) # Declared in the current group.
+ # before(:example) # Declared in RSpec.configure.
+ # before(:example) # Declared in a parent group.
+ # before(:example) # Declared in the current group.
+ #
+ # If more than one `before` is declared within any one example group, they
+ # are run in the order in which they are declared. Any `around` hooks will
+ # execute after `before` context hooks but before any `before` example
+ # hook regardless of where they are declared.
+ #
+ # ### Conditions
+ #
+ # When you add a conditions hash to `before(:example)` or
+ # `before(:context)`, RSpec will only apply that hook to groups or
+ # examples that match the conditions. e.g.
+ #
+ # RSpec.configure do |config|
+ # config.before(:example, :authorized => true) do
+ # log_in_as :authorized_user
+ # end
+ # end
+ #
+ # RSpec.describe Something, :authorized => true do
+ # # The before hook will run in before each example in this group.
+ # end
+ #
+ # RSpec.describe SomethingElse do
+ # it "does something", :authorized => true do
+ # # The before hook will run before this example.
+ # end
+ #
+ # it "does something else" do
+ # # The hook will not run before this example.
+ # end
+ # end
+ #
+ # Note that filtered config `:context` hooks can still be applied
+ # to individual examples that have matching metadata. Just like
+ # Ruby's object model is that every object has a singleton class
+ # which has only a single instance, RSpec's model is that every
+ # example has a singleton example group containing just the one
+ # example.
+ #
+ # ### Warning: `before(:suite, :with => :conditions)`
+ #
+ # The conditions hash is used to match against specific examples. Since
+ # `before(:suite)` is not run in relation to any specific example or
+ # group, conditions passed along with `:suite` are effectively ignored.
+ #
+ # ### Exceptions
+ #
+ # When an exception is raised in a `before` block, RSpec skips any
+ # subsequent `before` blocks and the example, but runs all of the
+ # `after(:example)` and `after(:context)` hooks.
+ #
+ # ### Warning: implicit before blocks
+ #
+ # `before` hooks can also be declared in shared contexts which get
+ # included implicitly either by you or by extension libraries. Since
+ # RSpec runs these in the order in which they are declared within each
+ # scope, load order matters, and can lead to confusing results when one
+ # before block depends on state that is prepared in another before block
+ # that gets run later.
+ #
+ # ### Warning: `before(:context)`
+ #
+ # It is very tempting to use `before(:context)` to speed things up, but we
+ # recommend that you avoid this as there are a number of gotchas, as well
+ # as things that simply don't work.
+ #
+ # #### Context
+ #
+ # `before(:context)` is run in an example that is generated to provide
+ # group context for the block.
+ #
+ # #### Instance variables
+ #
+ # Instance variables declared in `before(:context)` are shared across all
+ # the examples in the group. This means that each example can change the
+ # state of a shared object, resulting in an ordering dependency that can
+ # make it difficult to reason about failures.
+ #
+ # #### Unsupported RSpec constructs
+ #
+ # RSpec has several constructs that reset state between each example
+ # automatically. These are not intended for use from within
+ # `before(:context)`:
+ #
+ # * `let` declarations
+ # * `subject` declarations
+ # * Any mocking, stubbing or test double declaration
+ #
+ # ### other frameworks
+ #
+ # Mock object frameworks and database transaction managers (like
+ # ActiveRecord) are typically designed around the idea of setting up
+ # before an example, running that one example, and then tearing down. This
+ # means that mocks and stubs can (sometimes) be declared in
+ # `before(:context)`, but get torn down before the first real example is
+ # ever run.
+ #
+ # You _can_ create database-backed model objects in a `before(:context)`
+ # in rspec-rails, but it will not be wrapped in a transaction for you, so
+ # you are on your own to clean up in an `after(:context)` block.
+ #
+ # @example before(:example) declared in an {ExampleGroup}
+ #
+ # RSpec.describe Thing do
+ # before(:example) do
+ # @thing = Thing.new
+ # end
+ #
+ # it "does something" do
+ # # Here you can access @thing.
+ # end
+ # end
+ #
+ # @example before(:context) declared in an {ExampleGroup}
+ #
+ # RSpec.describe Parser do
+ # before(:context) do
+ # File.open(file_to_parse, 'w') do |f|
+ # f.write <<-CONTENT
+ # stuff in the file
+ # CONTENT
+ # end
+ # end
+ #
+ # it "parses the file" do
+ # Parser.parse(file_to_parse)
+ # end
+ #
+ # after(:context) do
+ # File.delete(file_to_parse)
+ # end
+ # end
+ #
+ # @note The `:example` and `:context` scopes are also available as
+ # `:each` and `:all`, respectively. Use whichever you prefer.
+ # @note The `:suite` scope is only supported for hooks registered on
+ # `RSpec.configuration` since they exist independently of any
+ # example or example group.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:200
+ def before(*args, &block); end
+
+ # @private
+ # Holds the various registered hooks.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:355
+ def hooks; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:281
+ def prepend_after(*args, &block); end
+
+ # Adds `block` to the front of the list of `before` blocks in the same
+ # scope (`:example`, `:context`, or `:suite`).
+ #
+ # See {#before} for scoping semantics.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:210
+ def prepend_before(*args, &block); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:379
+class RSpec::Core::Hooks::AfterContextHook < ::RSpec::Core::Hooks::Hook
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:380
+ def run(example); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:370
+class RSpec::Core::Hooks::AfterHook < ::RSpec::Core::Hooks::Hook
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:371
+ def run(example); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:388
+class RSpec::Core::Hooks::AroundHook < ::RSpec::Core::Hooks::Hook
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:389
+ def execute_with(example, procsy); end
+
+ # for 1.8.7
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:397
+ def hook_description; end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:363
+class RSpec::Core::Hooks::BeforeHook < ::RSpec::Core::Hooks::Hook
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:364
+ def run(example); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+class RSpec::Core::Hooks::Hook < ::Struct
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def block; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def block=(_); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def options=(_); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def [](*_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def inspect; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def keyword_init?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def members; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:360
+ def new(*_arg0); end
+ end
+end
+
+# @private
+#
+# This provides the primary API used by other parts of rspec-core. By hiding all
+# implementation details behind this facade, it's allowed us to heavily optimize
+# this, so that, for example, hook collection objects are only instantiated when
+# a hook is added. This allows us to avoid many object allocations for the common
+# case of a group having no hooks.
+#
+# This is only possible because this interface provides a "tell, don't ask"-style
+# API, so that callers _tell_ this class what to do with the hooks, rather than
+# asking this class for a list of hooks, and then doing something with them.
+#
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:420
+class RSpec::Core::Hooks::HookCollections
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:421
+ def initialize(owner, filterable_item_repo_class); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:449
+ def register(prepend_or_append, position, *args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:442
+ def register_global_singleton_context_hooks(example, globals); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:431
+ def register_globals(host, globals); end
+
+ # @private
+ #
+ # Runs all of the blocks stored with the hook in the context of the
+ # example. If no example is provided, just calls the hook directly.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:475
+ def run(position, scope, example_or_group); end
+
+ protected
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:523
+ def all_hooks_for(position, scope); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:507
+ def matching_hooks_for(position, scope, example_or_group); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:533
+ def processable_hooks_for(position, scope, host); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:527
+ def run_owned_hooks_for(position, scope, example_or_group); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:553
+ def ensure_hooks_initialized_for(position, scope); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:591
+ def extract_scope_from(args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:543
+ def hooks_for(position, scope); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:605
+ def known_scope?(scope); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:609
+ def normalized_scope_for(scope); end
+
+ # Ruby < 2.1 (see https://bugs.ruby-lang.org/issues/8035)
+ # :nocov:
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:633
+ def owner_parent_groups; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:571
+ def process(host, parent_groups, globals, position, scope); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:619
+ def run_around_example_hooks_for(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:613
+ def run_example_hooks_for(example, position, each_method); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/hooks.rb:584
+ def scope_and_options_from(*args); end
+end
+
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:505
+RSpec::Core::Hooks::HookCollections::EMPTY_HOOK_ARRAY = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:495
+RSpec::Core::Hooks::HookCollections::HOOK_TYPES = T.let(T.unsafe(nil), Hash)
+
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:491
+RSpec::Core::Hooks::HookCollections::SCOPES = T.let(T.unsafe(nil), Array)
+
+# pkg:gem/rspec-core#lib/rspec/core/hooks.rb:493
+RSpec::Core::Hooks::HookCollections::SCOPE_ALIASES = T.let(T.unsafe(nil), Hash)
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:186
+class RSpec::Core::InclusionRules < ::RSpec::Core::FilterRules
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:187
+ def add(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:191
+ def add_with_low_priority(*args); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:195
+ def include_example?(example); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:203
+ def split_file_scoped_rules; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:199
+ def standalone?; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:213
+ def apply_standalone_filter(updated); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:226
+ def is_standalone_filter?(rules); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/filter_manager.rb:221
+ def replace_filters(new_rules); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/invocations.rb:4
+module RSpec::Core::Invocations; end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/invocations.rb:28
+class RSpec::Core::Invocations::Bisect
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:29
+ def call(options, err, out); end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:45
+ def bisect_formatter_klass_for(argument); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/invocations.rb:15
+class RSpec::Core::Invocations::DRbWithFallback
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:16
+ def call(options, err, out); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/invocations.rb:6
+class RSpec::Core::Invocations::InitializeProject
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:7
+ def call(*_args); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+class RSpec::Core::Invocations::PrintHelp < ::Struct
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:79
+ def call(_options, _err, out); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def hidden_options; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def hidden_options=(_); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def parser; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def parser=(_); end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def [](*_arg0); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def inspect; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def keyword_init?; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def members; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:78
+ def new(*_arg0); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/invocations.rb:52
+class RSpec::Core::Invocations::PrintVersion
+ # pkg:gem/rspec-core#lib/rspec/core/invocations.rb:53
+ def call(_options, _err, out); end
+end
+
+# @private
+# Together with the example group metadata hash default block,
+# provides backwards compatibility for the old `:example_group`
+# key. In RSpec 2.x, the computed keys of a group's metadata
+# were exposed from a nested subhash keyed by `[:example_group]`, and
+# then the parent group's metadata was exposed by sub-subhash
+# keyed by `[:example_group][:example_group]`.
+#
+# In RSpec 3, we reorganized this to that the computed keys are
+# exposed directly of the group metadata hash (no nesting), and
+# `:parent_example_group` returns the parent group's metadata.
+#
+# Maintaining backwards compatibility was difficult: we wanted
+# `:example_group` to return an object that:
+#
+# * Exposes the top-level metadata keys that used to be nested
+# under `:example_group`.
+# * Supports mutation (rspec-rails, for example, assigns
+# `metadata[:example_group][:described_class]` when you use
+# anonymous controller specs) such that changes are written
+# back to the top-level metadata hash.
+# * Exposes the parent group metadata as
+# `[:example_group][:example_group]`.
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:470
+class RSpec::Core::LegacyExampleGroupHash
+ include ::RSpec::Core::HashImitatable
+ extend ::RSpec::Core::HashImitatable::ClassMethods
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:473
+ def initialize(metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:479
+ def to_h; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:485
+ def directly_supports_attribute?(name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:489
+ def get_value(name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:493
+ def set_value(name, value); end
+end
+
+# This module is included in {ExampleGroup}, making the methods
+# available to be called from within example blocks.
+#
+# @see ClassMethods
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:9
+module RSpec::Core::MemoizedHelpers
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:135
+ def initialize(*_arg0); end
+
+ # Wraps the `subject` in `expect` to make it the target of an expectation.
+ # Designed to read nicely for one-liners.
+ #
+ # @example
+ #
+ # describe [1, 2, 3] do
+ # it { is_expected.to be_an Array }
+ # it { is_expected.not_to include 4 }
+ # end
+ #
+ # @see #subject
+ # @see #should
+ # @see #should_not
+ #
+ # @note This only works if you are using rspec-expectations.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:120
+ def is_expected; end
+
+ # When `should` is called with no explicit receiver, the call is
+ # delegated to the object returned by `subject`. Combined with an
+ # implicit subject this supports very concise expressions.
+ #
+ # @example
+ #
+ # RSpec.describe Person do
+ # it { should be_eligible_to_vote }
+ # end
+ #
+ # @see #subject
+ # @see #is_expected
+ #
+ # @note This only works if you are using rspec-expectations.
+ # @note If you are using RSpec's newer expect-based syntax you may
+ # want to use `is_expected.to` instead of `should`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:80
+ def should(matcher = T.unsafe(nil), message = T.unsafe(nil)); end
+
+ # Just like `should`, `should_not` delegates to the subject (implicit or
+ # explicit) of the example group.
+ #
+ # @example
+ #
+ # RSpec.describe Person do
+ # it { should_not be_eligible_to_vote }
+ # end
+ #
+ # @see #subject
+ # @see #is_expected
+ #
+ # @note This only works if you are using rspec-expectations.
+ # @note If you are using RSpec's newer expect-based syntax you may
+ # want to use `is_expected.to_not` instead of `should_not`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:100
+ def should_not(matcher = T.unsafe(nil), message = T.unsafe(nil)); end
+
+ # @note `subject` was contributed by Joe Ferris to support the one-liner
+ # syntax embraced by shoulda matchers:
+ #
+ # RSpec.describe Widget do
+ # it { is_expected.to validate_presence_of(:name) }
+ # # or
+ # it { should validate_presence_of(:name) }
+ # end
+ #
+ # While the examples below demonstrate how to use `subject`
+ # explicitly in examples, we recommend that you define a method with
+ # an intention revealing name instead.
+ #
+ # @example
+ #
+ # # Explicit declaration of subject.
+ # RSpec.describe Person do
+ # subject { Person.new(:birthdate => 19.years.ago) }
+ # it "should be eligible to vote" do
+ # subject.should be_eligible_to_vote
+ # # ^ ^ explicit reference to subject not recommended
+ # end
+ # end
+ #
+ # # Implicit subject => { Person.new }.
+ # RSpec.describe Person do
+ # it "should be eligible to vote" do
+ # subject.should be_eligible_to_vote
+ # # ^ ^ explicit reference to subject not recommended
+ # end
+ # end
+ #
+ # # One-liner syntax - expectation is set on the subject.
+ # RSpec.describe Person do
+ # it { is_expected.to be_eligible_to_vote }
+ # # or
+ # it { should be_eligible_to_vote }
+ # end
+ #
+ # @note Because `subject` is designed to create state that is reset
+ # between each example, and `before(:context)` is designed to setup
+ # state that is shared across _all_ examples in an example group,
+ # `subject` is _not_ intended to be used in a `before(:context)` hook.
+ #
+ # @see #should
+ # @see #should_not
+ # @see #is_expected
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:57
+ def subject; end
+
+ private
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:141
+ def __init_memoized; end
+
+ # @private
+ # should just be placed in private section,
+ # but Ruby issues warnings on private attributes.
+ # and expanding it to the equivalent method upsets Rubocop,
+ # b/c it should obviously be a reader
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:129
+ def __memoized; end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:150
+ def enforce_value_expectation(matcher, method_name); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:163
+ def matcher_supports_value_expectations?(matcher); end
+
+ class << self
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:542
+ def define_helpers_on(example_group); end
+
+ # for 1.8
+ # @private
+ #
+ # Gets the named constant or yields.
+ # On 1.8, const_defined? / const_get do not take into
+ # account the inheritance hierarchy.
+ # :nocov:
+ # @private
+ #
+ # Gets the named constant or yields.
+ # On 1.9, const_defined? / const_get take into account the
+ # the inheritance by default, and accept an argument to
+ # disable this behavior. It's important that we don't
+ # consider inheritance here; each example group level that
+ # uses a `let` should get its own `LetDefinitions` module.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:570
+ def get_constant_or_yield(example_group, name); end
+
+ # @private
+ #
+ # Gets the LetDefinitions module. The module is mixed into
+ # the example group and is used to hold all let definitions.
+ # This is done so that the block passed to `let` can be
+ # forwarded directly on to `define_method`, so that all method
+ # constructs (including `super` and `return`) can be used in
+ # a `let` block.
+ #
+ # The memoization is provided by a method definition on the
+ # example group that supers to the LetDefinitions definition
+ # in order to get the value to memoize.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:528
+ def module_for(example_group); end
+ end
+end
+
+# This module is extended onto {ExampleGroup}, making the methods
+# available to be called from within example group blocks.
+# You can think of them as being analagous to class macros.
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:274
+module RSpec::Core::MemoizedHelpers::ClassMethods
+ # Generates a method whose return value is memoized after the first
+ # call. Useful for reducing duplication between examples that assign
+ # values to the same local variable.
+ #
+ # @note `let` _can_ enhance readability when used sparingly (1,2, or
+ # maybe 3 declarations) in any given example group, but that can
+ # quickly degrade with overuse. YMMV.
+ #
+ # @note `let` can be configured to be threadsafe or not.
+ # If it is threadsafe, it will take longer to access the value.
+ # If it is not threadsafe, it may behave in surprising ways in examples
+ # that spawn separate threads. Specify this on `RSpec.configure`
+ #
+ # @note Because `let` is designed to create state that is reset between
+ # each example, and `before(:context)` is designed to setup state that
+ # is shared across _all_ examples in an example group, `let` is _not_
+ # intended to be used in a `before(:context)` hook.
+ #
+ # @example
+ #
+ # RSpec.describe Thing do
+ # let(:thing) { Thing.new }
+ #
+ # it "does something" do
+ # # First invocation, executes block, memoizes and returns result.
+ # thing.do_something
+ #
+ # # Second invocation, returns the memoized value.
+ # thing.should be_something
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:306
+ def let(name, &block); end
+
+ # Just like `let`, except the block is invoked by an implicit `before`
+ # hook. This serves a dual purpose of setting up state and providing a
+ # memoized reference to that state.
+ #
+ # @example
+ #
+ # class Thing
+ # def self.count
+ # @count ||= 0
+ # end
+ #
+ # def self.count=(val)
+ # @count += val
+ # end
+ #
+ # def self.reset_count
+ # @count = 0
+ # end
+ #
+ # def initialize
+ # self.class.count += 1
+ # end
+ # end
+ #
+ # RSpec.describe Thing do
+ # after(:example) { Thing.reset_count }
+ #
+ # context "using let" do
+ # let(:thing) { Thing.new }
+ #
+ # it "is not invoked implicitly" do
+ # Thing.count.should eq(0)
+ # end
+ #
+ # it "can be invoked explicitly" do
+ # thing
+ # Thing.count.should eq(1)
+ # end
+ # end
+ #
+ # context "using let!" do
+ # let!(:thing) { Thing.new }
+ #
+ # it "is invoked implicitly" do
+ # Thing.count.should eq(1)
+ # end
+ #
+ # it "returns memoized version on first invocation" do
+ # thing
+ # Thing.count.should eq(1)
+ # end
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:400
+ def let!(name, &block); end
+
+ # Declares a `subject` for an example group which can then be wrapped
+ # with `expect` using `is_expected` to make it the target of an
+ # expectation in a concise, one-line example.
+ #
+ # Given a `name`, defines a method with that name which returns the
+ # `subject`. This lets you declare the subject once and access it
+ # implicitly in one-liners and explicitly using an intention revealing
+ # name.
+ #
+ # When given a `name`, calling `super` in the block is not supported.
+ #
+ # @note `subject` can be configured to be threadsafe or not.
+ # If it is threadsafe, it will take longer to access the value.
+ # If it is not threadsafe, it may behave in surprising ways in examples
+ # that spawn separate threads. Specify this on `RSpec.configure`
+ #
+ # @param name [String,Symbol] used to define an accessor with an
+ # intention revealing name
+ # @param block defines the value to be returned by `subject` in examples
+ #
+ # @example
+ #
+ # RSpec.describe CheckingAccount, "with $50" do
+ # subject { CheckingAccount.new(Money.new(50, :USD)) }
+ # it { is_expected.to have_a_balance_of(Money.new(50, :USD)) }
+ # it { is_expected.not_to be_overdrawn }
+ # end
+ #
+ # RSpec.describe CheckingAccount, "with a non-zero starting balance" do
+ # subject(:account) { CheckingAccount.new(Money.new(50, :USD)) }
+ # it { is_expected.not_to be_overdrawn }
+ # it "has a balance equal to the starting balance" do
+ # account.balance.should eq(Money.new(50, :USD))
+ # end
+ # end
+ #
+ # @see MemoizedHelpers#should
+ # @see MemoizedHelpers#should_not
+ # @see MemoizedHelpers#is_expected
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:444
+ def subject(name = T.unsafe(nil), &block); end
+
+ # Just like `subject`, except the block is invoked by an implicit
+ # `before` hook. This serves a dual purpose of setting up state and
+ # providing a memoized reference to that state.
+ #
+ # @example
+ #
+ # class Thing
+ # def self.count
+ # @count ||= 0
+ # end
+ #
+ # def self.count=(val)
+ # @count += val
+ # end
+ #
+ # def self.reset_count
+ # @count = 0
+ # end
+ #
+ # def initialize
+ # self.class.count += 1
+ # end
+ # end
+ #
+ # RSpec.describe Thing do
+ # after(:example) { Thing.reset_count }
+ #
+ # context "using subject" do
+ # subject { Thing.new }
+ #
+ # it "is not invoked implicitly" do
+ # Thing.count.should eq(0)
+ # end
+ #
+ # it "can be invoked explicitly" do
+ # subject
+ # Thing.count.should eq(1)
+ # end
+ # end
+ #
+ # context "using subject!" do
+ # subject!(:thing) { Thing.new }
+ #
+ # it "is invoked implicitly" do
+ # Thing.count.should eq(1)
+ # end
+ #
+ # it "returns memoized version on first invocation" do
+ # subject
+ # Thing.count.should eq(1)
+ # end
+ # end
+ # end
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:510
+ def subject!(name = T.unsafe(nil), &block); end
+end
+
+# Used internally to customize the behavior of the
+# memoized hash when used in a `before(:context)` hook.
+#
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:200
+class RSpec::Core::MemoizedHelpers::ContextHookMemoized
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:222
+ def fetch_or_store(key, &_block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:201
+ def isolate_for_context_hook(example_group_instance); end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:256
+class RSpec::Core::MemoizedHelpers::ContextHookMemoized::After < ::RSpec::Core::MemoizedHelpers::ContextHookMemoized
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:261
+ def article; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:257
+ def hook_expression; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:265
+ def hook_intention; end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:241
+class RSpec::Core::MemoizedHelpers::ContextHookMemoized::Before < ::RSpec::Core::MemoizedHelpers::ContextHookMemoized
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:246
+ def article; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:242
+ def hook_expression; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:250
+ def hook_intention; end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:186
+class RSpec::Core::MemoizedHelpers::NonThreadSafeMemoized
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:187
+ def initialize; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:191
+ def fetch_or_store(key); end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:170
+class RSpec::Core::MemoizedHelpers::ThreadsafeMemoized
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:171
+ def initialize; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/memoized_helpers.rb:176
+ def fetch_or_store(key); end
+end
+
+# Each ExampleGroup class and Example instance owns an instance of
+# Metadata, which is Hash extended to support lazy evaluation of values
+# associated with keys that may or may not be used by any example or group.
+#
+# In addition to metadata that is used internally, this also stores
+# user-supplied metadata, e.g.
+#
+# RSpec.describe Something, :type => :ui do
+# it "does something", :slow => true do
+# # ...
+# end
+# end
+#
+# `:type => :ui` is stored in the Metadata owned by the example group, and
+# `:slow => true` is stored in the Metadata owned by the example. These can
+# then be used to select which examples are run using the `--tag` option on
+# the command line, or several methods on `Configuration` used to filter a
+# run (e.g. `filter_run_including`, `filter_run_excluding`, etc).
+#
+# @see Example#metadata
+# @see ExampleGroup.metadata
+# @see FilterManager
+# @see Configuration#filter_run_including
+# @see Configuration#filter_run_excluding
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:27
+module RSpec::Core::Metadata
+ class << self
+ # @private
+ # Returns an enumerator that iteratively walks up the given metadata through all
+ # example group ancestors, yielding each metadata hash along the way.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:71
+ def ascend(metadata); end
+
+ # @private
+ # Iteratively walks up from the given metadata through all
+ # example group ancestors, yielding each metadata hash along the way.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:58
+ def ascending(metadata); end
+
+ # @private
+ # Used internally to build a hash from an args array.
+ # Symbols are converted into hash keys with a value of `true`.
+ # This is done to support simple tagging using a symbol, rather
+ # than needing to do `:symbol => true`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:80
+ def build_hash_from(args, warn_about_example_group_filtering = T.unsafe(nil)); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:94
+ def deep_hash_dup(object); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:105
+ def id_from(metadata); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:110
+ def location_tuple_from(metadata); end
+
+ # @api private
+ #
+ # @param line [String] current code line
+ # @return [String] relative path to line
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:44
+ def relative_path(line); end
+
+ # Matches strings either at the beginning of the input or prefixed with a
+ # whitespace, containing the current path, either postfixed with the
+ # separator, or at the end of the string. Match groups are the character
+ # before and the character after the string if any.
+ #
+ # http://rubular.com/r/fT0gmX6VJX
+ # http://rubular.com/r/duOrD4i3wb
+ # http://rubular.com/r/sbAMHFrOx1
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:36
+ def relative_path_regex; end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:247
+class RSpec::Core::Metadata::ExampleGroupHash < ::RSpec::Core::Metadata::HashPopulator
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:304
+ def described_class; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:311
+ def full_description; end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:265
+ def backwards_compatibility_default_proc(&example_group_selector); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:248
+ def create(parent_group_metadata, user_metadata, example_group_index, *args, &block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:261
+ def hash_with_backwards_compatibility_default_proc; end
+ end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:213
+class RSpec::Core::Metadata::ExampleHash < ::RSpec::Core::Metadata::HashPopulator
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:234
+ def described_class; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:238
+ def full_description; end
+
+ class << self
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:214
+ def create(group_metadata, user_metadata, index_provider, description, block); end
+ end
+end
+
+# @private
+# Used internally to populate metadata hashes with computed keys
+# managed by RSpec.
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:117
+class RSpec::Core::Metadata::HashPopulator
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:120
+ def initialize(metadata, user_metadata, index_provider, description_args, block); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:118
+ def block; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:118
+ def description_args; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:118
+ def metadata; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:128
+ def populate; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:118
+ def user_metadata; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:178
+ def build_description_from(parent_description = T.unsafe(nil), my_description = T.unsafe(nil)); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:185
+ def build_scoped_id_for(file_path); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:170
+ def description_separator(parent_part, child_part); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:191
+ def ensure_valid_user_keys; end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:164
+ def file_path_and_line_number_from(backtrace); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata.rb:143
+ def populate_location_attributes; end
+end
+
+# @private
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata.rb:325
+RSpec::Core::Metadata::RESERVED_KEYS = T.let(T.unsafe(nil), Array)
+
+# Contains metadata filtering logic. This has been extracted from
+# the metadata classes because it operates ON a metadata hash but
+# does not manage any of the state in the hash. We're moving towards
+# having metadata be a raw hash (not a custom subclass), so externalizing
+# this filtering logic helps us move in that direction.
+#
+# pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:8
+module RSpec::Core::MetadataFilter
+ class << self
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:11
+ def apply?(predicate, filters, metadata); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:16
+ def filter_applies?(key, filter_value, metadata); end
+
+ # @private
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:33
+ def silence_metadata_example_group_deprecations; end
+
+ private
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:42
+ def filter_applies_to_any_value?(key, value, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:73
+ def filters_apply?(key, value, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:46
+ def id_filter_applies?(rerun_paths_to_scoped_ids, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:54
+ def location_filter_applies?(locations, metadata); end
+
+ # pkg:gem/rspec-core#lib/rspec/core/metadata_filter.rb:65
+ def proc_filter_applies?(key, proc, metadata); end
+ end
+end
+
+# Provides a single exception instance that provides access to
+# multiple sub-exceptions. This is used in situations where a single
+# individual spec has multiple exceptions, such as one in the `it` block
+# and one in an `after` block.
+#
+# pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:459
+class RSpec::Core::MultipleExceptionError < ::StandardError
+ include ::RSpec::Core::MultipleExceptionError::InterfaceTag
+
+ # @param exceptions [Array] The initial list of exceptions.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:520
+ def initialize(*exceptions); end
+
+ # @return [nil] Provided only for interface compatibility with
+ # `RSpec::Expectations::MultipleExpectationsNotMetError`.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:517
+ def aggregation_block_label; end
+
+ # @return [Hash] Metadata used by RSpec for formatting purposes.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:513
+ def aggregation_metadata; end
+
+ # @return [Array] The list of failures and other exceptions, combined.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:510
+ def all_exceptions; end
+
+ # return [String] A description of the failure/error counts.
+ #
+ # pkg:gem/rspec-core#lib/rspec/core/formatters/exception_presenter.rb:545
+ def exception_count_description; end
+
+ # @return [Array 
+# stylesheet_link_tag("application")
+# # =>
+#
+# pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:21
+module ActionView::Helpers::AssetTagHelper
+ include ::ActionView::Helpers::AssetUrlHelper
+ include ::ActionView::Helpers::CaptureHelper
+ include ::ActionView::Helpers::OutputSafetyHelper
+ include ::ActionView::Helpers::TagHelper
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:28
+ def apply_stylesheet_media_default; end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:28
+ def apply_stylesheet_media_default=(val); end
+
+ # Returns an HTML audio tag for the +sources+. If +sources+ is a string,
+ # a single audio tag will be returned. If +sources+ is an array, an audio
+ # tag with nested source tags for each source will be returned. The
+ # +sources+ can be full paths, files that exist in your public audios
+ # directory, or Active Storage attachments.
+ #
+ # When the last parameter is a hash you can add HTML attributes using that
+ # parameter.
+ #
+ # audio_tag("sound")
+ # # =>
+ # audio_tag("sound.wav")
+ # # =>
+ # audio_tag("sound.wav", autoplay: true, controls: true)
+ # # =>
+ # audio_tag("sound.wav", "sound.mid")
+ # # =>
+ #
+ # Active Storage blobs (audios that are uploaded by the users of your app):
+ #
+ # audio_tag(user.name_pronunciation_audio)
+ # # =>
+ #
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:612
+ def audio_tag(*sources); end
+
+ # Returns a link tag that browsers and feed readers can use to auto-detect
+ # an RSS, Atom, or JSON feed. The +type+ can be :rss (default),
+ # :atom, or :json. Control the link options in url_for format
+ # using the +url_options+. You can modify the LINK tag itself in +tag_options+.
+ #
+ # ==== Options
+ #
+ # * :rel - Specify the relation of this link, defaults to "alternate"
+ # * :type - Override the auto-generated mime type
+ # * :title - Specify the title of the link, defaults to the +type+
+ #
+ # ==== Examples
+ #
+ # auto_discovery_link_tag
+ # # =>
+ # auto_discovery_link_tag(:atom)
+ # # =>
+ # auto_discovery_link_tag(:json)
+ # # =>
+ # auto_discovery_link_tag(:rss, {action: "feed"})
+ # # =>
+ # auto_discovery_link_tag(:rss, {action: "feed"}, {title: "My RSS"})
+ # # =>
+ # auto_discovery_link_tag(:rss, {controller: "news", action: "feed"})
+ # # =>
+ # auto_discovery_link_tag(:rss, "http://www.example.com/feed.rss", {title: "Example RSS"})
+ # # =>
+ #
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:279
+ def auto_discovery_link_tag(type = T.unsafe(nil), url_options = T.unsafe(nil), tag_options = T.unsafe(nil)); end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:29
+ def auto_include_nonce_for_scripts; end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:29
+ def auto_include_nonce_for_scripts=(val); end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:30
+ def auto_include_nonce_for_styles; end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:30
+ def auto_include_nonce_for_styles=(val); end
+
+ # Returns a link tag for a favicon managed by the asset pipeline.
+ #
+ # If a page has no link like the one generated by this helper, browsers
+ # ask for /favicon.ico automatically, and cache the file if the
+ # request succeeds. If the favicon changes it is hard to get it updated.
+ #
+ # To have better control applications may let the asset pipeline manage
+ # their favicon storing the file under app/assets/images, and
+ # using this helper to generate its corresponding link tag.
+ #
+ # The helper gets the name of the favicon file as first argument, which
+ # defaults to "favicon.ico", and also supports +:rel+ and +:type+ options
+ # to override their defaults, "icon" and "image/x-icon"
+ # respectively:
+ #
+ # favicon_link_tag
+ # # =>
+ #
+ # favicon_link_tag 'myicon.ico'
+ # # =>
+ #
+ # Mobile Safari looks for a different link tag, pointing to an image that
+ # will be used if you add the page to the home screen of an iOS device.
+ # The following call would generate such a tag:
+ #
+ # favicon_link_tag 'mb-icon.png', rel: 'apple-touch-icon', type: 'image/png'
+ # # =>
+ #
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:320
+ def favicon_link_tag(source = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:26
+ def image_decoding; end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:26
+ def image_decoding=(val); end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:25
+ def image_loading; end
+
+ # pkg:gem/actionview#lib/action_view/helpers/asset_tag_helper.rb:25
+ def image_loading=(val); end
+
+ # Returns an HTML image tag for the +source+. The +source+ can be a full
+ # path, a file, or an Active Storage attachment.
+ #
+ # ==== Options
+ #
+ # You can add HTML attributes using the +options+. The +options+ supports
+ # additional keys for convenience and conformance:
+ #
+ # * :size - Supplied as "#{width}x#{height}" or "#{number}", so "30x45" becomes
+ # width="30" height="45", and "50" becomes width="50" height="50".
+ # :size will be ignored if the value is not in the correct format.
+ # * :srcset - If supplied as a hash or array of [source, descriptor]
+ # pairs, each image path will be expanded before the list is formatted as a string.
+ #
+ # ==== Examples
+ #
+ # Assets (images that are part of your app):
+ #
+ # image_tag("icon")
+ # # => 
+ # image_tag("icon.png", size: "16x10", alt: "Edit Entry")
+ # # => 
+ # image_tag("/icons/icon.gif", height: '32', width: '32')
+ # # => 
+ #
+ # Active Storage blobs (images that are uploaded by the users of your app):
+ #
+ # image_tag(user.avatar)
+ # # => 
+ # image_tag(user.avatar.variant(resize_to_limit: [100, 100]))
+ # # => 
+ # image_tag(user.avatar.variant(resize_to_limit: [100, 100]), size: '100')
+ # # => 
+# stylesheet_link_tag("application")
+# # =>
+#
+# Browsers open a limited number of simultaneous connections to a single
+# host. The exact number varies by browser and version. This limit may cause
+# some asset downloads to wait for previous assets to finish before they can
+# begin. You can use the %d wildcard in the +asset_host+ to
+# distribute the requests over four hosts. For example,
+# assets%d.example.com will spread the asset requests over
+# "assets0.example.com", ..., "assets3.example.com".
+#
+# image_tag("rails.png")
+# # => 
+# stylesheet_link_tag("application")
+# # =>
+#
+# This may improve the asset loading performance of your application.
+# It is also possible the combination of additional connection overhead
+# (DNS, SSL) and the overall browser connection limits may result in this
+# solution being slower. You should be sure to measure your actual
+# performance across targeted browsers both before and after this change.
+#
+# To implement the corresponding hosts you can either set up four actual
+# hosts or use wildcard DNS to CNAME the wildcard to a single asset host.
+# You can read more about setting up your DNS CNAME records from your ISP.
+#
+# Note: This is purely a browser performance optimization and is not meant
+# for server load balancing. See https://www.die.net/musings/page_load_time/
+# for background and https://www.browserscope.org/?category=network for
+# connection limit data.
+#
+# Alternatively, you can exert more control over the asset host by setting
+# +asset_host+ to a proc like this:
+#
+# ActionController::Base.asset_host = Proc.new { |source|
+# "http://assets#{OpenSSL::Digest::SHA256.hexdigest(source).to_i(16) % 2 + 1}.example.com"
+# }
+# image_tag("rails.png")
+# # => 
+# stylesheet_link_tag("application")
+# # =>
+#
+# The example above generates "http://assets1.example.com" and
+# "http://assets2.example.com". This option is useful for example if
+# you need fewer/more than four hosts, custom host names, etc.
+#
+# As you see the proc takes a +source+ parameter. That's a string with the
+# absolute path of the asset, for example "/assets/rails.png".
+#
+# ActionController::Base.asset_host = Proc.new { |source|
+# if source.end_with?('.css')
+# "http://stylesheets.example.com"
+# else
+# "http://assets.example.com"
+# end
+# }
+# image_tag("rails.png")
+# # =>