goto_string 0.1.3 → 0.1.4

data/History.txt

@@ -1,4 +1,8 @@
-== 0.1.2 / 2007-07-20
+== 0.1.4 / 2007-08-17
+
+* fixed fencepost error that allowed unmatched character at the end of a pattern to return a match
+
+== 0.1.3 / 2007-07-20
 
 * doc patch
 

data/README.txt

@@ -22,11 +22,11 @@ goto_string is a small library that implements a substring matching and ranking
   
   Each match is itself an array, containing the following elements:
   
-    [ "matched string", "original candidate", rank, [["substring_1", offset], ["substring_2", offset], ... ] ]
+    [ "original candidate", "matched string", rank, [["substring_1", offset], ["substring_2", offset], ... ] ]
   
   You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates:
   
-    GotoString::Matcher.matching( "goto", Project.find(:all) ) do |p|
+    GotoString::Matcher.match( "goto", Project.find(:all) ) do |p|
       p.name
     end
   

data/Rakefile

@@ -3,7 +3,7 @@ require 'hoe'
 require './lib/goto_string.rb'
 
 Hoe.new('goto_string', GotoString::VERSION) do |p|
-  p.rubyforge_name = 'goto_string'
+  p.rubyforge_name = 'rails-oceania'
   p.author = 'Max Muermann'
   p.email = 'max@muermann.org'
   p.summary = 'Quicksilver-like partial string matching'

data/lib/goto_string.rb

@@ -2,7 +2,7 @@ require 'enumerator'
 require 'jcode'
 
 module GotoString
-  VERSION = "0.1.3"
+  VERSION = "0.1.4"
   
   class Matcher
     
@@ -50,10 +50,11 @@ module GotoString
             matched_strings.last[0] << s.chr
           end
           
+          s = nil
         end
         
-        next if !pat.empty?
-
+        next if !pat.empty? || s
+        
         sum_positions = 0
         consecutive = 0
 
@@ -79,4 +80,4 @@ module GotoString
     end
     
   end  
-end
+end

data/test/test_goto_string.rb

@@ -12,6 +12,14 @@ class TestGotoString < Test::Unit::TestCase
     assert_equal 'simple', a[2][0]
     assert_equal 'iamapala', a[3][0]
   end
+
+  def test_non_match
+    s = %w( iamapala implementation impl simple nomatch )
+    a = GotoString::Matcher.match 'implx', s
+    assert a
+    assert a.empty?
+  end
+
   
   def test_with_block
     s = %w( iamapala implementation impl simple nomatch )

metadata

@@ -3,15 +3,15 @@ rubygems_version: 0.9.4
 specification_version: 1
 name: goto_string
 version: !ruby/object:Gem::Version 
-  version: 0.1.3
-date: 2007-07-20 00:00:00 +10:00
+  version: 0.1.4
+date: 2007-08-17 00:00:00 +10:00
 summary: Quicksilver-like partial string matching
 require_paths: 
 - lib
 email: max@muermann.org
 homepage: "    by Max Muermann (max@muermann.org)"
-rubyforge_project: goto_string
-description: "== FEATURES/PROBLEMS:  * Partial string matching * The algorithm is not particularly performant  == SYNOPSIS:  require 'goto_string'  s = %w(goto_string is a small library that implements a substring matching and ranking algorithm. The matching and ranking is similar to that found in Quicksilver or TextMate) GotoString::Matcher.match('string', s) #=> [[\"goto_string\", \"goto_string\", 0.679259259259259, [[\"string\", 5]]], [\"substring\", \"substring\", 0.461481481481481, [[\"s\", 0], [\"tring\", 4]]]]  An array is returned which contains one entry for each match. Matches are ordered by rank.  Each match is itself an array, containing the following elements:  [ \"matched string\", \"original candidate\", rank, [[\"substring_1\", offset], [\"substring_2\", offset], ... ] ]  You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates:  GotoString::Matcher.matching( \"goto\", Project.find(:all) ) do |p| p.name end  The resulting matches will contain a reference to the matched string (the project name) as well as the project (the original candidate)  == REQUIREMENTS:  * None"
+rubyforge_project: rails-oceania
+description: "== FEATURES/PROBLEMS:  * Partial string matching * The algorithm is not particularly performant  == SYNOPSIS:  require 'goto_string'  s = %w(goto_string is a small library that implements a substring matching and ranking algorithm. The matching and ranking is similar to that found in Quicksilver or TextMate) GotoString::Matcher.match('string', s) #=> [[\"goto_string\", \"goto_string\", 0.679259259259259, [[\"string\", 5]]], [\"substring\", \"substring\", 0.461481481481481, [[\"s\", 0], [\"tring\", 4]]]]  An array is returned which contains one entry for each match. Matches are ordered by rank.  Each match is itself an array, containing the following elements:  [ \"original candidate\", \"matched string\", rank, [[\"substring_1\", offset], [\"substring_2\", offset], ... ] ]  You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates:  GotoString::Matcher.match( \"goto\", Project.find(:all) ) do |p| p.name end  The resulting matches will contain a reference to the matched string (the project name) as well as the project (the original candidate)  == REQUIREMENTS:  * None"
 autorequire: 
 default_executable: 
 bindir: bin
@@ -58,5 +58,5 @@ dependencies:
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
-        version: 1.2.1
+        version: 1.2.2
     version: