facets 1.7.0 → 1.7.30

data/lib/facets/core/enumerable/eachn.rb

@@ -0,0 +1,41 @@
+#--
+# Martin DeMello
+#++
+
+require 'enumerator'
+
+module Enumerable
+  def eachn(&block)
+    n = block.arity.abs
+    each_slice(n) {|i| block.call(*i)}
+  end
+end
+
+
+#  _____         _
+# |_   _|__  ___| |_
+#   | |/ _ \/ __| __|
+#   | |  __/\__ \ |_
+#   |_|\___||___/\__|
+#
+=begin test
+
+  require 'test/unit'
+
+  class TCEnumerable < Test::Unit::TestCase
+
+    def test_eachn
+      x = []
+      [1,2,3,4].eachn{ |a,b| x << [a,b] }
+      o = [[1,2],[3,4]]
+      assert_equal( o, x )
+
+      x = []
+      [1,2,3,4,5].eachn{ |a,b,c| x << [a,b,c] }
+      o = [[1,2,3],[4,5,nil]]
+      assert_equal( o, x )
+    end
+
+  end
+
+=end

data/lib/facets/core/file/self/null.rb

@@ -0,0 +1,17 @@
+#--
+# Cedit goes to Daniel Burger
+#++
+
+def File.null
+  case RUBY_PLATFORM
+  when /mswin/i
+   'NUL'
+  when /amiga/i
+   'NIL:'
+  when /openvms/i
+   'NL:'
+  else
+   '/dev/null'
+  end 
+end
+

data/lib/facets/core/filetest/self/root.rb

@@ -0,0 +1,13 @@
+#--
+# Special Thanks to Jeffrey Schwab.
+#++
+
+# Is the specified directory the root directory?
+
+def FileTest.root?(dir)
+  pth = File.expand_path(dir)
+  return true if pth == '/'
+  return true if pth =~ /^(\w:)?\/$/
+  false
+end
+

data/lib/facets/core/hash/delete_at.rb

@@ -0,0 +1,10 @@
+#--
+# Credit goes to Daniel Schierbeck
+#++
+
+class Hash
+
+  alias :delete_at :delete
+
+end
+

data/lib/facets/core/hash/delete_values.rb

@@ -0,0 +1,20 @@
+#--
+# Credit goes to Daniel Schierbeck
+#++
+
+class Hash
+
+  # Minor modification to Ruby's Hash#delete method
+  # allowing it to take multiple keys.
+  #
+  #   hsh = { :a => 1, :b => 2 }
+  #   hsh.delete_values(1)
+  #   hsh  #=> { :b => 2 }
+  #
+
+  def delete_values(*values)
+    keys.map{|key| delete(key) if values.include?(fetch(key)) }
+  end
+
+end
+

data/lib/facets/core/hash/delete_values_at.rb

@@ -0,0 +1,24 @@
+#--
+# Credit goes to Daniel Schierbeck
+#++
+
+class Hash
+
+  # Minor modification to Ruby's Hash#delete method
+  # allowing it to take multiple keys.
+  #
+  # This works niely with hahs#[] and Hash#[]= facets.
+  #
+  #    hsh[:a, :b, :c] = 1, 2, 3
+  #    
+  #    a, b, c = hsh.delete_values_at(:a, :b, :c)
+  #    
+  #    [a, b, c]  #=> [1, 2, 3]
+  #    hsh        #=> {}
+  #
+  def delete_values_at(*keys, &block)
+    keys.map{|key| delete(key, &block) }
+  end
+
+end
+

data/lib/facets/core/hash/each.rb

@@ -1,3 +1,10 @@
+#--
+# Special thanks to Daniel Schierbeck.
+#++
+
+# TODO Deprecate Hash#each
+warn "Hash#each is being deprecated"
+
 
 class Hash
 
@@ -15,17 +22,25 @@ class Hash
   # WARNING! Use with caution. Methods from other libraries 
   # may depend on the old behavior, expecting a two element 
   # array to be passed into a single block argument.
-  #
-  def each(&yld)
-    case yld.arity
-    when 0
-    when 1
-      each_value{|v| yield(v)}
-    else
-      each_pair{|k,v| yld.call(k,v)}
-    end
-    self
-  end
+
+  def each(&block)
+     if block.arity < 2
+       each_value(&block)
+     else
+       each_pair(&block)
+     end
+   end 
+
+# def each(&yld)
+#   case yld.arity
+#   when 0
+#   when 1
+#     each_value{|v| yield(v)}
+#   else
+#     each_pair{|k,v| yld.call(k,v)}
+#   end
+#   self
+# end
 
 end
 

