Gecko [ beriskala.com ]

Name	Size	Permission	Date
%25-i.ri	1.34 KB	-rw-r--r--	2023-06-06 18:25
%3d%3d%3d-i.ri	999 B	-rw-r--r--	2023-06-06 18:25
%3d%3d-i.ri	682 B	-rw-r--r--	2023-06-06 18:25
as_json-i.ri	371 B	-rw-r--r--	2023-06-06 18:25
begin-i.ri	435 B	-rw-r--r--	2023-06-06 18:25
bsearch-i.ri	2.57 KB	-rw-r--r--	2023-06-06 18:25
cdesc-Range.ri	4.55 KB	-rw-r--r--	2023-06-06 18:25
count-i.ri	455 B	-rw-r--r--	2023-06-06 18:25
cover%3f-i.ri	1.63 KB	-rw-r--r--	2023-06-06 18:25
each-i.ri	939 B	-rw-r--r--	2023-06-06 18:25
end-i.ri	452 B	-rw-r--r--	2023-06-06 18:25
entries-i.ri	540 B	-rw-r--r--	2023-06-06 18:25
eql%3f-i.ri	694 B	-rw-r--r--	2023-06-06 18:25
exclude_end%3f-i.ri	521 B	-rw-r--r--	2023-06-06 18:25
first-i.ri	534 B	-rw-r--r--	2023-06-06 18:25
hash-i.ri	531 B	-rw-r--r--	2023-06-06 18:25
include%3f-i.ri	864 B	-rw-r--r--	2023-06-06 18:25
inspect-i.ri	395 B	-rw-r--r--	2023-06-06 18:25
json_create-c.ri	419 B	-rw-r--r--	2023-06-06 18:25
last-i.ri	755 B	-rw-r--r--	2023-06-06 18:25
max-i.ri	833 B	-rw-r--r--	2023-06-06 18:25
member%3f-i.ri	862 B	-rw-r--r--	2023-06-06 18:25
min-i.ri	840 B	-rw-r--r--	2023-06-06 18:25
minmax-i.ri	597 B	-rw-r--r--	2023-06-06 18:25
new-c.ri	530 B	-rw-r--r--	2023-06-06 18:25
size-i.ri	618 B	-rw-r--r--	2023-06-06 18:25
step-i.ri	1.35 KB	-rw-r--r--	2023-06-06 18:25
to_a-i.ri	534 B	-rw-r--r--	2023-06-06 18:25
to_json-i.ri	483 B	-rw-r--r--	2023-06-06 18:25
to_s-i.ri	384 B	-rw-r--r--	2023-06-06 18:25

Rename

U:RDoc::AnyMethod[iI"bsearch:ETI"Range#bsearch;TF:privateo:RDoc::Markup::Document:@parts[o:RDoc::Markup::Paragraph;	[I"JBy using binary search, finds a value in range which meets the given ;TI"<condition in O(log n) where n is the size of the range.;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 range 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"Fthe block must return true or false, and there must be a value x ;TI"
so that:;T@o:RDoc::Markup::List:
@type:BULLET:@items[o:RDoc::Markup::ListItem:@label0;	[o;
;	[I"Dthe block returns false for any value which is less than x, and;To;;0;	[o;
;	[I"Cthe block returns true for any value which is greater than or ;TI"equal to x.;T@o;
;	[I"@If x is within the range, this method returns the value x. ;TI"Otherwise, it returns nil.;T@o:RDoc::Markup::Verbatim;	[I"ary = [0, 4, 7, 10, 12]
;TI"5(0...ary.size).bsearch {|i| ary[i] >= 4 } #=> 1
;TI"5(0...ary.size).bsearch {|i| ary[i] >= 6 } #=> 2
;TI"5(0...ary.size).bsearch {|i| ary[i] >= 8 } #=> 3
;TI"9(0...ary.size).bsearch {|i| ary[i] >= 100 } #=> nil
;TI"
;TI"E(0.0...Float::INFINITY).bsearch {|x| Math.log(x) >= 0 } #=> 1.0
;T:@format0o;
;	[I"GIn find-any mode (this behaves like libc's bsearch(3)), the block ;TI"Imust return a number, and there must be two values x and y (x <= y) ;TI"
so that:;T@o;;
;;[o;;0;	[o;
;	[I"8the block returns a positive number for v if v < x,;To;;0;	[o;
;	[I"4the block returns zero for v if x <= v < y, and;To;;0;	[o;
;	[I"9the block returns a negative number for v if y <= v.;T@o;
;	[I"GThis method returns any value which is within the intersection of ;TI"Dthe given range and x...y (if any).  If there is no value that ;TI"-satisfies the condition, it returns nil.;T@o;;	[	I"#ary = [0, 100, 100, 100, 200]
;TI"6(0..4).bsearch {|i| 100 - ary[i] } #=> 1, 2 or 3
;TI"0(0..4).bsearch {|i| 300 - ary[i] } #=> nil
;TI"0(0..4).bsearch {|i|  50 - ary[i] } #=> 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"range.c;T:0@omit_headings_from_table_of_contents_below0I"*rng.bsearch {|obj| block }  -> value
;T0[�I"();T@ZFI"
Range;TcRDoc::NormalClass00