An abstract class for enumerating pseudo-prime numbers.
Concrete subclasses should override succ, next, rewind.
# File lib/backports/1.9.1/stdlib/prime.rb, line 228 def initialize(ubound = nil) @ubound = ubound end
Iterates the given block for each prime numbers.
# File lib/backports/1.9.1/stdlib/prime.rb, line 260 def each(&block) return self.dup unless block if @ubound last_value = nil loop do prime = succ break last_value if prime > @ubound last_value = block.call(prime) end else loop do block.call(succ) end end end
alias of succ
.
# File lib/backports/1.9.1/stdlib/prime.rb, line 248 def next raise NotImplementedError, "need to define `next'" end
Rewinds the internal position for enumeration.
See Enumerator
#rewind.
# File lib/backports/1.9.1/stdlib/prime.rb, line 255 def rewind raise NotImplementedError, "need to define `rewind'" end
returns the next pseudo-prime number, and move the internal position forward.
PseudoPrimeGenerator
#succ raises
NotImplementedError
.
# File lib/backports/1.9.1/stdlib/prime.rb, line 243 def succ raise NotImplementedError, "need to define `succ'" end
# File lib/backports/1.9.1/stdlib/prime.rb, line 235 def upper_bound @ubound end
# File lib/backports/1.9.1/stdlib/prime.rb, line 232 def upper_bound=(ubound) @ubound = ubound end
see Enumerator
#with_object.
# File lib/backports/1.9.1/stdlib/prime.rb, line 280 def with_object(obj) return enum_for(:with_object) unless block_given? each do |prime| yield prime, obj end end