Sha256: e088daeb201a8deee633161e19b8af350b2bfa4b74b73a8cf5f4ac87d54e6014
Contents?: true
Size: 1.57 KB
Versions: 3
Compression:
Stored size: 1.57 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.reset @@shams.values.each(&:reset) end def self.define(&block) definer = Object.new class << definer def method_missing(*args, &block) Sham.send(*args, &block) end end definer.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
3 entries across 3 versions & 2 rubygems
Version | Path |
---|---|
hassox-machinist-0.1.7.1 | lib/sham.rb |
hassox-machinist-0.1.7 | lib/sham.rb |
notahat-machinist-0.1.7 | lib/sham.rb |