Specs/a/e/b/AStarSearch/0.1.0/AStarSearch.podspec.json

   1 {
   2   "name": "AStarSearch",
   3   "version": "0.1.0",
   4   "summary": "A* search algorithm",
   5   "description": "A simple algorithm to search for the optimal path between start and end point in the matrix",
   6   "homepage": "https://github.com/kamsebgoralski/AStarSearch",
   7   "license": {
   8     "type": "MIT",
   9     "file": "LICENSE"
  10   },
  11   "authors": {
  12     "Kamil Góralski": "kamsebgoralski@gmail.com"
  13   },
  14   "platforms": {
  15     "ios": "8.0",
  16     "osx": "10.9"
  17   },
  18   "swift_versions": "5.0",
  19   "source": {
  20     "git": "https://github.com/kamsebgoralski/AStarSearch.git",
  21     "tag": "0.1.0"
  22   },
  23   "source_files": "Sources/AStarSearch/*.swift",
  24   "requires_arc": true,
  25   "frameworks": "Foundation",
  26   "testspecs": [
  27     {
  28       "name": "Tests",
  29       "test_type": "unit",
  30       "source_files": "Tests/AStarSearchTests/*.swift"
  31     }
  32   ],
  33   "swift_version": "5.0"
  34 }