Contents

### 0.3.2 / 2010-11-28

* Added {TDiff#tdiff_recursive} to only handle recursively traversing
  and diffing the children nodes.
* Added {TDiff::Unordered#tdiff_recursive_unordered} to only handle
  recursively traversing and diffing the children nodes, without respecting
  the order of the nodes.

### 0.3.1 / 2010-11-28

* Fixed a typo in {TDiff::Unordered#tdiff_unordered}, which was causing
  all nodes to be marked as added.

### 0.3.0 / 2010-11-15

* Changed {TDiff#tdiff_equal} to compare `self` with another node.

### 0.2.0 / 2010-11-14

* Added {TDiff::Unordered}.

### 0.1.0 / 2010-11-13

* Initial release:
  * Provides the {TDiff} mixin.
  * Allows custom node equality and traversal logic by overriding the
    {TDiff#tdiff_equal} and {TDiff#tdiff_each_child} methods.
  * Implements the [Longest Common Subsequence (LCS)](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem).

Version data entries

1 entries across 1 versions & 1 rubygems

Version	Path
tdiff-0.3.2	ChangeLog.md