X7ROOT File Manager
Current Path:
/opt/alt/ruby22/lib64/ruby/2.2.0
opt
/
alt
/
ruby22
/
lib64
/
ruby
/
2.2.0
/
ðŸ“
..
📄
English.rb
(6.42 KB)
📄
abbrev.rb
(3.46 KB)
📄
base64.rb
(2.63 KB)
📄
benchmark.rb
(17.73 KB)
ðŸ“
cgi
📄
cgi.rb
(9.77 KB)
📄
cmath.rb
(9.34 KB)
📄
csv.rb
(82.45 KB)
📄
date.rb
(980 B)
📄
debug.rb
(29.08 KB)
📄
delegate.rb
(10.71 KB)
ðŸ“
digest
📄
digest.rb
(2.79 KB)
ðŸ“
drb
📄
drb.rb
(19 B)
📄
e2mmap.rb
(3.77 KB)
📄
erb.rb
(26.35 KB)
📄
expect.rb
(2.14 KB)
ðŸ“
fiddle
📄
fiddle.rb
(1.65 KB)
📄
fileutils.rb
(47.46 KB)
📄
find.rb
(2.48 KB)
📄
forwardable.rb
(8.22 KB)
📄
getoptlong.rb
(15.38 KB)
ðŸ“
io
📄
ipaddr.rb
(17.06 KB)
ðŸ“
irb
📄
irb.rb
(20.03 KB)
ðŸ“
json
📄
json.rb
(1.74 KB)
📄
kconv.rb
(5.74 KB)
📄
logger.rb
(20.33 KB)
📄
mathn.rb
(3.84 KB)
ðŸ“
matrix
📄
matrix.rb
(53.14 KB)
📄
mkmf.rb
(82.59 KB)
📄
monitor.rb
(6.93 KB)
📄
mutex_m.rb
(2 KB)
ðŸ“
net
📄
observer.rb
(5.8 KB)
📄
open-uri.rb
(24.58 KB)
📄
open3.rb
(20.55 KB)
ðŸ“
openssl
📄
openssl.rb
(528 B)
📄
optionparser.rb
(28 B)
ðŸ“
optparse
📄
optparse.rb
(52.05 KB)
📄
ostruct.rb
(8.66 KB)
📄
pathname.rb
(15.58 KB)
📄
pp.rb
(14.16 KB)
📄
prettyprint.rb
(15.85 KB)
📄
prime.rb
(13.11 KB)
📄
profile.rb
(205 B)
📄
profiler.rb
(4.51 KB)
📄
pstore.rb
(14.55 KB)
ðŸ“
psych
📄
psych.rb
(14.88 KB)
ðŸ“
racc
ðŸ“
rake
📄
rake.rb
(2.23 KB)
ðŸ“
rbconfig
ðŸ“
rdoc
📄
rdoc.rb
(4.96 KB)
📄
resolv-replace.rb
(1.73 KB)
📄
resolv.rb
(72.06 KB)
ðŸ“
rexml
ðŸ“
rinda
ðŸ“
ripper
📄
ripper.rb
(2.53 KB)
ðŸ“
rss
📄
rss.rb
(2.84 KB)
ðŸ“
rubygems
📄
rubygems.rb
(31.85 KB)
📄
scanf.rb
(23.54 KB)
📄
securerandom.rb
(9.2 KB)
📄
set.rb
(19.15 KB)
ðŸ“
shell
📄
shell.rb
(11.3 KB)
📄
shellwords.rb
(5.96 KB)
📄
singleton.rb
(4.02 KB)
📄
socket.rb
(25.6 KB)
📄
sync.rb
(7.25 KB)
ðŸ“
syslog
📄
tempfile.rb
(11.11 KB)
📄
thwait.rb
(3.31 KB)
📄
time.rb
(22.25 KB)
📄
timeout.rb
(3.64 KB)
📄
tmpdir.rb
(4.13 KB)
📄
tracer.rb
(6.4 KB)
📄
tsort.rb
(14.27 KB)
📄
ubygems.rb
(268 B)
📄
un.rb
(8.87 KB)
ðŸ“
unicode_normalize
📄
unicode_normalize.rb
(3.16 KB)
ðŸ“
uri
📄
uri.rb
(3.07 KB)
📄
weakref.rb
(2.92 KB)
ðŸ“
webrick
📄
webrick.rb
(6.69 KB)
ðŸ“
x86_64-linux
ðŸ“
xmlrpc
📄
xmlrpc.rb
(8.49 KB)
ðŸ“
yaml
📄
yaml.rb
(1.7 KB)
Editing: abbrev.rb
#-- # 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 46784 2014-07-11 08:16:05Z hsbt $ #++ ## # Calculates the set of unambiguous abbreviations for a given set of strings. # # require 'abbrev' # require 'pp' # # pp Abbrev.abbrev(['ruby']) # #=> {"ruby"=>"ruby", "rub"=>"ruby", "ru"=>"ruby", "r"=>"ruby"} # # pp Abbrev.abbrev(%w{ ruby rules }) # # _Generates:_ # { "ruby" => "ruby", # "rub" => "ruby", # "rules" => "rules", # "rule" => "rules", # "rul" => "rules" } # # It also provides an array core extension, Array#abbrev. # # pp %w{ summer winter }.abbrev # # _Generates:_ # { "summer" => "summer", # "summe" => "summer", # "summ" => "summer", # "sum" => "summer", # "su" => "summer", # "s" => "summer", # "winter" => "winter", # "winte" => "winter", # "wint" => "winter", # "win" => "winter", # "wi" => "winter", # "w" => "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(%w{ 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 crab}, /b/) # #=> {"box"=>"box", "bo"=>"box", "b"=>"box", "crab" => "crab"} # # Abbrev.abbrev(%w{car box cone}, 'ca') # #=> {"car"=>"car", "ca"=>"car"} 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 # #=> {"car"=>"car", "ca"=>"car", "cone"=>"cone", "con"=>"cone", "co"=>"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/) # #=> {"fast"=>"fast", "fas"=>"fast", "fa"=>"fast", "day"=>"day", "da"=>"day"} # # Abbrev.abbrev(%w{car box cone}, "ca") # #=> {"car"=>"car", "ca"=>"car"} # # See also Abbrev.abbrev def abbrev(pattern = nil) Abbrev::abbrev(self, pattern) end end
Upload File
Create Folder