lib/more_math/ranking_common.rb
# Iterates over all instances starting with the
# first (<code>rank == 0</code>) ranked instance and ending with the
# last (<code>rank == #last</code>) ranked instance while
# yielding to a freshly created instance for every iteration
# step.
#
# The mixed in methods from the Enumerable module rely on this method.
Iterates over all instances starting with the
first (rank == 0) ranked instance and ending with the
last (rank == #last) ranked instance while
yielding to a freshly created instance for every iteration
step.

The mixed in methods from the Enumerable module rely on this method.
Iterates over all instances starting with the first ( rank == 0 ) ranked instance and ending with the last ( rank == #last ) ranked instance while yielding to a freshly created instance for every iteration step . The mixed in methods from the Enumerable module rely on this method .
def each 
      0.upto(last) do |r|
        klon = clone
        klon.rank = r
        yield klon
      end
      self
    end
def each 0 . upto ( last ) do | r | klon = clone klon . rank = r yield klon end self end
Iterates over all instances starting with the
first (<code>rank == 0</code>) ranked instance and ending with the
last (<code>rank == #last</code>) ranked instance while
yielding to a freshly created instance for every iteration
step.
Iterates over all instances starting with the first ( <code > rank == 0< / code > ) ranked instance and ending with the last ( <code > rank == #last< / code > ) ranked instance while yielding to a freshly created instance for every iteration step .
# :yields: perm