rbs 0.16.0 → 0.17.0

data/lib/rbs/parser.y

@@ -1168,14 +1168,21 @@ end
 
 def new_token(type, value = input.matched)
   charpos = charpos(input)
-  start_index = charpos - input.matched.size
-  end_index = charpos
+  matched = input.matched
 
-  location = RBS::Location.new(buffer: buffer,
-                                           start_pos: start_index,
-                                           end_pos: end_index)
+  if matched
+    start_index = charpos - matched.size
+    end_index = charpos
 
-  [type, LocatedValue.new(location: location, value: value)]
+    location = RBS::Location.new(buffer: buffer,
+                                 start_pos: start_index,
+                                 end_pos: end_index)
+
+    [type, LocatedValue.new(location: location, value: value)]
+  else
+    # scanner hasn't matched yet
+    [false, nil]
+  end
 end
 
 def charpos(scanner)
@@ -1294,10 +1301,10 @@ def next_token
     return [:"type_#{type}", nil]
   end
 
-  return if @eof
+  return new_token(false, '') if @eof
 
   while true
-    return if input.eos?
+    return new_token(false, '') if input.eos?
 
     case
     when input.scan(/\s+/)

data/lib/rbs/prototype/rb.rb

@@ -411,7 +411,8 @@ module RBS
         when :HASH
           list = node.children[0]
           if list
-            children = list.children.compact
+            children = list.children
+            children.pop
           else
             children = []
           end
@@ -419,8 +420,13 @@ module RBS
           key_types = []
           value_types = []
           children.each_slice(2) do |k, v|
-            key_types << literal_to_type(k)
-            value_types << literal_to_type(v)
+            if k
+              key_types << literal_to_type(k)
+              value_types << literal_to_type(v)
+            else
+              key_types << untyped
+              value_types << untyped
+            end
           end
 
           if !key_types.empty? && key_types.all? { |t| t.is_a?(Types::Literal) }

data/lib/rbs/version.rb

@@ -1,3 +1,3 @@
 module RBS
-  VERSION = "0.16.0"
+  VERSION = "0.17.0"
 end

data/sig/definition.rbs

@@ -21,13 +21,13 @@ module RBS
         attr_reader defined_in: TypeName
         attr_reader implemented_in: TypeName?
 
-        def initialize: (type: MethodType, member: method_member, defined_in: TypeName?, implemented_in: TypeName?) -> void
+        def initialize: (type: MethodType, member: method_member, defined_in: TypeName, implemented_in: TypeName?) -> void
 
         def comment: () -> AST::Comment?
 
         def annotations: () -> Array[AST::Annotation]
 
-        def update: (?type: MethodType, ?member: method_member, ?defined_in: TypeName?, ?implemented_in: TypeName?) -> TypeDef
+        def update: (?type: MethodType, ?member: method_member, ?defined_in: TypeName, ?implemented_in: TypeName?) -> TypeDef
 
         def overload?: () -> bool
       end
@@ -42,8 +42,13 @@ module RBS
       attr_reader comments: Array[AST::Comment]
       attr_reader annotations: Array[AST::Annotation]
       attr_reader members: Array[method_member]
+      attr_reader alias_of: Method?
 
-      def initialize: (super_method: Method?, defs: Array[TypeDef], accessibility: accessibility, ?annotations: Array[AST::Annotation]) -> void
+      def initialize: (super_method: Method?,
+                       defs: Array[TypeDef],
+                       accessibility: accessibility,
+                       alias_of: Method?,
+                       ?annotations: Array[AST::Annotation]) -> void
 
       def public?: () -> bool
 

data/sig/definition_builder.rbs

@@ -62,7 +62,7 @@ module RBS
     def ensure_namespace!: (Namespace, location: Location?) -> void
 
     def build_singleton: (TypeName) -> Definition
-                       
+
     def build_instance: (TypeName) -> Definition
 
     def build_interface: (TypeName) -> Definition
@@ -71,11 +71,12 @@ module RBS
 
     def build_one_singleton: (TypeName) -> Definition
 
+    type ancestors = Definition::InstanceAncestors | Definition::SingletonAncestors | nil
     def merge_definitions: (TypeName,
                             Array[[Definition::Ancestor::t, Definition]],
                             entry: Environment::ModuleEntry | Environment::ClassEntry,
                             self_type: Definition::self_type,
-                            ancestors: Array[Definition::Ancestor::t]) -> Definition
+                            ancestors: ancestors) -> Definition
 
     type method_kind = :instance | :singleton
     def merge_method: (TypeName, Hash[Symbol, Definition::Method], Symbol, Definition::Method, Substitution, kind: method_kind) -> void

