Linux server1.dn-server.com 4.18.0-553.89.1.lve.el8.x86_64 #1 SMP Wed Dec 10 13:58:50 UTC 2025 x86_64
LiteSpeed
Server IP : 195.201.204.189 & Your IP : 216.73.216.45
Domains :
Cant Read [ /etc/named.conf ]
User : beriska1
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
ruby20 /
share /
ri /
2.0.0 /
system /
Prime /
Delete
Unzip
Name
Size
Permission
Date
Action
EratosthenesGenerator
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
EratosthenesSieve
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
Generator23
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
OldCompatibility
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
PseudoPrimeGenerator
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
TrialDivision
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
TrialDivisionGenerator
[ DIR ]
drwxr-xr-x
2026-05-01 04:24
cdesc-Prime.ri
2.42
KB
-rw-r--r--
2023-07-26 17:38
each-i.ri
1.6
KB
-rw-r--r--
2023-07-26 17:38
instance-c.ri
303
B
-rw-r--r--
2023-07-26 17:38
int_from_prime_division-i.ri
963
B
-rw-r--r--
2023-07-26 17:38
new-c.ri
317
B
-rw-r--r--
2023-07-26 17:38
prime%3f-i.ri
672
B
-rw-r--r--
2023-07-26 17:38
prime_division-i.ri
1.24
KB
-rw-r--r--
2023-07-26 17:38
Save
Rename
U:RDoc::AnyMethod[iI" each:EFI"Prime#each;TF: publico:RDoc::Markup::Document: @parts[o: RDoc::Markup::Paragraph; [I"5Iterates the given block over all prime numbers.;To: RDoc::Markup::BlankLine S:RDoc::Markup::Heading: leveli: textI"Parameters;T@o:RDoc::Markup::List: @type: NOTE: @items[o:RDoc::Markup::ListItem: @label[I" +ubound+;T; [o; ; [I"-Optional. An arbitrary positive number. ;TI";The upper bound of enumeration. The method enumerates ;TI"1prime numbers infinitely if +ubound+ is nil.;To;;[I"+generator+;T; [o; ; [I";Optional. An implementation of pseudo-prime generator.;T@S; ; i;I"Return value;T@o; ; [I"=An evaluated value of the given block at the last time. ;TI"=Or an enumerator which is compatible to an +Enumerator+ ;TI"if no block given.;T@S; ; i;I"Description;T@o; ; [I"DCalls +block+ once for each prime number, passing the prime as ;TI"a parameter.;T@o;;;;[o;;[I" +ubound+;T; [o; ; [I"<Upper bound of prime numbers. The iterator stops after ;TI",yields all prime numbers p <= +ubound+.;T@S; ; i;I" Note;T@o; ; [I"L+Prime+.+new+ returns a object extended by +Prime+::+OldCompatibility+ ;TI"Lin order to compatibility to Ruby 1.8, and +Prime+#each is overwritten ;TI"+by +Prime+::+OldCompatibility+#+each+.;T@o; ; [I"L+Prime+.+new+ is now obsolete. Use +Prime+.+instance+.+each+ or simply ;TI"+Prime+.+each+.;T: @fileI"lib/prime.rb;T:0@omit_headings_from_table_of_contents_below000[ I"B(ubound = nil, generator = EratosthenesGenerator.new, &block);T@EFI" Prime;TcRDoc::NormalClass0