data/lib/facets/core/kernel/load_local.rb

@@ -0,0 +1,26 @@
+
+module Kernel
+
+  private
+
+  # Load file from same dir as calling script.
+  #
+  #   load_local 'templib'
+  #
+  def load_local( fname, safe=nil )
+    #fdir = File.expand_path( File.dirname( caller[0] ) )
+    fdir = File.dirname( caller[0] )
+    load( File.join( fdir, fname ), safe )
+  end
+
+end
+
+
+#  _____         _
+# |_   _|__  ___| |_
+#   | |/ _ \/ __| __|
+#   | |  __/\__ \ |_
+#   |_|\___||___/\__|
+#
+# NO RESONABLE WAY TO DO
+# (THAT I CAN THINK OF)

data/lib/facets/core/nilclass/to_path.rb

@@ -0,0 +1,18 @@
+
+def NilClass
+
+  def to_path
+    case RUBY_PLATFORM
+    when /mswin/i
+     'NUL'
+    when /amiga/i
+     'NIL:'
+    when /openvms/i
+     'NL:'
+    else
+     '/dev/null'
+    end 
+  end
+
+end
+

data/lib/facets/core/symbol/to_s.rb

@@ -0,0 +1,10 @@
+class Symbol
+
+  # Same functionality as before, just a touch more efficient.
+
+  def to_s
+    @to_s || (@to_s = id2name.freeze)
+  end
+
+end
+

data/lib/facets/more/association.rb

@@ -49,7 +49,7 @@
 #
 # The method :>> is used to construct the association.
 # It is a rarely used method so it is generally available.
-# But you can't use an Association while extending the
+# But you can't use an Association while extending
 # any of the following classes becuase they use #>> for
 # other things.
 #

data/lib/facets/more/cache.rb

@@ -0,0 +1,81 @@
+# = once.rb
+#
+# == Copyright (c) 2004 Thomas Sawyer
+#
+#   Ruby License
+#
+#   This module is free software. You may use, modify, and/or redistribute this
+#   software under the same terms as Ruby.
+#
+#   This program is distributed in the hope that it will be useful, but WITHOUT
+#   ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+#   FOR A PARTICULAR PURPOSE.
+#
+# == Author(s)
+#
+# * Thomas Sawyer
+
+# Author::    Erik Veenstra, Thomas Sawyer
+# Copyright:: Copyright (c) 2006 Erik Veenstra, Thomas Sawyer
+# License::   Ruby License
+
+# = Cache
+#
+# Cache objects are a kind of "delegator-with-cache".
+#
+# == Usage
+#
+#   class X
+#     def initialize ; @tick = 0 ; end
+#     def tick; @tick + 1; end
+#     def cached; @cache ||= Cache.new( self ) ; end
+#   end
+#
+#   x = X.new
+#   x.tick  #=> 1
+#   x.cached.tick  #=> 2
+#   x.tick  #=> 3
+#   x.cached.tick  #=> 2
+#   x.tick  #=> 4
+#   x.cached.tick  #=> 2
+#
+# You can also use to cache a collections of objects to gain code
+# speed ups.
+#
+#   points = points.collect{|point| Cache.cache(point)}
+#
+# After our algorithm has finished using points, we want to get rid of
+# these Cache objects. That's easy:
+#
+#    points = points.collect{|point| point.self }
+#
+# Or if you prefer (it is ever so slightly safer):
+#
+#    points = points.collect{|point| Cache.uncache(point)}
+#
+
+class Cache
+
+  private :class, :clone, :display, :type, :method, :to_a, :to_s
+
+  def initialize(object)
+    @self = object
+    @cache = {}
+  end
+
+  def method_missing(method_name, *args, &block)
+    # Not thread-safe! Speed is important in caches... ;]
+    @cache[[method_name, args, block]] ||= @self.__send__(method_name, *args, &block)
+  end
+
+  def self; @self; end
+
+  def self.cache(object)
+    Cache.new(object)
+  end
+
+  def self.uncache(cached_object)
+    cached_object.self
+  end
+
+end