data/stdlib/csv/0/csv.rbs

@@ -159,7 +159,7 @@
 # with it.
 #
 class CSV < Object
-  include Enumerable[untyped, untyped]
+  include Enumerable[untyped]
 
   # This method is intended as the primary interface for reading CSV files. You
   # pass a `path` and any `options` you wish to set for the read. Each row of file
@@ -407,7 +407,7 @@ CSV::VERSION: String
 # processing is activated.
 #
 class CSV::Row < Object
-  include Enumerable[untyped, untyped]
+  include Enumerable[untyped]
 
   # If a two-element Array is provided, it is assumed to be a header and field and
   # the pair is appended. A Hash works the same way with the key being the header
@@ -578,7 +578,7 @@ end
 # processing is activated.
 #
 class CSV::Table[out Elem] < Object
-  include Enumerable[untyped, untyped]
+  include Enumerable[untyped]
 
   # Constructs a new CSV::Table from `array_of_rows`, which are expected to be
   # CSV::Row objects. All rows are assumed to have the same headers.

data/stdlib/dbm/0/dbm.rbs

@@ -61,7 +61,7 @@
 #     puts db['822']
 #
 class DBM
-  include Enumerable[untyped, untyped]
+  include Enumerable[untyped]
 
   # Open a dbm database and yields it if a block is given. See also `DBM.new`.
   #

data/stdlib/prime/0/prime.rbs

@@ -137,7 +137,7 @@ class Prime
   class PseudoPrimeGenerator
     def initialize: (?Integer?) -> void
 
-    include Enumerable[Integer, void]
+    include Enumerable[Integer]
 
     attr_accessor upper_bound (): Integer?
 

data/stdlib/set/0/set.rbs

@@ -51,8 +51,8 @@ class Set[A]
   #     Set.new(1..5)                         #=> #<Set: {1, 2, 3, 4, 5}>
   #     Set.new([1, 2, 3]) { |x| x * x }      #=> #<Set: {1, 4, 9}>
   #
-  def initialize: (_Each[A, untyped]) -> untyped
-                | [X] (_Each[X, untyped]) { (X) -> A } -> untyped
+  def initialize: (_Each[A]) -> untyped
+                | [X] (_Each[X]) { (X) -> A } -> untyped
                 | (?nil) -> untyped
 
   # Creates a new set containing the given objects.
@@ -69,7 +69,7 @@ class Set[A]
   #     Set[1, 3, 5] & Set[3, 2, 1]             #=> #<Set: {3, 1}>
   #     Set['a', 'b', 'z'] & ['a', 'b', 'c']    #=> #<Set: {"a", "b"}>
   #
-  def &: (_Each[A, untyped]) -> self
+  def &: (_Each[A]) -> self
 
   alias intersection &
 
@@ -79,7 +79,7 @@ class Set[A]
   #     Set[1, 2, 3] | Set[2, 4, 5]         #=> #<Set: {1, 2, 3, 4, 5}>
   #     Set[1, 5, 'z'] | (1..6)             #=> #<Set: {1, 5, "z", 2, 3, 4, 6}>
   #
-  def |: (_Each[A, untyped]) -> self
+  def |: (_Each[A]) -> self
 
   alias union |
 
@@ -91,7 +91,7 @@ class Set[A]
   #     Set[1, 3, 5] - Set[1, 5]                #=> #<Set: {3}>
   #     Set['a', 'b', 'z'] - ['a', 'c']         #=> #<Set: {"b", "z"}>
   #
-  def -: (_Each[A, untyped]) -> self
+  def -: (_Each[A]) -> self
 
   alias difference -
 
@@ -133,7 +133,7 @@ class Set[A]
   #     Set[1, 2] ^ Set[2, 3]                   #=> #<Set: {3, 1}>
   #     Set[1, 'b', 'c'] ^ ['b', 'd']           #=> #<Set: {"d", 1, "c"}>
   #
-  def ^: (_Each[A, untyped]) -> self
+  def ^: (_Each[A]) -> self
 
   # Classifies the set by the return value of the given block and returns a hash
   # of {value => set of elements} pairs.  The block is called once for each
@@ -248,7 +248,7 @@ class Set[A]
   # Merges the elements of the given enumerable object to the set and returns
   # self.
   #
