| { |
| "name": "SwiftyLevenshtein", |
| "version": "0.0.1", |
| "summary": "Levenshtein distance algorithm written in Swift 2.2. Both a slow and highly optimized version are included.", |
| "homepage": "https://github.com/TheDarkCode/SwiftyLevenshtein", |
| "license": "MIT", |
| "authors": { |
| "Mark Hamilton": "mark@dryverless.com" |
| }, |
| "source": { |
| "git": "https://github.com/TheDarkCode/SwiftyLevenshtein.git", |
| "tag": "0.0.1" |
| }, |
| "social_media_url": "https://twitter.com/dryverless", |
| "platforms": { |
| "ios": "8.0" |
| }, |
| "requires_arc": true, |
| "source_files": "Pod/Classes/**/*" |
| } |
