Gecko [ beriskala.com ]

Linux server1.dn-server.com 4.18.0-553.89.1.lve.el8.x86_64 #1 SMP Wed Dec 10 13:58:50 UTC 2025 x86_64
LiteSpeed
Server IP : 195.201.204.189 & Your IP : 216.73.216.37
Domains : Cant Read [ /etc/named.conf ]
User : beriska1

Name	Size	Permission	Date
all%3f-i.ri	1.86 KB	-rw-r--r--	2025-04-28 21:06
any%3f-i.ri	1.81 KB	-rw-r--r--	2025-04-28 21:06
cdesc-Enumerable.ri	10.31 KB	-rw-r--r--	2025-04-28 21:06
chain-i.ri	533 B	-rw-r--r--	2025-04-28 21:06
chunk-i.ri	3.92 KB	-rw-r--r--	2025-04-28 21:06
chunk_while-i.ri	2.26 KB	-rw-r--r--	2025-04-28 21:06
collect-i.ri	808 B	-rw-r--r--	2025-04-28 21:06
collect_concat-i.ri	1.04 KB	-rw-r--r--	2025-04-28 21:06
compact-i.ri	526 B	-rw-r--r--	2025-04-28 21:06
count-i.ri	1.13 KB	-rw-r--r--	2025-04-28 21:06
cycle-i.ri	1.2 KB	-rw-r--r--	2025-04-28 21:06
detect-i.ri	1.06 KB	-rw-r--r--	2025-04-28 21:06
drop-i.ri	713 B	-rw-r--r--	2025-04-28 21:06
drop_while-i.ri	815 B	-rw-r--r--	2025-04-28 21:06
each_cons-i.ri	888 B	-rw-r--r--	2025-04-28 21:06
each_entry-i.ri	1.16 KB	-rw-r--r--	2025-04-28 21:06
each_slice-i.ri	889 B	-rw-r--r--	2025-04-28 21:06
each_with_index-i.ri	1.11 KB	-rw-r--r--	2025-04-28 21:06
each_with_object-i.ri	842 B	-rw-r--r--	2025-04-28 21:06
entries-i.ri	510 B	-rw-r--r--	2025-04-28 21:06
filter-i.ri	851 B	-rw-r--r--	2025-04-28 21:06
filter_map-i.ri	886 B	-rw-r--r--	2025-04-28 21:06
find-i.ri	1.16 KB	-rw-r--r--	2025-04-28 21:06
find_all-i.ri	930 B	-rw-r--r--	2025-04-28 21:06
find_index-i.ri	1.13 KB	-rw-r--r--	2025-04-28 21:06
first-i.ri	1.1 KB	-rw-r--r--	2025-04-28 21:06
flat_map-i.ri	1.1 KB	-rw-r--r--	2025-04-28 21:06
grep-i.ri	1.11 KB	-rw-r--r--	2025-04-28 21:06
grep_v-i.ri	1.15 KB	-rw-r--r--	2025-04-28 21:06
group_by-i.ri	1 KB	-rw-r--r--	2025-04-28 21:06
include%3f-i.ri	956 B	-rw-r--r--	2025-04-28 21:06
inject-i.ri	5.64 KB	-rw-r--r--	2025-04-28 21:06
lazy-i.ri	1.19 KB	-rw-r--r--	2025-04-28 21:06
map-i.ri	750 B	-rw-r--r--	2025-04-28 21:06
max-i.ri	2.66 KB	-rw-r--r--	2025-04-28 21:06
max_by-i.ri	1.54 KB	-rw-r--r--	2025-04-28 21:06
member%3f-i.ri	995 B	-rw-r--r--	2025-04-28 21:06
min-i.ri	2.65 KB	-rw-r--r--	2025-04-28 21:06
min_by-i.ri	1.54 KB	-rw-r--r--	2025-04-28 21:06
minmax-i.ri	1.46 KB	-rw-r--r--	2025-04-28 21:06
minmax_by-i.ri	966 B	-rw-r--r--	2025-04-28 21:06
none%3f-i.ri	1.77 KB	-rw-r--r--	2025-04-28 21:06
one%3f-i.ri	1.93 KB	-rw-r--r--	2025-04-28 21:06
partition-i.ri	1.26 KB	-rw-r--r--	2025-04-28 21:06
reduce-i.ri	5.47 KB	-rw-r--r--	2025-04-28 21:06
reject-i.ri	894 B	-rw-r--r--	2025-04-28 21:06
reverse_each-i.ri	1.01 KB	-rw-r--r--	2025-04-28 21:06
select-i.ri	851 B	-rw-r--r--	2025-04-28 21:06
slice_after-i.ri	1.62 KB	-rw-r--r--	2025-04-28 21:06
slice_before-i.ri	5.34 KB	-rw-r--r--	2025-04-28 21:06
slice_when-i.ri	2.85 KB	-rw-r--r--	2025-04-28 21:06
sort-i.ri	1.52 KB	-rw-r--r--	2025-04-28 21:06
sort_by-i.ri	3.39 KB	-rw-r--r--	2025-04-28 21:06
sum-i.ri	1.45 KB	-rw-r--r--	2025-04-28 21:06
take-i.ri	584 B	-rw-r--r--	2025-04-28 21:06
take_while-i.ri	820 B	-rw-r--r--	2025-04-28 21:06
tally-i.ri	1.23 KB	-rw-r--r--	2025-04-28 21:06
to_a-i.ri	527 B	-rw-r--r--	2025-04-28 21:06
to_h-i.ri	1004 B	-rw-r--r--	2025-04-28 21:06
to_set-i.ri	413 B	-rw-r--r--	2025-04-28 21:06
uniq-i.ri	986 B	-rw-r--r--	2025-04-28 21:06
zip-i.ri	2.5 KB	-rw-r--r--	2025-04-28 21:06

