An abstract class for enumerating pseudo-prime numbers.

Concrete subclasses should override succ, next, rewind.

Methods
E
N
R
S
U
W
Included Modules
Class Public methods
new(ubound = nil)

Source: show 

# File lib/prime.rb, line 244
def initialize(ubound = nil)
  @ubound = ubound
end
Instance Public methods
each(&block)

Iterates the given block for each prime number.

Source: show 

# File lib/prime.rb, line 276
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
next()

alias of succ.

Source: show 

# File lib/prime.rb, line 264
def next
  raise NotImplementedError, "need to define `next'"
end
rewind()

Rewinds the internal position for enumeration.

See Enumerator#rewind.

Source: show 

# File lib/prime.rb, line 271
def rewind
  raise NotImplementedError, "need to define `rewind'"
end
succ()

returns the next pseudo-prime number, and move the internal position forward.

PseudoPrimeGenerator#succ raises NotImplementedError.

Source: show 

# File lib/prime.rb, line 259
def succ
  raise NotImplementedError, "need to define `succ'"
end
upper_bound()

Source: show 

# File lib/prime.rb, line 251
def upper_bound
  @ubound
end
upper_bound=(ubound)

Source: show 

# File lib/prime.rb, line 248
def upper_bound=(ubound)
  @ubound = ubound
end
with_object(obj)

see Enumerator#with_object.

Source: show 

# File lib/prime.rb, line 296
def with_object(obj)
  return enum_for(:with_object) unless block_given?
  each do |prime|
    yield prime, obj
  end
end