OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	02/10/2020 11:55:58 AM	rwxr-xr-x
📄 English.rb	6.31 KB	08/25/2017 03:47:04 PM	rw-r--r--
📄 abbrev.rb	3.49 KB	02/09/2017 04:12:00 PM	rw-r--r--
📄 base64.rb	3.3 KB	02/10/2017 12:58:47 AM	rw-r--r--
📄 benchmark.rb	17.89 KB	01/03/2017 02:00:01 AM	rw-r--r--
📁 bigdecimal	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📁 cgi	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 cgi.rb	9.8 KB	02/18/2017 05:52:16 AM	rw-r--r--
📄 cmath.rb	9.49 KB	12/12/2017 11:56:25 AM	rw-r--r--
📄 csv.rb	82.88 KB	09/12/2017 08:38:06 AM	rw-r--r--
📄 date.rb	1003 bytes	05/15/2023 11:41:43 AM	rw-r--r--
📄 debug.rb	29.97 KB	01/05/2017 01:00:01 AM	rw-r--r--
📄 delegate.rb	10.44 KB	12/12/2017 11:56:25 AM	rw-r--r--
📁 digest	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 digest.rb	2.83 KB	05/15/2023 11:41:43 AM	rw-r--r--
📁 drb	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 drb.rb	50 bytes	12/16/2015 05:07:31 AM	rw-r--r--
📄 e2mmap.rb	3.94 KB	03/01/2017 11:37:30 AM	rw-r--r--
📄 erb.rb	27.46 KB	01/03/2018 06:11:47 PM	rw-r--r--
📄 expect.rb	2.17 KB	05/15/2023 11:41:43 AM	rw-r--r--
📁 fiddle	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 fiddle.rb	1.68 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 fileutils.rb	44.15 KB	12/22/2017 08:00:10 AM	rw-r--r--
📄 find.rb	2.47 KB	09/15/2017 05:00:49 PM	rw-r--r--
📁 forwardable	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 forwardable.rb	8.49 KB	12/12/2017 11:56:25 AM	rw-r--r--
📄 getoptlong.rb	15.42 KB	09/02/2017 02:05:34 AM	rw-r--r--
📁 io	-	02/10/2020 11:55:58 AM	rwxr-xr-x
📄 ipaddr.rb	19.51 KB	12/12/2017 11:56:25 AM	rw-r--r--
📁 irb	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 irb.rb	20.48 KB	02/21/2018 06:00:51 AM	rw-r--r--
📁 json	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 json.rb	1.77 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 kconv.rb	5.77 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 logger.rb	23.54 KB	12/21/2017 05:07:43 AM	rw-r--r--
📁 matrix	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 matrix.rb	53.2 KB	12/12/2017 11:56:25 AM	rw-r--r--
📄 mkmf.rb	84.38 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 monitor.rb	7.26 KB	10/08/2017 07:00:01 AM	rw-r--r--
📄 mutex_m.rb	2.02 KB	10/08/2017 07:00:01 AM	rw-r--r--
📁 net	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 observer.rb	5.83 KB	01/13/2017 12:08:29 PM	rw-r--r--
📄 open-uri.rb	25.11 KB	12/21/2017 02:15:04 PM	rw-r--r--
📄 open3.rb	20.94 KB	10/21/2017 07:00:58 AM	rw-r--r--
📁 openssl	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 openssl.rb	469 bytes	05/15/2023 11:41:43 AM	rw-r--r--
📄 optionparser.rb	59 bytes	12/16/2015 05:07:31 AM	rw-r--r--
📁 optparse	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 optparse.rb	57.25 KB	07/24/2017 01:56:04 AM	rw-r--r--
📄 ostruct.rb	10.16 KB	12/12/2017 11:56:25 AM	rw-r--r--
📄 pathname.rb	16.09 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 pp.rb	14.36 KB	12/18/2017 01:51:53 AM	rw-r--r--
📄 prettyprint.rb	15.89 KB	11/10/2015 11:48:14 AM	rw-r--r--
📄 prime.rb	12.48 KB	05/20/2017 10:21:44 AM	rw-r--r--
📄 profile.rb	235 bytes	01/15/2017 02:56:04 AM	rw-r--r--
📄 profiler.rb	4.54 KB	01/18/2017 12:35:10 PM	rw-r--r--
📄 pstore.rb	14.7 KB	01/17/2017 12:47:38 PM	rw-r--r--
📁 psych	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 psych.rb	16.54 KB	05/15/2023 11:41:43 AM	rw-r--r--
📁 racc	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📁 rdoc	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 rdoc.rb	5.03 KB	12/23/2017 11:33:09 PM	rw-r--r--
📄 resolv-replace.rb	1.76 KB	11/14/2015 08:25:30 AM	rw-r--r--
📄 resolv.rb	72.73 KB	12/20/2017 04:25:01 AM	rw-r--r--
📁 rexml	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📁 rinda	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📁 ripper	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 ripper.rb	2.44 KB	05/15/2023 11:41:43 AM	rw-r--r--
📁 rss	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 rss.rb	2.87 KB	12/16/2015 05:07:31 AM	rw-r--r--
📁 rubygems	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 rubygems.rb	36.57 KB	03/19/2018 08:27:04 AM	rw-r--r--
📄 scanf.rb	23.56 KB	10/21/2017 12:34:13 PM	rw-r--r--
📄 securerandom.rb	8.61 KB	10/25/2017 07:28:22 AM	rw-r--r--
📄 set.rb	24.01 KB	11/22/2017 09:13:51 PM	rw-r--r--
📁 shell	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 shell.rb	11.37 KB	11/05/2016 11:58:02 PM	rw-r--r--
📄 shellwords.rb	6.66 KB	11/05/2016 04:58:48 AM	rw-r--r--
📄 singleton.rb	4.04 KB	10/08/2017 07:00:01 AM	rw-r--r--
📄 socket.rb	43.51 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 sync.rb	7.29 KB	09/18/2016 10:24:48 AM	rw-r--r--
📁 syslog	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 tempfile.rb	11.14 KB	12/12/2017 11:56:25 AM	rw-r--r--
📄 thwait.rb	3.33 KB	10/08/2017 07:00:01 AM	rw-r--r--
📄 time.rb	22.38 KB	05/15/2023 11:41:43 AM	rw-r--r--
📄 timeout.rb	3.81 KB	12/12/2017 11:56:25 AM	rw-r--r--
📄 tmpdir.rb	4.12 KB	03/28/2018 12:54:26 PM	rw-r--r--
📄 tracer.rb	6.42 KB	10/08/2017 07:00:01 AM	rw-r--r--
📄 tsort.rb	14.3 KB	11/14/2015 08:46:11 AM	rw-r--r--
📄 un.rb	9.78 KB	07/05/2017 09:05:53 AM	rw-r--r--
📁 unicode_normalize	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📁 uri	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 uri.rb	3.1 KB	12/16/2015 05:07:31 AM	rw-r--r--
📄 weakref.rb	1.44 KB	10/24/2017 06:08:00 PM	rw-r--r--
📁 webrick	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 webrick.rb	6.72 KB	12/23/2015 03:43:23 AM	rw-r--r--
📁 yaml	-	05/09/2024 07:14:11 AM	rwxr-xr-x
📄 yaml.rb	1.73 KB	12/12/2017 11:56:25 AM	rw-r--r--

