Linux premium71.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
Server IP : 198.187.29.8 & Your IP : 13.59.203.127
Domains :
Cant Read [ /etc/named.conf ]
User : cleahvkv
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
ruby32 /
share /
ruby /
did_you_mean /
Delete
Unzip
Name
Size
Permission
Date
Action
core_ext
[ DIR ]
drwxr-xr-x
2025-01-09 11:36
formatters
[ DIR ]
drwxr-xr-x
2025-01-09 11:36
spell_checkers
[ DIR ]
drwxr-xr-x
2025-01-09 11:36
experimental.rb
139
B
-rw-r--r--
2024-12-04 14:11
formatter.rb
1.27
KB
-rw-r--r--
2024-12-04 14:11
jaro_winkler.rb
1.79
KB
-rw-r--r--
2024-12-04 14:11
levenshtein.rb
1.34
KB
-rw-r--r--
2024-12-04 14:11
spell_checker.rb
1.27
KB
-rw-r--r--
2024-12-04 14:11
tree_spell_checker.rb
2.81
KB
-rw-r--r--
2024-12-04 14:11
verbose.rb
137
B
-rw-r--r--
2024-12-04 14:11
version.rb
49
B
-rw-r--r--
2024-12-04 14:11
Save
Rename
module DidYouMean module Levenshtein # :nodoc: # This code is based directly on the Text gem implementation # Copyright (c) 2006-2013 Paul Battley, Michael Neumann, Tim Fletcher. # # Returns a value representing the "cost" of transforming str1 into str2 def distance(str1, str2) n = str1.length m = str2.length return m if n.zero? return n if m.zero? d = (0..m).to_a x = nil # to avoid duplicating an enumerable object, create it outside of the loop str2_codepoints = str2.codepoints str1.each_codepoint.with_index(1) do |char1, i| j = 0 while j < m cost = (char1 == str2_codepoints[j]) ? 0 : 1 x = min3( d[j+1] + 1, # insertion i + 1, # deletion d[j] + cost # substitution ) d[j] = i i = x j += 1 end d[m] = x end x end module_function :distance private # detects the minimum value out of three arguments. This method is # faster than `[a, b, c].min` and puts less GC pressure. # See https://github.com/ruby/did_you_mean/pull/1 for a performance # benchmark. def min3(a, b, c) if a < b && a < c a elsif b < c b else c end end module_function :min3 end end