phlex-stimulus 0.1.0

data/sorbet/rbi/gems/timeout@0.6.1.rbi

@@ -0,0 +1,200 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `timeout` gem.
+# Please instead update this file by running `bin/tapioca gem timeout`.
+
+
+# Timeout long-running blocks
+#
+# == Synopsis
+#
+#   require 'timeout'
+#   status = Timeout.timeout(5) {
+#     # Something that should be interrupted if it takes more than 5 seconds...
+#   }
+#
+# == Description
+#
+# Timeout provides a way to auto-terminate a potentially long-running
+# operation if it hasn't finished in a fixed amount of time.
+#
+# == Copyright
+#
+# Copyright:: (C) 2000  Network Applied Communication Laboratory, Inc.
+# Copyright:: (C) 2000  Information-technology Promotion Agency, Japan
+#
+# pkg:gem/timeout#lib/timeout.rb:21
+module Timeout
+  private
+
+  # See Timeout.timeout
+  #
+  # pkg:gem/timeout#lib/timeout.rb:311
+  def timeout(*args, &block); end
+
+  class << self
+    # Perform an operation in a block, raising an exception if it takes longer than
+    # +sec+ seconds to complete.
+    #
+    # +sec+:: Number of seconds to wait for the block to terminate. Any non-negative number
+    #         or nil may be used, including Floats to specify fractional seconds. A
+    #         value of 0 or +nil+ will execute the block without any timeout.
+    #         Any negative number will raise an ArgumentError.
+    # +klass+:: Exception Class to raise if the block fails to terminate
+    #           in +sec+ seconds.  Omitting will use the default, Timeout::Error.
+    # +message+:: Error message to raise with Exception Class.
+    #             Omitting will use the default, <tt>"execution expired"</tt>.
+    #
+    # Returns the result of the block *if* the block completed before
+    # +sec+ seconds, otherwise raises an exception, based on the value of +klass+.
+    #
+    # The exception raised to terminate the given block is the given +klass+, or
+    # Timeout::ExitException if +klass+ is not given. The reason for that behavior
+    # is that Timeout::Error inherits from RuntimeError and might be caught unexpectedly by +rescue+.
+    # Timeout::ExitException inherits from Exception so it will only be rescued by <tt>rescue Exception</tt>.
+    # Note that the Timeout::ExitException is translated to a Timeout::Error once it reaches the Timeout.timeout call,
+    # so outside that call it will be a Timeout::Error.
+    #
+    # In general, be aware that the code block may rescue the exception, and in such a case not respect the timeout.
+    # Also, the block can use +ensure+ to prevent the handling of the exception.
+    # For those reasons, this method cannot be relied on to enforce timeouts for untrusted blocks.
+    #
+    # If a scheduler is defined, it will be used to handle the timeout by invoking
+    # Fiber::Scheduler#timeout_after.
+    #
+    # Note that this is both a method of module Timeout, so you can <tt>include
+    # Timeout</tt> into your classes so they have a #timeout method, as well as
+    # a module method, so you can call it directly as Timeout.timeout().
+    #
+    # ==== Ensuring the exception does not fire inside ensure blocks
+    #
+    # When using Timeout.timeout, it can be desirable to ensure the timeout exception does not fire inside an +ensure+ block.
+    # The simplest and best way to do so is to put the Timeout.timeout call inside the body of the +begin+/+ensure+/+end+:
+    #
+    #     begin
+    #       Timeout.timeout(sec) { some_long_operation }
+    #     ensure
+    #       cleanup # safe, cannot be interrupted by timeout
+    #     end
+    #
+    # If that is not feasible, e.g. if there are +ensure+ blocks inside +some_long_operation+,
+    # they need to not be interrupted by timeout, and it's not possible to move these ensure blocks outside,
+    # one can use Thread.handle_interrupt to delay the timeout exception like so:
+    #
+    #     Thread.handle_interrupt(Timeout::Error => :never) {
+    #       Timeout.timeout(sec, Timeout::Error) do
+    #         setup # timeout cannot happen here, no matter how long it takes
+    #         Thread.handle_interrupt(Timeout::Error => :immediate) {
+    #           some_long_operation # timeout can happen here
+    #         }
+    #       ensure
+    #         cleanup # timeout cannot happen here, no matter how long it takes
+    #       end
+    #     }
+    #
+    # An important thing to note is the need to pass an exception +klass+ to Timeout.timeout,
+    # otherwise it does not work. Specifically, using <tt>Thread.handle_interrupt(Timeout::ExitException => ...)</tt>
+    # is unsupported and causes subtle errors like raising the wrong exception outside the block, do not use that.
+    #
+    # Note that Thread.handle_interrupt is somewhat dangerous because if setup or cleanup hangs
+    # then the current thread will hang too and the timeout will never fire.
+    # Also note the block might run for longer than +sec+ seconds:
+    # e.g. +some_long_operation+ executes for +sec+ seconds + whatever time cleanup takes.
+    #
+    # If you want the timeout to only happen on blocking operations, one can use +:on_blocking+
+    # instead of +:immediate+. However, that means if the block uses no blocking operations after +sec+ seconds,
+    # the block will not be interrupted.
+    #
+    # pkg:gem/timeout#lib/timeout.rb:278
+    def timeout(sec, klass = T.unsafe(nil), message = T.unsafe(nil), &block); end
+  end
+end
+
+# Raised by Timeout.timeout when the block times out.
+#
+# pkg:gem/timeout#lib/timeout.rb:33
+class Timeout::Error < ::RuntimeError
+  class << self
+    # pkg:gem/timeout#lib/timeout.rb:34
+    def handle_timeout(message); end
+  end
+end
+
+# Internal exception raised to when a timeout is triggered.
+#
+# pkg:gem/timeout#lib/timeout.rb:26
+class Timeout::ExitException < ::Exception
+  # pkg:gem/timeout#lib/timeout.rb:27
+  def exception(*_arg0); end
+end
+
+# We keep a private reference so that time mocking libraries won't break Timeout.
+#
+# pkg:gem/timeout#lib/timeout.rb:49
+Timeout::GET_TIME = T.let(T.unsafe(nil), Method)
+
+# pkg:gem/timeout#lib/timeout.rb:143
+class Timeout::Request
+  # pkg:gem/timeout#lib/timeout.rb:146
+  def initialize(thread, timeout, exception_class, message); end
+
+  # pkg:gem/timeout#lib/timeout.rb:144
+  def deadline; end
+
+  # Only called by the timeout thread, so does not need Sync.synchronize
+  #
+  # pkg:gem/timeout#lib/timeout.rb:157
+  def done?; end
+
+  # pkg:gem/timeout#lib/timeout.rb:163
+  def expired?(now); end
+
+  # pkg:gem/timeout#lib/timeout.rb:177
+  def finished; end
+
+  # Only called by the timeout thread, so does not need Sync.synchronize
+  #
+  # pkg:gem/timeout#lib/timeout.rb:168
+  def interrupt; end
+end
+
+# pkg:gem/timeout#lib/timeout.rb:56
+class Timeout::State
+  # pkg:gem/timeout#lib/timeout.rb:57
+  def initialize; end
+
+  # pkg:gem/timeout#lib/timeout.rb:134
+  def add_request(request); end
+
+  # pkg:gem/timeout#lib/timeout.rb:83
+  def create_timeout_thread; end
+
+  # pkg:gem/timeout#lib/timeout.rb:120
+  def ensure_timeout_thread_created; end
+
+  class << self
+    # Ractor support if
+    # 1. Ractor.store_if_absent is available
+    # 2. Method object can be shareable (4.0~)
+    #
+    # pkg:gem/timeout#lib/timeout.rb:70
+    def instance; end
+  end
+end
+
+# pkg:gem/timeout#lib/timeout.rb:185
+module Timeout::Sync
+  class << self
+    # Calls mutex.synchronize(&block) but if that fails on CRuby due to being in a trap handler,
+    # run mutex.synchronize(&block) in a separate Thread instead.
+    #
+    # pkg:gem/timeout#lib/timeout.rb:188
+    def synchronize(mutex, &block); end
+  end
+end
+
+# The version
+#
+# pkg:gem/timeout#lib/timeout.rb:23
+Timeout::VERSION = T.let(T.unsafe(nil), String)

