class Prime::PseudoPrimeGenerator
An abstract class for enumerating pseudo-prime numbers.
Concrete subclasses should override succ, next, rewind.
Public Class Methods
# File lib/prime.rb, line 243 def initialize(ubound = nil) @ubound = ubound end
Public Instance Methods
# File lib/prime.rb, line 275 def each return self.dup unless block_given? if @ubound last_value = nil loop do prime = succ break last_value if prime > @ubound last_value = yield prime end else loop do yield succ end end end
Iterates the given block for each prime number.
# File lib/prime.rb, line 263 def next raise NotImplementedError, "need to define `next'" end
alias of succ
.
# File lib/prime.rb, line 270 def rewind raise NotImplementedError, "need to define `rewind'" end
Rewinds the internal position for enumeration.
See Enumerator
#rewind.
# File lib/prime.rb, line 258 def succ raise NotImplementedError, "need to define `succ'" end
returns the next pseudo-prime number, and move the internal position forward.
PseudoPrimeGenerator
#succ raises NotImplementedError
.
# File lib/prime.rb, line 250 def upper_bound @ubound end
# File lib/prime.rb, line 247 def upper_bound=(ubound) @ubound = ubound end
# File lib/prime.rb, line 295 def with_object(obj) return enum_for(:with_object) unless block_given? each do |prime| yield prime, obj end end
see Enumerator
#with_object.
Ruby Core © 1993–2017 Yukihiro Matsumoto
Licensed under the Ruby License.
Ruby Standard Library © contributors
Licensed under their own licenses.