+
+
+
+rake -T (up to the first
+ # sentence) and rake -D (the entire description).
+ #
+ # Example:
+ # desc "Run the Unit Tests"
+ # task test: [:build]
+ # # ... run tests
+ # end
+ #
+ # source://rake//lib/rake/dsl_definition.rb#165
+ def desc(description); end
+
+ # Declare a set of files tasks to create the given directories on
+ # demand.
+ #
+ # Example:
+ # directory "testdata/doc"
+ #
+ # source://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
+ #
+ # source://rake//lib/rake/dsl_definition.rb#76
+ def file(*args, &block); end
+
+ # Declare a file creation task.
+ # (Mainly used for the directory command).
+ #
+ # source://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"
+ #
+ # source://rake//lib/rake/dsl_definition.rb#183
+ def import(*fns); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def install(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def link(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln_s(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln_sf(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln_sr(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def makedirs(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def mkdir(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def mkdir_p(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def mkpath(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ 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]
+ #
+ # source://rake//lib/rake/dsl_definition.rb#112
+ def multitask(*args, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ 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
+ #
+ # source://rake//lib/rake/dsl_definition.rb#135
+ def namespace(name = T.unsafe(nil), &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#77
+ def nowrite(value = T.unsafe(nil)); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#123
+ def rake_check_options(options, *optdecl); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#116
+ def rake_output_message(message); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def remove(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm_f(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm_r(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm_rf(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rmdir(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rmtree(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils.rb#100
+ def ruby(*args, **options, &block); end
+
+ # Declare a rule for auto-tasks.
+ #
+ # Example:
+ # rule '.o' => '.c' do |t|
+ # sh 'cc', '-o', t.name, t.source
+ # end
+ #
+ # source://rake//lib/rake/dsl_definition.rb#151
+ def rule(*args, &block); end
+
+ # source://rake//lib/rake/file_utils.rb#112
+ def safe_ln(*args, **options); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def safe_unlink(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils.rb#43
+ def sh(*cmd, &block); end
+
+ # source://rake//lib/rake/file_utils.rb#128
+ def split_all(path); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ 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]
+ #
+ # source://rake//lib/rake/dsl_definition.rb#59
+ def task(*args, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def touch(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#53
+ def verbose(value = T.unsafe(nil)); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#107
+ def when_writing(msg = T.unsafe(nil)); end
+end
+
+# Default Rakefile loader used by +import+.
+#
+# source://rake//lib/rake/default_loader.rb#5
+class Rake::DefaultLoader
+ # Loads a rakefile into the current application from +fn+
+ #
+ # source://rake//lib/rake/default_loader.rb#10
+ def load(fn); end
+end
+
+# source://rake//lib/rake/early_time.rb#21
+Rake::EARLY = T.let(T.unsafe(nil), Rake::EarlyTime)
+
+# source://rake//lib/rake/task_arguments.rb#108
+Rake::EMPTY_TASK_ARGS = T.let(T.unsafe(nil), Rake::TaskArguments)
+
+# EarlyTime is a fake timestamp that occurs _before_ any other time value.
+#
+# source://rake//lib/rake/early_time.rb#5
+class Rake::EarlyTime
+ include ::Comparable
+ include ::Singleton
+ extend ::Singleton::SingletonClassMethods
+
+ # The EarlyTime always comes before +other+!
+ #
+ # source://rake//lib/rake/early_time.rb#12
+ def <=>(other); end
+
+ # source://rake//lib/rake/early_time.rb#16
+ def to_s; end
+
+ class << self
+ private
+
+ def allocate; end
+ 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.
+#
+# source://rake//lib/rake/file_creation_task.rb#12
+class Rake::FileCreationTask < ::Rake::FileTask
+ # Is this file task needed? Yes if it doesn't exist.
+ #
+ # @return [Boolean]
+ #
+ # source://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.
+ #
+ # source://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.
+#
+# source://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
+ #
+ # @return [FileList] a new instance of FileList
+ # @yield [_self]
+ # @yieldparam _self [Rake::FileList] the object that the method was called on
+ #
+ # source://rake//lib/rake/file_list.rb#99
+ def initialize(*patterns); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def &(*args, &block); end
+
+ # Redefine * to return either a string or a new file list.
+ #
+ # source://rake//lib/rake/file_list.rb#193
+ def *(other); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def +(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def -(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#203
+ def <<(obj); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def <=>(*args, &block); end
+
+ # A FileList is equal through array equality.
+ #
+ # source://rake//lib/rake/file_list.rb#171
+ def ==(array); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def [](*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def []=(*args, &block); 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 )
+ #
+ # source://rake//lib/rake/file_list.rb#116
+ def add(*filenames); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def all?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def any?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def append(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def assoc(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def at(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def bsearch(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def bsearch_index(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def chain(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def chunk(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def chunk_while(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def clear(*args, &block); end
+
+ # Clear all the exclude patterns so that we exclude nothing.
+ #
+ # source://rake//lib/rake/file_list.rb#164
+ def clear_exclude; end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def collect(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def collect!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def collect_concat(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def combination(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def compact(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def compact!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def concat(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def count(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def cycle(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def deconstruct(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def delete(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def delete_at(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def delete_if(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def detect(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def difference(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def dig(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def drop(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def drop_while(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def each(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def each_cons(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def each_entry(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def each_index(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def each_slice(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def each_with_index(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ 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.
+ #
+ # source://rake//lib/rake/file_list.rb#293
+ def egrep(pattern, *options); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def empty?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ 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']
+ #
+ # source://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.
+ #
+ # @return [Boolean]
+ #
+ # source://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.
+ #
+ # source://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.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/file_list.rb#284
+ def ext(newext = T.unsafe(nil)); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def fetch(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def fill(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def filter(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def filter!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def filter_map(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def find(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def find_all(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def find_index(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def first(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def flat_map(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def flatten(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def flatten!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def grep(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def grep_v(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ 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']
+ #
+ # source://rake//lib/rake/file_list.rb#253
+ def gsub(pat, rep); end
+
+ # Same as +gsub+ except that the original file list is modified.
+ #
+ # source://rake//lib/rake/file_list.rb#264
+ def gsub!(pat, rep); end
+
+ # source://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 )
+ #
+ # source://rake//lib/rake/file_list.rb#116
+ def include(*filenames); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def include?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def index(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def inject(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def insert(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def inspect(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def intersect?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def intersection(*args, &block); end
+
+ # Lie about our class.
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/file_list.rb#187
+ def is_a?(klass); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def join(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def keep_if(*args, &block); end
+
+ # Lie about our class.
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/file_list.rb#187
+ def kind_of?(klass); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def last(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def lazy(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def length(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def map(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def map!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def max(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def max_by(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def member?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def min(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def min_by(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def minmax(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def minmax_by(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def none?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def one?(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def pack(*args, &block); end
+
+ # FileList version of partition. Needed because the nested arrays should
+ # be FileLists in this version.
+ #
+ # source://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.)
+ #
+ # source://rake//lib/rake/file_list.rb#272
+ def pathmap(spec = T.unsafe(nil), &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def permutation(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def place(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def pop(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def prepend(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def product(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def push(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def rassoc(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def reduce(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def reject(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def reject!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def repeated_combination(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def repeated_permutation(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def replace(*args, &block); end
+
+ # Resolve all the pending adds now.
+ #
+ # source://rake//lib/rake/file_list.rb#210
+ def resolve; end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def reverse(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def reverse!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def reverse_each(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def rindex(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def rotate(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def rotate!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def sample(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def select(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def select!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def shelljoin(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def shift(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def shuffle(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def shuffle!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def size(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def slice(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def slice!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def slice_after(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def slice_before(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def slice_when(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def sort(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def sort!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def sort_by(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ 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']
+ #
+ # source://rake//lib/rake/file_list.rb#242
+ def sub(pat, rep); end
+
+ # Same as +sub+ except that the original file list is modified.
+ #
+ # source://rake//lib/rake/file_list.rb#258
+ def sub!(pat, rep); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def sum(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def take(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def take_while(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def tally(*args, &block); end
+
+ # Return the internal array object.
+ #
+ # source://rake//lib/rake/file_list.rb#176
+ def to_a; end
+
+ # Return the internal array object.
+ #
+ # source://rake//lib/rake/file_list.rb#182
+ def to_ary; end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def to_h(*args, &block); end
+
+ # Convert a FileList to a string by joining all elements with a space.
+ #
+ # source://rake//lib/rake/file_list.rb#344
+ def to_s; end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def to_set(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def transpose(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def union(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def uniq(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def uniq!(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def unshift(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def values_at(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#77
+ def zip(*args, &block); end
+
+ # source://rake//lib/rake/file_list.rb#68
+ def |(*args, &block); end
+
+ private
+
+ # Add matching glob patterns.
+ #
+ # source://rake//lib/rake/file_list.rb#350
+ def add_matching(pattern); end
+
+ # source://rake//lib/rake/file_list.rb#220
+ def resolve_add(fn); end
+
+ # source://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)
+ #
+ # source://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.
+ #
+ # source://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.
+#
+# source://rake//lib/rake/file_list.rb#44
+Rake::FileList::ARRAY_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://rake//lib/rake/file_list.rb#381
+Rake::FileList::DEFAULT_IGNORE_PATTERNS = T.let(T.unsafe(nil), Array)
+
+# source://rake//lib/rake/file_list.rb#387
+Rake::FileList::DEFAULT_IGNORE_PROCS = T.let(T.unsafe(nil), Array)
+
+# source://rake//lib/rake/file_list.rb#61
+Rake::FileList::DELEGATING_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://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.
+#
+# source://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).
+#
+# source://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.
+#
+# source://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).
+#
+# source://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.
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/file_task.rb#16
+ def needed?; end
+
+ # Time stamp for file task.
+ #
+ # source://rake//lib/rake/file_task.rb#21
+ def timestamp; end
+
+ private
+
+ # Are there any prerequisites with a later time than the given time stamp?
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/file_task.rb#32
+ 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.
+ #
+ # source://rake//lib/rake/file_task.rb#49
+ 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.
+#
+# source://rake//lib/rake/file_utils_ext.rb#10
+module Rake::FileUtilsExt
+ include ::FileUtils::StreamUtils_
+ include ::FileUtils
+ extend ::FileUtils::StreamUtils_
+ extend ::FileUtils
+ extend ::Rake::FileUtilsExt
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def cd(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def chdir(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def chmod(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def chmod_R(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def chown(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def chown_R(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def copy(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def cp(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def cp_lr(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def cp_r(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def install(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def link(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln_s(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln_sf(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def ln_sr(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def makedirs(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def mkdir(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def mkdir_p(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def mkpath(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def move(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ 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.
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#77
+ 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.
+ #
+ # @raise [ArgumentError]
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#123
+ def rake_check_options(options, *optdecl); end
+
+ # Send the message to the default rake output (which is $stderr).
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#116
+ def rake_output_message(message); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def remove(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm_f(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm_r(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rm_rf(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rmdir(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def rmtree(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def safe_unlink(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ def symlink(*args, **options, &block); end
+
+ # source://rake//lib/rake/file_utils_ext.rb#34
+ 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.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#107
+ def when_writing(msg = T.unsafe(nil)); end
+
+ class << self
+ # Returns the value of attribute nowrite_flag.
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#14
+ def nowrite_flag; end
+
+ # Sets the attribute nowrite_flag
+ #
+ # @param value the value to set the attribute nowrite_flag to.
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#14
+ def nowrite_flag=(_arg0); end
+
+ # Returns the value of attribute verbose_flag.
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#14
+ def verbose_flag; end
+
+ # Sets the attribute verbose_flag
+ #
+ # @param value the value to set the attribute verbose_flag to.
+ #
+ # source://rake//lib/rake/file_utils_ext.rb#14
+ def verbose_flag=(_arg0); end
+ end
+end
+
+# source://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.
+#
+# source://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.
+ #
+ # source://rake//lib/rake/invocation_chain.rb#15
+ def append(invocation); end
+
+ # Is the invocation already in the chain?
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/invocation_chain.rb#9
+ def member?(invocation); end
+
+ # Convert to string, ie: TOP => invocation => invocation
+ #
+ # source://rake//lib/rake/invocation_chain.rb#23
+ def to_s; end
+
+ private
+
+ # source://rake//lib/rake/invocation_chain.rb#34
+ def prefix; end
+
+ class << self
+ # Class level append.
+ #
+ # source://rake//lib/rake/invocation_chain.rb#28
+ def append(invocation, chain); end
+ end
+end
+
+# source://rake//lib/rake/invocation_chain.rb#55
+Rake::InvocationChain::EMPTY = T.let(T.unsafe(nil), Rake::InvocationChain::EmptyInvocationChain)
+
+# Null object for an empty chain.
+#
+# source://rake//lib/rake/invocation_chain.rb#39
+class Rake::InvocationChain::EmptyInvocationChain < ::Rake::LinkedList::EmptyLinkedList
+ # source://rake//lib/rake/invocation_chain.rb#46
+ def append(invocation); end
+
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/invocation_chain.rb#42
+ def member?(obj); end
+
+ # source://rake//lib/rake/invocation_chain.rb#50
+ def to_s; end
+end
+
+# source://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.
+ #
+ # source://rake//lib/rake/invocation_exception_mixin.rb#7
+ def chain; end
+
+ # Set the invocation chain in effect when this exception was
+ # detected.
+ #
+ # source://rake//lib/rake/invocation_exception_mixin.rb#13
+ def chain=(value); end
+end
+
+# source://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.
+#
+# source://rake//lib/rake/late_time.rb#4
+class Rake::LateTime
+ include ::Comparable
+ include ::Singleton
+ extend ::Singleton::SingletonClassMethods
+
+ # source://rake//lib/rake/late_time.rb#8
+ def <=>(other); end
+
+ # source://rake//lib/rake/late_time.rb#12
+ def to_s; end
+
+ class << self
+ private
+
+ def allocate; end
+ def new(*_arg0); end
+ end
+end
+
+# Polylithic linked list structure used to implement several data
+# structures in Rake.
+#
+# source://rake//lib/rake/linked_list.rb#6
+class Rake::LinkedList
+ include ::Enumerable
+
+ # @return [LinkedList] a new instance of LinkedList
+ #
+ # source://rake//lib/rake/linked_list.rb#84
+ def initialize(head, tail = T.unsafe(nil)); end
+
+ # Lists are structurally equivalent.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/linked_list.rb#12
+ def conj(item); end
+
+ # For each item in the list.
+ #
+ # source://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
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/linked_list.rb#20
+ def empty?; end
+
+ # Returns the value of attribute head.
+ #
+ # source://rake//lib/rake/linked_list.rb#8
+ def head; end
+
+ # Same as +to_s+, but with inspected items.
+ #
+ # source://rake//lib/rake/linked_list.rb#42
+ def inspect; end
+
+ # Returns the value of attribute tail.
+ #
+ # source://rake//lib/rake/linked_list.rb#8
+ def tail; end
+
+ # Convert to string: LL(item, item...)
+ #
+ # source://rake//lib/rake/linked_list.rb#36
+ def to_s; end
+
+ class << self
+ # Cons a new head onto the tail list.
+ #
+ # source://rake//lib/rake/linked_list.rb#73
+ def cons(head, tail); end
+
+ # The standard empty list class for the given LinkedList class.
+ #
+ # source://rake//lib/rake/linked_list.rb#78
+ def empty; end
+
+ # Make a list out of the given arguments. This method is
+ # polymorphic
+ #
+ # source://rake//lib/rake/linked_list.rb#59
+ def make(*args); end
+ end
+end
+
+# source://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).
+#
+# source://rake//lib/rake/linked_list.rb#95
+class Rake::LinkedList::EmptyLinkedList < ::Rake::LinkedList
+ # @return [EmptyLinkedList] a new instance of EmptyLinkedList
+ #
+ # source://rake//lib/rake/linked_list.rb#98
+ def initialize; end
+
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/linked_list.rb#101
+ def empty?; end
+
+ class << self
+ # source://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.
+#
+# source://rake//lib/rake/multi_task.rb#7
+class Rake::MultiTask < ::Rake::Task
+ private
+
+ # source://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.
+#
+# source://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.
+ #
+ # @return [NameSpace] a new instance of NameSpace
+ #
+ # source://rake//lib/rake/name_space.rb#12
+ def initialize(task_manager, scope_list); end
+
+ # Lookup a task named +name+ in the namespace.
+ #
+ # source://rake//lib/rake/name_space.rb#20
+ def [](name); end
+
+ # The scope of the namespace (a LinkedList)
+ #
+ # source://rake//lib/rake/name_space.rb#27
+ def scope; end
+
+ # Return the list of tasks defined in this and nested namespaces.
+ #
+ # source://rake//lib/rake/name_space.rb#34
+ def tasks; end
+end
+
+# Include PrivateReader to use +private_reader+.
+#
+# source://rake//lib/rake/private_reader.rb#5
+module Rake::PrivateReader
+ mixes_in_class_methods ::Rake::PrivateReader::ClassMethods
+
+ class << self
+ # source://rake//lib/rake/private_reader.rb#7
+ def included(base); end
+ end
+end
+
+# source://rake//lib/rake/private_reader.rb#11
+module Rake::PrivateReader::ClassMethods
+ # Declare a list of private accessors
+ #
+ # source://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.
+#
+# source://rake//lib/rake/promise.rb#11
+class Rake::Promise
+ # Create a promise to do the chore specified by the block.
+ #
+ # @return [Promise] a new instance of Promise
+ #
+ # source://rake//lib/rake/promise.rb#17
+ def initialize(args, &block); end
+
+ # source://rake//lib/rake/promise.rb#14
+ def recorder; end
+
+ # source://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.
+ #
+ # source://rake//lib/rake/promise.rb#29
+ def value; end
+
+ # If no one else is working this promise, go ahead and do the chore.
+ #
+ # source://rake//lib/rake/promise.rb#42
+ def work; end
+
+ private
+
+ # Perform the chore promised
+ #
+ # source://rake//lib/rake/promise.rb#57
+ def chore; end
+
+ # Are we done with the promise
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/promise.rb#83
+ def complete?; end
+
+ # free up these items for the GC
+ #
+ # source://rake//lib/rake/promise.rb#88
+ def discard; end
+
+ # Did the promise throw an error
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/promise.rb#78
+ def error?; end
+
+ # Do we have a result for the promise
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/promise.rb#73
+ def result?; end
+
+ # Record execution statistics if there is a recorder
+ #
+ # source://rake//lib/rake/promise.rb#94
+ def stat(*args); end
+end
+
+# source://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.
+#
+# source://rake//lib/rake/pseudo_status.rb#6
+class Rake::PseudoStatus
+ # @return [PseudoStatus] a new instance of PseudoStatus
+ #
+ # source://rake//lib/rake/pseudo_status.rb#9
+ def initialize(code = T.unsafe(nil)); end
+
+ # source://rake//lib/rake/pseudo_status.rb#17
+ def >>(n); end
+
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/pseudo_status.rb#25
+ def exited?; end
+
+ # source://rake//lib/rake/pseudo_status.rb#7
+ def exitstatus; end
+
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/pseudo_status.rb#21
+ def stopped?; end
+
+ # source://rake//lib/rake/pseudo_status.rb#13
+ def to_i; end
+end
+
+# Error indicating a recursion overflow error in task selection.
+#
+# source://rake//lib/rake/rule_recursion_overflow_error.rb#5
+class Rake::RuleRecursionOverflowError < ::StandardError
+ # @return [RuleRecursionOverflowError] a new instance of RuleRecursionOverflowError
+ #
+ # source://rake//lib/rake/rule_recursion_overflow_error.rb#6
+ def initialize(*args); end
+
+ # source://rake//lib/rake/rule_recursion_overflow_error.rb#11
+ def add_target(target); end
+
+ # source://rake//lib/rake/rule_recursion_overflow_error.rb#15
+ def message; end
+end
+
+# source://rake//lib/rake/scope.rb#3
+class Rake::Scope < ::Rake::LinkedList
+ # Path for the scope.
+ #
+ # source://rake//lib/rake/scope.rb#6
+ def path; end
+
+ # Path for the scope + the named path.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/scope.rb#17
+ def trim(n); end
+end
+
+# Singleton null object for an empty scope.
+#
+# source://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)
+#
+# source://rake//lib/rake/scope.rb#28
+class Rake::Scope::EmptyScope < ::Rake::LinkedList::EmptyLinkedList
+ # source://rake//lib/rake/scope.rb#31
+ def path; end
+
+ # source://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.
+#
+# source://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.
+ #
+ # @return [Task] a new instance of Task
+ #
+ # source://rake//lib/rake/task.rb#99
+ def initialize(task_name, app); end
+
+ # List of actions attached to a task.
+ #
+ # source://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.
+ #
+ # source://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.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#39
+ def already_invoked; end
+
+ # Application owning this task.
+ #
+ # source://rake//lib/rake/task.rb#27
+ def application; end
+
+ # Application owning this task.
+ #
+ # source://rake//lib/rake/task.rb#27
+ def application=(_arg0); end
+
+ # Argument description (nil if none).
+ #
+ # source://rake//lib/rake/task.rb#136
+ def arg_description; end
+
+ # Name of arguments for this task.
+ #
+ # source://rake//lib/rake/task.rb#141
+ def arg_names; end
+
+ # Clear the existing prerequisites, actions, comments, and arguments of a rake task.
+ #
+ # source://rake//lib/rake/task.rb#153
+ def clear; end
+
+ # Clear the existing actions on a rake task.
+ #
+ # source://rake//lib/rake/task.rb#168
+ def clear_actions; end
+
+ # Clear the existing arguments on a rake task.
+ #
+ # source://rake//lib/rake/task.rb#180
+ def clear_args; end
+
+ # Clear the existing comments on a rake task.
+ #
+ # source://rake//lib/rake/task.rb#174
+ def clear_comments; end
+
+ # Clear the existing prerequisites of a rake task.
+ #
+ # source://rake//lib/rake/task.rb#162
+ def clear_prerequisites; end
+
+ # First line (or sentence) of all comments. Multiple comments are
+ # separated by a "/".
+ #
+ # source://rake//lib/rake/task.rb#322
+ def comment; end
+
+ # source://rake//lib/rake/task.rb#304
+ def comment=(comment); end
+
+ # Enhance a task with prerequisites or actions. Returns self.
+ #
+ # source://rake//lib/rake/task.rb#115
+ def enhance(deps = T.unsafe(nil), &block); end
+
+ # Execute the actions associated with this task.
+ #
+ # source://rake//lib/rake/task.rb#270
+ def execute(args = T.unsafe(nil)); end
+
+ # Full collection of comments. Multiple comments are separated by
+ # newlines.
+ #
+ # source://rake//lib/rake/task.rb#316
+ def full_comment; end
+
+ # source://rake//lib/rake/task.rb#46
+ def inspect; end
+
+ # Return a string describing the internal state of a task. Useful for
+ # debugging.
+ #
+ # source://rake//lib/rake/task.rb#354
+ def investigation; end
+
+ # Invoke the task if it is needed. Prerequisites are invoked first.
+ #
+ # source://rake//lib/rake/task.rb#186
+ def invoke(*args); end
+
+ # Invoke all the prerequisites of a task.
+ #
+ # source://rake//lib/rake/task.rb#237
+ def invoke_prerequisites(task_args, invocation_chain); end
+
+ # Invoke all the prerequisites of a task in parallel.
+ #
+ # source://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).
+ #
+ # source://rake//lib/rake/task.rb#35
+ def locations; end
+
+ # Name of the task, including any namespace qualifiers.
+ #
+ # source://rake//lib/rake/task.rb#122
+ def name; end
+
+ # Name of task with argument list description.
+ #
+ # source://rake//lib/rake/task.rb#127
+ def name_with_args; end
+
+ # Is this task needed?
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/task.rb#286
+ def needed?; end
+
+ # List of order only prerequisites for a task.
+ #
+ # source://rake//lib/rake/task.rb#21
+ def order_only_prerequisites; end
+
+ # List of prerequisites for a task.
+ #
+ # source://rake//lib/rake/task.rb#17
+ def prereqs; end
+
+ # List of prerequisite tasks
+ #
+ # source://rake//lib/rake/task.rb#61
+ def prerequisite_tasks; end
+
+ # List of prerequisites for a task.
+ #
+ # source://rake//lib/rake/task.rb#17
+ def prerequisites; end
+
+ # Reenable the task, allowing its tasks to be executed if the task
+ # is invoked again.
+ #
+ # source://rake//lib/rake/task.rb#147
+ def reenable; end
+
+ # Array of nested namespaces names used for task lookup by this task.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#348
+ def set_arg_names(args); end
+
+ # First source from a rule (nil if no sources)
+ #
+ # source://rake//lib/rake/task.rb#93
+ def source; end
+
+ # source://rake//lib/rake/task.rb#52
+ def sources; end
+
+ # List of sources for task.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#292
+ def timestamp; end
+
+ # Return task name
+ #
+ # source://rake//lib/rake/task.rb#42
+ def to_s; end
+
+ # Add order only dependencies.
+ #
+ # source://rake//lib/rake/task.rb#379
+ def |(deps); end
+
+ protected
+
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#197
+ def invoke_with_call_chain(task_args, invocation_chain); end
+
+ private
+
+ # source://rake//lib/rake/task.rb#229
+ def add_chain_to(exception, new_chain); end
+
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#341
+ def first_sentence(string); end
+
+ # Format the trace flags for display.
+ #
+ # source://rake//lib/rake/task.rb#261
+ def format_trace_flags; end
+
+ # source://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.
+ #
+ # source://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.
+ #
+ # source://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.)
+ #
+ # source://rake//lib/rake/task.rb#391
+ def clear; end
+
+ # Define a rule for synthesizing tasks.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#416
+ def define_task(*args, &block); end
+
+ # Format dependencies parameter to pass to task.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task.rb#428
+ def scope_name(scope, task_name); end
+
+ # TRUE if the task name is already defined.
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/task.rb#409
+ def task_defined?(task_name); end
+
+ # List of all defined tasks.
+ #
+ # source://rake//lib/rake/task.rb#396
+ def tasks; end
+ end
+end
+
+# Error indicating an ill-formed task declaration.
+#
+# source://rake//lib/rake/task_argument_error.rb#5
+class Rake::TaskArgumentError < ::ArgumentError; end
+
+# TaskArguments manage the arguments passed to a task.
+#
+# source://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.
+ #
+ # @return [TaskArguments] a new instance of TaskArguments
+ #
+ # source://rake//lib/rake/task_arguments.rb#15
+ def initialize(names, values, parent = T.unsafe(nil)); end
+
+ # Find an argument value by name or index.
+ #
+ # source://rake//lib/rake/task_arguments.rb#44
+ def [](index); end
+
+ # Enumerates the arguments and their values
+ #
+ # source://rake//lib/rake/task_arguments.rb#56
+ def each(&block); end
+
+ # Retrieve the list of values not associated with named arguments
+ #
+ # source://rake//lib/rake/task_arguments.rb#32
+ def extras; end
+
+ # source://rake//lib/rake/task_arguments.rb#93
+ def fetch(*args, &block); end
+
+ # Returns true if +key+ is one of the arguments
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/task_arguments.rb#88
+ def has_key?(key); end
+
+ # source://rake//lib/rake/task_arguments.rb#79
+ def inspect; end
+
+ # Returns true if +key+ is one of the arguments
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/task_arguments.rb#88
+ def key?(key); end
+
+ # Returns the value of the given argument via method_missing
+ #
+ # source://rake//lib/rake/task_arguments.rb#66
+ def method_missing(sym, *args); end
+
+ # Argument names
+ #
+ # source://rake//lib/rake/task_arguments.rb#11
+ def names; end
+
+ # Create a new argument scope using the prerequisite argument
+ # names.
+ #
+ # source://rake//lib/rake/task_arguments.rb#38
+ def new_scope(names); end
+
+ # Retrieve the complete array of sequential values
+ #
+ # source://rake//lib/rake/task_arguments.rb#27
+ def to_a; end
+
+ # Returns a Hash of arguments and their values
+ #
+ # source://rake//lib/rake/task_arguments.rb#71
+ def to_hash; end
+
+ # source://rake//lib/rake/task_arguments.rb#75
+ def to_s; end
+
+ # Extracts the argument values at +keys+
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task_arguments.rb#51
+ def with_defaults(defaults); end
+
+ protected
+
+ # source://rake//lib/rake/task_arguments.rb#99
+ def lookup(name); end
+end
+
+# Base class for Task Libraries.
+#
+# source://rake//lib/rake/tasklib.rb#7
+class Rake::TaskLib
+ include ::Rake::Cloneable
+ include ::FileUtils::StreamUtils_
+ include ::FileUtils
+ include ::Rake::FileUtilsExt
+ include ::Rake::DSL
+end
+
+# The TaskManager module is a mixin for managing tasks.
+#
+# source://rake//lib/rake/task_manager.rb#5
+module Rake::TaskManager
+ # source://rake//lib/rake/task_manager.rb#9
+ def initialize; end
+
+ # Find a matching task for +task_name+.
+ #
+ # source://rake//lib/rake/task_manager.rb#54
+ def [](task_name, scopes = T.unsafe(nil)); end
+
+ # Clear all tasks in this application.
+ #
+ # source://rake//lib/rake/task_manager.rb#182
+ def clear; end
+
+ # source://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.
+ #
+ # source://rake//lib/rake/task_manager.rb#222
+ def current_scope; end
+
+ # source://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.
+ #
+ # source://rake//lib/rake/task_manager.rb#151
+ def enhance_with_matching_rule(task_name, level = T.unsafe(nil)); end
+
+ # source://rake//lib/rake/task_manager.rb#68
+ def generate_did_you_mean_suggestions(task_name); end
+
+ # source://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.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task_manager.rb#49
+ def intern(task_class, task_name); end
+
+ # Track the last comment made in the Rakefile.
+ #
+ # source://rake//lib/rake/task_manager.rb#7
+ def last_description; end
+
+ # Track the last comment made in the Rakefile.
+ #
+ # source://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.
+ #
+ # source://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].
+ #
+ # source://rake//lib/rake/task_manager.rb#88
+ def resolve_args(args); end
+
+ # source://rake//lib/rake/task_manager.rb#81
+ def synthesize_file_task(task_name); end
+
+ # List of all defined tasks in this application.
+ #
+ # source://rake//lib/rake/task_manager.rb#168
+ def tasks; end
+
+ # List of all the tasks defined in the given scope (and its
+ # sub-scopes).
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task_manager.rb#241
+ def add_location(task); end
+
+ # Attempt to create a rule given the list of prerequisites.
+ #
+ # source://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.
+ #
+ # source://rake//lib/rake/task_manager.rb#248
+ def find_location; end
+
+ # Generate an anonymous namespace name.
+ #
+ # source://rake//lib/rake/task_manager.rb#259
+ def generate_name; end
+
+ # Return the current description, clearing it in the process.
+ #
+ # source://rake//lib/rake/task_manager.rb#319
+ def get_description(task); end
+
+ # Lookup the task name
+ #
+ # source://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.
+ #
+ # source://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]
+ #
+ # source://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]
+ #
+ # source://rake//lib/rake/task_manager.rb#105
+ def resolve_args_without_dependencies(args); end
+
+ # source://rake//lib/rake/task_manager.rb#265
+ def trace_rule(level, message); end
+
+ class << self
+ # source://rake//lib/rake/task_manager.rb#326
+ def record_task_metadata; end
+
+ # source://rake//lib/rake/task_manager.rb#326
+ def record_task_metadata=(_arg0); end
+ end
+end
+
+# source://rake//lib/rake/thread_history_display.rb#6
+class Rake::ThreadHistoryDisplay
+ include ::Rake::PrivateReader
+ extend ::Rake::PrivateReader::ClassMethods
+
+ # @return [ThreadHistoryDisplay] a new instance of ThreadHistoryDisplay
+ #
+ # source://rake//lib/rake/thread_history_display.rb#11
+ def initialize(stats); end
+
+ # source://rake//lib/rake/thread_history_display.rb#17
+ def show; end
+
+ private
+
+ # source://rake//lib/rake/private_reader.rb#15
+ def items; end
+
+ # source://rake//lib/rake/thread_history_display.rb#35
+ def rename(hash, key, renames); end
+
+ # source://rake//lib/rake/private_reader.rb#15
+ def stats; end
+
+ # source://rake//lib/rake/private_reader.rb#15
+ def threads; end
+end
+
+# source://rake//lib/rake/thread_pool.rb#7
+class Rake::ThreadPool
+ # Creates a ThreadPool object. The +thread_count+ parameter is the size
+ # of the pool.
+ #
+ # @return [ThreadPool] a new instance of ThreadPool
+ #
+ # source://rake//lib/rake/thread_pool.rb#11
+ 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)
+ #
+ # source://rake//lib/rake/thread_pool.rb#33
+ def future(*args, &block); end
+
+ # Enable the gathering of history events.
+ #
+ # source://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).
+ #
+ # source://rake//lib/rake/thread_pool.rb#77
+ def history; end
+
+ # Waits until the queue of futures is empty and all threads have exited.
+ #
+ # source://rake//lib/rake/thread_pool.rb#44
+ def join; end
+
+ # Return a hash of always collected statistics for the thread pool.
+ #
+ # source://rake//lib/rake/thread_pool.rb#84
+ def statistics; end
+
+ private
+
+ # for testing only
+ #
+ # source://rake//lib/rake/thread_pool.rb#158
+ def __queue__; end
+
+ # processes one item on the queue. Returns true if there was an
+ # item to process, false if there was no item
+ #
+ # source://rake//lib/rake/thread_pool.rb#95
+ def process_queue_item; end
+
+ # source://rake//lib/rake/thread_pool.rb#111
+ def safe_thread_count; end
+
+ # source://rake//lib/rake/thread_pool.rb#117
+ def start_thread; end
+
+ # source://rake//lib/rake/thread_pool.rb#145
+ def stat(event, data = T.unsafe(nil)); end
+end
+
+# source://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.
+ #
+ # source://rake//lib/rake/trace_output.rb#10
+ def trace_on(out, *strings); end
+end
+
+# source://rake//lib/rake/version.rb#3
+Rake::VERSION = T.let(T.unsafe(nil), String)
+
+# source://rake//lib/rake/version.rb#5
+module Rake::Version; end
+
+# source://rake//lib/rake/version.rb#6
+Rake::Version::BUILD = T.let(T.unsafe(nil), String)
+
+# source://rake//lib/rake/version.rb#6
+Rake::Version::MAJOR = T.let(T.unsafe(nil), String)
+
+# source://rake//lib/rake/version.rb#6
+Rake::Version::MINOR = T.let(T.unsafe(nil), String)
+
+# source://rake//lib/rake/version.rb#8
+Rake::Version::NUMBERS = T.let(T.unsafe(nil), Array)
+
+# source://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.
+#
+# source://rake//lib/rake/win32.rb#7
+module Rake::Win32
+ class << self
+ # Normalize a win32 path so that the slashes are all forward slashes.
+ #
+ # source://rake//lib/rake/win32.rb#45
+ def normalize(path); end
+
+ # The standard directory containing system wide rake files on
+ # Win 32 systems. Try the following environment variables (in
+ # order):
+ #
+ # * HOME
+ # * HOMEDRIVE + HOMEPATH
+ # * APPDATA
+ # * USERPROFILE
+ #
+ # If the above are not defined, the return nil.
+ #
+ # @raise [Win32HomeError]
+ #
+ # source://rake//lib/rake/win32.rb#30
+ def win32_system_dir; end
+
+ # True if running on a windows system.
+ #
+ # @return [Boolean]
+ #
+ # source://rake//lib/rake/win32.rb#16
+ def windows?; end
+ end
+end
+
+# Error indicating a problem in locating the home directory on a
+# Win32 system.
+#
+# source://rake//lib/rake/win32.rb#11
+class Rake::Win32::Win32HomeError < ::RuntimeError; end
+
+# source://rake//lib/rake.rb#71
+RakeFileUtils = Rake::FileUtilsExt
+
+# source://rake//lib/rake/ext/string.rb#4
+class String
+ include ::Comparable
+
+ # source://rake//lib/rake/ext/string.rb#14
+ def ext(newext = T.unsafe(nil)); end
+
+ # source://rake//lib/rake/ext/string.rb#138
+ def pathmap(spec = T.unsafe(nil), &block); end
+
+ protected
+
+ # source://rake//lib/rake/ext/string.rb#27
+ def pathmap_explode; end
+
+ # source://rake//lib/rake/ext/string.rb#41
+ def pathmap_partial(n); end
+
+ # source://rake//lib/rake/ext/string.rb#59
+ def pathmap_replace(patterns, &block); end
+end
diff --git a/sorbet/rbi/gems/rbi@0.1.1.rbi b/sorbet/rbi/gems/rbi@0.1.1.rbi
new file mode 100644
index 0000000..e3cb51e
--- /dev/null
+++ b/sorbet/rbi/gems/rbi@0.1.1.rbi
@@ -0,0 +1,2926 @@
+# 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`.
+
+# source://rbi//lib/rbi/loc.rb#4
+module RBI; end
+
+# source://rbi//lib/rbi/model.rb#968
+class RBI::Arg < ::RBI::Node
+ # source://rbi//lib/rbi/model.rb#980
+ sig { params(value: ::String, loc: T.nilable(::RBI::Loc)).void }
+ def initialize(value, loc: T.unsafe(nil)); end
+
+ # source://rbi//lib/rbi/model.rb#986
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # source://rbi//lib/rbi/printer.rb#613
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/model.rb#991
+ sig { returns(::String) }
+ def to_s; end
+
+ # source://rbi//lib/rbi/model.rb#972
+ sig { returns(::String) }
+ def value; end
+end
+
+# Attributes
+#
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://rbi//lib/rbi/model.rb#349
+class RBI::Attr < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ abstract!
+
+ # source://rbi//lib/rbi/model.rb#374
+ sig do
+ params(
+ name: ::Symbol,
+ names: T::Array[::Symbol],
+ visibility: ::RBI::Visibility,
+ sigs: T::Array[::RBI::Sig],
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/printer.rb#348
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#412
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # @abstract
+ #
+ # source://rbi//lib/rbi/model.rb#382
+ sig { abstract.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # source://rbi//lib/rbi/index.rb#113
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#420
+ sig { override.params(other: ::RBI::Node).void }
+ def merge_with(other); end
+
+ # source://rbi//lib/rbi/model.rb#356
+ sig { returns(T::Array[::Symbol]) }
+ def names; end
+
+ # source://rbi//lib/rbi/printer.rb#375
+ sig { override.returns(T::Boolean) }
+ def oneline?; end
+
+ # source://rbi//lib/rbi/model.rb#362
+ sig { returns(T::Array[::RBI::Sig]) }
+ def sigs; end
+
+ # source://rbi//lib/rbi/model.rb#359
+ sig { returns(::RBI::Visibility) }
+ def visibility; end
+
+ # @return [Visibility]
+ #
+ # source://rbi//lib/rbi/model.rb#359
+ def visibility=(_arg0); end
+end
+
+# source://rbi//lib/rbi/model.rb#385
+class RBI::AttrAccessor < ::RBI::Attr
+ # source://rbi//lib/rbi/model.rb#399
+ sig do
+ params(
+ name: ::Symbol,
+ names: ::Symbol,
+ visibility: ::RBI::Visibility,
+ sigs: T::Array[::RBI::Sig],
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#452
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # source://rbi//lib/rbi/model.rb#405
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # source://rbi//lib/rbi/model.rb#411
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# source://rbi//lib/rbi/model.rb#417
+class RBI::AttrReader < ::RBI::Attr
+ # source://rbi//lib/rbi/model.rb#431
+ sig do
+ params(
+ name: ::Symbol,
+ names: ::Symbol,
+ visibility: ::RBI::Visibility,
+ sigs: T::Array[::RBI::Sig],
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#434
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # source://rbi//lib/rbi/model.rb#437
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # source://rbi//lib/rbi/model.rb#443
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# source://rbi//lib/rbi/model.rb#449
+class RBI::AttrWriter < ::RBI::Attr
+ # source://rbi//lib/rbi/model.rb#463
+ sig do
+ params(
+ name: ::Symbol,
+ names: ::Symbol,
+ visibility: ::RBI::Visibility,
+ sigs: T::Array[::RBI::Sig],
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#443
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # source://rbi//lib/rbi/model.rb#469
+ sig { override.returns(T::Array[::String]) }
+ def fully_qualified_names; end
+
+ # source://rbi//lib/rbi/model.rb#475
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# An arbitrary blank line that can be added both in trees and comments
+#
+# source://rbi//lib/rbi/model.rb#74
+class RBI::BlankLine < ::RBI::Comment
+ # source://rbi//lib/rbi/model.rb#78
+ sig { params(loc: T.nilable(::RBI::Loc)).void }
+ def initialize(loc: T.unsafe(nil)); end
+
+ # source://rbi//lib/rbi/printer.rb#217
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+end
+
+# source://rbi//lib/rbi/model.rb#741
+class RBI::BlockParam < ::RBI::Param
+ # source://rbi//lib/rbi/model.rb#752
+ sig do
+ params(
+ name: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/model.rb#763
+ sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
+ def ==(other); end
+
+ # source://rbi//lib/rbi/printer.rb#543
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/printer.rb#548
+ sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
+ def print_comment_leading_space(v, last:); end
+
+ # source://rbi//lib/rbi/model.rb#758
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# source://rbi//lib/rbi/model.rb#218
+class RBI::Class < ::RBI::Scope
+ # source://rbi//lib/rbi/model.rb#236
+ sig do
+ params(
+ name: ::String,
+ superclass_name: T.nilable(::String),
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#376
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # source://rbi//lib/rbi/model.rb#244
+ sig { override.returns(::String) }
+ def fully_qualified_name; end
+
+ # source://rbi//lib/rbi/model.rb#222
+ sig { returns(::String) }
+ def name; end
+
+ # @return [String]
+ #
+ # source://rbi//lib/rbi/model.rb#222
+ def name=(_arg0); end
+
+ # source://rbi//lib/rbi/printer.rb#284
+ sig { override.params(v: ::RBI::Printer).void }
+ def print_header(v); end
+
+ # source://rbi//lib/rbi/model.rb#225
+ sig { returns(T.nilable(::String)) }
+ def superclass_name; end
+
+ # @return [String, nil]
+ #
+ # source://rbi//lib/rbi/model.rb#225
+ def superclass_name=(_arg0); end
+end
+
+# source://rbi//lib/rbi/model.rb#53
+class RBI::Comment < ::RBI::Node
+ # source://rbi//lib/rbi/model.rb#60
+ sig { params(text: ::String, loc: T.nilable(::RBI::Loc)).void }
+ def initialize(text, loc: T.unsafe(nil)); end
+
+ # source://rbi//lib/rbi/model.rb#66
+ sig { params(other: ::Object).returns(T::Boolean) }
+ def ==(other); end
+
+ # source://rbi//lib/rbi/printer.rb#197
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/model.rb#57
+ sig { returns(::String) }
+ def text; end
+
+ # @return [String]
+ #
+ # source://rbi//lib/rbi/model.rb#57
+ 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
+# ~~~
+#
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#589
+class RBI::ConflictTree < ::RBI::Tree
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#596
+ sig { params(left_name: ::String, right_name: ::String).void }
+ def initialize(left_name: T.unsafe(nil), right_name: T.unsafe(nil)); end
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#607
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#593
+ sig { returns(::RBI::Tree) }
+ def left; end
+
+ # @return [Tree]
+ #
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#593
+ def right; end
+end
+
+# Consts
+#
+# source://rbi//lib/rbi/model.rb#312
+class RBI::Const < ::RBI::NodeWithComments
+ include ::RBI::Indexable
+
+ # source://rbi//lib/rbi/model.rb#327
+ sig do
+ params(
+ name: ::String,
+ value: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/printer.rb#335
+ sig { override.params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#403
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # source://rbi//lib/rbi/model.rb#335
+ sig { returns(::String) }
+ def fully_qualified_name; end
+
+ # source://rbi//lib/rbi/index.rb#103
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # source://rbi//lib/rbi/model.rb#316
+ sig { returns(::String) }
+ def name; end
+
+ # source://rbi//lib/rbi/model.rb#342
+ sig { override.returns(::String) }
+ def to_s; end
+
+ # @return [String]
+ #
+ # source://rbi//lib/rbi/model.rb#316
+ def value; end
+end
+
+# source://rbi//lib/rbi/model.rb#816
+class RBI::Extend < ::RBI::Mixin
+ include ::RBI::Indexable
+
+ # source://rbi//lib/rbi/model.rb#828
+ sig do
+ params(
+ name: ::String,
+ names: ::String,
+ loc: T.nilable(::RBI::Loc),
+ comments: 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
+
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#502
+ sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
+ def compatible_with?(other); end
+
+ # source://rbi//lib/rbi/index.rb#143
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # source://rbi//lib/rbi/model.rb#834
+ sig { override.returns(::String) }
+ def to_s; end
+end
+
+# source://rbi//lib/rbi/model.rb#137
+class RBI::File
+ # source://rbi//lib/rbi/model.rb#156
+ sig do
+ params(
+ strictness: T.nilable(::String),
+ comments: 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
+
+ # source://rbi//lib/rbi/model.rb#164
+ sig { params(node: ::RBI::Node).void }
+ def <<(node); end
+
+ # source://rbi//lib/rbi/printer.rb#105
+ sig { params(v: ::RBI::Printer).void }
+ def accept_printer(v); end
+
+ # source://rbi//lib/rbi/model.rb#147
+ sig { returns(T::Array[::RBI::Comment]) }
+ def comments; end
+
+ # @return [Arraysome text this is bold! more text
" + # d.root.get_text.class # => REXML::Text + # d.root.get_text # => "some text " + # + # With argument +xpath+, returns the first text node from the element + # that matches +xpath+: + # + # d.root.get_text(1) # => "this is bold!" + # + # source://rexml//lib/rexml/element.rb#1052 + def get_text(path = T.unsafe(nil)); end + + # :call-seq: + # has_attributes? -> true or false + # + # Returns +true+ if the element has attributes, +false+ otherwise: + # + # d = REXML::Document.new('some text this is bold! more text
" + # d.root.text.class # => String + # d.root.text # => "some text " + # + # With argument +xpath+, returns text from the first text node + # in the element that matches +xpath+: + # + # d.root.text(1) # => "this is bold!" + # + # Note that an element may have multiple text nodes, + # possibly separated by other non-text children, as above. + # Even so, the returned value is the string text from the first such node. + # + # Note also that the text note is retrieved by method get_text, + # and so is always normalized text. + # + # source://rexml//lib/rexml/element.rb#1029 + def text(path = T.unsafe(nil)); end + + # :call-seq: + # text = string -> string + # text = nil -> nil + # + # Adds, replaces, or removes the first text node child in the element. + # + # With string argument +string+, + # creates a new \REXML::Text node containing that string, + # honoring the current settings for whitespace and row, + # then places the node as the first text child in the element; + # returns +string+. + # + # If the element has no text child, the text node is added: + # + # d = REXML::Document.new '' + # d.root.text = 'foo' #-> 'foo' + # + # If the element has a text child, it is replaced: + # + # d.root.text = 'bar' #-> 'bar' + # + # With argument +nil+, removes the first text child: + # + # d.root.text = nil #-> '