⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.93
Server IP:
65.108.141.171
Server:
Linux server.heloix.com 5.4.0-214-generic #234-Ubuntu SMP Fri Mar 14 23:50:27 UTC 2025 x86_64
Server Software:
Apache
PHP Version:
7.4.33
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
share
/
ri
/
2.7.0
/
system
/
Enumerable
/
View File Name :
sort-i.ri
U:RDoc::AnyMethod[iI" sort:ETI"Enumerable#sort;TF: publico:RDoc::Markup::Document: @parts[o: RDoc::Markup::Paragraph; [I"AReturns an array containing the items in <i>enum</i> sorted.;To: RDoc::Markup::BlankLine o; ; [I"@Comparisons for the sort will be done using the items' own ;TI"?<code><=></code> operator or using an optional code block.;T@o; ; [I"JThe block must implement a comparison between +a+ and +b+ and return ;TI"Gan integer less than 0 when +b+ follows +a+, +0+ when +a+ and +b+ ;TI"Gare equivalent, or an integer greater than 0 when +a+ follows +b+.;T@o; ; [I"LThe result is not guaranteed to be stable. When the comparison of two ;TI"Felements returns +0+, the order of the elements is unpredictable.;T@o:RDoc::Markup::Verbatim; [I"B%w(rhea kea flea).sort #=> ["flea", "kea", "rhea"] ;TI"J(1..10).sort { |a, b| b <=> a } #=> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1] ;T: @format0o; ; [I"HSee also Enumerable#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"Menum.sort -> array enum.sort { |a, b| block } -> array ;T0[ I"();T@$FI"Enumerable;TcRDoc::NormalModule00