hashdiff_sym 0.3.1

data/lib/hashdiff_sym/util.rb

@@ -0,0 +1,147 @@
+module HashDiffSym
+
+  # @private
+  #
+  # judge whether two objects are similar
+  def self.similar?(a, b, options = {})
+    opts = { :similarity => 0.8 }.merge(options)
+
+    count_a = count_nodes(a)
+    count_b = count_nodes(b)
+    diffs = count_diff diff(a, b, opts)
+
+    if count_a + count_b == 0
+      return true
+    else
+      (1 - diffs.to_f/(count_a + count_b).to_f) >= opts[:similarity]
+    end
+  end
+
+  # @private
+  #
+  # count node differences
+  def self.count_diff(diffs)
+    diffs.inject(0) do |sum, item|
+      old_change_count = count_nodes(item[2])
+      new_change_count = count_nodes(item[3])
+      sum += (old_change_count + new_change_count)
+    end
+  end
+
+  # @private
+  #
+  # count total nodes for an object
+  def self.count_nodes(obj)
+    return 0 unless obj
+
+    count = 0
+    if obj.is_a?(Array)
+      obj.each {|e| count += count_nodes(e) }
+    elsif obj.is_a?(Hash)
+      obj.each {|k, v| count += count_nodes(v) }
+    else
+      return 1
+    end
+
+    count
+  end
+
+  # @private
+  #
+  # decode property path into an array
+  # @param [String] path Property-string
+  # @param [String] delimiter Property-string delimiter
+  #
+  # e.g. "a.b[3].c" => ['a', 'b', 3, 'c']
+  def self.decode_property_path(path, delimiter='.')
+    parts = path.split(delimiter).collect do |part|
+      if part =~ /^(.*)\[(\d+)\]$/
+        if $1.size > 0
+          [import_key($1), $2.to_i]
+        else
+          $2.to_i
+        end
+      else
+        import_key(part)
+      end
+    end
+
+    parts.flatten
+  end
+
+  # @private
+  #
+  # get the node of hash by given path parts
+  def self.node(hash, parts)
+    temp = hash
+    parts.each do |part|
+      temp = temp[part]
+    end
+    temp
+  end
+
+  # @private
+  #
+  # check for equality or "closeness" within given tolerance
+  def self.compare_values(obj1, obj2, options = {})
+    if (options[:numeric_tolerance].is_a? Numeric) &&
+        [obj1, obj2].all? { |v| v.is_a? Numeric }
+      return (obj1 - obj2).abs <= options[:numeric_tolerance]
+    end
+
+    if options[:strip] == true
+      obj1 = obj1.strip if obj1.respond_to?(:strip)
+      obj2 = obj2.strip if obj2.respond_to?(:strip)
+    end
+
+    if options[:case_insensitive] == true
+      obj1 = obj1.downcase if obj1.respond_to?(:downcase)
+      obj2 = obj2.downcase if obj2.respond_to?(:downcase)
+    end
+
+    obj1 == obj2
+  end
+
+  # @private
+  #
+  # check if objects are comparable
+  def self.comparable?(obj1, obj2, strict = true)
+    [Array, Hash].each do |type|
+      return true if obj1.is_a?(type) && obj2.is_a?(type)
+    end
+    return true if !strict && obj1.is_a?(Numeric) && obj2.is_a?(Numeric)
+    obj1.is_a?(obj2.class) && obj2.is_a?(obj1.class)
+  end
+
+  # @private
+  #
+  # try custom comparison
+  def self.custom_compare(method, key, obj1, obj2)
+    if method
+      res = method.call(key, obj1, obj2)
+
+      # nil != false here
+      if res == false
+        return [['~', key, obj1, obj2]]
+      elsif res == true
+        return []
+      end
+    end
+  end
+
+  def self.export_key(key)
+    if key.class == Symbol
+      ":#{key}"
+    else
+      key
+    end
+  end
+
+  def self.import_key(key)
+    if key[0] == ":"
+      key[1..-1].to_sym
+    else
+      key
+    end
+  end
+end

data/lib/hashdiff_sym/version.rb

@@ -0,0 +1,3 @@
+module HashDiffSym
+  VERSION = '0.3.1'
+end

data/lib/hashdiff_sym.rb

