File Manager

X7ROOT File Manager

Current Path: /opt/alt/ruby19/lib64/ruby/1.9.1

opt / alt / ruby19 / lib64 / ruby / 1.9.1 /

ðŸ“ ..
ðŸ“„ English.rb(5.59 KB)
ðŸ“„ abbrev.rb(2.57 KB)
ðŸ“„ base64.rb(2.63 KB)
ðŸ“„ benchmark.rb(18 KB)
ðŸ“ cgi
ðŸ“„ cgi.rb(9.3 KB)
ðŸ“„ cmath.rb(7.22 KB)
ðŸ“„ complex.rb(380 B)
ðŸ“„ csv.rb(82.66 KB)
ðŸ“ date
ðŸ“„ date.rb(946 B)
ðŸ“„ debug.rb(23.23 KB)
ðŸ“„ delegate.rb(9.74 KB)
ðŸ“ digest
ðŸ“„ digest.rb(2.24 KB)
ðŸ“ dl
ðŸ“„ dl.rb(176 B)
ðŸ“ drb
ðŸ“„ drb.rb(19 B)
ðŸ“„ e2mmap.rb(3.8 KB)
ðŸ“„ erb.rb(25.72 KB)
ðŸ“„ expect.rb(1.33 KB)
ðŸ“ fiddle
ðŸ“„ fiddle.rb(928 B)
ðŸ“„ fileutils.rb(45.32 KB)
ðŸ“„ find.rb(2.03 KB)
ðŸ“„ forwardable.rb(7.64 KB)
ðŸ“„ getoptlong.rb(15.38 KB)
ðŸ“„ gserver.rb(8.83 KB)
ðŸ“„ ipaddr.rb(24.92 KB)
ðŸ“ irb
ðŸ“„ irb.rb(8.34 KB)
ðŸ“ json
ðŸ“„ json.rb(1.74 KB)
ðŸ“„ kconv.rb(5.74 KB)
ðŸ“„ logger.rb(20.85 KB)
ðŸ“„ mathn.rb(6.52 KB)
ðŸ“ matrix
ðŸ“„ matrix.rb(47.65 KB)
ðŸ“„ mkmf.rb(68.9 KB)
ðŸ“„ monitor.rb(6.94 KB)
ðŸ“„ mutex_m.rb(1.61 KB)
ðŸ“ net
ðŸ“„ observer.rb(5.69 KB)
ðŸ“„ open-uri.rb(25.84 KB)
ðŸ“„ open3.rb(20.64 KB)
ðŸ“ openssl
ðŸ“„ openssl.rb(547 B)
ðŸ“ optparse
ðŸ“„ optparse.rb(51.13 KB)
ðŸ“„ ostruct.rb(6.49 KB)
ðŸ“„ pathname.rb(14.21 KB)
ðŸ“„ pp.rb(13.31 KB)
ðŸ“„ prettyprint.rb(9.63 KB)
ðŸ“„ prime.rb(13.98 KB)
ðŸ“„ profile.rb(205 B)
ðŸ“„ profiler.rb(1.59 KB)
ðŸ“„ pstore.rb(15.81 KB)
ðŸ“ psych
ðŸ“„ psych.rb(9.82 KB)
ðŸ“ racc
ðŸ“ rake
ðŸ“„ rake.rb(2.02 KB)
ðŸ“„ rational.rb(308 B)
ðŸ“ rbconfig
ðŸ“ rdoc
ðŸ“„ rdoc.rb(4.29 KB)
ðŸ“„ resolv-replace.rb(1.74 KB)
ðŸ“„ resolv.rb(59.91 KB)
ðŸ“ rexml
ðŸ“ rinda
ðŸ“ ripper
ðŸ“„ ripper.rb(91 B)
ðŸ“ rss
ðŸ“„ rss.rb(2.84 KB)
ðŸ“ rubygems
ðŸ“„ rubygems.rb(34.13 KB)
ðŸ“„ scanf.rb(23.53 KB)
ðŸ“„ securerandom.rb(8.46 KB)
ðŸ“„ set.rb(29.91 KB)
ðŸ“ shell
ðŸ“„ shell.rb(5.9 KB)
ðŸ“„ shellwords.rb(3.88 KB)
ðŸ“„ singleton.rb(4.02 KB)
ðŸ“„ socket.rb(23.22 KB)
ðŸ“ syck
ðŸ“„ syck.rb(13.91 KB)
ðŸ“„ sync.rb(6.87 KB)
ðŸ“„ tempfile.rb(10.42 KB)
ðŸ“ test
ðŸ“„ thread.rb(6.59 KB)
ðŸ“„ thwait.rb(3.38 KB)
ðŸ“„ time.rb(17.03 KB)
ðŸ“„ timeout.rb(3.26 KB)
ðŸ“„ tmpdir.rb(3.72 KB)
ðŸ“„ tracer.rb(6.63 KB)
ðŸ“„ tsort.rb(6.79 KB)
ðŸ“„ ubygems.rb(268 B)
ðŸ“„ un.rb(8.32 KB)
ðŸ“ uri
ðŸ“„ uri.rb(3.07 KB)
ðŸ“„ weakref.rb(2.29 KB)
ðŸ“ webrick
ðŸ“„ webrick.rb(6.8 KB)
ðŸ“ x86_64-linux
ðŸ“ xmlrpc
ðŸ“ yaml
ðŸ“„ yaml.rb(2.58 KB)

Editing: tsort.rb

#--
# 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.
 #
 def tsort
 result = []
 tsort_each {|element| result << element}
 result
 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.
 #
 def tsort_each # :yields: node
 each_strongly_connected_component {|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.
 #
 def strongly_connected_components
 result = []
 each_strongly_connected_component {|component| result << component}
 result
 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+.
 #
 def each_strongly_connected_component # :yields: nodes
 id_map = {}
 stack = []
 tsort_each_node {|node|
 unless id_map.include? node
 each_strongly_connected_component_from(node, 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.
 #
 def each_strongly_connected_component_from(node, id_map={}, stack=[]) # :yields: nodes
 minimum_id = node_id = id_map[node] = id_map.size
 stack_length = stack.length
 stack << node

tsort_each_child(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 =
 each_strongly_connected_component_from(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

X7ROOT File Manager

Editing: tsort.rb

Upload File

Create Folder