Sha256: 8cc32dea2faef6d7ae809956294b3761b5e2c47d5b2b4c40d9eb8dda0da86179

Contents?: true

Size: 1.48 KB

Versions: 5

Compression:

Stored size: 1.48 KB

Contents

require 'active_support'

class Sham
  @@shams = {}
  
  # Over-ride module's built-in name method, so we can re-use it for
  # generating names. This is a bit of a no-no, but we get away with
  # it in this context.
  def self.name(*args, &block)
    method_missing(:name, *args, &block)
  end
  
  def self.method_missing(symbol, *args, &block)
    if block_given?
      @@shams[symbol] = Sham.new(symbol, args.pop || {}, &block)
    else
      sham = @@shams[symbol]
      raise "No sham defined for #{symbol}" if sham.nil?
      sham.fetch_value
    end
  end
  
  def self.clear
    @@shams = {}
  end

  def self.reset
    @@shams.values.each(&:reset)
  end
  
  def self.define(&block)
    Sham.instance_eval(&block)
  end
  
  def initialize(name, options = {}, &block)
    @name      = name
    @generator = block
    @offset    = 0
    @unique    = options.has_key?(:unique) ? options[:unique] : true
    generate_values(12)
  end
  
  def reset
    @offset = 0
  end
  
  def fetch_value
    # Generate more values if we need them.
    if @offset >= @values.length
      generate_values(2 * @values.length)
      raise "Can't generate more unique values for Sham.#{@name}" if @offset >= @values.length
    end
    returning @values[@offset] do
      @offset += 1
    end
  end
    
private
  
  def generate_values(count)
    @values = seeded { (1..count).map(&@generator) }
    @values.uniq! if @unique
  end
  
  def seeded
    begin
      srand(1)
      yield
    ensure
      srand
    end
  end
end

Version data entries

5 entries across 5 versions & 2 rubygems

Version Path
jdhollis-machinist-0.3.1 lib/sham.rb
jdhollis-machinist-1.0.0 lib/sham.rb
notahat-machinist-0.3.0 lib/sham.rb
notahat-machinist-0.3.1 lib/sham.rb
notahat-machinist-1.0.0 lib/sham.rb