Gecko [ beriskala.com ]

Name	Size	Permission	Date
%26-i.ri	760 B	-rw-r--r--	2023-06-06 18:25
%2a-i.ri	664 B	-rw-r--r--	2023-06-06 18:25
%2b-i.ri	1003 B	-rw-r--r--	2023-06-06 18:25
%2d-i.ri	1.03 KB	-rw-r--r--	2023-06-06 18:25
%3c%3c-i.ri	675 B	-rw-r--r--	2023-06-06 18:25
%3c%3d%3e-i.ri	1.58 KB	-rw-r--r--	2023-06-06 18:25
%3d%3d-i.ri	709 B	-rw-r--r--	2023-06-06 18:25
%5b%5d%3d-i.ri	1.78 KB	-rw-r--r--	2023-06-06 18:25
%5b%5d-c.ri	530 B	-rw-r--r--	2023-06-06 18:25
%5b%5d-i.ri	1.68 KB	-rw-r--r--	2023-06-06 18:25
%7c-i.ri	776 B	-rw-r--r--	2023-06-06 18:25
abbrev-i.ri	1008 B	-rw-r--r--	2023-06-06 18:25
all%3f-i.ri	380 B	-rw-r--r--	2023-06-06 18:25
any%3f-i.ri	380 B	-rw-r--r--	2023-06-06 18:25
append-i.ri	239 B	-rw-r--r--	2023-06-06 18:25
assoc-i.ri	931 B	-rw-r--r--	2023-06-06 18:25
at-i.ri	605 B	-rw-r--r--	2023-06-06 18:25
bsearch-i.ri	2.58 KB	-rw-r--r--	2023-06-06 18:25
bsearch_index-i.ri	830 B	-rw-r--r--	2023-06-06 18:25
cdesc-Array.ri	11.98 KB	-rw-r--r--	2023-06-06 18:25
clear-i.ri	445 B	-rw-r--r--	2023-06-06 18:25
collect%21-i.ri	895 B	-rw-r--r--	2023-06-06 18:25
collect-i.ri	908 B	-rw-r--r--	2023-06-06 18:25
combination-i.ri	1.16 KB	-rw-r--r--	2023-06-06 18:25
compact%21-i.ri	605 B	-rw-r--r--	2023-06-06 18:25
compact-i.ri	510 B	-rw-r--r--	2023-06-06 18:25
concat-i.ri	859 B	-rw-r--r--	2023-06-06 18:25
count-i.ri	849 B	-rw-r--r--	2023-06-06 18:25
cycle-i.ri	909 B	-rw-r--r--	2023-06-06 18:25
dclone-i.ri	379 B	-rw-r--r--	2023-06-06 18:25
deconstruct-i.ri	229 B	-rw-r--r--	2023-06-06 18:25
delete-i.ri	1022 B	-rw-r--r--	2023-06-06 18:25
delete_at-i.ri	687 B	-rw-r--r--	2023-06-06 18:25
delete_if-i.ri	807 B	-rw-r--r--	2023-06-06 18:25
difference-i.ri	1.36 KB	-rw-r--r--	2023-06-06 18:25
dig-i.ri	810 B	-rw-r--r--	2023-06-06 18:25
drop-i.ri	637 B	-rw-r--r--	2023-06-06 18:25
drop_while-i.ri	797 B	-rw-r--r--	2023-06-06 18:25
each-i.ri	715 B	-rw-r--r--	2023-06-06 18:25
each_index-i.ri	716 B	-rw-r--r--	2023-06-06 18:25
empty%3f-i.ri	433 B	-rw-r--r--	2023-06-06 18:25
eql%3f-i.ri	428 B	-rw-r--r--	2023-06-06 18:25
fetch-i.ri	1.16 KB	-rw-r--r--	2023-06-06 18:25
fill-i.ri	1.45 KB	-rw-r--r--	2023-06-06 18:25
filter%21-i.ri	860 B	-rw-r--r--	2023-06-06 18:25
filter-i.ri	897 B	-rw-r--r--	2023-06-06 18:25
find_index-i.ri	1.02 KB	-rw-r--r--	2023-06-06 18:25
first-i.ri	714 B	-rw-r--r--	2023-06-06 18:25
flatten%21-i.ri	850 B	-rw-r--r--	2023-06-06 18:25
flatten-i.ri	1020 B	-rw-r--r--	2023-06-06 18:25
hash-i.ri	496 B	-rw-r--r--	2023-06-06 18:25
include%3f-i.ri	616 B	-rw-r--r--	2023-06-06 18:25
index-i.ri	1021 B	-rw-r--r--	2023-06-06 18:25
initialize_copy-i.ri	653 B	-rw-r--r--	2023-06-06 18:25
insert-i.ri	875 B	-rw-r--r--	2023-06-06 18:25
inspect-i.ri	553 B	-rw-r--r--	2023-06-06 18:25
intersection-i.ri	902 B	-rw-r--r--	2023-06-06 18:25
join-i.ri	885 B	-rw-r--r--	2023-06-06 18:25
keep_if-i.ri	771 B	-rw-r--r--	2023-06-06 18:25
last-i.ri	636 B	-rw-r--r--	2023-06-06 18:25
length-i.ri	509 B	-rw-r--r--	2023-06-06 18:25
map%21-i.ri	836 B	-rw-r--r--	2023-06-06 18:25
map-i.ri	900 B	-rw-r--r--	2023-06-06 18:25
max-i.ri	1.08 KB	-rw-r--r--	2023-06-06 18:25
min-i.ri	1.08 KB	-rw-r--r--	2023-06-06 18:25
minmax-i.ri	597 B	-rw-r--r--	2023-06-06 18:25
new-c.ri	2.15 KB	-rw-r--r--	2023-06-06 18:25
none%3f-i.ri	385 B	-rw-r--r--	2023-06-06 18:25
one%3f-i.ri	380 B	-rw-r--r--	2023-06-06 18:25
pack-i.ri	7.63 KB	-rw-r--r--	2023-06-06 18:25
permutation-i.ri	1.38 KB	-rw-r--r--	2023-06-06 18:25
pop-i.ri	786 B	-rw-r--r--	2023-06-06 18:25
prepend-i.ri	244 B	-rw-r--r--	2023-06-06 18:25
product-i.ri	1.08 KB	-rw-r--r--	2023-06-06 18:25
push-i.ri	811 B	-rw-r--r--	2023-06-06 18:25
rassoc-i.ri	791 B	-rw-r--r--	2023-06-06 18:25
reject%21-i.ri	720 B	-rw-r--r--	2023-06-06 18:25
reject-i.ri	636 B	-rw-r--r--	2023-06-06 18:25
repeated_combination-i.ri	1.49 KB	-rw-r--r--	2023-06-06 18:25
repeated_permutation-i.ri	1.17 KB	-rw-r--r--	2023-06-06 18:25
replace-i.ri	628 B	-rw-r--r--	2023-06-06 18:25
reverse%21-i.ri	497 B	-rw-r--r--	2023-06-06 18:25
reverse-i.ri	521 B	-rw-r--r--	2023-06-06 18:25
reverse_each-i.ri	611 B	-rw-r--r--	2023-06-06 18:25
rindex-i.ri	1.03 KB	-rw-r--r--	2023-06-06 18:25
rotate%21-i.ri	846 B	-rw-r--r--	2023-06-06 18:25
rotate-i.ri	866 B	-rw-r--r--	2023-06-06 18:25
sample-i.ri	1.18 KB	-rw-r--r--	2023-06-06 18:25
select%21-i.ri	860 B	-rw-r--r--	2023-06-06 18:25
select-i.ri	846 B	-rw-r--r--	2023-06-06 18:25
shelljoin-i.ri	525 B	-rw-r--r--	2023-06-06 18:25
shift-i.ri	1.05 KB	-rw-r--r--	2023-06-06 18:25
shuffle%21-i.ri	738 B	-rw-r--r--	2023-06-06 18:25
shuffle-i.ri	757 B	-rw-r--r--	2023-06-06 18:25
size-i.ri	232 B	-rw-r--r--	2023-06-06 18:25
slice%21-i.ri	897 B	-rw-r--r--	2023-06-06 18:25
slice-i.ri	1.55 KB	-rw-r--r--	2023-06-06 18:25
sort%21-i.ri	1.13 KB	-rw-r--r--	2023-06-06 18:25
sort-i.ri	1.34 KB	-rw-r--r--	2023-06-06 18:25
sort_by%21-i.ri	760 B	-rw-r--r--	2023-06-06 18:25
sum-i.ri	1.66 KB	-rw-r--r--	2023-06-06 18:25
take-i.ri	587 B	-rw-r--r--	2023-06-06 18:25
take_while-i.ri	759 B	-rw-r--r--	2023-06-06 18:25
to_a-i.ri	411 B	-rw-r--r--	2023-06-06 18:25
to_ary-i.ri	296 B	-rw-r--r--	2023-06-06 18:25
to_h-i.ri	775 B	-rw-r--r--	2023-06-06 18:25
to_s-i.ri	233 B	-rw-r--r--	2023-06-06 18:25
transpose-i.ri	610 B	-rw-r--r--	2023-06-06 18:25
try_convert-c.ri	841 B	-rw-r--r--	2023-06-06 18:25
union-i.ri	864 B	-rw-r--r--	2023-06-06 18:25
uniq%21-i.ri	1.08 KB	-rw-r--r--	2023-06-06 18:25
uniq-i.ri	950 B	-rw-r--r--	2023-06-06 18:25
unshift-i.ri	685 B	-rw-r--r--	2023-06-06 18:25
values_at-i.ri	876 B	-rw-r--r--	2023-06-06 18:25
zip-i.ri	1.14 KB	-rw-r--r--	2023-06-06 18:25

Rename

U:RDoc::AnyMethod[iI"bsearch:ETI"Array#bsearch;TF:privateo: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"CYou can use this method in two modes: 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"IIn find-minimum mode (this is a good choice for typical use cases), ;TI"Nthe block must always 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"Hmust always 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