Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	785 B	-rw-r--r--	2023-07-26 17:51
%2a-i.ri	663 B	-rw-r--r--	2023-07-26 17:51
%2b-i.ri	746 B	-rw-r--r--	2023-07-26 17:51
%2d-i.ri	782 B	-rw-r--r--	2023-07-26 17:51
%3c%3c-i.ri	603 B	-rw-r--r--	2023-07-26 17:51
%3c%3d%3e-i.ri	1.25 KB	-rw-r--r--	2023-07-26 17:51
%3d%3d-i.ri	708 B	-rw-r--r--	2023-07-26 17:51
%5b%5d%3d-i.ri	1.77 KB	-rw-r--r--	2023-07-26 17:51
%5b%5d-c.ri	529 B	-rw-r--r--	2023-07-26 17:51
%5b%5d-i.ri	1.68 KB	-rw-r--r--	2023-07-26 17:51
%7c-i.ri	701 B	-rw-r--r--	2023-07-26 17:51
abbrev-i.ri	952 B	-rw-r--r--	2023-07-26 17:51
assoc-i.ri	926 B	-rw-r--r--	2023-07-26 17:51
at-i.ri	604 B	-rw-r--r--	2023-07-26 17:51
bsearch-i.ri	2.56 KB	-rw-r--r--	2023-07-26 17:51
cdesc-Array.ri	11.42 KB	-rw-r--r--	2023-07-26 17:51
clear-i.ri	444 B	-rw-r--r--	2023-07-26 17:51
collect%21-i.ri	843 B	-rw-r--r--	2023-07-26 17:51
collect-i.ri	904 B	-rw-r--r--	2023-07-26 17:51
combination-i.ri	1.15 KB	-rw-r--r--	2023-07-26 17:51
compact%21-i.ri	604 B	-rw-r--r--	2023-07-26 17:51
compact-i.ri	509 B	-rw-r--r--	2023-07-26 17:51
concat-i.ri	622 B	-rw-r--r--	2023-07-26 17:51
count-i.ri	845 B	-rw-r--r--	2023-07-26 17:51
cycle-i.ri	910 B	-rw-r--r--	2023-07-26 17:51
dclone-i.ri	378 B	-rw-r--r--	2023-07-26 17:51
delete-i.ri	1021 B	-rw-r--r--	2023-07-26 17:51
delete_at-i.ri	686 B	-rw-r--r--	2023-07-26 17:51
delete_if-i.ri	806 B	-rw-r--r--	2023-07-26 17:51
drop-i.ri	636 B	-rw-r--r--	2023-07-26 17:51
drop_while-i.ri	796 B	-rw-r--r--	2023-07-26 17:51
each-i.ri	686 B	-rw-r--r--	2023-07-26 17:51
each_index-i.ri	715 B	-rw-r--r--	2023-07-26 17:51
empty%3f-i.ri	432 B	-rw-r--r--	2023-07-26 17:51
eql%3f-i.ri	427 B	-rw-r--r--	2023-07-26 17:51
fetch-i.ri	1.16 KB	-rw-r--r--	2023-07-26 17:51
fill-i.ri	1.45 KB	-rw-r--r--	2023-07-26 17:51
find_index-i.ri	1.02 KB	-rw-r--r--	2023-07-26 17:51
first-i.ri	713 B	-rw-r--r--	2023-07-26 17:51
flatten%21-i.ri	851 B	-rw-r--r--	2023-07-26 17:51
flatten-i.ri	1021 B	-rw-r--r--	2023-07-26 17:51
frozen%3f-i.ri	406 B	-rw-r--r--	2023-07-26 17:51
hash-i.ri	456 B	-rw-r--r--	2023-07-26 17:51
include%3f-i.ri	615 B	-rw-r--r--	2023-07-26 17:51
index-i.ri	1020 B	-rw-r--r--	2023-07-26 17:51
initialize_copy-i.ri	652 B	-rw-r--r--	2023-07-26 17:51
insert-i.ri	703 B	-rw-r--r--	2023-07-26 17:51
inspect-i.ri	508 B	-rw-r--r--	2023-07-26 17:51
join-i.ri	705 B	-rw-r--r--	2023-07-26 17:51
keep_if-i.ri	692 B	-rw-r--r--	2023-07-26 17:51
last-i.ri	635 B	-rw-r--r--	2023-07-26 17:51
length-i.ri	508 B	-rw-r--r--	2023-07-26 17:51
map%21-i.ri	835 B	-rw-r--r--	2023-07-26 17:51
map-i.ri	896 B	-rw-r--r--	2023-07-26 17:51
new-c.ri	2.13 KB	-rw-r--r--	2023-07-26 17:51
pack-i.ri	6.14 KB	-rw-r--r--	2023-07-26 17:51
permutation-i.ri	1.38 KB	-rw-r--r--	2023-07-26 17:51
pop-i.ri	785 B	-rw-r--r--	2023-07-26 17:51
product-i.ri	1.08 KB	-rw-r--r--	2023-07-26 17:51
push-i.ri	752 B	-rw-r--r--	2023-07-26 17:51
rassoc-i.ri	786 B	-rw-r--r--	2023-07-26 17:51
reject%21-i.ri	784 B	-rw-r--r--	2023-07-26 17:51
reject-i.ri	582 B	-rw-r--r--	2023-07-26 17:51
repeated_combination-i.ri	1.49 KB	-rw-r--r--	2023-07-26 17:51
repeated_permutation-i.ri	1.17 KB	-rw-r--r--	2023-07-26 17:51
replace-i.ri	627 B	-rw-r--r--	2023-07-26 17:51
reverse%21-i.ri	496 B	-rw-r--r--	2023-07-26 17:51
reverse-i.ri	520 B	-rw-r--r--	2023-07-26 17:51
reverse_each-i.ri	610 B	-rw-r--r--	2023-07-26 17:51
rindex-i.ri	1.03 KB	-rw-r--r--	2023-07-26 17:51
rotate%21-i.ri	847 B	-rw-r--r--	2023-07-26 17:51
rotate-i.ri	867 B	-rw-r--r--	2023-07-26 17:51
sample-i.ri	1.05 KB	-rw-r--r--	2023-07-26 17:51
select%21-i.ri	713 B	-rw-r--r--	2023-07-26 17:51
select-i.ri	787 B	-rw-r--r--	2023-07-26 17:51
shelljoin-i.ri	520 B	-rw-r--r--	2023-07-26 17:51
shift-i.ri	1.05 KB	-rw-r--r--	2023-07-26 17:51
shuffle%21-i.ri	488 B	-rw-r--r--	2023-07-26 17:51
shuffle-i.ri	709 B	-rw-r--r--	2023-07-26 17:51
size-i.ri	231 B	-rw-r--r--	2023-07-26 17:51
slice%21-i.ri	902 B	-rw-r--r--	2023-07-26 17:51
slice-i.ri	1.56 KB	-rw-r--r--	2023-07-26 17:51
sort%21-i.ri	953 B	-rw-r--r--	2023-07-26 17:51
sort-i.ri	979 B	-rw-r--r--	2023-07-26 17:51
sort_by%21-i.ri	564 B	-rw-r--r--	2023-07-26 17:51
take-i.ri	586 B	-rw-r--r--	2023-07-26 17:51
take_while-i.ri	758 B	-rw-r--r--	2023-07-26 17:51
to_a-i.ri	410 B	-rw-r--r--	2023-07-26 17:51
to_ary-i.ri	295 B	-rw-r--r--	2023-07-26 17:51
to_h-i.ri	513 B	-rw-r--r--	2023-07-26 17:51
to_s-i.ri	232 B	-rw-r--r--	2023-07-26 17:51
transpose-i.ri	609 B	-rw-r--r--	2023-07-26 17:51
try_convert-c.ri	851 B	-rw-r--r--	2023-07-26 17:51
uniq%21-i.ri	1020 B	-rw-r--r--	2023-07-26 17:51
uniq-i.ri	869 B	-rw-r--r--	2023-07-26 17:51
unshift-i.ri	623 B	-rw-r--r--	2023-07-26 17:51
values_at-i.ri	875 B	-rw-r--r--	2023-07-26 17:51
zip-i.ri	1.14 KB	-rw-r--r--	2023-07-26 17:51