@@ -0,0 +1,5 @@
+require 'hashdiff_sym/util'
+require 'hashdiff_sym/lcs'
+require 'hashdiff_sym/diff'
+require 'hashdiff_sym/patch'
+require 'hashdiff_sym/version'

data/spec/hashdiff_sym/best_diff_spec.rb

@@ -0,0 +1,65 @@
+require 'spec_helper'
+
+describe HashDiffSym do
+  it "should be able to best diff" do
+    a = {'x' => [{'a' => 1, 'c' => 3, 'e' => 5}, {'y' => 3}]}
+    b = {'x' => [{'a' => 1, 'b' => 2, 'e' => 5}] }
+
+    diff = HashDiffSym.best_diff(a, b)
+    diff.should == [["-", "x[0].c", 3], ["+", "x[0].b", 2], ["-", "x[1]", {"y"=>3}]]
+  end
+
+  it "should use custom delimiter when provided" do
+    a = {'x' => [{'a' => 1, 'c' => 3, 'e' => 5}, {'y' => 3}]}
+    b = {'x' => [{'a' => 1, 'b' => 2, 'e' => 5}] }
+
+    diff = HashDiffSym.best_diff(a, b, :delimiter => "\t")
+    diff.should == [["-", "x[0]\tc", 3], ["+", "x[0]\tb", 2], ["-", "x[1]", {"y"=>3}]]
+  end
+
+  it "should use custom comparison when provided" do
+    a = {'x' => [{'a' => 'foo', 'c' => 'goat', 'e' => 'snake'}, {'y' => 'baz'}]}
+    b = {'x' => [{'a' => 'bar', 'b' => 'cow', 'e' => 'puppy'}] }
+
+    diff = HashDiffSym.best_diff(a, b) do |path, obj1, obj2|
+      case path
+      when /^x\[.\]\..$/
+        obj1.length == obj2.length if obj1 and obj2
+      end
+    end
+
+    diff.should == [["-", "x[0].c", 'goat'], ["+", "x[0].b", 'cow'], ["-", "x[1]", {"y"=>'baz'}]]
+  end
+
+  it "should be able to best diff array in hash" do
+    a = {"menu" => {
+      "id" => "file",
+      "value" => "File",
+      "popup" => {
+        "menuitem" => [
+          {"value" => "New", "onclick" => "CreateNewDoc()"},
+          {"value" => "Close", "onclick" => "CloseDoc()"}
+        ]
+      }
+    }}
+
+    b = {"menu" => {
+      "id" => "file 2",
+      "value" => "File",
+      "popup" => {
+        "menuitem" => [
+          {"value" => "New1", "onclick" => "CreateNewDoc()"},
+          {"value" => "Open", "onclick" => "OpenDoc()"},
+          {"value" => "Close", "onclick" => "CloseDoc()"}
+        ]
+      }
+    }}
+
+    diff = HashDiffSym.best_diff(a, b)
+    diff.should == [
+      ['~', 'menu.id', 'file', 'file 2'],
+      ['~', 'menu.popup.menuitem[0].value', 'New', 'New1'],
+      ['+', 'menu.popup.menuitem[1]', {"value" => "Open", "onclick" => "OpenDoc()"}]
+    ]
+  end
+end

data/spec/hashdiff_sym/diff_array_spec.rb

@@ -0,0 +1,60 @@
+require 'spec_helper'
+
+describe HashDiffSym do
+  it "should be able to diff two equal array" do
+    a = [1, 2, 3]
+    b = [1, 2, 3]
+
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == []
+  end
+
+  it "should be able to diff two arrays with one element in common" do
+    a = [1, 2, 3]
+    b = [1, 8, 7]
+
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == [['-', 2, 3], ['-', 1, 2], ['+', 1, 8], ['+', 2, 7]]
+  end
+
+  it "should be able to diff two arrays with nothing in common" do
+    a = [1, 2]
+    b = []
+
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == [['-', 1, 2], ['-', 0, 1]]
+  end
+
+  it "should be able to diff an empty array with an non-empty array" do
+    a = []
+    b = [1, 2]
+
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == [['+', 0, 1], ['+', 1, 2]]
+  end
+
+  it "should be able to diff two arrays with two elements in common" do
+    a = [1, 3, 5, 7]
+    b = [2, 3, 7, 5]
+
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == [['-', 0, 1], ['+', 0, 2], ['+', 2, 7], ['-', 4, 7]]
+  end
+
+  it "should be able to test two arrays with two common elements in different order" do
+    a = [1, 3, 4, 7]
+    b = [2, 3, 7, 5]
+
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == [['-', 0, 1], ['+', 0, 2], ['-', 2, 4], ['+', 3, 5]]
+  end
+
+  it "should be able to diff two arrays with similar elements" do
+    a = [{'a' => 1, 'b' => 2, 'c' => 3, 'd' => 4, 'e' => 5}, 3]
+    b = [1, {'a' => 1, 'b' => 2, 'c' => 3, 'e' => 5}]
+    diff = HashDiffSym.diff_array(a, b)
+    diff.should == [['+', 0, 1], ['-', 2, 3]]
+  end
+
+end
+

