SwitLCS provides an extension of CollectionType that finds the indexes of the longest common subsequence with another collection.
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences.
The project is based on the Objective-C implementation of NSArray+LongestCommonSubsequence.
CocoaPods is the dependency manager for Swift and Objective-C Cocoa projects. It has over ten thousand libraries and can help you scale your projects elegantly.
Add this to your Podfile:
platform :ios, '8.0'
use_frameworks!
pod 'SwiftLCS'Carthage builds your dependencies and provides you with binary frameworks, but you retain full control over your project structure and setup.
Add this to your Cartfile:
github "Frugghi/SwiftLCS"Include SwiftLCS.swift and SwiftLCS+Foundation.swift (optional) to your project.
let x = "abracadabra"
let y = "yabbadabbadoo"
let z = x.longestCommonSubsequence(y) // abadabalet x = [1, 2, 3, 4, 5, 6, 7]
let y = [8, 9, 2, 10, 4, 11, 6, 12]
let z = x.longestCommonSubsequence(y) // [2, 4, 6]let x = [1, 2, 3, 4, 5, 6, 7]
let y = [8, 9, 2, 10, 4, 11, 6, 12]
let diff = x.diff(y)
// diff.commonIndexes: [1, 3, 5]
// diff.addedIndexes: [0, 1, 3, 5, 7]
// diff.removedIndexes: [0, 2, 4, 6]The API documentation is available here.
SwiftLCS is released under the MIT license. See LICENSE for details.