Rename

U:RDoc::AnyMethod[iI"bsearch:ETI"Array#bsearch;TF:publico:RDoc::Markup::Document:@parts[o:RDoc::Markup::Paragraph;	[I"GBy using binary search, finds a value from this array which meets ;TI"Fthe given condition in O(log n) where n is the size of the array.;To:RDoc::Markup::BlankLine�o;
;	[I"GYou can use this method in two use cases: a find-minimum mode and ;TI"Ia find-any mode.  In either case, the elements of the array must be ;TI"4monotone (or sorted) with respect to the block.;T@o;
;	[I"HIn find-minimum mode (this is a good choice for typical use case), ;TI"Gthe block must return true or false, and there must be an index i ;TI""(0 <= i <= ary.size) so that:;T@o:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"Fthe block returns false for any element whose index is less than ;TI"i, and;To;;0;	[o;
;	[I"Cthe block returns true for any element whose index is greater ;TI"than or equal to i.;T@o;
;	[I"GThis method returns the i-th element.  If i is equal to ary.size, ;TI"it returns nil.;T@o:RDoc::Markup::Verbatim;	[
I"ary = [0, 4, 7, 10, 12]
;TI"'ary.bsearch {|x| x >=   4 } #=> 4
;TI"'ary.bsearch {|x| x >=   6 } #=> 7
;TI"'ary.bsearch {|x| x >=  -1 } #=> 0
;TI")ary.bsearch {|x| x >= 100 } #=> nil
;T:@format0o;
;	[I"GIn find-any mode (this behaves like libc's bsearch(3)), the block ;TI"Amust return a number, and there must be two indices i and j ;TI"'(0 <= i <= j <= ary.size) so that:;T@o;;
;;[o;;0;	[o;
;	[I"Bthe block returns a positive number for ary[k] if 0 <= k < i,;To;;0;	[o;
;	[I"9the block returns zero for ary[k] if i <= k < j, and;To;;0;	[o;
;	[I"7the block returns a negative number for ary[k] if ;TI"j <= k < ary.size.;T@o;
;	[I"GUnder this condition, this method returns any element whose index ;TI"Eis within i...j.  If i is equal to j (i.e., there is no element ;TI"8that satisfies the block), this method returns nil.;T@o;;	[
I"ary = [0, 4, 7, 10, 12]
;TI"*# try to find v such that 4 <= v < 8
;TI"-ary.bsearch {|x| 1 - x / 4 } #=> 4 or 7
;TI"+# try to find v such that 8 <= v < 10
;TI"*ary.bsearch {|x| 4 - x / 2 } #=> nil
;T;0o;
;	[I"EYou must not mix the two modes at a time; the block must always ;TI"Areturn either true/false, or always return a number.  It is ;TI"Cundefined which value is actually picked up at each iteration.;T:
@fileI"array.c;T:0@omit_headings_from_table_of_contents_below0I"'ary.bsearch {|x| block }  -> elem
;T0[�I"();T@[FI"
Array;TcRDoc::NormalClass00