The nature of the algorithm requires that the data end up in arrays. So supporting iterators would just be bolted on to the front.
Do you really need to have entire list at once or does it operate on a window? Or does this change depending on the characterization of the differences?
In reply to Re^3: OO Algorithm::Diff (finally) released (iterators)
by diotalevi
in thread OO Algorithm::Diff (finally) released
by tye
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |