| { |
| "name": "BinarySearch", |
| "version": "1.0.0", |
| "summary": "Swift module for binary search in sorted collections. Supports searching for existing elements and insertion index.", |
| "description": "Swift module for binary search in sorted collections. Supports searching for existing elements and insertion index. There are additional options to specify if you are searching for the first, last, or any of the matching indexes.", |
| "homepage": "https://github.com/mkeiser/BinarySearch", |
| "license": { |
| "type": "MIT", |
| "file": "LICENSE" |
| }, |
| "authors": { |
| "mkeiser": "matthias@tristan-inc.com" |
| }, |
| "source": { |
| "git": "https://github.com/mkeiser/BinarySearch.git", |
| "tag": "1.0.0" |
| }, |
| "platforms": { |
| "ios": "8.0", |
| "osx": "10.10" |
| }, |
| "source_files": "Sources/*", |
| "pushed_with_swift_version": "3.0" |
| } |
