Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	718 B	-rw-r--r--	2024-06-26 17:25
%2a-i.ri	751 B	-rw-r--r--	2024-06-26 17:25
%2b-i.ri	519 B	-rw-r--r--	2024-06-26 17:25
%2d-i.ri	710 B	-rw-r--r--	2024-06-26 17:25
%3c%3c-i.ri	616 B	-rw-r--r--	2024-06-26 17:25
%3c%3d%3e-i.ri	1.19 KB	-rw-r--r--	2024-06-26 17:25
%3d%3d-i.ri	779 B	-rw-r--r--	2024-06-26 17:25
%5b%5d%3d-i.ri	4.09 KB	-rw-r--r--	2024-06-26 17:25
%5b%5d-c.ri	530 B	-rw-r--r--	2024-06-26 17:25
%5b%5d-i.ri	3.74 KB	-rw-r--r--	2024-06-26 17:25
%7c-i.ri	654 B	-rw-r--r--	2024-06-26 17:25
abbrev-i.ri	1008 B	-rw-r--r--	2024-06-26 17:25
all%3f-i.ri	1.37 KB	-rw-r--r--	2024-06-26 17:25
any%3f-i.ri	1.36 KB	-rw-r--r--	2024-06-26 17:25
append-i.ri	868 B	-rw-r--r--	2024-06-26 17:25
assoc-i.ri	639 B	-rw-r--r--	2024-06-26 17:25
at-i.ri	468 B	-rw-r--r--	2024-06-26 17:25
bsearch-i.ri	4.52 KB	-rw-r--r--	2024-06-26 17:25
bsearch_index-i.ri	501 B	-rw-r--r--	2024-06-26 17:25
cdesc-Array.ri	12.86 KB	-rw-r--r--	2024-06-26 17:25
clear-i.ri	404 B	-rw-r--r--	2024-06-26 17:25
collect%21-i.ri	869 B	-rw-r--r--	2024-06-26 17:25
collect-i.ri	859 B	-rw-r--r--	2024-06-26 17:25
combination-i.ri	1.69 KB	-rw-r--r--	2024-06-26 17:25
compact%21-i.ri	434 B	-rw-r--r--	2024-06-26 17:25
compact-i.ri	471 B	-rw-r--r--	2024-06-26 17:25
concat-i.ri	497 B	-rw-r--r--	2024-06-26 17:25
count-i.ri	1.13 KB	-rw-r--r--	2024-06-26 17:25
cycle-i.ri	1.43 KB	-rw-r--r--	2024-06-26 17:25
deconstruct-i.ri	229 B	-rw-r--r--	2024-06-26 17:25
delete-i.ri	1.37 KB	-rw-r--r--	2024-06-26 17:25
delete_at-i.ri	919 B	-rw-r--r--	2024-06-26 17:25
delete_if-i.ri	752 B	-rw-r--r--	2024-06-26 17:25
difference-i.ri	858 B	-rw-r--r--	2024-06-26 17:25
dig-i.ri	808 B	-rw-r--r--	2024-06-26 17:25
drop-i.ri	670 B	-rw-r--r--	2024-06-26 17:25
drop_while-i.ri	994 B	-rw-r--r--	2024-06-26 17:25
each-i.ri	1.29 KB	-rw-r--r--	2024-06-26 17:25
each_index-i.ri	1.24 KB	-rw-r--r--	2024-06-26 17:25
empty%3f-i.ri	378 B	-rw-r--r--	2024-06-26 17:25
eql%3f-i.ri	776 B	-rw-r--r--	2024-06-26 17:25
fetch-i.ri	1.42 KB	-rw-r--r--	2024-06-26 17:25
fill-i.ri	7.99 KB	-rw-r--r--	2024-06-26 17:25
filter%21-i.ri	949 B	-rw-r--r--	2024-06-26 17:25
filter-i.ri	889 B	-rw-r--r--	2024-06-26 17:25
find_index-i.ri	1.48 KB	-rw-r--r--	2024-06-26 17:25
first-i.ri	1.11 KB	-rw-r--r--	2024-06-26 17:25
flatten%21-i.ri	1.33 KB	-rw-r--r--	2024-06-26 17:25
flatten-i.ri	1.52 KB	-rw-r--r--	2024-06-26 17:25
hash-i.ri	597 B	-rw-r--r--	2024-06-26 17:25
include%3f-i.ri	522 B	-rw-r--r--	2024-06-26 17:25
index-i.ri	1.36 KB	-rw-r--r--	2024-06-26 17:25
initialize_copy-i.ri	541 B	-rw-r--r--	2024-06-26 17:25
insert-i.ri	1.29 KB	-rw-r--r--	2024-06-26 17:25
inspect-i.ri	571 B	-rw-r--r--	2024-06-26 17:25
intersection-i.ri	928 B	-rw-r--r--	2024-06-26 17:25
join-i.ri	1.22 KB	-rw-r--r--	2024-06-26 17:25
keep_if-i.ri	778 B	-rw-r--r--	2024-06-26 17:25
last-i.ri	1.1 KB	-rw-r--r--	2024-06-26 17:25
length-i.ri	345 B	-rw-r--r--	2024-06-26 17:25
map%21-i.ri	743 B	-rw-r--r--	2024-06-26 17:25
map-i.ri	781 B	-rw-r--r--	2024-06-26 17:25
max-i.ri	1.76 KB	-rw-r--r--	2024-06-26 17:25
min-i.ri	1.76 KB	-rw-r--r--	2024-06-26 17:25
minmax-i.ri	1.17 KB	-rw-r--r--	2024-06-26 17:25
new-c.ri	1.78 KB	-rw-r--r--	2024-06-26 17:25
none%3f-i.ri	1.36 KB	-rw-r--r--	2024-06-26 17:25
one%3f-i.ri	1.51 KB	-rw-r--r--	2024-06-26 17:25
pack-i.ri	7.63 KB	-rw-r--r--	2024-06-26 17:25
permutation-i.ri	2.28 KB	-rw-r--r--	2024-06-26 17:25
pop-i.ri	1.07 KB	-rw-r--r--	2024-06-26 17:25
prepend-i.ri	582 B	-rw-r--r--	2024-06-26 17:25
product-i.ri	2.21 KB	-rw-r--r--	2024-06-26 17:25
push-i.ri	901 B	-rw-r--r--	2024-06-26 17:25
rassoc-i.ri	640 B	-rw-r--r--	2024-06-26 17:25
reject%21-i.ri	851 B	-rw-r--r--	2024-06-26 17:25
reject-i.ri	772 B	-rw-r--r--	2024-06-26 17:25
repeated_combination-i.ri	2.04 KB	-rw-r--r--	2024-06-26 17:25
repeated_permutation-i.ri	2.11 KB	-rw-r--r--	2024-06-26 17:25
replace-i.ri	492 B	-rw-r--r--	2024-06-26 17:25
reverse%21-i.ri	432 B	-rw-r--r--	2024-06-26 17:25
reverse-i.ri	489 B	-rw-r--r--	2024-06-26 17:25
reverse_each-i.ri	1.35 KB	-rw-r--r--	2024-06-26 17:25
rindex-i.ri	1.38 KB	-rw-r--r--	2024-06-26 17:25
rotate%21-i.ri	1.54 KB	-rw-r--r--	2024-06-26 17:25
rotate-i.ri	1.69 KB	-rw-r--r--	2024-06-26 17:25
sample-i.ri	1.51 KB	-rw-r--r--	2024-06-26 17:25
select%21-i.ri	1.01 KB	-rw-r--r--	2024-06-26 17:25
select-i.ri	918 B	-rw-r--r--	2024-06-26 17:25
shelljoin-i.ri	525 B	-rw-r--r--	2024-06-26 17:25
shift-i.ri	1.19 KB	-rw-r--r--	2024-06-26 17:25
shuffle%21-i.ri	664 B	-rw-r--r--	2024-06-26 17:25
shuffle-i.ri	674 B	-rw-r--r--	2024-06-26 17:25
size-i.ri	310 B	-rw-r--r--	2024-06-26 17:25
slice%21-i.ri	2.39 KB	-rw-r--r--	2024-06-26 17:25
slice-i.ri	3.47 KB	-rw-r--r--	2024-06-26 17:25
sort%21-i.ri	1.56 KB	-rw-r--r--	2024-06-26 17:25
sort-i.ri	1.65 KB	-rw-r--r--	2024-06-26 17:25
sort_by%21-i.ri	1.09 KB	-rw-r--r--	2024-06-26 17:25
sum-i.ri	1.57 KB	-rw-r--r--	2024-06-26 17:25
take-i.ri	678 B	-rw-r--r--	2024-06-26 17:25
take_while-i.ri	1.06 KB	-rw-r--r--	2024-06-26 17:25
to_a-i.ri	785 B	-rw-r--r--	2024-06-26 17:25
to_ary-i.ri	299 B	-rw-r--r--	2024-06-26 17:25
to_h-i.ri	1.1 KB	-rw-r--r--	2024-06-26 17:25
to_s-i.ri	534 B	-rw-r--r--	2024-06-26 17:25
transpose-i.ri	551 B	-rw-r--r--	2024-06-26 17:25
try_convert-c.ri	705 B	-rw-r--r--	2024-06-26 17:25
union-i.ri	834 B	-rw-r--r--	2024-06-26 17:25
uniq%21-i.ri	1.22 KB	-rw-r--r--	2024-06-26 17:25
uniq-i.ri	1.01 KB	-rw-r--r--	2024-06-26 17:25
unshift-i.ri	620 B	-rw-r--r--	2024-06-26 17:25
values_at-i.ri	1.49 KB	-rw-r--r--	2024-06-26 17:25
zip-i.ri	2.12 KB	-rw-r--r--	2024-06-26 17:25