data/lib/facets/more/command.rb

@@ -207,7 +207,17 @@ class Console::Command
     end
 
   rescue ArgumentError => ex
-    $stderr << "Could not run #{args.first}. #{ex.message.capitalize.chomp('.')}.\n"
+    if $TRACE
+      raise ex
+    else
+      $stderr << "Could not run #{args.first}. #{ex.message.capitalize.chomp('.')}.\n"
+    end
+  end
+
+  #
+
+  def __trace
+    $TRACE = true
   end
 
 #   # We include a module here so you can define your own help command

data/lib/facets/more/doublemetaphone.rb

@@ -0,0 +1,371 @@
+#
+# Ruby implementation of the Double Metaphone algorithm by Lawrence Philips,
+# originally published in the June 2000 issue of C/C++ Users Journal.
+#
+# Based on Stephen Woodbridge's PHP version - http://swoodbridge.com/DoubleMetaPhone/
+#
+module DoubleMetaphone
+
+  # Returns the primary and secondary double metaphone tokens
+  # (the secondary will be nil if equal to the primary).
+  def self.[](str)
+    return memo[str]
+  end
+
+
+  private
+
+  def self.memo
+    @memo ||= Hash.new { |memo, str| memo[str] = double_metaphone(str) }
+  end
+  
+  def self.double_metaphone(str)
+    primary, secondary, current = '', '', 0
+    original, length, last = "#{str}     ".upcase, str.length, str.length - 1
+    if /^GN|KN|PN|WR|PS$/ =~ original[0, 2]
+      current += 1
+    end
+    if 'X' == original[0, 1]
+      primary << 'S'
+      secondary << 'S'
+      current += 1
+    end
+    while primary.length < 4 || secondary.length < 4
+      break if current > str.length
+      a, b, c = lookup(original, current, length, last)
+      primary << a if a
+      secondary << b if b
+      current += c if c
+    end
+    primary, secondary = primary[0, 4], secondary[0, 4]
+    return primary, (primary == secondary ? nil : secondary)
+  end
+
+  def self.slavo_germanic?(str)
+    /W|K|CZ|WITZ/ =~ str
+  end
+
+  def self.vowel?(str)
+    /^A|E|I|O|U|Y$/ =~ str
+  end
+
+  def self.lookup(str, pos, length, last)
+    case str[pos, 1]
+      when /^A|E|I|O|U|Y$/
+        if 0 == pos
+          return 'A', 'A', 1
+        else
+          return nil, nil, 1
+        end
+      when 'B'
+        return 'P', 'P', ('B' == str[pos + 1, 1] ? 2 : 1)
+      when 'Ç'
+        return 'S', 'S', 1
+      when 'C'
+        if pos > 1 &&
+          !vowel?(str[pos - 2, 1]) &&
+          'ACH' == str[pos - 1, 3] &&
+          str[pos + 2, 1] != 'I' && (
+            str[pos + 2, 1] != 'E' ||
+            str[pos - 2, 6] =~ /^(B|M)ACHER$/
+          ) then
+          return 'K', 'K', 2
+        elsif 0 == pos && 'CAESAR' == str[pos, 6]
+          return 'S', 'S', 2
+        elsif 'CHIA' == str[pos, 4]
+          return 'K', 'K', 2
+        elsif 'CH' == str[pos, 2]
+          if 0 == pos && 'CHAE' == str[pos, 4]
+            return 'K', 'X', 2
+          elsif 0 == pos && (
+              ['HARAC', 'HARIS'].include?(str[pos + 1, 5]) ||
+              ['HOR', 'HYM', 'HIA', 'HEM'].include?(str[pos + 1, 3])
+            ) && str[0, 5] != 'CHORE' then
+            return 'K', 'K', 2
+          elsif ['VAN ','VON '].include?(str[0, 4]) ||
+                'SCH' == str[0, 3] ||
+                ['ORCHES','ARCHIT','ORCHID'].include?(str[pos - 2, 6]) ||
+                ['T','S'].include?(str[pos + 2, 1]) || (
+                  ((0 == pos) || ['A','O','U','E'].include?(str[pos - 1, 1])) &&
+                  ['L','R','N','M','B','H','F','V','W',' '].include?(str[pos + 2, 1])
+                ) then
+            return 'K', 'K', 2
+          elsif pos > 0
+            return ('MC' == str[0, 2] ? 'K' : 'X'), 'K', 2
+          else
+            return 'X', 'X', 2
+          end
+        elsif 'CZ' == str[pos, 2] && 'WICZ' != str[pos - 2, 4]
+          return 'S', 'X', 2
+        elsif 'CIA' == str[pos + 1, 3]
+          return 'X', 'X', 3
+        elsif 'CC' == str[pos, 2] && !(1 == pos && 'M' == str[0, 1])
+          if /^I|E|H$/ =~ str[pos + 2, 1] && 'HU' != str[pos + 2, 2]
+            if (1 == pos && 'A' == str[pos - 1, 1]) ||
+              /^UCCE(E|S)$/ =~ str[pos - 1, 5] then
+              return 'KS', 'KS', 3
+            else
+              return 'X', 'X', 3
+            end
+          else
+            return 'K', 'K', 2
+          end
+        elsif /^C(K|G|Q)$/ =~ str[pos, 2]
+          return 'K', 'K', 2
+        elsif /^C(I|E|Y)$/ =~ str[pos, 2]
+          return 'S', (/^CI(O|E|A)$/ =~ str[pos, 3] ? 'X' : 'S'), 2
+        else
+          if /^ (C|Q|G)$/ =~ str[pos + 1, 2]
+            return 'K', 'K', 3
+          else
+            return 'K', 'K', (/^C|K|Q$/ =~ str[pos + 1, 1] && !(['CE','CI'].include?(str[pos + 1, 2])) ? 2 : 1)
+          end
+        end
+      when 'D'
+        if 'DG' == str[pos, 2]
+          if /^I|E|Y$/ =~ str[pos + 2, 1]
+            return 'J', 'J', 3
+          else
+            return 'TK', 'TK', 2
+          end
+        else
+          return 'T', 'T', (/^D(T|D)$/ =~ str[pos, 2] ? 2 : 1)
+        end
+      when 'F'
+        return 'F', 'F', ('F' == str[pos + 1, 1] ? 2 : 1)
+      when 'G'
+        if 'H' == str[pos + 1, 1]
+          if pos > 0 && !vowel?(str[pos - 1, 1])
+            return 'K', 'K', 2
+          elsif 0 == pos
+            if 'I' == str[pos + 2, 1]
+              return 'J', 'J', 2
+            else
+              return 'K', 'K', 2
+            end
+          elsif (pos > 1 && /^B|H|D$/ =~ str[pos - 2, 1]) ||
+                (pos > 2 && /^B|H|D$/ =~ str[pos - 3, 1]) ||
+                (pos > 3 && /^B|H$/   =~ str[pos - 4, 1])
+            return nil, nil, 2
+          else
+            if (pos > 2 && 'U' == str[pos - 1, 1] && /^C|G|L|R|T$/ =~ str[pos - 3, 1])
+              return 'F', 'F', 2
+            elsif pos > 0 && 'I' != str[pos - 1, 1]
+              return 'K', 'K', 2
+            else
+              return nil, nil, 2
+            end
+          end
+        elsif 'N' == str[pos + 1, 1]
+          if 1 == pos && vowel?(str[0, 1]) && !slavo_germanic?(str)
+            return 'KN', 'N', 2
+          else
+            if 'EY' != str[pos + 2, 2] && 'Y' != str[pos + 1, 1] && !slavo_germanic?(str)
+              return 'N', 'KN', 2
+            else
+              return 'KN', 'KN', 2
+            end
+          end
+        elsif 'LI' == str[pos + 1, 2] && !slavo_germanic?(str)
+          return 'KL', 'L', 2
+        elsif 0 == pos && ('Y' == str[pos + 1, 1] || /^(E(S|P|B|L|Y|I|R)|I(B|L|N|E))$/ =~ str[pos + 1, 2])
+          return 'K', 'J', 2
+        elsif (('ER' == str[pos + 1, 2] || 'Y' == str[pos + 1, 1]) &&
+               /^(D|R|M)ANGER$/ !~ str[0, 6] &&
+               /^E|I$/ !~ str[pos - 1, 1] &&
+               /^(R|O)GY$/ !~ str[pos - 1, 3])
+          return 'K', 'J', 2
+        elsif /^E|I|Y$/ =~ str[pos + 1, 1] || /^(A|O)GGI$/ =~ str[pos - 1, 4]
+          if (/^V(A|O)N $/ =~ str[0, 4] || 'SCH' == str[0, 3]) || 'ET' == str[pos + 1, 2]
+            return 'K', 'K', 2
+          else
+            if 'IER ' == str[pos + 1, 4]
+              return 'J', 'J', 2
+            else
+              return 'J', 'K', 2
+            end
+          end
+        elsif 'G' == str[pos + 1, 1]
+          return 'K', 'K', 2
+        else
+          return 'K', 'K', 1
+        end
+      when 'H'
+        if (0 == pos || vowel?(str[pos - 1, 1])) && vowel?(str[pos + 1, 1])
+          return 'H', 'H', 2
+        else
+          return nil, nil, 1
+        end
+      when 'J'
+        if 'JOSE' == str[pos, 4] || 'SAN ' == str[0, 4]
+          if (0 == pos && ' ' == str[pos + 4, 1]) || 'SAN ' == str[0, 4]
+            return 'H', 'H', 1
+          else
+            return 'J', 'H', 1
+          end
+        else
+          current = ('J' == str[pos + 1, 1] ? 2 : 1)
+          
+          if 0 == pos && 'JOSE' != str[pos, 4]
+            return 'J', 'A', current
+          else
+            if vowel?(str[pos - 1, 1]) && !slavo_germanic?(str) && /^A|O$/ =~ str[pos + 1, 1]
+              return 'J', 'H', current
+            else
+              if last == pos
+                return 'J', nil, current
+              else
+                if /^L|T|K|S|N|M|B|Z$/ !~ str[pos + 1, 1] && /^S|K|L$/ !~ str[pos - 1, 1]
+                  return 'J', 'J', current
+                else
+                  return nil, nil, current
+                end
+              end
+            end
+          end
+        end
+      when 'K'
+        return 'K', 'K', ('K' == str[pos + 1, 1] ? 2 : 1)
+      when 'L'
+        if 'L' == str[pos + 1, 1]
+          if (((length - 3) == pos && /^(ILL(O|A)|ALLE)$/ =~ str[pos - 1, 4]) ||
+              ((/^(A|O)S$/ =~ str[last - 1, 2] || /^A|O$/ =~ str[last, 1]) && 'ALLE' == str[pos - 1, 4]))
+            return 'L', nil, 2
+          else
+            return 'L', 'L', 2
+          end
+        else
+          return 'L', 'L', 1
+        end
+      when 'M'
+        if ('UMB' == str[pos - 1, 3] &&
+            ((last - 1) == pos || 'ER' == str[pos + 2, 2])) || 'M' == str[pos + 1, 1]
+          return 'M', 'M', 2
+        else
+          return 'M', 'M', 1
+        end
+      when 'N'
+        return 'N', 'N', ('N' == str[pos + 1, 1] ? 2 : 1)
+      when 'Ñ'
+        return 'N', 'N', 1
+      when 'P'
+        if 'H' == str[pos + 1, 1]
+          return 'F', 'F', 2
+        else
+          return 'P', 'P', (/^P|B$/ =~ str[pos + 1, 1] ? 2 : 1)
+        end
+      when 'Q'
+        return 'K', 'K', ('Q' == str[pos + 1, 1] ? 2 : 1)
+      when 'R'
+        current = ('R' == str[pos + 1, 1] ? 2 : 1)
+        
+        if last == pos && !slavo_germanic?(str) && 'IE' == str[pos - 2, 2] && /^M(E|A)$/ !~ str[pos - 4, 2]
+          return nil, 'R', current
+        else
+          return 'R', 'R', current
+        end
+      when 'S'
+        if /^(I|Y)SL$/ =~ str[pos - 1, 3]
+          return nil, nil, 1
+        elsif 0 == pos && 'SUGAR' == str[pos, 5]
+          return 'X', 'S', 1
+        elsif 'SH' == str[pos, 2]
+          if /^H(EIM|OEK|OLM|OLZ)$/ =~ str[pos + 1, 4]
+            return 'S', 'S', 2
+          else
+            return 'X', 'X', 2
+          end
+        elsif /^SI(O|A)$/ =~ str[pos, 3] || 'SIAN' == str[pos, 4]
+          return 'S', (slavo_germanic?(str) ? 'S' : 'X'), 3
+        elsif (0 == pos && /^M|N|L|W$/ =~ str[pos + 1, 1]) || 'Z' == str[pos + 1, 1]
+          return 'S', 'X', ('Z' == str[pos + 1, 1] ? 2 : 1)
+        elsif 'SC' == str[pos, 2]
+          if 'H' == str[pos + 2, 1]
+            if /^OO|ER|EN|UY|ED|EM$/ =~ str[pos + 3, 2]
+              return (/^E(R|N)$/ =~ str[pos + 3, 2] ? 'X' : 'SK'), 'SK', 3
+            else
+              return 'X', ((0 == pos && !vowel?(str[3, 1]) && ('W' != str[pos + 3, 1])) ? 'S' : 'X'), 3
+            end
+          elsif /^I|E|Y$/ =~ str[pos + 2, 1]
+            return 'S', 'S', 3
+          else
+            return 'SK', 'SK', 3
+          end
+        else
+          return (last == pos && /^(A|O)I$/ =~ str[pos - 2, 2] ? nil : 'S'), 'S', (/^S|Z$/ =~ str[pos + 1, 1] ? 2 : 1)
+        end
+      when 'T'
+        if 'TION' == str[pos, 4]
+          return 'X', 'X', 3
+        elsif /^T(IA|CH)$/ =~ str[pos, 3]
+          return 'X', 'X', 3
+        elsif 'TH' == str[pos, 2] || 'TTH' == str[pos, 3]
+          if /^(O|A)M$/ =~ str[pos + 2, 2] || /^V(A|O)N $/ =~ str[0, 4] || 'SCH' == str[0, 3]
+            return 'T', 'T', 2
+          else
+            return '0', 'T', 2
+          end
+        else
+          return 'T', 'T', (/^T|D$/ =~ str[pos + 1, 1] ? 2 : 1)
+        end
+      when 'V'
+        return 'F', 'F', ('V' == str[pos + 1, 1] ? 2 : 1)
+      when 'W'
+        if 'WR' == str[pos, 2]
+          return 'R', 'R', 2
+        end
+        pri, sec = nil, nil
+        if 0 == pos && (vowel?(str[pos + 1, 1]) || 'WH' == str[pos, 2])
+          pri = 'A'
+          sec = vowel?(str[pos + 1, 1]) ? 'F' : 'A'
+        end
+        if (last == pos && vowel?(str[pos - 1, 1])) || 'SCH' == str[0, 3] ||
+            /^EWSKI|EWSKY|OWSKI|OWSKY$/ =~ str[pos - 1, 5]
+          return pri, "#{sec}F", 1
+        elsif /^WI(C|T)Z$/ =~ str[pos, 4]
+          return "#{pri}TS", "#{sec}FX", 4
+        else
+          return pri, sec, 1
+        end
+      when 'X'
+        current = (/^C|X$/ =~ str[pos + 1, 1] ? 2 : 1)
+        if !(last == pos && (/^(I|E)AU$/ =~ str[pos - 3, 3] || /^(A|O)U$/ =~ str[pos - 2, 2]))
+          return 'KS', 'KS', current
+        else
+          return nil, nil, current
+        end
+      when 'Z'
+        if 'H' == str[pos + 1, 1]
+          return 'J', 'J', 2
+        else
+          current = ('Z' == str[pos + 1, 1] ? 2 : 1)
+          if /^Z(O|I|A)$/ =~ str[pos + 1, 2] || (slavo_germanic?(str) && (pos > 0 && 'T' != str[pos - 1, 1]))
+            return 'S', 'TS', current
+          else
+            return 'S', 'S', current
+          end
+        end
+      else
+        return nil, nil, 1
+    end
+  end # def lookup
+
+end # module DoubleMetaphone
+
+if __FILE__ == $0
+  require 'test/unit'
+  require 'rubygems'
+  require 'fastercsv'  
+
+  # 1218 tests, 2436 assertions
+  class DoubleMetaphoneTest < Test::Unit::TestCase
+    FasterCSV.read('double_metaphone_test_data.csv', :col_sep => ', ').each_with_index do |row, i|
+      primary, secondary = DoubleMetaphone[row[0]]
+
+      define_method("test_#{i}") do
+        assert_equal row[1], primary
+        assert_equal row[2], (secondary.nil?? primary : secondary)
+      end
+    end
+  end
+end