Generates all integers which are greater than 2 and are not divisible by either 2 or 3.

This is a pseudo-prime generator, suitable on checking primality of an integer by brute force method.

Methods
N
R
S
Class Public methods
new()

Source: show 

# File lib/prime.rb, line 347
def initialize
  @prime = 1
  @step = nil
  super
end
Instance Public methods
next()
Alias for: succ
rewind()

Source: show 

# File lib/prime.rb, line 369
def rewind
  initialize
end
succ()
Also aliased as: next

Source: show 

# File lib/prime.rb, line 353
def succ
  loop do
    if (@step)
      @prime += @step
      @step = 6 - @step
    else
      case @prime
      when 1; @prime = 2
      when 2; @prime = 3
      when 3; @prime = 5; @step = 2
      end
    end
    return @prime
  end
end