| { |
| "name": "BinarySearchTree", |
| "version": "0.0.1", |
| "summary": "An Objective-c implementation of a Binary Search Tree (BST)", |
| "description": " Implemented from Algorithms, 4th Edition\n To be used in an Objective-c implementation of the Java metazelda dungeon generator.\n", |
| "homepage": "https://github.com/vascoorey/BinarySearchTree-objc", |
| "license": { |
| "type": "MIT", |
| "file": "LICENSE" |
| }, |
| "authors": "Vasco d'Orey", |
| "social_media_url": "http://twitter.com/oppfiz", |
| "requires_arc": true, |
| "source": { |
| "git": "https://github.com/vascoorey/BinarySearchTree-objc.git", |
| "tag": "0.0.1" |
| }, |
| "source_files": [ |
| "BinarySearchTree/Source", |
| "BinarySearchTree/Source/**/*.{h,m}" |
| ] |
| } |