-  def merge: (_Each[A, untyped]) -> self
+  def merge: (_Each[A]) -> self
 
   # Returns true if the set is a subset of the given set.
   #
@@ -271,7 +271,7 @@ class Set[A]
   #     set.replace([1, 2])               #=> #<Set: {1, 2}>
   #     set                               #=> #<Set: {1, 2}>
   #
-  def replace: (_Each[A, untyped]) -> self
+  def replace: (_Each[A]) -> self
 
   # Resets the internal state after modification to existing elements and returns
   # self.
@@ -288,7 +288,7 @@ class Set[A]
   # Deletes every element that appears in the given enumerable object and returns
   # self.
   #
-  def subtract: (_Each[A, untyped]) -> self
+  def subtract: (_Each[A]) -> self
 
   # Converts the set to an array.  The order of elements is uncertain.
   #
@@ -297,5 +297,5 @@ class Set[A]
   #
   def to_a: () -> Array[A]
 
-  include Enumerable[A, self]
+  include Enumerable[A]
 end

data/stdlib/tsort/0/cyclic.rbs

@@ -0,0 +1,4 @@
+module TSort[Node]
+  class Cyclic < StandardError
+  end
+end

data/stdlib/tsort/0/interfaces.rbs

@@ -0,0 +1,19 @@
+module TSort[Node]
+  interface _Sortable[Node]
+    # #tsort_each_node is used to iterate for all nodes over a graph.
+    #
+    def tsort_each_node: () { (Node) -> void } -> void
+
+    # #tsort_each_child is used to iterate for child nodes of node.
+    #
+    def tsort_each_child: (Node) { (Node) -> void } -> void
+  end
+
+  interface _EachNode[Node]
+    def call: () { (Node) -> void } -> void
+  end
+
+  interface _EachChild[Node]
+    def call: (Node) { (Node) -> void } -> void
+  end
+end

data/stdlib/tsort/0/tsort.rbs

@@ -0,0 +1,363 @@
+# 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
+#
+#     1.  Tarjan, "Depth First Search and Linear Graph Algorithms",
+#
+#
+# *SIAM Journal on Computing*, Vol. 1, No. 2, pp. 146-160, June 1972.
+module TSort[Node] : TSort::_Sortable[Node]
+  # 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]
+  #
+  def self.each_strongly_connected_component: [T] (_EachNode[T] each_node, _EachChild[T] each_child) { (Array[T]) -> void } -> void
+                                            | [T] (_EachNode[T] each_node, _EachChild[T] each_child) -> Enumerator[Array[T], void]
+
+  # 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]
+  #
+  def self.each_strongly_connected_component_from: [T] (T node, _EachChild[T] each_child, ?untyped id_map, ?untyped stack) { (Array[T]) -> void } -> void
+                                                 | [T] (T node, _EachChild[T] each_child, ?untyped id_map, ?untyped stack) -> Enumerator[Array[T], void]
+
+  # 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]]
+  #
+  def self.strongly_connected_components: [T] (_EachNode[T] each_node, _EachChild[T] each_child) -> Array[Array[T]]
+
+  # 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
+  #
+  def self.tsort: [T] (_EachNode[T] each_node, _EachChild[T] each_child) -> Array[T]
+
+  # 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
+  #
+  def self.tsort_each: [T] (_EachNode[T] each_node, _EachChild[T] each_child) { (T) -> void } -> void
+                     | [T] (_EachNode[T] each_node, _EachChild[T] each_child) -> Enumerator[T, void]
+
+  # The iterator version of the #strongly_connected_components method.
+  # *`obj*.each_strongly_connected_component` is similar to
+  # *`obj*.strongly_connected_components.each`, 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]
+  #
+  def each_strongly_connected_component: () { (Array[Node]) -> void } -> void
+                                       | () -> Enumerator[Array[Node], void]
+
+  # 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]
+  #
+  def each_strongly_connected_component_from: (Node, ?untyped id_map, ?untyped stack) { (Array[Node]) -> void } -> void
+                                            | (Node, ?untyped id_map, ?untyped stack) -> Enumerator[Array[Node], void]
+
+  # 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]]
+  #
+  def strongly_connected_components: () -> Array[Array[Node]]
+
+  # 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
+  #
+  def tsort: () -> Array[Node]
+
+  # The iterator version of the #tsort method. *`obj*.tsort_each` is similar to
+  # *`obj*.tsort.each`, 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
+  #
+  def tsort_each: () { (Node) -> void } -> void
+                | () -> Enumerator[Node, void]
+end