Rename

U:RDoc::AnyMethod[iI"bsearch:ETI"Array#bsearch;TF:privateo:RDoc::Markup::Document:@parts[+o:RDoc::Markup::Paragraph;	[I"AReturns an element from +self+ selected by a binary search. ;TI"6+self+ should be sorted, but this is not checked.;To:RDoc::Markup::BlankLine�o;
;	[I"GBy using binary search, finds a value from this array which meets ;TI"Qthe given condition in <tt>O(log n)</tt> where +n+ is the size of the array.;T@o;
;	[I" There are two search modes:;To:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"IFind-minimum mode: the block should return +true+ or +false+.;To;;0;	[o;
;	[I"CFind-any mode: the block should return a numeric value.;T@o;
;	[I"UThe block should not mix the modes by and sometimes returning +true+ or +false+ ;TI"Fand sometimes returning a numeric value, but this is not checked.;T@o;
;	[I"Find-Minimum Mode;T@o;
;	[I"GIn find-minimum mode, the block always returns +true+ or +false+. ;TI":The further requirement (though not checked) is that ;TI"0there are no indexes +i+ and +j+ such that:;To;;
;;[o;;0;	[o;
;	[I"&<tt>0 <= i < j <= self.size</tt>.;To;;0;	[o;
;	[I"TThe block returns +true+ for <tt>self[i]</tt> and +false+ for <tt>self[j]</tt>.;T@o;
;	[I"eIn find-minimum mode, method bsearch returns the first element for which the block returns true.;T@o;
;	[I"Examples:;To:RDoc::Markup::Verbatim;	[
I"a = [0, 4, 7, 10, 12]
;TI"$a.bsearch {|x| x >= 4 } # => 4
;TI"$a.bsearch {|x| x >= 6 } # => 7
;TI"%a.bsearch {|x| x >= -1 } # => 0
;TI"(a.bsearch {|x| x >= 100 } # => nil
;T:@format0o;
;	[I"KLess formally: the block is such that all +false+-evaluating elements ;TI",precede all +true+-evaluating elements.;T@o;
;	[I"5These make sense as blocks in find-minimum mode:;To;;	[
I"a = [0, 4, 7, 10, 12]
;TI">a.map {|x| x >= 4 } # => [false, true, true, true, true]
;TI"?a.map {|x| x >= 6 } # => [false, false, true, true, true]
;TI">a.map {|x| x >= -1 } # => [true, true, true, true, true]
;TI"Da.map {|x| x >= 100 } # => [false, false, false, false, false]
;T;0o;
;	[I"This would not make sense:;To;;	[I"a = [0, 4, 7, 10, 12]
;TI"Aa.map {|x| x == 7 } # => [false, false, true, false, false]
;T;0o;
;	[I"Find-Any Mode;T@o;
;	[I"AIn find-any mode, the block always returns a numeric value. ;TI":The further requirement (though not checked) is that ;TI"0there are no indexes +i+ and +j+ such that:;To;;
;;[	o;;0;	[o;
;	[I"&<tt>0 <= i < j <= self.size</tt>.;To;;0;	[o;
;	[I"=The block returns a negative value for <tt>self[i]</tt> ;TI"/and a positive value for <tt>self[j]</tt>.;To;;0;	[o;
;	[I"WThe block returns a negative value for <tt>self[i]</tt> and zero <tt>self[j]</tt>.;To;;0;	[o;
;	[I"[The block returns zero for <tt>self[i]</tt> and a positive value for <tt>self[j]</tt>.;T@o;
;	[I";In find-any mode, method bsearch returns some element ;TI"Lfor which the block returns zero, or +nil+ if no such element is found.;T@o;
;	[I"Examples:;To;;	[
I"a = [0, 4, 7, 10, 12]
;TI"1a.bsearch {|element| 7 <=> element } # => 7
;TI"4a.bsearch {|element| -1 <=> element } # => nil
;TI"3a.bsearch {|element| 5 <=> element } # => nil
;TI"4a.bsearch {|element| 15 <=> element } # => nil
;T;0o;
;	[I"+Less formally: the block is such that:;To;;
;;[o;;0;	[o;
;	[I"KAll positive-evaluating elements precede all zero-evaluating elements.;To;;0;	[o;
;	[I"OAll positive-evaluating elements precede all negative-evaluating elements.;To;;0;	[o;
;	[I"KAll zero-evaluating elements precede all negative-evaluating elements.;T@o;
;	[I"1These make sense as blocks in find-any mode:;To;;	[
I"a = [0, 4, 7, 10, 12]
;TI"=a.map {|element| 7 <=> element } # => [1, 1, 0, -1, -1]
;TI"Aa.map {|element| -1 <=> element } # => [-1, -1, -1, -1, -1]
;TI">a.map {|element| 5 <=> element } # => [1, 1, -1, -1, -1]
;TI"<a.map {|element| 15 <=> element } # => [1, 1, 1, 1, 1]
;T;0o;
;	[I"This would not make sense:;To;;	[I"a = [0, 4, 7, 10, 12]
;TI"=a.map {|element| element <=> 7 } # => [-1, -1, 0, 1, 1]
;T;0o;
;	[I"-Returns an enumerator if no block given:;To;;	[I"a = [0, 4, 7, 10, 12]
;TI"<a.bsearch # => #<Enumerator: [0, 4, 7, 10, 12]:bsearch>;T;0:
@fileI"array.c;T:0@omit_headings_from_table_of_contents_below0I"Narray.bsearch {|element| ... } -> object
array.bsearch -> new_enumerator
;T0[�I"();T@�FI"
Array;TcRDoc::NormalClass00