class Spruz::Generator
g.select { |a, b| %w[a c].include? b } # => [[1, “a”], [1, “c”], [2, “a”], [2, “c”]]
Enumerable.instance_methods can be used as well:
and Spruz::Generator includes the Enumerable module, so
g.each { |a, b| puts “#{a} #{b}” }
The ‘each’ method can be used to iterate over the tuples
g.to_a # => [[1, “a”], [1, “b”], [1, “c”], [2, “a”], [2, “b”], [2, “c”]]
produces
g = Spruz::Generator[1..2, %w[a b c]]
The generator
would be created by as many for-loops as dimensions were given.
This class can create generator objects, that can produce all tuples, that
def self.[](*enums)
def self.[](*enums) new(enums) end
def add_dimension(enum, iterator = :each)
Add another dimension to this generator. _enum_ is an object, that ought
def add_dimension(enum, iterator = :each) @enums << enum @iterators << iterator @n += 1 end
def each(&block) # :yield: tuple
Iterate over all tuples produced by this generator and yield to them.
def each(&block) # :yield: tuple recurse(&block) self end
def initialize(enums)
as dimensions. The should all respond to the :each method (see module
Create a new Generator instance. Use the objects in the Array _enums_
def initialize(enums) @enums, @iterators, @n = [], [], 0 enums.each { |e| add_dimension(e) } end
def recurse(tuple = [ nil ] * @n, i = 0, &block)
def recurse(tuple = [ nil ] * @n, i = 0, &block) if i < @n - 1 then @enums[i].__send__(@iterators[i]) do |x| tuple[i] = x recurse(tuple, i + 1, &block) end else @enums[i].__send__(@iterators[i]) do |x| tuple[i] = x yield tuple.dup end end end
def size
def size @enums.size end