Gecko [ beriskala.com ]

Name	Size	Permission	Date
EratosthenesGenerator	[ DIR ]	drwxr-xr-x	2026-05-01 04:23
EratosthenesSieve	[ DIR ]	drwxr-xr-x	2026-05-01 04:23
Generator23	[ DIR ]	drwxr-xr-x	2026-05-01 04:23
PseudoPrimeGenerator	[ DIR ]	drwxr-xr-x	2026-05-01 04:23
TrialDivision	[ DIR ]	drwxr-xr-x	2026-05-01 04:23
TrialDivisionGenerator	[ DIR ]	drwxr-xr-x	2026-05-01 04:23
cdesc-Prime.ri	2.4 KB	-rw-r--r--	2024-06-26 17:25
each-i.ri	1.27 KB	-rw-r--r--	2024-06-26 17:25
include%3f-i.ri	429 B	-rw-r--r--	2024-06-26 17:25
int_from_prime_division-i.ri	1.05 KB	-rw-r--r--	2024-06-26 17:25
prime%3f-i.ri	727 B	-rw-r--r--	2024-06-26 17:25
prime_division-i.ri	1.45 KB	-rw-r--r--	2024-06-26 17:25

Rename

U:RDoc::NormalClass[iI"
Prime:ET@I"Object;To:RDoc::Markup::Document:@parts[o;;[o:RDoc::Markup::Paragraph;[I""The set of all prime numbers.;To:RDoc::Markup::BlankLine�S:RDoc::Markup::Heading:
leveli:	textI"Example;T@o:RDoc::Markup::Verbatim;[I" Prime.each(100) do |prime|
;TI"-  p prime  #=> 2, 3, 5, 7, 11, ...., 97
;TI"	end
;T:@format0o;	;[I"Prime is Enumerable:;T@o;;[I")Prime.first 5 # => [2, 3, 5, 7, 11]
;T;0S;;i;
I"Retrieving the instance;T@o;	;[I"OFor convenience, each instance method of +Prime+.instance can be accessed ;TI""as a class method of +Prime+.;T@o;	;[I"	e.g.;To;;[I"(Prime.instance.prime?(2)  #=> true
;TI"(Prime.prime?(2)           #=> true
;T;0S;;i;
I"Generators;T@o;	;[	I"JA "generator" provides an implementation of enumerating pseudo-prime ;TI"Knumbers and it remembers the position of enumeration and upper bound. ;TI"KFurthermore, it is an external iterator of prime enumeration which is ;TI"#compatible with an Enumerator.;T@o;	;[I"G+Prime+::+PseudoPrimeGenerator+ is the base class for generators. ;TI"0There are few implementations of generator.;T@o:RDoc::Markup::List:
@type:
LABEL:@items[o:RDoc::Markup::ListItem:@label[I"%+Prime+::+EratosthenesGenerator+;T;[o;	;[I"Uses Eratosthenes' sieve.;To;;[I"&+Prime+::+TrialDivisionGenerator+;T;[o;	;[I"$Uses the trial division method.;To;;[I"+Prime+::+Generator23+;T;[o;	;[
I"OGenerates all positive integers which are not divisible by either 2 or 3. ;TI"DThis sequence is very bad as a pseudo-prime sequence. But this ;TI"His faster and uses much less memory than the other generators. So, ;TI"Fit is suitable for factorizing an integer which is not large but ;TI"4has many prime factors. e.g. for Prime#prime? .;T:
@fileI"lib/prime.rb;T:0@omit_headings_from_table_of_contents_below0;0;0[�[U:RDoc::Constant[i�I"VERSION;TI"Prime::VERSION;T:public0o;;[�;@R;0@R@cRDoc::NormalClass0[[I"Enumerable;To;;[�;@R;0I"lib/prime.rb;T[I"Singleton;To;;[�;@R;0@a[[I"
class;T[[;[�[:protected[�[:private[�[I"
instance;T[[;[�[;[�[;[
[I"	each;T@a[I"
include?;T@a[I"int_from_prime_division;T@a[I"prime?;T@a[I"prime_division;T@a[[I"Forwardable;To;;[�;@R;0@a[U:RDoc::Context::Section[i�0o;;[�;0;0[I"lib/prime.rb;T@RcRDoc::TopLevel