úÎŹ Safe-Inferred%An element of a computed difference. @Value taken from both lists. Both values are provided, in case : your type has a non-structural definition of equality. Value taken from the "new" list, i.e. right argument to  Value taken from the "old" list, i.e. left argument to  DGiven: a list of distinct integers. Picks a subset of the integers A in the same order, i.e. a subsequence, with the property that % it is monotonically increasing, and 7 it is at least as long as any other such subsequence. "This function uses patience sort:   -http://en.wikipedia.org/wiki/Patience_sorting. H For implementation reasons, the actual list returned is the reverse of  the subsequence. FYou can pair each integer with an arbitrary annotation, which will be  carried through the algorithm. 3The difference between two lists, according to the  " patience diff" algorithm. The character '-' or '+' or ' ' for  or  or  respectively. The value from an . For , returns the "old" value.          patience-0.1.1Data.Algorithm.PatienceItemBothNewOldlongestIncreasingdiffitemChar itemValuePieceDiffMatchCardadjMoveuniquesolveLCSchopzipLSnumber $fFunctorItem