Implementation of the LCS using dynamic programming.
The interface to classes that computes the longest common subsequence between two sequences of elements
Implementation of the patience algorithm [1] to compute the longest common subsequence
Implementation of the patience algorithm [1] to compute the longest common subsequence
[1] http://alfedenzo.livejournal.com/170301.html
A parsed Json pointer as per RFC-6901.
This package contains an implementation of Json JsonPatch, according to [RFC-6902](http://tools.ietf.org/html/rfc6902)