SkullCyberArmy Bypass Shell - roomellotravel.com

Uname : Linux premium36.web-hosting.com 4.18.0-513.24.1.lve.1.el8.x86_64 #1 SMP Thu May 9 15:10:09 UTC 2024 x86_64
Soft : LiteSpeed
Ip : 198.54.115.237
Port : 443

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

Name	Type	Size	Permission	Last Modified	Actions
.	dir	-	0755	2024-03-03 10:53:08
..	dir	-	0755	2024-03-03 10:43:32
cgi	dir	-	0755	2024-03-03 10:43:33
date	dir	-	0755	2024-03-03 10:43:33
digest	dir	-	0755	2024-03-03 10:43:33
dl	dir	-	0755	2024-03-03 10:43:33
drb	dir	-	0755	2024-03-03 10:43:33
fiddle	dir	-	0755	2024-03-03 10:43:33
irb	dir	-	0755	2024-03-03 10:43:33
json	dir	-	0755	2024-03-03 10:43:37
matrix	dir	-	0755	2024-03-03 10:43:33
net	dir	-	0755	2024-03-03 10:43:33
openssl	dir	-	0755	2024-03-03 10:43:33
optparse	dir	-	0755	2024-03-03 10:43:33
psych	dir	-	0755	2024-03-03 10:43:38
racc	dir	-	0755	2024-03-03 10:43:33
rake	dir	-	0755	2024-03-03 10:53:08
rbconfig	dir	-	0755	2024-03-03 10:43:42
rdoc	dir	-	0755	2024-03-03 10:43:41
rexml	dir	-	0755	2024-03-03 10:43:33
rinda	dir	-	0755	2024-03-03 10:43:33
ripper	dir	-	0755	2024-03-03 10:43:33
rss	dir	-	0755	2024-03-03 10:43:33
rubygems	dir	-	0755	2024-03-03 10:43:42
shell	dir	-	0755	2024-03-03 10:43:33
syslog	dir	-	0755	2024-03-03 10:43:33
test	dir	-	0755	2024-03-03 10:43:33
uri	dir	-	0755	2024-03-03 10:43:33
webrick	dir	-	0755	2024-03-03 10:43:33
x86_64-linux	dir	-	0755	2024-03-03 10:43:38
xmlrpc	dir	-	0755	2024-03-03 10:43:33
yaml	dir	-	0755	2024-03-03 10:43:33
English.rb	text/plain	6.44 KB	0644	2013-02-04 02:50:20
abbrev.rb	text/x-ruby	3.31 KB	0644	2013-02-24 05:06:42
base64.rb	text/x-ruby	2.63 KB	0644	2009-10-02 10:45:39
benchmark.rb	text/x-ruby	17.94 KB	0644	2012-07-18 03:56:58
cgi.rb	text/plain	9.39 KB	0644	2012-11-30 05:06:45
cmath.rb	text/x-ruby	7.22 KB	0644	2011-07-23 12:14:43
complex.rb	text/x-ruby	380 B	0644	2009-08-16 03:34:35
csv.rb	text/x-ruby	81.32 KB	0644	2014-09-17 05:56:35
date.rb	text/x-ruby	946 B	0644	2023-07-26 02:09:00
debug.rb	text/x-ruby	28.9 KB	0644	2013-02-02 05:04:54
delegate.rb	text/x-ruby	9.78 KB	0644	2014-04-30 07:45:49
digest.rb	text/x-ruby	2.24 KB	0644	2023-07-26 02:09:00
dl.rb	text/x-ruby	280 B	0644	2023-07-26 02:09:00
drb.rb	text/x-ruby	19 B	0644	2009-10-02 10:45:39
e2mmap.rb	text/x-ruby	3.8 KB	0644	2011-05-19 12:07:25
erb.rb	text/x-ruby	26.08 KB	0644	2014-09-03 04:42:39
expect.rb	text/x-ruby	2.14 KB	0644	2023-07-26 02:09:00
fiddle.rb	text/x-ruby	1.25 KB	0644	2023-07-26 02:09:00
fileutils.rb	text/x-ruby	46.35 KB	0644	2014-10-16 07:23:46
find.rb	text/x-ruby	2.08 KB	0644	2012-09-20 07:14:54
forwardable.rb	text/x-ruby	7.56 KB	0644	2013-01-04 02:52:54
getoptlong.rb	text/x-ruby	15.38 KB	0644	2013-12-24 03:46:01
gserver.rb	text/x-ruby	8.86 KB	0644	2014-07-07 03:55:25
ipaddr.rb	text/x-ruby	26.17 KB	0644	2013-02-23 04:03:59
irb.rb	text/plain	20.03 KB	0644	2013-02-05 03:57:19
json.rb	text/x-ruby	1.74 KB	0644	2023-07-26 02:09:00
kconv.rb	text/x-ruby	5.74 KB	0644	2023-07-26 02:09:00
logger.rb	text/x-ruby	20.96 KB	0644	2013-07-13 03:16:09
mathn.rb	text/x-ruby	6.52 KB	0644	2011-08-26 10:22:37
matrix.rb	text/x-ruby	45.02 KB	0644	2013-02-05 05:43:36
mkmf.rb	text/x-ruby	78.19 KB	0644	2023-07-26 02:06:15
monitor.rb	text/x-ruby	6.93 KB	0644	2012-11-16 04:55:29
mutex_m.rb	text/x-ruby	2 KB	0644	2013-02-24 04:49:04
observer.rb	text/x-ruby	5.71 KB	0644	2012-08-21 01:03:30
open-uri.rb	text/x-ruby	23.66 KB	0644	2014-02-16 05:02:51
open3.rb	text/x-ruby	21.17 KB	0644	2013-01-13 04:40:15
openssl.rb	text/x-ruby	528 B	0644	2023-07-26 02:09:00
optparse.rb	text/x-ruby	51.27 KB	0644	2014-02-19 04:38:03
ostruct.rb	text/x-ruby	7.64 KB	0644	2012-10-28 09:20:10
pathname.rb	text/x-ruby	15.3 KB	0644	2023-07-26 02:09:00
pp.rb	text/x-ruby	13.14 KB	0644	2012-08-15 11:50:01
prettyprint.rb	text/x-ruby	9.63 KB	0644	2011-08-02 03:25:59
prime.rb	text/x-ruby	13.98 KB	0644	2013-01-13 05:07:08
profile.rb	text/x-ruby	205 B	0644	2009-10-02 10:45:39
profiler.rb	text/x-ruby	4.29 KB	0644	2013-02-03 12:38:46
pstore.rb	text/x-ruby	14.85 KB	0644	2012-11-11 04:23:04
psych.rb	text/x-ruby	9.9 KB	0644	2023-07-26 02:09:00
rake.rb	text/x-ruby	2.07 KB	0644	2012-11-29 07:16:46
rational.rb	text/x-ruby	308 B	0644	2009-09-24 12:42:23
rdoc.rb	text/x-ruby	4.88 KB	0644	2013-02-19 05:06:36
resolv-replace.rb	text/x-ruby	1.73 KB	0644	2013-04-03 05:27:19
resolv.rb	text/x-ruby	61.45 KB	0644	2015-06-01 03:13:01
ripper.rb	text/x-ruby	2.53 KB	0644	2023-07-26 02:09:00
rss.rb	text/x-ruby	2.84 KB	0644	2011-05-11 10:22:16
rubygems.rb	text/x-ruby	27.53 KB	0644	2023-07-26 02:06:15
scanf.rb	text/plain	23.52 KB	0644	2011-11-05 07:37:47
securerandom.rb	text/x-ruby	8.56 KB	0644	2012-09-13 01:01:23
set.rb	text/x-ruby	17.32 KB	0644	2012-11-24 06:51:45
shell.rb	text/x-ruby	10.3 KB	0644	2012-12-05 02:55:07
shellwords.rb	text/x-ruby	5.94 KB	0644	2012-11-09 06:28:00
singleton.rb	text/x-ruby	4.02 KB	0644	2011-05-18 02:09:38
socket.rb	text/x-ruby	25.76 KB	0644	2023-07-26 02:09:00
sync.rb	text/x-ruby	7.26 KB	0644	2012-12-23 10:18:58
tempfile.rb	text/x-ruby	10.15 KB	0644	2013-10-09 04:11:16
thread.rb	text/x-ruby	6.94 KB	0644	2014-02-09 04:07:41
thwait.rb	text/x-ruby	3.38 KB	0644	2011-06-29 03:09:34
time.rb	text/x-ruby	21.09 KB	0644	2013-10-09 03:07:45
timeout.rb	text/x-ruby	3.16 KB	0644	2013-04-14 03:20:33
tmpdir.rb	text/x-ruby	4.15 KB	0644	2012-12-12 12:40:51
tracer.rb	text/x-ruby	6.54 KB	0644	2013-02-04 05:59:52
tsort.rb	text/x-ruby	6.79 KB	0644	2009-03-06 04:23:05
ubygems.rb	text/x-ruby	268 B	0644	2009-10-02 10:45:39
un.rb	text/x-ruby	8.34 KB	0644	2012-08-03 08:23:18
uri.rb	text/x-ruby	3.07 KB	0644	2011-05-13 08:03:21
weakref.rb	text/x-ruby	3.23 KB	0644	2012-12-02 07:57:45
webrick.rb	text/x-ruby	6.7 KB	0644	2012-11-07 06:49:57
xmlrpc.rb	text/plain	8.49 KB	0644	2012-09-13 02:24:08
yaml.rb	text/x-ruby	2.3 KB	0644	2013-05-19 07:01:43