data/spec/hashdiff_sym/diff_spec.rb

@@ -0,0 +1,263 @@
+require 'spec_helper'
+
+describe HashDiffSym do
+  it "should be able to diff two empty hashes" do
+    diff = HashDiffSym.diff({}, {})
+    diff.should == []
+  end
+
+  it "should be able to diff an hash with an empty hash" do
+    a = { 'a' => 3, 'b' => 2 }
+    b = {}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [['-', 'a', 3], ['-', 'b', 2]]
+
+    diff = HashDiffSym.diff(b, a)
+    diff.should == [['+', 'a', 3], ['+', 'b', 2]]
+  end
+
+  it "should be able to diff two equal hashes" do
+    diff = HashDiffSym.diff({ 'a' => 2, 'b' => 2}, { 'a' => 2, 'b' => 2 })
+    diff.should == []
+  end
+
+  it "should be able to diff two hashes with equivalent numerics, when strict is false" do
+    diff = HashDiffSym.diff({ 'a' => 2.0, 'b' => 2 }, { 'a' => 2, 'b' => 2.0 }, :strict => false)
+    diff.should == []
+  end
+
+  it "should be able to diff changes in hash value" do
+    diff = HashDiffSym.diff({ 'a' => 2, 'b' => 3, 'c' => " hello" }, { 'a' => 2, 'b' => 4, 'c' => "hello" })
+    diff.should == [['~', 'b', 3, 4], ['~', 'c', " hello", "hello"]]
+  end
+
+  it "should be able to diff changes in hash value which is array" do
+    diff = HashDiffSym.diff({ 'a' => 2, 'b' => [1, 2, 3] }, { 'a' => 2, 'b' => [1, 3, 4]})
+    diff.should == [['-', 'b[1]', 2], ['+', 'b[2]', 4]]
+  end
+
+  it "should be able to diff changes in hash value which is hash" do
+    diff = HashDiffSym.diff({ 'a' => { 'x' => 2, 'y' => 3, 'z' => 4 }, 'b' => { 'x' => 3, 'z' => 45 } },
+                         { 'a' => { 'y' => 3 }, 'b' => { 'y' => 3, 'z' => 30 } })
+    diff.should == [['-', 'a.x', 2], ['-', 'a.z', 4], ['-', 'b.x', 3], ['~', 'b.z', 45, 30], ['+', 'b.y', 3]]
+  end
+
+  it "should be able to diff similar objects in array" do
+    diff = HashDiffSym.best_diff({ 'a' => [{ 'x' => 2, 'y' => 3, 'z' => 4 }, { 'x' => 11, 'y' => 22, 'z' => 33 }], 'b' => { 'x' => 3, 'z' => 45 } },
+                              { 'a' => [{ 'y' => 3 }, { 'x' => 11, 'z' => 33 }], 'b' => { 'y' => 22 } })
+    diff.should == [['-', 'a[0].x', 2], ['-', 'a[0].z', 4], ['-', 'a[1].y', 22], ['-', 'b.x', 3], ['-', 'b.z', 45], ['+', 'b.y', 22]]
+  end
+
+  it 'should be able to diff addition of key value pair' do
+    a = {"a"=>3, "c"=>11, "d"=>45, "e"=>100, "f"=>200}
+    b = {"a"=>3, "c"=>11, "d"=>45, "e"=>100, "f"=>200, "g"=>300}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [['+', 'g', 300]]
+
+    diff = HashDiffSym.diff(b, a)
+    diff.should == [['-', 'g', 300]]
+  end
+
+  it 'should be able to diff value type changes' do
+    a = {"a" => 3}
+    b = {"a" => {"a1" => 1, "a2" => 2}}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should  == [['~', 'a', 3, {"a1" => 1, "a2" => 2}]]
+
+    diff = HashDiffSym.diff(b, a)
+    diff.should  == [['~', 'a', {"a1" => 1, "a2" => 2}, 3]]
+  end
+
+  it "should be able to diff value changes: array <=> []" do
+    a = {"a" => 1, "b" => [1, 2]}
+    b = {"a" => 1, "b" => []}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [['-', 'b[1]', 2], ['-', 'b[0]', 1]]
+  end
+
+  it "should be able to diff value changes: array <=> nil" do
+    a = {"a" => 1, "b" => [1, 2]}
+    b = {"a" => 1, "b" => nil}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [["~", "b", [1, 2], nil]]
+  end
+
+  it "should be able to diff value chagnes: remove array completely" do
+    a = {"a" => 1, "b" => [1, 2]}
+    b = {"a" => 1}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [["-", "b", [1, 2]]]
+  end
+
+  it "should be able to diff value changes: remove whole hash" do
+    a = {"a" => 1, "b" => {"b1" => 1, "b2" =>2}}
+    b = {"a" => 1}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [["-", "b", {"b1"=>1, "b2"=>2}]]
+  end
+
+  it "should be able to diff value changes: hash <=> {}" do
+    a = {"a" => 1, "b" => {"b1" => 1, "b2" =>2}}
+    b = {"a" => 1, "b" => {}}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [['-', 'b.b1', 1], ['-', 'b.b2', 2]]
+  end
+
+  it "should be able to diff value changes: hash <=> nil" do
+    a = {"a" => 1, "b" => {"b1" => 1, "b2" =>2}}
+    b = {"a" => 1, "b" => nil}
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [["~", "b", {"b1"=>1, "b2"=>2}, nil]]
+  end
+
+  it "should be able to diff similar objects in array" do
+    a = [{'a' => 1, 'b' => 2, 'c' => 3, 'd' => 4, 'e' => 5}, 3]
+    b = [1, {'a' => 1, 'b' => 2, 'c' => 3, 'e' => 5}]
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [['-', '[0].d', 4], ['+', '[0]', 1], ['-', '[2]', 3]]
+  end
+
+  it "should be able to diff similar & equal objects in array" do
+    a = [{'a' => 1, 'b' => 2, 'c' => 3, 'd' => 4, 'e' => 5}, {'x' => 5, 'y' => 6, 'z' => 3}, 3]
+    b = [{'a' => 1, 'b' => 2, 'c' => 3, 'e' => 5}, 3]
+
+    diff = HashDiffSym.diff(a, b)
+    diff.should == [["-", "[0].d", 4], ["-", "[1]", {"x"=>5, "y"=>6, "z"=>3}]]
+  end
+
+  it "should use custom delimiter when provided" do
+    a = [{'a' => 1, 'b' => 2, 'c' => 3, 'd' => 4, 'e' => 5}, {'x' => 5, 'y' => 6, 'z' => 3}, 3]
+    b = [{'a' => 1, 'b' => 2, 'c' => 3, 'e' => 5}, 3]
+
+    diff = HashDiffSym.diff(a, b, :similarity => 0.8, :delimiter => "\t")
+    diff.should == [["-", "[0]\td", 4], ["-", "[1]", {"x"=>5, "y"=>6, "z"=>3}]]
+  end
+
+  it "should transform symbols to string correctly" do
+    diff = HashDiffSym.diff({ 'a' => { x: 2, y: 3, z: 4 }, 'b' => { x: 3, z: [1, 2, 3] } },
+                         { 'a' => { y: 3 }, 'b' => { y: 3, z: [2, 3, 4] } })
+    diff.should == [['-', 'a.:x', 2], ['-', 'a.:z', 4], ['-', 'b.:x', 3], ["-", "b.:z[0]", 1], ["+", "b.:z[2]", 4], ['+', 'b.:y', 3]]
+  end
+
+  context 'when :numeric_tolerance requested' do
+    it "should be able to diff changes in hash value" do
+      a = {'a' => 0.558, 'b' => 0.0, 'c' => 0.65, 'd' => 'fin'}
+      b = {'a' => 0.557, 'b' => 'hats', 'c' => 0.67, 'd' => 'fin'}
+
+      diff = HashDiffSym.diff(a, b, :numeric_tolerance => 0.01)
+      diff.should == [["~", "b", 0.0, 'hats'], ["~", "c", 0.65, 0.67]]
+
+      diff = HashDiffSym.diff(b, a, :numeric_tolerance => 0.01)
+      diff.should == [["~", "b", 'hats', 0.0], ["~", "c", 0.67, 0.65]]
+    end
+
+    it "should be able to diff changes in nested values" do
+      a = {'a' => {'x' => 0.4, 'y' => 0.338}, 'b' => [13, 68.03]}
+      b = {'a' => {'x' => 0.6, 'y' => 0.341}, 'b' => [14, 68.025]}
+
+      diff = HashDiffSym.diff(a, b, :numeric_tolerance => 0.01)
+      diff.should == [["~", "a.x", 0.4, 0.6], ["-", "b[0]", 13], ["+", "b[0]", 14]]
+
+      diff = HashDiffSym.diff(b, a, :numeric_tolerance => 0.01)
+      diff.should == [["~", "a.x", 0.6, 0.4], ["-", "b[0]", 14], ["+", "b[0]", 13]]
+    end
+  end
+
+  context 'when :strip requested' do
+    it "should strip strings before comparing" do
+      a = { 'a' => " foo", 'b' => "fizz buzz"}
+      b = { 'a' => "foo", 'b' => "fizzbuzz"}
+      diff = HashDiffSym.diff(a, b, :strip => true)
+      diff.should == [['~', 'b', "fizz buzz", "fizzbuzz"]]
+    end
+
+    it "should strip nested strings before comparing" do
+      a = { 'a' => { 'x' => " foo" }, 'b' => ["fizz buzz", "nerf"] }
+      b = { 'a' => { 'x' => "foo" }, 'b' => ["fizzbuzz", "nerf"] }
+      diff = HashDiffSym.diff(a, b, :strip => true)
+      diff.should == [['-', 'b[0]', "fizz buzz"], ['+', 'b[0]', "fizzbuzz"]]
+    end
+  end
+
+  context 'when :case_insensitive requested' do
+    it "should strip strings before comparing" do
+      a = { 'a' => "Foo", 'b' => "fizz buzz"}
+      b = { 'a' => "foo", 'b' => "fizzBuzz"}
+      diff = HashDiffSym.diff(a, b, :case_insensitive => true)
+      diff.should == [['~', 'b', "fizz buzz", "fizzBuzz"]]
+    end
+
+    it "should ignore case on nested strings before comparing" do
+      a = { 'a' => { 'x' => "Foo" }, 'b' => ["fizz buzz", "nerf"] }
+      b = { 'a' => { 'x' => "foo" }, 'b' => ["fizzbuzz", "nerf"] }
+      diff = HashDiffSym.diff(a, b, :case_insensitive => true)
+      diff.should == [['-', 'b[0]', "fizz buzz"], ['+', 'b[0]', "fizzbuzz"]]
+    end
+  end
+
+  context 'when both :strip and :numeric_tolerance requested' do
+    it 'should apply filters to proper object types' do
+      a = { 'a' => " foo", 'b' => 35, 'c' => 'bar', 'd' => 'baz' }
+      b = { 'a' => "foo", 'b' => 35.005, 'c' => 'bar', 'd' => 18.5}
+      diff = HashDiffSym.diff(a, b, :strict => false, :numeric_tolerance => 0.01, :strip => true)
+      diff.should == [['~', 'd', "baz", 18.5]]
+    end
+  end
+
+  context "when both :strip and :case_insensitive requested" do
+    it "should apply both filters to strings" do
+      a = { 'a' => " Foo", 'b' => "fizz buzz"}
+      b = { 'a' => "foo", 'b' => "fizzBuzz"}
+      diff = HashDiffSym.diff(a, b, :case_insensitive => true, :strip => true)
+      diff.should == [['~', 'b', "fizz buzz", "fizzBuzz"]]
+    end
+  end
+
+  context 'with custom comparison' do
+    let(:a) { { 'a' => 'car', 'b' => 'boat', 'c' => 'plane'} }
+    let(:b) { { 'a' => 'bus', 'b' => 'truck', 'c' => ' plan'} }
+
+    it 'should compare using proc specified in block' do
+      diff = HashDiffSym.diff(a, b) do |prefix, obj1, obj2|
+        case prefix
+        when /a|b|c/
+          obj1.length == obj2.length
+        end
+      end
+      diff.should == [['~', 'b', 'boat', 'truck']]
+    end
+
+    it 'should yield added keys' do
+      x = { 'a' => 'car', 'b' => 'boat'}
+      y = { 'a' => 'car' }
+
+      diff = HashDiffSym.diff(x, y) do |prefix, obj1, obj2|
+        case prefix
+        when /b/
+          true
+        end
+      end
+      diff.should == []
+    end
+
+    it 'should compare with both proc and :strip when both provided' do
+      diff = HashDiffSym.diff(a, b, :strip => true) do |prefix, obj1, obj2|
+        case prefix
+        when 'a'
+          obj1.length == obj2.length
+        end
+      end
+      diff.should == [['~', 'b', 'boat', 'truck'], ['~', 'c', 'plane', ' plan']]
+    end
+  end
+end

