X7ROOT File Manager
Current Path:
/opt/alt/ruby20/lib64/ruby/2.0.0
opt
/
alt
/
ruby20
/
lib64
/
ruby
/
2.0.0
/
ðŸ“
..
📄
English.rb
(6.44 KB)
📄
abbrev.rb
(3.31 KB)
📄
base64.rb
(2.63 KB)
📄
benchmark.rb
(17.94 KB)
ðŸ“
cgi
📄
cgi.rb
(9.39 KB)
📄
cmath.rb
(7.22 KB)
📄
complex.rb
(380 B)
📄
csv.rb
(81.32 KB)
ðŸ“
date
📄
date.rb
(946 B)
📄
debug.rb
(28.9 KB)
📄
delegate.rb
(9.78 KB)
ðŸ“
digest
📄
digest.rb
(2.24 KB)
ðŸ“
dl
📄
dl.rb
(280 B)
ðŸ“
drb
📄
drb.rb
(19 B)
📄
e2mmap.rb
(3.8 KB)
📄
erb.rb
(26.08 KB)
📄
expect.rb
(2.14 KB)
ðŸ“
fiddle
📄
fiddle.rb
(1.25 KB)
📄
fileutils.rb
(46.35 KB)
📄
find.rb
(2.08 KB)
📄
forwardable.rb
(7.56 KB)
📄
getoptlong.rb
(15.38 KB)
📄
gserver.rb
(8.86 KB)
📄
ipaddr.rb
(26.17 KB)
ðŸ“
irb
📄
irb.rb
(20.03 KB)
ðŸ“
json
📄
json.rb
(1.74 KB)
📄
kconv.rb
(5.74 KB)
📄
logger.rb
(20.96 KB)
📄
mathn.rb
(6.52 KB)
ðŸ“
matrix
📄
matrix.rb
(45.02 KB)
📄
mkmf.rb
(78.19 KB)
📄
monitor.rb
(6.93 KB)
📄
mutex_m.rb
(2 KB)
ðŸ“
net
📄
observer.rb
(5.71 KB)
📄
open-uri.rb
(23.66 KB)
📄
open3.rb
(21.17 KB)
ðŸ“
openssl
📄
openssl.rb
(528 B)
ðŸ“
optparse
📄
optparse.rb
(51.27 KB)
📄
ostruct.rb
(7.64 KB)
📄
pathname.rb
(15.3 KB)
📄
pp.rb
(13.14 KB)
📄
prettyprint.rb
(9.63 KB)
📄
prime.rb
(13.98 KB)
📄
profile.rb
(205 B)
📄
profiler.rb
(4.29 KB)
📄
pstore.rb
(14.85 KB)
ðŸ“
psych
📄
psych.rb
(9.9 KB)
ðŸ“
racc
ðŸ“
rake
📄
rake.rb
(2.07 KB)
📄
rational.rb
(308 B)
ðŸ“
rbconfig
ðŸ“
rdoc
📄
rdoc.rb
(4.88 KB)
📄
resolv-replace.rb
(1.73 KB)
📄
resolv.rb
(61.45 KB)
ðŸ“
rexml
ðŸ“
rinda
ðŸ“
ripper
📄
ripper.rb
(2.53 KB)
ðŸ“
rss
📄
rss.rb
(2.84 KB)
ðŸ“
rubygems
📄
rubygems.rb
(27.53 KB)
📄
scanf.rb
(23.52 KB)
📄
securerandom.rb
(8.56 KB)
📄
set.rb
(17.32 KB)
ðŸ“
shell
📄
shell.rb
(10.3 KB)
📄
shellwords.rb
(5.94 KB)
📄
singleton.rb
(4.02 KB)
📄
socket.rb
(25.76 KB)
📄
sync.rb
(7.26 KB)
ðŸ“
syslog
📄
tempfile.rb
(10.15 KB)
ðŸ“
test
📄
thread.rb
(6.94 KB)
📄
thwait.rb
(3.38 KB)
📄
time.rb
(21.09 KB)
📄
timeout.rb
(3.16 KB)
📄
tmpdir.rb
(4.15 KB)
📄
tracer.rb
(6.54 KB)
📄
tsort.rb
(6.79 KB)
📄
ubygems.rb
(268 B)
📄
un.rb
(8.34 KB)
ðŸ“
uri
📄
uri.rb
(3.07 KB)
📄
weakref.rb
(3.23 KB)
ðŸ“
webrick
📄
webrick.rb
(6.7 KB)
ðŸ“
x86_64-linux
ðŸ“
xmlrpc
📄
xmlrpc.rb
(8.49 KB)
ðŸ“
yaml
📄
yaml.rb
(2.3 KB)
Editing: abbrev.rb
#!/usr/bin/env ruby #-- # Copyright (c) 2001,2003 Akinori MUSHA <knu@iDaemons.org> # # All rights reserved. You can redistribute and/or modify it under # the same terms as Ruby. # # $Idaemons: /home/cvs/rb/abbrev.rb,v 1.2 2001/05/30 09:37:45 knu Exp $ # $RoughId: abbrev.rb,v 1.4 2003/10/14 19:45:42 knu Exp $ # $Id: abbrev.rb 39458 2013-02-24 05:06:42Z zzak $ #++ ## # Calculates the set of unique abbreviations for a given set of strings. # # require 'abbrev' # require 'pp' # # pp Abbrev.abbrev(['ruby', 'rules']) # # Generates: # # { "rub" => "ruby", # "ruby" => "ruby", # "rul" => "rules", # "rule" => "rules", # "rules" => "rules" } # # It also provides an array core extension, Array#abbrev. # # pp %w{summer winter}.abbrev # #=> {"summe"=>"summer", # "summ"=>"summer", # "sum"=>"summer", # "su"=>"summer", # "s"=>"summer", # "winte"=>"winter", # "wint"=>"winter", # "win"=>"winter", # "wi"=>"winter", # "w"=>"winter", # "summer"=>"summer", # "winter"=>"winter"} module Abbrev # Given a set of strings, calculate the set of unambiguous # abbreviations for those strings, and return a hash where the keys # are all the possible abbreviations and the values are the full # strings. # # Thus, given +words+ is "car" and "cone", the keys pointing to "car" would # be "ca" and "car", while those pointing to "cone" would be "co", "con", and # "cone". # # require 'abbrev' # # Abbrev.abbrev(['car', 'cone']) # #=> {"ca"=>"car", "con"=>"cone", "co"=>"cone", "car"=>"car", "cone"=>"cone"} # # The optional +pattern+ parameter is a pattern or a string. Only # input strings that match the pattern or start with the string # are included in the output hash. # # Abbrev.abbrev(%w{car box cone}, /b/) # #=> {"bo"=>"box", "b"=>"box", "box"=>"box"} def abbrev(words, pattern = nil) table = {} seen = Hash.new(0) if pattern.is_a?(String) pattern = /\A#{Regexp.quote(pattern)}/ # regard as a prefix end words.each do |word| next if word.empty? word.size.downto(1) { |len| abbrev = word[0...len] next if pattern && pattern !~ abbrev case seen[abbrev] += 1 when 1 table[abbrev] = word when 2 table.delete(abbrev) else break end } end words.each do |word| next if pattern && pattern !~ word table[word] = word end table end module_function :abbrev end class Array # Calculates the set of unambiguous abbreviations for the strings in # +self+. # # require 'abbrev' # %w{ car cone }.abbrev # #=> {"ca" => "car", "con"=>"cone", "co" => "cone", # "car"=>"car", "cone" => "cone"} # # The optional +pattern+ parameter is a pattern or a string. Only # input strings that match the pattern or start with the string # are included in the output hash. # # %w{ fast boat day }.abbrev(/^.a/) # #=> {"fas"=>"fast", "fa"=>"fast", "da"=>"day", # "fast"=>"fast", "day"=>"day"} # # See also Abbrev.abbrev def abbrev(pattern = nil) Abbrev::abbrev(self, pattern) end end if $0 == __FILE__ while line = gets hash = line.split.abbrev hash.sort.each do |k, v| puts "#{k} => #{v}" end end end
Upload File
Create Folder