Specs/8/5/4/MDCDamerauLevenshtein/0.1.0/MDCDamerauLevenshtein.podspec.json

   1 {
   2   "name": "MDCDamerauLevenshtein",
   3   "version": "0.1.0",
   4   "summary": "Categories to calculate the edit distance between NSString objects.",
   5   "description": "                   MDCDamerauLevenshtein includes two algorithms for calculating\n                   the edit distance between NSString objects:\n\n                   1. Levenshtein distance calculates the number of insertions,\n                      deletions, and substitions necessary in order to convert one\n                      string into the other.\n                   2. Damerau-Levenshtein improves upon Levenshtein to include the\n                      transposition of two adjacent characters. Damerau states that\n                      some combination of the four operations make up for 80% of all\n                      human spelling errors.\n\n                   Potential applications for this library:\n\n                   - Don't just use `-[NSString compare:options:]` to filter search results,\n                     display terms with small edit distances.\n                   - ...and many more!\n",
   6   "homepage": "https://github.com/modocache/MDCDamerauLevenshtein",
   7   "license": {
   8     "type": "MIT",
   9     "file": "LICENSE"
  10   },
  11   "authors": {
  12     "modocache": "modocache@gmail.com"
  13   },
  14   "social_media_url": "http://twitter.com/modocache",
  15   "source": {
  16     "git": "https://github.com/modocache/MDCDamerauLevenshtein.git",
  17     "tag": "v0.1.0"
  18   },
  19   "source_files": "MDCDamerauLevenshtein/**/*.{h,m}",
  20   "public_header_files": [
  21     "MDCDamerauLevenshtein/MDCDamerauLevenshtein.h",
  22     "MDCDamerauLevenshtein/Categories/*.h"
  23   ],
  24   "xcconfig": {
  25     "OTHER_LDFLAGS": "-all_load"
  26   },
  27   "requires_arc": true
  28 }