data/spec/hashdiff_sym/lcs_spec.rb

@@ -0,0 +1,75 @@
+require 'spec_helper'
+
+describe HashDiffSym do
+  it "should be able to find LCS between two equal array" do
+    a = [1, 2, 3]
+    b = [1, 2, 3]
+
+    lcs = HashDiffSym.lcs(a, b)
+    lcs.should == [[0, 0], [1, 1], [2, 2]]
+  end
+
+  it "should be able to find LCS between two close arrays" do
+    a = [1.05, 2, 3.25]
+    b = [1.06, 2, 3.24]
+
+    lcs = HashDiffSym.lcs(a, b, :numeric_tolerance => 0.1)
+    lcs.should == [[0, 0], [1, 1], [2, 2]]
+  end
+
+  it "should strip strings when finding LCS if requested" do
+    a = ['foo', 'bar', 'baz']
+    b = [' foo', 'bar', 'zab']
+
+    lcs = HashDiffSym.lcs(a, b, :strip => true)
+    lcs.should == [[0, 0], [1, 1]]
+  end
+
+  it "should be able to find LCS with one common elements" do
+    a = [1, 2, 3]
+    b = [1, 8, 7]
+
+    lcs = HashDiffSym.lcs(a, b)
+    lcs.should == [[0, 0]]
+  end
+
+  it "should be able to find LCS with two common elements" do
+    a = [1, 3, 5, 7]
+    b = [2, 3, 7, 5]
+
+    lcs = HashDiffSym.lcs(a, b)
+    lcs.should == [[1, 1], [2, 3]]
+  end
+
+  it "should be able to find LCS with two close elements" do
+    a = [1, 3.05, 5, 7]
+    b = [2, 3.06, 7, 5]
+
+    lcs = HashDiffSym.lcs(a, b, :numeric_tolerance => 0.1)
+    lcs.should == [[1, 1], [2, 3]]
+  end
+
+  it "should be able to find LCS with two common elements in different ordering" do
+    a = [1, 3, 4, 7]
+    b = [2, 3, 7, 5]
+
+    lcs = HashDiffSym.lcs(a, b)
+    lcs.should == [[1, 1], [3, 2]]
+  end
+
+  it "should be able to find LCS with a similarity value" do
+    a = [
+          {"value" => "New", "onclick" => "CreateNewDoc()"},
+          {"value" => "Close", "onclick" => "CloseDoc()"}
+        ]
+    b = [
+          {"value" => "New1", "onclick" => "CreateNewDoc()"},
+          {"value" => "Open", "onclick" => "OpenDoc()"},
+          {"value" => "Close", "onclick" => "CloseDoc()"}
+        ]
+
+    lcs = HashDiffSym.lcs(a, b, :similarity => 0.5)
+    lcs.should == [[0, 0], [1, 2]]
+  end
+end
+