Rename

U:RDoc::AnyMethod[iI"	sort:ETI"Enumerable#sort;TF:privateo:RDoc::Markup::Document:@parts[o:RDoc::Markup::Paragraph;	[I"@Returns an array containing the sorted elements of +self+. ;TI"IThe ordering of equal elements is indeterminate and may be unstable.;To:RDoc::Markup::BlankLine�o;
;	[I",With no block given, the sort compares ;TI"1using the elements' own method <tt><=></tt>:;T@o:RDoc::Markup::Verbatim;	[I"=%w[b c a d].sort              # => ["a", "b", "c", "d"]
;TI"J{foo: 0, bar: 1, baz: 2}.sort # => [[:bar, 1], [:baz, 2], [:foo, 0]]
;T:@format0o;
;	[I"JWith a block given, comparisons in the block determine the ordering. ;TI"HThe block is called with two elements +a+ and +b+, and must return:;T@o:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"*A negative integer if <tt>a < b</tt>.;To;;0;	[o;
;	[I"Zero if <tt>a == b</tt>.;To;;0;	[o;
;	[I"*A positive integer if <tt>a > b</tt>.;T@o;
;	[I"Examples:;T@o;;	[	I"a = %w[b c a d]
;TI"8a.sort {|a, b| b <=> a } # => ["d", "c", "b", "a"]
;TI""h = {foo: 0, bar: 1, baz: 2}
;TI"Eh.sort {|a, b| b <=> a } # => [[:foo, 0], [:baz, 2], [:bar, 1]]
;T;
0o;
;	[I">See also #sort_by. It implements a Schwartzian transform ;TI"Ewhich is useful when key computation or comparison is expensive.;T:
@fileI"enum.c;T:0@omit_headings_from_table_of_contents_below0I"=sort               -> array
sort {|a, b| ... } -> array
;T0[�I"();T@:FI"Enumerable;TcRDoc::NormalModule00