Editing: tsort.rb

# frozen_string_literal: true

#--
# tsort.rb - provides a module for topological sorting and strongly connected components.
#++
#

#
# 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",
# SIAM Journal on Computing, Vol. 1, No. 2, pp. 146-160, June 1972.
#

module TSort
 class Cyclic < StandardError
 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
  #
  def tsort
    each_node = method(:tsort_each_node)
    each_child = method(:tsort_each_child)
    TSort.tsort(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
  #
  def TSort.tsort(each_node, each_child)
    TSort.tsort_each(each_node, each_child).to_a
  end

# The iterator version of the #tsort method.
 # <tt>obj.tsort_each</tt> is similar to <tt>obj.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
 #
 def tsort_each(&block) # :yields: node
 each_node = method(:tsort_each_node)
 each_child = method(:tsort_each_child)
 TSort.tsort_each(each_node, each_child, &block)
 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
  #
  def TSort.tsort_each(each_node, each_child) # :yields: node
    return to_enum(__method__, each_node, each_child) unless block_given?

TSort.each_strongly_connected_component(each_node, each_child) {|component|
      if component.size == 1
        yield component.first
      else
        raise Cyclic.new("topological sort failed: #{component.inspect}")
      end
    }
  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]]
  #
  def strongly_connected_components
    each_node = method(:tsort_each_node)
    each_child = method(:tsort_each_child)
    TSort.strongly_connected_components(each_node, each_child)
  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]]
  #
  def TSort.strongly_connected_components(each_node, each_child)
    TSort.each_strongly_connected_component(each_node, each_child).to_a
  end

# The iterator version of the #strongly_connected_components method.
 # <tt>obj.each_strongly_connected_component</tt> is similar to
 # <tt>obj.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]
 #
 def each_strongly_connected_component(&block) # :yields: nodes
 each_node = method(:tsort_each_node)
 each_child = method(:tsort_each_child)
 TSort.each_strongly_connected_component(each_node, each_child, &block)
 end

# 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 TSort.each_strongly_connected_component(each_node, each_child) # :yields: nodes
    return to_enum(__method__, each_node, each_child) unless block_given?

id_map = {}
    stack = []
    each_node.call {|node|
      unless id_map.include? node
        TSort.each_strongly_connected_component_from(node, each_child, id_map, stack) {|c|
          yield c
        }
      end
    }
    nil
  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]
  #
  def each_strongly_connected_component_from(node, id_map={}, stack=[], &block) # :yields: nodes
    TSort.each_strongly_connected_component_from(node, method(:tsort_each_child), id_map, stack, &block)
  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]
  #
  def TSort.each_strongly_connected_component_from(node, each_child, id_map={}, stack=[]) # :yields: nodes
    return to_enum(__method__, node, each_child, id_map, stack) unless block_given?

minimum_id = node_id = id_map[node] = id_map.size
 stack_length = stack.length
 stack << node

each_child.call(node) {|child|
 if id_map.include? child
 child_id = id_map[child]
 minimum_id = child_id if child_id && child_id < minimum_id
 else
 sub_minimum_id =
 TSort.each_strongly_connected_component_from(child, each_child, id_map, stack) {|c|
 yield c
 }
 minimum_id = sub_minimum_id if sub_minimum_id < minimum_id
 end
 }

if node_id == minimum_id
      component = stack.slice!(stack_length .. -1)
      component.each {|n| id_map[n] = nil}
      yield component
    end

minimum_id
  end

# Should be implemented by a extended class.
  #
  # #tsort_each_node is used to iterate for all nodes over a graph.
  #
  def tsort_each_node # :yields: node
    raise NotImplementedError.new
  end

# Should be implemented by a extended class.
  #
  # #tsort_each_child is used to iterate for child nodes of _node_.
  #
  def tsort_each_child(node) # :yields: child
    raise NotImplementedError.new
  end
end