data/sorbet/rbi/gems/tsort@0.2.0.rbi

@@ -0,0 +1,389 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `tsort` gem.
+# Please instead update this file by running `bin/tapioca gem tsort`.
+
+
+# TSort implements topological sorting using Tarjan's algorithm for
+# strongly connected components.
+#
+# TSort is designed to be able to be used with any object which can be
+# interpreted as a directed graph.
+#
+# TSort requires two methods to interpret an object as a graph,
+# tsort_each_node and tsort_each_child.
+#
+# * tsort_each_node is used to iterate for all nodes over a graph.
+# * tsort_each_child is used to iterate for child nodes of a given node.
+#
+# The equality of nodes are defined by eql? and hash since
+# TSort uses Hash internally.
+#
+# == A Simple Example
+#
+# The following example demonstrates how to mix the TSort module into an
+# existing class (in this case, Hash). Here, we're treating each key in
+# the hash as a node in the graph, and so we simply alias the required
+# #tsort_each_node method to Hash's #each_key method. For each key in the
+# hash, the associated value is an array of the node's child nodes. This
+# choice in turn leads to our implementation of the required #tsort_each_child
+# method, which fetches the array of child nodes and then iterates over that
+# array using the user-supplied block.
+#
+#   require 'tsort'
+#
+#   class Hash
+#     include TSort
+#     alias tsort_each_node each_key
+#     def tsort_each_child(node, &block)
+#       fetch(node).each(&block)
+#     end
+#   end
+#
+#   {1=>[2, 3], 2=>[3], 3=>[], 4=>[]}.tsort
+#   #=> [3, 2, 1, 4]
+#
+#   {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}.strongly_connected_components
+#   #=> [[4], [2, 3], [1]]
+#
+# == A More Realistic Example
+#
+# A very simple `make' like tool can be implemented as follows:
+#
+#   require 'tsort'
+#
+#   class Make
+#     def initialize
+#       @dep = {}
+#       @dep.default = []
+#     end
+#
+#     def rule(outputs, inputs=[], &block)
+#       triple = [outputs, inputs, block]
+#       outputs.each {|f| @dep[f] = [triple]}
+#       @dep[triple] = inputs
+#     end
+#
+#     def build(target)
+#       each_strongly_connected_component_from(target) {|ns|
+#         if ns.length != 1
+#           fs = ns.delete_if {|n| Array === n}
+#           raise TSort::Cyclic.new("cyclic dependencies: #{fs.join ', '}")
+#         end
+#         n = ns.first
+#         if Array === n
+#           outputs, inputs, block = n
+#           inputs_time = inputs.map {|f| File.mtime f}.max
+#           begin
+#             outputs_time = outputs.map {|f| File.mtime f}.min
+#           rescue Errno::ENOENT
+#             outputs_time = nil
+#           end
+#           if outputs_time == nil ||
+#              inputs_time != nil && outputs_time <= inputs_time
+#             sleep 1 if inputs_time != nil && inputs_time.to_i == Time.now.to_i
+#             block.call
+#           end
+#         end
+#       }
+#     end
+#
+#     def tsort_each_child(node, &block)
+#       @dep[node].each(&block)
+#     end
+#     include TSort
+#   end
+#
+#   def command(arg)
+#     print arg, "\n"
+#     system arg
+#   end
+#
+#   m = Make.new
+#   m.rule(%w[t1]) { command 'date > t1' }
+#   m.rule(%w[t2]) { command 'date > t2' }
+#   m.rule(%w[t3]) { command 'date > t3' }
+#   m.rule(%w[t4], %w[t1 t3]) { command 'cat t1 t3 > t4' }
+#   m.rule(%w[t5], %w[t4 t2]) { command 'cat t4 t2 > t5' }
+#   m.build('t5')
+#
+# == Bugs
+#
+# * 'tsort.rb' is wrong name because this library uses
+#   Tarjan's algorithm for strongly connected components.
+#   Although 'strongly_connected_components.rb' is correct but too long.
+#
+# == References
+#
+# R. E. Tarjan, "Depth First Search and Linear Graph Algorithms",
+# <em>SIAM Journal on Computing</em>, Vol. 1, No. 2, pp. 146-160, June 1972.
+#
+# pkg:gem/tsort#lib/tsort.rb:124
+module TSort
+  # The iterator version of the #strongly_connected_components method.
+  # <tt><em>obj</em>.each_strongly_connected_component</tt> is similar to
+  # <tt><em>obj</em>.strongly_connected_components.each</tt>, but
+  # modification of _obj_ during the iteration may lead to unexpected results.
+  #
+  # #each_strongly_connected_component returns +nil+.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   graph.each_strongly_connected_component {|scc| p scc }
+  #   #=> [4]
+  #   #   [2]
+  #   #   [3]
+  #   #   [1]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   graph.each_strongly_connected_component {|scc| p scc }
+  #   #=> [4]
+  #   #   [2, 3]
+  #   #   [1]
+  #
+  # pkg:gem/tsort#lib/tsort.rb:316
+  def each_strongly_connected_component(&block); end
+
+  # Iterates over strongly connected component in the subgraph reachable from
+  # _node_.
+  #
+  # Return value is unspecified.
+  #
+  # #each_strongly_connected_component_from doesn't call #tsort_each_node.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   graph.each_strongly_connected_component_from(2) {|scc| p scc }
+  #   #=> [4]
+  #   #   [2]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   graph.each_strongly_connected_component_from(2) {|scc| p scc }
+  #   #=> [4]
+  #   #   [2, 3]
+  #
+  # pkg:gem/tsort#lib/tsort.rb:386
+  def each_strongly_connected_component_from(node, id_map = T.unsafe(nil), stack = T.unsafe(nil), &block); end
+
+  # Returns strongly connected components as an array of arrays of nodes.
+  # The array is sorted from children to parents.
+  # Each elements of the array represents a strongly connected component.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   p graph.strongly_connected_components #=> [[4], [2], [3], [1]]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   p graph.strongly_connected_components #=> [[4], [2, 3], [1]]
+  #
+  # pkg:gem/tsort#lib/tsort.rb:257
+  def strongly_connected_components; end
+
+  # Returns a topologically sorted array of nodes.
+  # The array is sorted from children to parents, i.e.
+  # the first element has no child and the last node has no parent.
+  #
+  # If there is a cycle, TSort::Cyclic is raised.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   p graph.tsort #=> [4, 2, 3, 1]
+  #
+  #   graph = G.new({1=>[2], 2=>[3, 4], 3=>[2], 4=>[]})
+  #   p graph.tsort # raises TSort::Cyclic
+  #
+  # pkg:gem/tsort#lib/tsort.rb:152
+  def tsort; end
+
+  # The iterator version of the #tsort method.
+  # <tt><em>obj</em>.tsort_each</tt> is similar to <tt><em>obj</em>.tsort.each</tt>, but
+  # modification of _obj_ during the iteration may lead to unexpected results.
+  #
+  # #tsort_each returns +nil+.
+  # If there is a cycle, TSort::Cyclic is raised.
+  #
+  #   class G
+  #     include TSort
+  #     def initialize(g)
+  #       @g = g
+  #     end
+  #     def tsort_each_child(n, &b) @g[n].each(&b) end
+  #     def tsort_each_node(&b) @g.each_key(&b) end
+  #   end
+  #
+  #   graph = G.new({1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]})
+  #   graph.tsort_each {|n| p n }
+  #   #=> 4
+  #   #   2
+  #   #   3
+  #   #   1
+  #
+  # pkg:gem/tsort#lib/tsort.rb:205
+  def tsort_each(&block); end
+
+  # Should be implemented by a extended class.
+  #
+  # #tsort_each_child is used to iterate for child nodes of _node_.
+  #
+  # pkg:gem/tsort#lib/tsort.rb:452
+  def tsort_each_child(node); end
+
+  # Should be implemented by a extended class.
+  #
+  # #tsort_each_node is used to iterate for all nodes over a graph.
+  #
+  # pkg:gem/tsort#lib/tsort.rb:444
+  def tsort_each_node; end
+
+  class << self
+    # The iterator version of the TSort.strongly_connected_components method.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc }
+    #   #=> [4]
+    #   #   [2]
+    #   #   [3]
+    #   #   [1]
+    #
+    #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   TSort.each_strongly_connected_component(each_node, each_child) {|scc| p scc }
+    #   #=> [4]
+    #   #   [2, 3]
+    #   #   [1]
+    #
+    # pkg:gem/tsort#lib/tsort.rb:345
+    def each_strongly_connected_component(each_node, each_child); end
+
+    # Iterates over strongly connected components in a graph.
+    # The graph is represented by _node_ and _each_child_.
+    #
+    # _node_ is the first node.
+    # _each_child_ should have +call+ method which takes a node argument
+    # and yields for each child node.
+    #
+    # Return value is unspecified.
+    #
+    # #TSort.each_strongly_connected_component_from is a class method and
+    # it doesn't need a class to represent a graph which includes TSort.
+    #
+    #   graph = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_child = lambda {|n, &b| graph[n].each(&b) }
+    #   TSort.each_strongly_connected_component_from(1, each_child) {|scc|
+    #     p scc
+    #   }
+    #   #=> [4]
+    #   #   [2, 3]
+    #   #   [1]
+    #
+    # pkg:gem/tsort#lib/tsort.rb:411
+    def each_strongly_connected_component_from(node, each_child, id_map = T.unsafe(nil), stack = T.unsafe(nil)); end
+
+    # Returns strongly connected components as an array of arrays of nodes.
+    # The array is sorted from children to parents.
+    # Each elements of the array represents a strongly connected component.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.strongly_connected_components(each_node, each_child)
+    #   #=> [[4], [2], [3], [1]]
+    #
+    #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.strongly_connected_components(each_node, each_child)
+    #   #=> [[4], [2, 3], [1]]
+    #
+    # pkg:gem/tsort#lib/tsort.rb:283
+    def strongly_connected_components(each_node, each_child); end
+
+    # Returns a topologically sorted array of nodes.
+    # The array is sorted from children to parents, i.e.
+    # the first element has no child and the last node has no parent.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    # If there is a cycle, TSort::Cyclic is raised.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.tsort(each_node, each_child) #=> [4, 2, 3, 1]
+    #
+    #   g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   p TSort.tsort(each_node, each_child) # raises TSort::Cyclic
+    #
+    # pkg:gem/tsort#lib/tsort.rb:178
+    def tsort(each_node, each_child); end
+
+    # The iterator version of the TSort.tsort method.
+    #
+    # The graph is represented by _each_node_ and _each_child_.
+    # _each_node_ should have +call+ method which yields for each node in the graph.
+    # _each_child_ should have +call+ method which takes a node argument and yields for each child node.
+    #
+    #   g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
+    #   each_node = lambda {|&b| g.each_key(&b) }
+    #   each_child = lambda {|n, &b| g[n].each(&b) }
+    #   TSort.tsort_each(each_node, each_child) {|n| p n }
+    #   #=> 4
+    #   #   2
+    #   #   3
+    #   #   1
+    #
+    # pkg:gem/tsort#lib/tsort.rb:226
+    def tsort_each(each_node, each_child); end
+  end
+end
+
+# pkg:gem/tsort#lib/tsort.rb:126
+TSort::VERSION = T.let(T.unsafe(nil), String)